oj.uz

Submission #299443

# Submission time Handle Problem Language Result Execution time Memory
299443 2020-09-14T22:48:14 Z APROHACK Shortcut (IOI16_shortcut) C++14
0 / 100
 16 ms 23808 KB 
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
using namespace std;
vector<pair<int, long long> >g[1000000];//desde hasta peso
long long dist[501][501];
bool recorridos[1000000];
long long dp(int pos, int hasta){
	if(pos==hasta)return 0;
	recorridos[pos]=true;
	long long ret=LLONG_MAX/3;
	for(int i = 0 ; i < g[pos].size() ; 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(int i = 0 ; i < n ; i ++){
		for(int j = 0 ; j < n ; j++ ){
			dist[i][j]=LLONG_MAX;
		}
	}
	for(int 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 nodostotales=n, minimo=LLONG_MAX; 
	for(int i = 0 ; i < n-1 ; i ++){
		for(int 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(int x = 0 ; x < n-1 ; x ++){
				for(int 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;
}

Compilation message

shortcut.cpp: In function 'long long int dp(int, int)':
shortcut.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i = 0 ; i < g[pos].size() ; i++){
      |                  ~~^~~~~~~~~~~~~~~
shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:35:12: warning: unused variable 'nodostotales' [-Wunused-variable]
   35 |  long long nodostotales=n, minimo=LLONG_MAX;
      |            ^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23808 KB n = 4, 80 is a correct answer
2 Correct 16 ms 23808 KB n = 9, 110 is a correct answer
3 Correct 16 ms 23808 KB n = 4, 21 is a correct answer
4 Correct 16 ms 23808 KB n = 3, 4 is a correct answer
5 Correct 16 ms 23808 KB n = 2, 62 is a correct answer
6 Incorrect 16 ms 23808 KB n = 2, incorrect answer: jury 3 vs contestant 9223372036854775807
7 Halted 0 ms 0 KB -