# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
157174 | Flying_dragon_02 | Examination (JOI19_examination) | C++14 | 2192 ms | 157796 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;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
const int inf = 1e9 + 1;
const int N = 1e5 + 5;
vector<int> f[2 * N], bit[2 * N];
vector<pair<int, ii>> Sd;
vector<int> X, Y;
vector<pair<ii, ii>> E;
int n, q, ans[N];
void fakeup(int a, int b) {
int x = lower_bound(X.begin(), X.end(), a) - X.begin();
while(x > 0) {
int y = lower_bound(Y.begin(), Y.end(), b) - Y.begin();
while(y > 0) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |