Submission #253277

#	Time	Username	Problem	Language	Result	Execution time	Memory
253277		mode149256	Sails (IOI07_sails)	C++14	80 / 100	27 ms	2048 KiB

sails

/*input
6
3 2
5 3
4 1
2 1
4 3
3 2
*/
#include <bits/stdc++.h>
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;

ll add(ll a) {
	return a * (a - 1) / 2;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int N;
	cin >> N;

	vl kiek(MX, 0);
	vl pab(MX, 0);
	ll ats = 0;
	ll viso = 0;
	ll liko = 0;
	ll st = 0;
	for (int i = 0; i < N; ++i)
	{
		ll h, k;
		cin >> h >> k;
		viso += k;
		kiek[h]++;
		pab[h - k]++;
		st = max(st, h);
	}

	for (ll i = st; i >= 1; --i)
	{
		kiek[i] += kiek[i + 1];
		{
			ll stumsiu = min(pab[i], liko);
			liko -= stumsiu;
			pab[i - 1] += stumsiu;
			pab[i] -= stumsiu;
		}

		kiek[i] -= pab[i];

		ll desiu = min(kiek[i], viso / i);
		// printf("i = %d, kiek = %lld, desiu = %lld\n", i, kiek[i], desiu);
		// liko = kiek[i] - desiu;

		liko += kiek[i] - desiu;

		ats += add(desiu);
		viso -= desiu;
		// if (desiu < kiek[i]) {
		// 	ll did = viso % i;
		// 	ll maz = i - did;

		// 	ats += maz * add(desiu);
		// 	desiu++;
		// 	ats += did * add(desiu);
		// 	break;
		// } else {

		// }
	}

	printf("%lld\n", ats);
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10
• Subtask 11: 0 / 10