oj.uz

답안 #931966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931966 2024-02-22T16:39:58 Z Art_ogo 선물상자 (IOI15_boxes) C++17
10 / 100
 1 ms 348 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;
    for(int i = 0; i < N; i++)
        p[i] = p[i + 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;
}


//static char _buffer[1024];
//static int _currentChar = 0;
//static int _charsNumber = 0;
//static FILE *_inputFile, *_outputFile;
//
//static inline int _read() {
//    if (_charsNumber < 0) {
//        exit(1);
//    }
//    if (!_charsNumber || _currentChar == _charsNumber) {
//        _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
//        _currentChar = 0;
//    }
//    if (_charsNumber <= 0) {
//        return -1;
//    }
//    return _buffer[_currentChar++];
//}
//
//static inline int _readInt() {
//    int x;
//    std::cin >> x;
//    return x;
//}
//
//int main() {
//    _inputFile = fopen("boxes.in", "rb");
//    _outputFile = fopen("boxes.out", "w");
//    
//    int N, K, L, i;
//    N = _readInt();
//    K = _readInt();
//    L = _readInt();
//    
//    int *p = (int*)malloc(sizeof(int) * (unsigned int)N);
//    
//    for (i = 0; i < N; i++) {
//        p[i] = _readInt();
//    }
//    cout << delivery(N, K, L, p);
//    return 0;
//}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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