oj.uz

답안 #1011713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011713 2024-07-01T07:18:28 Z pawned 선물상자 (IOI15_boxes) C++17
100 / 100
 799 ms 268572 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

ll delivery(int n, int kg, int lg, int p[]) {
	ll N = n; ll K = kg; ll L = lg;
	// length is L, have N teams, distribute K at a time
	ll cut = L / 2;
	vi leftv;	// [0, cut]
	vi rightv;	// [cut + 1, L - 1];
	sort(p, p + N);
	for (int i = 0; i < N; i++) {
		if (p[i] <= cut)
			leftv.pb(p[i]);
		else
			rightv.pb(L - p[i]);
	}
	sort(leftv.begin(), leftv.end());
	sort(rightv.begin(), rightv.end());
/*	cout<<"leftv: ";
	for (ll x : leftv)
		cout<<x<<" ";
	cout<<endl;
	cout<<"rightv: ";
	for (ll x : rightv)
		cout<<x<<" ";
	cout<<endl;*/
	int X = (int)(leftv.size());
	int Y = (int)(rightv.size());
	ll mincost = 1e18;
	ll cost = 0;
	for (int i = X - 1; i >= 0; i -= K) {
		cost += leftv[i] * 2;
	}
	for (int i = Y - 1; i >= 0; i -= K) {
		cost += rightv[i] * 2;
	}
	mincost = cost;
	for (int i = 1; i < K; i++) {	// count remove in left
		if (X < i || Y < (K - i))
			continue;
		cost = L;
		for (int j = X - i - 1; j >= 0; j -= K) {
			cost += leftv[j] * 2;
		}
		for (int j = Y - (K - i) - 1; j >= 0; j -= K) {
			cost += rightv[j] * 2;
		}
		mincost = min(mincost, cost);
	}
	return mincost;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:40:32: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   40 |  for (int i = X - 1; i >= 0; i -= K) {
      |                              ~~^~~~
boxes.cpp:43:32: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   43 |  for (int i = Y - 1; i >= 0; i -= K) {
      |                              ~~^~~~
boxes.cpp:51:37: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   51 |   for (int j = X - i - 1; j >= 0; j -= K) {
      |                                   ~~^~~~
boxes.cpp:54:28: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   54 |   for (int j = Y - (K - i) - 1; j >= 0; j -= K) {
      |                ~~~~~~~~~~~~^~~
boxes.cpp:54:43: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   54 |   for (int j = Y - (K - i) - 1; j >= 0; j -= K) {
      |                                         ~~^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 356 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 360 KB Output is correct
32 Correct 1 ms 360 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 356 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 360 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 73 ms 23864 KB Output is correct
34 Correct 34 ms 18128 KB Output is correct
35 Correct 38 ms 18552 KB Output is correct
36 Correct 57 ms 22220 KB Output is correct
37 Correct 63 ms 22564 KB Output is correct
38 Correct 54 ms 24008 KB Output is correct
39 Correct 58 ms 22496 KB Output is correct
40 Correct 39 ms 17860 KB Output is correct
41 Correct 72 ms 22212 KB Output is correct
42 Correct 39 ms 16584 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 352 KB Output is correct
29 Correct 0 ms 356 KB Output is correct
30 Correct 0 ms 360 KB Output is correct
31 Correct 0 ms 360 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 73 ms 23864 KB Output is correct
34 Correct 34 ms 18128 KB Output is correct
35 Correct 38 ms 18552 KB Output is correct
36 Correct 57 ms 22220 KB Output is correct
37 Correct 63 ms 22564 KB Output is correct
38 Correct 54 ms 24008 KB Output is correct
39 Correct 58 ms 22496 KB Output is correct
40 Correct 39 ms 17860 KB Output is correct
41 Correct 72 ms 22212 KB Output is correct
42 Correct 39 ms 16584 KB Output is correct
43 Correct 799 ms 240872 KB Output is correct
44 Correct 325 ms 155248 KB Output is correct
45 Correct 403 ms 173316 KB Output is correct
46 Correct 603 ms 268460 KB Output is correct
47 Correct 609 ms 217456 KB Output is correct
48 Correct 611 ms 268572 KB Output is correct
49 Correct 777 ms 227032 KB Output is correct
50 Correct 477 ms 180672 KB Output is correct
51 Correct 796 ms 268508 KB Output is correct
52 Correct 438 ms 209936 KB Output is correct