oj.uz

답안 #285368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285368 2020-08-28T20:20:30 Z YJU 도서관 (JOI18_library) C++14
0 / 100
 45 ms 512 KB 
#include<bits/stdc++.h>
#include"library.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<int,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ld pi=3.14159265359;
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
void Solve(int N){
	if(N==1){
		Answer(vector<int>(1,1));
	}
	vector<ll> q(N),t(N),ans;
	ll A,B;
	REP(i,N)t[i]=i,q[i]=1;
	REP(i,N){
		q[i]=0;
		if(Query(q)==1){
			t.erase(t.begin()+i);
			ans.pb(i);break;
		}
		q[i]=1;
	}
	REP(i,N)q[i]=0;
	while(SZ(ans)<N){
		ll l=-1,r=SZ(t)-1;
		while(r-1>l){
			ll mid=(l+r)/2;
			for(int i=0;i<=mid;i++)q[t[i]]=1;
			A=Query(q);
			q[ans.back()]=1;
			B=Query(q);
			for(int i=0;i<=mid;i++)q[t[i]]=0;
			q[ans.back()]=0;
			if(A==B){
				r=mid;
			}else{
				l=mid;
			}
		}
		ans.pb(t[r]);
		t.erase(t.begin()+r);
	}
	REP(i,N)ans[i]+=1;
	Answer(ans);
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 256 KB # of queries: 2375
2 Correct 38 ms 512 KB # of queries: 2409
3 Correct 43 ms 256 KB # of queries: 2648
4 Correct 45 ms 256 KB # of queries: 2595
5 Correct 35 ms 256 KB # of queries: 2508
6 Correct 43 ms 256 KB # of queries: 2551
7 Correct 35 ms 256 KB # of queries: 2544
8 Correct 23 ms 376 KB # of queries: 2420
9 Correct 36 ms 256 KB # of queries: 2546
10 Correct 20 ms 376 KB # of queries: 1474
11 Incorrect 1 ms 256 KB Wrong Answer [2]
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 256 KB # of queries: 2375
2 Correct 38 ms 512 KB # of queries: 2409
3 Correct 43 ms 256 KB # of queries: 2648
4 Correct 45 ms 256 KB # of queries: 2595
5 Correct 35 ms 256 KB # of queries: 2508
6 Correct 43 ms 256 KB # of queries: 2551
7 Correct 35 ms 256 KB # of queries: 2544
8 Correct 23 ms 376 KB # of queries: 2420
9 Correct 36 ms 256 KB # of queries: 2546
10 Correct 20 ms 376 KB # of queries: 1474
11 Incorrect 1 ms 256 KB Wrong Answer [2]
12 Halted 0 ms 0 KB -