| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 571340 | beaconmc | 꿈 (IOI13_dreaming) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "dreaming.h"
using namespace std;
ll cc[100005];
ll find(ll a){
while (a!=cc[a]) cc[a] = cc[cc[a]], a = cc[a];
return a;
}
void unite(ll a,ll b){
cc[find(a)] = find(b);
}
ll globalmax = 0;
vector<pair<ll, ll>> edges[100005];
vector<ll> sussies[100005];
bool visited[100005];
int sus(vector<ll> a){
if (a.size()==1) return 0;
for (auto&i : a) visited[i] = 0;
vector<vector<ll>> stack;
ll maxi = 0;
vector<ll> path;
stack.push_back({0,a[0]});
visited[a[0]] = 1;
while (stack.size()){
vector<ll> temp;
vector<ll> node = stack[stack.size()-1];
stack.pop_back();
if (maxi < node[0]) path = node, maxi = node[0];
for (auto&i : edges[node[node.size()-1]]){
if (!visited[i.first]){
visited[i.first] = 1;
temp = node;
temp[0] += i.second;
temp.push_back(i.first);
stack.push_back(temp);
}
}
}
ll realsus = path[path.size()-1];
for (auto&i : a) visited[i] = 0; visited[i] = 0;
stack.clear();
maxi = 0;
path.clear();
stack.push_back({0,0,realsus});
visited[realsus] = 1;
while (stack.size()){
vector<ll> temp;
vector<ll> node = stack[stack.size()-1];
stack.pop_back();
if (maxi < node[0]) path = node, maxi = node[0];
for (auto&i : edges[node[node.size()-1]]){
if (!visited[i.first]){
visited[i.first] = 1;
temp = node;
temp.pop_back();
temp[0] += i.second;
temp.push_back(i.second);
temp.push_back(i.first);
stack.push_back(temp);
}
}
}
ll mini = 1000000000000;
ll cur = 0;
globalmax = max(globalmax, path[0]);
FOR(i,1,path.size()-1){
cur += path[i];
mini = min(mini, max(path[0]-cur, cur));
}
return mini;
}
int travelTime(int n, int m, int L, int a[], int b[], int t[]){
FOR(i,0,n) cc[i] = i;
FOR(i,0,m){
edges[a[i]].push_back({b[i], t[i]});
edges[b[i]].push_back({a[i], t[i]});
}
FOR(i,0,n){
for (auto&j : edges[i]){
unite(i, j.first);
}
}
FOR(i,0,n){
sussies[find(i)].push_back(i);
}
vector<ll> kindasus;
for (auto&i : sussies){
if (i.size()==0) continue;
kindasus.push_back(sus(i));
}
sort(kindasus.begin(), kindasus.end());
// for (auto&i : kindasus){
// cout << i << endl;
// }
if (kindasus.size() == 1) return globalmax;
if (kindasus.size()==2){
return max(globalmax, kindasus[kindasus.size()-1] + kindasus[kindasus.size()-2] + L);
}
return max(globalmax, max(kindasus[kindasus.size()-2] + kindasus[kindasus.size()-3] + 2*L, kindasus[kindasus.size()-1] + kindasus[kindasus.size()-2] + L));
}