# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51772 | model_code | Sushi (JOI16_sushi) | C++17 | 8564 ms | 76036 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<stdio.h>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
#define SIZE 650
int dat[400000];
priority_queue<int>que[650];
priority_queue<int>fl[650];
void resolve(int t)
{
for(int i=0;i<que[t].size();i++)
{
fl[t].push(-dat[i+SIZE*t]);
dat[i+SIZE*t]=-fl[t].top();
fl[t].pop();
}
for(;;)
{
if(fl[t].empty())break;
fl[t].pop();
}
}
void remake(int t)
{
int s=que[t].size();
for(int i=0;i<s;i++)que[t].pop();
for(int i=0;i<s;i++)que[t].push(dat[SIZE*t+i]);
}
int main()
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... |