oj.uz

답안 #931962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931962 2024-02-22T16:34:07 Z Art_ogo 선물상자 (IOI15_boxes) C++17
0 / 100
 1 ms 448 KB 
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <algorithm>
#include <utility>
#include <vector>
#include <iostream>
#include "boxes.h"

#define ll long long
#define ve vector

using namespace std;

int dst(int x, int L){
    return min(x, L - x);
}

long long delivery(int N, int K, int L, int p[]) {
    int cnt0 = 0;
    for(int i = 0; i < N; i++)
        cnt0 += p[i] == 0;
    N -= cnt0;
    
    ve<ll> dpl(N), dpr(N);
    dpl[0] = p[0];

    for(int i = 0; i < N; i++)
        p[i] = p[i + cnt0];
    int cnt = 1;
    for(int i = 1; i < N; i++){
        dpl[i] = dpl[i - 1] + p[i] - p[i - 1];
        cnt++;
        if(cnt == K + 1){
            dpl[i] += 2*p[i - 1];
            cnt = 1;
        }
    }
    cnt = 1;
    dpr[N - 1] = L - p[N - 1];
    for(int i = N - 2; i >= 0; i--){
        dpr[i] = dpr[i + 1] + p[i + 1] - p[i];
        cnt++;
        if(cnt == K + 1){
            dpr[i] += 2*(L - p[i + 1]);
            cnt = 1;
        }
    }
    ll res = min(dpl[N - 1] + dst(p[N - 1], L), dpr[0] + dst(p[0], L));
    for(int i = 0; i < N - 1; i++)
        res = min(res, dpl[i] + dst(p[i], L) + dpr[i + 1] + dst(p[i + 1], L));
    return res;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 448 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 448 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 448 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 448 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -