# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86991 | abil | Weighting stones (IZhO11_stones) | C++14 | 3 ms | 256 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;
const int N = 300000 + 12;
int x[N],y[N];
map<int,int > mpx,mpy;
int main()
{
int n,ans1 = 0,ans2 = 0;
cin >> n;
int ves,dir;
while(n--){
cin >> ves >> dir;
if(dir == 1){
ans1 += ves;
}
else{
ans2 += ves;
}
if(ans1 == ans2){
cout << "?" << endl;
}
else
if(ans1 > ans2){
cout << ">" << endl;
}
else{
cout << "<" << endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |