제출 #1058222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058222		Malix	Job Scheduling (CEOI12_jobs)	C++14	55 / 100	254 ms	21316 KiB

jobs

#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;

int main() {   
    int n,d,m;cin>>n>>d>>m;
    vi a(m);
    REP(i,0,m)cin>>a[i];
    vi b(n+1,0);
    REP(i,0,m)b[a[i]+d]++;
    int k=0;
    int ans=0;
    REP(i,1,n+1){
        k+=b[i];
        int p=k/i;
        if(k%i)p++;
        ans=max(ans,p);
    }
    cout<<ans<<"\n";
    pii arr;
    REP(i,0,m)arr.PB({a[i],i+1});
    sort(arr.begin(),arr.end());
    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: 55 / 100