# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
203365 | Noam527 | Cake 3 (JOI19_cake3) | C++17 | 3394 ms | 15100 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>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 4e18;
const int OO = 0;
const int OOO = 1;
using namespace std;
struct order {
int m, newtime;
ll sum;
set<pair<int, int>> s;
set<pair<int, int>>::iterator it;
int stores;
order() {}
order(int M) {
m = M;
newtime = 0;
sum = -1;
s.insert({ -1, newtime++ });
it = s.begin();
stores = 1;
}
void fix() {
while (stores < m) {
if (it == s.begin()) break;
--it;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |