Submission #2414656
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main() { cin.tie(0); ios::sync_with_stdio(false); string s, t; cin >> s >> t; sort(s.begin(), s.end()); sort(t.begin(), t.end()); bool found_alternative = false; for (int i = 0; i < s.length() && i < t.length(); ++i) { if (s[i] > t[i] && s.length() == t.length()) { found_alternative = false; for (int j = 0; j < t.length(); ++j) { if (t[j] >= s[i] && j > i) { found_alternative = true; break; } } if (!found_alternative) { cout << "No" << endl; return 0; } } } if (s.length() <= t.length() || found_alternative) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Two Anagrams |
User | seri_k |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1019 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | WA | 1 ms | 256 KB |
0_02.txt | WA | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | WA | 1 ms | 256 KB |
1_00.txt | WA | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | WA | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | WA | 1 ms | 256 KB |