제출 #1318591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1318591		Johan	꿈 (IOI13_dreaming)	C++20	100 / 100	421 ms	35232 KiB

dreaming

#include "dreaming.h"
#include "bits/stdc++.h"
using namespace std;
const int N = 1e5 + 5;
int pa[N];
vector < int > adj[N];
unordered_map < int , int > dist, vis;
map < pair < int , int > , int > we;
vector < int > par(N, -1);
int res=0;
int find(int u){
  if(par[u] < 0)return u;
  else return par[u] = find(par[u]);
}
void uni(int u, int v){
  u = find(u);
  v = find(v);
  if(u == v)return;
  par[u] += par[v];
  par[v] = u;
}
int bfs(int st){
  queue < int > q;
  map < int , int > dis;
  q.push(st);
  dis[st] = 0;
  while(q.size() > 0){
    int u = q.front();
    q.pop();
    for(auto v : adj[u]){
      if(dis.count(v) == 0){
        dis[v] = dis[u] + we[{u, v}];
        q.push(v);
      }
    }
  }
  int node, mx = -1;
  for(auto [nd, val] : dis){
    if(val > mx){
      mx = val;
      node = nd;
    }
  }
  return node;
}
void dfs(int u, int end){
  vis[u] = true;
  for(auto v : adj[u]){
    if(!vis[v]){
      pa[v] = u;
      dfs(v, end);
    }
  }
}
int centre(int st, int end){
  int sz = 0;
  vector < int > path = {end};
  while(end != st){
    sz += we[{end, pa[end]}];
    end = pa[end];
    path.push_back(end);    
  }
  int mn = sz, diametr = sz, cur = 0, node = path[0], far;
  for(int i = 1; i < path.size(); i++){
    int W = we[{path[i], path[i - 1]}];
    sz -= W;
    cur += W;
    if(mn > max(sz, cur)){
      if(sz > cur)far = path.back();
      else far = path[0];
      mn = max(sz, cur);
      node = path[i];
    }
  }
  res = max(res, diametr);
  return mn;
}
pair < int , int > find_diametr(int Node){
	int u = bfs(Node);
  int v = bfs(u);
  dfs(u, v);
  return {u, v};
}
int travelTime(int n, int m, int L, int u[], int v[], int w[]){
  for(int i = 0; i < m; i++){
    we[{u[i], v[i]}] = w[i];
    we[{v[i], u[i]}] = w[i];
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);  
    uni(u[i], v[i]);
  }
  set < int > cmps;
  for(int i = 0; i < n; i++)
    cmps.insert(find(i));
  vector < int > x;
  for(auto nd : cmps){
    pair < int , int > p = find_diametr(nd);
    int u = p.first;
    int v = p.second;
    x.push_back(centre(u, v));
  }
  sort(x.rbegin(), x.rend());
  if (x.size() ==1){
    return max(x[0], res);
  }
  else if (x.size()==2) {
    return max(x[0] + x[1] + L, res);
  }
  else {
    return max({x[0]+x[1]+L, x[1]+x[2]+2*L, res});
  }
}

• Subtask 1: 14 / 14
• Subtask 2: 10 / 10
• Subtask 3: 23 / 23
• Subtask 4: 18 / 18
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23