oj.uz

Submission #299456

# Submission time Handle Problem Language Result Execution time Memory
299456 2020-09-14T23:23:40 Z APROHACK Shortcut (IOI16_shortcut) C++14
0 / 100
 2000 ms 640 KB 
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
using namespace std;
vector<pair<long long, long long> >g[10000];//desde hasta peso
//long long dist[501][501];
bool recorridos[10000];
long long dp(long long pos, long long hasta){
	if(pos==hasta)return 0;
	recorridos[pos]=true;
	long long ret=LLONG_MAX/3, tam=g[pos].size();
	for(long long i = 0 ; i < tam ; i++){
		if(!recorridos[g[pos][i].F])ret=min(ret, dp(g[pos][i].F, hasta)+g[pos][i].S);
	}
	recorridos[pos]=false;
	return ret;
}
long long find_shortcut(int n, vector<int> l, vector<int> d, int c)
{	/*
	for(long long i = 0 ; i < n ; i ++){
		for(long long j = 0 ; j < n ; j++ ){
			dist[i][j]=LLONG_MAX;
		}
	}*/
	for(long long i = 0 ; i < n-1 ; i ++){
		recorridos[i]=false;
		g[i].PB(MP(i+1, l[i]));
		g[i+1].PB(MP(i, l[i]));
		//dist[i][i+1]=l[i];
		//dist[i+1][i]=l[i];
	}
	recorridos[n-1]=false;
	long long minimo=LLONG_MAX/3; 
	for(long long i = 0 ; i < n-1 ; i ++){
		for(long long j = i+1 ; j < n ; j ++){
			//if(dist[i][j]<=c)continue;
			g[i].push_back(make_pair(j, c));
			g[j].push_back(make_pair(i, c));
			long long maximo=-1, resact;
			for(long long x = 0 ; x < n-1 ; x ++){
				for(long long y = x+1 ; y < n ; y++){
					resact=dp(x, y);
					//cout<<"de "<<x<<" a "<<y<<" con union en "<<i<<" y "<<j<<" da "<<resact<<endl; 
					maximo=max(maximo, d[x]+d[y]+resact);
				}
			}
			g[i].pop_back();
			g[j].pop_back();
			minimo=min(maximo, minimo);
		}
	}
    return minimo;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB n = 4, 80 is a correct answer
2 Correct 1 ms 512 KB n = 9, 110 is a correct answer
3 Correct 1 ms 512 KB n = 4, 21 is a correct answer
4 Correct 1 ms 512 KB n = 3, 4 is a correct answer
5 Correct 1 ms 512 KB n = 2, 62 is a correct answer
6 Correct 1 ms 512 KB n = 2, 3 is a correct answer
7 Correct 1 ms 512 KB n = 3, 29 is a correct answer
8 Correct 1 ms 512 KB n = 2, 3 is a correct answer
9 Correct 1 ms 512 KB n = 2, 3 is a correct answer
10 Correct 1 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 1 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 1 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 1 ms 640 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 512 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 512 KB n = 5, 12 is a correct answer
21 Correct 1 ms 512 KB n = 5, 25 is a correct answer
22 Correct 1 ms 512 KB n = 2, 122 is a correct answer
23 Correct 1 ms 640 KB n = 10, 117 is a correct answer
24 Correct 1 ms 512 KB n = 10, 336 is a correct answer
25 Correct 1 ms 512 KB n = 10, 438 is a correct answer
26 Correct 1 ms 512 KB n = 10, 206 is a correct answer
27 Correct 1 ms 512 KB n = 10, 636 is a correct answer
28 Correct 1 ms 640 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 512 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 512 KB n = 10, 3112 is a correct answer
31 Execution timed out 2031 ms 632 KB Time limit exceeded
32 Halted 0 ms 0 KB -