Submission #1145748

#TimeUsernameProblemLanguageResultExecution timeMemory
1145748byunjaewoo카멜레온의 사랑 (JOI20_chameleon)C++20
4 / 100
11 ms436 KiB
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int N) {
  vector<int> v;
  for(int i=1; i<=2*N; i++) v.push_back(i);
  while(v.size()>2) {
    int x=v.back(); v.pop_back();
    int tmp=0;
    for(int s=0, e=v.size()-1; s<e; ) {
      int m=(s+e)/2;
      vector<int> p;
      for(int j=s; j<=m; j++) p.push_back(v[j]);
      int val1=Query(p);
      p.push_back(x);
      int val2=Query(p);
      if(val1==val2) e=m;
      else s=m+1, tmp=m+1;
    }
    Answer(x, v[tmp]);
    swap(v[tmp], v.back()), v.pop_back();
  }
  Answer(v[0], v[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...