제출 #334185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334185		Sho10	Traffic (IOI10_traffic)	C++14	0 / 100	180 ms	262148 KiB

traffic

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#include "traffic.h"
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int tot,a[1000005],p[1000005],sub[1000005];
vector<int>g[1000005];
void dfs(int node,int par){
for(auto it : g[node]){
    if(it==node){
            continue;
    }
    dfs(it,node);
    sub[node]+=sub[it];
    p[node]=max(p[node],sub[it]);
}
p[node]=max(p[node],tot-sub[node]-a[node]);
sub[node]+=a[node];
}
int LocateCentre(int N,int pp[],int S[],int D[])
{
    int n=N;
    memset(sub,0,sizeof(sub));
    memset(p,0,sizeof(p));
    tot=0;
for(int i=0;i<n;i++)
{
    a[i]=pp[i];
    tot+=a[i];
}
for(int i=0;i<n-1;i++)
{
    g[S[i]].pb(D[i]);
    g[D[i]].pb(S[i]);
}
dfs(0,-1);
int mn=LINF,pos=0;
for(int i=0;i<n;i++)
{
    if(mn>p[i]){
        mn=p[i];
        pos=i;
    }
}
return pos;
}
/*
int32_t main(){
CODE_START;
*/

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

traffic.cpp: In function 'int LocateCentre(int, int*, int*, int*)':
traffic.cpp:19:14: warning: overflow in conversion from 'long long int' to 'int' changes value from '1000000000000000005' to '-1486618619' [-Woverflow]
   19 | #define LINF 1000000000000000005ll
      |              ^~~~~~~~~~~~~~~~~~~~~
traffic.cpp:53:8: note: in expansion of macro 'LINF'
   53 | int mn=LINF,pos=0;
      |        ^~~~

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