oj.uz

답안 #949540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949540 2024-03-19T10:29:18 Z GrindMachine Job Scheduling (CEOI12_jobs) C++17
0 / 100
 98 ms 7256 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n,d,m; cin >> n >> d >> m;
    vector<int> a(m+5);
    rep1(i,m) cin >> a[i];

    sort(a.begin()+1,a.begin()+m+1);

    auto ok = [&](int mid){
        int ptr = 1;
        rep1(i,n){
            int iter = mid;
            while(ptr <= m and a[ptr] <= i and iter--){
                if(a[ptr]+d < i) return false;
                ptr++;
            }
        }

        return ptr > m;
    };

    int l = 1, r = m;
    int ans = -1;

    while(l <= r){
        int mid = (l+r) >> 1;
        if(ok(mid)){
            ans = mid;
            r = mid-1;
        }
        else{
            l = mid+1;
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 972 KB Unexpected end of file - int32 expected
2 Incorrect 7 ms 1112 KB Unexpected end of file - int32 expected
3 Incorrect 7 ms 1116 KB Unexpected end of file - int32 expected
4 Incorrect 7 ms 1116 KB Unexpected end of file - int32 expected
5 Incorrect 7 ms 1116 KB Unexpected end of file - int32 expected
6 Incorrect 7 ms 1116 KB Unexpected end of file - int32 expected
7 Incorrect 10 ms 1116 KB Unexpected end of file - int32 expected
8 Incorrect 7 ms 1116 KB Unexpected end of file - int32 expected
9 Incorrect 9 ms 860 KB Unexpected end of file - int32 expected
10 Incorrect 9 ms 860 KB Unexpected end of file - int32 expected
11 Incorrect 11 ms 1116 KB Unexpected end of file - int32 expected
12 Incorrect 22 ms 1884 KB Unexpected end of file - int32 expected
13 Incorrect 35 ms 3160 KB Unexpected end of file - int32 expected
14 Incorrect 49 ms 3684 KB Unexpected end of file - int32 expected
15 Incorrect 58 ms 4180 KB Unexpected end of file - int32 expected
16 Incorrect 75 ms 5456 KB Unexpected end of file - int32 expected
17 Incorrect 91 ms 6508 KB Unexpected end of file - int32 expected
18 Incorrect 88 ms 6480 KB Unexpected end of file - int32 expected
19 Incorrect 98 ms 7256 KB Unexpected end of file - int32 expected
20 Incorrect 87 ms 6380 KB Unexpected end of file - int32 expected