제출 #287100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287100		Kastanda	Last supper (IOI12_supper)	C++11	100 / 100	230 ms	8436 KiB

advisor

// M
#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;
void ComputeAdvice(int * C, int n, int k, int m)
{
        vector < int > Last(n, n), Nxt(n, n);
        for (int i = n - 1; i >= 0; i --)
                Nxt[i] = Last[C[i]], Last[C[i]] = i;
        set < pair < int , int > > ST;
        for (int i = 0; i < k; i ++)
                ST.insert({-Last[i], i});
        vector < int > M(n, 0);
        for (int i = 0; i < n; i ++)
        {
                if (ST.count({-i, C[i]}))
                {
                        ST.erase({-i, C[i]});
                        ST.insert({-Nxt[i], C[i]});
                        continue;
                }
                M[i] = 1;
                ST.erase(ST.begin());
                ST.insert({-Nxt[i], C[i]});
        }
        for (int i = 0; i < k; i ++)
                WriteAdvice(Last[i] < n && !M[Last[i]]);
        for (int i = 0; i < n; i ++)
                WriteAdvice(Nxt[i] < n && !M[Nxt[i]]);
        return ;
}

assistant

// M
#include<bits/stdc++.h>
#include "assistant.h"
using namespace std;
void Assist(unsigned char * A, int n, int k, int len)
{
        set < int > D, S;
        for (int i = 0; i < k; i ++)
        {
                if (A[i] == 1)
                        S.insert(i);
                else
                        D.insert(i);
        }
        for (int i = 0; i < n; i ++)
        {
                int c = GetRequest();
                if (S.count(c))
                {
                        S.erase(c);
                        if (A[k + i] == 1)
                                S.insert(c);
                        else
                                D.insert(c);
                        continue;
                }
                assert((int)D.size());
                int a = * D.begin();
                D.erase(D.begin());
                PutBack(a);
                if (A[k + i] == 1)
                        S.insert(c);
                else
                        D.insert(c);
        }
}

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