Submission #288702

#	Time	Username	Problem	Language	Result	Execution time	Memory
288702		Kastanda	Amusement Park (JOI17_amusement_park)	C++14	10 / 100	32 ms	5328 KiB

Joi

// M
#include<bits/stdc++.h>
#include "Joi.h"
using namespace std;
static const int N = 10004, LG = 60;
static int n, ts, M[N], C[N];
static vector < int > Adj[N], Ch[N];
static void DFS(int v)
{
        M[v] = 1;
        for (int u : Adj[v])
                if (!M[u])
                        Ch[v].push_back(u), DFS(u);
}
static void Build(int v)
{
        for (int u : Ch[v])
                Build(u);
        C[v] = ts ++;
        ts %= LG;
}
void Joi(int _n, int m, int A[], int B[], long long X, int T)
{
        n = _n;
        for (int i = 0; i < m; i ++)
                Adj[A[i]].push_back(B[i]),
                Adj[B[i]].push_back(A[i]);

        for (int i = 0; i < n; i ++)
                sort(Adj[i].begin(), Adj[i].end());
        DFS(0);
        Build(0);
        for (int i = 0; i < n; i ++)
                MessageBoard(i, (X >> C[i]) & 1LL);
}

Ioi

// M
#include<bits/stdc++.h>
#include "Ioi.h"
using namespace std;
static const int N = 10004, LG = 60;
static int n, ts, M[N], C[N];
static vector < int > Adj[N], Ch[N];
void DFS2(int v)
{
        M[v] = 1;
        for (int u : Adj[v])
                if (!M[u])
                        Ch[v].push_back(u), DFS2(u);
}
void Build2(int v)
{
        for (int u : Ch[v])
                Build2(u);
        C[v] = ts ++;
        ts %= LG;
}
void Solve2(int v, int mrk)
{
        M[C[v]] = mrk;
        for (int u : Adj[v])
                if (M[C[u]] == -1)
                {
                  int tmp = Move(u);
                  	Solve2(u, tmp);
                  assert(Move(v) == mrk);
                }
}
long long Ioi(int _n, int m, int A[], int B[], int P, int V, int T)
{
        n = _n;
        for (int i = 0; i < m; i ++)
                Adj[A[i]].push_back(B[i]),
                Adj[B[i]].push_back(A[i]);

        for (int i = 0; i < n; i ++)
                sort(Adj[i].begin(), Adj[i].end());
        DFS2(0);
        Build2(0);

        memset(M, -1, sizeof(M));
        Solve2(P, V);

        long long X = 0;
        for (int i = 0; i < LG; i ++)
                if (M[i]) X |= 1LL << i;
        return X;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17