oj.uz

답안 #944958

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944958 2024-03-13T08:56:08 Z Xiaoyang 카멜레온의 사랑 (JOI20_chameleon) C++17
0 / 100
 1 ms 344 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define fi first 
#define se second 
#define pll pair<ll,ll>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl;
#define MP make_pair
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define SZ(x) (ll)x.size()
#define ALL(x) x.begin(),x.end()
#define endl "\n"
const ll inf=1e18;
ll lowbit(ll x){return x&(-x);}
 
 
void Solve(int n) {
	vector<int>a;
	rep(i,1,2*n+1)a.pb(i);
	while(!a.empty()){
		ll lo=0,hi=a.size()-1;
		while(lo<hi){
			ll mid=lo+hi>>1;
			vector<int>aa,bb;
			rep(i,0,mid)aa.pb(a[i]);
			rep(i,1,mid)bb.pb(a[i]);
			ll x=Query(aa);
			ll y=Query(bb);
			if(x==y)lo=mid+1;
			else hi=mid;
		}
		a.erase(a.begin());
		a.erase(a.begin()+lo-1);
		Answer(a[0],a[lo]);
	}
}

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:27:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |    ll mid=lo+hi>>1;
      |           ~~^~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -