# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340521 | rqi | Trading (IZhO13_trading) | C++14 | 495 ms | 23916 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;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define sz(x) (int)(x).size()
const int MOD = 1e9+7;
const int mx = 300005;
int N, M;
vpi trade[mx];
int curpos = 0;
set<pi> cur;
pi FIRST(){
assert(sz(cur));
return *(cur.begin());
}
void inc(){
curpos++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |