oj.uz

답안 #68884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68884 2018-08-18T23:04:43 Z duality Amusement Park (JOI17_amusement_park) C++14
100 / 100
 39 ms 5504 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 "Joi.h"

static int parent[10000];
static int find(int n) {
    if (parent[n] != n) parent[n] = find(parent[n]);
    return parent[n];
}
static vi adjList[10000];
static int key[10000],nxt[10000],heavy[10000];
static int visited[10000];
static queue<int> Q;
static int doDFS(int u,int p) {
    int i;
    int m = 1,mv = -1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            int r = doDFS(v,u);
            if (r+1 > m) m = r+1,mv = v;
        }
    }
    nxt[u] = mv;
    if (m == 60) {
        key[u] = 1;
        return 0;
    }
    else return m;
}
static int num = 0;
static int message[10000];
static int doDFS2(int u,int p,LLI X) {
    int i;
    if (num < 60) {
        MessageBoard(u,((X & (1LL << num)) > 0));
        message[u] = 1;
    }
    num++;
    if (heavy[u] != -1) doDFS2(heavy[u],u,X);
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && (v != heavy[u])) doDFS2(v,u,X);
    }
    return 0;
}
void Joi(int N,int M,int A[],int B[],long long int X,int T) {
    int i;
    for (i = 0; i < N; i++) parent[i] = i;
    for (i = 0; i < M; i++) {
        int pa = find(A[i]),pb = find(B[i]);
        if (pa != pb) {
            parent[pa] = pb;
            adjList[A[i]].pb(B[i]);
            adjList[B[i]].pb(A[i]);
        }
    }
    int e = 0,e2 = 0;
    Q.push(0);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        e = u;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if (!visited[v]) {
                visited[v] = 1;
                Q.push(v);
            }
        }
    }
    fill(parent,parent+N,-1);
    fill(visited,visited+N,0);
    Q.push(e);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        e2 = u;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if (!visited[v]) {
                visited[v] = 1;
                parent[v] = u;
                Q.push(v);
            }
        }
    }
    fill(heavy,heavy+N,-1);
    while (e2 != e) heavy[parent[e2]] = e2,e2 = parent[e2];
    int j,f = 0;
    doDFS(e,-1);
    for (i = 0; i < N; i++) {
        if (key[i]) {
            int u = i;
            for (j = 0; j < 60; j++) {
                MessageBoard(u,((X & (1LL << j)) > 0));
                message[u] = 1;
                u = nxt[u];
            }
            f = 1;
        }
    }
    if (!f) doDFS2(e,-1,X);
    for (i = 0; i < N; i++) {
        if (!message[i]) MessageBoard(i,0);
    }
}

#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 "Ioi.h"

static int parent[10000];
static int find(int n) {
    if (parent[n] != n) parent[n] = find(parent[n]);
    return parent[n];
}
static vi adjList[10000];
static int key[10000],nxt[10000],heavy[10000];
static int visited[10000];
static queue<int> Q;
static int doDFS(int u,int p) {
    int i;
    int m = 1,mv = -1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            int r = doDFS(v,u);
            if (r+1 > m) m = r+1,mv = v;
        }
    }
    nxt[u] = mv;
    if (m == 60) {
        key[u] = 1;
        return 0;
    }
    else return m;
}
static int num = 0;
static int sub[10000];
static int doDFS2(int u,int p) {
    int i;
    if (num < 60) sub[u] = num;
    num++;
    if (heavy[u] != -1) doDFS2(heavy[u],u);
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && (v != heavy[u])) doDFS2(v,u);
    }
    return 0;
}
static int message[10000];
static int moveto(int s,int e,int N) {
    int i,u;
    fill(parent,parent+N,-1);
    Q.push(s);
    while (!Q.empty()) {
        u = Q.front();
        Q.pop();

        if (key[u]) break;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if ((v != s) && (parent[v] == -1)) {
                parent[v] = u;
                Q.push(v);
            }
        }
    }
    while (!Q.empty()) Q.pop();
    if (!key[u]) {
        u = e;
        vi path;
        while (u != -1) path.pb(u),u = parent[u];
        if (sub[path.back()] != -1) return path.back();
        for (i = (int) path.size()-2; i >= 0; i--) {
            message[path[i]] = Move(path[i]);
            if (sub[path[i]] != -1) return path[i];
        }
    }
    vi path;
    while (u != -1) path.pb(u),u = parent[u];
    for (i = (int) path.size()-2; i >= 0; i--) message[path[i]] = Move(path[i]);
    return path[0];
}
static LLI ans = 0;
static int path[10000];
static int doDFS3(int u,int e,int p) {
    int i;
    path[u] = 1;
    if (u == e) return 1;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            if (doDFS3(v,e,u)) return 1;
        }
    }
    path[u] = 0;
    return 0;
}
static int doDFS4(int u,int p) {
    int i;
    if (message[u]) ans |= (1LL << sub[u]);
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && !path[v] && (sub[v] != -1)) {
            message[v] = Move(v);
            doDFS4(v,u);
            Move(u);
        }
    }
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if ((v != p) && path[v] && (sub[v] != -1)) {
            message[v] = Move(v);
            doDFS4(v,u);
        }
    }
    return 0;
}
long long int Ioi(int N,int M,int A[],int B[],int P,int V,int T) {
    int i;
    for (i = 0; i < N; i++) parent[i] = i;
    for (i = 0; i < M; i++) {
        int pa = find(A[i]),pb = find(B[i]);
        if (pa != pb) {
            parent[pa] = pb;
            adjList[A[i]].pb(B[i]);
            adjList[B[i]].pb(A[i]);
        }
    }
    int e = 0,e2 = 0;
    Q.push(0);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        e = u;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if (!visited[v]) {
                visited[v] = 1;
                Q.push(v);
            }
        }
    }
    fill(parent,parent+N,-1);
    fill(visited,visited+N,0);
    Q.push(e);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        e2 = u;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if (!visited[v]) {
                visited[v] = 1;
                parent[v] = u;
                Q.push(v);
            }
        }
    }
    fill(heavy,heavy+N,-1);
    while (e2 != e) heavy[parent[e2]] = e2,e2 = parent[e2];
    fill(sub,sub+N,-1);
    doDFS(e,-1),doDFS2(e,-1);
    fill(message,message+N,-1);
    message[P] = V;
    int d = moveto(P,e,N);
    if (key[d]) {
        LLI X = 0;
        int u = d;
        for (i = 0; i < 60; i++) {
            if (message[u]) X |= (1LL << i);
            u = nxt[u];
            if (i < 59) message[u] = Move(u);
        }
        return X;
    }
    else {
        doDFS3(d,e,-1),doDFS4(d,-1);
        return ans;
    }
}

