Submission #871771

#	Time	Username	Problem	Language	Result	Execution time	Memory
871771		Matjaz	Last supper (IOI12_supper)	C++14	8 / 100	1218 ms	141572 KiB

advisor

#include "advisor.h"

#include<set>
#include<queue>
#include<vector>
#include<assert.h>

using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
    
    set<int> scafold;
    for (int i=0;i<K;i++) scafold.insert(i);
    
    vector<queue<int> > Q(N);
    vector<queue<int> > returns(N);
    vector<int> takeback(N, -1);

    for (int i=0;i<N;i++) Q[C[i]].push(i);
    for (int i=0;i<N;i++) Q[i].push(N);

    priority_queue<pair<int,int> > next_use;
    for (int i=0;i<K;i++) next_use.push(make_pair(Q[i].front(), i));

    
    for (int i=0;i<N;i++){
        assert(Q[C[i]].front() == i);
        Q[C[i]].pop();
        if (scafold.count(C[i]) > 0) {
            next_use.push(make_pair(Q[C[i]].front(), C[i]));
            continue;
        }
            
        while (true){
            if (scafold.count(next_use.top().second) == 0){
                next_use.pop();
                continue;
            }
            assert(next_use.top().first > i);
            break;
        }



        if (K <= 5000){
            for (set<int>::iterator it = scafold.begin(); it != scafold.end(); it++){
                assert(Q[*it].front() <= next_use.top().first);
            }

        }

        int bestcolour = next_use.top().second;
        next_use.pop();

        scafold.erase(bestcolour);
        scafold.insert(C[i]);
        next_use.push(make_pair(Q[C[i]].front(),C[i]));
        returns[bestcolour].push(i);
        takeback[i] = bestcolour;
    }

    Q.assign(N, queue<int> ());
    for (int i=0;i<N;i++) Q[C[i]].push(i);
    for (int i=0;i<N;i++) Q[i].push(N);

    for (int i=0;i<K;i++){
        if (Q[i].empty()){
            WriteAdvice(0);
            continue;
        }
        
        if (returns[i].empty()){
            WriteAdvice(1);
            continue;
        }
            
        if (Q[i].front() <= returns[i].front()){
            WriteAdvice(1);
        } else WriteAdvice(0);

    }
    
        
    for (int i=0;i<N;i++){
        assert(Q[C[i]].front() == i);
        Q[C[i]].pop();
        if (Q[C[i]].empty()){
            WriteAdvice(0);
            continue;
        }
        if (returns[C[i]].empty()){
            WriteAdvice(1);
            continue;
        }

        if (Q[C[i]].front() <= returns[C[i]].front()){
            WriteAdvice(1);
        } else WriteAdvice(0);

        if (takeback[i] != -1) returns[takeback[i]].pop();
    }
    
}

assistant

#include "assistant.h"


#include<queue>
#include<set>
#include<assert.h>

using namespace std;




void Assist(unsigned char *A, int N, int K, int R) {

    assert(R == N + K);
    
    set<int> expendable,scafold;
    for (int i=0;i<K;i++) if (A[i] == 0) expendable.insert(i);
    for (int i=0;i<K;i++) scafold.insert(i);
    
    for (int i=0;i<N;i++){
        int req = GetRequest();
        
        if (scafold.count(req) > 0){
            if (A[K + i] == 0) expendable.insert(req);
            continue;
        }
        assert(expendable.size() > 0);
        PutBack(*expendable.begin());
        scafold.erase(*expendable.begin());
        expendable.erase(*expendable.begin());
        scafold.insert(req);
        if (A[K + i] == 0) expendable.insert(req);
    }
}

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