제출 #427320

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
427320		cpp219	Traffic (IOI10_traffic)	C++14	0 / 100	43 ms	70724 KiB

traffic

#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e6 + 9;
const ll inf = 1e9 + 7;
const ll Log2 = 20;
typedef pair<ll,ll> LL;
vector<ll> g[N],euler;
ll n,a[N],mn = inf,cnt = 0,child[N],InitChild[N],sum;
set<LL> s[N];

void DFSinit(ll u,ll p){
    child[u] = a[u];
    for (auto i : g[u]){
        if (i == p) continue;
        DFSinit(i,u); child[u] += child[i];
        s[u].insert({child[i],i});
    }
    InitChild[u] = child[u];
}

void DFS(ll u,ll p){
    LL now = *s[u].rbegin(),rm = {sum - child[u],-1};
    now = max(now,rm);
    if (now.fs < mn) mn = now.fs,cnt = 1;
    else if (now.fs == mn) cnt++;
    for (auto i : g[u]){
        if (i == p) continue;
        s[u].erase({child[i],i}); s[i].insert({sum - child[i],u});
        //cout<<child[i]<<" "<<i; exit(0);
        child[u] = sum - child[i]; child[i] = sum;
        DFS(i,u);
    }
    if (p >= 0){
        child[u] = InitChild[u];
        s[p].insert({child[u],u}); s[u].erase({child[p],p});
        child[p] = InitChild[p];
    }
}

ll LocateCentre(ll sz,ll P[],ll X[],ll Y[]){
    n = sz;
    for (ll i = 0;i < n;i++) a[i] = P[i],sum += a[i];
    for (ll i = 0;i < n - 1;i++){
        g[X[i]].push_back(Y[i]); g[Y[i]].push_back(X[i]);
    }
    DFSinit(0,-1); DFS(0,-1);
    return cnt;
}

컴파일 시 표준 에러 (stderr) 메시지

traffic.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
traffic.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      |

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