oj.uz

Submission #249463

# Submission time Handle Problem Language Result Execution time Memory
249463 2020-07-15T05:27:53 Z dantoh000 Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1112 KB 
#include <bits/stdc++.h>
#include "meetings.h"
int col[2005];
int n;
using namespace std;
void solve(int par, int sz){
    //printf("solving %d %d\n",par,sz);
    vector<int> v(sz);
    int ct = 0;
    for (int i = 0; i < n; i++){
        if (col[i] == par) {
            col[i] = -2;
            //printf("%d matches %d\n",i,par);
            v[ct++] = i;
        }
        if (sz == 1 && ct == 1){
            col[v[0]] = -1;
            return;
        }
        if (sz == 2 && ct == 2){
            if (v[0] > v[1]) swap(v[0],v[1]);
            Bridge(v[0],v[1]);
            col[v[0]] = col[v[1]] = -1;
            return;
        }
    }
    //printf("%d %d\n",sz,ct);
    assert(ct == sz);
    //printf("solving ");
    //for (auto x : v) printf("%d ",x);
    //printf("\n");
    random_shuffle(v.begin(),v.end());
    int p = v[0], q = v[1];
    //printf("cur %d, root %d\n",cur,root);
    int lct = 1, rct = 1;
    for (auto x : v){
        if (x == p || x == q) continue;
        int Q = Query(p,q,x);
        if (Q != p) {
            q = Q;
        }
        else{
            //printf("%d is p\n",x);
            col[x] = p;
            lct++;
        }
    }
    //printf("set <%d,%d>\n",p,q);
    Bridge(min(p,q),max(p,q));
    for (auto x : v){
        if (x == q || x == p) continue;
        if (col[x] == -2) {
            col[x] = q; rct++;
        }
    }
    col[p] = p;
    col[q] = q;
    solve(p,lct);
    solve(q,rct);
}
void Solve(int N) {
    n = N;
    for (int i = 0; i < N; i++) col[i] = 0;
    solve(0,n);
}

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 0 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 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 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
10.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 0 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 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 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 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 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct

Subtask #3
12.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 0 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 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 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 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 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 33 ms 508 KB Output is correct
28 Correct 29 ms 500 KB Output is correct
29 Correct 36 ms 504 KB Output is correct
30 Correct 27 ms 504 KB Output is correct
31 Correct 25 ms 384 KB Output is correct
32 Correct 26 ms 384 KB Output is correct
33 Correct 65 ms 632 KB Output is correct
34 Correct 54 ms 504 KB Output is correct
35 Correct 57 ms 504 KB Output is correct
36 Correct 26 ms 384 KB Output is correct
37 Correct 10 ms 384 KB Output is correct
38 Correct 8 ms 384 KB Output is correct
39 Correct 9 ms 384 KB Output is correct

Subtask #4
0 / 71.0

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