# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67351 | WA_TLE | Last supper (IOI12_supper) | C++14 | 227 ms | 37416 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<vector>
#include<algorithm>
#include<queue>
#include<deque>
#define pub push_back
#define pob pop_back
#define mp make_pair
#define sec second
using namespace std;
//#include"grader.cpp"
const int mod=1e9+7;
//void WriteAdvice(unsigned char a) {};
#include"advisor.h"
void ComputeAdvice(int *C, int N, int K, int M) {
static bool kta[200000]={};
int i,j;
priority_queue<pair<int,int>>que;
//次いる日、入れたときの番号
vector<vector<int>>need(N);
for(i=0;i<N;i++){need[i].pub(mod);}
for(i=N-1;i>=0;i--){need[C[i]].pub(i);}
static bool tna[100000]={};
for(i=0;i<K;i++){que.push(mp(need[i].back(),i));tna[i]=1;}
for(i=0;i<N;i++){
int use=C[i];
need[use].pob();
if(!tna[use]){
pair<int,int> ksu;
while(-1){
ksu=que.top();que.pop();
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... |