oj.uz

답안 #44086

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44086 2018-03-29T21:06:28 Z zadrga 도서관 (JOI18_library) C++14
100 / 100
 490 ms 588 KB 
#include "library.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 200111

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

vector<int> here;

int find_first(int n){
	vector<int> q(n, 1);

	for(int i = 0; i < n; i++){
		q[i] = 0;
		int num = Query(q);
		if(num == 1){
			here.erase(find(here.begin(), here.end(), i));
			return i;
		}
		q[i] = 1;
	}
}

bool ask(int n, int l, int d, int last){
	vector<int> q(n, 0);
	for(int i = l; i <= d; i++){
//		cout << here[i] << "  ";
		q[here[i]] = 1;
	}

//	cout << endl;
	int alone = Query(q);

	q[last] = 1; 
	int together = Query(q);
//	cout <<  alone << " |||||  "  << last << ":  "  << together << endl;

	if(alone == together)		// next is in range [l, d]
		return 1;
	
	return 0;
}

int find_next(int n, int last){
	int l = 0, d = here.size() - 1, ans = -1, mid;
	while(l <= d){
		if(l == d){
			ans = l;
			break;
		}

		mid = (l + d) / 2;
//		cout << "pozicija:  " << l << "  " << d << "  " << mid << endl;
		if(ask(n, l, mid, last))
			d = mid;
		else
			l = mid + 1;
	}

	int ret = here[ans];
	here.erase(find(here.begin(), here.end(), ret));
	return ret;
}

void Solve(int n){
	vector<int> ans;

	if(n == 1){
		ans.pb(1);
		Answer(ans);
		return;
	}

	for(int i = 0; i < n; i++)
		here.pb(i);

	int last = find_first(n);
	ans.pb(last);

	while(here.size() > 1){
	/*	cout << "before:\n";
		for(int v : here)
			cout << v << "  ";

		cout << endl << endl; */

		int nxt = find_next(n, last);
//		cout << "nxt:  " <<  nxt << endl;
		ans.pb(nxt);
		last = nxt;
	}

	ans.pb(here[0]);
	
	for(int i = 0; i < n; i++)
		ans[i]++;

	Answer(ans);
}

Compilation message

library.cpp: In function 'int find_first(int)':
library.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 248 KB Output is correct
2 Correct 38 ms 436 KB Output is correct
3 Correct 41 ms 436 KB Output is correct
4 Correct 42 ms 436 KB Output is correct
5 Correct 37 ms 468 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 36 ms 468 KB Output is correct
8 Correct 30 ms 504 KB Output is correct
9 Correct 27 ms 520 KB Output is correct
10 Correct 25 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 1 ms 564 KB Output is correct
13 Correct 1 ms 564 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 3 ms 564 KB Output is correct
16 Correct 4 ms 564 KB Output is correct

Subtask #2
81.0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 248 KB Output is correct
2 Correct 38 ms 436 KB Output is correct
3 Correct 41 ms 436 KB Output is correct
4 Correct 42 ms 436 KB Output is correct
5 Correct 37 ms 468 KB Output is correct
6 Correct 47 ms 468 KB Output is correct
7 Correct 36 ms 468 KB Output is correct
8 Correct 30 ms 504 KB Output is correct
9 Correct 27 ms 520 KB Output is correct
10 Correct 25 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 1 ms 564 KB Output is correct
13 Correct 1 ms 564 KB Output is correct
14 Correct 2 ms 564 KB Output is correct
15 Correct 3 ms 564 KB Output is correct
16 Correct 4 ms 564 KB Output is correct
17 Correct 458 ms 572 KB Output is correct
18 Correct 433 ms 572 KB Output is correct
19 Correct 443 ms 588 KB Output is correct
20 Correct 399 ms 588 KB Output is correct
21 Correct 364 ms 588 KB Output is correct
22 Correct 448 ms 588 KB Output is correct
23 Correct 440 ms 588 KB Output is correct
24 Correct 176 ms 588 KB Output is correct
25 Correct 451 ms 588 KB Output is correct
26 Correct 396 ms 588 KB Output is correct
27 Correct 168 ms 588 KB Output is correct
28 Correct 490 ms 588 KB Output is correct
29 Correct 461 ms 588 KB Output is correct
30 Correct 449 ms 588 KB Output is correct