# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526253 | Aktan | Weighting stones (IZhO11_stones) | C++14 | 1 ms | 312 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define ft first
#define sc second
const int mod=1e9+7,INF=1e17;
main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,l=0,ml=0,mr=0,r=0;
cin >> n;
for(int i=1;i<=n;i++){
int a,b;
cin >> a >> b;
if(b==1){
l+=a;
ml=max(ml,a);
}
else{
r+=a;
mr=max(mr,a);
}
if(l>r && ml>mr){
cout << ">" << "\n";
}
else if(l<r && mr>ml){
cout << "<" << "\n";
}
else{
cout << "?\n";
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |