oj.uz

Submission #332760

# Submission time Handle Problem Language Result Execution time Memory
332760 2020-12-03T08:38:25 Z balbit JOIRIS (JOI16_joiris) C++14
30 / 100
 11 ms 384 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
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(){
    return;
    for (int i = 6; i>=0; --i) {
        for (int j = 0; j<n; ++j) {
            cout<<g[i][j];
        }
        cout<<'\n';
    }
    cout<<endl;
}

void addh(int l) {
    re.pb({2,l+1});
    int r = l+K-1;
    if (r >= n) GG();
    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;
    }
}

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>>tall[i]; nof[i] = tall[i] % K;
        for (int j = 0; j<tall[i]; ++j) g[j][i] = 1;
    }
    dump();
    REP(i,n) {
        while (nof[i] != 0) addh(i);
        dump();
    }
    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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Incorrect 1 ms 364 KB Output isn't correct
18 Halted 0 ms 0 KB -