Submission #986820

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
986820	2024-05-21T09:51:22 Z	GrindMachine	Job Scheduling (IOI19_job)	C++17	100 / 100	212 ms	63104 KB

#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.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	11356 KB	Output is correct
2	Correct	3 ms	11356 KB	Output is correct
3	Correct	2 ms	11356 KB	Output is correct
4	Correct	3 ms	11356 KB	Output is correct
5	Correct	23 ms	21852 KB	Output is correct
6	Correct	41 ms	32348 KB	Output is correct
7	Correct	68 ms	42868 KB	Output is correct
8	Correct	80 ms	53436 KB	Output is correct
9	Correct	81 ms	53600 KB	Output is correct
10	Correct	98 ms	53620 KB	Output is correct
11	Correct	2 ms	11356 KB	Output is correct
12	Correct	78 ms	53420 KB	Output is correct
13	Correct	73 ms	53436 KB	Output is correct
14	Correct	90 ms	56880 KB	Output is correct
15	Correct	77 ms	56924 KB	Output is correct
16	Correct	90 ms	56916 KB	Output is correct
17	Correct	102 ms	56660 KB	Output is correct
18	Correct	78 ms	56712 KB	Output is correct
19	Correct	90 ms	56660 KB	Output is correct
20	Correct	102 ms	63104 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	11356 KB	Output is correct
2	Correct	2 ms	11356 KB	Output is correct
3	Correct	3 ms	11356 KB	Output is correct
4	Correct	93 ms	31680 KB	Output is correct
5	Correct	104 ms	31676 KB	Output is correct
6	Correct	92 ms	31676 KB	Output is correct
7	Correct	94 ms	31752 KB	Output is correct
8	Correct	92 ms	31768 KB	Output is correct
9	Correct	92 ms	31676 KB	Output is correct
10	Correct	93 ms	31764 KB	Output is correct
11	Correct	90 ms	31676 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	11356 KB	Output is correct
2	Correct	2 ms	11356 KB	Output is correct
3	Correct	2 ms	11356 KB	Output is correct
4	Correct	3 ms	11356 KB	Output is correct
5	Correct	10 ms	12380 KB	Output is correct
6	Correct	96 ms	31608 KB	Output is correct
7	Correct	94 ms	31632 KB	Output is correct
8	Correct	96 ms	31772 KB	Output is correct
9	Correct	95 ms	31552 KB	Output is correct
10	Correct	3 ms	11356 KB	Output is correct
11	Correct	4 ms	11356 KB	Output is correct
12	Correct	8 ms	12380 KB	Output is correct
13	Correct	7 ms	12376 KB	Output is correct
14	Correct	94 ms	31760 KB	Output is correct
15	Correct	96 ms	31672 KB	Output is correct
16	Correct	99 ms	31572 KB	Output is correct
17	Correct	94 ms	31764 KB	Output is correct
18	Correct	94 ms	31764 KB	Output is correct
19	Correct	94 ms	31676 KB	Output is correct
20	Correct	95 ms	31760 KB	Output is correct
21	Correct	95 ms	31760 KB	Output is correct
22	Correct	95 ms	31604 KB	Output is correct
23	Correct	95 ms	31660 KB	Output is correct
24	Correct	94 ms	31524 KB	Output is correct

Subtask #4
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	11356 KB	Output is correct
2	Correct	71 ms	39504 KB	Output is correct
3	Correct	74 ms	39348 KB	Output is correct
4	Correct	74 ms	39340 KB	Output is correct

Subtask #5
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	11356 KB	Output is correct
2	Correct	2 ms	11356 KB	Output is correct
3	Correct	3 ms	11352 KB	Output is correct
4	Correct	3 ms	11356 KB	Output is correct
5	Correct	3 ms	11356 KB	Output is correct
6	Correct	3 ms	11356 KB	Output is correct
7	Correct	3 ms	11356 KB	Output is correct
8	Correct	2 ms	11356 KB	Output is correct
9	Correct	3 ms	11356 KB	Output is correct
10	Correct	2 ms	11356 KB	Output is correct
11	Correct	3 ms	11356 KB	Output is correct
12	Correct	2 ms	11356 KB	Output is correct
13	Correct	2 ms	11356 KB	Output is correct
14	Correct	3 ms	11356 KB	Output is correct
15	Correct	2 ms	11356 KB	Output is correct
16	Correct	2 ms	11356 KB	Output is correct
17	Correct	2 ms	11356 KB	Output is correct

