oj.uz

Submission #212304

# Submission time Handle Problem Language Result Execution time Memory
212304 2020-03-22T16:54:56 Z _7_7_ Meetings (JOI19_meetings) C++14
100 / 100
 1012 ms 224632 KB 
#include "meetings.h"

#include <bits/stdc++.h>

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e3 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

using namespace std;


unordered_map < int, int > res[N][N];
int cnt[N], root;
set < int > s[N];
vi g[N];


int ask (int x, int y, int z) {
	vi v;
	v.pb(x);
	v.pb(y);
	v.pb(z);
	sort(all(v));
	x = v[0];
	y = v[1];
	z = v[2];
	if (res[x][y].count(z)) 
		return res[x][y][z];
	return res[x][y][z] = Query(x, y, z);
}

bool cmp (int x, int y) {
	return ask(root, x, y) == x;
}


void solve (int Root, vi v) {
	root = Root;
	int x = v[rand() % sz(v)];
//	cerr << x << endl;
	vi path;
	path.pb(x);
	unordered_map < int, vi > tmp;

	for (auto y : v) {
		if (x == y)
			continue;
		int res = ask(root, x, y);
		if (res == y)
			path.pb(y);
		else
			tmp[res].pb(y);	
	}

	sort(all(path), cmp);
	for (int i = 0; i < sz(path); ++i) {
		int a = path[i], b = !i ? root : path[i - 1];
		Bridge(min(a, b), max(a, b));
	}

	for (auto y : tmp)
		solve(y.f, y.s);
}


                                                                     
void Solve(int n) {
	srand(time(0));
	root = rand() % n;
	vi tmp;
	for (int i = 0; i < n; ++i)
		if (i != root)
			tmp.pb(i);

	solve(root, tmp);	
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 222072 KB Output is correct
2 Correct 129 ms 222072 KB Output is correct
3 Correct 131 ms 222240 KB Output is correct
4 Correct 129 ms 222072 KB Output is correct
5 Correct 131 ms 222036 KB Output is correct
6 Correct 131 ms 222080 KB Output is correct
7 Correct 130 ms 222072 KB Output is correct
8 Correct 130 ms 222072 KB Output is correct
9 Correct 129 ms 222136 KB Output is correct
10 Correct 132 ms 222088 KB Output is correct
11 Correct 132 ms 222176 KB Output is correct
12 Correct 134 ms 222072 KB Output is correct
13 Correct 133 ms 222072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 222072 KB Output is correct
2 Correct 129 ms 222072 KB Output is correct
3 Correct 131 ms 222240 KB Output is correct
4 Correct 129 ms 222072 KB Output is correct
5 Correct 131 ms 222036 KB Output is correct
6 Correct 131 ms 222080 KB Output is correct
7 Correct 130 ms 222072 KB Output is correct
8 Correct 130 ms 222072 KB Output is correct
9 Correct 129 ms 222136 KB Output is correct
10 Correct 132 ms 222088 KB Output is correct
11 Correct 132 ms 222176 KB Output is correct
12 Correct 134 ms 222072 KB Output is correct
13 Correct 133 ms 222072 KB Output is correct
14 Correct 129 ms 222200 KB Output is correct
15 Correct 132 ms 222072 KB Output is correct
16 Correct 143 ms 222072 KB Output is correct
17 Correct 131 ms 222156 KB Output is correct
18 Correct 131 ms 222072 KB Output is correct
19 Correct 134 ms 222200 KB Output is correct
20 Correct 129 ms 222072 KB Output is correct
21 Correct 133 ms 222200 KB Output is correct
22 Correct 132 ms 222328 KB Output is correct
23 Correct 129 ms 222176 KB Output is correct
24 Correct 130 ms 222060 KB Output is correct
25 Correct 129 ms 222072 KB Output is correct
26 Correct 139 ms 222328 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 222072 KB Output is correct
2 Correct 129 ms 222072 KB Output is correct
3 Correct 131 ms 222240 KB Output is correct
4 Correct 129 ms 222072 KB Output is correct
5 Correct 131 ms 222036 KB Output is correct
6 Correct 131 ms 222080 KB Output is correct
7 Correct 130 ms 222072 KB Output is correct
8 Correct 130 ms 222072 KB Output is correct
9 Correct 129 ms 222136 KB Output is correct
10 Correct 132 ms 222088 KB Output is correct
11 Correct 132 ms 222176 KB Output is correct
12 Correct 134 ms 222072 KB Output is correct
13 Correct 133 ms 222072 KB Output is correct
14 Correct 129 ms 222200 KB Output is correct
15 Correct 132 ms 222072 KB Output is correct
16 Correct 143 ms 222072 KB Output is correct
17 Correct 131 ms 222156 KB Output is correct
18 Correct 131 ms 222072 KB Output is correct
19 Correct 134 ms 222200 KB Output is correct
20 Correct 129 ms 222072 KB Output is correct
21 Correct 133 ms 222200 KB Output is correct
22 Correct 132 ms 222328 KB Output is correct
23 Correct 129 ms 222176 KB Output is correct
24 Correct 130 ms 222060 KB Output is correct
25 Correct 129 ms 222072 KB Output is correct
26 Correct 139 ms 222328 KB Output is correct
27 Correct 140 ms 222200 KB Output is correct
28 Correct 140 ms 222200 KB Output is correct
29 Correct 137 ms 222200 KB Output is correct
30 Correct 141 ms 222328 KB Output is correct
31 Correct 135 ms 222200 KB Output is correct
32 Correct 143 ms 222264 KB Output is correct
33 Correct 145 ms 222400 KB Output is correct
34 Correct 148 ms 222456 KB Output is correct
35 Correct 148 ms 222456 KB Output is correct
36 Correct 145 ms 222204 KB Output is correct
37 Correct 140 ms 222332 KB Output is correct
38 Correct 143 ms 222456 KB Output is correct
39 Correct 139 ms 222328 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 510 ms 223304 KB Output is correct
2 Correct 511 ms 223224 KB Output is correct
3 Correct 525 ms 223228 KB Output is correct
4 Correct 534 ms 223096 KB Output is correct
5 Correct 433 ms 222972 KB Output is correct
6 Correct 407 ms 223224 KB Output is correct
7 Correct 665 ms 223736 KB Output is correct
8 Correct 741 ms 223992 KB Output is correct
9 Correct 721 ms 224504 KB Output is correct
10 Correct 705 ms 224504 KB Output is correct
11 Correct 709 ms 224632 KB Output is correct
12 Correct 466 ms 223224 KB Output is correct
13 Correct 398 ms 223332 KB Output is correct
14 Correct 485 ms 223352 KB Output is correct
15 Correct 526 ms 223496 KB Output is correct
16 Correct 504 ms 223480 KB Output is correct
17 Correct 856 ms 224120 KB Output is correct
18 Correct 586 ms 223364 KB Output is correct
19 Correct 642 ms 223468 KB Output is correct
20 Correct 560 ms 223608 KB Output is correct
21 Correct 603 ms 223456 KB Output is correct
22 Correct 603 ms 223332 KB Output is correct
23 Correct 642 ms 223480 KB Output is correct
24 Correct 617 ms 223544 KB Output is correct
25 Correct 659 ms 223284 KB Output is correct
26 Correct 663 ms 223428 KB Output is correct
27 Correct 722 ms 223224 KB Output is correct
28 Correct 798 ms 224372 KB Output is correct
29 Correct 752 ms 224488 KB Output is correct
30 Correct 744 ms 224252 KB Output is correct
31 Correct 716 ms 224420 KB Output is correct
32 Correct 1012 ms 223812 KB Output is correct
33 Correct 828 ms 223576 KB Output is correct
34 Correct 135 ms 222200 KB Output is correct
35 Correct 140 ms 222216 KB Output is correct
36 Correct 134 ms 222200 KB Output is correct
37 Correct 139 ms 222440 KB Output is correct
38 Correct 137 ms 222200 KB Output is correct
39 Correct 140 ms 222328 KB Output is correct
40 Correct 143 ms 222404 KB Output is correct
41 Correct 144 ms 222328 KB Output is correct
42 Correct 143 ms 222456 KB Output is correct
43 Correct 135 ms 222200 KB Output is correct
44 Correct 144 ms 222328 KB Output is correct
45 Correct 143 ms 222328 KB Output is correct
46 Correct 136 ms 222200 KB Output is correct
47 Correct 131 ms 222072 KB Output is correct
48 Correct 138 ms 222224 KB Output is correct
49 Correct 130 ms 222072 KB Output is correct
50 Correct 133 ms 222200 KB Output is correct
51 Correct 131 ms 222072 KB Output is correct
52 Correct 135 ms 222176 KB Output is correct
53 Correct 134 ms 222200 KB Output is correct
54 Correct 132 ms 222072 KB Output is correct
55 Correct 131 ms 222072 KB Output is correct
56 Correct 132 ms 222200 KB Output is correct
57 Correct 136 ms 222072 KB Output is correct
58 Correct 130 ms 222072 KB Output is correct
59 Correct 132 ms 222072 KB Output is correct
60 Correct 131 ms 222072 KB Output is correct
61 Correct 138 ms 222096 KB Output is correct
62 Correct 130 ms 222072 KB Output is correct
63 Correct 129 ms 222072 KB Output is correct
64 Correct 133 ms 222088 KB Output is correct
65 Correct 136 ms 222268 KB Output is correct
66 Correct 133 ms 222092 KB Output is correct
67 Correct 130 ms 222072 KB Output is correct
68 Correct 131 ms 222116 KB Output is correct
69 Correct 138 ms 222268 KB Output is correct
70 Correct 130 ms 222088 KB Output is correct
71 Correct 152 ms 222048 KB Output is correct
72 Correct 129 ms 222072 KB Output is correct