Submission #650660

# Submission time Handle Problem Language Result Execution time Memory
650660 2022-10-14T14:23:29 Z OttoTheDino Meetings (JOI19_meetings) C++17
100 / 100
1076 ms 1072 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});
        stable_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]));
    }
# Verdict Execution time Memory Grader output
1 Correct 1 ms 392 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 392 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 388 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
# Verdict Execution time Memory Grader output
1 Correct 1 ms 392 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 388 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 8 ms 336 KB Output is correct
29 Correct 8 ms 336 KB Output is correct
30 Correct 11 ms 336 KB Output is correct
31 Correct 8 ms 336 KB Output is correct
32 Correct 11 ms 424 KB Output is correct
33 Correct 14 ms 428 KB Output is correct
34 Correct 17 ms 336 KB Output is correct
35 Correct 17 ms 440 KB Output is correct
36 Correct 9 ms 428 KB Output is correct
37 Correct 13 ms 456 KB Output is correct
38 Correct 17 ms 440 KB Output is correct
39 Correct 16 ms 464 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 607 ms 576 KB Output is correct
2 Correct 581 ms 604 KB Output is correct
3 Correct 583 ms 568 KB Output is correct
4 Correct 674 ms 568 KB Output is correct
5 Correct 550 ms 688 KB Output is correct
6 Correct 515 ms 572 KB Output is correct
7 Correct 707 ms 568 KB Output is correct
8 Correct 791 ms 584 KB Output is correct
9 Correct 802 ms 588 KB Output is correct
10 Correct 774 ms 716 KB Output is correct
11 Correct 818 ms 588 KB Output is correct
12 Correct 631 ms 712 KB Output is correct
13 Correct 557 ms 736 KB Output is correct
14 Correct 656 ms 624 KB Output is correct
15 Correct 649 ms 616 KB Output is correct
16 Correct 658 ms 608 KB Output is correct
17 Correct 720 ms 840 KB Output is correct
18 Correct 584 ms 740 KB Output is correct
19 Correct 584 ms 584 KB Output is correct
20 Correct 729 ms 720 KB Output is correct
21 Correct 746 ms 592 KB Output is correct
22 Correct 736 ms 720 KB Output is correct
23 Correct 711 ms 708 KB Output is correct
24 Correct 762 ms 728 KB Output is correct
25 Correct 714 ms 704 KB Output is correct
26 Correct 706 ms 712 KB Output is correct
27 Correct 711 ms 700 KB Output is correct
28 Correct 814 ms 704 KB Output is correct
29 Correct 792 ms 580 KB Output is correct
30 Correct 800 ms 704 KB Output is correct
31 Correct 801 ms 712 KB Output is correct
32 Correct 1076 ms 940 KB Output is correct
33 Correct 1002 ms 1072 KB Output is correct
34 Correct 7 ms 336 KB Output is correct
35 Correct 8 ms 336 KB Output is correct
36 Correct 8 ms 336 KB Output is correct
37 Correct 7 ms 336 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 10 ms 336 KB Output is correct
40 Correct 15 ms 432 KB Output is correct
41 Correct 18 ms 420 KB Output is correct
42 Correct 17 ms 436 KB Output is correct
43 Correct 7 ms 392 KB Output is correct
44 Correct 14 ms 460 KB Output is correct
45 Correct 16 ms 484 KB Output is correct
46 Correct 14 ms 464 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 392 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 1 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 1 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 1 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 1 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 1 ms 336 KB Output is correct