oj.uz

Submission #211630

# Submission time Handle Problem Language Result Execution time Memory
211630 2020-03-20T21:05:22 Z mode149256 Meetings (JOI19_meetings) C++14
100 / 100
 824 ms 2040 KB 
/*input

*/
#include <bits/stdc++.h>
#include "meetings.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';
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


void bridge(int a, int b) {
	if (a > b) swap(a, b);
	Bridge(a, b);
}

void solve(vi aibe) {
	if (aibe.size() <= 1) return;
	int root = aibe[rng() % ((int)aibe.size())];

	int nxt;
	do {
		nxt = aibe[rng() % ((int)aibe.size())];
	} while (nxt == root);

	vi path = {nxt};

	vi vaikai[2100];

	for (auto u : aibe) {
		if (u == root or u == nxt) continue;
		int ans = Query(root, nxt, u);

		if (ans == u) path.push_back(u);
		else vaikai[ans].push_back(u);
	}

	sort(path.begin(), path.end(), [&](int a, int b) {
		return Query(root, a, b) == a;
	});

	bridge(root, path[0]);
	for (int i = 1; i < path.size(); ++i)
		bridge(path[i - 1], path[i]);

	for (auto u : path) {
		vaikai[u].push_back(u);
		solve(vaikai[u]);
	}
	vaikai[root].push_back(root);
	solve(vaikai[root]);
}

void Solve(int N) {
	vi temp;
	for (int i = 0; i < N; ++i)
		temp.emplace_back(i);

	solve(temp);
}

Compilation message

meetings.cpp: In function 'void solve(vi)':
meetings.cpp:91:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < path.size(); ++i)
                  ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 896 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 5 ms 640 KB Output is correct
19 Correct 5 ms 640 KB Output is correct
20 Correct 5 ms 896 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 5 ms 896 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 11 ms 948 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 10 ms 768 KB Output is correct
30 Correct 10 ms 768 KB Output is correct
31 Correct 9 ms 768 KB Output is correct
32 Correct 12 ms 896 KB Output is correct
33 Correct 14 ms 1280 KB Output is correct
34 Correct 15 ms 1408 KB Output is correct
35 Correct 14 ms 1408 KB Output is correct
36 Correct 9 ms 896 KB Output is correct
37 Correct 15 ms 768 KB Output is correct
38 Correct 17 ms 896 KB Output is correct
39 Correct 11 ms 768 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 1268 KB Output is correct
2 Correct 431 ms 1272 KB Output is correct
3 Correct 483 ms 1272 KB Output is correct
4 Correct 454 ms 1528 KB Output is correct
5 Correct 348 ms 1144 KB Output is correct
6 Correct 392 ms 1528 KB Output is correct
7 Correct 523 ms 1784 KB Output is correct
8 Correct 502 ms 2040 KB Output is correct
9 Correct 444 ms 1784 KB Output is correct
10 Correct 430 ms 1784 KB Output is correct
11 Correct 450 ms 1912 KB Output is correct
12 Correct 440 ms 1272 KB Output is correct
13 Correct 255 ms 1272 KB Output is correct
14 Correct 325 ms 1400 KB Output is correct
15 Correct 389 ms 1528 KB Output is correct
16 Correct 326 ms 1400 KB Output is correct
17 Correct 460 ms 1836 KB Output is correct
18 Correct 370 ms 1656 KB Output is correct
19 Correct 338 ms 1528 KB Output is correct
20 Correct 419 ms 1400 KB Output is correct
21 Correct 582 ms 1912 KB Output is correct
22 Correct 388 ms 1560 KB Output is correct
23 Correct 413 ms 1548 KB Output is correct
24 Correct 500 ms 1656 KB Output is correct
25 Correct 433 ms 1656 KB Output is correct
26 Correct 499 ms 1784 KB Output is correct
27 Correct 443 ms 1656 KB Output is correct
28 Correct 516 ms 1912 KB Output is correct
29 Correct 437 ms 2040 KB Output is correct
30 Correct 459 ms 2032 KB Output is correct
31 Correct 448 ms 1784 KB Output is correct
32 Correct 824 ms 1272 KB Output is correct
33 Correct 661 ms 1656 KB Output is correct
34 Correct 10 ms 768 KB Output is correct
35 Correct 9 ms 768 KB Output is correct
36 Correct 10 ms 896 KB Output is correct
37 Correct 11 ms 1024 KB Output is correct
38 Correct 10 ms 768 KB Output is correct
39 Correct 13 ms 1152 KB Output is correct
40 Correct 15 ms 1280 KB Output is correct
41 Correct 16 ms 1536 KB Output is correct
42 Correct 14 ms 1316 KB Output is correct
43 Correct 10 ms 896 KB Output is correct
44 Correct 15 ms 768 KB Output is correct
45 Correct 15 ms 768 KB Output is correct
46 Correct 11 ms 768 KB Output is correct
47 Correct 5 ms 640 KB Output is correct
48 Correct 5 ms 768 KB Output is correct
49 Correct 5 ms 640 KB Output is correct
50 Correct 5 ms 768 KB Output is correct
51 Correct 5 ms 640 KB Output is correct
52 Correct 5 ms 768 KB Output is correct
53 Correct 5 ms 1024 KB Output is correct
54 Correct 5 ms 768 KB Output is correct
55 Correct 5 ms 896 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 5 ms 640 KB Output is correct
58 Correct 5 ms 640 KB Output is correct
59 Correct 5 ms 768 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 560 KB Output is correct
64 Correct 4 ms 512 KB Output is correct
65 Correct 4 ms 512 KB Output is correct
66 Correct 4 ms 512 KB Output is correct
67 Correct 5 ms 512 KB Output is correct
68 Correct 4 ms 512 KB Output is correct
69 Correct 4 ms 512 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 4 ms 512 KB Output is correct