oj.uz

Submission #68857

# Submission time Handle Problem Language Result Execution time Memory
68857 2018-08-18T20:04:14 Z duality Amusement Park (JOI17_amusement_park) C++14
18 / 100
 46 ms 11880 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#include "Joi.h"

static int parent[10000];
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];
static int message[10000];
static int doDFS(int u,int p) {
    int i;
    int m = 0,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 doDFS2(int u,int p,LLI X) {
    int i;
    if (num < 60) {
        MessageBoard(u,((X & (1LL << num)) > 0));
        message[u] = 1;
    }
    num++;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) 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 j,f = 0;
    doDFS(0,-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;
        }
    }*/
    f = 0;
    if (!f) doDFS2(0,-1,X);
    for (i = 0; i < N; i++) {
        if (!message[i]) MessageBoard(i,0);
    }
}

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#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];
static int doDFS(int u,int p) {
    int i;
    int m = 0,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;
            m = max(m,r+1);
        }
    }
    nxt[u] = mv;
    if (m == 60) {
        key[u] = 1;
        return 0;
    }
    else return m;
}
static int message[10000];
static queue<int> Q;
static int moveto(int s,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();
    vi path;
    if (!key[u]) u = 0;
    while (u != -1) path.pb(u),u = parent[u];
    for (i = path.size()-2; i >= 0; i--) message[path[i]] = Move(path[i]);
    return path[0];
}
static int num = 0;
static LLI ans = 0;
static int doDFS2(int u,int p) {
    int i;
    if (num < 60) {
        if (message[u]) ans |= (1LL << num);
    }
    num++;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            int c = num;
            if (c < 60) message[v] = Move(v);
            doDFS2(v,u);
            if (c < 60) Move(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]);
        }
    }
    //doDFS(0,-1);
    fill(message,message+N,-1);
    message[P] = V;
    int d = moveto(P,N);
    assert(d == 0);
    if (key[d]) {
        LLI X = 0;
        int u = d;
        for (i = 0; i < 60; i++) {
            if (message[i]) X |= (1LL << i);
            u = nxt[u];
        }
        return X;
    }
    else {
        doDFS2(0,-1);
        return ans;
    }
}

Compilation message

Joi.cpp: In function 'int doDFS(int, int)':
Joi.cpp:22: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:44: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:61:9: warning: unused variable 'j' [-Wunused-variable]
     int j,f = 0;
         ^

Ioi.cpp: In function 'int doDFS(int, int)':
Ioi.cpp:21: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)':
Ioi.cpp:47:23: 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:70:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1248 KB Output is correct
2 Correct 6 ms 1488 KB Output is correct
3 Correct 6 ms 1564 KB Output is correct
4 Correct 6 ms 1828 KB Output is correct
5 Correct 5 ms 1848 KB Output is correct
6 Correct 5 ms 1916 KB Output is correct
7 Correct 5 ms 1960 KB Output is correct
8 Correct 5 ms 1960 KB Output is correct
9 Correct 6 ms 1960 KB Output is correct
10 Correct 5 ms 1960 KB Output is correct
11 Correct 9 ms 2216 KB Output is correct
12 Correct 5 ms 2216 KB Output is correct
13 Correct 5 ms 2216 KB Output is correct
14 Correct 5 ms 2244 KB Output is correct
15 Correct 6 ms 2272 KB Output is correct
16 Correct 6 ms 2272 KB Output is correct
17 Correct 6 ms 2272 KB Output is correct
18 Correct 6 ms 2272 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 4256 KB Output is correct
2 Correct 35 ms 4520 KB Output is correct
3 Correct 46 ms 5016 KB Output is correct
4 Correct 31 ms 5040 KB Output is correct
5 Correct 24 ms 5256 KB Output is correct
6 Correct 22 ms 5408 KB Output is correct
7 Correct 22 ms 5600 KB Output is correct
8 Correct 22 ms 5816 KB Output is correct
9 Correct 22 ms 6016 KB Output is correct
10 Correct 20 ms 6048 KB Output is correct
11 Correct 19 ms 6156 KB Output is correct
12 Correct 19 ms 6192 KB Output is correct
13 Correct 25 ms 6248 KB Output is correct
14 Correct 23 ms 6436 KB Output is correct
15 Correct 23 ms 6656 KB Output is correct
16 Correct 24 ms 6876 KB Output is correct
17 Correct 24 ms 7016 KB Output is correct
18 Correct 24 ms 7316 KB Output is correct
19 Correct 20 ms 7624 KB Output is correct
20 Correct 18 ms 8392 KB Output is correct
21 Correct 17 ms 8516 KB Output is correct
22 Correct 22 ms 8584 KB Output is correct
23 Correct 26 ms 8712 KB Output is correct
24 Correct 28 ms 8904 KB Output is correct
25 Correct 24 ms 9176 KB Output is correct
26 Correct 24 ms 9408 KB Output is correct
27 Correct 24 ms 9568 KB Output is correct
28 Correct 26 ms 9928 KB Output is correct
29 Correct 20 ms 9928 KB Output is correct
30 Correct 23 ms 10040 KB Output is correct
31 Correct 5 ms 10040 KB Output is correct
32 Correct 5 ms 10040 KB Output is correct
33 Correct 7 ms 10040 KB Output is correct
34 Correct 6 ms 10040 KB Output is correct
35 Correct 4 ms 10040 KB Output is correct
36 Correct 7 ms 10040 KB Output is correct
37 Correct 6 ms 10040 KB Output is correct
38 Correct 6 ms 10040 KB Output is correct
39 Correct 5 ms 10040 KB Output is correct
40 Correct 5 ms 10040 KB Output is correct
41 Correct 7 ms 10040 KB Output is correct
42 Correct 5 ms 10040 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10040 KB Output is correct
2 Correct 5 ms 10040 KB Output is correct
3 Correct 5 ms 10040 KB Output is correct
4 Correct 11 ms 10040 KB Output is correct
5 Incorrect 9 ms 10040 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 36 ms 10408 KB Partially correct
2 Partially correct 33 ms 10700 KB Partially correct
3 Partially correct 33 ms 11120 KB Partially correct
4 Partially correct 23 ms 11160 KB Partially correct
5 Incorrect 22 ms 11880 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 11880 KB Output isn't correct
2 Halted 0 ms 0 KB -