oj.uz

Submission #163154

# Submission time Handle Problem Language Result Execution time Memory
163154 2019-11-11T14:56:56 Z kostia244 Boxes with souvenirs (IOI15_boxes) C++14
35 / 100
 1320 ms 400 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>;
ll n, k, l;
vi pos, dpl, dpr;
ll solve() {
	ll ans = LLONG_MAX;
	dpl.assign(n + 2,0);
	dpr.assign(n + 2,0);
	ll p, cst;
	p = cst = 0;
	for (int i = 1; i <= n; i++) {
		cst += min(abs(p - pos[i]), l - abs(p - pos[i])), p = pos[i];
		dpl[i] = cst + min(p, l - p);
		if (i % k == 0) {
			cst += min(p, l - p);
			p = 0;
		}
	}
	ans = dpl[n], p = 0, cst = 0;
	for (int i = n; i; i--) {
		cst += min(abs(p - pos[i]), l - abs(p - pos[i])), p = pos[i];
		dpr[i] = cst + min(p, l - p);
		if ((n - i + 1) % k == 0) {
			cst += min(p, l - p);
			p = 0;
		}
		ans = min(ans, dpr[i] + dpl[i - 1]);
	}
	return ans;
}
long long delivery(int N, int K, int L, int P[]) {
	n = N, k = K, l = L;
	pos.resize(n + 2);
	for (int i = 0; i < n; i++)
		pos[i + 1] = P[i];
	ll ans = solve();
	if(N<11)
	do {
		ans = min(ans, solve());
	} while(next_permutation(pos.begin()+1, pos.begin()+1+n));
	return ans;
}

Compilation message

boxes.cpp: In function 'll solve()':
boxes.cpp:25:15: 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 256 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 400 KB Output is correct

Subtask #2
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 #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 256 KB Output is correct
5 Correct 1270 ms 360 KB Output is correct
6 Correct 1275 ms 380 KB Output is correct
7 Correct 1253 ms 376 KB Output is correct
8 Correct 1320 ms 364 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 400 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 1270 ms 360 KB Output is correct
20 Correct 1275 ms 380 KB Output is correct
21 Correct 1253 ms 376 KB Output is correct
22 Correct 1320 ms 364 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Incorrect 2 ms 376 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 400 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 1270 ms 360 KB Output is correct
20 Correct 1275 ms 380 KB Output is correct
21 Correct 1253 ms 376 KB Output is correct
22 Correct 1320 ms 364 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Incorrect 2 ms 376 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 400 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 1270 ms 360 KB Output is correct
20 Correct 1275 ms 380 KB Output is correct
21 Correct 1253 ms 376 KB Output is correct
22 Correct 1320 ms 364 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Incorrect 2 ms 376 KB Output isn't correct
25 Halted 0 ms 0 KB -