oj.uz

답안 #974821

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974821 2024-05-03T20:21:57 Z marinaluca 선물상자 (IOI15_boxes) C++17
10 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>


using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin(x), end(x)
#define FOR (i, a, b) for (auto i = (a); i < (b); ++ i)

const int NMAX = 1e7;
int ans[11111111], rez[11111111];
int delivery (int n, int k, int l, int s[]){
    for (int i = 1; i <= n; ++ i){
        ans[i] = min (s[i - 1] << 1 , l);
        if (i > k){
            ans[i] += ans[i - k];
        }
    }
    int mini = ans[n];
    for (int i = n - 1; i >= 0; -- i){
        rez[i] = min ((l - s[i]) << 1, l);
        if (i + k < n){
            rez[i] += rez[i + k];
        }
        mini = min (mini, rez[i] + ans[i]);
    }
    return mini;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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