제출 #297115

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
297115	2020-09-11 09:13:19	Mercenary	Shortcut (IOI16_shortcut)	C++14	31 / 100	2047 ms	512 KiB

shortcut

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 6;
typedef long long ll;
ll prv[maxn];
ll suf[maxn];
ll cur[maxn];
ll pre_res[maxn];
ll suf_res[maxn];
long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    vector<ll> sum(n , 0);
    for(int i = 1 ; i < n ; ++i){
        sum[i] = sum[i - 1] + l[i - 1];
    }
    auto dis = [&](int i , int j){
        return sum[j] - sum[i];
    };
    for(int i = 0 ; i < n ; ++i){
        if(i > 0)prv[i] = prv[i - 1] + l[i - 1];
        prv[i] = max(prv[i] , (ll)d[i]);
    }
    for(int i = n - 1 ; i >= 0 ; --i){
        if(i + 1 < n)suf[i] = suf[i + 1] + l[i];
        suf[i] = max(suf[i] , (ll)d[i]);
    }
    ll res = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3