제출 #835106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
835106		mat_jur	Sails (IOI07_sails)	C++14	15 / 100	83 ms	65536 KiB

sails

#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
auto&operator<<(auto &o, pair<auto, auto> p) {o << "(" << p.first << ", " << p.second << ")"; return o;}
auto operator<<(auto &o, auto x)->decltype(x.end(), o) {o<<"{"; for(auto e : x) o<<e<<", "; return o<<"}";}
#define debug(X) cerr << "["#X"]: " << X << '\n';
#else 
#define debug(X) ;
#endif
#define ll long long
#define all(v) (v).begin(), (v).end()

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

	int n;
	cin >> n;
	vector<int> h(n), k(n);
	ll s = 0;
	int mxH = 0;
	for (int i = 0; i < n; i++) {
		cin >> h[i] >> k[i];
		mxH = max(mxH, h[i]);
		s += k[i];
	}
	vector<int> cnt(n);
	vector<queue<int>> q(mxH);
	for (int i = n-1; i >= 0; i--) {
		for (int j = 0; j < h[i]; j++) q[j].push(i);	
	}
	ll res = 0;
	int x = 0;
	while(s > 0) {
		for (int i = mxH-1; i >= 0; i--) {
			while(!q[i].empty() && cnt[q[i].front()] >= k[q[i].front()]) q[i].pop();
			if (q[i].empty()) continue;
			cnt[q[i].front()]++;
			res += x;
			q[i].pop();
			s--;
		}
		x++;
	}
	cout << res << '\n';

	return 0;
}

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