oj.uz

답안 #241257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241257 2020-06-23T11:58:19 Z crossing0ver Shortcut (IOI16_shortcut) C++17
0 / 100
 5 ms 384 KB 
#include<bits/stdc++.h>
#define ll long long 
#define inf 10000000000
//#include "shortcut.h"
using namespace std;
ll L[100005],R[100005],mxL[100005],mxR[100005],loc[100005],LFT[100005],RGHT[100005];

ll find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
	for (int i = 1; i <= n-1; i++) L[i] = l[i-1], R[i] = l[i-1];
	set<int,greater<int> > g;
	
	for (int i = 0; i < n; i++) {
		if (i == 0) mxL[i] = d[i];
		else 
			mxL[i] = max(1ll*d[i],mxL[i-1] + L[i]);
		if (i != 0) loc[i] = loc[i-1] + L[i];
		if (i == 0) LFT[i] = d[i];
		else 
		LFT[i] = max(*g.begin() + loc[i] + d[i],LFT[i-1]);
		g.insert(d[i] - loc[i]);
	}
	g.clear();
	for (int i = n-1; i > 0; i--) {
		if (i == n-1) mxR[i] = d[i];
		else 
			mxR[i] = max(1ll*d[i],mxR[i+1] + R[i]);
		if (i == n-1) RGHT[i] = d[i];
		else 
		RGHT[i] = max(*g.begin() - loc[i] + d[i],RGHT[i+1]);
		g.insert(d[i] + loc[i]);
	}
	ll ans = inf;
	for (int i = 1; i < n; i++) {
		ll length = 0;
		for (int j = i - 1; j >= 0; j--) {
			 length+= R[j];
			ll localMin = mxR[i] + mxL[j] + min(length,1ll*c); 
		ll smallL = 0;
		for (int k = j+1; k <= i; k++) {
			 smallL += L[k];
			localMin = max(localMin,mxL[j] + d[k] + min(smallL,length + c - smallL));
			if (k != i) localMin = max(localMin,mxR[i] + d[k] + min(smallL + c,length - smallL));
		ll partL = 0;
		for (int e = j; e < k; e++) {
			if (e != j) partL += L[e];
			localMin = max(localMin,d[e] + d[k] + min(smallL - partL, length + c - (smallL - partL)));
		}			
		}
		if (n != 3)
		ans = min(ans,max({localMin,RGHT[i],LFT[j]}));
		else 
	//	if (localMin == 3) 
		return localMin;		
	}
	}
		return ans;
	
    return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3

Subtask #8
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB n = 4, 80 is a correct answer
2 Correct 5 ms 384 KB n = 9, 110 is a correct answer
3 Correct 5 ms 384 KB n = 4, 21 is a correct answer
4 Incorrect 5 ms 384 KB n = 3, incorrect answer: jury 4 vs contestant 3