oj.uz

Submission #332766

# Submission time Handle Problem Language Result Execution time Memory
332766 2020-12-03T09:11:18 Z balbit JOIRIS (JOI16_joiris) C++14
100 / 100
 21 ms 1024 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"-1\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e6+5;

bool g[10000][51];
int tall[51];
int nof[51]; // modulo k
//bool org[51][51];
int a[51];
int n,K;
vector<pii> re;

void tryclear(){
    int hei = *max_element(tall, tall+n);
    for (int i = 0; i<hei; ++i) {
        if (*min_element(g[i], g[i]+n) ) {

            for (int j = i; j<hei; ++j) {
                for(int k = 0; k<n; ++k) g[j][k] = g[j+1][k];
            }
            --hei;
            for (int k = 0; k<n; ++k) {
                --nof[k]; if (nof[k] < 0) nof[k] += K;
                while (tall[k] && !g[tall[k]-1][k]) --tall[k];
            }
            --i;
        }
    }
}

void dump(){
#ifndef BALBIT
    return;
#endif
    for (int i = 6; i>=0; --i) {
        for (int j = 0; j<n; ++j) {
            cout<<g[i][j];
        }
        cout<<'\n';
    }
    cout<<endl;
}

bool addh(int l) {
    re.pb({2,l+1});
    int r = l+K-1;
    if (r >= n) return 0;
    bug(l,r);
    int m = *max_element(tall+l, tall+r+1);
    for (int i = l; i<=r; ++i) {
        tall[i] = m+1;
        g[m][i] = 1;
        (++nof[i]) %= K;
    }
    return 1;
}

void addv(int l) {
    re.pb({1,l+1});
    REP(i,K) {
        g[i+tall[l]][l] = 1;
    }
    tall[l] += K;
    tryclear();
}

