oj.uz

Submission #163167

# Submission time Handle Problem Language Result Execution time Memory
163167 2019-11-11T16:02:25 Z kostia244 Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 2 ms 376 KB 
#include "boxes.h"
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<ll>;
#define dist hbuisanawedjcsk
ll n, k, l, pos[10000011], dpl[10000011], dpr[10000011];
ll distl(ll a, ll b) {
	return min(abs(a-b), l-abs(a-b));
}
#define eval(dp, opt) (dp[opt] + dist(0, pos[opt+1]) + dist(pos[opt+1], pos[i])  + dist(pos[i], 0))
long long delivery(int N, int K, int L, int P[]) {
	n = N, k = K, l = L;
	for (int i = 0; i < n; i++)
		pos[i + 1] = P[i];
	ll opt = 0;
	for(int i = 1; i <= n; i++) {
		opt = max(0ll, i-k);
		dpl[i] = dpl[opt] + 2*pos[i];
	}
	opt=n+1;
	for(int i = n;i;i--) {
		opt = min(n+1ll, i+k);
		dpr[i] = dpr[opt] + 2*(l-pos[i]);
	}
	ll ans = LLONG_MAX;
	for(int i = 0; i <= n; i++) ans = min(ans, dpl[i]+dpr[i+1]);
	return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:24:14: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  for(int i = n;i;i--) {
              ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -