제출 #986820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986820		GrindMachine	Job Scheduling (IOI19_job)	C++17	100 / 100	212 ms	63104 KiB

job

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
some solutions

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "job.h"

struct S{
	ll asum,bsum,val;
	S(){
		asum = bsum = val = 0;
	}
	S(ll x, ll y){
		asum = x, bsum = y, val = x*y;
	}
	bool operator<(const S &other) const{
		return bsum*other.asum < other.bsum*asum;
	}
	bool operator>(const S &other) const{
		return bsum*other.asum > other.bsum*asum;
	}
	void merge(const S& other){
		val += other.val+bsum*other.asum;
		asum += other.asum;
		bsum += other.bsum;
	}
};

vector<ll> adj[N];
vector<ll> a,b;
priority_queue<S,vector<S>,greater<S>> pq[N];

void dfs1(ll u){
	trav(v,adj[u]){
		dfs1(v);
		if(sz(pq[u]) < sz(pq[v])){
			swap(pq[u],pq[v]);
		}
		
		while(!pq[v].empty()){
			pq[u].push(pq[v].top());
			pq[v].pop();
		}
	}

	S curr_group(a[u],b[u]);
	while(!pq[u].empty()){
		auto nxt_group = pq[u].top();
		if(curr_group < nxt_group) break;
		pq[u].pop();
		curr_group.merge(nxt_group);
	}

	pq[u].push(curr_group);
}

long long scheduling_cost(std::vector<int> p, std::vector<int> a_, std::vector<int> b_) {
	ll n = sz(p);
	rep1(i,n-1){
		adj[p[i]].pb(i);
	}
	a = vector<ll>(all(a_));
	b = vector<ll>(all(b_));

	dfs1(0);

	S curr_group(0,0);
	while(!pq[0].empty()){
		curr_group.merge(pq[0].top());
		pq[0].pop();
	}

	ll ans = curr_group.val;
	return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 37 / 37