oj.uz

답안 #853076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853076 2023-09-23T12:04:44 Z waldi Shortcut (IOI16_shortcut) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
#include "shortcut.h"
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define inf 1000000000000000000ll
using namespace std;
typedef long long ll;

ll find_shortcut(int n, vector<int> l_int, vector<int> d_int, int c_int){
	vector<ll> l(n), d(n);
	REP(i, n) l[i] = l_int[i], d[i] = d_int[i];
	ll c = c_int;
	
	vector<ll> pref(n, 0ll);
	FOR(i, 1, n-1) pref[i] = pref[i-1]+l[i-1];
	
	ll lewo_ogolem = -inf;
	ll prawo_ogolem = -inf;
	REP(i, n){
		lewo_ogolem = max(lewo_ogolem, d[i]-pref[i]);
		prawo_ogolem = max(prawo_ogolem, d[i]+pref[i]);
	}
	ll wyn = lewo_ogolem+prawo_ogolem;
	REP(kon, n) REP(poc, kon){
		ll odl = 0ll;
		
		ll lewopoc = -inf;
		ll lewokon = -inf;
		FOR(i, 0, poc){
			lewopoc = max(lewopoc, d[i]-pref[i]);
			lewokon = max(lewokon, d[i]+pref[i]);
		}
		ll prawokon = -inf;
		ll prawopoc = -inf;
		FOR(i, kon, n-1){
			prawokon= max(prawokon, d[i]+pref[i]);
			prawopoc = max(prawopoc, d[i]-pref[i]);
		}
		odl = max(odl, lewopoc+prawokon-pref[kon]+pref[poc]+c);
		odl = max(odl, lewopoc+lewokon);
		odl = max(odl, prawopoc+prawokon);
		
		/*
		//printf("odl: %lld\n", odl);
		//printf("%lld %lld\n", lewo, prawo);
		
		ll cykl = pref[kon]-pref[poc]+c;
		FOR(i, poc, kon){
			ll dopoc = pref[i]-pref[poc];
			ll dokon = pref[kon]-pref[i];
			dopoc = min(dopoc, cykl-dopoc);
			dokon = min(dokon, cykl-dokon);
			odl = max(odl, lewopoc+dopoc+pref[poc]+d[i]);
			odl = max(odl, dokon+prawokon-pref[kon]+d[i]);
		}*/
		
		/*int it = poc;
		FOR(i, poc, kon){
			while(it < kon && pref[it+1]-pref[i] <= (cykl>>1)) ++it;
			odl = max(odl, pref[it]-pref[i]+d[i]+d[it]);
		}*/
		
		/*FOR(i, poc, kon) FOR(j, i+1, kon){
			ll t = pref[j]-pref[i];
			t = min(t, cykl-t);
			odl = max(odl, t+d[i]+d[j]);
		}*/
		
		REP(j, n) REP(i, j){
			if(i <= poc && j >= kon) continue;
			if(i <= poc && j <= poc) continue;
			if(i >= kon && j >= kon) continue;
			
			ll t = pref[j]-pref[i];
			t = min(t, c + abs(pref[i]-pref[poc]) + abs(pref[kon]-pref[j]));
			odl = max(odl, t+d[i]+d[j]);
		}
		
		//printf("%d %d: %lld\n", poc, kon, odl);
		wyn = min(wyn, odl);
	}
	return wyn;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 7.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 22.0

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

Subtask #7
0 / 4.0

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

Subtask #8
0 / 3.0

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