oj.uz

Submission #126906

# Submission time Handle Problem Language Result Execution time Memory
126906 2019-07-08T15:22:10 Z Osama_Alkhodairy Meetings (JOI19_meetings) C++17
100 / 100
 1819 ms 1292 KB 
#include <bits/stdc++.h>
#include "meetings.h"
//~ #include "grader.cpp"
using namespace std;

const int maxn = 2001;

int n, dep[maxn];
vector <int> p, pans, v[maxn];
int asked = 0;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void dfsz(int node){
    for(auto &i : v[node]){
        dep[i] = dep[node] + 1;
        dfsz(i);
    }
}
int LCA(int a, int b){
    if(a == b) return a;
    if(a == 0 || b == 0) return 0;
    return Query(0, a, b);
}
void solve(vector <int> a){
    if(a.size() <= 1) return;
    shuffle(a.begin(), a.end(), rng);
    int leaf = -1;
    for(auto &i : a){
        leaf = i;
        break;
    }
    if(leaf == -1) return;
    vector <int> q(n + 1);
    vector <int> anc;
    for(auto &i : a){
        q[i] = LCA(i, leaf);
        anc.push_back(q[i]);
    }
    sort(anc.begin(), anc.end());
    anc.resize(unique(anc.begin(), anc.end()) - anc.begin());
    sort(anc.begin(), anc.end(), [&](int a, int b){
        return LCA(a, b) == a;
    });
    for(int i = 1 ; i < (int)anc.size() ; i++)
        pans[anc[i]] = anc[i - 1];
    for(auto &i : anc){
        vector <int> c;
        for(auto &j : a){
            if(q[j] == i && i != j){
                c.push_back(j);
                pans[j] = i;
            }
        }
        solve(c);
    }
}
void bridge(int a, int b){
    if(b < a) swap(a, b);
    Bridge(a, b);
}
void go(){
    asked = 0;
    for(int i = 0 ; i < n ; i++){
        v[i].clear();
    }
    p.assign(n + 1, -1);
    int root = -1;
    for(int i = 0 ; i < n ; i++){
        if(p[i] == -1) root = i;
        else v[p[i]].push_back(i);
    }
    dfsz(root);
    pans.assign(n + 1, -1);
    vector <int> all;
    for(int i = 0 ; i < n ; i++){
        all.push_back(i);
    }
    solve(all);
    for(int i = 1 ; i < n ; i++){
        bridge(i, pans[i]);
    }
}
void Solve(int N) {
    n = N;
    go();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory 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 376 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 376 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 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 376 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 376 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 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 424 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory 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 376 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 376 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 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 424 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 7 ms 376 KB Output is correct
28 Correct 7 ms 376 KB Output is correct
29 Correct 8 ms 376 KB Output is correct
30 Correct 8 ms 376 KB Output is correct
31 Correct 7 ms 508 KB Output is correct
32 Correct 11 ms 508 KB Output is correct
33 Correct 15 ms 504 KB Output is correct
34 Correct 17 ms 504 KB Output is correct
35 Correct 17 ms 524 KB Output is correct
36 Correct 7 ms 376 KB Output is correct
37 Correct 14 ms 376 KB Output is correct
38 Correct 16 ms 504 KB Output is correct
39 Correct 14 ms 376 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 767 ms 784 KB Output is correct
2 Correct 816 ms 872 KB Output is correct
3 Correct 798 ms 828 KB Output is correct
4 Correct 778 ms 860 KB Output is correct
5 Correct 349 ms 808 KB Output is correct
6 Correct 444 ms 868 KB Output is correct
7 Correct 705 ms 1124 KB Output is correct
8 Correct 837 ms 1032 KB Output is correct
9 Correct 977 ms 1076 KB Output is correct
10 Correct 925 ms 1292 KB Output is correct
11 Correct 935 ms 1116 KB Output is correct
12 Correct 780 ms 888 KB Output is correct
13 Correct 374 ms 788 KB Output is correct
14 Correct 589 ms 884 KB Output is correct
15 Correct 602 ms 912 KB Output is correct
16 Correct 517 ms 920 KB Output is correct
17 Correct 884 ms 1088 KB Output is correct
18 Correct 545 ms 936 KB Output is correct
19 Correct 476 ms 888 KB Output is correct
20 Correct 589 ms 904 KB Output is correct
21 Correct 588 ms 788 KB Output is correct
22 Correct 649 ms 780 KB Output is correct
23 Correct 711 ms 1116 KB Output is correct
24 Correct 568 ms 876 KB Output is correct
25 Correct 589 ms 944 KB Output is correct
26 Correct 583 ms 1136 KB Output is correct
27 Correct 614 ms 888 KB Output is correct
28 Correct 945 ms 1092 KB Output is correct
29 Correct 970 ms 1192 KB Output is correct
30 Correct 922 ms 1024 KB Output is correct
31 Correct 884 ms 1072 KB Output is correct
32 Correct 1819 ms 936 KB Output is correct
33 Correct 1109 ms 1020 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 460 KB Output is correct
36 Correct 8 ms 376 KB Output is correct
37 Correct 7 ms 508 KB Output is correct
38 Correct 7 ms 376 KB Output is correct
39 Correct 10 ms 376 KB Output is correct
40 Correct 14 ms 504 KB Output is correct
41 Correct 17 ms 504 KB Output is correct
42 Correct 17 ms 504 KB Output is correct
43 Correct 7 ms 504 KB Output is correct
44 Correct 14 ms 376 KB Output is correct
45 Correct 15 ms 376 KB Output is correct
46 Correct 13 ms 376 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 2 ms 504 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 504 KB Output is correct
52 Correct 2 ms 504 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 504 KB Output is correct
57 Correct 2 ms 504 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 504 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 380 KB Output is correct
63 Correct 2 ms 376 KB Output is correct
64 Correct 2 ms 376 KB Output is correct
65 Correct 2 ms 376 KB Output is correct
66 Correct 2 ms 376 KB Output is correct
67 Correct 2 ms 376 KB Output is correct
68 Correct 2 ms 376 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 2 ms 376 KB Output is correct
72 Correct 2 ms 376 KB Output is correct