oj.uz

Submission #68063

# Submission time Handle Problem Language Result Execution time Memory
68063 2018-08-15T20:49:01 Z duality JOIRIS (JOI16_joiris) C++11
30 / 100
 5 ms 988 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;

int A[50];
vpii sol;
int main() {
    int i;
    int N,K;
    scanf("%d %d",&N,&K);
    for (i = 0; i < N; i++) scanf("%d",&A[i]);

    assert(K == 2);
    if ((N & 1) == 0) {
        int s = 0;
        for (i = 0; i < N; i++) s += A[i];
        if (s & 1) {
            printf("-1\n");
            return 0;
        }
        while (1) {
            for (i = 0; i < N; i++) {
                if (A[i] >= 2) 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] += 2;
                    }
                    m = min(m,A[i]);
                }
                for (i = 0; i < N; i++) A[i] -= m;
            }
            else break;
        }
        while (1) {
            vi v;
            for (i = 0; i < N; i++) {
                if (A[i] > 0) v.pb(i);
            }
            if (v.empty()) break;
            for (i = 1; i < v.size(); i++) {
                if (((v[i]-v[i-1]) & 1) == 1) break;
            }
            if (i >= v.size()) {
                int x = v[0]/2;
                sol.pb(mp(1,2*x+1));
                sol.pb(mp(1,2*x+2));
                for (i = 0; i < N/2; i++) {
                    if (i != x) {
                        sol.pb(mp(2,2*i+1));
                        if (!A[2*i] && !A[2*i+1]) {
                            sol.pb(mp(2,2*i+1));
                            A[2*i] = A[2*i+1] = 1;
                        }
                    }
                }
                A[2*x] ^= 1,A[2*x+1] ^= 1;
                for (i = 0; i < N; i++) {
                    if ((i != 2*x) && (i != 2*x+1)) {
                        if (!A[i]) sol.pb(mp(1,i+1));
                    }
                }
                for (i = 0; i < N; i++) {
                    if ((i != v[0]) && A[i]) sol.pb(mp(1,i+1));
                }
            }
            else {
                int l = v[i-1],r = v[i];
                A[l]--,A[r]--;
                for (i = 0; i < N; i++) {
                    if ((i >= l) && (i <= r)) {
                        if ((i < r) && ((i-l) & 1)) sol.pb(mp(2,i+1));
                    }
                    else sol.pb(mp(1,i+1));
                }
                for (i = l; i <= r; i += 2) sol.pb(mp(2,i+1));
            }
        }
    }
    else {
        while (1) {
            for (i = 0; i < N; i++) {
                if (A[i] >= 2) 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] += 2;
                    }
                    m = min(m,A[i]);
                }
                for (i = 0; i < N; i++) A[i] -= m;
            }
            else break;
        }
        while (1) {
            for (i = 0; i < N-1; i += 2) {
                if (A[i] != A[i+1]) break;
            }
            if (i >= N-1) {
                for (i = 0; i < N-1; i += 2) {
                    if (A[i] == 0) sol.pb(mp(2,i+1));
                }
                if (A[N-1] == 0) {
                    sol.pb(mp(1,N));
                    for (i = 0; i < N-1; i += 2) sol.pb(mp(2,i+1));
                }
                break;
            }
            else {
                if (A[i] == 1) {
                    for (i = 0; i < N; i++) {
                        if (A[i] == 0) sol.pb(mp(1,i+1));
                        A[i] ^= 1;
                    }
                }
                else {
                    int x = i;
                    for (i = 0; i < x; i += 2) {
                        sol.pb(mp(2,i+1));
                        if ((A[i] == 0) && (A[i+1] == 0)) {
                            sol.pb(mp(2,i+1));
                            A[i] = A[i+1] = 1;
                        }
                    }
                    for (i = x+1; i < N; i += 2) {
                        sol.pb(mp(2,i+1));
                        if ((A[i] == 0) && (A[i+1] == 0)) {
                            sol.pb(mp(2,i+1));
                            A[i] = A[i+1] = 1;
                        }
                    }
                    sol.pb(mp(1,x+1));
                    A[x] = 1;
                }
            }
        }
    }

    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:48:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (i = 1; i < v.size(); i++) {
                         ~~^~~~~~~~~~
joiris.cpp:51:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (i >= v.size()) {
                 ~~^~~~~~~~~~~
joiris.cpp:149: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:150: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:14: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:15: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 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 5 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 2 ms 572 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 2 ms 572 KB Output is correct
14 Correct 2 ms 572 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 3 ms 680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 680 KB Output is correct
2 Correct 2 ms 680 KB Output is correct
3 Correct 3 ms 708 KB Output is correct
4 Correct 2 ms 744 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 784 KB Output is correct
7 Correct 2 ms 784 KB Output is correct
8 Correct 3 ms 784 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 2 ms 796 KB Output is correct
11 Correct 2 ms 808 KB Output is correct
12 Correct 3 ms 808 KB Output is correct
13 Correct 3 ms 808 KB Output is correct
14 Correct 2 ms 808 KB Output is correct
15 Correct 3 ms 808 KB Output is correct
16 Correct 2 ms 808 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 5 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 2 ms 572 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 2 ms 572 KB Output is correct
14 Correct 2 ms 572 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 3 ms 680 KB Output is correct
17 Runtime error 2 ms 988 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 2 ms 572 KB Output is correct
5 Correct 3 ms 572 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 5 ms 572 KB Output is correct
8 Correct 3 ms 572 KB Output is correct
9 Correct 2 ms 572 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 2 ms 572 KB Output is correct
14 Correct 2 ms 572 KB Output is correct
15 Correct 2 ms 572 KB Output is correct
16 Correct 3 ms 680 KB Output is correct
17 Correct 2 ms 680 KB Output is correct
18 Correct 2 ms 680 KB Output is correct
19 Correct 3 ms 708 KB Output is correct
20 Correct 2 ms 744 KB Output is correct
21 Correct 3 ms 748 KB Output is correct
22 Correct 3 ms 784 KB Output is correct
23 Correct 2 ms 784 KB Output is correct
24 Correct 3 ms 784 KB Output is correct
25 Correct 2 ms 796 KB Output is correct
26 Correct 2 ms 796 KB Output is correct
27 Correct 2 ms 808 KB Output is correct
28 Correct 3 ms 808 KB Output is correct
29 Correct 3 ms 808 KB Output is correct
30 Correct 2 ms 808 KB Output is correct
31 Correct 3 ms 808 KB Output is correct
32 Correct 2 ms 808 KB Output is correct
33 Runtime error 2 ms 988 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Halted 0 ms 0 KB -