Submission #967557

#	Time	Username	Problem	Language	Result	Execution time	Memory
967557		happy_node	Amusement Park (JOI17_amusement_park)	C++17	0 / 100	220 ms	262144 KiB

Joi

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

typedef long long ll;

const int MX=10005;

vector<int> adj[MX];

int timer=-1;
vector<int> euler;

void dfs(int v, int p) {
        euler.push_back(++timer);
        for(auto u:adj[v]) {
                if(u==p) continue;
                dfs(u,v);
        }
}

void Joi(int N, int M, int A[], int B[], long long X, int T) {
        for(int i=0;i<N-1;i++) {
                adj[A[i]].push_back(B[i]);
                adj[B[i]].push_back(A[i]);
        }

        dfs(0,-1);

        for(int i=0;i<N;i++) {
                int k=i%60;
                MessageBoard(euler[i],X>>k&1);
        }
}

Ioi

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

typedef long long ll;

const int MX=10005;

vector<int> ADJ[MX];

int Timer=-1;
int sz[MX], par[MX], tin[MX], tout[MX];

void DFS(int v, int p) {
        tin[v]=++Timer;
        sz[v]=1;
        par[v]=p;
        for(auto u:ADJ[v]) {
                if(u==p) continue;
                DFS(u,v);
                sz[v]+=sz[u];
        }
        tout[v]=Timer;
}

ll get(int x, int y) {
        return y*(1LL<<(tin[x]%60));
}

ll res=0;

void dfs0(int v, int p) {
        for(auto u:ADJ[v]) {
                if(u==p) continue;
                res|=get(u,Move(u));
                dfs0(u,v);
                Move(v);
        }
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
        for(int i=0;i<N-1;i++) {
                ADJ[A[i]].push_back(B[i]);
                ADJ[B[i]].push_back(A[i]);
        }

        DFS(0,-1);

        int k=V;
        while(sz[P]<60) {
                P=par[P];
                k=Move(P);
        }

        res|=get(P,k);
        dfs0(P,par[P]);

        return res;
}

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