Compilation message

Joi.cpp: In function 'int doDFS(int, int)':
Joi.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Joi.cpp: In function 'int doDFS2(int, int, LLI)':
Joi.cpp:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Joi.cpp: In function 'void Joi(int, int, int*, int*, long long int, int)':
Joi.cpp:119:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Joi.cpp:135:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Ioi.cpp: In function 'int doDFS(int, int)':
Ioi.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int doDFS2(int, int)':
Ioi.cpp:92:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int moveto(int, int, int)':
Ioi.cpp:108:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int doDFS3(int, int, int)':
Ioi.cpp:138:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'int doDFS4(int, int)':
Ioi.cpp:150:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp:158:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:185:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Ioi.cpp:201:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1344 KB Output is correct
2 Correct 7 ms 1448 KB Output is correct
3 Correct 5 ms 1588 KB Output is correct
4 Correct 5 ms 1680 KB Output is correct
5 Correct 5 ms 1720 KB Output is correct
6 Correct 6 ms 1792 KB Output is correct
7 Correct 5 ms 1812 KB Output is correct
8 Correct 4 ms 1832 KB Output is correct
9 Correct 5 ms 1848 KB Output is correct
10 Correct 6 ms 1964 KB Output is correct
11 Correct 9 ms 2064 KB Output is correct
12 Correct 5 ms 2064 KB Output is correct
13 Correct 6 ms 2064 KB Output is correct
14 Correct 7 ms 2064 KB Output is correct
15 Correct 6 ms 2064 KB Output is correct
16 Correct 8 ms 2064 KB Output is correct
17 Correct 6 ms 2088 KB Output is correct
18 Correct 6 ms 2112 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4292 KB Output is correct
2 Correct 36 ms 4360 KB Output is correct
3 Correct 38 ms 4360 KB Output is correct
4 Correct 31 ms 4360 KB Output is correct
5 Correct 27 ms 5108 KB Output is correct
6 Correct 25 ms 5120 KB Output is correct
7 Correct 27 ms 5120 KB Output is correct
8 Correct 24 ms 5120 KB Output is correct
9 Correct 25 ms 5120 KB Output is correct
10 Correct 27 ms 5120 KB Output is correct
11 Correct 25 ms 5120 KB Output is correct
12 Correct 25 ms 5120 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 28 ms 5120 KB Output is correct
15 Correct 32 ms 5120 KB Output is correct
16 Correct 24 ms 5120 KB Output is correct
17 Correct 25 ms 5120 KB Output is correct
18 Correct 26 ms 5120 KB Output is correct
19 Correct 26 ms 5120 KB Output is correct
20 Correct 18 ms 5120 KB Output is correct
21 Correct 25 ms 5120 KB Output is correct
22 Correct 27 ms 5120 KB Output is correct
23 Correct 23 ms 5120 KB Output is correct
24 Correct 20 ms 5120 KB Output is correct
25 Correct 23 ms 5120 KB Output is correct
26 Correct 25 ms 5120 KB Output is correct
27 Correct 23 ms 5120 KB Output is correct
28 Correct 24 ms 5120 KB Output is correct
29 Correct 20 ms 5120 KB Output is correct
30 Correct 20 ms 5120 KB Output is correct
31 Correct 4 ms 5120 KB Output is correct
32 Correct 6 ms 5120 KB Output is correct
33 Correct 6 ms 5120 KB Output is correct
34 Correct 4 ms 5120 KB Output is correct
35 Correct 4 ms 5120 KB Output is correct
36 Correct 4 ms 5120 KB Output is correct
37 Correct 5 ms 5120 KB Output is correct
38 Correct 6 ms 5120 KB Output is correct
39 Correct 4 ms 5120 KB Output is correct
40 Correct 4 ms 5120 KB Output is correct
41 Correct 5 ms 5120 KB Output is correct
42 Correct 5 ms 5120 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5120 KB Output is correct
3 Correct 5 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 9 ms 5120 KB Output is correct
8 Correct 7 ms 5120 KB Output is correct
9 Correct 20 ms 5488 KB Output is correct
10 Correct 19 ms 5496 KB Output is correct
11 Correct 20 ms 5504 KB Output is correct
12 Correct 5 ms 5504 KB Output is correct
13 Correct 5 ms 5504 KB Output is correct
14 Correct 6 ms 5504 KB Output is correct
15 Correct 4 ms 5504 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 5504 KB Output is correct
2 Correct 35 ms 5504 KB Output is correct
3 Correct 37 ms 5504 KB Output is correct
4 Correct 26 ms 5504 KB Output is correct
5 Correct 26 ms 5504 KB Output is correct
6 Correct 25 ms 5504 KB Output is correct
7 Correct 24 ms 5504 KB Output is correct
8 Correct 35 ms 5504 KB Output is correct
9 Correct 28 ms 5504 KB Output is correct
10 Correct 27 ms 5504 KB Output is correct
11 Correct 24 ms 5504 KB Output is correct
12 Correct 26 ms 5504 KB Output is correct
13 Correct 26 ms 5504 KB Output is correct
14 Correct 25 ms 5504 KB Output is correct
15 Correct 24 ms 5504 KB Output is correct
16 Correct 33 ms 5504 KB Output is correct
17 Correct 30 ms 5504 KB Output is correct
18 Correct 28 ms 5504 KB Output is correct
19 Correct 35 ms 5504 KB Output is correct
20 Correct 23 ms 5504 KB Output is correct
21 Correct 22 ms 5504 KB Output is correct
22 Correct 32 ms 5504 KB Output is correct
23 Correct 27 ms 5504 KB Output is correct
24 Correct 26 ms 5504 KB Output is correct
25 Correct 27 ms 5504 KB Output is correct
26 Correct 26 ms 5504 KB Output is correct
27 Correct 24 ms 5504 KB Output is correct
28 Correct 24 ms 5504 KB Output is correct
29 Correct 22 ms 5504 KB Output is correct
30 Correct 28 ms 5504 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 5504 KB Output is correct
2 Correct 33 ms 5504 KB Output is correct
3 Correct 35 ms 5504 KB Output is correct
4 Correct 24 ms 5504 KB Output is correct
5 Correct 25 ms 5504 KB Output is correct
6 Correct 24 ms 5504 KB Output is correct
7 Correct 27 ms 5504 KB Output is correct
8 Correct 25 ms 5504 KB Output is correct
9 Correct 36 ms 5504 KB Output is correct
10 Correct 27 ms 5504 KB Output is correct
11 Correct 24 ms 5504 KB Output is correct
12 Correct 24 ms 5504 KB Output is correct
13 Correct 25 ms 5504 KB Output is correct
14 Correct 26 ms 5504 KB Output is correct
15 Correct 26 ms 5504 KB Output is correct
16 Correct 28 ms 5504 KB Output is correct
17 Correct 24 ms 5504 KB Output is correct
18 Correct 28 ms 5504 KB Output is correct
19 Correct 25 ms 5504 KB Output is correct
20 Correct 17 ms 5504 KB Output is correct
21 Correct 22 ms 5504 KB Output is correct
22 Correct 27 ms 5504 KB Output is correct
23 Correct 23 ms 5504 KB Output is correct
24 Correct 23 ms 5504 KB Output is correct
25 Correct 31 ms 5504 KB Output is correct
26 Correct 28 ms 5504 KB Output is correct
27 Correct 27 ms 5504 KB Output is correct
28 Correct 27 ms 5504 KB Output is correct
29 Correct 24 ms 5504 KB Output is correct
30 Correct 24 ms 5504 KB Output is correct
31 Correct 5 ms 5504 KB Output is correct
32 Correct 6 ms 5504 KB Output is correct
33 Correct 6 ms 5504 KB Output is correct
34 Correct 6 ms 5504 KB Output is correct
35 Correct 6 ms 5504 KB Output is correct
36 Correct 5 ms 5504 KB Output is correct
37 Correct 6 ms 5504 KB Output is correct
38 Correct 5 ms 5504 KB Output is correct
39 Correct 6 ms 5504 KB Output is correct
40 Correct 6 ms 5504 KB Output is correct
41 Correct 6 ms 5504 KB Output is correct
42 Correct 6 ms 5504 KB Output is correct