oj.uz

Submission #972081

# Submission time Handle Problem Language Result Execution time Memory
972081 2024-04-30T04:12:43 Z 12345678 Chameleon's Love (JOI20_chameleon) C++17
0 / 100
 16 ms 596 KB 
#include "chameleon.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e4+5;

int vs[nx];

void Solve(int N) {
    for (int i=1; i<=2*N; i++)
    {   
        if (vs[i]) continue;
        for (int j=i+1; j<=2*N; j++) if (Query(vector<int> {i, j})==1) vs[i]=vs[j]=1, Answer(i, j);
    }
}

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