oj.uz

Submission #1031827

# Submission time Handle Problem Language Result Execution time Memory
1031827 2024-07-23T07:44:09 Z aymanrs Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 15 ms 444 KB 
#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;
      }
    }
  }
}

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 444 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 0 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 444 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -