oj.uz

Submission #140008

# Submission time Handle Problem Language Result Execution time Memory
140008 2019-08-01T20:33:28 Z babo Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 807 ms 276088 KB 
#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

static long long sum1[10000010];
static long long sum2[10000010];
static long long gonext[10000010];
long long delivery(int N, int K, int L, int p[]) {
	long long i;
	long long ans=1000000000000000000ll;
	for(i=0;i<N;i++)
	{
		gonext[i]=i;
		sum1[i]=p[i]*2;
		if(i>=K)
			sum1[i]+=sum1[i-K];
	}
	for(i=N-1;i>=0;i--)
	{
		sum2[i]=(L-p[i])*2;
		if(i+K<=N-1)
			sum2[i]+=sum2[i+K];
	}
	for(i=0;i<N;i++)
	{
		if(p[i]>L/2) break;
	}
	if(i==N)
	{
		return sum1[N-1];
	}
	int las=i-1;
	for(i=0;i<=las;i++)
	{
		gonext[las-i]=las+1+((K-i-1)%K+K)%K;
	}
	/*for(i=0;i<N;i++)
		printf("%lld ",gonext[i]);
	puts("");*/
	long long temp=L*gonext[0]/K;
	if(gonext[0]<N)
		temp+=sum2[gonext[0]];
	ans=min(ans,temp);
	i=-1;
	//printf("%lld %lld %lld %lld %lld\n",i,0,L*(gonext[i+1]-(i+1))/K,gonext[i+1]<N?sum2[gonext[i+1]]:-1,temp);
	
	for(i=0;i<N&&p[i]<=L/2;i++)
	{
		long long temp=sum1[i]+L*(gonext[i+1]-(i+1))/K;
		if(gonext[i+1]<N)
			temp+=sum2[gonext[i+1]];
		//printf("%lld %lld %lld %lld %lld\n",i,sum1[i],L*(gonext[i+1]-(i+1))/K,gonext[i+1]<N?sum2[gonext[i+1]]:-1,temp);
		ans=min(ans,temp);
	}	
    return ans;
}
/*
#include "boxes.h"
#include <stdio.h>
#include <stdlib.h>

static char _buffer[1024];
static int _currentChar = 0;
static int _charsNumber = 0;
static FILE *_inputFile, *_outputFile;

static inline int _read() {
    if (_charsNumber < 0) {
        exit(1);
    }
    if (!_charsNumber || _currentChar == _charsNumber) {
        _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
        _currentChar = 0;
    }
    if (_charsNumber <= 0) {
        return -1;
    }
    return _buffer[_currentChar++];
}

static inline int _readInt() {
    int c, x, s;
    c = _read();
    while (c <= 32) c = _read();
    x = 0;
    s = 1;
    if (c == '-') {
        s = -1;
        c = _read();
    }
    while (c > 32) {
        x *= 10;
        x += c - '0';
        c = _read();
    }
    if (s < 0) x = -x;
    return x;
}

int main() {
	_inputFile = fopen("boxes.in", "rb");
	_outputFile = fopen("boxes.out", "w");

    int N, K, L, i;
    N = _readInt();
    K = _readInt();
    L = _readInt();

    int *p = (int*)malloc(sizeof(int) * (unsigned int)N);

    for (i = 0; i < N; i++) {
        p[i] = _readInt();
    }

    fprintf(_outputFile, "%lld\n", delivery(N, K, L, p));
    return 0;
}*/

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:33:11: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  int las=i-1;
          ~^~
boxes.cpp:50:13: warning: declaration of 'temp' shadows a previous local [-Wshadow]
   long long temp=sum1[i]+L*(gonext[i+1]-(i+1))/K;
             ^~~~
boxes.cpp:41:12: note: shadowed declaration is here
  long long temp=L*gonext[0]/K;
            ^~~~

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 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

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 376 KB Output is correct
17 Correct 2 ms 376 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 376 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 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 320 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 376 KB Output is correct
17 Correct 2 ms 376 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 376 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 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 320 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 83 ms 28664 KB Output is correct
34 Correct 56 ms 28760 KB Output is correct
35 Correct 57 ms 28792 KB Output is correct
36 Correct 63 ms 28664 KB Output is correct
37 Correct 70 ms 28664 KB Output is correct
38 Correct 96 ms 28636 KB Output is correct
39 Correct 78 ms 28764 KB Output is correct
40 Correct 59 ms 28764 KB Output is correct
41 Correct 64 ms 28664 KB Output is correct
42 Correct 41 ms 28792 KB Output is correct

Subtask #6
30.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 376 KB Output is correct
17 Correct 2 ms 376 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 376 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 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 320 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 83 ms 28664 KB Output is correct
34 Correct 56 ms 28760 KB Output is correct
35 Correct 57 ms 28792 KB Output is correct
36 Correct 63 ms 28664 KB Output is correct
37 Correct 70 ms 28664 KB Output is correct
38 Correct 96 ms 28636 KB Output is correct
39 Correct 78 ms 28764 KB Output is correct
40 Correct 59 ms 28764 KB Output is correct
41 Correct 64 ms 28664 KB Output is correct
42 Correct 41 ms 28792 KB Output is correct
43 Correct 807 ms 275088 KB Output is correct
44 Correct 547 ms 276088 KB Output is correct
45 Correct 539 ms 275192 KB Output is correct
46 Correct 619 ms 275176 KB Output is correct
47 Correct 684 ms 275064 KB Output is correct
48 Correct 651 ms 274976 KB Output is correct
49 Correct 749 ms 274320 KB Output is correct
50 Correct 573 ms 275028 KB Output is correct
51 Correct 613 ms 274768 KB Output is correct
52 Correct 387 ms 274680 KB Output is correct