oj.uz

Submission #305744

# Submission time Handle Problem Language Result Execution time Memory
305744 2020-09-23T22:28:20 Z sofapuden Dreaming (IOI13_dreaming) C++14
0 / 100
 61 ms 15092 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
 
using namespace std;
vector<vector<pair<int,int>>> gri;
vector<int> dis = {0,0,0};
vector<int> dep;
vector<int> used;
int jic = 0;
int y;
 
int dfs(int x, int p){
	used[x] = 1;
	int s = 0;
	for(int i = 0; i < (int)gri[x].size(); ++i){
		int z = 0;
		if(gri[x][i].first != p)z = dfs(gri[x][i].first,x)+gri[x][i].second;
		dep.push_back(z);
		s+=z;
	}
	return s;
}
void find(int ind){
	if(!gri[ind].size()){dis.push_back(0);return;}
	dep.clear();
	y = dfs(ind,ind);
	jic = max(jic,y);
	int best = INT_MAX;
	for(int i = 0; i < (int)dep.size(); ++i){
		best = min(best, max(y-dep[i],dep[i]));
	}
	dis.push_back(best);	
}
 
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	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());
	return max(jic,max(dis[0]+L+dis[1],dis[1]+2*L+dis[2]));
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15092 KB Output is correct
2 Correct 60 ms 14964 KB Output is correct
3 Correct 43 ms 9852 KB Output is correct
4 Correct 9 ms 2560 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 14 ms 3712 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15092 KB Output is correct
2 Correct 60 ms 14964 KB Output is correct
3 Correct 43 ms 9852 KB Output is correct
4 Correct 9 ms 2560 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 14 ms 3712 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15092 KB Output is correct
2 Correct 60 ms 14964 KB Output is correct
3 Correct 43 ms 9852 KB Output is correct
4 Correct 9 ms 2560 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 14 ms 3712 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5504 KB Output is correct
2 Correct 27 ms 5504 KB Output is correct
3 Correct 25 ms 5504 KB Output is correct
4 Correct 27 ms 5496 KB Output is correct
5 Correct 27 ms 5504 KB Output is correct
6 Correct 27 ms 5816 KB Output is correct
7 Correct 27 ms 5760 KB Output is correct
8 Correct 24 ms 5440 KB Output is correct
9 Correct 25 ms 5376 KB Output is correct
10 Correct 27 ms 5696 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 3 ms 3072 KB Output is correct
13 Correct 4 ms 3072 KB Output is correct
14 Correct 3 ms 3072 KB Output is correct
15 Correct 3 ms 3200 KB Output is correct
16 Correct 3 ms 3072 KB Output is correct
17 Correct 3 ms 3072 KB Output is correct
18 Correct 3 ms 3072 KB Output is correct
19 Correct 3 ms 3072 KB Output is correct
20 Incorrect 1 ms 384 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15092 KB Output is correct
2 Correct 60 ms 14964 KB Output is correct
3 Correct 43 ms 9852 KB Output is correct
4 Correct 9 ms 2560 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 14 ms 3712 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 15092 KB Output is correct
2 Correct 60 ms 14964 KB Output is correct
3 Correct 43 ms 9852 KB Output is correct
4 Correct 9 ms 2560 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 14 ms 3712 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -