Submission #774436

#TimeUsernameProblemLanguageResultExecution timeMemory
774436lollipopLast supper (IOI12_supper)C++17
100 / 100
234 ms143564 KiB
#include "advisor.h" #include <vector> #include <queue> #include <set> #include <cstdio> using namespace std; const int maxn = 2e5+10; bool sol[maxn]; vector< int > v; queue< int > q[maxn]; int las[maxn]; void ComputeAdvice(int *C, int N, int K, int M) { for (int i = 0; i < K; i++) v.push_back(i); for (int i = 0; i < N; i++) v.push_back(C[i]); for (int i = 0; i < v.size(); i++) { q[v[i]].push(i); } for (int i = 0; i < N; i++) q[i].push(v.size() + 1); set< pair<int, int> > s; for (int i = 0; i < K; i++) s.insert({-q[i].front(), i}); for (int i = 0; i < v.size(); i++) sol[i] = false; for (int i = 0; i < N; i++) las[i] = N + K; for (int i = 0; i < v.size(); i++) { int x = v[i]; if (!s.count({-q[x].front(), x})) { int tr = s.begin()->second; s.erase(s.begin()); q[x].pop(); s.insert({-q[x].front(), x}); } else { //printf("inside %d\n", x); fflush(stdout); sol[las[x]] = true; s.erase({-q[x].front(), x}); q[x].pop(); s.insert({-q[x].front(), x}); } las[x] = i; } for (auto iter : s) sol[las[iter.second]] = true; for (int i = 0; i < v.size(); i++) WriteAdvice(sol[i]); }
#include <bits/stdc++.h> #include "assistant.h" #define X first #define Y second using namespace std; const int maxn = 1e5+10; void Assist(unsigned char *A, int N, int K, int R) { set< int > active, passive; for (int i = 0; i < K; i++) { if (A[i] == 1) active.insert(i); else passive.insert(i); } //printf("good\n"); fflush(stdout); for (int i = 0; i < N; i++) { int c = GetRequest(); //printf("debug: %d\n", c); fflush(stdout); //printf("sizes: %d %d\n", active.size(), passive.size()); fflush(stdout); if (!active.count(c) && !passive.count(c)) { assert(passive.size()); PutBack(*passive.begin()); passive.erase(passive.begin()); } active.erase(c); passive.erase(c); if (A[i + K] == 1) active.insert(c); else passive.insert(c); } }

Compilation message (stderr)

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
advisor.cpp:26:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  for (int i = 0; i < v.size(); i++) sol[i] = false;
      |                  ~~^~~~~~~~~~
advisor.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
advisor.cpp:31:8: warning: unused variable 'tr' [-Wunused-variable]
   31 |    int tr = s.begin()->second;
      |        ^~
advisor.cpp:45:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i < v.size(); i++) WriteAdvice(sol[i]);
      |                  ~~^~~~~~~~~~
#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...