oj.uz

Submission #187542

# Submission time Handle Problem Language Result Execution time Memory
187542 2020-01-13T03:21:36 Z ToMmyDong Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1280 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ(i) int(i.size())


struct Subtree {
    int rt;
    vector<int> nd;
};

void solve (vector<int> node) {
    int rt = node[0];

    vector<Subtree> sub;
    for (int i=1;i<SZ(node);i++) {
        bool flag = false;
        for (auto &tr : sub) {
            int ret = Query(tr.rt, node[i], rt);
            if (ret != rt) {
                if (ret == node[i]) {
                   tr.rt =  node[i];
                }
                tr.nd.emplace_back(node[i]);
                flag = true;
                break;
            }
        }
        if (!flag) {
            sub.push_back({node[i],{node[i]}});
        }
    }

    for (auto tr : sub) {
        if (rt < tr.rt) {
            Bridge(rt, tr.rt);
        } else {
            Bridge(tr.rt, rt);
        }
        solve(tr.nd);
    }
}

void Solve(int N) {
    vector<int> node;
    for (int i=0;i<N;i++) {
        node.emplace_back(i);
    }

    srand(279936);
    random_shuffle(node.begin(),node.end());
    solve(node);

}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 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 3 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 424 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 3 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 4 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 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 3 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 424 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 248 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 280 KB Output is correct
26 Correct 3 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 4 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 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 3 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 424 KB Output is correct
10 Correct 1 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 2 ms 296 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 248 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 280 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 37 ms 552 KB Output is correct
28 Correct 29 ms 504 KB Output is correct
29 Correct 77 ms 808 KB Output is correct
30 Correct 31 ms 664 KB Output is correct
31 Correct 36 ms 484 KB Output is correct
32 Correct 39 ms 624 KB Output is correct
33 Correct 46 ms 632 KB Output is correct
34 Correct 54 ms 632 KB Output is correct
35 Correct 61 ms 636 KB Output is correct
36 Correct 31 ms 504 KB Output is correct
37 Correct 12 ms 376 KB Output is correct
38 Correct 12 ms 376 KB Output is correct
39 Correct 12 ms 376 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 1280 KB Time limit exceeded
2 Halted 0 ms 0 KB -