signed main(){
    IOS();
    cin>>n>>K;
    REP(i,n) {
        cin>>a[i];
    }
    dump();
    REP(kkk, K) {
        re.clear();
        memset(g, 0, sizeof g);
        REP(i,n) {
            tall[i] = a[i];
            nof[i] = (kkk+tall[i]) % K;
            for (int j = 0; j<tall[i]; ++j) g[j][i] = 1;
        }
        bool ok = 1;
        REP(i,n) {
            while (nof[i] != 0) {
                if (!addh(i)) {ok = 0; break;}
            }
            if (!ok) break;
            dump();
        }
        bug(kkk, ok);
        dump();

        if (ok) {
            bug(kkk);
//            dump();
//            assert(0);
            break;
        }
        if (kkk == K-1) {
            GG();
        }
    }

    while (*max_element(tall, tall+n)) {
        int h = 10000000, pos = -1;
        REP(i,n) {
            if (tall[i] < h) {
                h = tall[i]; pos = i;
            }
        }
        addv(pos);
        bug(pos, h);
        dump();
        tryclear();
        dump();
        string foo; cin>>foo;
    }
    cout<<SZ(re)<<endl;
    for (auto & p : re) {
        cout<<p.f<<' '<<p.s<<endl;
    }

}

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 876 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 876 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 1 ms 876 KB Output is correct
13 Correct 1 ms 876 KB Output is correct
14 Correct 1 ms 876 KB Output is correct
15 Correct 1 ms 876 KB Output is correct
16 Correct 4 ms 876 KB Output is correct
17 Correct 1 ms 876 KB Output is correct
18 Correct 1 ms 876 KB Output is correct
19 Correct 2 ms 876 KB Output is correct
20 Correct 1 ms 876 KB Output is correct
21 Correct 1 ms 876 KB Output is correct
22 Correct 1 ms 896 KB Output is correct
23 Correct 12 ms 876 KB Output is correct
24 Correct 8 ms 876 KB Output is correct
25 Correct 10 ms 876 KB Output is correct
26 Correct 1 ms 876 KB Output is correct
27 Correct 17 ms 876 KB Output is correct
28 Correct 1 ms 876 KB Output is correct
29 Correct 17 ms 876 KB Output is correct
30 Correct 1 ms 876 KB Output is correct
31 Correct 1 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 1 ms 876 KB Output is correct
34 Correct 1 ms 876 KB Output is correct
35 Correct 1 ms 876 KB Output is correct
36 Correct 2 ms 876 KB Output is correct
37 Correct 2 ms 876 KB Output is correct
38 Correct 1 ms 876 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 876 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 876 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 1 ms 876 KB Output is correct
13 Correct 1 ms 876 KB Output is correct
14 Correct 1 ms 876 KB Output is correct
15 Correct 1 ms 876 KB Output is correct
16 Correct 4 ms 876 KB Output is correct
17 Correct 1 ms 876 KB Output is correct
18 Correct 2 ms 896 KB Output is correct
19 Correct 1 ms 876 KB Output is correct
20 Correct 1 ms 876 KB Output is correct
21 Correct 1 ms 876 KB Output is correct
22 Correct 1 ms 876 KB Output is correct
23 Correct 1 ms 876 KB Output is correct
24 Correct 1 ms 876 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 1 ms 876 KB Output is correct
27 Correct 2 ms 876 KB Output is correct
28 Correct 3 ms 876 KB Output is correct
29 Correct 1 ms 876 KB Output is correct
30 Correct 1 ms 876 KB Output is correct
31 Correct 1 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 1 ms 876 KB Output is correct
34 Correct 1 ms 876 KB Output is correct
35 Correct 2 ms 876 KB Output is correct
36 Correct 1 ms 876 KB Output is correct
37 Correct 1 ms 876 KB Output is correct
38 Correct 1 ms 896 KB Output is correct
39 Correct 12 ms 876 KB Output is correct
40 Correct 8 ms 876 KB Output is correct
41 Correct 10 ms 876 KB Output is correct
42 Correct 1 ms 876 KB Output is correct
43 Correct 17 ms 876 KB Output is correct
44 Correct 1 ms 876 KB Output is correct
45 Correct 17 ms 876 KB Output is correct
46 Correct 1 ms 876 KB Output is correct
47 Correct 1 ms 876 KB Output is correct
48 Correct 1 ms 876 KB Output is correct
49 Correct 1 ms 876 KB Output is correct
50 Correct 1 ms 876 KB Output is correct
51 Correct 1 ms 876 KB Output is correct
52 Correct 2 ms 876 KB Output is correct
53 Correct 2 ms 876 KB Output is correct
54 Correct 1 ms 876 KB Output is correct
55 Correct 1 ms 876 KB Output is correct
56 Correct 2 ms 876 KB Output is correct
57 Correct 1 ms 876 KB Output is correct
58 Correct 1 ms 876 KB Output is correct
59 Correct 1 ms 876 KB Output is correct
60 Correct 1 ms 876 KB Output is correct
61 Correct 1 ms 876 KB Output is correct
62 Correct 1 ms 876 KB Output is correct
63 Correct 1 ms 876 KB Output is correct
64 Correct 1 ms 876 KB Output is correct
65 Correct 2 ms 876 KB Output is correct
66 Correct 1 ms 876 KB Output is correct
67 Correct 1 ms 876 KB Output is correct
68 Correct 1 ms 876 KB Output is correct
69 Correct 4 ms 896 KB Output is correct
70 Correct 16 ms 912 KB Output is correct
71 Correct 21 ms 876 KB Output is correct
72 Correct 17 ms 876 KB Output is correct
73 Correct 17 ms 876 KB Output is correct
74 Correct 20 ms 896 KB Output is correct
75 Correct 7 ms 876 KB Output is correct
76 Correct 16 ms 876 KB Output is correct
77 Correct 1 ms 876 KB Output is correct
78 Correct 2 ms 876 KB Output is correct
79 Correct 1 ms 876 KB Output is correct
80 Correct 1 ms 876 KB Output is correct
81 Correct 15 ms 876 KB Output is correct
82 Correct 2 ms 876 KB Output is correct
83 Correct 1 ms 876 KB Output is correct
84 Correct 1 ms 876 KB Output is correct
85 Correct 1 ms 876 KB Output is correct
86 Correct 1 ms 876 KB Output is correct
87 Correct 1 ms 876 KB Output is correct
88 Correct 1 ms 876 KB Output is correct
89 Correct 1 ms 876 KB Output is correct
90 Correct 1 ms 876 KB Output is correct
91 Correct 2 ms 876 KB Output is correct
92 Correct 8 ms 876 KB Output is correct