Subtask #6
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	11356 KB	Output is correct
2	Correct	3 ms	11356 KB	Output is correct
3	Correct	2 ms	11356 KB	Output is correct
4	Correct	3 ms	11356 KB	Output is correct
5	Correct	23 ms	21852 KB	Output is correct
6	Correct	41 ms	32348 KB	Output is correct
7	Correct	68 ms	42868 KB	Output is correct
8	Correct	80 ms	53436 KB	Output is correct
9	Correct	81 ms	53600 KB	Output is correct
10	Correct	98 ms	53620 KB	Output is correct
11	Correct	2 ms	11356 KB	Output is correct
12	Correct	78 ms	53420 KB	Output is correct
13	Correct	73 ms	53436 KB	Output is correct
14	Correct	90 ms	56880 KB	Output is correct
15	Correct	77 ms	56924 KB	Output is correct
16	Correct	90 ms	56916 KB	Output is correct
17	Correct	102 ms	56660 KB	Output is correct
18	Correct	78 ms	56712 KB	Output is correct
19	Correct	90 ms	56660 KB	Output is correct
20	Correct	102 ms	63104 KB	Output is correct
21	Correct	2 ms	11356 KB	Output is correct
22	Correct	2 ms	11356 KB	Output is correct
23	Correct	3 ms	11356 KB	Output is correct
24	Correct	93 ms	31680 KB	Output is correct
25	Correct	104 ms	31676 KB	Output is correct
26	Correct	92 ms	31676 KB	Output is correct
27	Correct	94 ms	31752 KB	Output is correct
28	Correct	92 ms	31768 KB	Output is correct
29	Correct	92 ms	31676 KB	Output is correct
30	Correct	93 ms	31764 KB	Output is correct
31	Correct	90 ms	31676 KB	Output is correct
32	Correct	2 ms	11356 KB	Output is correct
33	Correct	2 ms	11356 KB	Output is correct
34	Correct	2 ms	11356 KB	Output is correct
35	Correct	3 ms	11356 KB	Output is correct
36	Correct	10 ms	12380 KB	Output is correct
37	Correct	96 ms	31608 KB	Output is correct
38	Correct	94 ms	31632 KB	Output is correct
39	Correct	96 ms	31772 KB	Output is correct
40	Correct	95 ms	31552 KB	Output is correct
41	Correct	3 ms	11356 KB	Output is correct
42	Correct	4 ms	11356 KB	Output is correct
43	Correct	8 ms	12380 KB	Output is correct
44	Correct	7 ms	12376 KB	Output is correct
45	Correct	94 ms	31760 KB	Output is correct
46	Correct	96 ms	31672 KB	Output is correct
47	Correct	99 ms	31572 KB	Output is correct
48	Correct	94 ms	31764 KB	Output is correct
49	Correct	94 ms	31764 KB	Output is correct
50	Correct	94 ms	31676 KB	Output is correct
51	Correct	95 ms	31760 KB	Output is correct
52	Correct	95 ms	31760 KB	Output is correct
53	Correct	95 ms	31604 KB	Output is correct
54	Correct	95 ms	31660 KB	Output is correct
55	Correct	94 ms	31524 KB	Output is correct
56	Correct	2 ms	11356 KB	Output is correct
57	Correct	71 ms	39504 KB	Output is correct
58	Correct	74 ms	39348 KB	Output is correct
59	Correct	74 ms	39340 KB	Output is correct
60	Correct	3 ms	11356 KB	Output is correct
61	Correct	2 ms	11356 KB	Output is correct
62	Correct	3 ms	11352 KB	Output is correct
63	Correct	3 ms	11356 KB	Output is correct
64	Correct	3 ms	11356 KB	Output is correct
65	Correct	3 ms	11356 KB	Output is correct
66	Correct	3 ms	11356 KB	Output is correct
67	Correct	2 ms	11356 KB	Output is correct
68	Correct	3 ms	11356 KB	Output is correct
69	Correct	2 ms	11356 KB	Output is correct
70	Correct	3 ms	11356 KB	Output is correct
71	Correct	2 ms	11356 KB	Output is correct
72	Correct	2 ms	11356 KB	Output is correct
73	Correct	3 ms	11356 KB	Output is correct
74	Correct	2 ms	11356 KB	Output is correct
75	Correct	2 ms	11356 KB	Output is correct
76	Correct	2 ms	11356 KB	Output is correct
77	Correct	3 ms	11552 KB	Output is correct
78	Correct	2 ms	11352 KB	Output is correct
79	Correct	3 ms	11400 KB	Output is correct
80	Correct	3 ms	11396 KB	Output is correct
81	Correct	3 ms	11356 KB	Output is correct
82	Correct	2 ms	11356 KB	Output is correct
83	Correct	2 ms	11356 KB	Output is correct
84	Correct	2 ms	11356 KB	Output is correct
85	Correct	3 ms	11356 KB	Output is correct
86	Correct	3 ms	11356 KB	Output is correct
87	Correct	3 ms	11356 KB	Output is correct
88	Correct	6 ms	12124 KB	Output is correct
89	Correct	7 ms	12388 KB	Output is correct
90	Correct	8 ms	12892 KB	Output is correct
91	Correct	33 ms	19096 KB	Output is correct
92	Correct	67 ms	27144 KB	Output is correct
93	Correct	155 ms	43520 KB	Output is correct
94	Correct	176 ms	44120 KB	Output is correct
95	Correct	154 ms	43716 KB	Output is correct
96	Correct	157 ms	43592 KB	Output is correct
97	Correct	160 ms	44292 KB	Output is correct
98	Correct	188 ms	46292 KB	Output is correct
99	Correct	171 ms	48020 KB	Output is correct
100	Correct	163 ms	44032 KB	Output is correct
101	Correct	164 ms	40392 KB	Output is correct
102	Correct	212 ms	55804 KB	Output is correct
103	Correct	139 ms	38580 KB	Output is correct
104	Correct	123 ms	36092 KB	Output is correct
105	Correct	99 ms	34568 KB	Output is correct
106	Correct	126 ms	40188 KB	Output is correct

Submission #986820

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 12.0 / 12.0

Subtask #4 18.0 / 18.0

Subtask #5 21.0 / 21.0

Subtask #6 37.0 / 37.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
12.0 / 12.0

Subtask #4
18.0 / 18.0

Subtask #5
21.0 / 21.0

Subtask #6
37.0 / 37.0