Submission #771142

#	Time	Username	Problem	Language	Result	Execution time	Memory
771142		Ludissey	선물상자 (IOI15_boxes)	C++14	20 / 100	1 ms	304 KiB

boxes

#include "boxes.h"
#include <stdio.h>
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <vector>
#include <fstream>
#include <bitset>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <stack>
#include <cassert>
#include <cstdio>
#include <queue>
#include <iterator>
#include <iomanip>
#include <algorithm>
#include <sstream>

using namespace std;


long long delivery(int N, int K, int L, int p[]) {
	long long sum = 0;
	if(K==1) {
		for (int i = 0; i < N; i++)
		{
			sum += min(p[i], L-p[i])*2;
		}
	}else{
		int c = 0;
		int lastdist = 0;
		bool ldir=true;
		while (c < N) {
			if (min(L,p[c]*2)> (lastdist+(L-p[c]))*2) {
				ldir = false;
				sum = (lastdist + (L - p[c])) * 2;
				break;
			}
			else lastdist = p[c];
			c++;
		}
		if (ldir) {
			if (lastdist < L / 2) sum = lastdist * 2;
			else sum = L;
		}
	}
	return sum;
}

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