| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 85828 | MatesV13 | ZigZag (COCI17_zigzag) | C++11 | 322 ms | 11164 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
	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 ita1 = a.begin();
	set<string>::iterator ita2 = a.begin();
	for (int i=0;i<n;i++){
		cin >> y;
		z = y + "zzzzzzzzzzzzzzzzzzzzzzz";
		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){
				if (ita1 == a.end()) break;
				s.insert(*ita1);
				a.erase(ita1);
				ita1 = a.lower_bound(y);
				ita2 = a.lower_bound(z);
			}
			its1 = s.lower_bound(y);	
		}
		cout << "\n" << *its1;
		a.insert(*its1);
		s.erase(its1);
	}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
