oj.uz

답안 #989334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989334 2024-05-28T02:14:57 Z normankr07 선물상자 (IOI15_boxes) C++17
25 / 100
 1 ms 348 KB 
#define taskname ""
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#ifndef LOCAL
#define cerr \
    if (0)   \
    cerr
#endif
 
const bool multitest = 0;
 
const int MAXN = 1e7 + 5;
int pos[MAXN];
 
long long delivery(int N, int K, int L, int p[])
{
    vector<ll> lt(N + 3), rt(N + 3);
    for (int i = 1; i <= N; i++)
    {
        if (i - K >= 0)
        {
            lt[i] = lt[i - K] + p[i - 1] * 2;
            rt[i] = rt[i - K] + ((L - p[N - i]) * 2);
        }
        else
        {
            lt[i] = p[i - 1] * 2;
            rt[i] = ((L - p[N - i]) * 2);
        }
    }
 
    // for (int i = 1; i <= N; i++)
    //     cout << lt[i] << ' ';
    // cout << endl;
    // for (int i = 1; i <= N; i++)
    //     cout << rt[i] << ' ';
    // cout << endl;
 
    ll ans = 1e18;
    for (int i = 0; i <= N; i++)
    {
        ans = min(ans, lt[i] + rt[N - i]);
    }
    for (int i = K; i <= N; i++)
    {
        ans = min(ans, lt[i - (K - 1)] + rt[N - i - 1] + L);
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 0 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -