제출 #1354138

#제출 시각아이디문제언어결과실행 시간메모리
1354138jellybeanMinerals (JOI19_minerals)C++20
0 / 100
0 ms580 KiB
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define dd(x) cout<<#x<<" is "<<x<<endl;
#define dd2(x,y) cout<<#x<<" is "<<x<<" "<<#y<<" is "<<y<<endl;
typedef pair<int,int>pii;

void Solve(int N) {
	int n = N;
	vector<pii>v;
	v.pb({1,(n+1)/2});
	v.pb({(n+1)/2+1,n});
	vector<int>res[2*n+1];
	
	while(v.size()){
		int prev;
		for(int x=0; x<v.size(); x+=2){
			auto[a,b] = v[x];
			for(int i=a; i<=b; i++) prev = Query(i);
		}
		for(int i=n+1; i<=2*n; i++){
			int cur = Query(i);
			if(cur == prev) res[i].pb(1);
			else res[i].pb(0);
			prev = cur;
		}
		
		vector<pii>nv;
		for(auto[a,b]:v){
			if(a==b) continue;
			int m = (a+b)/2;
			nv.pb({a,m});
			nv.pb({m+1,b});
		}
		
		for(int x=0; x<v.size(); x+=2){
			auto[a,b] = v[x];
			for(int i=a; i<=b; i++) Query(i);
		}
		v = nv;
	}
	
	for(int i=n+1; i<=2*n; i++){
		int s=1, e=n;
		for(auto j: res[i]){
			int m = (s+e)/2;
			if(j) e=m;
			else s=m+1;
		}
		Answer(i,s);
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...