oj.uz

Submission #1031464

# Submission time Handle Problem Language Result Execution time Memory
1031464 2024-07-22T21:14:51 Z aymanrs Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 15 ms 344 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
void Solve(int N) {
  bool v[2*N+1] = {false};
  for(int i = 1;i <= 2*N;i++){
    if(v[i]) continue;
    for(int j = i+1;j <= 2*N;j++){
      if(!v[j] && Query({i, j}) == 1){
        Answer(i, j);
        v[i]=v[j]=true;
        break;
      }
    }
  }
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 15 ms 344 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 15 ms 344 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -