Submission #153997

#	Time	Username	Problem	Language	Result	Execution time	Memory
153997		stefdasca	Last supper (IOI12_supper)	C++14	0 / 100	206 ms	9600 KiB

advisor

#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;

void ComputeAdvice(int *C, int N, int K, int M)
{
    int frq[100002];
    memset(frq, 0, sizeof(frq));
    for(int i = 0; i < N; ++i)
        frq[C[i]]++;
    for(int i = 0; i < N; ++i)
    {
        for(int j = 1; j <= frq[i]; ++j)
            WriteAdvice(0);
        WriteAdvice(1);
    }
}

assistant

#include<bits/stdc++.h>
#include "assistant.h"
using namespace std;

void Assist(unsigned char *A, int N, int K, int R)
{
    int frq[100002];
    memset(frq, 0, sizeof(frq));
    int poz = 0;
    for(int i = 0; i < R; ++i)
    {
        if(A[i] == '1')
            ++poz;
        else
            ++frq[poz];
    }
    bool is[100002];
    memset(is, 0, sizeof(is));
    set<pair<int, int> >frq1;
    set<pair<int, int> >frq2;
    for(int i = 0; i < K; ++i)
        frq1.insert({frq[i], i}), is[i] = 1;
    for(int i = 0; i < N; ++i)
    {
        int color = GetRequest();
        if(!is[color])
        {
            pair<int, int> p = *frq1.begin();
            frq1.erase(p);
            PutBack(p.second);
            is[p.second] = 0;
            is[color] = 1;
            frq2.insert(p);
            frq1.insert({frq[color], color});
            frq2.erase({frq[color], color});
        }
        frq1.erase({frq[color], color});
        --frq[color];
        frq1.insert({frq[color], color});
    }
}

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