제출 #1267499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267499		somefolk	Traffic (IOI10_traffic)	C++20	0 / 100	0 ms	320 KiB

traffic

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
#include "traffic.h"
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 2e9+7;
const int MOD = 1e9+7;

int n;
vector<int> a;
vector<vector<int>> adj;

void init(int N, int p[], int s[], int d[]){
    n = N;
    adj.resize(n);
    for(int i = 0; i < n-1; i++){
        adj[s[i]].push_back(d[i]);
        adj[d[i]].push_back(s[i]);
    }
    a.resize(n);
    for(int i = 0; i < n; i++){
        a[i] = p[i];
    }
}

int sol = -1, mx = INF, total = 0;

void dfs(int u, int p, int sum = 0){
    if(max(sum, total-sum) < mx){
        mx = max(sum, total-sum);
        sol = u;
    }
    for(auto &v : adj[u]){
        if(v == p) continue;
        dfs(v, u, sum+a[v]);
    }
}

int LocateCentre(int N, int p[], int s[], int d[]){
    init(N, p, s, d);

    for(auto &i : a) total += i;

    dfs(0, -1);

    return sol;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25