oj.uz

Submission #118038

# Submission time Handle Problem Language Result Execution time Memory
118038 2019-06-17T19:18:59 Z baqargam Last supper (IOI12_supper) C++14
0 / 100
 67 ms 7776 KB 
#include<bits/stdc++.h>
#include "advisor.h"
//#include "grader.h"

using namespace std;

void ComputeAdvice(int *C, int n, int k, int m) {//cout<<345;
    int ls[125005],nx[125005];
    priority_queue<pair<int,int> >q;
    int ret[125005],sc[125005];
    for(int i=0;i<=125000;i++){
        ls[i]=1000000000;
        nx[i]=0;
        sc[i]=ret[i]=0;
    }
    for(int i=n-1;i>=0;i--){
        nx[i]=ls[C[i]];
        ls[C[i]]=i;
 //       cout<<nx[i]<<" ";
    }
 //   cout<<endl;
    for(int i=0;i<k;i++){
        q.push({ls[i],i});
        sc[i]=1;
    }
    for(int i=k;i<k+n;i++){//cout<<i<<" "<<C[i-k]<<" "<<sc[C[i-k]]<<endl;
        if(sc[C[i-k]]==1) continue;
        int a=q.top().first;
        int j=q.top().second;
        if(j<k) sc[j]=0; else sc[C[i-k]]=0;
        q.pop();
        sc[C[i-k]]=1;
        ret[j]=1;
        q.push({nx[i-k],i});
//cout<<i<<" "<<nx[i-k]<<" "<<a<<" "<<j<<" "<<q.size()<<endl;
    }
    for(int i=0;i<k+n;i++){
        WriteAdvice(ret[i]);
    }
}

#include<bits/stdc++.h>
#include "assistant.h"
//#include "grader.h"

using namespace std;

void Assist(unsigned char *A, int n, int k, int r) {
    int sc[200005];
    queue<int>q;
    for(int i=0;i<n;i++){
        sc[i]=0;
    }
    for(int i=0;i<k;i++){
        if((int)A[i]==1) {q.push(i);}
        sc[i]=1;
    }
    for(int i=0;i<n;i++){
        int a=GetRequest();
        if(sc[a]==0)
        {
            PutBack(q.front());
            sc[q.front()]=0;
            q.pop();
            sc[a]=1;
        }
        if((int)A[i+k]==1) {q.push(a);}
    }


}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:28:13: warning: unused variable 'a' [-Wunused-variable]
         int a=q.top().first;
             ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4608 KB Output is correct
2 Incorrect 5 ms 4608 KB Error - Putting back a color that is not on the scaffold
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 5120 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 6840 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4608 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 64 ms 7336 KB Error - Putting back a color that is not on the scaffold
2 Incorrect 65 ms 7512 KB Error - Putting back a color that is not on the scaffold
3 Incorrect 65 ms 7520 KB Error - Putting back a color that is not on the scaffold
4 Incorrect 66 ms 7776 KB Error - Putting back a color that is not on the scaffold
5 Incorrect 65 ms 7520 KB Error - Putting back a color that is not on the scaffold
6 Incorrect 65 ms 7464 KB Error - Putting back a color that is not on the scaffold
7 Incorrect 65 ms 7520 KB Error - Putting back a color that is not on the scaffold
8 Incorrect 66 ms 7520 KB Error - Putting back a color that is not on the scaffold
9 Incorrect 67 ms 7520 KB Error - Putting back a color that is not on the scaffold
10 Incorrect 67 ms 7520 KB Error - Putting back a color that is not on the scaffold