Submission #920864

#	Time	Username	Problem	Language	Result	Execution time	Memory
920864		Arp	Crocodile's Underground City (IOI11_crocodile)	C++17	46 / 100	2 ms	6744 KiB

crocodile

#include<bits/stdc++.h>
#include "crocodile.h"
using namespace std;

using i64 = long long;
const i64 inf = 1e18;
const int N = 1e5;
vector<pair<int,int>> adj[N];
bool good[N],vis[N];
i64 dp[N];

void dfs(int u){
  vis[u] = true;
  for(auto [v,w] : adj[u]){
    if(vis[v]) continue;
    dfs(v);
  }
  i64 m1 = inf;
  i64 m2 = inf;
  for(auto [v,w] : adj[u]){
    if(!good[v]) continue;
    i64 T = dp[v] + w;
    if(m1 >= T){
      m2 = m1;
      m1 = T;
    }else if(m2 >= T){
      m2 = T;
    }
  }
  if(m2 != inf){
    good[u] = true;
    dp[u] = m2;
  }
}

int travel_plan(int N,int M,int R[][2],int L[],int K,int P[]){
  for(int i = 0;i<M;i++){
    adj[R[i][0]].emplace_back(R[i][1],L[i]);
    adj[R[i][1]].emplace_back(R[i][0],L[i]);
  }
  for(int i = 0;i<N;i++){
    vis[i] = false;
    good[i] = false;
    dp[i] = inf;
  }
  for(int i = 0;i<K;i++){
    dp[P[i]] = 0;
    good[P[i]] = true;
  }
  dfs(0);
  assert(good[0]);
  return (int) dp[0];
}

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