oj.uz

Submission #1058222

# Submission time Handle Problem Language Result Execution time Memory
1058222 2024-08-14T08:59:55 Z Malix Job Scheduling (CEOI12_jobs) C++14
55 / 100
 254 ms 21316 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;

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.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2488 KB Output isn't correct
2 Incorrect 19 ms 2480 KB Output isn't correct
3 Incorrect 17 ms 2512 KB Output isn't correct
4 Incorrect 16 ms 2616 KB Output isn't correct
5 Incorrect 19 ms 2604 KB Output isn't correct
6 Incorrect 18 ms 2532 KB Output isn't correct
7 Incorrect 21 ms 2608 KB Output isn't correct
8 Incorrect 17 ms 2600 KB Output isn't correct
9 Correct 36 ms 2952 KB Output is correct
10 Correct 23 ms 3168 KB Output is correct
11 Correct 25 ms 2584 KB Output is correct
12 Correct 45 ms 4896 KB Output is correct
13 Correct 68 ms 8396 KB Output is correct
14 Correct 122 ms 9916 KB Output is correct
15 Incorrect 122 ms 11708 KB Output isn't correct
16 Correct 172 ms 16376 KB Output is correct
17 Correct 175 ms 17332 KB Output is correct
18 Correct 218 ms 19508 KB Output is correct
19 Correct 254 ms 21316 KB Output is correct
20 Correct 211 ms 18352 KB Output is correct