제출 #1326616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326616		adiyer	최후의 만찬 (IOI12_supper)	C++20	0 / 100	147 ms	10584 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>

using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
    for(int i = 0; i < N; i++){
        for(int bit = 12; bit >= 0; bit--){
            WriteAdvice((C[i] >> bit & 1));
        }
    }
}

assistant

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

using namespace std;

void print(int x){
    cout << "printed " << x << '\n';
}

void Assist(unsigned char *A, int N, int K, int R) {
    vector < int > g[N];
    set < pair < int, int > > st;
    int id = 0, a[N] = {}, c[N] = {}, val[N] = {}, pos[N] = {};
    for(int i = 0; i < N; i++)
        for(int bit = 12; bit >= 0; bit--)
            a[i] |= (A[id++] << bit);
    for(int i = 0; i < N; i++) g[a[i]].push_back(i);
    for(int i = 0; i < N; i++) g[i].push_back(N), reverse(g[i].begin(), g[i].end());
    for(int i = 0; i < K; i++) c[i] = 1, pos[i] = i, val[i] = i, st.insert({g[val[i]].back(), i});
    for(int i = 0; i < N; i++){
        if(i){
            if(c[a[i - 1]]) st.erase({g[a[i - 1]].back(), pos[a[i - 1]]});
            g[a[i - 1]].pop_back();
            if(c[a[i - 1]]) st.insert({g[a[i - 1]].back(), pos[a[i - 1]]});
        }
        GetRequest();
        if(c[a[i]]) continue;
        int x = ((--st.end()) -> second);
        PutBack(val[x]);
        st.erase({g[val[x]].back(), x});
        g[val[x]].pop_back(), c[val[x]] = 0;
        val[x] = a[i], c[val[x]] = 1, pos[val[x]] = x;
        while(g[x].back() < i) g[x].pop_back();
        st.insert({g[val[x]].back(), x});
    }   
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 35
• Subtask 5: 0 / 39