oj.uz

Submission #140301

# Submission time Handle Problem Language Result Execution time Memory
140301 2019-08-02T13:48:26 Z SirCeness Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 867 ms 275144 KB 
#include "boxes.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
#define orta ((l+r)>>1)
#define INF 1000000009
#define mod 1000000007
#define ppair(x); cerr << "(" << x.first << ", " << x.second << ")\n";
#define bas(x) #x << ": " << x << " "
#define prarr(x, n); cerr << #x << ": "; for(int qsd = 0; qsd < n; qsd++) cerr << x[qsd] << " "; cerr << "\n";
#define prarrv(x); cerr << #x << ": "; for(int qsd = 0; qsd < (int)x.size(); qsd++) cerr << x[qsd] << " "; cerr << "\n";
using namespace std;
typedef long long ll;

ll n, k, s;
vector<int> arr;
vector<int> ters;

ll tekcoz(vector<ll>& ar){
	if (ar.size() == 0) return 0;
	if (ar[0] > ar.back()) reverse(ar.begin(), ar.end());
	int i = (int)ar.size()-1;
	ll ans = 0;
	while (i >= 0){
		ans += ar[i] + ar[i];
		i -= k;
	}
	return ans;
}

ll solve(){
	vector<ll> sol, sag;
	for (int i = 0; i < n; i++) if (arr[i] < s - arr[i]) sol.pb(arr[i]); else sag.pb(s - arr[i]);
	return tekcoz(sol) + tekcoz(sag);
}

ll coz(int duz, int a){
	ll ans = 0;
	if (duz){
		int i = a;
		while(i >= 0){
			ans += arr[i]*2;
			i -= k;
		}
	} else {
		int i = a;
		while (i < n){
			ans += ters[i]*2;
			i += k;
		}
	}
	return ans;
}

ll solve2(){
	int l = 0;
	int r = k-1;
	ll ans = 1000000000000000;
	int sinir;
	for (sinir = 0; sinir < n-1; sinir++){
		if (arr[sinir] >= s-arr[sinir]) break;
	}
	while (r < n && l <= sinir){
		if (r >= sinir){
			ans = min(ans, coz(1, l-1) + coz(0, r+1) + s);
		}
		l++; r++;
	}
	return ans;
}

ll delivery(int N, int K, int L, int p[]) {
	n = N;
	k = K;
	s = L;
	for (int i = 0; i < n; i++) arr.pb(p[i]);
	//sort(arr.begin(), arr.end());
	for (int i = 0; i < n; i++) ters.pb(s-p[i]);
	
	
	ll ans = 0;
	int artik = n%k;
	int l = 0;
	int r = n-1;
	ll bas, son;
	if (artik){	
		bas = arr[l+artik-1];
		son = s - arr[r-artik+1];
		if (bas < son){
			ans = bas*2;
			l += artik;
		} else {
			ans = son*2;
			r -= artik;
		}
	}
	
	while (l <= r){
		bas = arr[l+k-1];
		son = s-arr[r-k+1];
		//cout << bas(bas) << bas(son) << endl;
		if (2*bas > s && 2*son > s){
			ans += s;
			l += k;
			continue;
		}
		if (bas < son) ans += bas*2, l += k;
		else ans += son*2, r -= k;
	}
	
	//cout << solve() << endl;
	
    return min(ans, min(solve(), solve2()));
}

Compilation message

boxes.cpp: In function 'll tekcoz(std::vector<long long int>&)':
boxes.cpp:29:5: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   i -= k;
   ~~^~~~
boxes.cpp: In function 'll coz(int, int)':
boxes.cpp:46:6: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
    i -= k;
    ~~^~~~
boxes.cpp:52:6: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
    i += k;
    ~~^~~~
boxes.cpp: In function 'll solve2()':
boxes.cpp:60:11: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  int r = k-1;
          ~^~
boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:81:39: warning: conversion to 'std::vector<int>::value_type {aka int}' from 'll {aka long long int}' may alter its value [-Wconversion]
  for (int i = 0; i < n; i++) ters.pb(s-p[i]);
                                      ~^~~~~
boxes.cpp:85:15: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  int artik = n%k;
              ~^~
boxes.cpp:87:11: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  int r = n-1;
          ~^~
boxes.cpp:107:6: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
    l += k;
    ~~^~~~
boxes.cpp:110:34: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   if (bas < son) ans += bas*2, l += k;
                                ~~^~~~
boxes.cpp:111:24: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   else ans += son*2, r -= k;
                      ~~^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 368 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 364 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 380 KB Output is correct
7 Correct 2 ms 356 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory 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 368 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 364 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 380 KB Output is correct
14 Correct 2 ms 356 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 400 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 4 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 376 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 392 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory 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 368 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 364 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 380 KB Output is correct
14 Correct 2 ms 356 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 400 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 4 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 376 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 392 KB Output is correct
33 Correct 80 ms 30996 KB Output is correct
34 Correct 55 ms 25964 KB Output is correct
35 Correct 54 ms 24664 KB Output is correct
36 Correct 76 ms 30160 KB Output is correct
37 Correct 80 ms 34444 KB Output is correct
38 Correct 89 ms 31396 KB Output is correct
39 Correct 73 ms 30416 KB Output is correct
40 Correct 57 ms 25780 KB Output is correct
41 Correct 77 ms 30204 KB Output is correct
42 Correct 55 ms 23732 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory 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 368 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 364 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 380 KB Output is correct
14 Correct 2 ms 356 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 400 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 4 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 376 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 392 KB Output is correct
33 Correct 80 ms 30996 KB Output is correct
34 Correct 55 ms 25964 KB Output is correct
35 Correct 54 ms 24664 KB Output is correct
36 Correct 76 ms 30160 KB Output is correct
37 Correct 80 ms 34444 KB Output is correct
38 Correct 89 ms 31396 KB Output is correct
39 Correct 73 ms 30416 KB Output is correct
40 Correct 57 ms 25780 KB Output is correct
41 Correct 77 ms 30204 KB Output is correct
42 Correct 55 ms 23732 KB Output is correct
43 Correct 867 ms 236984 KB Output is correct
44 Correct 537 ms 218840 KB Output is correct
45 Correct 620 ms 225272 KB Output is correct
46 Correct 865 ms 254484 KB Output is correct
47 Correct 822 ms 255040 KB Output is correct
48 Correct 856 ms 272180 KB Output is correct
49 Correct 811 ms 234740 KB Output is correct
50 Correct 634 ms 232900 KB Output is correct
51 Correct 858 ms 275144 KB Output is correct
52 Correct 634 ms 257236 KB Output is correct