답안 #165391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165391 2019-11-26T18:58:54 Z Akashi Meetings (JOI19_meetings) C++14
100 / 100
1371 ms 1016 KB
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

int global_A;
int n;
vector< pair<int, int> > sol;

inline void add_edge(int a, int b) {
    sol.push_back(make_pair(a, b));
}


bool cmp(int a, int b) {
    if (a == b) return false;
    return Query(global_A, a, b) == a;
}

void solve(vector<int> nodes) {
    if (nodes.size() == 1) return;
    if (nodes.size() == 2) {
        add_edge(nodes[0], nodes[1]);
        return;
    }
    int n = nodes.size();

    int A = nodes[rand() % n];
    int B;
    do {
        B = nodes[rand() % n];
    } while (A == B);

    vector<int> path;
    vector<int> query_ans(n);

    for (int i = 0; i < n; ++i)
        if (nodes[i] != A && nodes[i] != B) {
            query_ans[i] = Query(A, B, nodes[i]);
            if (query_ans[i] == nodes[i])
                path.push_back(nodes[i]);
        } else {
            if (nodes[i] == A) query_ans[i] = A;
            if (nodes[i] == B) query_ans[i] = B;
        }

    global_A = A;
    sort(path.begin(), path.end(), cmp);
    path.insert(path.begin(), A);
    path.push_back(B);
    for (size_t i = 0; i + 1 < path.size(); ++i)
        add_edge(path[i], path[i + 1]);

    vector< vector<int> > groups(path.size());
    for (int i = 0; i < n; ++i) {
        for (size_t j = 0; j < path.size(); ++j)
            if (path[j] == query_ans[i]) {
                groups[j].push_back(nodes[i]);
                break;
            }
    }
    for(auto it : groups)
        solve(it);
}

void print_tree() {
	for(auto it : sol) Bridge(min(it.first, it.second), max(it.first, it.second));
}

void Solve(int N) {
    n = N;
    srand(time(NULL));
    vector<int> nodes;
    for (int i = 0; i < n; ++i)
        nodes.push_back(i);
    sol.clear();
    solve(nodes);

    print_tree();
}

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 296 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 12 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 296 KB Output is correct
16 Correct 2 ms 248 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 248 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 12 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 248 KB Output is correct
27 Correct 6 ms 376 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 6 ms 380 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 7 ms 376 KB Output is correct
33 Correct 9 ms 504 KB Output is correct
34 Correct 12 ms 376 KB Output is correct
35 Correct 16 ms 504 KB Output is correct
36 Correct 5 ms 376 KB Output is correct
37 Correct 8 ms 376 KB Output is correct
38 Correct 11 ms 376 KB Output is correct
39 Correct 8 ms 380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 632 KB Output is correct
2 Correct 629 ms 632 KB Output is correct
3 Correct 610 ms 632 KB Output is correct
4 Correct 649 ms 632 KB Output is correct
5 Correct 342 ms 632 KB Output is correct
6 Correct 374 ms 632 KB Output is correct
7 Correct 433 ms 760 KB Output is correct
8 Correct 515 ms 632 KB Output is correct
9 Correct 563 ms 652 KB Output is correct
10 Correct 440 ms 808 KB Output is correct
11 Correct 794 ms 760 KB Output is correct
12 Correct 538 ms 768 KB Output is correct
13 Correct 311 ms 608 KB Output is correct
14 Correct 302 ms 632 KB Output is correct
15 Correct 285 ms 632 KB Output is correct
16 Correct 398 ms 632 KB Output is correct
17 Correct 526 ms 632 KB Output is correct
18 Correct 395 ms 888 KB Output is correct
19 Correct 273 ms 632 KB Output is correct
20 Correct 434 ms 760 KB Output is correct
21 Correct 441 ms 596 KB Output is correct
22 Correct 455 ms 648 KB Output is correct
23 Correct 413 ms 636 KB Output is correct
24 Correct 328 ms 632 KB Output is correct
25 Correct 414 ms 584 KB Output is correct
26 Correct 366 ms 844 KB Output is correct
27 Correct 347 ms 636 KB Output is correct
28 Correct 621 ms 1016 KB Output is correct
29 Correct 485 ms 632 KB Output is correct
30 Correct 569 ms 632 KB Output is correct
31 Correct 507 ms 760 KB Output is correct
32 Correct 1371 ms 920 KB Output is correct
33 Correct 685 ms 848 KB Output is correct
34 Correct 6 ms 376 KB Output is correct
35 Correct 6 ms 376 KB Output is correct
36 Correct 6 ms 380 KB Output is correct
37 Correct 7 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 7 ms 376 KB Output is correct
40 Correct 9 ms 376 KB Output is correct
41 Correct 10 ms 376 KB Output is correct
42 Correct 10 ms 376 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 10 ms 376 KB Output is correct
45 Correct 13 ms 376 KB Output is correct
46 Correct 8 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 248 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 248 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 248 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 248 KB Output is correct
55 Correct 2 ms 248 KB Output is correct
56 Correct 2 ms 248 KB Output is correct
57 Correct 2 ms 248 KB Output is correct
58 Correct 2 ms 248 KB Output is correct
59 Correct 2 ms 248 KB Output is correct
60 Correct 1 ms 376 KB Output is correct
61 Correct 2 ms 248 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 248 KB Output is correct
65 Correct 2 ms 248 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 15 ms 376 KB Output is correct
68 Correct 2 ms 248 KB Output is correct
69 Correct 2 ms 248 KB Output is correct
70 Correct 2 ms 380 KB Output is correct
71 Correct 2 ms 248 KB Output is correct
72 Correct 2 ms 248 KB Output is correct