Submission #372375

#	Time	Username	Problem	Language	Result	Execution time	Memory
372375		arwaeystoamneg	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	364 KiB

boxes

#include "boxes.h"


/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
//const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "ioi")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
const int MAX = 100;
int n, k, L;
vi a;
ll sub1()
{
	ll ans = 0;
	trav(x, a)
	{
		ans += min(x, L - x);
	}
	ans *= 2;
	int best = 0;
	trav(x, a)best = max(best, min(x, L - x));
	ans -= best;
	return ans;
}
ll sub2()
{
	int ans = inf;
	ans = min(ans, L - a[0]);
	ans = min(ans, a[n - 1]);
	F0R(i, n - 1)
	{
		ans = min(ans, L - a[i + 1] + a[i] + a[i]);
	}
	return ans;
}
ll delivery(int A, int b, int c, int* d)
{
	n = A, k = b, L = c;
	a.rsz(n);
	F0R(i, n)a[i] = d[i];
	sort(all(a));
	if (n <= 1000)
	{
		if (k == 1)
		{
			return sub1();
		}
		else if (k == n)
		{
			return sub2();
		}

	}
	return -1123089;
}

Compilation message (stderr)

boxes.cpp: In function 'void setIO(std::string)':
boxes.cpp:56:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   56 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:58:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   58 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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