제출 #906317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906317		vjudge1	Job Scheduling (IOI19_job)	C++17	5 / 100	66 ms	5200 KiB

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[a])<(d[b]*u[b]);
		});
		// 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 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 37