제출 #371591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371591		ignaciocanta	Traffic (IOI10_traffic)	C++14	50 / 100	20 ms	2156 KiB

traffic

#include <bits/stdc++.h>
#include <traffic.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<tint,tint>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;

#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert


#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const int mod = 998244353;
const int MX = 4005; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
  //  freopen((name+".in").c_str(), "r", stdin);
  //  freopen((name+".out").c_str(), "w", stdout);
}

vi adj[MX];
int sum[MX];
int ret = inf;
int nodo;
int sumTot = 0;

void dfs(int node, int pa){
    int maxiAct = -inf;
    trav(u, adj[node]){
        if(u != pa){
            dfs(u, node);
            maxiAct = max(maxiAct, sum[u]);
            sum[node] += sum[u];
        }
    }
    int sumDad = sumTot-sum[node];
    maxiAct = max(maxiAct, sumDad);
    if(maxiAct < ret){
        ret = maxiAct;
        nodo = node;
    }
}

int LocateCentre(int n, int p[], int d[], int s[]){
	F0R(i, n-1){
		adj[d[i]].pb(s[i]);
		adj[s[i]].pb(d[i]);
	}
    F0R(i, n) sum[i] = p[i], sumTot += p[i];
    dfs(0, -1);
	return nodo;
}

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