답안 #30551 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30551	2017-07-24T15:03:06 Z	kavun	선물상자 (IOI15_boxes)	C++14	100 / 100	584 ms	170972 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back

using namespace std;
typedef long long ll;
long long n,l,k,ans = 1e18;
vector <ll> lft,rgt;


long long delivery(int N, int K, int L, int p[]) {
  n = N;
  k = K;
  for(int i = 0; i < n; i++)
    {
      if(p[i] <= L/2)
	lft.push_back(p[i]*2);
      else 
	rgt.push_back(2*(L-p[i]));
    }
  reverse(rgt.begin(),rgt.end());
  for(int i = k; i < lft.size(); i++)
    lft[i] = lft[i-k] + lft[i];
  for(int i = k; i < rgt.size(); i++)
    rgt[i] = rgt[i-k] + rgt[i];
  for(int i = 0; i <= k; i++)
    {
      int x = i;
      int y = k-i;
      ans = min(ans, (x < lft.size() ? lft[lft.size() - 1 - x] : 0) + (y < rgt.size() ?  rgt[rgt.size() - 1 - y] : 0) + L);
    }
  return min(ans, (lft.size() ? lft.back() : 0) + (rgt.size() ? rgt.back() : 0));
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:22:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   for(int i = k; i < lft.size(); i++)
               ^
boxes.cpp:22:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = k; i < lft.size(); i++)
                  ~~^~~~~~~~~~~~
boxes.cpp:24:15: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   for(int i = k; i < rgt.size(); i++)
               ^
boxes.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = k; i < rgt.size(); i++)
                  ~~^~~~~~~~~~~~
boxes.cpp:29:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
       int y = k-i;
               ~^~
boxes.cpp:30:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       ans = min(ans, (x < lft.size() ? lft[lft.size() - 1 - x] : 0) + (y < rgt.size() ?  rgt[rgt.size() - 1 - y] : 0) + L);
                       ~~^~~~~~~~~~~~
boxes.cpp:30:74: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       ans = min(ans, (x < lft.size() ? lft[lft.size() - 1 - x] : 0) + (y < rgt.size() ?  rgt[rgt.size() - 1 - y] : 0) + L);
                                                                        ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 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	376 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	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	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	256 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	256 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 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	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 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	256 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	256 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	252 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 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	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 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	256 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	256 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	252 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	48 ms	14316 KB	Output is correct
34	Correct	27 ms	16184 KB	Output is correct
35	Correct	31 ms	16212 KB	Output is correct
36	Correct	50 ms	12584 KB	Output is correct
37	Correct	48 ms	12640 KB	Output is correct
38	Correct	49 ms	14168 KB	Output is correct
39	Correct	49 ms	14376 KB	Output is correct
40	Correct	30 ms	14284 KB	Output is correct
41	Correct	50 ms	12572 KB	Output is correct
42	Correct	30 ms	12512 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 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	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	256 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	256 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	256 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	252 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	256 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	48 ms	14316 KB	Output is correct
34	Correct	27 ms	16184 KB	Output is correct
35	Correct	31 ms	16212 KB	Output is correct
36	Correct	50 ms	12584 KB	Output is correct
37	Correct	48 ms	12640 KB	Output is correct
38	Correct	49 ms	14168 KB	Output is correct
39	Correct	49 ms	14376 KB	Output is correct
40	Correct	30 ms	14284 KB	Output is correct
41	Correct	50 ms	12572 KB	Output is correct
42	Correct	30 ms	12512 KB	Output is correct
43	Correct	562 ms	144372 KB	Output is correct
44	Correct	282 ms	135700 KB	Output is correct
45	Correct	330 ms	145992 KB	Output is correct
46	Correct	550 ms	170904 KB	Output is correct
47	Correct	516 ms	119832 KB	Output is correct
48	Correct	584 ms	170896 KB	Output is correct
49	Correct	469 ms	144380 KB	Output is correct
50	Correct	356 ms	144340 KB	Output is correct
51	Correct	560 ms	170972 KB	Output is correct
52	Correct	385 ms	170948 KB	Output is correct

답안 #30551

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 30.0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
30.0 / 30.0