# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
898827 | 2024-01-05T07:15:15 Z | hadi7 | Job Scheduling (CEOI12_jobs) | C++17 | 421 ms | 15740 KB |
#include<bits/stdc++.h> #define FAST ios::sync_with_stdio(0); cin.tie(0) #define f first #define s second using namespace std ; const int N = 2e6 ; int n , k , m ; vector <pair <int , int>> p ; bool slv(int x) { int u = 0 ; for(int i = 1 ; i <= n ; i++) { for(int j = 0 ; j < x ; j++) { while(p[u].f > i) i++ ; if(p[u].f > i + k) return 0 ; u++ ; if(u == m) return 1 ; } } return 0 ; } main() { cin >> n >> k >> m ; p.resize(m) ; for(int i = 0 ; i < m ; i++) { cin >> p[i].f ; p[i].s = i + 1 ; } sort(p.begin() , p.end()) ; int l = 0 , r = 1e18 ; while(l + 1 < r) { int h = l + (r - l) / 2 ; if(slv(h)) r = h ; else l = h ; } cout << r << endl ; int z = 0 ; for(int i = 0 ; i < m ;) { for(int j = 0 ; j < r && i < m ; j++ , i++) { cout << p[i].s << " " ; } cout << 0 << endl ; z++ ; } for(; z < n ; z++) cout << 0 << endl ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 37 ms | 1872 KB | Output isn't correct |
2 | Incorrect | 37 ms | 1876 KB | Output isn't correct |
3 | Incorrect | 36 ms | 1876 KB | Output isn't correct |
4 | Incorrect | 36 ms | 2064 KB | Output isn't correct |
5 | Incorrect | 36 ms | 1884 KB | Output isn't correct |
6 | Incorrect | 35 ms | 1872 KB | Output isn't correct |
7 | Incorrect | 42 ms | 2036 KB | Output isn't correct |
8 | Incorrect | 36 ms | 2020 KB | Output isn't correct |
9 | Incorrect | 138 ms | 2188 KB | Output isn't correct |
10 | Incorrect | 162 ms | 2128 KB | Output isn't correct |
11 | Correct | 36 ms | 2100 KB | Output is correct |
12 | Correct | 66 ms | 3796 KB | Output is correct |
13 | Correct | 100 ms | 5340 KB | Output is correct |
14 | Correct | 192 ms | 7252 KB | Output is correct |
15 | Incorrect | 170 ms | 8684 KB | Output isn't correct |
16 | Correct | 227 ms | 10576 KB | Output is correct |
17 | Correct | 285 ms | 12448 KB | Output is correct |
18 | Incorrect | 276 ms | 13652 KB | Output isn't correct |
19 | Incorrect | 421 ms | 15740 KB | Output isn't correct |
20 | Correct | 262 ms | 12368 KB | Output is correct |