oj.uz

Submission #787487

# Submission time Handle Problem Language Result Execution time Memory
787487 2023-07-19T08:29:10 Z Sohsoh84 Shortcut (IOI16_shortcut) C++17
0 / 100
 1 ms 340 KB 
#include "shortcut.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl; 

const ll MAXN = 1e6 + 10;
const ll INF = 8e18;

int n;
ll L[MAXN], ps[MAXN], D[MAXN], XT[MAXN], XS[MAXN], c, fans;

inline ll dist(int i, int j) {
	if (i > j) swap(i, j);
	return ps[j] - ps[i];
}

inline ll solve(int l, int r, bool flag = false) {
	if (!flag && c >= dist(l, r)) return INF;
	if (r < l) return INF;
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			ans = max(ans, min(dist(i, j), dist(i, l) + dist(r, j) + c)+ D[i] + D[j]);
		}
	}

	return ans;
}

inline void divide(int l, int r, int optl, int optr) {
	if (r < l) return;
	int mid = (l + r) >> 1;

	int opt = optl;
	ll ans = INF;
	for (int i = optl; i <= optr; i++) {
		ll tans = solve(i, mid);
		if (tans <= ans) {
			opt = i;
			ans = tans;
		}
	}

	fans = min(fans, ans);
	divide(l, mid - 1, optl, opt);
	divide(mid + 1, r, opt, optr);
}

ll find_shortcut(int n_, vector<int> l_, vector<int> d_, int c_) {
	n = n_;
	c = c_;
	for (int i = 1; i <= n; i++) {
		L[i] = l_[i - 1];
		D[i] = d_[i - 1];
		if (i < n) ps[i + 1] = ps[i] + L[i];

		XS[i] = D[i] - ps[i];
		XT[i] = D[i] + ps[i];
	}

	fans = solve(1, 1, 1);
	divide(1, n, 1, n);
	return fans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB n = 4, incorrect answer: jury 80 vs contestant 110
2 Halted 0 ms 0 KB -