oj.uz

Submission #122240

# Submission time Handle Problem Language Result Execution time Memory
122240 2019-06-27T23:15:10 Z duality Meetings (JOI19_meetings) C++14
100 / 100
 1225 ms 16796 KB 
#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "meetings.h"

int M[2000][2000];
int lca(int v,int w) {
    if ((v == 0) || (w == 0)) return 0;
    else if (v == w) return v;
    if (M[v][w] != -1) return M[v][w];
    else {
        M[v][w] = M[w][v] = Query(0,v,w);
        return M[v][w];
    }
}
vi adjList[2000];
int done[2000];
int parent[2000],size[2000],heavy[2000];
int chain[2000],head[2000],csize[2000],tail[2000],c = 0;
int doDFS(int u,int p) {
    int i;
    parent[u] = p,size[u] = 1,heavy[u] = -1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            size[u] += doDFS(v,u);
            if ((heavy[u] == -1) || (size[v] > size[heavy[u]])) heavy[u] = v;
        }
    }
    return size[u];
}
int doHLD(int u,int p) {
    int i;
    chain[u] = c,tail[c] = u;
    if (csize[c] == 0) head[c] = u;
    csize[c]++;
    if (heavy[u] != -1) doHLD(heavy[u],u);
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && (v != heavy[u])) c++,doHLD(v,u);
    }
    return 0;
}
int add(int u,int s) {
    int i;
    if (heavy[s] == -1) {
        adjList[s].pb(u);
        adjList[u].pb(s);
        return 0;
    }
    int x = tail[chain[s]];
    int v = lca(x,u);
    if (!done[v]) {
        vi path;
        int t = s;
        while (t != -1) path.pb(t),t = heavy[t];
        int l = 1,r = path.size()-1;
        while (l < r) {
            int m = (l+r) / 2;
            if (lca(path[m],u) == v) r = m;
            else l = m+1;
        }
        adjList[path[l-1]].erase(find(adjList[path[l-1]].begin(),adjList[path[l-1]].end(),path[l]));
        adjList[path[l]].erase(find(adjList[path[l]].begin(),adjList[path[l]].end(),path[l-1]));
        adjList[path[l]].pb(v),adjList[v].pb(path[l]);
        adjList[path[l-1]].pb(v),adjList[v].pb(path[l-1]);
        if (u != v) adjList[u].pb(v),adjList[v].pb(u);
        done[v] = 1;
        return 0;
    }
    else if (v == s) {
        for (i = 0; i < adjList[s].size(); i++) {
            int t = adjList[s][i];
            if ((t == parent[s]) || (t == heavy[s])) continue;
            if (lca(tail[chain[t]],u) != s) {
                if (lca(t,u) != t) {
                    v = lca(t,u);
                    adjList[s].erase(find(adjList[s].begin(),adjList[s].end(),t));
                    adjList[t].erase(find(adjList[t].begin(),adjList[t].end(),s));
                    adjList[t].pb(v),adjList[v].pb(s);
                    adjList[s].pb(v),adjList[v].pb(t);
                    if (u != v) adjList[u].pb(v),adjList[v].pb(u);
                    done[v] = 1;
                    return 0;
                }
                else add(u,t);
                return 0;
            }
        }
        adjList[s].pb(u);
        adjList[u].pb(s);
        return 0;
    }
    else {
        vi path;
        int t = s;
        while (t != -1) path.pb(t),t = heavy[t];
        int l = 1,r = path.size()-1;
        while (l < r) {
            int m = (l+r) / 2;
            if (lca(path[m],u) == v) r = m;
            else l = m+1;
        }
        add(u,path[l]);
        return 0;
    }
}
void Solve(int N) {
    int i;
    for (i = 0; i < N; i++) fill(M[i],M[i]+N,-1);
    done[0] = 1;
    for (i = 1; i < N; i++) {
        if (!done[i]) {
            doDFS(0,-1),c = 0,doHLD(0,-1),c++;
            add(i,0),done[i] = 1;
        }
    }
    doDFS(0,-1);
    for (i = 1; i < N; i++) {
        if (parent[i] < i) Bridge(parent[i],i);
        else Bridge(i,parent[i]);
    }
}

Compilation message

