# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104713 | Thunnus | Job Scheduling (CEOI12_jobs) | C++17 | 194 ms | 42312 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int i64
#define vb vector<bool>
#define vi vector<int>
#define vvi vector<vi>
#define fi first
#define se second
#define pii pair<int, int>
#define sz(x) (int)(x).size()
signed main(){
//ios_base::sync_with_stdio(false); cin.tie(0);
int n, d, m;
cin >> n >> d >> m;
vector<pii> job(m);
vvi d2i(n + 1);
for(int i = 0; i < m; i++){
cin >> job[i].fi;
job[i].se;
d2i[job[i].fi].emplace_back(i);
}
//sort(job.begin(), job.end());
auto check = [&](int val) -> bool {
deque<pii> dq;
for(int day = 1; day <= n; day++){
int temp = val;
while(!dq.empty() && temp){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |