# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548975 | LucaDantas | Arranging Tickets (JOI17_arranging_tickets) | C++17 | 277 ms | 13752 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;
constexpr int maxn = 2e5+10;
struct Itv {
int l, r, qtd; // subtasks 1-4 qtd == 1 so I can ignore it for what I'm going to code
} itv[maxn];
int a[maxn]; // quantos caras precisam passar por cada pos
vector<int> opa[maxn];
bool check(int qtd_mov, int M, int sz) {
vector<int> mov(sz+1);
for(int i = 1; i <= sz; i++)
mov[i] = (a[i] + qtd_mov - M + 1) / 2;
priority_queue<int> q;
vector<int> add_lazy(sz+1);
int usados = 0, lazy = 0;
for(int i = 1; i <= sz; i++) {
for(int x : opa[i])
q.push(x);
lazy += add_lazy[i];
mov[i] += lazy;
while(mov[i] > 0) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |