Submission #771110

#	Time	Username	Problem	Language	Result	Execution time	Memory
771110		Ludissey	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	212 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;

int L;

int leftDist(int s, int t) { return t-s; }

int rightDist(int s, int t) { return s+(L - t); }

int dist(int s, int t) { return min(leftDist(s,t), rightDist(s, t)); }

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

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