Submission #848090

#	Time	Username	Problem	Language	Result	Execution time	Memory
848090		urd05	Last supper (IOI12_supper)	C++17	0 / 100	73 ms	5912 KiB

advisor

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

int n,k,m;
bool chk[100000];
int nt[100000];
int pr[100000];

void ComputeAdvice(int *C, int N, int K, int M) {
    n=N;
    k=K;
    m=M;
    int cnt=0;
    memset(pr,-1,sizeof(pr));
    memset(nt,-1,sizeof(nt));
    int ind=n;
    for(int i=0;i<n;i++) {
        if (pr[C[i]]!=-1) {
            nt[pr[C[i]]]=i;
        }
        pr[C[i]]=i;
        if (!chk[C[i]]) {
            chk[C[i]]=true;
            cnt++;
        }
        if (cnt==k) {
            ind=i;
            break;
        }
    }
    for(int i=0;i<k;i++) {
        if (chk[i]) {
            WriteAdvice(1);
        }
        else {
            WriteAdvice(0);
        }
    }
    for(int i=0;i<n;i++) {
        if (nt[i]>ind||nt[i]==-1) {
            chk[C[i]]=false;
            cnt--;
            if (ind!=n) {
                ind++;
                while (ind<n) {
                    if (!chk[C[ind]]) {
                        chk[C[ind]]=true;
                        cnt++;
                    }
                    if (cnt==k) {
                        break;
                    }
                    ind++;
                }
            }
        }
        //printf(".%d\n",chk[C[i]]);
        if (chk[C[i]]) {
            WriteAdvice(1);
        }
        else {
            WriteAdvice(0);
        }
    }
}

assistant

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

bool save[100000];
bool isin[100000];
set<int> s;
int n,k,r;

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

  int i;
  n=N;
  k=K;
  r=R;
  for(int i=0;i<k;i++) {
    isin[i]=true;
    if (A[i]==1) {
        save[i]=true;
    }
    else {
        s.insert(i);
    }
  }
  for (i = 0; i < N; i++) {
    int req = GetRequest();
    if (!isin[req]) {
        int now=*s.begin();
        s.erase(now);
        PutBack(now);
        isin[now]=false;
        isin[req]=true;
    }
    save[req]=(A[i+k]==1);
    s.erase(req);
    if (!save[req]) {
        s.insert(req);
    }
  }

}

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