oj.uz

답안 #205101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
205101 2020-02-28T00:09:38 Z mode149256 도서관 (JOI18_library) C++14
100 / 100
 546 ms 684 KB 
/*input

*/
#include <bits/stdc++.h>
#include "library.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

void Solve(int N)
{
	vii edges(N);
	vpi praejo;

	auto kiek = [&](int a, int b) {
		vi M(N, 0);
		for (int i = 0; i < N; ++i)
			if (a <= i and i <= b)
				M[i] = 1;

		return Query(M);
	};

	auto getJau = [&](int a, int b) {
		int ret = 0;
		for (auto u : praejo)
			ret += (a <= u.x and u.x <= b and a <= u.y and u.y <= b);

		return ret;
	};

	for (int i = 0; i < N - 1; ++i)
	{
		int l = 0;
		int h = N - 1;
		int m;
		while (l < h) {
			m = (l + h) / 2;

			if (kiek(0, m) < m + 1 - getJau(0, m))
				h = m;
			else
				l = m + 1;
		}

		int right = l;

		l = 0;
		h = right;

		while (l < h) {
			m = (l + h + 1) / 2;

			if (kiek(m, right) < right - m + 1 - getJau(m, right))
				l = m;
			else
				h = m - 1;
		}

		int left = l;

		// printf("i = %d, left = %d, right = %d\n", i, left + 1, right + 1);
		// left-right
		edges[left].emplace_back(right);
		edges[right].emplace_back(left);
		praejo.emplace_back(left, right);
	}

	int curr = 0;
	for (int i = 0; i < N; ++i)
		if (edges[i].size() == 1) {
			curr = i;
			break;
		}

	vi ats = {curr + 1};

	int prev = -1;

	for (int i = 0; i < N - 1; ++i)
	{
		for (auto u : edges[curr])
			if (u != prev) {
				prev = curr;
				curr = u;
				ats.emplace_back(curr + 1);
				break;
			}
	}

	Answer(ats);
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 376 KB # of queries: 2790
2 Correct 59 ms 248 KB # of queries: 2779
3 Correct 54 ms 332 KB # of queries: 2933
4 Correct 54 ms 248 KB # of queries: 2926
5 Correct 52 ms 328 KB # of queries: 2933
6 Correct 53 ms 248 KB # of queries: 2924
7 Correct 49 ms 248 KB # of queries: 2915
8 Correct 48 ms 376 KB # of queries: 2791
9 Correct 54 ms 376 KB # of queries: 2922
10 Correct 29 ms 376 KB # of queries: 1714
11 Correct 5 ms 248 KB # of queries: 0
12 Correct 5 ms 376 KB # of queries: 2
13 Correct 5 ms 248 KB # of queries: 5
14 Correct 5 ms 248 KB # of queries: 11
15 Correct 7 ms 248 KB # of queries: 103
16 Correct 9 ms 248 KB # of queries: 232

Subtask #2
81.0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 376 KB # of queries: 2790
2 Correct 59 ms 248 KB # of queries: 2779
3 Correct 54 ms 332 KB # of queries: 2933
4 Correct 54 ms 248 KB # of queries: 2926
5 Correct 52 ms 328 KB # of queries: 2933
6 Correct 53 ms 248 KB # of queries: 2924
7 Correct 49 ms 248 KB # of queries: 2915
8 Correct 48 ms 376 KB # of queries: 2791
9 Correct 54 ms 376 KB # of queries: 2922
10 Correct 29 ms 376 KB # of queries: 1714
11 Correct 5 ms 248 KB # of queries: 0
12 Correct 5 ms 376 KB # of queries: 2
13 Correct 5 ms 248 KB # of queries: 5
14 Correct 5 ms 248 KB # of queries: 11
15 Correct 7 ms 248 KB # of queries: 103
16 Correct 9 ms 248 KB # of queries: 232
17 Correct 528 ms 504 KB # of queries: 19255
18 Correct 526 ms 504 KB # of queries: 19036
19 Correct 542 ms 492 KB # of queries: 19250
20 Correct 484 ms 512 KB # of queries: 18005
21 Correct 454 ms 504 KB # of queries: 16936
22 Correct 532 ms 504 KB # of queries: 19279
23 Correct 546 ms 476 KB # of queries: 19240
24 Correct 180 ms 376 KB # of queries: 8868
25 Correct 510 ms 684 KB # of queries: 18804
26 Correct 483 ms 504 KB # of queries: 17594
27 Correct 184 ms 376 KB # of queries: 8839
28 Correct 512 ms 600 KB # of queries: 18943
29 Correct 499 ms 504 KB # of queries: 18922
30 Correct 516 ms 504 KB # of queries: 18943