제출 #384255

#제출 시각아이디문제언어결과실행 시간메모리
384255MalachiNJob Scheduling (CEOI12_jobs)C++14
100 / 100
621 ms17132 KiB
#include <iostream> #include <fstream> #include <algorithm> #include <vector> using namespace std; int N, D, M; int jobs[1000001]; vector<int> byngggumb[100001]; bool test(int x){ int tracker = 0; for (int n = 1; n <= N; n++){ int itter = tracker; for (int c = itter; c < itter+x; c++){ if (tracker < M){ if (jobs[tracker] <= n){ if (jobs[tracker]+D < n){ return false; } tracker++; } else { break; } } else { return true; } } } return true; } int main(int argc, const char * argv[]) { //ifstream cin ("file.in"); ofstream cout ("file.out"); cin >> N >> D >> M; for (int m = 0; m < M; m++){ int z; cin >> z; byngggumb[z].push_back(m+1); jobs[m] = z; } sort(jobs, jobs + M); int low = 1; int high = 1000000000; while (low < high){ int middle = (low + high)/2; // cout << "High: " << high << " Low: " << low << " Middle: " << middle << endl; if (test(middle)){ if (middle == 1){ // cout << "ONE"; } high = middle; } else { low = middle + 1; } } int tracker = 0; cout << low << endl; for (int n = 1; n <= N; n++){ int itter = tracker; bool exit = false; for (int c = itter; c < itter+low; c++){ if (tracker < M){ if (jobs[tracker] <= n){ cout << byngggumb[jobs[tracker]][byngggumb[jobs[tracker]].size()-1] << " "; byngggumb[jobs[tracker]].pop_back(); tracker++; } else { break; } } else { exit = true; break; } } cout << "0" << endl; } }

컴파일 시 표준 에러 (stderr) 메시지

jobs.cpp: In function 'int main(int, const char**)':
jobs.cpp:67:14: warning: variable 'exit' set but not used [-Wunused-but-set-variable]
   67 |         bool exit = false;
      |              ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...