# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415974 | iulia2100 | Cake 3 (JOI19_cake3) | C++14 | 4038 ms | 139644 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 <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
//ifstream cin ("idk.in");
//ofstream cout ("idk.out");
const int N = 2e5 + 5;
int n, m;
struct idk {
long long v, c;
} v[N];
bool cmp(idk x, idk y) {
return x.c < y.c;
}
namespace segment_tree {
struct nod {
vector <long long> val, sp;
} a[4 * N];
vector <int> noduri;
int start;
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... |