oj.uz

Submission #68340

# Submission time Handle Problem Language Result Execution time Memory
68340 2018-08-16T18:51:03 Z duality JOIRIS (JOI16_joiris) C++11
100 / 100
 4 ms 1108 KB 
#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 ----------

int A[50];
vpii sol;
int norm(int N,int K) {
    int i;
    while (1) {
        for (i = 0; i < N; i++) {
            if (A[i] >= K) break;
        }
        if (i < N) {
            int m = 99;
            for (i = 0; i < N; i++) {
                if (A[i] == 0) {
                    sol.pb(mp(1,i+1));
                    A[i] += K;
                }
                m = min(m,A[i]);
            }
            for (i = 0; i < N; i++) A[i] -= m;
        }
        else break;
    }
    return 0;
}
int diff[51];
int main() {
    int i;
    int N,K;
    scanf("%d %d",&N,&K);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);

    int j;
    norm(N,K);
    for (i = 1; i < N; i++) diff[i] = A[i-1]-A[i];
    int s = 0;
    for (i = K; i < N; i += K) s += diff[i];
    for (i = 0; i <= N-K; i++) {
        int m = 0;
        for (j = i; j < i+K; j++) m = max(m,A[j]);
        int x = (i == 0) ? -s:diff[i];
        x %= K;
        if (x < 0) x += K;
        for (j = 0; j < x; j++) sol.pb(mp(2,i+1));
        diff[i+K] += x;
        m += x;
        for (j = 0; j < N; j++) {
            if ((j < i) || (j >= i+K)) {
                while (A[j] < m) sol.pb(mp(1,j+1)),A[j] += K;
            }
            else A[j] += x;
        }
        m = 1e9;
        for (j = 0; j < N; j++) m = min(m,A[j]);
        for (j = 0; j < N; j++) A[j] -= m;
        norm(N,K);
    }
    for (i = 0; i < N; i++) {
        if (A[i] != 0) {
            printf("-1\n");
            return 0;
        }
    }
    printf("%d\n",sol.size());
    for (i = 0; i < sol.size(); i++) printf("%d %d\n",sol[i].first,sol[i].second);

    return 0;
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:119:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n",sol.size());
                   ~~~~~~~~~~^
joiris.cpp:120:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sol.size(); i++) printf("%d %d\n",sol[i].first,sol[i].second);
                 ~~^~~~~~~~~~~~
joiris.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&K);
     ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:86:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&A[i]);
                             ~~~~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 3 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 2 ms 628 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 2 ms 636 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 2 ms 636 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 2 ms 652 KB Output is correct
