# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077959 | 2024-08-27T11:09:21 Z | Acanikolic | Weighting stones (IZhO11_stones) | C++14 | 1000 ms | 596 KB |
#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; bool does(vector<int>a,vector<int>b) { //does a greater than b if(b.size() == 0) return 1; if(a.size() < b.size()) return 0; sort(a.rbegin(),a.rend()); sort(b.rbegin(),b.rend()); for(int i = 0; i < b.size(); i++) { if(b[i] > a[i]) return 0; } return 1; } 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; if(y == 1) a.pb(x); else b.pb(x); if(does(a,b)) { cout << ">\n"; }else if(does(b,a)) { cout << "<\n"; }else { cout << "?\n"; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 3 ms | 348 KB | Output is correct |
7 | Correct | 10 ms | 460 KB | Output is correct |
8 | Correct | 18 ms | 348 KB | Output is correct |
9 | Correct | 14 ms | 520 KB | Output is correct |
10 | Execution timed out | 1066 ms | 596 KB | Time limit exceeded |
11 | Halted | 0 ms | 0 KB | - |