oj.uz

Submission #258449

# Submission time Handle Problem Language Result Execution time Memory
258449 2020-08-05T23:44:04 Z monus1042 Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 3 ms 4224 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
#define pb push_back
#define mkp make_pair
#define all(X) X.begin(), X.end()

const int MAXS = 100002;
const ll inf = 1e15;
vector< pair<int, ll> > g[MAXS];
priority_queue < pair<ll, int>, vector< pair<ll, int> >, greater< pair<ll,int> > > pq;
vll d(MAXS, inf), d2(MAXS, inf);
bool state[MAXS]; // 0 unvisited, 1 minimal obtained

void dj(){
  while(!pq.empty()){
    int auxu = pq.top().second;
    ll w = pq.top().first;
    pq.pop();
    if (state[auxu]) continue;
    state[auxu] = 1;
    for (int i=0; i<(int)g[auxu].size(); i++){
      int v = g[auxu][i].first;
      ll wuv = g[auxu][i].second + w;
      if (wuv < d[v] && !state[v]){
	d2[v] = d[v];
	d[v] = wuv;
	pq.push(mkp(wuv, v));
      }
      else if (wuv >= d[v]){
	d2[v] = min(d2[v], wuv);
      }
    }
  }
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
  for (int i=0; i<M; i++){
    g[ R[i][0] ].pb(mkp( R[i][1] , L[i]));
    g[ R[i][1] ].pb(mkp( R[i][0] , L[i]));
  }

  for (int i=0; i<K; i++){
    pq.push(mkp(0, P[i]));
    d[P[i]]=0;
  }

  dj();
  return (int)d2[0];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4224 KB Output isn't correct
2 Halted 0 ms 0 KB -