oj.uz

Submission #925008

# Submission time Handle Problem Language Result Execution time Memory
925008 2024-02-10T12:41:51 Z parlimoos RLE (BOI06_rle) C++14
100 / 100
 1649 ms 115224 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<ll , x>
#define endl '\n'

ll n , m;
vector<arr(2)> bls;
set<arr(2)> ord;
ll infs[100000];
ll mns[2000000][2];
vector<ll> o;

void add(ll c , ll x){
    ll len = (ll)bls.size();
    if(!bls.empty() and bls[len - 1][0] == c) bls[len - 1][1] += x;
    else bls.pb({c , x});
}
ll clc(ll i , bool sgn){
    if(sgn) return (3 * ((bls[i][1] + n - 1) / n));
    ll res = 3 * (bls[i][1] / (n + 2));
    if(bls[i][1] % (n + 2) > 2) res += 3;
    else res += bls[i][1] % (n + 2);
    return res; 
}
void clcO(ll i , ll sgn){
    if(sgn == bls[i][0]){
        ll d = bls[i][1];
        while(d > 0) o.pb(min(n , d) - 1) , o.pb(sgn) , o.pb(sgn) , d -= min(n , d);
    }else{
        ll d = bls[i][1];
        while(d > 3) o.pb(min(n + 2 , d) - 3) , o.pb(bls[i][0]) , o.pb(sgn) , d -= min(n + 2 , d);
        for(ll j = 0 ; j < d ; j++) o.pb(bls[i][0]);
    }
}
void f(){
    ord.insert({0 , 0});
    for(ll i = 1 ; i < n ; i++) ord.insert({3 , i}) , infs[i] = 3;
    ll len = (1ll * bls.size());
    for(ll i = 0 ; i < len ; i++){
        ll d = clc(i , 1) - clc(i , 0);
        arr(2) itr = (*ord.find({infs[bls[i][0]] , bls[i][0]}));
        ord.erase(itr);

        infs[bls[i][0]] += d;
        itr[0] += d;
        ord.insert(itr);
        mns[i][0] = (*ord.bg())[1] , mns[i][1] = (*ord.bg())[0];
        if(itr[0] > mns[i][1] + 3){
            ord.erase(itr);
            itr[0] = mns[i][1] + 3;
            infs[bls[i][0]] = mns[i][1] + 3;
            ord.insert(itr);
        }
    }
    ll e = mns[len - 1][0] , sz = mns[len - 1][1];
    for(ll i = len - 1 ; i >= 0 ; i--){
        clcO(i , e);
        if(i == 0){
            if(e != 0) o.pb(0) , o.pb(e) , o.pb(0);
        }else{
            ll d = 0;
            if(bls[i][0] == e) d = clc(i , 1) - clc(i , 0);
            if(mns[i - 1][1] + 3 + d == sz) o.pb(0) , o.pb(e) , o.pb(mns[i - 1][0]) , e = mns[i - 1][0] , sz = mns[i - 1][1];
            else sz -= d;
        }
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll e = 0;
    cin >> n >> m;
    for(ll i = 0 ; i < m ;){
        ll d;
        cin >> d;
        if(d != e) add(d , 1) , i++;
        else{
            ll d1 , d2;
            cin >> d1 >> d2;
            if(d1 != e and d2 == 0) e = d1;
            else if(d1 == e) add(e , d2 + 1);
            else add(d1 , d2 + 3);
            i += 3;
        }
    }
    f();
    cout << (1ll * o.size()) << endl;
    for(ll i = (1ll * o.size()) - 1 ; i >= 0 ; i--) cout << o[i] << " ";
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 14 ms 4084 KB Output is correct
7 Correct 98 ms 13356 KB Output is correct
8 Correct 128 ms 21496 KB Output is correct
9 Correct 245 ms 49068 KB Output is correct
10 Correct 96 ms 12612 KB Output is correct
11 Correct 82 ms 12344 KB Output is correct
12 Correct 250 ms 33080 KB Output is correct
13 Correct 217 ms 25304 KB Output is correct
14 Correct 143 ms 14784 KB Output is correct
15 Correct 73 ms 7552 KB Output is correct
16 Correct 208 ms 24992 KB Output is correct
17 Correct 295 ms 32748 KB Output is correct
18 Correct 438 ms 39260 KB Output is correct
19 Correct 1492 ms 115224 KB Output is correct
20 Correct 1649 ms 113784 KB Output is correct