Submission #128266

#	Time	Username	Problem	Language	Result	Execution time	Memory
128266		ekrem	Shortcut (IOI16_shortcut)	C++98	0 / 100	28 ms	452 KiB

shortcut

#include "shortcut.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000000000000009
#define N 1000005
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef vector < int > vi;

ll n, c, x, y, ans = inf, pre[N];
vi a, d;

ll bul(int i, int j){
	return d[i] + d[j] + min(pre[j] - pre[i], abs(pre[x]-pre[i]) + abs(pre[y]-pre[j]) + c);
}

ll dene(int yy){
	y = yy;
	ll mx = 0;
	for(int i = 0; i < n; i++)
		for(int j = i + 1; j < n; j++)
			mx = max(mx, bul(i, j));
	return mx;
}

ll find_shortcut(int nn, vi l, vi dd, int cc){n = nn;c = cc;
	a = l;d = dd;
	for(int i = 0; i < n - 1; i++)
		pre[i + 1] = pre[i] + a[i];
	int onc = 0;
	for(x = 0; x < n; x++){
		ll cvp = inf, opt = N;
		int bas = x + 1, son = n - 1;
		while(bas < son){
			if(dene(orta + 1) <= dene(orta))
				bas = orta + 1;
			else
				son = orta;
		}
		// for(y = x + 1; y < n; y++){
		// 	ll mx = dene(y);
		// 	if(mx < cvp){
		// 		cvp = mx;
		// 		opt = y;
		// 	}
		// }
		// cout << cvp << " " << dene(orta) << endl;
		// cout << opt << " " << onc << endl;
		ans = min(ans, dene(orta));
		// if(opt < onc)assert(0);
		// onc = opt;
	}
	return ans;
}

Compilation message (stderr)

shortcut.cpp: In function 'll find_shortcut(int, vi, vi, int)':
shortcut.cpp:42:6: warning: unused variable 'cvp' [-Wunused-variable]
   ll cvp = inf, opt = N;
      ^~~
shortcut.cpp:42:17: warning: unused variable 'opt' [-Wunused-variable]
   ll cvp = inf, opt = N;
                 ^~~
shortcut.cpp:40:6: warning: unused variable 'onc' [-Wunused-variable]
  int onc = 0;
      ^~~

• 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