제출 #820080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
820080		tolbi	선물상자 (IOI15_boxes)	C++17	100 / 100	659 ms	450456 KiB

boxes

#pragma optimize("Bismillahirrahmanirrahim");
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream& operator>>(istream& is, vector<T> &v){for (auto &it : v) is>>it;return is;}
template<typename T, size_t Y> istream& operator>>(istream& is, array<T,Y> &v){for (auto &it : v) is>>it;return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename T, size_t Y> ostream& operator<<(ostream& os, array<T,Y> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is<<pr.first<<" "<<pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> &pr){return os>>pr.first>>pr.second;}
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> x
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define endl '\n'
#define tol(bi) (1LL<<((int)(bi)))
typedef long long ll;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "boxes.h"

long long delivery(int n, int k, int l, int _arr[]) {
	vector<ll> arr1;
	vector<ll> arr2;
	for (int i = 0; i < n; ++i)
	{
		if (_arr[i]>0){
			arr1.push_back(_arr[i]);	
		}
		if (_arr[n-i-1]>0){
			arr2.push_back(l-_arr[n-i-1]);
		}
	}
	n=arr1.size();
	if (n==0) return 0;
	vector<ll> dp1(n,0);
	vector<ll> dp2(n,0);
	for (int i = 0; i < n; i++){
		if (i<k){
			dp1[i]=arr1[i]+min(arr1[i],l-arr1[i]);
		}
		else {
			dp1[i]=dp1[i-k]+arr1[i]+min(arr1[i],l-arr1[i]);
		}
	}
	swap(arr1,arr2);
	for (int i = 0; i < n; i++){
		if (i<k){
			dp2[i]=arr1[i]+min(arr1[i],l-arr1[i]);
		}
		else {
			dp2[i]=dp2[i-k]+arr1[i]+min(arr1[i],l-arr1[i]);
		}
	}
	swap(arr1,arr2);
	ll ans = min(dp1[n-1],dp2[n-1]);
	for (int i = 0; i < n-1; i++){
		int a = i;
		int b = n-2-i;
		ll crr=dp1[a]+dp2[b];
		ans=min(ans,crr);
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim");
      | 
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:47:13: warning: conversion from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   47 |  n=arr1.size();
      |    ~~~~~~~~~^~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30