oj.uz

Submission #579323

# Submission time Handle Problem Language Result Execution time Memory
579323 2022-06-18T21:24:48 Z OttoTheDino Meetings (JOI19_meetings) C++17
100 / 100
 1050 ms 980 KB 
#include "meetings.h"

#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                          for (int i = s; i <= e; ++i)
#define fi                                  first
#define se                                  second
#define all(a)                              a.begin(), a.end()
#define len(a)                              (int)a.size()
#define pb                                  push_back
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

const int mx = 2000;
vi kids[mx];
int sz[mx], par[mx], done[mx];

int bot (int u, int id) {
    vii ord;
    for (int v : kids[u]) ord.pb({sz[v],v});
    sort(all(ord));
    reverse(all(ord));
    if (id >= len(ord)) return u;
    return bot (ord[id].se, 0);
}

void upd (int u) {
    sz[u]++;
    if (par[u]) upd(par[u]);
}

void Solve(int n) {

    done[0] = 1;

    rep (i,1,n-1) {

        if (done[i]) continue;

        int cur = 0, id = 0, y = i, x = -1;

        while (true) {
            x = bot(cur, id);

            if (x==cur) break;

            int res = Query (0, i, x); 

            if (!done[res]) {
                if (res!=i) { 
                    par[i] = res;
                    kids[res].pb(i);
                    y = res;
                }
                break;
            }
            
            if (res!=cur) {
                cur = res;
                id = 0;
            }

            else id++;
        }
        vi a;
        while (x!=0) {
            a.pb(x);
            x = par[x];
        }
        a.pb(0);


        int lo = 0, hi = len(a)-1;
        while (lo<hi) {
            int mid = (lo+hi)/2;

            int res = Query (0, a[mid], y);

            if (res==y) lo = mid+1;
            else hi = mid;
        }

        par[y] = a[lo];
        kids[a[lo]].pb(y);

        if (lo != 0) {
            par[a[lo-1]] = y;
            kids[a[lo]].erase(find(all(kids[a[lo]]),a[lo-1]));
            kids[y].pb(a[lo-1]);
       }

        upd(i);
        if (y!=i) upd (y);
        done[i] = done[y] = 1;
    }

    rep (i,1,n-1) Bridge(min(par[i],i), max(i,par[i]));
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 8 ms 336 KB Output is correct
28 Correct 7 ms 432 KB Output is correct
29 Correct 7 ms 432 KB Output is correct
30 Correct 7 ms 336 KB Output is correct
31 Correct 7 ms 336 KB Output is correct
32 Correct 10 ms 432 KB Output is correct
33 Correct 14 ms 424 KB Output is correct
34 Correct 21 ms 420 KB Output is correct
35 Correct 16 ms 432 KB Output is correct
36 Correct 6 ms 428 KB Output is correct
37 Correct 15 ms 464 KB Output is correct
38 Correct 13 ms 460 KB Output is correct
39 Correct 13 ms 464 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 576 KB Output is correct
2 Correct 579 ms 948 KB Output is correct
3 Correct 567 ms 696 KB Output is correct
4 Correct 599 ms 568 KB Output is correct
5 Correct 504 ms 580 KB Output is correct
6 Correct 493 ms 680 KB Output is correct
7 Correct 664 ms 708 KB Output is correct
8 Correct 738 ms 584 KB Output is correct
9 Correct 763 ms 592 KB Output is correct
10 Correct 762 ms 716 KB Output is correct
11 Correct 782 ms 592 KB Output is correct
12 Correct 547 ms 904 KB Output is correct
13 Correct 524 ms 640 KB Output is correct
14 Correct 631 ms 752 KB Output is correct
15 Correct 630 ms 724 KB Output is correct
16 Correct 619 ms 712 KB Output is correct
17 Correct 694 ms 576 KB Output is correct
18 Correct 566 ms 828 KB Output is correct
19 Correct 585 ms 608 KB Output is correct
20 Correct 677 ms 712 KB Output is correct
21 Correct 711 ms 600 KB Output is correct
22 Correct 710 ms 736 KB Output is correct
23 Correct 671 ms 728 KB Output is correct
24 Correct 730 ms 980 KB Output is correct
25 Correct 691 ms 632 KB Output is correct
26 Correct 679 ms 752 KB Output is correct
27 Correct 689 ms 620 KB Output is correct
28 Correct 775 ms 584 KB Output is correct
29 Correct 769 ms 580 KB Output is correct
30 Correct 782 ms 576 KB Output is correct
31 Correct 786 ms 592 KB Output is correct
32 Correct 1050 ms 764 KB Output is correct
33 Correct 909 ms 928 KB Output is correct
34 Correct 7 ms 336 KB Output is correct
35 Correct 8 ms 432 KB Output is correct
36 Correct 9 ms 336 KB Output is correct
37 Correct 6 ms 336 KB Output is correct
38 Correct 6 ms 432 KB Output is correct
39 Correct 10 ms 432 KB Output is correct
40 Correct 15 ms 336 KB Output is correct
41 Correct 16 ms 336 KB Output is correct
42 Correct 17 ms 436 KB Output is correct
43 Correct 6 ms 336 KB Output is correct
44 Correct 11 ms 464 KB Output is correct
45 Correct 12 ms 464 KB Output is correct
46 Correct 12 ms 472 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct