oj.uz

답안 #120234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120234 2019-06-24T03:45:05 Z turbat 꿈 (IOI13_dreaming) C++14
0 / 100
 68 ms 15608 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
using pii = pair <int, int>;
using vi = vector <int>;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ook order_of_key
#define fbo find_by_order
#define sq(x) (x) * (x)
#define N 100005
vector <pii> edg[N];
vector <ll> se;
ll dist, dp[N], dp1[N], dp2[N], up[N], up1[N], ans;
int vis[N];
void dfs(int u, ll mx){
	vis[u] = 1;
    if (up[u] < mx){
        up1[u] = up[u];
        up[u] = mx;
    }
    else if (up1[u] < mx) up1[u] = mx;
	for (pii v : edg[u])
		if (!vis[v.F]){
			dfs(v.F, max(mx, dp[u]) + v.S);
            if (dp[u] < dp[v.F] + v.S) {
                dp1[u] = dp[u];
                dp[u] = dp[v.F] + v.S;
            }
            else if (dp1[u] < dp[v.F] + v.S) dp1[u] = dp[v.F] + v.S;
   		}
}
void dfs1(int u, ll mx){
	vis[u] = 2;
    if (up[u] < mx){
        up1[u] = up[u];
        up[u] = mx;
    }
    else if (up1[u] < mx) up1[u] = mx;
	for (int i = edg[u].size() - 1;i >= 0;i--){
		pii v = edg[u][i];
		if (vis[v.F] < 2){
			dfs1(v.F, max(mx, dp2[u]) + v.S);
			dp2[u] = max(dp2[u], dp2[v.F] + v.S);
		}
	}
    ans = max({ans, dp[u] + dp1[u], up[u] + up1[u], dp[u] + up[u]});
	dist = min(dist, max({dp[u], dp1[u], up[u], up1[u]}));
}
int travelTime(int n, int m, int L, int A[], int B[], int T[]) {
	for (int i = 0;i < m;i++){
		edg[A[i]].pb(mp(B[i], T[i]));
		edg[B[i]].pb(mp(A[i], T[i]));
	}
	int k = 0;
	for (int i = 0;i < n;i++)
    	if (!vis[i]){
    		k++;
    		dist = 1e12;
    		dfs(i, 0);
    		dfs1(i, 0);
    		se.pb(dist);
    	}
    sort(se.begin(), se.end());
    if (se.size() == 1) return ans;
	if (se.size() == 2) return max(ans, se[0] + se[1] + 1ll * L);
	return max({se.back() + se[k - 2] + L, se[k - 2] + se[k - 3] + 2ll * L, ans});
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 15608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 15608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 15608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 34 ms 10060 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 15608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 15608 KB Output isn't correct
2 Halted 0 ms 0 KB -