Submission #286079

#	Time	Username	Problem	Language	Result	Execution time	Memory
286079		kevlee	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	750 ms	64492 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
vp edges[100005];
int n, m;
ll dist[100005], dist2[100005];
int vis[100005];
int travel_plan(int N, int M, int r[][2], int l[], int K, int P[]) {
  n = N;
  m = M;
  FOR(i, 0, m-1) {
    edges[r[i][0]].emplace_back(r[i][1], l[i]);
    edges[r[i][1]].emplace_back(r[i][0], l[i]);
  }
  priority_queue <pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > pq;
  FOR(i, 0, n-1) {
    dist[i] = 1e15;
    dist2[i] = 1e15;
  }
  FOR(i, 0, K-1) {
    dist[P[i]] = 0;
    dist2[P[i]] = 0;
    vis[P[i]] = 1;
    pq.push({0LL, P[i]});
  }
  while (!pq.empty()) {
    pll f = pq.top();
    pq.pop();
    int u = f.se;
    ll d = f.fi;
    if (vis[u] == 2) continue;
    if (!vis[u]) {
      vis[u] = 1;
      //cout << u << ' ' << dist[u] << endl;
      continue;
    }
    vis[u] = 2;
    //cout << u << ' ' << dist2[u] << endl;
    for (auto edge: edges[u]) {
      if (vis[edge.fi] < 2 && dist[edge.fi] > dist2[u] + edge.se) {
        dist2[edge.fi] = dist[edge.fi];
        dist[edge.fi] = dist2[u] + edge.se;
        pq.push({dist[edge.fi], edge.fi});
      } else if (vis[edge.fi] < 2 && dist2[edge.fi] > dist2[u] + edge.se) {
        dist2[edge.fi] = dist2[u] + edge.se;
        pq.push({dist2[edge.fi], edge.fi});
      }
    }
  }
  return dist2[0];
}

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:47:8: warning: unused variable 'd' [-Wunused-variable]
   47 |     ll d = f.fi;
      |        ^

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