Submission #262114

#	Time	Username	Problem	Language	Result	Execution time	Memory
262114		Nightlight	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	792 ms	81892 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
#define pii pair<long long, int>
using namespace std;

int N, M;
long long ans;
vector<pii> adj[100005];
long long dist[100005], dist2[100005];
bool can[100005];
priority_queue<pii, vector<pii>, greater<pii>> pq;

void BFS() {
  for(int i = 0; i < N; i++) {
    if(can[i]) pq.emplace(0, i), can[i] = 0;
    else dist[i] = 1000000000000, dist2[i] = 1000000000000;
  }
  int u, v;
  long long len, w;
  while(!pq.empty()) {
    u = pq.top().second;
    len = pq.top().first;
    pq.pop();
    if(can[u]) continue;
    can[u] = 1;
    for(pii now : adj[u]) {
      v = now.second;
      w = now.first;
      if(dist2[u] + w < dist[v]) {
        dist2[v] = dist[v];
        dist[v] = dist2[u] + w;
        pq.emplace(dist2[v], v);
      }else if(dist2[u] + w < dist2[v]) {
        dist2[v] = dist2[u] + w;
        pq.emplace(dist2[v], v);
      }
    }
  }
}

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
  N = n, M = m;
  for(int i = 0; i < k; i++) can[p[i]] = 1;
  for(int i = 0; i < m; i++) {
    adj[r[i][0]].emplace_back(l[i], r[i][1]);
    adj[r[i][1]].emplace_back(l[i], r[i][0]);
  }
  BFS();
  return dist2[0];
}

Compilation message (stderr)

crocodile.cpp: In function 'void BFS()':
crocodile.cpp:19:13: warning: variable 'len' set but not used [-Wunused-but-set-variable]
   long long len, w;
             ^~~

• Subtask 1: 46 / 46
• Subtask 2: 43 / 43
• Subtask 3: 11 / 11