oj.uz

Submission #134798

# Submission time Handle Problem Language Result Execution time Memory
134798 2019-07-23T09:29:54 Z tinjyu Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 4 ms 380 KB 
#include "boxes.h"
#include <iostream>
long long int n,k,l,sum[10000005][2];
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
    
    n=N;
    k=K;
    l=L;
	int mid=n;
    for(int i=0;i<n;i++)
    {
        if(l/2<p[i])
        {
            mid=i;
            break;
        }
    }
    long long tmp=0;
	for(int i=0;i<mid;i++)
	{
		sum[i][0]=tmp+p[i];
		if((i+1)%k==0)tmp+=p[i];
		//cout<<sum[i][0]<<" "<<tmp<<endl;
	}
	tmp=0;
	for(int i=n-1;i>=mid;i--)
	{
		sum[i][1]=tmp+(l-p[i]);
		if((n-i)%k==0)tmp+=(l-p[i]); 
	}
    long long int ans=sum[mid-1][0]*2+sum[mid][1]*2;
    //cout<<sum[mid-1][0]<<" "<<sum[mid][1]<<endl;
    for(int i=mid-1;i>=mid-k && i>=-1;i--)
    {
        if(i>=0)tmp=sum[i][0]*2;
        if(i+k+1<n)tmp+=sum[i+k+1][1]*2;
        //cout<<i<<" "<<sum[i][0]<<" "<<i+k+1<<" "<<sum[i+k+1][1]<<endl;
        tmp+=l;
        ans=min(tmp,ans);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:10:10: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  int mid=n;
          ^
boxes.cpp:27:13: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  for(int i=n-1;i>=mid;i--)
            ~^~

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 380 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 380 KB Output is correct

Subtask #2
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 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 4 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 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 380 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 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 380 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 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 380 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -