제출 #1370725

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1370725		TroySer	Telepathy (JOI25_telepathy)	C++20	15 / 100	42 ms	900 KiB

telepathy

#include "telepathy.h"
#include <bits/stdc++.h>

using namespace std;
using ll = int;

const ll INF = 1e9;

vector<int> Aitana(int N, vector<int> A, vector<int> B, int S, int subtask) {

    vector<vector<ll> > adjList(N);
    for (ll i = 0; i < N - 1; i++) {
        adjList[A[i]].push_back(B[i]);
        adjList[B[i]].push_back(A[i]);
    }
    
    vector<int> currPath;

    auto dfs = [&] (const auto &self, ll curr, ll prv) -> void {

        currPath.push_back(curr);

        ll numCycle = 0;

        for (auto &v: adjList[curr]) {
            if (v == prv) continue;
            numCycle++;
            self(self, v, curr);
            currPath.push_back(curr);
        }

    };

    dfs(dfs, S, -1);

    while (currPath.size() <= 10*N) {
        currPath.push_back(currPath[(ll)currPath.size() - 1]);
    }

    return currPath;

}

vector<int> Bruno(int N, vector<int> C, vector<int> D, int T, int subtask) {
    
    vector<int> currPath(10*N + 1, T);
    return currPath;

}

• 서브태스크 1: 6 / 40
• 서브태스크 2: 6 / 40
• 서브태스크 3: 3 / 20