oj.uz

Submission #249450

# Submission time Handle Problem Language Result Execution time Memory
249450 2020-07-15T04:47:10 Z dantoh000 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1052 KB 
#include "meetings.h"

#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> v, int root){
    //printf("solving ");
    //for (auto x : v) printf("%d ",x);
    //printf(", %d\n",root);
    if (v.size() == 1) return;
    if (v.size() == 2){
        if (v[0] > v[1]) swap(v[0],v[1]);
        Bridge(v[0],v[1]);
        return;
    }
    random_shuffle(v.begin(),v.end());
    int cur = v[0] == root ? v[1] : v[0];
    //printf("cur %d, root %d\n",cur,root);
    for (auto x : v){
        if (x == cur || x == root ) continue;
        int Q = Query(root,cur,x);
        if (Q != root) cur = Q;
    }
    //printf("cur %d, root %d\n",cur,root);
    if (cur > root) swap(cur,root);
    Bridge(cur,root);
    vector<int> L, R;
    for (auto x : v){
        if (x == cur || x == root) continue;
        int Q = Query(root,cur,x);
        assert(Q == root || Q == cur);
        if (Q == root) R.push_back(x);
        else L.push_back(x);
    }
    L.push_back(cur);
    R.push_back(root);
    solve(L,cur);
    solve(R,root);
}
void Solve(int N) {
    vector<int> cur;
    for (int i = 0; i < N; i++) cur.push_back(i);
    solve(cur,0);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 22 ms 384 KB Output is correct
28 Correct 24 ms 384 KB Output is correct
29 Correct 21 ms 384 KB Output is correct
30 Correct 26 ms 384 KB Output is correct
31 Correct 21 ms 384 KB Output is correct
32 Correct 19 ms 384 KB Output is correct
33 Correct 35 ms 384 KB Output is correct
34 Correct 31 ms 384 KB Output is correct
35 Correct 32 ms 384 KB Output is correct
36 Correct 25 ms 384 KB Output is correct
37 Correct 203 ms 632 KB Output is correct
38 Correct 266 ms 760 KB Output is correct
39 Correct 343 ms 1052 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1946 ms 928 KB Output is correct
2 Execution timed out 2089 ms 788 KB Time limit exceeded
3 Halted 0 ms 0 KB -