Submission #1326603

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326603		adiyer	Last supper (IOI12_supper)	C++20	0 / 100	146 ms	9300 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 Assist(unsigned char *A, int N, int K, int R) {
    int id = 0, a[N] = {}, c[N] = {}, val[N] = {};
    vector < int > g[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, val[i] = i;
    for(int i = 0; i < N; i++){
        int opt = 0, mx = 0, ok = 0;
        for(int j = 0; j < K; j++)
            if(g[val[j]].back() > mx)
                mx = g[val[j]].back(), opt = j;
        for(int j = 0; j < K; j++)
            if(a[i] == val[j])
                ok = 1;
        int x = GetRequest();
        if(ok) continue;
        PutBack(val[opt]);
        g[val[opt]].pop_back();
        val[opt] = a[i];
    }   
}

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