# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701352 | GusterGoose27 | Arranging Tickets (JOI17_arranging_tickets) | C++11 | 6064 ms | 4948 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;
typedef pair<int, int> pii;
const int MAXN = 2e5;
const int MAXM = 1e5;
int n, m;
int overall[MAXN];
int arr[MAXN];
int req_red[MAXN];
int r_end[MAXN];
vector<int> ranges[MAXN]; // right endpoint, index
int num_req(int target) {
for (int i = 0; i < n; i++) req_red[i] = max(0, arr[i]-target);
fill(r_end, r_end+n, 0);
priority_queue<int> pq;
int sub = 0;
int num = 0;
for (int i: ranges[0]) pq.push(i);
for (int i = 0; i < n; i++) {
if (sub < req_red[i]) {
int r = pq.top();
r_end[r]++;
sub++;
i--;
num++;
continue;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |