oj.uz

답안 #446033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446033 2021-07-20T14:11:02 Z flappybird 도서관 (JOI18_library) C++14
19 / 100
 650 ms 572 KB 
#include <bits/stdc++.h>
#include <cassert>
#include "library.h"
using namespace std;
typedef int ll;

vector<ll> asdf;
vector<ll> chk;
vector<ll> p, e, memo;
ll n;

void randp(ll N) {
	p.resize(N);
	ll i;
	for (i = 0; i < N; i++) p[i] = i + 1;
	for (i = N - 1; i >= 1; i--) {
		if ((rand() % (i + 1))) {
			ll a;
			a = rand() % i;
			swap(p[i], p[a]);
		}
	}
}

ll cnt = 0;

ll query(vector<ll> &v) {
	cnt++;
	vector<ll> a;
	a.resize(n);
	for (auto x : v) a[x - 1] = 1;
	return Query(a);
}

void Solve(int N) {
	n = N;
	srand(time(NULL));
	chk.resize(N + 1);
	ll i, a;
	ll sz = N;
	for (a = 1; a <= N; a++) {
		asdf.clear();
		for (ll i = 1; i <= N; i++) if (!chk[i]) asdf.push_back(i);
		sz = asdf.size();
		if (asdf.size() <= 2) {
			e.push_back(asdf[0]);
			chk[asdf[0]] = 1;
			continue;
		}
		vector<ll> q1, q2;
		if (memo.empty()) {
			do {
				randp(sz);
				q1.clear();
				q2.clear();
				for (i = 0; i < sz; i++) {
					if (p[i] <= sz / 2) q1.push_back(asdf[i]);
					else q2.push_back(asdf[i]);
				}
			} while ((query(q1) + query(q2)) % 2);
		}
		else {
			vector<ll> aasdf;
			aasdf.resize(N + 1);
			for (i = 1; i <= N; i++) aasdf[i] = chk[i];
			for (auto x : memo) aasdf[x] = 1;
			q1 = memo;
			for (i = 1; i <= N; i++) if (!aasdf[i]) q2.push_back(i);
			memo.clear();
		}
		ll l, r;
		l = 0, r = q1.size() - 1;
		vector<ll> v1, v2;
		while (l < r) {
			v1 = q1;
			v2 = q2;
			ll mid = (l + r) / 2;
			for (ll k = mid + 1; k < q1.size(); k++) v2.push_back(v1[k]);
			for (ll k = mid + 1; k < q1.size(); k++) v1.pop_back();
			if ((query(v1) + query(v2)) % 2) l = mid + 1;
			else r = mid;
		}
		e.push_back(q1[r]);
		chk[q1[r]] = 1;
	}
	deque<ll> d;
	for (i = N - 1; i >= 0; i--) {
		if (d.empty()) {
			d.push_back(e[i]);
			continue;
		}
		ll b = d.back();
		vector<ll> v;
		v.push_back(b);
		v.push_back(e[i]);
		if (query(v) == 1) d.push_back(e[i]);
		else d.push_front(e[i]);
	}
	vector<ll> ans;
	while (!d.empty()) {
		ans.push_back(d.back());
		d.pop_back();
	}
	Answer(ans);
}

Compilation message

library.cpp: In function 'void Solve(int)':
library.cpp:78:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |    for (ll k = mid + 1; k < q1.size(); k++) v2.push_back(v1[k]);
      |                         ~~^~~~~~~~~~~
library.cpp:79:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for (ll k = mid + 1; k < q1.size(); k++) v1.pop_back();
      |                         ~~^~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 200 KB # of queries: 2955
2 Correct 60 ms 300 KB # of queries: 2894
3 Correct 63 ms 200 KB # of queries: 3121
4 Correct 62 ms 296 KB # of queries: 3085
5 Correct 51 ms 200 KB # of queries: 3117
6 Correct 50 ms 304 KB # of queries: 3109
7 Correct 56 ms 200 KB # of queries: 3091
8 Correct 48 ms 300 KB # of queries: 2998
9 Correct 46 ms 304 KB # of queries: 3012
10 Correct 44 ms 300 KB # of queries: 1834
11 Correct 0 ms 200 KB # of queries: 0
12 Correct 0 ms 200 KB # of queries: 1
13 Correct 1 ms 200 KB # of queries: 8
14 Correct 1 ms 200 KB # of queries: 9
15 Correct 3 ms 200 KB # of queries: 112
16 Correct 4 ms 288 KB # of queries: 290

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 200 KB # of queries: 2955
2 Correct 60 ms 300 KB # of queries: 2894
3 Correct 63 ms 200 KB # of queries: 3121
4 Correct 62 ms 296 KB # of queries: 3085
5 Correct 51 ms 200 KB # of queries: 3117
6 Correct 50 ms 304 KB # of queries: 3109
7 Correct 56 ms 200 KB # of queries: 3091
8 Correct 48 ms 300 KB # of queries: 2998
9 Correct 46 ms 304 KB # of queries: 3012
10 Correct 44 ms 300 KB # of queries: 1834
11 Correct 0 ms 200 KB # of queries: 0
12 Correct 0 ms 200 KB # of queries: 1
13 Correct 1 ms 200 KB # of queries: 8
14 Correct 1 ms 200 KB # of queries: 9
15 Correct 3 ms 200 KB # of queries: 112
16 Correct 4 ms 288 KB # of queries: 290
17 Runtime error 650 ms 572 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -