답안 #990951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990951	2024-05-31T20:54:54 Z	hasan2006	선물상자 (IOI15_boxes)	C++17	10 / 100	1 ms	4696 KB

boxes

#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , dp[N] , c[N] , d[N] ;
ll delivery(int n,int k,int l,int a[])
{

    for(int i = 1; i <= n; i++){
        b[i] = min(l , a[i - 1] * 2);
        if(i > k)
            b[i] += b[i - k];
    }
    ll ans =b[n];
    for(int i = n; i >= 1; i--){
        c[i] = min(l , (l - a[i - 1]) * 2);
        if(i + k < n)
            c[i] += c[i + k];
        ans= min(ans , b[i - 1] + c[i]);
    }
	return ans;
}

// Author : حسن

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:23:35: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   23 | ll delivery(int n,int k,int l,int a[])
      |                               ~~~~^~~
boxes.cpp:22:4: note: shadowed declaration is here
   22 | ll a[N] , b[N] , dp[N] , c[N] , d[N] ;
      |    ^

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Incorrect	1 ms	4444 KB	Output isn't correct
8	Halted	0 ms	0 KB	-