oj.uz

답안 #419341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419341 2021-06-07T01:29:12 Z freshmintt Job Scheduling (CEOI12_jobs) C++14
0 / 100
 277 ms 27932 KB 
#include<bits/stdc++.h>
#define MAXN 200005 //change. SET A SPACIOUS MAXN WHEN TESTING SO YOU DONT MESS UP WITH GARBAGE VALS OR SHIT
using namespace std;
typedef pair<long long,long long> pi;
typedef long long ll;
typedef long double ld;
ll N, D, M;

#define FIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
vector<ll> jobs;
vector<pi> jobs_save;
ll days[MAXN];
vector<ll> plan[MAXN];

bool make_plan(ll machs) {

  fill(days, days+MAXN, 0);

  for (int i=0; i < N; i++) {
    ll machID = i % machs;

    days[machID] = max(days[machID]+1, jobs_save[i].first); // ++ vs +1, obstructs with comparison.
    plan[days[machID]-1].push_back(jobs_save[i].second+1);
  }
  return true;
}

bool works(ll machs) {

  fill(days, days+MAXN, 0);

  for (int i=0; i < N; i++) {
    ll machID = i % machs;
    // cout << machID << " ";

    days[machID] = max(days[machID]+1, jobs[i]); // ++ vs +1, obstructs with comparison.
    if ((days[machID] - jobs[i]) > D){
      return false;
    }
  }
  return true;
}

int main() { 
  FIO;
  cin >> N >> D >> M;

  
  for (int i = 0; i < M; i ++) {
    ll a; cin >> a; jobs.push_back(a); jobs_save.push_back({a,i});
  }

  sort(jobs.begin(), jobs.end());
  sort(jobs_save.begin(), jobs_save.end());

  ll a = 1; ll b = 1E9; ll mid;
  while (a != b) {
    mid = (a+b)/2;
    // cout << a << " and " << mid << " and " << b<< endl;

    if (works(mid)) {
      b = mid;
    }
    else {
      a = mid + 1;
    }
  }

  cout << "1";
  return 0;

  cout << a << endl;

  make_plan(a);
  for (ll i = 0; i < N; i++) {
    for (auto i : plan[i]) {
      cout << i << " ";
    }
    cout << "0" << endl;

  }
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 9140 KB Output isn't correct
2 Incorrect 21 ms 9144 KB Output isn't correct
3 Incorrect 21 ms 9148 KB Output isn't correct
4 Incorrect 21 ms 9132 KB Output isn't correct
5 Incorrect 22 ms 9048 KB Output isn't correct
6 Incorrect 24 ms 9140 KB Output isn't correct
7 Incorrect 24 ms 9092 KB Output isn't correct
8 Incorrect 22 ms 9144 KB Output isn't correct
9 Incorrect 43 ms 9136 KB Output isn't correct
10 Incorrect 48 ms 9148 KB Output isn't correct
11 Incorrect 33 ms 9128 KB Output isn't correct
12 Incorrect 60 ms 11600 KB Output isn't correct
13 Incorrect 90 ms 15452 KB Output isn't correct
14 Incorrect 130 ms 16128 KB Output isn't correct
15 Incorrect 146 ms 18520 KB Output isn't correct
16 Incorrect 217 ms 25732 KB Output isn't correct
17 Incorrect 222 ms 25716 KB Output isn't correct
18 Incorrect 234 ms 25732 KB Output isn't correct
19 Incorrect 277 ms 27932 KB Output isn't correct
20 Incorrect 224 ms 25856 KB Output isn't correct