제출 #713243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713243		mseebacher	선물상자 (IOI15_boxes)	C++17	10 / 100	7 ms	308 KiB

boxes

//#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <functional>
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

#define mp make_pair
#define f first
#define s second
#define pb push_back

typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const lld pi = 3.14159265358979323846;

ll calc(int n,int k,int l,int pos[],int pref){
	ll cost = 0;
	int last = 0;
	// clockwise
	for(int i = 0;i<pref;i++){
		if((i+1)%k == 0){
			 cost += min(pos[i],l-pos[i]) + pos[i]-last;
			 last = 0;
		}
		else{
			cost += pos[i]-last;
			last = pos[i];
		}
		
	}
	if(pref%k!=0) cost += min(pos[pref-1],l-pos[pref-1]);
	last = l;
	//cout << cost << " "; 
	// counterclockwise
	for(int i = n-1;i>=pref;i--){
				
		if((i+1)%k == 0){
			cost += min(pos[i],l-pos[i])+last-pos[i];
			last = l;
		} 
		else{
			// auf addieren
			cost += last-pos[i];
			last = pos[i];
		}
		
	}
	
	if((n-pref)%k!=0) cost += min(pos[pref],l-pos[pref]);
	return cost;
}


ll delivery(int n,int k,int l,int pos[]){
	ll ans = 1e18;
	for(int i = 0;i<=n;i++){
		ans = min(ans,calc(n,k,l,pos,i));
	}
	return ans;
	
}

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