meetings.cpp: In function 'int doDFS(int, int)':
meetings.cpp:76:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
meetings.cpp: In function 'int doHLD(int, int)':
meetings.cpp:91:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
meetings.cpp: In function 'int add(int, int)':
meetings.cpp:125:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[s].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 2 ms 640 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 10 ms 2048 KB Output is correct
28 Correct 10 ms 2176 KB Output is correct
29 Correct 10 ms 1920 KB Output is correct
30 Correct 10 ms 2048 KB Output is correct
31 Correct 9 ms 1920 KB Output is correct
32 Correct 11 ms 2048 KB Output is correct
33 Correct 14 ms 2048 KB Output is correct
34 Correct 16 ms 2048 KB Output is correct
35 Correct 16 ms 2048 KB Output is correct
36 Correct 10 ms 1920 KB Output is correct
37 Correct 12 ms 2040 KB Output is correct
38 Correct 13 ms 1968 KB Output is correct
39 Correct 12 ms 2048 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1099 ms 16704 KB Output is correct
2 Correct 1225 ms 16796 KB Output is correct
3 Correct 1065 ms 16508 KB Output is correct
4 Correct 1189 ms 16676 KB Output is correct
5 Correct 757 ms 16632 KB Output is correct
6 Correct 588 ms 16416 KB Output is correct
7 Correct 898 ms 16632 KB Output is correct
8 Correct 811 ms 16504 KB Output is correct
9 Correct 930 ms 16636 KB Output is correct
10 Correct 881 ms 16696 KB Output is correct
11 Correct 880 ms 16508 KB Output is correct
12 Correct 815 ms 16632 KB Output is correct
13 Correct 662 ms 16588 KB Output is correct
14 Correct 779 ms 16376 KB Output is correct
15 Correct 674 ms 16552 KB Output is correct
16 Correct 793 ms 16704 KB Output is correct
17 Correct 816 ms 16504 KB Output is correct
18 Correct 630 ms 16780 KB Output is correct
19 Correct 620 ms 16648 KB Output is correct
20 Correct 820 ms 16632 KB Output is correct
21 Correct 806 ms 16704 KB Output is correct
22 Correct 844 ms 16572 KB Output is correct
23 Correct 754 ms 16400 KB Output is correct
24 Correct 836 ms 16680 KB Output is correct
25 Correct 761 ms 16504 KB Output is correct
26 Correct 729 ms 16504 KB Output is correct
27 Correct 771 ms 16656 KB Output is correct
28 Correct 1038 ms 16636 KB Output is correct
29 Correct 1083 ms 16576 KB Output is correct
30 Correct 880 ms 16520 KB Output is correct
31 Correct 894 ms 16508 KB Output is correct
32 Correct 1221 ms 16760 KB Output is correct
33 Correct 929 ms 16732 KB Output is correct
34 Correct 9 ms 2048 KB Output is correct
35 Correct 10 ms 2048 KB Output is correct
36 Correct 10 ms 1920 KB Output is correct
37 Correct 11 ms 2048 KB Output is correct
38 Correct 8 ms 1920 KB Output is correct
39 Correct 11 ms 2048 KB Output is correct
40 Correct 14 ms 2048 KB Output is correct
41 Correct 16 ms 2048 KB Output is correct
42 Correct 16 ms 2048 KB Output is correct
43 Correct 10 ms 2048 KB Output is correct
44 Correct 12 ms 2048 KB Output is correct
45 Correct 13 ms 2048 KB Output is correct
46 Correct 12 ms 2048 KB Output is correct
47 Correct 2 ms 668 KB Output is correct
48 Correct 2 ms 640 KB Output is correct
49 Correct 2 ms 640 KB Output is correct
50 Correct 2 ms 640 KB Output is correct
51 Correct 3 ms 640 KB Output is correct
52 Correct 2 ms 640 KB Output is correct
53 Correct 3 ms 640 KB Output is correct
54 Correct 2 ms 640 KB Output is correct
55 Correct 3 ms 640 KB Output is correct
56 Correct 2 ms 640 KB Output is correct
57 Correct 2 ms 640 KB Output is correct
58 Correct 2 ms 640 KB Output is correct
59 Correct 2 ms 640 KB Output is correct
60 Correct 2 ms 512 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 2 ms 384 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 384 KB Output is correct
66 Correct 2 ms 512 KB Output is correct
67 Correct 2 ms 384 KB Output is correct
68 Correct 2 ms 512 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 2 ms 512 KB Output is correct
71 Correct 2 ms 512 KB Output is correct
72 Correct 2 ms 384 KB Output is correct