제출 #900204

#제출 시각아이디문제언어결과실행 시간메모리
900204VMaksimoski008Job Scheduling (CEOI12_jobs)C++14
0 / 100
447 ms4360 KiB
#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define uniq(x) x.erase(unique(all(x)), x.end()) #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; void setIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int N, D, M; vector<int> v, cnt; bool check(int mid) { int left = mid; priority_queue<int, vector<int>, greater<int> > pq; int last = 0; for(int i=1; i<=N; i++) { left = mid; //cout << "DAY: " << i << '\n'; for(int j=0; j<cnt[i]; j++) pq.push(i); while(left > 0 && !pq.empty()) { int u = pq.top(); pq.pop(); if(i - u > D) return false; left--; } //cout << "LEFT: " << pq.size() << '\n'; } return true; } int32_t main() { setIO(); cin >> N >> D >> M; v.resize(M); cnt.resize(N+1); for(int &x : v) cin >> x, cnt[x]++; sort(all(v)); int l=1, r=M; int ans = 0; while(l <= r) { int mid = (l + r) / 2; if(check(mid)) ans = mid, r = mid - 1; else l = mid + 1; } cout << ans << '\n'; cout << 0 << '\n'; return 0; }

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

jobs.cpp: In function 'bool check(int)':
jobs.cpp:37:9: warning: unused variable 'last' [-Wunused-variable]
   37 |     int last = 0;
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...