# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
802855 | thimote75 | Worst Reporter 4 (JOI21_worst_reporter4) | C++14 | 2059 ms | 84744 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 int long long
using namespace std;
using Point = pair<int, int>;
using idata = vector<int>;
struct Treap {
vector<Point> points;
void insert( Point point ) {
points.push_back(point);
}
int query (int x) {
int res = 0;
for (Point &point : points) if (x >= point.first) res += point.second;
return res;
}
void chmin (int until) {
sort(points.begin(), points.end());
int res = 0;
int idx = 0;
int lp = -1;
for (Point &point : points) {
if (res + point.second > until) {
idx ++;
point.second = until - res;
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... |