oj.uz

Submission #944075

# Submission time Handle Problem Language Result Execution time Memory
944075 2024-03-12T08:08:15 Z teacup Chameleon's Love (JOI20_chameleon) C++17
0 / 100
 1 ms 344 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define ii pair<int,int>
typedef vector<int> vi;
#define iii tuple<int,int,int>
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef map<int,int> mii;

#ifndef debug 
    #define cerr if (0) cerr
#endif

void Solve(int N) {
	vector<int> V;
	for(int i=1; i<=2*N; i++){
		V.push_back(i);
	}
	
	while(!V.empty()){
		int L=0, R=V.size()-1, M, a, b;
		while(R>L+1){
			M = (L+R)/2;
			a = Query(vector(V.begin(),V.begin()+M));
			b = Query(vector(V.begin()+1,V.begin()+M));
			if (a==b) R = M;
			else L = M;
		}
		a = V[0]; b = V[L];
		V.erase(V.begin());V.erase(V.begin()+L);
		Answer(a,b);
	}
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

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