oj.uz

Submission #122608

# Submission time Handle Problem Language Result Execution time Memory
122608 2019-06-28T18:02:11 Z duality Meetings (JOI19_meetings) C++14
100 / 100
 1008 ms 960 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"

vi adjList[2000];
int done[2000],visited[2000],size[2000];
int doDFS(int u,int p) {
    int i;
    size[u] = 1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && !visited[v]) size[u] += doDFS(v,u);
    }
    return size[u];
}
int centroid(int u) {
    int i;
    int p = -1,r = u;
    doDFS(u,-1);
    while (1) {
        int h = -1;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if ((v != p) && !visited[v] && ((h == -1) || (size[v] > size[h]))) h = v;
        }
        if (((h == -1) || (size[h] <= (size[r]/2))) && ((size[r]-size[u]) <= (size[r]/2))) break;
        else p = u,u = h;
    }
    return u;
}
int add(int u,int s) {
    int i;
    doDFS(s,-1);
    s = centroid(s);
    doDFS(s,-1);
    vpii sub;
    for (i = 0; i < adjList[s].size(); i++) {
        int t = adjList[s][i];
        if (!visited[t]) sub.pb(mp(size[t],t));
    }
    visited[s] = 1;
    if (sub.size() & 1) sub.pb(mp(0,s));
    sort(sub.begin(),sub.end(),greater<pii>());
    for (i = 0; i < sub.size(); i += 2) {
        int v = Query(sub[i].second,sub[i+1].second,u);
        if ((v == sub[i].second) || ((v == sub[i+1].second) && (sub[i+1].second != s))) {
            add(u,v);
            return 0;
        }
        else if (v != s) {
            int t = (Query(sub[i].second,s,u) == v) ? sub[i].second:sub[i+1].second;
            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;
        }
    }
    adjList[u].pb(s),adjList[s].pb(u);
    return 0;
}
void Solve(int N) {
    int i,j;
    done[0] = 1;
    for (i = 1; i < N; i++) {
        if (!done[i]) {
            fill(visited,visited+N,0);
            add(i,0),done[i] = 1;
        }
    }
    for (i = 0; i < N; i++) {
        for (j = 0; j < adjList[i].size(); j++) {
            if (adjList[i][j] < i) Bridge(adjList[i][j],i);
        }
    }
}

Compilation message

meetings.cpp: In function 'int doDFS(int, int)':
meetings.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
meetings.cpp: In function 'int centroid(int)':
meetings.cpp:76:23: 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:91:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[s].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
meetings.cpp:98:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sub.size(); i += 2) {
                 ~~^~~~~~~~~~~~
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:128:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < adjList[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 2 ms 384 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 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 412 KB Output is correct
11 Correct 2 ms 512 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 308 KB Output is correct
2 Correct 2 ms 384 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 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 412 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 500 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 2 ms 384 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 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 412 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 500 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 7 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 9 ms 512 KB Output is correct
34 Correct 11 ms 384 KB Output is correct
35 Correct 11 ms 512 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 10 ms 384 KB Output is correct
38 Correct 11 ms 512 KB Output is correct
39 Correct 11 ms 640 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 828 KB Output is correct
2 Correct 726 ms 888 KB Output is correct
3 Correct 713 ms 808 KB Output is correct
4 Correct 663 ms 760 KB Output is correct
5 Correct 472 ms 736 KB Output is correct
6 Correct 398 ms 816 KB Output is correct
7 Correct 441 ms 680 KB Output is correct
8 Correct 497 ms 824 KB Output is correct
9 Correct 551 ms 888 KB Output is correct
10 Correct 473 ms 760 KB Output is correct
11 Correct 598 ms 760 KB Output is correct
12 Correct 739 ms 888 KB Output is correct
13 Correct 597 ms 900 KB Output is correct
14 Correct 561 ms 888 KB Output is correct
15 Correct 520 ms 756 KB Output is correct
16 Correct 528 ms 900 KB Output is correct
17 Correct 530 ms 900 KB Output is correct
18 Correct 479 ms 760 KB Output is correct
19 Correct 470 ms 904 KB Output is correct
20 Correct 610 ms 892 KB Output is correct
21 Correct 719 ms 760 KB Output is correct
22 Correct 630 ms 892 KB Output is correct
23 Correct 610 ms 936 KB Output is correct
24 Correct 579 ms 760 KB Output is correct
25 Correct 596 ms 684 KB Output is correct
26 Correct 607 ms 760 KB Output is correct
27 Correct 573 ms 828 KB Output is correct
28 Correct 561 ms 816 KB Output is correct
29 Correct 478 ms 760 KB Output is correct
30 Correct 471 ms 880 KB Output is correct
31 Correct 483 ms 840 KB Output is correct
32 Correct 1008 ms 908 KB Output is correct
33 Correct 739 ms 960 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 8 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 7 ms 468 KB Output is correct
39 Correct 7 ms 384 KB Output is correct
40 Correct 9 ms 512 KB Output is correct
41 Correct 11 ms 512 KB Output is correct
42 Correct 11 ms 384 KB Output is correct
43 Correct 7 ms 512 KB Output is correct
44 Correct 11 ms 512 KB Output is correct
45 Correct 10 ms 384 KB Output is correct
46 Correct 10 ms 384 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 512 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 512 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 384 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 384 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 2 ms 512 KB Output is correct
66 Correct 2 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 2 ms 304 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 2 ms 384 KB Output is correct
72 Correct 2 ms 512 KB Output is correct