oj.uz

Submission #16721

# Submission time Handle Problem Language Result Execution time Memory
16721 2015-09-10T02:20:42 Z comet Boxes with souvenirs (IOI15_boxes) C++
0 / 100
 2 ms 376 KB 
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
#include "boxes.h"

ll l[10000000],r[10000000];
ll delivery(int N,int K,int L,int p[]){
	for(int i=0;i<K;i++){
		l[i]=min(2ll*p[i],(ll)L);
	}
	for(int i=K;i<N;i++){
		l[i]=l[i-K]+min(2ll*p[i],(ll)L);
	}
	for(int i=N-1;i>=N-K;i--){
		r[i]=min(2ll*(L-p[i]),(ll)L);
	}
	for(int i=N-K-1;i>=0;i--){
		r[i]=r[i+K]+min(2ll*(L-p[i]),(ll)L);
	}
	ll ans=2e18;
	for(int i=1;i<N;i++){
		ans=min(ans,l[i-1]+r[i]);
	}
	return ans;
}

Subtask #1
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 #2
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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
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 #5
0 / 20.0

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

Subtask #6
0 / 30.0

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