oj.uz

답안 #134772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134772 2019-07-23T09:07:41 Z tinjyu 선물상자 (IOI15_boxes) C++14
10 / 100
 2 ms 376 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++)
    {
        if(i%k==0)tmp+=p[i];
        //cout<<tmp<<" "; 
        sum[i][0]=tmp;
    }
    //cout<<endl;
    tmp=0;
    for(int i=n-1;i>=mid;i--)
    {
        if((n-1-i)%k==0)tmp+=(l-p[i]);
        //cout<<tmp<<endl;
        sum[i][1]=tmp;
    }
    long long int ans=sum[mid-1][0]*2+sum[mid][1]*2;
    for(int i=mid-1;i>=mid-k && i>=0;i--)
    {
        tmp=sum[i][0]*2;
        if(i+k<n)tmp+=sum[i+k][1]*2;
        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:28:16: 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

# 결과 실행 시간 메모리 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -