oj.uz

Submission #423423

# Submission time Handle Problem Language Result Execution time Memory
423423 2021-06-11T05:45:03 Z milleniumEeee Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 22 ms 200 KB 
#ifndef EVAL
#include "grader.cpp"
#endif
#include "chameleon.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pii pair<int, int>
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
using namespace std;

const int MAXN = 505;

// Query(p) | p is vector<int>
// Answer(a, b)

int n;
bool found[MAXN * 2];

void Solve(int N) {
	n = N;
	for (int i = 1; i <= n * 2; i++) {
		for (int j = i + 1; j <= n * 2; j++) {
			if (i != j && !found[i] && !found[j]) {
				vector <int> ask = {i, j};
				int val = Query(ask);
				if (val == 1) {
					found[i] = 1;
					found[j] = 1;
					Answer(i, j);
				}
			}
		}
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Incorrect 22 ms 200 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 200 KB Output is correct
2 Incorrect 0 ms 200 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 200 KB Output is correct
2 Incorrect 0 ms 200 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 200 KB Output is correct
2 Incorrect 0 ms 200 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 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Incorrect 22 ms 200 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -