Submission #401849

#	Time	Username	Problem	Language	Result	Execution time	Memory
401849		timmyfeng	Amusement Park (JOI17_amusement_park)	C++17	18 / 100	26 ms	3696 KiB

Joi

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

#include <Joi.h>

void Joi(int n, int m, int *a, int *b, long long x, int t) {
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; ++i) {
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }

    vector<bool> visited(n);
    auto dfs = [&](int u, auto &self) -> void {
        MessageBoard(u, x % 2);
        x /= 2;

        visited[u] = true;
        for (auto c : adj[u]) {
            if (!visited[c]) {
                self(c, self);
            }
        }
    };

    dfs(0, dfs);
}

Ioi

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

#include <Ioi.h>

const int L = 60;

long long Ioi(int n, int m, int *a, int *b, int p, int v, int t) {
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; ++i) {
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }

    vector<int> path;
    vector<bool> visited(n);
    auto dfs_find = [&](int u, auto &self) -> bool {
        visited[u] = true;
        if (u == 0) {
            return true;
        }

        for (auto c : adj[u]) {
            if (!visited[c] && self(c, self)) {
                path.push_back(c);
                return true;
            }
        }
        return false;
    };

    dfs_find(p, dfs_find);

    reverse(path.begin(), path.end());

    for (auto u : path) {
        v = Move(u);
    }

    long long ans = 0, bit = 1;
    visited.assign(n, false);
    auto dfs_read = [&](int u, auto &self) -> bool {
        ans += v * bit;
        bit *= 2;

        if (__lg(bit) == L) {
            return true;
        }

        visited[u] = true;
        for (auto c : adj[u]) {
            if (!visited[c]) {
                v = Move(c);
                if (self(c, self)) {
                    return true;
                }
                v = Move(u);
            }
        }
        return false;
    };

    dfs_read(0, dfs_read);

    return ans;
}

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