Submission #1194526

#TimeUsernameProblemLanguageResultExecution timeMemory
1194526avighnaMinerals (JOI19_minerals)C++20
6 / 100
4 ms404 KiB
#include "minerals.h"
#include <vector>

void Solve(int n) {
  std::vector<bool> used(2 * n + 1);
  used[1] = true;
  int p = Query(1);
  int cur = 1;
  for (int i = 2; i <= 2 * n; ++i) {
    if (used[i]) {
      continue;
    }
    int next = Query(i);
    if (cur == -1) {
      cur = i;
      p = next;
      continue;
    }
    if (p == next) {
      Answer(cur, i);
      used[i] = true;
      i = cur;
      cur = -1;
    } else {
      Query(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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...