# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882167 | Mr_Husanboy | Weighting stones (IZhO11_stones) | C++17 | 1048 ms | 1056 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>
using namespace std;
#ifdef LOCAL
#include "debugger.cpp"
#else
#define debug(...)
#endif
template<class T>
int len(T &a){
return a.size();
}
using ll = long long;
using pii = pair<int,int>;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
string fileio = "";
mt19937 mt(time(nullptr));
const int mod = 1e9 + 7;
const int inf = 1e9;
const ll infl = 1e18;
const int maxn = 1e5 + 1;
void solve(){
int n; cin >> n;
vector<int> lef, rig;
for(int i = 0; i < n; i ++){
int l, r; cin >> l >> r;
if(r == 1){
lef.push_back(l);
}else{
rig.push_back(l);
}
if(lef.empty()){
cout << "<\n"; continue;
}
vector<int> cnt(2);
sort(all(lef)); sort(all(rig));
int sl = len(lef), sr = len(rig);
while(sl && sr){
sl --; sr --;
cnt[rig[sr] > lef[sl]] ++;
}
debug(cnt);
cout << (cnt[0] == 0 && sl == 0 ? "<" : cnt[1] == 0 && sr == 0 ? ">" : "?") << '\n';
}
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
auto start = chrono::high_resolution_clock::now();
#ifndef LOCAL
if(fileio.size()){
freopen((fileio + ".in").c_str(), "r", stdin);
freopen((fileio + ".out").c_str(), "w", stdout);
}
#endif
int testcases = 1;
#ifdef Tests
cin >> testcases;
#endif
while(testcases --){
solve();
cout << '\n';
#ifdef LOCAL
cout << "_________________________" << endl;
#endif
}
#ifdef LOCAL
auto duration = chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - start);
cout << "time: " << (double)duration.count()/1000.0 << " milliseconds" << endl;
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |