oj.uz

답안 #426219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426219 2021-06-13T15:22:53 Z chirathnirodha 악어의 지하 도시 (IOI11_crocodile) C++17
0 / 100
 1 ms 204 KB 
//Coded by Chirath Nirodha
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define P push
typedef long long ll;
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
  vector<pair<ll,ll> > adj[N];
  for(int i=0;i<M;i++){
    adj[R[i][0]].PB(MP(R[i][1],L[i]));
    adj[R[i][1]].PB(MP(R[i][0],L[i]));
  }
  ll shortest[N][2];
  for(int i=0;i<N;i++){
    shortest[i][0]=10000000000000000;
    shortest[i][1]=10000000000000000;
  }
  priority_queue<pair<ll,ll> > q;
  for(int i=0;i<K;i++){
    shortest[P[i]][0]=0;
    shortest[P[i]][1]=0;
    q.P(MP(0,P[i]));
  }
  while(!q.empty()){
    int c=q.top().S;
    q.pop();
    for(int i=0;i<adj[c].size();i++){
      int a=adj[c][i].F;
      ll len=adj[c][i].S;
	  ll pre=shortest[a][1];
      if(shortest[a][0]>shortest[c][1]+len){
        shortest[a][1]=shortest[a][0];
        shortest[a][0]=shortest[c][1]+len;
      }
      else if(shortest[a][1]>shortest[c][1]+len)shortest[a][1]=shortest[c][1]+len;
	  
	  if(shortest[a][1]<pre)q.P(MP(-shortest[a][1],a));
    }
  }
  int ans=shortest[0][1];
  return ans;
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:32:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i=0;i<adj[c].size();i++){
      |                 ~^~~~~~~~~~~~~~

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -