Submission #355983

#TimeUsernameProblemLanguageResultExecution timeMemory
355983vaavenWeighting stones (IZhO11_stones)C++14
0 / 100
1 ms364 KiB
#include <iostream> #include <vector> #include <algorithm> #include <iomanip> #include <tuple> #include <math.h> #include <set> #include <stack> #include <bitset> #include <map> #include <cassert> #include <queue> #include <random> #include <unordered_set> #include <unordered_map> #define pqueue priority_queue #define pb(x) push_back(x) // #define endl '\n' #define all(x) x.begin(), x.end() #define int long long using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector<int> vi; typedef vector<vector<int> > vvi; // typedef tuple<ll, ll, ll> tiii; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef vector<bool> vb; typedef vector<string> vs; typedef vector<char> vc; const int inf = 1e9 + 228; const ll mod = 1e9 + 7; const ll mod2 = 998244353; const ld eps = 1e-5; void fast_io(){ ios_base::sync_with_stdio(0); cin.tie(0); // freopen("stones.in", "r", stdin); // freopen("stones.out", "w", stdout); } void solve(){ int n; cin >> n; int a, b; a = b = 0; for(int i=0; i<n; i++){ int t, k; cin >> t >> k; if(k == 1){ a += t; } else{ b += t; } if(a > b){ cout << ">" << endl; } else if(a < b){ cout << "<" << endl; } else{ cout << "?" << endl; } } } signed main(){ fast_io(); // srand(time(NULL)); cout << fixed; int q = 1; while(q--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...