Submission #1198631

#TimeUsernameProblemLanguageResultExecution timeMemory
1198631woodMinerals (JOI19_minerals)C++20
6 / 100
3 ms416 KiB
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int N) {
  int n = N;
  int pair[2*n]; memset(pair,0xff,sizeof pair);
  for(int i = 0; i<2*n; i++){
    Query(i+1);
    for(int j = i+1; j<2*n; j++){
      if(Query(j+1)==1){
        pair[i] = j;
        pair[j] = i;
      }
      Query(j+1);
    }
    Query(i+1);
  }
  for(int i = 0; i<2*n; i++){
    if(pair[i]<i){
      Answer(i+1,pair[i]+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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...