oj.uz

답안 #473869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473869 2021-09-16T10:55:39 Z Killer2501 Job Scheduling (IOI19_job) C++14
19 / 100
 278 ms 20936 KB 
#include "job.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pld pair<ld, ll>
#define fi first
#define se second
using namespace std;
const int N = 4e5+5;
const int M = 205;
const ll mod = 1e9+7;
const ld base = 1e-7;
ll n, m, k, ans, lab[N], cost[N], tim[N], id[N], par[N], t;
ld d[N];
struct node
{
	bool operator ()(ll x, ll y) const
	{
		if(cost[x] * tim[y] == cost[y] * tim[x])return x < y;
		cost[x] * tim[y] > cost[y] * tim[x];
	}
};
ll findp(ll u)
{
	return lab[u] < 0 ? u : lab[u] = findp(lab[u]);
}
priority_queue<pld> pq;
ll scheduling_cost(vector<int> p, vector<int> c, vector<int> di)
{
	n = p.size();
	fill_n(lab, n+1, -1);
	for(int i = 1; i <= n; i ++)
	{
		par[i] = p[i-1]+1;
		cost[i] = c[i-1];
		tim[i] = di[i-1];
		d[i] = 100000.0 * cost[i] / tim[i];
		pq.push({d[i], i});
		//cout << cost[i]  <<" "<<tim[i]<<" ";
	}
	while(!pq.empty())
	{
		pld u = pq.top();
		pq.pop();
		if(abs(d[u.se]-u.fi) > base)continue;
		//cout << (ld)u.fi <<" ";
		if(!par[u.se] || d[findp(par[u.se])] == -1)
		{
 
			t += tim[u.se];
			ans += t * cost[u.se];
			d[u.se] = -1;
		}
		else
		{
			ll v = findp(par[u.se]);
			ans -= cost[v] * tim[u.se];
			cost[v] += cost[u.se];
			tim[v] += tim[u.se];
			lab[u.se] = v;
			d[v] = 1.0 * cost[v] / tim[v];
			pq.push({d[v], v});
		}
 
	}
	return ans;
}

Compilation message

job.cpp: In member function 'bool node::operator()(long long int, long long int) const':
job.cpp:22:20: warning: statement has no effect [-Wunused-value]
   22 |   cost[x] * tim[y] > cost[y] * tim[x];
      |   ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 56 ms 5460 KB Output is correct
6 Correct 131 ms 10664 KB Output is correct
7 Incorrect 202 ms 18480 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 266 ms 20900 KB Output is correct
5 Correct 260 ms 20776 KB Output is correct
6 Correct 261 ms 20788 KB Output is correct
7 Correct 253 ms 20828 KB Output is correct
8 Correct 273 ms 20768 KB Output is correct
9 Correct 262 ms 20776 KB Output is correct
10 Correct 263 ms 20828 KB Output is correct
11 Correct 267 ms 20800 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Correct 9 ms 1608 KB Output is correct
6 Correct 262 ms 20780 KB Output is correct
7 Correct 269 ms 20780 KB Output is correct
8 Correct 274 ms 20832 KB Output is correct
9 Correct 278 ms 20828 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 8 ms 1480 KB Output is correct
13 Correct 10 ms 1608 KB Output is correct
14 Correct 271 ms 20936 KB Output is correct
15 Correct 268 ms 20776 KB Output is correct
16 Correct 253 ms 20824 KB Output is correct
17 Correct 259 ms 20768 KB Output is correct
18 Correct 172 ms 20780 KB Output is correct
19 Correct 253 ms 20780 KB Output is correct
20 Correct 269 ms 20776 KB Output is correct
21 Correct 276 ms 20756 KB Output is correct
22 Correct 259 ms 20828 KB Output is correct
23 Correct 260 ms 20772 KB Output is correct
24 Correct 263 ms 20772 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 56 ms 5460 KB Output is correct
6 Correct 131 ms 10664 KB Output is correct
7 Incorrect 202 ms 18480 KB Output isn't correct
8 Halted 0 ms 0 KB -