Submission #223603

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
223603	2020-04-15T14:53:01 Z	a_player	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	5 ms	384 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;

typedef long long ll;

map<int,int> m;

long long delivery(int N, int K, int L, int p[]) {
  
    for(int i=0;i<N;i++){
		m[p[i]]++;
	}
	ll ans=0;
	
	if(K==1){
			for(auto x:m){
		ans+=(ll)min(x.f,L-x.f)*(ll)x.s*2LL;
	}
	return ans;
	
}
	int pp=0;
	for(auto x:m){
		if(x.f==L/2)return L;
		if(x.f>L/2){
			return min((ll)L,2LL*(ll)(pp+L-x.f));
		}
		
		pp=x.f;
	}
	
	return 2LL*pp;
	
}

Subtask #1

10.0 / 10.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Incorrect	5 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	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Incorrect	5 ms	256 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Incorrect	5 ms	256 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	256 KB	Output is correct
16	Incorrect	5 ms	256 KB	Output isn't correct
17	Halted	0 ms	0 KB	-