oj.uz

답안 #118035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118035 2019-06-17T18:30:36 Z baqargam 최후의 만찬 (IOI12_supper) C++14
0 / 100
 75 ms 5968 KB 
#include<bits/stdc++.h>
#include "advisor.h"
//#include "grader.h"

using namespace std;

void ComputeAdvice(int *C, int n, int k, int m) {
    int ls[100005],nx[100005];
    priority_queue<pair<int,int> >q;
    vector<pair<int,int> >ret;
    for(int i=0;i<n;i++){
        ls[i]=1000000000;
        nx[i]=0;
    }
    for(int i=n-1;i>=0;i--){
        nx[i]=ls[C[i]];
        ls[C[i]]=i;
    }
    for(int i=0;i<k;i++){
        q.push({ls[i],i});
    }
    for(int i=k;i<=n;i++){
        int a=q.top().first;
        int j=q.top().second;
        q.pop();
        ret.push_back({j,1});
        q.push({nx[C[i-k]],i});
    }
    sort(ret.begin(),ret.end());
    for(int i=0;i<k+n;i++){
        WriteAdvice(ret[i].second);
    }
}

#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[100005];
    queue<int>q;
    for(int i=0;i<n;i++){
        sc[i]=0;
    }
    for(int i=0;i<k;i++){
        if(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(A[i]==1) q.push(a);
    }


}

Compilation message

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

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 872 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 25 ms 3952 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1132 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 5600 KB Error - Putting back a color that is not on the scaffold
2 Incorrect 68 ms 5616 KB Error - Putting back a color that is not on the scaffold
3 Incorrect 69 ms 5968 KB Error - Putting back a color that is not on the scaffold
4 Incorrect 71 ms 5856 KB Error - Putting back a color that is not on the scaffold
5 Incorrect 69 ms 5872 KB Error - Putting back a color that is not on the scaffold
6 Incorrect 68 ms 5560 KB Error - Putting back a color that is not on the scaffold
7 Incorrect 68 ms 5696 KB Error - Putting back a color that is not on the scaffold
8 Incorrect 69 ms 5600 KB Error - Putting back a color that is not on the scaffold
9 Incorrect 72 ms 5856 KB Error - Putting back a color that is not on the scaffold
10 Incorrect 75 ms 5800 KB Error - Putting back a color that is not on the scaffold