Submission #256024

#TimeUsernameProblemLanguageResultExecution timeMemory
256024theStaticMindJob Scheduling (IOI19_job)C++14
19 / 100
122 ms9612 KiB
#include "job.h" #include<bits/stdc++.h> #define pb push_back #define ii pair<int,int> #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define INF 100000000000000000 #define modulo 1000000007 #define mod 998244353 #define int long long int using namespace std; int scheduling_cost(vector<int32_t> p, vector<int32_t> u, vector<int32_t> d){ int n = sz(p); int cost = 0, t = 0; for(int i = 0; i < n; i++) t += d[i]; vector<int> seq; for(int i = 1; i < n; i++) seq.pb(i); sort(all(seq), [&](int x, int y){return u[x] * d[y] < u[y] * d[x];}); seq.pb(0); for(auto x : seq){ cost += u[x] * t; t -= d[x]; } return cost; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...