oj.uz

Submission #127295

# Submission time Handle Problem Language Result Execution time Memory
127295 2019-07-09T07:54:33 Z ekrem Boxes with souvenirs (IOI15_boxes) C++
70 / 100
 489 ms 192176 KB 
#include "boxes.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

ll k, l, cvp, ans, bas[N], son[N];

ll ansver(int i, int j){
	return ((i>=0)?bas[i]:0ll) + son[j] + 1ll*(j - i - 1 + k - 1)/k*l;
}

ll delivery(int n, int kk, int ll, int p[]) {k = kk;l = ll;
	for(int i = 0; i < n; i++)
		bas[i] = (i - k >= 0) ? bas[i - k] + p[i]*2ll : p[i]*2ll;
	for(int i = n - 1; i >= 0; i--)
		son[i] = (n > k + i) ? son[i + k] + (l - p[i])*2ll : (l - p[i])*2ll;
	cvp = ans = son[0];
	int opt = 0;
	for(int i = -1; i < n; i++){
		// cvp = son[0];
		// opt = 0;
		int bas = 0, son = (n - i - 1)/n + 1;
		while(bas < son){
			if(ansver(i, i + 1 + orta*k) >= ansver(i, i + 1 + k + orta*k))
				bas = orta + 1;
			else
				son = orta;
		}
		// for(int j = i + 1; j <= n; j += k){
		// 	cout << i << " " << j << " = " << ansver(i, j) << endl;
		// 	if(ansver(i, j) < cvp){
		// 		cvp = ansver(i, j);
		// 		opt = j;
		// 	}
		// }
		// cout << endl << endl;
		// cout << i << " " << opt << " " << cvp << endl;
		ans = min(ans, ansver(i, i + 1 + orta*k));
	}
    return ans;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:25:43: warning: declaration of 'll' shadows a global declaration [-Wshadow]
 ll delivery(int n, int kk, int ll, int p[]) {k = kk;l = ll;
                                           ^
boxes.cpp:16:19: note: shadowed declaration is here
 typedef long long ll;
                   ^~
boxes.cpp:35:7: warning: declaration of 'bas' shadows a global declaration [-Wshadow]
   int bas = 0, son = (n - i - 1)/n + 1;
       ^~~
boxes.cpp:19:20: note: shadowed declaration is here
 ll k, l, cvp, ans, bas[N], son[N];
                    ^~~
boxes.cpp:35:16: warning: declaration of 'son' shadows a global declaration [-Wshadow]
   int bas = 0, son = (n - i - 1)/n + 1;
                ^~~
boxes.cpp:19:28: note: shadowed declaration is here
 ll k, l, cvp, ans, bas[N], son[N];
                            ^~~
boxes.cpp:37:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
    if(ansver(i, i + 1 + orta*k) >= ansver(i, i + 1 + k + orta*k))
                 ~~~~~~^~~~~~~~
boxes.cpp:37:56: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
    if(ansver(i, i + 1 + orta*k) >= ansver(i, i + 1 + k + orta*k))
                                              ~~~~~~~~~~^~~~~~~~
boxes.cpp:51:34: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   ans = min(ans, ansver(i, i + 1 + orta*k));
                            ~~~~~~^~~~~~~~
boxes.cpp:31:6: warning: unused variable 'opt' [-Wunused-variable]
  int opt = 0;
      ^~~

Subtask #1
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 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 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 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 376 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.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 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 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 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 376 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 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 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 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 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 376 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

# 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 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 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 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 376 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 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 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 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 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 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 107 ms 20216 KB Output is correct
34 Correct 79 ms 21972 KB Output is correct
35 Correct 80 ms 22520 KB Output is correct
36 Correct 110 ms 29688 KB Output is correct
37 Correct 111 ms 29828 KB Output is correct
38 Correct 110 ms 29688 KB Output is correct
39 Correct 110 ms 28280 KB Output is correct
40 Correct 85 ms 23544 KB Output is correct
41 Correct 109 ms 29816 KB Output is correct
42 Correct 85 ms 23800 KB Output is correct

Subtask #6
0 / 30.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 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 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 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 376 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 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 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 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 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 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 107 ms 20216 KB Output is correct
34 Correct 79 ms 21972 KB Output is correct
35 Correct 80 ms 22520 KB Output is correct
36 Correct 110 ms 29688 KB Output is correct
37 Correct 111 ms 29828 KB Output is correct
38 Correct 110 ms 29688 KB Output is correct
39 Correct 110 ms 28280 KB Output is correct
40 Correct 85 ms 23544 KB Output is correct
41 Correct 109 ms 29816 KB Output is correct
42 Correct 85 ms 23800 KB Output is correct
43 Runtime error 489 ms 192176 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Halted 0 ms 0 KB -