# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87048 | abil | Weighting stones (IZhO11_stones) | C++14 | 1062 ms | 1004 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.
/**
Solution by Abil
**/
#include <bits/stdc++.h>
using namespace std;
vector<int > v1,v2;
vector<int > :: iterator it;
int fun(int qw){
int f = 1,in = 0;
for(int i = 0;i < v1.size(); i++){
while(in < v2.size() && v2[in] < v1[i]){
in++;
}
if(in >= v2.size()){
f = 0;
break;
}
in++;
}
if(f){
return 2;
}
f = 1;
in = 0;
for(int i = 0;i < v2.size(); i++){
while(in < v1.size() && v1[in] < v2[i]){
in++;
}
if(in >= v1.size()){
f = 0;
break;
}
in++;
}
if(f){
return 1;
}
else{
return 0;
}
}
int main()
{
int n,ans1 = 0,ans2 = 0;
cin >> n;
int ves,dir;
while(n--){
cin >> ves >> dir;
if(dir == 1){
if(v1.size() > 0){
it = lower_bound(v1.begin(),v1.end(),ves);
v1.insert(it,ves);
}
else{
v1.push_back(ves);
}
}
else{
if(v2.size() > 0){
it = lower_bound(v2.begin(),v2.end(),ves);
v2.insert(it,ves);
}
else{
v2.push_back(ves);
}
}
int f = fun(1);
if(f == 0){
cout << "?" << endl;
}
else
if(f == 1){
cout << ">" << endl;
}
else{
cout << "<" << endl;
}
}
}
/*
7
1 1
2 2
3 1
4 2
5 1
6 2
7 1
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |