Submission #112238

# Submission time Handle Problem Language Result Execution time Memory
112238 2019-05-18T03:42:22 Z kdh9949 Meetings (JOI19_meetings) C++17
100 / 100
689 ms 1016 KB
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;

using pii = pair<int, int>;
#define X first
#define Y second

static vector<pii> ans;
static vector<int> u[2005];
static int piv;

int ask(int x, int y, int z){
    return Query(x - 1, y - 1, z - 1) + 1;
}

void f(vector<int> v){
    if(v.size() <= 2){
        if(v.size() == 2) ans.emplace_back(v[0], v[1]);
        return;
    }
    for(int i : v){
        u[i].clear();
    }
    random_shuffle(v.begin(), v.end());
    u[v[0]].push_back(v[0]);
    u[v[1]].push_back(v[1]);
    for(int i = 2; i < v.size(); i++){
        int t = ask(v[0], v[1], v[i]);
        u[t].push_back(v[i]);
    }
    vector<int> w;
    for(int i : v){
        if(u[i].empty()) continue;
        w.push_back(i);
    }
    for(int i = 0; i < w.size(); i++) if(w[i] == v[0]) swap(w[0], w[i]);
    for(int i = 0; i < w.size(); i++) if(w[i] == v[1]) swap(w[w.size() - 1], w[i]);
    piv = w[0];
    if(w.size() >= 4) sort(w.begin() + 1, w.end() - 1, [](int x, int y){
        return ask(piv, x, y) == x;
    });
    for(int i = 1; i < w.size(); i++) ans.emplace_back(w[i - 1], w[i]);
    for(int i : w) f(u[i]);
}

void Solve(int n){
    vector<int> v;
    for(int i = 1; i <= n; i++) v.push_back(i);
    f(v);
    for(pii i : ans) Bridge(min(i.X, i.Y) - 1, max(i.X, i.Y) - 1);
}

Compilation message

meetings.cpp: In function 'void f(std::vector<int>)':
meetings.cpp:28:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 2; i < v.size(); i++){
                    ~~^~~~~~~~~~
meetings.cpp:37:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < w.size(); i++) if(w[i] == v[0]) swap(w[0], w[i]);
                    ~~^~~~~~~~~~
meetings.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < w.size(); i++) if(w[i] == v[1]) swap(w[w.size() - 1], w[i]);
                    ~~^~~~~~~~~~
meetings.cpp:43:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i < w.size(); i++) ans.emplace_back(w[i - 1], w[i]);
                    ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 8 ms 512 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 8 ms 384 KB Output is correct
39 Correct 10 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 395 ms 772 KB Output is correct
2 Correct 509 ms 888 KB Output is correct
3 Correct 563 ms 904 KB Output is correct
4 Correct 547 ms 888 KB Output is correct
5 Correct 301 ms 808 KB Output is correct
6 Correct 281 ms 760 KB Output is correct
7 Correct 361 ms 888 KB Output is correct
8 Correct 442 ms 760 KB Output is correct
9 Correct 481 ms 764 KB Output is correct
10 Correct 689 ms 760 KB Output is correct
11 Correct 463 ms 888 KB Output is correct
12 Correct 368 ms 760 KB Output is correct
13 Correct 300 ms 888 KB Output is correct
14 Correct 270 ms 776 KB Output is correct
15 Correct 293 ms 764 KB Output is correct
16 Correct 282 ms 760 KB Output is correct
17 Correct 482 ms 888 KB Output is correct
18 Correct 288 ms 908 KB Output is correct
19 Correct 300 ms 792 KB Output is correct
20 Correct 312 ms 788 KB Output is correct
21 Correct 335 ms 764 KB Output is correct
22 Correct 409 ms 888 KB Output is correct
23 Correct 396 ms 888 KB Output is correct
24 Correct 385 ms 956 KB Output is correct
25 Correct 386 ms 964 KB Output is correct
26 Correct 350 ms 780 KB Output is correct
27 Correct 399 ms 764 KB Output is correct
28 Correct 521 ms 924 KB Output is correct
29 Correct 428 ms 920 KB Output is correct
30 Correct 402 ms 920 KB Output is correct
31 Correct 454 ms 764 KB Output is correct
32 Correct 550 ms 952 KB Output is correct
33 Correct 405 ms 1016 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 4 ms 384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 9 ms 384 KB Output is correct
42 Correct 9 ms 512 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 8 ms 512 KB Output is correct
45 Correct 8 ms 384 KB Output is correct
46 Correct 10 ms 512 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 512 KB Output is correct
55 Correct 2 ms 412 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 388 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 384 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 1 ms 384 KB Output is correct
68 Correct 2 ms 384 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 2 ms 412 KB Output is correct
71 Correct 2 ms 384 KB Output is correct
72 Correct 2 ms 384 KB Output is correct