제출 #441757

#제출 시각아이디문제언어결과실행 시간메모리
441757YuisuyunoJob Scheduling (CEOI12_jobs)C++14
95 / 100
320 ms34628 KiB
//Nguyen Huu Hoang Minh #include <bits/stdc++.h> #define sz(x) int(x.size()) #define all(x) x.begin(),x.end() #define reset(x) memset(x, 0,sizeof(x)) #define pb push_back #define mp make_pair #define fi first #define se second #define N 1000005 #define remain(x) if (x > MOD) x -= MOD #define ii pair<int, int> #define iiii pair< ii , ii > #define viiii vector< iiii > #define vi vector<int> #define vii vector< ii > #define bit(x, i) (((x) >> (i)) & 1) #define Task "test" #define int long long using namespace std; typedef long double ld; const int inf = 1e10; const int minf = -1e10; int n, m, d; ii a[N]; void readfile() { ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); /* 8 2 12 1 2 4 2 1 3 5 6 2 3 6 4 */ cin >> n >> d >> m; for(int i=1; i<=m; i++){ cin >> a[i].fi; a[i].se = i; } sort(a+1,a+1+m); } bool ok(int machine){ int endT[machine] = {0}; int delays = minf; for(int i=1, cur=0; i<=m; i++, cur++){ if (cur==machine) cur=0; if (endT[cur]+1 > a[i].first){ endT[cur]++; delays = max(delays,endT[cur]-a[i].fi); } else endT[cur]=a[i].fi; } return delays <= d; } vector<int> res[100012]; void proc() { int l = 0, r = m, ans; while (r >= l){ int mid = (l+r)/2; if (ok(mid)){ r = mid-1; ans=mid; } else l = mid+1; } cout << ans << '\n'; int endT[ans] = {0}; for(int i=1, cur=0; i<=m; i++, cur++){ if (cur==ans) cur=0; endT[cur]=max(a[i].fi,endT[cur]+1); res[endT[cur]].pb(a[i].se); } for(int i=1; i<=n; i++){ for(int x : res[i]) cout << x << ' '; cout << "0\n"; } } signed main() { readfile(); proc(); return 0; }

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

jobs.cpp: In function 'void proc()':
jobs.cpp:64:23: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   64 |     int l = 0, r = m, ans;
      |                       ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...