# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91030 | Flying_dragon_02 | Cake (CEOI14_cake) | C++14 | 562 ms | 41608 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 N = 250005;
ii it[2][4 * N];
int n, q, a[N], x, cnt, p[15];
vector<ii> vec;
ii compare(ii b, ii c, int type) {
if(b.fi > c.fi) swap(b, c);
if(type == 1) {
if(b.fi == c.fi)
return {b.fi, max(b.se, c.se)};
else
return c;
}
else {
if(b.fi == c.fi)
return {b.fi, min(b.se, c.se)};
# | 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... |