8 Correct 2 ms 652 KB Output is correct
9 Correct 3 ms 652 KB Output is correct
10 Correct 2 ms 652 KB Output is correct
11 Correct 2 ms 652 KB Output is correct
12 Correct 2 ms 652 KB Output is correct
13 Correct 3 ms 652 KB Output is correct
14 Correct 2 ms 652 KB Output is correct
15 Correct 3 ms 652 KB Output is correct
16 Correct 3 ms 652 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 3 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 2 ms 628 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 3 ms 652 KB Output is correct
18 Correct 2 ms 652 KB Output is correct
19 Correct 3 ms 652 KB Output is correct
20 Correct 2 ms 652 KB Output is correct
21 Correct 3 ms 656 KB Output is correct
22 Correct 2 ms 656 KB Output is correct
23 Correct 3 ms 664 KB Output is correct
24 Correct 2 ms 684 KB Output is correct
25 Correct 2 ms 684 KB Output is correct
26 Correct 3 ms 684 KB Output is correct
27 Correct 2 ms 684 KB Output is correct
28 Correct 2 ms 684 KB Output is correct
29 Correct 3 ms 704 KB Output is correct
30 Correct 2 ms 704 KB Output is correct
31 Correct 2 ms 704 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 2 ms 728 KB Output is correct
34 Correct 2 ms 732 KB Output is correct
35 Correct 2 ms 736 KB Output is correct
36 Correct 2 ms 740 KB Output is correct
37 Correct 2 ms 740 KB Output is correct
38 Correct 2 ms 748 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 564 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 3 ms 628 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 2 ms 628 KB Output is correct
11 Correct 2 ms 628 KB Output is correct
12 Correct 3 ms 628 KB Output is correct
13 Correct 2 ms 628 KB Output is correct
14 Correct 2 ms 628 KB Output is correct
15 Correct 2 ms 636 KB Output is correct
16 Correct 2 ms 636 KB Output is correct
17 Correct 2 ms 636 KB Output is correct
18 Correct 2 ms 636 KB Output is correct
19 Correct 2 ms 636 KB Output is correct
20 Correct 2 ms 636 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 3 ms 652 KB Output is correct
23 Correct 2 ms 652 KB Output is correct
24 Correct 2 ms 652 KB Output is correct
25 Correct 3 ms 652 KB Output is correct
26 Correct 2 ms 652 KB Output is correct
27 Correct 2 ms 652 KB Output is correct
28 Correct 2 ms 652 KB Output is correct
29 Correct 3 ms 652 KB Output is correct
30 Correct 2 ms 652 KB Output is correct
31 Correct 3 ms 652 KB Output is correct
32 Correct 3 ms 652 KB Output is correct
33 Correct 3 ms 652 KB Output is correct
34 Correct 2 ms 652 KB Output is correct
35 Correct 3 ms 652 KB Output is correct
36 Correct 2 ms 652 KB Output is correct
37 Correct 3 ms 656 KB Output is correct
38 Correct 2 ms 656 KB Output is correct
39 Correct 3 ms 664 KB Output is correct
40 Correct 2 ms 684 KB Output is correct
41 Correct 2 ms 684 KB Output is correct
42 Correct 3 ms 684 KB Output is correct
43 Correct 2 ms 684 KB Output is correct
44 Correct 2 ms 684 KB Output is correct
45 Correct 3 ms 704 KB Output is correct
46 Correct 2 ms 704 KB Output is correct
47 Correct 2 ms 704 KB Output is correct
48 Correct 2 ms 724 KB Output is correct
49 Correct 2 ms 728 KB Output is correct
50 Correct 2 ms 732 KB Output is correct
51 Correct 2 ms 736 KB Output is correct
52 Correct 2 ms 740 KB Output is correct
53 Correct 2 ms 740 KB Output is correct
54 Correct 2 ms 748 KB Output is correct
55 Correct 2 ms 748 KB Output is correct
56 Correct 2 ms 748 KB Output is correct
57 Correct 2 ms 748 KB Output is correct
58 Correct 3 ms 884 KB Output is correct
59 Correct 2 ms 908 KB Output is correct
60 Correct 2 ms 912 KB Output is correct
61 Correct 2 ms 916 KB Output is correct
62 Correct 2 ms 920 KB Output is correct
63 Correct 3 ms 964 KB Output is correct
64 Correct 3 ms 964 KB Output is correct
65 Correct 2 ms 964 KB Output is correct
66 Correct 2 ms 964 KB Output is correct
67 Correct 2 ms 988 KB Output is correct
68 Correct 2 ms 988 KB Output is correct
69 Correct 2 ms 1012 KB Output is correct
70 Correct 3 ms 1012 KB Output is correct
71 Correct 3 ms 1024 KB Output is correct
72 Correct 2 ms 1028 KB Output is correct
73 Correct 3 ms 1028 KB Output is correct
74 Correct 2 ms 1036 KB Output is correct
75 Correct 3 ms 1036 KB Output is correct
76 Correct 3 ms 1044 KB Output is correct
77 Correct 2 ms 1044 KB Output is correct
78 Correct 2 ms 1044 KB Output is correct
79 Correct 2 ms 1052 KB Output is correct
80 Correct 3 ms 1056 KB Output is correct
81 Correct 2 ms 1056 KB Output is correct
82 Correct 2 ms 1056 KB Output is correct
83 Correct 2 ms 1056 KB Output is correct
84 Correct 2 ms 1056 KB Output is correct
85 Correct 2 ms 1080 KB Output is correct
86 Correct 2 ms 1080 KB Output is correct
87 Correct 2 ms 1080 KB Output is correct
88 Correct 2 ms 1080 KB Output is correct
89 Correct 2 ms 1104 KB Output is correct
90 Correct 2 ms 1104 KB Output is correct
91 Correct 2 ms 1104 KB Output is correct
92 Correct 4 ms 1108 KB Output is correct