# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337591 | beksultan04 | Weighting stones (IZhO11_stones) | C++14 | 0 ms | 364 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;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
vector <int> v[3];
main(){
int n,i,j,l=0,a=0,b=0,r=0;
scan1(n)
for (i=0;i<n;++i){
int x,y;
scan2(x,y)
if (y == 1){
l+=x;
a+=100000+x;
}
else {
r+=x;
b+=100000+x;
}
if (l == r || a == b || l > r && b > a || r > l && a > b){
cout <<"?\n";
}
else if (r > l){
cout <<"<\n";
}
else cout <<">\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |