oj.uz

Submission #947610

# Submission time Handle Problem Language Result Execution time Memory
947610 2024-03-16T15:30:08 Z 4QT0R Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
using namespace std;

int pref[10000002];
int suf[10000002];

int delivery(int n, int k, int l, int positions[]){
	for (int i = 0; i<k; i++)pref[i]=positions[i];
	for (int i = k; i<n; i++)pref[i]=positions[i]+pref[i-k];
	for (int i = n-1; i>n-k-1; i--)suf[i]=l-positions[i];
	for (int i = n-k-1; i>=0; i--)suf[i]=l-positions[i]+suf[i+k];

	int ans=suf[0];
	for (int i = 0; i<n-1; i++)ans=min(ans,2*pref[i]+2*suf[i+1]);
	for (int i = 0; i<n-1; i++)ans=min(ans,2*pref[i]+l+2*(i+k<n ? suf[i+k] : suf[n-1]));
	return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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