oj.uz

Submission #337698

# Submission time Handle Problem Language Result Execution time Memory
337698 2020-12-21T12:12:41 Z BlancaHM Dreaming (IOI13_dreaming) C++14
0 / 100
 1000 ms 7792 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include "dreaming.h"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;

pii calcDist(int i, vvpii & G, vector<bool> & visited, vi & dist1, vi & dist2) {
	queue<int> Q;
	Q.push(i);
	int u, v, t, N = (int) G.size(), maxNode = i;
	vector<int> vertices = {};
	dist1[i] = 0;
	while(!Q.empty()) {
		u = Q.front();
		Q.pop();
		visited[u] = true;
		vertices.push_back(u);
		if (dist1[u] > dist1[maxNode])
			maxNode = u;
		for (auto connection: G[u]) {
			v = connection.first;
			t = connection.second;
			if (dist1[v] > dist1[u]+t) {
				dist1[v] = dist1[u]+t;
				Q.push(v);
			}
		}
	}
	dist2.assign(N, 1e9);
	dist2[maxNode] = 0;
	Q.push(maxNode);
	while(!Q.empty()) {
		u = Q.front();
		Q.pop();
		if (dist2[u] > dist2[maxNode])
			maxNode = u;
		for (auto connection: G[u]) {
			v = connection.first;
			t = connection.second;
			if (dist2[v] > dist2[u]+t) {
				dist2[v] = dist2[u]+t;
				Q.push(v);
			}
		}
	}
	int ecc = 0;
	for (auto vert: vertices) {
		ecc = max(ecc, min(dist1[vert], dist2[vert]));
	}
	return make_pair(ecc, dist2[maxNode]);
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	vvpii G(N, vpii());
	vector<bool> visited(N, false);
	for (int i = 0; i < M; i++) {
		G[A[i]].push_back(make_pair(B[i], T[i]));
		G[B[i]].push_back(make_pair(A[i], T[i]));
	}
	int CC = 0;
	vi diam = {}, ecc = {}, dist1(N, 1e9), dist2(N, 1e9);
	pii curCC;
	for (int i = 0; i < N; i++) {
		if (!visited[i]) {
			curCC = calcDist(i, G, visited, dist1, dist2);
			ecc.push_back(curCC.first);
			diam.push_back(curCC.second);
			CC++;
		}
	}
	int ans = diam[0];
	for (int i = 1; i < CC; i++)
		ans = max(ans, diam[i]);
	sort(ecc.begin(), ecc.end(), greater<int>());
	for (int i = 1; i < CC; i++)
		ans = max(ans, ecc[i]+ecc[0]+L);
	return ans;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7792 KB Output is correct
2 Correct 51 ms 7688 KB Output is correct
3 Correct 32 ms 5228 KB Output is correct
4 Correct 7 ms 1516 KB Output is correct
5 Correct 6 ms 1132 KB Output is correct
6 Correct 12 ms 2304 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7792 KB Output is correct
2 Correct 51 ms 7688 KB Output is correct
3 Correct 32 ms 5228 KB Output is correct
4 Correct 7 ms 1516 KB Output is correct
5 Correct 6 ms 1132 KB Output is correct
6 Correct 12 ms 2304 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7792 KB Output is correct
2 Correct 51 ms 7688 KB Output is correct
3 Correct 32 ms 5228 KB Output is correct
4 Correct 7 ms 1516 KB Output is correct
5 Correct 6 ms 1132 KB Output is correct
6 Correct 12 ms 2304 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1029 ms 6072 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7792 KB Output is correct
2 Correct 51 ms 7688 KB Output is correct
3 Correct 32 ms 5228 KB Output is correct
4 Correct 7 ms 1516 KB Output is correct
5 Correct 6 ms 1132 KB Output is correct
6 Correct 12 ms 2304 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7792 KB Output is correct
2 Correct 51 ms 7688 KB Output is correct
3 Correct 32 ms 5228 KB Output is correct
4 Correct 7 ms 1516 KB Output is correct
5 Correct 6 ms 1132 KB Output is correct
6 Correct 12 ms 2304 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -