# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284377 | Alexa2001 | Sushi (JOI16_sushi) | C++17 | 6610 ms | 80228 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;
const int Nmax = 4e5 + 5;
const int B = 650;
priority_queue<int, vector<int>, greater<int>> op[Nmax / B + 5];
priority_queue<int> val[Nmax / B + 5];
int n, q, m;
int a[Nmax];
void init()
{
int i;
for(i=0; i<n; ++i)
val[i / B].push(a[i]);
}
int query1(int x, int y, int w)
{
y = min(y, n-1);
int i, buc = x/B;
for(i=buc*B; i<(buc+1)*B && i<n; ++i)
{
op[buc].push(a[i]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |