Submission #1023040

#TimeUsernameProblemLanguageResultExecution timeMemory
1023040boyliguanhanLast supper (IOI12_supper)C++17
0 / 100
103 ms7892 KiB
#include "advisor.h" #include<bits/stdc++.h> using namespace std; bitset<500100>onf; void ComputeAdvice(int *C, int N, int K, int M) { vector<int>nxt(N),lst(N,N),plat(K),dead(N+K,N-1); iota(plat.begin(),plat.end(),0); C[N]=N+5; for(int i=N;i--;) nxt[i]=lst[C[i]], lst[C[i]]=i; set<pair<int,int>> st; for(auto i:plat)onf[i]=1, st.insert({lst[i],i+N}); int df=log2(2*K-1); for(int i=0;i<N;i++){ if(onf[C[i]]){ auto [x,y]=*st.lower_bound({i,0}); st.erase({x,y}); st.insert({nxt[i],y}); continue; } onf[C[i]]=1; auto[x,y]=*--st.end(); dead[y]=i; st.erase({x,y}); st.insert({nxt[i],i}); onf[C[x]]=0; } for(int i=0;i<K;i++) nxt.push_back(lst[i]); for(int i=0;i<N+K;i++) WriteAdvice(dead[i]<nxt[i]); }
#include "assistant.h" #include<bits/stdc++.h> using namespace std; bitset<500100>on; void Assist(unsigned char *A, int N, int K, int R) { set<int>passive; for(int i=0;i<K;on[i]=1,i++) if(A[N+i]) passive.insert(i); for(int i=0;i<N;i++){ int x=GetRequest(); if(on[x]) { if(A[i]) passive.insert(x); continue; } int die=*passive.begin(); PutBack(die); on[die]=0;on[x]=1; passive.erase(die); if(A[i])passive.insert(x); } }

Compilation message (stderr)

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:15:9: warning: unused variable 'df' [-Wunused-variable]
   15 |     int df=log2(2*K-1);
      |         ^~
#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...