oj.uz

Submission #455159

# Submission time Handle Problem Language Result Execution time Memory
455159 2021-08-05T15:15:32 Z shahriarkhan Job Scheduling (CEOI12_jobs) C++14
60 / 100
 264 ms 21024 KB 
#include<bits/stdc++.h>
using namespace std ;

const int mx = 1e5 + 5 ;

vector<int> pos[mx] ;

vector<int> ans[mx] ;

int siz[mx] ;

int main()
{
    int n , d , m ;
    scanf("%d%d%d",&n,&d,&m) ;
    for(int i = 1 ; i <= m ; ++i)
    {
        int x ;
        scanf("%d",&x) ;
        pos[x].push_back(i) ;
        ++siz[x] ;
    }
    int low = 1 , high = n ;
    while(low<high)
    {
        int mid = (low+high)/2 , cnt[mx] = {0} , cur = 1 , bad = 0 ;
        for(int i = 1 ; i <= n ; ++i)
        {
            for(int j = 1 ; j <= siz[i] ; ++j)
            {
                while((cur<i) || (cnt[cur]==mid)) ++cur ;
                if((cur-i)>d)
                {
                    bad = 1 ;
                    break ;
                }
                ++cnt[cur] ;
            }
            if(bad) break ;
        }
        if(!bad) high = mid ;
        else low = mid + 1 ;
    }
    int cnt[mx] = {0} , cur = 1 ;
    for(int i = 1 ; i <= n ; ++i)
    {
        for(int j = 0 ; j < siz[i] ; ++j)
        {
            while((cur<i) || (cnt[cur]==low)) ++cur ;
            ++cnt[cur] ;
            ans[cur].push_back(pos[i][j]) ;
        }
    }
    printf("%d\n",low) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        for(int j : ans[i]) printf("%d ",j) ;
        printf("0\n") ;
    }
    return 0 ;
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%d%d",&n,&d,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
jobs.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%d",&x) ;
      |         ~~~~~^~~~~~~~~

Subtask #1
60.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 7104 KB Output isn't correct
2 Incorrect 29 ms 7236 KB Output isn't correct
3 Incorrect 27 ms 7148 KB Output isn't correct
4 Incorrect 27 ms 7108 KB Output isn't correct
5 Incorrect 27 ms 7200 KB Output isn't correct
6 Incorrect 26 ms 7108 KB Output isn't correct
7 Incorrect 27 ms 7108 KB Output isn't correct
8 Incorrect 27 ms 7100 KB Output isn't correct
9 Correct 36 ms 7548 KB Output is correct
10 Correct 35 ms 7424 KB Output is correct
11 Correct 31 ms 7464 KB Output is correct
12 Correct 57 ms 9248 KB Output is correct
13 Correct 85 ms 12076 KB Output is correct
14 Correct 133 ms 14020 KB Output is correct
15 Correct 138 ms 14104 KB Output is correct
16 Correct 198 ms 16500 KB Output is correct
17 Correct 230 ms 20972 KB Output is correct
18 Correct 231 ms 20176 KB Output is correct
19 Correct 264 ms 20804 KB Output is correct
20 Correct 234 ms 21024 KB Output is correct