제출 #297403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297403		DanerZein	통행료 (IOI18_highway)	C++14	0 / 100	13 ms	2560 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
#define MAX 1000000000000000000
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ii> vi;
vector<vi> G;
vector<int> hl;
ll conc[110];
int isq[110];
ll m,a,b,n;
ll dis[110];
void dijkstra(int x){
  memset(isq,0,sizeof isq);
  for(int i=0;i<n;i++) dis[i]=MAX;
  cout<<dis[0]<<endl;
  dis[x]=0;
  priority_queue<ii,vector<ii>,greater<ii>>pq;
  pq.push(ii(0,x));
  while(!pq.empty()){
    int u=pq.top().second;
    isq[u]=0;
    pq.pop();
    for(auto &v:G[u]){
      ll cos;
      if(hl[v.second]==1) cos=b;
      else cos=a;
      if(dis[v.first]>dis[u]+cos){
	dis[v.first]=dis[u]+cos;
	if(!isq[v.first]){
	  pq.push(ii(dis[v.first],v.first));
	  isq[v.first]=1;
	}
      }
    }
  }
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
  n=N;
  a=A;
  b=B;
  G.resize(N+1);
  for(int i=0;i<U.size();i++){
    int u=U[i],v=V[i];
    G[u].push_back(ii(v,i));
    G[v].push_back(ii(u,i));
  }
  memset(conc,0,sizeof conc);
  m=U.size();
  hl.assign(m,0);
  for(int i=0;i<m;i++){
    hl[i]=1;
    dijkstra(0);
    ll co=ask(hl);
    for(int j=0;j<N;j++){
      if(dis[j]==co){
	conc[j]++;
      }
    }
    hl[i]=0;
  }
  ll t,ma=-1;
  for(int i=0;i<N;i++){
    if(conc[i]>ma){
      ma=conc[i];
      t=i;
    }
  }
  answer(0,t);
}

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

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:44:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int i=0;i<U.size();i++){
      |               ~^~~~~~~~~
highway.cpp:70:9: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   70 |   answer(0,t);
      |   ~~~~~~^~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31