Submission #91509

#	Time	Username	Problem	Language	Result	Execution time	Memory
91509		tincamatei	Shortcut (IOI16_shortcut)	C++14	0 / 100	2 ms	748 KiB

shortcut

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 500;
vector<pair<int, int> > graph[1+2*MAX_N];

long long dist[1+2*MAX_N];

void dijkstra(int nod, int n) {
	for(int i = 0; i < 2 * n; ++i)
		dist[i] = 1LL<<60;

	deque<int> q;
	dist[nod] = 0;
	q.push_back(nod);

	while(!q.empty()) {
		int nod = q.front();
		q.pop_front();
		for(auto it: graph[nod])
			if(dist[nod] + it.second < dist[it.first]) {
				dist[it.first] = dist[nod] + it.second;
				q.push_back(it.first);
			}
	}
}

long long getDiam(int n) {
	long long rez = 0LL;
	for(int i = 0; i < 2 * n; ++i)
		if(!graph[i].empty()) {
			dijkstra(i, n);
			for(int j = 0; j < 2 * n; ++j)
				if(!graph[j].empty())
					rez = max(rez, dist[j]);
		}
	return rez;
}

long long f(int n, int x, int c) {
	long long rez = 1LL<<60;
	for(int i = 0; i + x < n; ++i) {
		graph[i].push_back(make_pair(i + x, c));
		graph[i + x].push_back(make_pair(i, c));
		
		rez = min(rez, getDiam(n));

		graph[i].pop_back();
		graph[i + x].pop_back();
	}
	return rez;
}

long long asdf[1+MAX_N];

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
	for(int i = 0; i < n - 1; ++i) {
		graph[i].push_back(make_pair(i + 1, l[i]));
		graph[i + 1].push_back(make_pair(i, l[i]));
	}
	for(int i = 0; i < n; ++i)
		if(d[i] != 0) {
			graph[i].push_back(make_pair(i + n, d[i]));
			graph[i + n].push_back(make_pair(i, d[i]));
		}

	for(int i = 1; i < n; ++i) {
		asdf[i] = f(n, i, c);
	}

	for(int i = 1; i < n - 1; ++i) {
		if(asdf[i] < asdf[i + 1])
			return asdf[i];
	}

	return asdf[n - 1];
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3