Submission #166210

#TimeUsernameProblemLanguageResultExecution timeMemory
166210DovranWeighting stones (IZhO11_stones)C++11
0 / 100
1074 ms1608 KiB
#include <bits/stdc++.h> #define N 100009 #define pii pair <int, int> #define ff first #define ss second #define pb push_back #define ll long long using namespace std; int n, v[N], c[N]; vector<int>a, b; int r, l; int main(){ cin>>n; for(int i=1; i<=n; i++){ int x, y; cin>>x>>y; if(y==1) a.pb(x), l=max(l, x), v[x]--; else b.pb(x), r=max(r, x), v[x]++; int asd=0; for(int j=n; j>=1; j--){ c[j]=c[j+1]+v[j]; if((c[j]>0 and l>r) or (c[j]<0 and l<r)){ cout<<"?\n", asd=1; break; } } if(asd==0){ if(l>r) cout<<">\n"; else cout<<"<\n"; } for(int j=1; j<=n; j++) c[j]=0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...