Submission #958966

#TimeUsernameProblemLanguageResultExecution timeMemory
958966d4xnLast supper (IOI12_supper)C++17
0 / 100
292 ms18692 KiB
#include "advisor.h" #include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() void ComputeAdvice(int *C, int N, int K, int M) { int B = log2(K); vector<int> idx[N]; for (int i = 0; i < N; i++) { idx[C[i]].push_back(i); } for (int i = 0; i < N; i++) { idx[i].push_back(N); reverse(all(idx[i])); } int shelf[K]; set<pair<int, int>> st, pq; for (int i = 0; i < K; i++) { shelf[i] = i; st.insert(make_pair(i, i)); // (color, posicion) pq.insert(make_pair(-idx[i].back(), i)); // (proxima aparicion, posicion) } for (int i = 0; i < N; i++) { int x = C[i]; auto it = st.lower_bound(make_pair(x, 0)); if (it != st.end() && it->first == x) { pq.erase(make_pair(-idx[x].back(), x)); while (idx[x].back() <= i) idx[x].pop_back(); pq.insert(make_pair(-idx[x].back(), x)); continue; } int y = pq.begin()->second; pq.erase(pq.begin()); st.erase(make_pair(shelf[y], y)); for (int j = B; j >= 0; j--) { if ((y >> j) & 1) WriteAdvice(1); else WriteAdvice(0); } shelf[y] = x; st.insert(make_pair(x, y)); while (idx[x].back() <= i) idx[x].pop_back(); pq.insert(make_pair(-idx[x].back(), y)); } }
#include "assistant.h" #include <bits/stdc++.h> using namespace std; void Assist(unsigned char *A, int N, int K, int R) { int B = log2(K); int shelf[K]; set<int> st; for (int i = 0; i < K; i++) { shelf[i] = i; st.insert(i); } int curr = 0; for (int i = 0; i < N; i++) { int x = GetRequest(); if (st.find(x) != st.end()) continue; int y = 0; for (int j = B; j >= 0; j--) { if (A[curr++] == 1) y ^= (1 << j); } PutBack(shelf[y]); st.erase(shelf[y]); shelf[y] = x; st.insert(x); } }
#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...