oj.uz

Submission #815091

# Submission time Handle Problem Language Result Execution time Memory
815091 2023-08-08T12:17:13 Z Acanikolic Dreaming (IOI13_dreaming) C++14
14 / 100
 158 ms 20072 KB 
#include <bits/stdc++.h>
		 				
#include "dreaming.h"		 				
		 				 
#define pb push_back 
		
//#define int long long 		
		
#define F first
		 
#define S second
		 
using namespace std;
		 
const int N = 1e5+10;
		 
const int mod = 1e9+7;
		 
const int inf = 1e18;	

vector<pair<int,int>>g[N];
vector<int>all,vis(N);
vector<long long>dist(N);

void dfs(int x,int par) {
	all.pb(x);
	for(auto X:g[x]) {
		if(X.F != par) {
			dist[X.F] = dist[x] + X.S;
			dfs(X.F,x);
		}
	}
}

pair<int,int>nadji_precnik(int root) {
	int x,y;
	all.clear();
	dist[root] = 0;
	dfs(root,0);
	int mx = 0,idx = -1;
	for(auto X:all) {
		if(dist[X] >= mx) {
			mx = dist[X];
			idx = X;
		}
	}
	x = idx;
	mx = 0,idx = -1;
	all.clear();
	dist[x] = 0;
	dfs(x,0);
	for(auto X:all) {
		//cout << "X = " << X << " dist[x] = " << dist[X] << endl;
		if(dist[X] >= mx) {
			mx = dist[X];
			idx = X;
		}
	}
	//cout << endl;
	//cout << idx << endl;
	y = idx;
	//if(root == 4) cout << "x = " << x << " y = " << y << endl;
	return {x,y};
}

void obelezi(int x) {
	if(vis[x]) return;
	vis[x] = 1;
	for(auto X:g[x]) obelezi(X.F);
}

int travelTime(int N,int M,int L,int A[],int B[],int T[]) {
	for(int i=0;i<M;i++) {
		g[A[i]].pb({B[i],T[i]});
		g[B[i]].pb({A[i],T[i]});
	}
	vector<int>centers;
	for(int i=0;i<N;i++) {
		if(vis[i]) continue;
		//cout << i << endl;
		all.clear();
		dfs(i,0);
		vector<int>all_in_comp = all;
		pair<int,int>dia = nadji_precnik(i);
		int X = dia.F,Y = dia.S;
		//if(i == 4) cout << X << ' ' << Y << endl;
		dist[X] = 0;
		dfs(X,0);
		map<long long,long long>D;
		for(auto XX:all_in_comp) D[XX] = dist[XX];
		dist[Y] = 0;
		dfs(Y,0);
		for(auto XX:all_in_comp) D[XX] = max(D[XX],dist[XX]);
		int mn = 1e9,idx = -1;
		for(auto XX:all_in_comp) {
			if(D[XX] < mn) {
				mn = D[XX];
				idx = XX;
			}
		}
		//cout << "root = " << i << " dia = " << X << " " << Y << endl;
		//cout << "root = " << i << " center = " << idx << endl;
		centers.pb(idx);
		obelezi(i);
	}
	for(int i=1;i<centers.size();i++) {
		g[centers[0]].pb({centers[i],L});
		g[centers[i]].pb({centers[0],L});
	}
	pair<int,int> res = nadji_precnik(1);
	dist[res.F] = 0;
	dfs(res.F,0);
	int index = 0;
	for(int i=0;i<N;i++) {
		if(dist[index] <= dist[i]) index = i;
	}
	return dist[index];
}
				
/*signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	
	int n,m,l;
	cin >> n >> m >> l;
	int a[m],b[m],t[m];
	for(int i=0;i<m;i++) cin >> a[i];
	for(int i=0;i<m;i++) cin >> b[i];
	for(int i=0;i<m;i++) cin >> t[i];
	cout << travelTime(n,m,l,a,b,t);
    return 0; 
}*/

Compilation message

dreaming.cpp:19:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int inf = 1e18;
      |                 ^~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:106:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |  for(int i=1;i<centers.size();i++) {
      |              ~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 20072 KB Output is correct
2 Correct 158 ms 20068 KB Output is correct
3 Correct 83 ms 14156 KB Output is correct
4 Correct 14 ms 6192 KB Output is correct
5 Correct 11 ms 4904 KB Output is correct
6 Correct 24 ms 7080 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 54 ms 8720 KB Output is correct
9 Correct 94 ms 11004 KB Output is correct
10 Correct 2 ms 3924 KB Output is correct
11 Correct 103 ms 13160 KB Output is correct
12 Correct 144 ms 15836 KB Output is correct
13 Correct 2 ms 3924 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Incorrect 2 ms 3796 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 20072 KB Output is correct
2 Correct 158 ms 20068 KB Output is correct
3 Correct 83 ms 14156 KB Output is correct
4 Correct 14 ms 6192 KB Output is correct
5 Correct 11 ms 4904 KB Output is correct
6 Correct 24 ms 7080 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 54 ms 8720 KB Output is correct
9 Correct 94 ms 11004 KB Output is correct
10 Correct 2 ms 3924 KB Output is correct
11 Correct 103 ms 13160 KB Output is correct
12 Correct 144 ms 15836 KB Output is correct
13 Correct 2 ms 3924 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 3 ms 3796 KB Output is correct
16 Correct 3 ms 3796 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Incorrect 2 ms 3796 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Incorrect 2 ms 3796 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 20072 KB Output is correct
2 Correct 158 ms 20068 KB Output is correct
3 Correct 83 ms 14156 KB Output is correct
4 Correct 14 ms 6192 KB Output is correct
5 Correct 11 ms 4904 KB Output is correct
6 Correct 24 ms 7080 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 54 ms 8720 KB Output is correct
9 Correct 94 ms 11004 KB Output is correct
10 Correct 2 ms 3924 KB Output is correct
11 Correct 103 ms 13160 KB Output is correct
12 Correct 144 ms 15836 KB Output is correct
13 Correct 2 ms 3924 KB Output is correct
14 Correct 2 ms 3796 KB Output is correct
15 Correct 3 ms 3796 KB Output is correct
16 Correct 3 ms 3796 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Incorrect 2 ms 3796 KB Output isn't correct
20 Halted 0 ms 0 KB -