oj.uz

답안 #316760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316760 2020-10-27T22:33:39 Z MetB Job Scheduling (IOI19_job) C++14
5 / 100
 254 ms 18908 KB 
#include "job.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace __gnu_pbds;
 
#define N 2000001
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
 
const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3;

int merged[N], dsu[N], n, dl[N];
ll ans;

struct rat {
	ll u, d;

	rat (ll u, ll d) : u (u), d (d) {}
	rat () {}

	bool operator < (const rat& b) const {
		return b.u * d > u * b.d;
	}

	bool operator != (const rat& b) const {
		return tie (u, d) != tie (b.u, b.d);
	}
} a[N];

int find (int x) {
	if (dsu[x] == x) return x;
	return dsu[x] = find (dsu[x]);
}

void unite (int a, int b) {
	a = find (a), b = find (b);
	if (a == b) return;
	dsu[b] = a;
	merged[b] = 1;
}

ll scheduling_cost (vector <int> p, vector <int> u, vector <int> d) {
	int n = p.size ();
	
	p.resize (n);
	u.resize (n);
	d.resize (n);
	
	priority_queue < pair <rat, int> > q;

	for (int i = 0; i < n; i++) {
		p[i] = i - 1;
		a[i] = {u[i], d[i]};
		dsu[i] = i;
		q.push ({a[i], i});
	}

	ll t = 0;

	while (!q.empty ()) {
		ll x = q.top ().second;
		rat cost = q.top ().first;
		q.pop ();
		if (a[x] != cost || merged[x] || dl[x]) continue;

		if (p[x] == -1 || dl[find (p[x])]) {
			ans += (d[x] + t) * u[x];
			dl[x] = 1;
			t += d[x];
			continue;
		}
		int desc = find (p[x]);
		ans -= (ll) d[x] * u[desc];
		u[desc] += u[x];
		d[desc] += d[x];
		a[desc] = {u[desc], d[desc]};
		unite (desc, x);

		q.push ({a[desc], desc});
	}

	return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 46 ms 4844 KB Output is correct
6 Correct 108 ms 9192 KB Output is correct
7 Correct 174 ms 15208 KB Output is correct
8 Correct 248 ms 17764 KB Output is correct
9 Correct 251 ms 17812 KB Output is correct
10 Correct 254 ms 17816 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 240 ms 17816 KB Output is correct
13 Correct 188 ms 17884 KB Output is correct
14 Correct 207 ms 18440 KB Output is correct
15 Correct 160 ms 17756 KB Output is correct
16 Correct 183 ms 18908 KB Output is correct
17 Correct 250 ms 17800 KB Output is correct
18 Correct 253 ms 17884 KB Output is correct
19 Correct 148 ms 17760 KB Output is correct
20 Correct 129 ms 18528 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 46 ms 4844 KB Output is correct
6 Correct 108 ms 9192 KB Output is correct
7 Correct 174 ms 15208 KB Output is correct
8 Correct 248 ms 17764 KB Output is correct
9 Correct 251 ms 17812 KB Output is correct
10 Correct 254 ms 17816 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 240 ms 17816 KB Output is correct
13 Correct 188 ms 17884 KB Output is correct
14 Correct 207 ms 18440 KB Output is correct
15 Correct 160 ms 17756 KB Output is correct
16 Correct 183 ms 18908 KB Output is correct
17 Correct 250 ms 17800 KB Output is correct
18 Correct 253 ms 17884 KB Output is correct
19 Correct 148 ms 17760 KB Output is correct
20 Correct 129 ms 18528 KB Output is correct
21 Incorrect 1 ms 384 KB Output isn't correct
22 Halted 0 ms 0 KB -