Submission #383056

# Submission time Handle Problem Language Result Execution time Memory
383056 2021-03-28T18:38:29 Z PurpleCrayon Meetings (JOI19_meetings) C++17
100 / 100
1331 ms 1172 KB
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

//helper functions
#define sz(v) int(v.size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r){
	return uniform_int_distribution<int>(l, r)(rng);
}
int qry(int a, int b, int c) {
    // cerr << "qry: " << a << ' ' << b << ' ' << c << endl;
    assert(a != b && b != c && a != c);
    return Query(a, b, c);
}
void upd(int a, int b) {
    if (a >= b) swap(a, b);
    // cerr << "upd: " << a << ' ' << b << endl;
    Bridge(a, b);
}
//end helper functions

int n;

void rec(int root, vector<int> cand) {
    if (sz(cand) == 0) return;
    if (sz(cand) == 1) {
        upd(root, cand[0]);
        return;
    }
    int m = sz(cand);
    int end = cand[rnd(0, m-1)];

    // cerr << "root, end: " << root << ' ' << end << endl;
    vector<int> repr(m), path;
    for (int i = 0; i < m; i++) {
        repr[i] = cand[i] == end ? end : qry(root, end, cand[i]);
        if (repr[i] == cand[i] && cand[i] != end) { //on path
            path.push_back(cand[i]);
        }
    }
    sort(path.begin(), path.end(), [&](int a, int b){
        return qry(root, a, b) == a;
    });

    path.insert(path.begin(), root);
    path.push_back(end);
    // cerr << "path: "; for (auto v : path) cerr << v << ' '; cerr << endl;

    for (int i = 1; i < sz(path); i++)
        upd(path[i-1], path[i]);

    map<int, int> loc;
    for (int i = 0; i < sz(path); i++) loc[path[i]] = i;
    vector<vector<int>> nxt(sz(path));
    for (int i = 0; i < m; i++) {
        if (repr[i] != cand[i]) {
            nxt[loc[repr[i]]].push_back(cand[i]);
        }
    }
    for (int i = 0; i < sz(nxt); i++) {
        rec(path[i], nxt[i]);
    }
}
void Solve(int _n) {
    n = _n;

    vector<int> al(n); iota(al.begin(), al.end(), 0);
    int root = rnd(0, n-1);
    // cerr << root << endl;

    al.erase(find(al.begin(), al.end(), root));
    rec(root, al);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 7 ms 364 KB Output is correct
28 Correct 7 ms 364 KB Output is correct
29 Correct 9 ms 364 KB Output is correct
30 Correct 7 ms 364 KB Output is correct
31 Correct 7 ms 364 KB Output is correct
32 Correct 9 ms 364 KB Output is correct
33 Correct 14 ms 492 KB Output is correct
34 Correct 19 ms 620 KB Output is correct
35 Correct 16 ms 492 KB Output is correct
36 Correct 6 ms 364 KB Output is correct
37 Correct 10 ms 492 KB Output is correct
38 Correct 11 ms 492 KB Output is correct
39 Correct 10 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 504 ms 808 KB Output is correct
2 Correct 687 ms 748 KB Output is correct
3 Correct 600 ms 876 KB Output is correct
4 Correct 588 ms 748 KB Output is correct
5 Correct 439 ms 620 KB Output is correct
6 Correct 434 ms 876 KB Output is correct
7 Correct 838 ms 876 KB Output is correct
8 Correct 926 ms 828 KB Output is correct
9 Correct 866 ms 896 KB Output is correct
10 Correct 854 ms 836 KB Output is correct
11 Correct 994 ms 748 KB Output is correct
12 Correct 391 ms 800 KB Output is correct
13 Correct 422 ms 876 KB Output is correct
14 Correct 622 ms 676 KB Output is correct
15 Correct 536 ms 748 KB Output is correct
16 Correct 533 ms 760 KB Output is correct
17 Correct 848 ms 836 KB Output is correct
18 Correct 597 ms 748 KB Output is correct
19 Correct 448 ms 700 KB Output is correct
20 Correct 651 ms 784 KB Output is correct
21 Correct 687 ms 748 KB Output is correct
22 Correct 616 ms 760 KB Output is correct
23 Correct 658 ms 748 KB Output is correct
24 Correct 593 ms 748 KB Output is correct
25 Correct 594 ms 748 KB Output is correct
26 Correct 560 ms 876 KB Output is correct
27 Correct 561 ms 660 KB Output is correct
28 Correct 1144 ms 872 KB Output is correct
29 Correct 884 ms 1004 KB Output is correct
30 Correct 886 ms 944 KB Output is correct
31 Correct 897 ms 1172 KB Output is correct
32 Correct 1331 ms 1060 KB Output is correct
33 Correct 1063 ms 876 KB Output is correct
34 Correct 7 ms 364 KB Output is correct
35 Correct 7 ms 364 KB Output is correct
36 Correct 9 ms 364 KB Output is correct
37 Correct 8 ms 364 KB Output is correct
38 Correct 6 ms 364 KB Output is correct
39 Correct 9 ms 364 KB Output is correct
40 Correct 15 ms 492 KB Output is correct
41 Correct 18 ms 492 KB Output is correct
42 Correct 16 ms 492 KB Output is correct
43 Correct 6 ms 364 KB Output is correct
44 Correct 13 ms 492 KB Output is correct
45 Correct 15 ms 492 KB Output is correct
46 Correct 11 ms 492 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct