# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337528 | beksultan04 | Weighting stones (IZhO11_stones) | C++17 | 1 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;
main(){
int n,i,j,s,t,l1=0,l2=0,r1=0,r2=0;
scan1(n)
while (n--){
scan2(s,t)
if (t == 1){
l1+=s;
r1+=N+s;
}
if (t == 2){
l2 += s;
r2 += N+s;
}
if (l1 < l2 && r1 <= r2)cout <<"<\n";
else if (l1 > l2 && r1 >= r2)cout <<">\n";
else cout <<"?\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |