oj.uz

Submission #305759

# Submission time Handle Problem Language Result Execution time Memory
305759 2020-09-23T23:02:24 Z sofapuden Dreaming (IOI13_dreaming) C++14
18 / 100
 72 ms 14584 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
 
using namespace std;
vector<vector<pair<int,int>>> gri;
vector<int> dis;
vector<int> dep;
vector<int> used;
int jic = 0;
int ans = 0;
 
int dfs2(int x, int p, int d){
	used[x] = 1;
	int bes = 0;
	int bes2 = 0;
	for(int i = 0; i < gri[x].size(); ++i){
		if(gri[x][i].first == p)continue;
		int cur = dfs2(gri[x][i].first, x, d+gri[x][i].second);
		if(bes < cur)swap(cur, bes);
		if(bes2 < cur)swap(cur, bes2);
	}
	ans = max(ans, max(bes+bes2, d));
	dep.push_back(max(bes,d));
	return max(d, bes);
	
}
 
void find(int ind){
	if(!gri[ind].size()){dis.push_back(0);return;}
	dep.clear();
	ans = 0;
	dfs2(ind,ind,0);
	jic = max(jic,ans);
	sort(dep.begin(),dep.end());
	dis.push_back(dep[0]);	
}
 
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	if(N == 1)return 0;
	if(N == 2)return (M ? T[0] : L);
	used.resize(N,0);
	gri.resize(N);
	for(int i = 0; i < M; ++i){
		gri[A[i]].push_back({B[i],T[i]});
		gri[B[i]].push_back({A[i],T[i]});
	}
	for(int i = 0; i < N; ++i){
		if(!used[i] && gri[i].size() <= 1){
			find(i);
		}
	}
	sort(dis.rbegin(),dis.rend());
	if(dis.size() >= 3){
		return max(jic,max(dis[0]+L+dis[1],dis[1]+dis[2]+2*L));
	}
	if(dis.size() == 2){
		return max(jic,dis[0]+L+dis[1]);
	}
	return jic;
}

Compilation message

dreaming.cpp: In function 'int dfs2(int, int, int)':
dreaming.cpp:16:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i = 0; i < gri[x].size(); ++i){
      |                 ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 14584 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 33 ms 5624 KB Output is correct
2 Correct 33 ms 5632 KB Output is correct
3 Correct 38 ms 5608 KB Output is correct
4 Correct 27 ms 5632 KB Output is correct
5 Correct 33 ms 5624 KB Output is correct
6 Correct 36 ms 6136 KB Output is correct
7 Correct 30 ms 5888 KB Output is correct
8 Correct 26 ms 5504 KB Output is correct
9 Correct 26 ms 5496 KB Output is correct
10 Correct 38 ms 5752 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 5 ms 3708 KB Output is correct
13 Correct 5 ms 3708 KB Output is correct
14 Correct 5 ms 3708 KB Output is correct
15 Correct 5 ms 3708 KB Output is correct
16 Correct 6 ms 3708 KB Output is correct
17 Correct 5 ms 3708 KB Output is correct
18 Correct 6 ms 3836 KB Output is correct
19 Correct 5 ms 3708 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 5 ms 3708 KB Output is correct

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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