oj.uz

답안 #1058445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058445 2024-08-14T10:02:03 Z Malix Job Scheduling (CEOI12_jobs) C++14
60 / 100
 234 ms 17364 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

vi a;
pii arr;
int n,d,m;

int BS(int l,int r){
    if(l==r)return l;
    int t=(l+r)/2;
    int k=0;int p=1;
    bool flag=1;
    REP(i,0,m){
        if(arr[i].F>p){
            k=0;p=arr[i].F;
        }
        k++;
        if(arr[i].F+d<p){
            flag=0;
            break;
        }
        if(k==t){
            k=0;p++;
        }
    }
    if(k!=0&&p>n)flag=0;
    if(flag)return BS(l,t);
    else return BS(t+1,r);
}

int main() {   
    cin>>n>>d>>m;
    a.resize(m);
    REP(i,0,m)cin>>a[i];
    REP(i,0,m)arr.PB({a[i],i+1});
    sort(arr.begin(),arr.end());
    int ans=BS(1,n);
    cout<<ans<<"\n";
    int pos=0;int x=0;
    REP(i,0,n){
        while(pos<m&&x<ans){
            cout<<arr[pos].S<<" ";
            pos++;x++;
        }
        cout<<"0\n";
        x=0;
    }
}

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 2252 KB Output isn't correct
2 Incorrect 17 ms 2252 KB Output isn't correct
3 Incorrect 18 ms 2232 KB Output isn't correct
4 Incorrect 17 ms 2256 KB Output isn't correct
5 Incorrect 16 ms 2240 KB Output isn't correct
6 Incorrect 16 ms 2172 KB Output isn't correct
7 Incorrect 16 ms 2256 KB Output isn't correct
8 Incorrect 16 ms 2184 KB Output isn't correct
9 Correct 23 ms 2452 KB Output is correct
10 Correct 24 ms 2508 KB Output is correct
11 Correct 23 ms 2184 KB Output is correct
12 Correct 46 ms 4036 KB Output is correct
13 Correct 70 ms 6604 KB Output is correct
14 Correct 111 ms 7736 KB Output is correct
15 Correct 119 ms 9656 KB Output is correct
16 Correct 155 ms 13356 KB Output is correct
17 Correct 219 ms 14000 KB Output is correct
18 Correct 204 ms 16464 KB Output is correct
19 Correct 234 ms 17364 KB Output is correct
20 Correct 193 ms 14024 KB Output is correct