# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672939 | Alihan_8 | Weighting stones (IZhO11_stones) | C++17 | 1075 ms | 2428 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;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q; cin >> q;
set <int> L, R;
auto ins = [&](int x, int s){
if ( s == 1 ) L.insert(x);
else R.insert(x);
};
auto ok = [&](){
auto l = prev(R.end()), r = prev(L.end());
swap(l, r);
bool flag = true;
while ( true ){
if ( *l > *r ){
flag = false;
break;
}
if ( l == L.begin() ) break;
if ( r == R.begin() ){
flag = false;
break;
}
l = prev(l), r = prev(r);
}
return flag;
};
while ( q-- ){
int x, s; cin >> x >> s;
ins(x, s);
if ( R.empty() ) cout << ">\n";
else if ( L.empty() ) cout << "<\n";
else if ( *R.rbegin() > *L.rbegin() ){
if ( ok() ) cout << "<\n";
else cout << "?\n";
}
else{
swap(L, R);
if ( ok() ) cout << ">\n";
else cout << "?\n";
swap(L, R);
}
}
cout << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |