제출 #121947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
121947		KLPP	Designated Cities (JOI19_designated_cities)	C++14	0 / 100	466 ms	38236 KiB

designated_cities

#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
vector<pii> nei[200000];
vector<pii> nei_d[200000];
lld dist[200000];
bool visited[200000];
void DFS(int node){
  //cout<<node<<endl;
  visited[node]=true;
  trav(p,nei_d[node]){
    if(!visited[p.first]){
      dist[p.first]=dist[node]+p.second;
      DFS(p.first);
    }
  }
}
lld ans;
void DFS2(int node){
  visited[node]=true;
  trav(p,nei[node]){
    if(!visited[p.first]){
      ans+=p.second;
      DFS2(p.first);
    }
  }
}
int main(){
  int n;
  scanf("%d",&n);
  rep(i,0,n-1){
    int x,y;
    lld z,w;
    scanf("%d %d %lld %lld",&x,&y,&z,&w);
    x--;y--;
    nei[x].push_back(pii(y,z));
    nei[y].push_back(pii(x,w));
    nei_d[x].push_back(pii(y,z-w));
    nei_d[y].push_back(pii(x,w-z));
  }
  rep(i,0,n){
    dist[i]=0;
    visited[i]=false;
  }
  dist[0]=0;
  DFS(0);
  //rep(i,0,n)cout<<dist[i]<<endl;
  pii best=pii(0,0);
  rep(i,0,n){
    best=max(best,pii(dist[i],i));
  }
  int start=best.second;
  ans=0;
  rep(i,0,n)visited[i]=false;
  DFS2(start);
  printf("%d\n",ans);
  return 0;
}

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

designated_cities.cpp: In function 'int main()':
designated_cities.cpp:60:20: warning: format '%d' expects argument of type 'int', but argument 2 has type 'lld {aka long long int}' [-Wformat=]
   printf("%d\n",ans);
                    ^
designated_cities.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
designated_cities.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %lld %lld",&x,&y,&z,&w);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44