Submission #1077970

#TimeUsernameProblemLanguageResultExecution timeMemory
1077970AcanikolicWeighting stones (IZhO11_stones)C++14
0 / 100
1029 ms1104 KiB
#include <bits/stdc++.h> #define int long long #define pb push_back #define F first #define S second using namespace std; const int N = 1e5 + 10; const int mod = 1e9 + 7; const int inf = 1e9; int niz[N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int>a,b; for(int i = 1; i <= n; i++) { int x,y; cin >> x >> y; x = n - x + 1; if(y == 1) niz[x]++; else niz[x]--; int s = 0,mn = inf,mx = -inf; for(int j = 0; j < N; j++) { s += niz[j]; mn = min(mn,s); mx = max(mx,s); } if(mn >= 0) { cout << ">\n"; }else if(mx <= 0) { cout << "<\n"; }else { cout << "?\n"; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...