답안 #134689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134689	2019-07-23T07:28:10 Z	Boxworld	선물상자 (IOI15_boxes)	C++14	35 / 100	3 ms	392 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
long long delivery(int N, int K, int L, int p[]){
    int m=-1;
    long long ans1=0,ans2=0;
    for (int i=0;i<N;i++)
	if (p[i]*2<L)m=i;
			
	for (int i=m;i>=0;i-=K)ans1+=p[i]*2;
	for (int i=m+1;i<N;i+=K)ans1+=(L-p[i])*2;
	if (m==-1||m==N-1)return ans1;
	int r=m,l=m+1;
	for (int i=0;i<K;i++){
		if (r!=0&&p[r]>L-p[l])r--;
		else if (l<N)l++;else r--;
	}
	for (int i=r;i>=0;i-=K)ans2+=p[i]*2;
	for (int i=l;i<N;i+=K)ans2+=(L-p[i])*2;
	return min(ans1,ans2+L);
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:7:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i=0;i<N;i++)
     ^~~
boxes.cpp:10:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (int i=m;i>=0;i-=K)ans1+=p[i]*2;
  ^~~

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	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	256 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	392 KB	Output is correct

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	392 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Incorrect	2 ms	376 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	392 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Incorrect	2 ms	376 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	256 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	392 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	2 ms	380 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Incorrect	2 ms	376 KB	Output isn't correct
28	Halted	0 ms	0 KB	-