oj.uz

Submission #1010210

# Submission time Handle Problem Language Result Execution time Memory
1010210 2024-06-28T13:17:05 Z LCJLY Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 15 ms 448 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
	
//#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef array<int,3>pi2;

//Query(vector<int>)
//Answer(int,int)

void Solve(int n){
	int done[n+5];
	memset(done,0,sizeof(done));
	for(int x=1;x<=2*n;x++){
		if(done[x]) continue;
		for(int y=x+1;y<=2*n;y++){
			if(done[y]) continue;
			vector<int>v;
			v.push_back(x);
			v.push_back(y);
			int hold=Query(v);
			if(hold==1){
				done[y]=true;
				//show2(x,x,y,y);
				Answer(x,y);
				break;
			}
		}
	}
}

Subtask #1
0 / 4.0

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