# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85192 | 2018-11-18T21:26:51 Z | MatesV13 | ZigZag (COCI17_zigzag) | C++11 | 199 ms | 16084 KB |
#include <bits/stdc++.h> using namespace std; long long k, n; set<string> s, a; string x, y, z; int main (){ //ios::sync_with_stdio(0); //cin.tie(0); a.insert("A"); cin >> k >> n; for (int i=0;i<k;i++){ cin >> x; s.insert(x); } set<string>::iterator its1 = s.begin(); set<string>::iterator its2 = s.begin(); set<string>::iterator its3 = s.begin(); set<string>::iterator ita1 = a.begin(); set<string>::iterator ita2 = a.begin(); set<string>::iterator ita3 = a.begin(); for (int i=0;i<n;i++){ cin >> y; z = y + "zzzzzzzzzzzzzzzzzzzz"; its1 = s.lower_bound(y); its2 = s.lower_bound(z); if (its1 == its2){ ita1 = a.lower_bound(y); ita2 = a.lower_bound(z); while (ita1 != ita2){ ita3 = a.begin(); for (int j=0;j<a.size();j++){ cout << *ita3 << " "; ita3++; } ita1 = a.lower_bound(y); if (ita1 == a.end()) break; s.insert(*ita1); a.erase(ita1); } its1 = s.lower_bound(y); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 256 KB | Output isn't correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Incorrect | 3 ms | 456 KB | Output isn't correct |
4 | Incorrect | 2 ms | 484 KB | Output isn't correct |
5 | Incorrect | 3 ms | 620 KB | Output isn't correct |
6 | Incorrect | 2 ms | 620 KB | Output isn't correct |
7 | Incorrect | 197 ms | 11224 KB | Output isn't correct |
8 | Incorrect | 199 ms | 12816 KB | Output isn't correct |
9 | Incorrect | 198 ms | 14424 KB | Output isn't correct |
10 | Incorrect | 196 ms | 16084 KB | Output isn't correct |