Submission #1031827

#TimeUsernameProblemLanguageResultExecution timeMemory
1031827aymanrsChameleon's Love (JOI20_chameleon)C++14
0 / 100
15 ms444 KiB
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int N) {
  bool v[2*N+1] = {false};
  int p = 1;
  vector<int> s = {1};
  for(int i = 2;i <= 2*N;i++){
    s.push_back(i);
    if(Query(s) > p){
      p++;
      continue;
    }
    s.pop_back();
    for(int j : s){
      if(!v[j] && Query({i, j}) == 1){
        v[i]=v[j]=true;
        Answer(i,j);
        break;
      }
    }
  }
}
#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...