제출 #15636

#제출 시각아이디문제언어결과실행 시간메모리
15636gs14004최후의 만찬 (IOI12_supper)C++14
0 / 100
551 ms19112 KiB
#include "advisor.h" #include <vector> #include <algorithm> #include <set> using namespace std; typedef pair<int,int> pi; set<pi> s; vector<pi> nexts; int query[100005]; int is_in[100005]; int getnxt(int val, int time){ auto t = upper_bound(nexts.begin(), nexts.end(), pi(val, time)); if(t->first != val) return 1e9; return t->second; } void ComputeAdvice(int *C, int N, int K, int M) { for(int i=0; i<N; i++){ nexts.push_back(pi(C[i], i)); } for(int i=0; i<K; i++){ s.insert(pi(getnxt(i, -1), i)); is_in[i] = 1; } sort(nexts.begin(), nexts.end()); for(int i=0; i<N; i++){ query[i] = N; if(is_in[C[i]]){ if(s.find(pi(i, C[i])) != s.end()) s.erase(pi(i, C[i])); s.insert(pi(getnxt(C[i], i), C[i])); } else{ auto t = --s.end(); query[i] = t->second; is_in[t->second] = 0; s.erase(t); s.insert(pi(getnxt(C[i], i), C[i])); is_in[C[i]] = 1; } } for(int i=0; i<N; i++){ for(int j=0; j<17; j++){ WriteAdvice((query[i] >> j) & 1); } } }
#include "assistant.h" void Assist(unsigned char *A, int N, int K, int R) { for(int i=0; i<R; i+=17){ int bits = 0; for(int j=0; j<17; j++){ bits |= (A[i + j] << j); } int req = GetRequest(); if(bits == N){ continue; } else{ PutBack(bits); } } }

컴파일 시 표준 에러 (stderr) 메시지

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:10:7: warning: unused variable 'req' [-Wunused-variable]
   int req = GetRequest();
       ^~~
#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...