oj.uz

Submission #120132

# Submission time Handle Problem Language Result Execution time Memory
120132 2019-06-23T13:51:08 Z turbat Dreaming (IOI13_dreaming) C++14
18 / 100
 77 ms 14968 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 <int> se;
ll dist, dp[N], dp1[N], up[N], up1[N];
int vis[N];
void dfs(int u, ll mx){
	vis[u] = 1;
	up[u] = mx;
	for (pii v : edg[u])
		if (!vis[v.F]){
			dfs(v.F, max(mx, dp[u]) + v.S);
			dp[u] = max(dp[u], dp[v.F] + v.S);
		}
}
void dfs1(int u, ll mx){
	vis[u] = 2;
	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, dp1[u]) + v.S);
			dp1[u] = max(dp1[u], dp1[v.F] + v.S);
		}
	}
	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 dist;
	if (se.size() == 2) return se[0] + se[1] + L;
	return max(se.back() + se[k - 2] + L, se[k - 2] + se[k - 3] + 2 * L);
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 14968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 14968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 14968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 9080 KB Output is correct
2 Correct 37 ms 9068 KB Output is correct
3 Correct 56 ms 9208 KB Output is correct
4 Correct 36 ms 9080 KB Output is correct
5 Correct 41 ms 9020 KB Output is correct
6 Correct 38 ms 9740 KB Output is correct
7 Correct 37 ms 9336 KB Output is correct
8 Correct 36 ms 8952 KB Output is correct
9 Correct 34 ms 8948 KB Output is correct
10 Correct 35 ms 9332 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 10 ms 6264 KB Output is correct
13 Correct 19 ms 6520 KB Output is correct
14 Correct 9 ms 6264 KB Output is correct
15 Correct 9 ms 6392 KB Output is correct
16 Correct 12 ms 6136 KB Output is correct
17 Correct 9 ms 5496 KB Output is correct
18 Correct 21 ms 6652 KB Output is correct
19 Correct 9 ms 6136 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 4 ms 2816 KB Output is correct
23 Correct 9 ms 6136 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 14968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 14968 KB Output isn't correct
2 Halted 0 ms 0 KB -