Submission #1062844

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1062844	2024-08-17 11:11:40	nvujica	Shortcut (IOI16_shortcut)	C++14	23 / 100	2020 ms	604 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 <bits/stdc++.h>
#include "shortcut.h"
#define ll long long
using namespace std;
const int maxn = 505;
const ll inf = (1LL << 60);
ll dpoc[maxn];
ll find_shortcut(int n, vector<int> l, vector<int> d, int c){
    for(int i = 1; i < n; i++){
        dpoc[i] = dpoc[i - 1] + l[i - 1];
    }
    ll ans = inf;
    for(int a = 0; a < n; a++){
        for(int b = a + 1; b < n; b++){
            ll maks = 0;
            for(int x = 0; x < n; x++){
                for(int y = x + 1; y < n; y++){
                    ll dxa = abs(dpoc[x] - dpoc[a]);
                    ll dxb = abs(dpoc[x] - dpoc[b]);
                    ll dya = abs(dpoc[y] - dpoc[a]);
                    ll dyb = abs(dpoc[y] - dpoc[b]);
                    ll dxy = abs(dpoc[x] - dpoc[y]);
                    dxa = min(dxa, dxb + c);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 14 / 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