답안 #906319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906319	2024-01-14T01:07:13 Z	vjudge1	Job Scheduling (IOI19_job)	C++17	5 / 100	57 ms	5200 KB

job

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

long long scheduling_cost(std::vector<int> p, std::vector<int> u, std::vector<int> d) {
	int n = sz(p);
	bool g1=true;
	bool g2=true;
	rep(i,1,n){
		if(p[i]!=i-1)g1=false;
		if(p[i]!=0)g2=false;
	}
	ll score = 0;
	if(g1){
		ll time = 0;
		rep(i,0,n){
			time += d[i];
			score += time*u[i];
		}
	}else if(g2){
		ll total = 0;
		rep(i,0,n) total += u[i];
		score += d[0]*total;
		total -= u[0];
		vi inds(n-1);iota(all(inds),1);
		sort(all(inds), [&](int a, int b){
			return (d[a]*u[b])<(d[b]*d[a]);
		});
		// cout<<score<<endl;
		rep(i,0,n-1){
			int j = inds[i];
			score += total * d[j];
			// cout<<score<<endl;
			total -= u[j];
		}
	}else{
		assert(false);
	}
	return score;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	756 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	11 ms	1372 KB	Output is correct
6	Correct	22 ms	2640 KB	Output is correct
7	Correct	33 ms	3916 KB	Output is correct
8	Correct	43 ms	5076 KB	Output is correct
9	Correct	44 ms	4956 KB	Output is correct
10	Correct	51 ms	5080 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	57 ms	5084 KB	Output is correct
13	Correct	44 ms	4948 KB	Output is correct
14	Correct	44 ms	4948 KB	Output is correct
15	Correct	43 ms	4944 KB	Output is correct
16	Correct	44 ms	4956 KB	Output is correct
17	Correct	44 ms	4944 KB	Output is correct
18	Correct	45 ms	4948 KB	Output is correct
19	Correct	48 ms	5200 KB	Output is correct
20	Correct	44 ms	5160 KB	Output is correct

Subtask #2

0 / 7.0

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

Subtask #3

0 / 12.0

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

Subtask #4

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	1 ms	600 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	2 ms	348 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	756 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	11 ms	1372 KB	Output is correct
6	Correct	22 ms	2640 KB	Output is correct
7	Correct	33 ms	3916 KB	Output is correct
8	Correct	43 ms	5076 KB	Output is correct
9	Correct	44 ms	4956 KB	Output is correct
10	Correct	51 ms	5080 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	57 ms	5084 KB	Output is correct
13	Correct	44 ms	4948 KB	Output is correct
14	Correct	44 ms	4948 KB	Output is correct
15	Correct	43 ms	4944 KB	Output is correct
16	Correct	44 ms	4956 KB	Output is correct
17	Correct	44 ms	4944 KB	Output is correct
18	Correct	45 ms	4948 KB	Output is correct
19	Correct	48 ms	5200 KB	Output is correct
20	Correct	44 ms	5160 KB	Output is correct
21	Incorrect	1 ms	348 KB	Output isn't correct
22	Halted	0 ms	0 KB	-