oj.uz

Submission #114362

# Submission time Handle Problem Language Result Execution time Memory
114362 2019-06-01T05:16:06 Z faustaadp Shortcut (IOI16_shortcut) C++17
0 / 100
 2000 ms 384 KB 
#include "shortcut.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n,i,jar[550],tam[550],has,j,d[550],C,b[550];
vector<ll> v[550],w[550];
ll cak(ll aa)
{
	ll ii;
	priority_queue<pair<ll,ll> > pq;
	for(ii=0;ii<(n*2);ii++)
		b[ii]=0;
	for(ii=0;ii<(n*2);ii++)
		d[ii]=1e18;
	d[aa]=0;
	ll ma=0;
	pq.push(mp(0,aa));
	while(!pq.empty())
	{
		ll u=pq.top().se;
		ll dis=-pq.top().fi;
		pq.pop();
		if(b[u])
			continue;
		b[u]=1;
		//cout<<aa<<" "<<bb<<" "<<u<<" "<<dis<<" "<<d[u]<<"\n";
		ma=max(ma,d[u]);
		for(ii=0;ii<v[u].size();ii++)
		{
			if(d[v[u][ii]]>d[u]+w[u][ii])
			{
				d[v[u][ii]]=d[u]+w[u][ii];
				pq.push(mp(-d[v[u][ii]],v[u][ii]));
			}
		}
	}
	return ma;
}
ll cek(ll aa,ll bb)
{
	ll ii;
	v[aa].pb(bb);
	w[aa].pb(C);
	v[bb].pb(aa);
	w[bb].pb(C);
	ll ma=0,cln=0;
	for(ii=n;ii<n*2;ii++)
		ma=max(ma,cak(ii));
	v[aa].pop_back();
	w[aa].pop_back();
	v[bb].pop_back();
	w[bb].pop_back();
	return ma;
	//cout<<aa<<" "<<bb<<" "<<ma<<" "<<cln<<"\n";
	/*
	ma=0;
	for(ii=0;ii<(n*2);ii++)
		d[ii]=1e18;
	d[cln]=0;
	pq.push(mp(0,cln));
	cln=0;
	while(!pq.empty())
	{
		ll u=pq.top().se;
		ll dis=-pq.top().fi;
		pq.pop();
		if(d[u]!=dis)
			continue;
		ma=max(ma,d[u]);
		if(ma==d[u])
			cln=u;
		ll ii;
		for(ii=0;ii<v[u].size();ii++)
		{
			if(d[v[u][ii]]>d[u]+w[u][ii])
			{
				d[v[u][ii]]=d[u]+w[u][ii];
				pq.push(mp(-d[v[u][ii]],v[u][ii]));
			}
		}
	}
	//cout<<aa<<" "<<bb<<" "<<ma<<"\n";
	//cout<<ma<<"\n";
	return ma;
	*/
}
long long find_shortcut(int N, std::vector<int> l, std::vector<int> d, int c)
{
	n=N;
	C=c;
	for(i=0;i<(n-1);i++)
		jar[i]=l[i];
	for(i=0;i<n;i++)
		tam[i]=d[i];
	for(i=0;i<(n-1);i++)
	{
		v[i].pb(i+1);
		w[i].pb(jar[i]);
		v[i+1].pb(i);
		w[i+1].pb(jar[i]);
	}
	for(i=0;i<n;i++)
	{
		v[i].pb(i+n);
		w[i].pb(tam[i]);
		v[i+n].pb(i);
		w[i+n].pb(tam[i]);
	}
	has=1e18;
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
			has=min(has,cek(i,j));
    return has;
}

Compilation message

shortcut.cpp: In function 'll cak(ll)':
shortcut.cpp:32:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ii=0;ii<v[u].size();ii++)
            ~~^~~~~~~~~~~~
shortcut.cpp:25:6: warning: unused variable 'dis' [-Wunused-variable]
   ll dis=-pq.top().fi;
      ^~~
shortcut.cpp: In function 'll cek(ll, ll)':
shortcut.cpp:50:10: warning: unused variable 'cln' [-Wunused-variable]
  ll ma=0,cln=0;
          ^~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 7.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 22.0

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

Subtask #7
0 / 4.0

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

Subtask #8
0 / 3.0

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