oj.uz

Submission #249456

# Submission time Handle Problem Language Result Execution time Memory
249456 2020-07-15T05:00:52 Z dantoh000 Meetings (JOI19_meetings) C++14
7 / 100
 2000 ms 760 KB 
#include <bits/stdc++.h>
#include "meetings.h"
int col[2005];
int n;
using namespace std;
void solve(int id){
    /*printf("solving ");
    for (auto x : v) printf("%d ",x);
    printf("\n");*/
    vector<int> v;
    for (int i = 0; i < n; i++){
        if (col[i] == id) v.push_back(i);
    }
    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;
    }
    int p = v[0], q = v[1];
    //printf("cur %d, root %d\n",cur,root);
    for (auto x : v){
        if (x == p || x == q) continue;
        int Q = Query(p,q,x);
        if (Q != p) q = Q;
    }
    //printf("cur %d, root %d\n",cur,root);
    if (p > q) swap(p,q);
    Bridge(p,q);
    for (auto x : v){
        if (x == q || x == p) continue;
        int Q = Query(p,q,x);
        if (Q == p) col[x] = 2*id;
        else col[x] = 2*id+1;
    }
    col[p] = 2*id;
    col[q] = 2*id+1;
    solve(2*id);
    solve(2*id+1);
}
void Solve(int N) {
    n = N;
    for (int i = 0; i < N; i++) col[i] = 1;
    solve(1);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 0 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 1 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 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 0 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 1 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 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 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 Incorrect 1 ms 384 KB Wrong Answer [5]
20 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 0 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 1 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 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 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 Incorrect 1 ms 384 KB Wrong Answer [5]
20 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

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