Submission #632714

#	Time	Username	Problem	Language	Result	Execution time	Memory
632714		Iwanttobreakfree	Last supper (IOI12_supper)	C++17	0 / 100	36 ms	2840 KiB

advisor

//#include "assistant.h"
#include "advisor.h"
#include <vector>
#include <set>
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
    for(int i=0;i<N;i++){
        int x=C[i];
        for(int j=0;j<20;j++){
            if(x&1)WriteAdvice(1);
            else WriteAdvice(0);
            x/=2;
        }
    }
}
/*void Assist(unsigned char *A, int N, int K, int R) {
      vector<int> V(N),cnt(N);
      set<int> S;
      set<pair<int,int>> M;
      for(int i=0;i<K;i++)S.insert(i);
      for(int i=0;i<N*20;i+=20){
        for(int j=19;j>=0;j--){
            V[i]*=2;
            V[i]+=A[i+j];
        }
      }
      vector<vector<int>> needed(N,vector<int>());
      for(int i=0;i<N;i++)needed[i].push_back(N);
      for(int i=N-1;i>=0;i++)needed[V[i]].push_back(i);
      for(int i=0;i<K;i++){
        M.insert({-needed[i].back(),i});
      }
      for(int i=0;i<N;i++)cnt[i]=needed[i].size()-1;
      for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (S.find(req)==S.end()){
            auto it=M.begin();
            S.erase(it->second);
            S.insert(req);
            PutBack(it->second);
            M.erase(it);
            cnt[req]--;
            M.insert({-needed[req][cnt[req]],req});
        }
        else{
            M.erase({-needed[req][cnt[req]],req});
            cnt[req]--;
            M.insert({-needed[req][cnt[req]],req});
        }
      }

}*/

assistant

#include "assistant.h"
//#include "advisor.h"
#include <vector>
#include <set>
using namespace std;
/*void ComputeAdvice(int *C, int N, int K, int M) {
    for(int i=0;i<N;i++){
        int x=C[i];
        for(int j=0;j<20;j++){
            if(x&1)WriteAdvice(1);
            else WriteAdvice(0);
            x/=2;
        }
    }
}*/
void Assist(unsigned char *A, int N, int K, int R) {
      vector<int> V(N),cnt(N);
      set<int> S;
      set<pair<int,int>> M;
      for(int i=0;i<K;i++)S.insert(i);
      for(int i=0;i<N*20;i+=20){
        for(int j=19;j>=0;j--){
            V[i]*=2;
            V[i]+=A[i+j];
        }
      }
      vector<vector<int>> needed(N,vector<int>());
      for(int i=0;i<N;i++)needed[i].push_back(N);
      for(int i=N-1;i>=0;i++)needed[V[i]].push_back(i);
      for(int i=0;i<K;i++){
        M.insert({-needed[i].back(),i});
      }
      for(int i=0;i<N;i++)cnt[i]=needed[i].size()-1;
      for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (S.find(req)==S.end()){
            auto it=M.begin();
            S.erase(it->second);
            S.insert(req);
            PutBack(it->second);
            M.erase(it);
            cnt[req]--;
            M.insert({-needed[req][cnt[req]],req});
        }
        else{
            M.erase({-needed[req][cnt[req]],req});
            cnt[req]--;
            M.insert({-needed[req][cnt[req]],req});
        }
      }

}

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