Submission #1017910

#TimeUsernameProblemLanguageResultExecution timeMemory
1017910NintsiChkhaidzeLast supper (IOI12_supper)C++17
0 / 100
54 ms97872 KiB
#include <bits/stdc++.h> #include "advisor.h" 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 = 19; j >= 0; j--){ if (((x >> j) & 1)) WriteAdvice(1); else WriteAdvice(0); } } }
#include <bits/stdc++.h> #include "assistant.h" using namespace std; const int MM = 2e6 + 5; int CC[MM]; bool on[MM]; set <int> st[MM]; void Assist(unsigned char *A, int N, int K, int R) { int id=0; for (int i = 0; i < R; i += 20){ for (int j = i; j <= i + 19; j++){ if (A[j] == 1) CC[id] |= (1<<(19-(j-i))); } id+=1; } /* cout<<"Here"<<endl; for (int i=0;i<id;i++) cout<<CC[i]<<" "; cout<<endl;*/ for (int i=id-1;i>=0;i--){ st[CC[i]].insert(i); } set <pair<int,int> > stt; for (int i=0;i<K;i++){ on[i] = 1; int val = 0; if (!st[i].size()) val=1e9; else val=*st[i].begin(); stt.insert({val,i}); } int i; for (i = 0; i < N; i++) { int req = GetRequest(); if (on[req]) continue; int idx=(--stt.end())->second; PutBack(idx); on[idx] = 0; stt.erase(--stt.end()); on[req] = 1; while (st[req].size() && *st[req].begin() <= i){ st[req].erase(st[req].begin()); } int val = 0; if (!st[req].size()) val=1e9; else val=*st[req].begin(); stt.insert({val,req}); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...