제출 #1255962

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255962		comgaTramAnh	꿈 (IOI13_dreaming)	C++20	47 / 100	107 ms	37564 KiB

dreaming

#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
vector <int> listVertex; 
vector <vector <pair <int, int>>> adj;
vector <bool> visited;
vector <int> f_out, f_in;
vector <vector <int>> prefix, suffix; 
void dfs_out(int u, int father) {
  listVertex.push_back(u); 
  vector <pair <int, int>> children; 
  visited[u] = true; 
  for (int i = 0; i < (int) adj[u].size(); i++) {
    pair <int, int> neighbor = adj[u][i]; 
    if (neighbor.first != father) {
      children.push_back(neighbor); 
    }
  }
  for (int i = 0; i < (int) children.size(); i++) {
    dfs_out(children[i].first, u);
    f_out[u] = max(f_out[u], f_out[children[i].first] + children[i].second);   
  }
  prefix[u].clear(); 
  prefix[u].resize((int) children.size() + 2); 
  prefix[u][0] = 0; 
  for (int i = 1; i <= (int) children.size(); i++) {
    prefix[u][i] = max(prefix[u][i - 1], f_out[children[i - 1].first] + children[i - 1].second);
  }
  suffix[u].clear(); 
  suffix[u].resize((int) children.size() + 2); 
  suffix[u][(int) children.size() + 1] = 0; 
  for (int i = (int) children.size(); i >= 1; i--) {
    suffix[u][i] = max(suffix[u][i + 1], f_out[children[i - 1].first] + children[i - 1].second);
  }
}
void dfs_in(int u, int father) {
  vector <pair <int, int>> children; 
  for (int i = 0; i < (int) adj[u].size(); i++) {
    pair <int, int> neighbor = adj[u][i]; 
    if (neighbor.first == father) {
      continue; 
    }
    children.push_back(neighbor);
  }
  for (int i = 0; i < (int) children.size(); i++) {
    pair <int, int> neighbor = children[i];
    f_in[neighbor.first] = max(f_in[neighbor.first], f_in[u] + neighbor.second); 
    f_in[neighbor.first] = max(f_in[neighbor.first], max(prefix[u][i], suffix[u][i + 2]) + neighbor.second); 
    dfs_in(neighbor.first, u); 
  }
}
int solve(int u) {
  listVertex.clear();                        
  int n = (int) adj.size();
  dfs_out(u, -1);
  dfs_in(u, -1);
  int ans = 1000000007; 
  for (int i = 0; i < (int) listVertex.size(); i++) {
    int u = listVertex[i]; 
    ans = min(ans, max(f_in[u], f_out[u]));   
  }  
  return ans; 
}
int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
  adj.resize(n);
  visited.resize(n, false);
  for (int i = 0; i < m; i++) {
    adj[a[i]].push_back(make_pair(b[i], t[i]));
    adj[b[i]].push_back(make_pair(a[i], t[i]));
  }
  int ans = 0; 
  f_out.resize(n, 0); 
  f_in.resize(n, 0);
  prefix.resize(n);
  suffix.resize(n);
  for (int i = 0; i < n; i++) {
    if (visited[i] == false) {
      ans += solve(i);  
    }
  } 
  ans += l;
  for (int u = 0; u < n; u++) {
    ans = max(ans, max(f_in[u], f_out[u])); 
  }
  return ans; 
}

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