답안 #81890

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
81890	2018-10-27T15:12:37 Z	duality	Job Scheduling (CEOI12_jobs)	C++11	100 / 100	222 ms	14072 KB

jobs

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi R[100000];
int p[100000];
int main() {
    int i;
    int N,D,M,x;
    scanf("%d %d %d",&N,&D,&M);
    for (i = 0; i < M; i++) scanf("%d",&x),R[x-1].pb(i);

    int j,l = 0,r = M;
    while (l < r) {
        int m = (l+r) / 2;

        j = 0;
        for (i = 0; i < N; i++) p[i] = R[i].size();
        for (i = 0; i < N; i++) {
            while ((j <= i) && (p[j] == 0)) j++;
            if ((i-j) > D) break;
            int c = m;
            while ((j <= i) && (c > 0)) {
                int t = min(p[j],c);
                p[j] -= t,c -= t;
                if (p[j] == 0) j++;
            }
        }
        if (i == N) r = m;
        else l = m+1;
    }
    j = 0;
    printf("%d\n",l);
    for (i = 0; i < N; i++) {
        while ((j <= i) && R[j].empty()) j++;
        int c = l;
        while ((j <= i) && (c > 0)) {
            if (R[j].empty()) j++;
            else {
                printf("%d ",R[j].back()+1);
                R[j].pop_back(),c--;
            }
        }
        printf("0\n");
    }

    return 0;
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&N,&D,&M);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
jobs.cpp:64:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < M; i++) scanf("%d",&x),R[x-1].pb(i);
                             ~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	3824 KB	Output is correct
2	Correct	28 ms	3996 KB	Output is correct
3	Correct	26 ms	3996 KB	Output is correct
4	Correct	25 ms	4020 KB	Output is correct
5	Correct	25 ms	4020 KB	Output is correct
6	Correct	25 ms	4036 KB	Output is correct
7	Correct	27 ms	4036 KB	Output is correct
8	Correct	26 ms	4256 KB	Output is correct
9	Correct	33 ms	4740 KB	Output is correct
10	Correct	35 ms	4776 KB	Output is correct
11	Correct	31 ms	4776 KB	Output is correct
12	Correct	54 ms	5188 KB	Output is correct
13	Correct	80 ms	7084 KB	Output is correct
14	Correct	135 ms	8236 KB	Output is correct
15	Correct	152 ms	9260 KB	Output is correct
16	Correct	194 ms	11008 KB	Output is correct
17	Correct	215 ms	12972 KB	Output is correct
18	Correct	188 ms	12972 KB	Output is correct
19	Correct	222 ms	14072 KB	Output is correct
20	Correct	212 ms	14072 KB	Output is correct