Submission #70076

#	Time	Username	Problem	Language	Result	Execution time	Memory
70076		Abelyan	Last supper (IOI12_supper)	C++17	0 / 100	103 ms	7056 KiB

advisor

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

const int N=100006;
int a[N],han[N],mp[N];
bool pas[N],sc[N];

void ComputeAdvice(int *c, int n, int k, int m) {
    for (int i=n-1;i>=0;i--){
        a[i]=mp[c[i]]-1;
        if (mp[c[i]]==0)a[i]=2*n;
        mp[c[i]]=i+1;
    }
    priority_queue<pair<int,int> > pq;
    for (int i=0;i<k;i++){
        if (mp[i]==0)mp[i]=2*N;
        pq.push({mp[i]-1,i});
        sc[i]=true;
    }
    for (int i=0;i<n;i++){\
        if (sc[c[i]]){
            han[i]=-1;
            continue;
        }
        sc[c[i]]=true;
        han[i]=pq.top().second;
        sc[pq.top().second]=false;
        pq.pop();
        pq.push({a[i],c[i]});
    }
    vector<int> v;
    for (int i=n-1;i>=0;i--){
        if (pas[c[i]])v.push_back(1);
        else v.push_back(0);
        if (han[i]!=-1)
        pas[han[i]]=false;
        pas[c[i]]=true;
    }
    for (int i=k-1;i>=0;i--){
        if (pas[i])v.push_back(1);
        else v.push_back(0);
    }
    reverse(v.begin(),v.end());
    for (int i=0;i<v.size();i++){
        WriteAdvice(v[i]);
    }
}

assistant

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

const int N=100006;
queue<int> s;
bool onsc[N];

void Assist(unsigned char *A, int n, int k, int R) {
    for (int i=0;i<k;i++){
        if (!A[i])s.push(i);
        onsc[i]=true;
    }
    for (int i=0;i<n;i++){
        int k=GetRequest();
        if (onsc[k])continue;
        onsc[k]=true;
        PutBack(s.front());
        onsc[s.front()]=false;
        s.pop();
        if (!A[i+k])s.push(k);
    }
}

Compilation message (stderr)

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:45:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v.size();i++){
                  ~^~~~~~~~~

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