답안 #1085621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085621	2024-09-08T13:43:08 Z	vjudge1	Job Scheduling (CEOI12_jobs)	C++17	92 / 100	287 ms	27936 KB

jobs

#include <bits/stdc++.h>

using namespace std;
long long n,d,m;
vector<long long> v;
long long freq[100002];

bool moze(long long k)
{
    long long rabota = 0;
    for (long long i=1;i<=n;i++)
    {
        rabota += freq[i];
        long long potrebni_denovi = rabota/k;
        if (rabota%k>0) potrebni_denovi++;
        if (potrebni_denovi>d+1) return false;
        rabota-=k;
        if (rabota<0) rabota = 0;
    }
    if (rabota<=0) return true;
    return false;
}

long long bs(long long l,long long r)
{
    if (l==r) return l;
    long long mid = (l+r)/2;
    if (moze(mid)) return bs(l,mid);
    else return bs(mid+1,r);
}

void pecati(long long k)
{
    vector<pair<long long,long long> > q;
    for (long long i=0;i<v.size();i++) q.push_back({v[i],i+1});
    sort(q.begin(),q.end());
    long long den=1,koristeni=0;
    for (long long i=0;i<q.size();i++)
    {
        if (koristeni==k)
        {
            koristeni=0;
            den++;
            cout<<0<<endl;
        }
        long long x = q[i].first,it=q[i].second;

        if (den<x)
        {
            while(den<x)
            {
                den++;
                cout<<0<<endl;
            }
        }
        koristeni++;
        cout<<it<<" ";
    }
    while(den<=n)
    {
        cout<<0<<endl;
        den++;
    }

}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>d>>m;
    for (long long i=0;i<m;i++)
    {
        long long a;
        cin>>a;
        freq[a]++;
        v.push_back(a);
    }

    long long kec = 1;
    long long odg = bs(kec,m);
    cout<<odg<<endl;
    pecati(odg);
    return 0;
}

Compilation message

jobs.cpp: In function 'void pecati(long long int)':
jobs.cpp:35:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (long long i=0;i<v.size();i++) q.push_back({v[i],i+1});
      |                        ~^~~~~~~~~
jobs.cpp:38:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for (long long i=0;i<q.size();i++)
      |                        ~^~~~~~~~~

Subtask #1

92.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	3420 KB	Output is correct
2	Correct	23 ms	3416 KB	Output is correct
3	Correct	29 ms	3416 KB	Output is correct
4	Correct	22 ms	3420 KB	Output is correct
5	Correct	23 ms	3580 KB	Output is correct
6	Correct	23 ms	3420 KB	Output is correct
7	Correct	23 ms	3416 KB	Output is correct
8	Correct	23 ms	3416 KB	Output is correct
9	Correct	120 ms	3660 KB	Output is correct
10	Correct	119 ms	3660 KB	Output is correct
11	Correct	21 ms	3420 KB	Output is correct
12	Correct	40 ms	6488 KB	Output is correct
13	Correct	61 ms	11596 KB	Output is correct
14	Correct	92 ms	13624 KB	Output is correct
15	Incorrect	97 ms	15672 KB	Extra information in the output file
16	Correct	137 ms	22084 KB	Output is correct
17	Correct	156 ms	23332 KB	Output is correct
18	Correct	173 ms	25880 KB	Output is correct
19	Partially correct	287 ms	27936 KB	Partially correct
20	Correct	151 ms	24364 KB	Output is correct