Submission #710855

# Submission time Handle Problem Language Result Execution time Memory
710855 2023-03-16T02:28:29 Z PixelCat Meetings (JOI19_meetings) C++14
100 / 100
949 ms 1052 KB
#include "meetings.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 2010;

mt19937_64 rng(48763);
vector<pii> edges;

int m_qry(int a, int b, int c) {
    if(a == b) return a;
    if(a == c) return a;
    if(b == c) return b;
    return Query(a, b, c);
}

void solve(vector<int> &ids) {
    // for(auto &i:ids) cout << i << " ";
    // cout << endl;

    if(sz(ids) == 1) return;
    if(sz(ids) == 2) {
        edges.eb(ids[0], ids[1]);
        return;
    }

    int p1 = rng() % sz(ids);
    int p2 = rng() % sz(ids);
    while(p1 == p2) p2 = rng() % sz(ids);
    p1 = ids[p1]; p2 = ids[p2];
    map<int, vector<int>> mp;
    vector<int> rts;
    for(auto &i:ids) {
        int r = m_qry(p1, p2, i);
        rts.eb(r);
        mp[r].eb(i);
    }
    for(auto &it:mp) solve(it.S);
    sort(all(rts));
    rts.erase(unique(all(rts)), rts.end());
    sort(all(rts), [&](int a, int b) {
        return m_qry(p1, a, b) == a;
    });
    For(i, 0, sz(rts) - 2) edges.eb(rts[i], rts[i + 1]);
}

void Solve(int32_t n) {
    edges.clear();
    vector<int> ids(n);
    For(i, 0, n - 1) ids[i] = i;
    solve(ids);
    for(auto &p:edges) {
        if(p.F > p.S) swap(p.F, p.S);
        Bridge(p.F, p.S);
    }
}
//   int x = Query(0, 1, 2);
//   for (int u = 0; u < N - 1; ++u) {
//     Bridge(u, u + 1);
//   }
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 368 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 368 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 368 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 4 ms 336 KB Output is correct
28 Correct 4 ms 336 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 4 ms 336 KB Output is correct
31 Correct 4 ms 336 KB Output is correct
32 Correct 6 ms 336 KB Output is correct
33 Correct 7 ms 420 KB Output is correct
34 Correct 7 ms 336 KB Output is correct
35 Correct 7 ms 336 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 12 ms 432 KB Output is correct
38 Correct 9 ms 440 KB Output is correct
39 Correct 6 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 356 ms 572 KB Output is correct
2 Correct 390 ms 648 KB Output is correct
3 Correct 357 ms 556 KB Output is correct
4 Correct 341 ms 708 KB Output is correct
5 Correct 318 ms 672 KB Output is correct
6 Correct 245 ms 636 KB Output is correct
7 Correct 369 ms 664 KB Output is correct
8 Correct 383 ms 848 KB Output is correct
9 Correct 395 ms 864 KB Output is correct
10 Correct 382 ms 748 KB Output is correct
11 Correct 441 ms 940 KB Output is correct
12 Correct 418 ms 840 KB Output is correct
13 Correct 285 ms 676 KB Output is correct
14 Correct 234 ms 588 KB Output is correct
15 Correct 282 ms 700 KB Output is correct
16 Correct 285 ms 588 KB Output is correct
17 Correct 362 ms 712 KB Output is correct
18 Correct 311 ms 824 KB Output is correct
19 Correct 294 ms 584 KB Output is correct
20 Correct 351 ms 768 KB Output is correct
21 Correct 346 ms 620 KB Output is correct
22 Correct 371 ms 680 KB Output is correct
23 Correct 326 ms 584 KB Output is correct
24 Correct 317 ms 576 KB Output is correct
25 Correct 328 ms 668 KB Output is correct
26 Correct 428 ms 812 KB Output is correct
27 Correct 384 ms 600 KB Output is correct
28 Correct 444 ms 840 KB Output is correct
29 Correct 297 ms 840 KB Output is correct
30 Correct 339 ms 796 KB Output is correct
31 Correct 354 ms 720 KB Output is correct
32 Correct 949 ms 1052 KB Output is correct
33 Correct 364 ms 932 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 4 ms 336 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 4 ms 336 KB Output is correct
38 Correct 3 ms 388 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 7 ms 336 KB Output is correct
41 Correct 8 ms 336 KB Output is correct
42 Correct 7 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 11 ms 428 KB Output is correct
45 Correct 7 ms 436 KB Output is correct
46 Correct 7 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 0 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct