제출 #1275738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275738		efeg	Sails (IOI07_sails)	C++20	40 / 100	1096 ms	4192 KiB

sails

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,fma")

#define int long long 
#define F first
#define S second 
#define pb push_back
#define endl '\n'
#define all(v) v.begin(),v.end()
#define gcd(a,b) __gcd(a,b)
#define mt make_tuple
#define pqueue priority_queue


typedef pair<int,int> ii;
typedef tuple<int,int,int> iii;
typedef tuple<int,int,int,int> iiii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<iii> viii;
typedef set<int> si;
typedef vector<ii> vii;				
typedef vector<vi> vvi;
typedef vector<si> vsi;
typedef vector<vb> vvb;
typedef vector<vc> vvc;

const int MOD = 998244353; 
const int N = 1e6 + 100; 

int n; 
vii mast; 

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	
	cin >> n;
	mast.assign(n,{});  
	for (int i = 0; i < n; i++) cin >> mast[i].F >> mast[i].S; 
	sort(all(mast));

	pqueue<int,vi,greater<int>> pq; 
	int ans = 0; 

	for (int i = 0; i < n; i++){
		while (pq.size() < mast[i].F) pq.push(0);

		vi tmp;  
		for (int j = 0; j < mast[i].S; j++){
			tmp.pb(pq.top()); 
			pq.pop(); 
		}

		for (int j = 0; j < mast[i].S; j++){
			pq.push(tmp[j] + 1); 
		} 
	}

	while (!pq.empty()) {
		ans += pq.top() * (pq.top() - 1) / 2; 
		pq.pop(); 		
	}
	cout << ans << endl; 
	return 0;
}	

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 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