oj.uz

Submission #69095

# Submission time Handle Problem Language Result Execution time Memory
69095 2018-08-20T03:29:10 Z TuGSGeReL Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 2 ms 376 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
int i;
vector<long long> a,b;
long long delivery(int n, int k, int l, int p[]) {
	sort(p,p+n);
	for(i=0;i<n;i++) a.push_back(min(p[i]*2,l)),p[i]=l-p[i];
	for(i=n;i>=0;i--) b.push_back(min(p[i]*2,l));
	for(i=0;i<n;i++){
		if(i>=k){
			a[i]+=a[i-k];
			b[i]+=b[i-k];
		}
	}
	long long ans=1e15;
	for(i=0;i<n;i++)ans=min(ans,a[i]+b[i]);
    return ans;
}

Subtask #1
0 / 10.0

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

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 252 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 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 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 Incorrect 2 ms 376 KB Output isn't correct
3 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 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -