oj.uz

답안 #1022793

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022793 2024-07-14T05:20:38 Z boyliguanhan 최후의 만찬 (IOI12_supper) C++17
0 / 100
 186 ms 11116 KB 
#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;
bitset<500100>onf;
void RADV(int y,int bt){
    for(int i=0;i<bt;i++)
        WriteAdvice(y>>i&1);
}
void ComputeAdvice(int *C, int N, int K, int M) {
    vector<int>nxt(N),lst(N,N),plat(K);
    iota(plat.begin(),plat.end(),0);
    C[N]=N;
    for(int i=N;i--;)
        nxt[i]=lst[C[i]],
        lst[C[i]]=i;
    set<pair<int,int>> st;
    for(auto i:plat)onf[i]=1,
        st.insert({lst[i],i});
    int df=log2(2*K-1);
    for(int i=0;i<N;i++){
        if(onf[C[i]])continue;
        onf[C[i]]=1;
        auto[x,y]=*--st.end();
        st.erase({x,y});
        st.insert({nxt[i],y});
        onf[C[x]]=0;
        RADV(y,df);
    }
}

#include "assistant.h"
#include<bits/stdc++.h>
using namespace std;
bitset<500100>on;
void Assist(unsigned char *A, int N, int K, int R) {
    vector<int>platter(K);
    iota(platter.begin(),platter.end(),0);
    for(auto i:platter)on[i]=1;
    int C=0,yy=log2(2*K-1);
    for(int i=0;i<N;i++){
        int x=GetRequest();
        if(on[x]) continue;
        int k=0;
        for(int c=0;c<yy;c++)
            k+=A[c+C]<<c;
        C+=yy;
        PutBack(platter[k]);
        on[platter[k]]=0;
        platter[k]=x;
        on[x]=1;
    }

}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 792 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 186 ms 10856 KB Output isn't correct - not an optimal way
2 Incorrect 130 ms 10656 KB Output isn't correct - not an optimal way
3 Incorrect 139 ms 10596 KB Output isn't correct - not an optimal way
4 Incorrect 153 ms 10568 KB Output isn't correct - not an optimal way
5 Incorrect 129 ms 10576 KB Output isn't correct - not an optimal way
6 Incorrect 166 ms 10372 KB Output isn't correct - not an optimal way
7 Incorrect 185 ms 10532 KB Output isn't correct - not an optimal way
8 Incorrect 166 ms 10584 KB Output isn't correct - not an optimal way
9 Incorrect 162 ms 10500 KB Output isn't correct - not an optimal way
10 Correct 185 ms 11116 KB Output is partially correct - 1117620 bits used