oj.uz

답안 #331093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331093 2020-11-27T10:17:07 Z Pety 선물상자 (IOI15_boxes) C++14
20 / 100
 9 ms 492 KB 
#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

const int N = 10000002;
long long dp[N], dp2[N];

long long delivery (int n, int k, int l, int poz[]) {
  for (int i = n; i >= 1; i--) poz[i] = poz[i - 1]; ///oof
  for (int i = 1; i <= n; i++)
    dp[i] = (i >= k ? dp[i - k] + 2 * poz[i] : 2 * poz[i]);
  for (int i = n; i >= 1; i--)
    dp2[i] = (i <= n - k ? dp2[i + k] + 2 * (l - poz[i]) : 2 * (l - poz[i]));
  long long ans = 1e18;
  for (int i = 0; i <= n; i++)
    ans =min(ans, dp[i] + dp2[i + 1]);
  for (int i = 0; i <= n - k; i++)
    ans = min(ans, dp[i] + dp2[i + k + 1] + l);
  return ans;
}

/*int main () {
  int aux[] = {1, 2, 5};
  cout << delivery(3, 2, 8, aux) << "\n";
}*/

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Runtime error 9 ms 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Runtime error 9 ms 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Runtime error 9 ms 492 KB Execution killed with signal 6 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -