oj.uz

Submission #1061236

# Submission time Handle Problem Language Result Execution time Memory
1061236 2024-08-16T07:25:43 Z GrindMachine Lamps (JOI19_lamps) C++17
100 / 100
 221 ms 49612 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read some solutions a long time ago, remember some key ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n; cin >> n;
    vector<int> a(n+5), b(n+5);
    rep1(i,n){
        char ch; cin >> ch;
        a[i] = ch-'0';
    }
    rep1(i,n){
        char ch; cin >> ch;
        b[i] = ch-'0';
    }

    int m = 10;
    int c[m][m];
    
    auto get = [&](int x){
        vector<int> v = {-1};
        if(x == 1) v.pb(0);
        if(x == 2) v.pb(1);
        if(x == 3) v.pb(2);
        if(x == 4) v.pb(0), v.pb(1);
        if(x == 5) v.pb(0), v.pb(2);
        if(x == 6) v.pb(1), v.pb(0);
        if(x == 7) v.pb(1), v.pb(2);
        if(x == 8) v.pb(2), v.pb(0);
        if(x == 9) v.pb(2), v.pb(1);
        return v;
    };

    rep(x,m){
        rep(y,m){
            auto v1 = get(x), v2 = get(y);
            int dp[sz(v1)][sz(v2)];
            memset(dp,0,sizeof dp);
            rep1(i,sz(v1)-1){
                rep1(j,sz(v2)-1){
                    dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
                    if(v1[i] == v2[j]){
                        amax(dp[i][j],dp[i-1][j-1]+1);
                    }
                }
            }

            int lcs = dp[sz(v1)-1][sz(v2)-1];
            c[x][y] = sz(v2)-lcs-1;
        }
    }

    int fv[m][2];

    rep(j,m){
        rep(k,2){
            int x = k;
            if(j == 1) x = 0;
            if(j == 2) x = 1;
            if(j == 3) x ^= 1;
            if(j == 4) x = 0, x = 1;
            if(j == 5) x = 0, x ^= 1;
            if(j == 6) x = 1, x = 0;
            if(j == 7) x = 1, x ^= 1;
            if(j == 8) x ^= 1, x = 0;
            if(j == 9) x ^= 1, x = 1;

            fv[j][k] = x;
        }
    }

    int dp[n+5][m];
    memset(dp,0x3f,sizeof dp);
    dp[1][0] = 0;

    rep1(i,n){
        rep(j,m){
            rep(k,m){
                int v = fv[k][a[i]];
                if(v == b[i]){
                    amin(dp[i+1][k],dp[i][j]+c[j][k]);
                }
            }
        }
    }

    int ans = inf1;
    rep(j,m) amin(ans,dp[n+1][j]);

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 452 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 452 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 552 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 404 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 165 ms 49364 KB Output is correct
8 Correct 151 ms 49364 KB Output is correct
9 Correct 180 ms 49368 KB Output is correct
10 Correct 169 ms 49380 KB Output is correct
11 Correct 152 ms 49244 KB Output is correct
12 Correct 202 ms 49232 KB Output is correct
13 Correct 164 ms 49232 KB Output is correct
14 Correct 161 ms 49140 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 452 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 552 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 404 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 165 ms 49364 KB Output is correct
66 Correct 151 ms 49364 KB Output is correct
67 Correct 180 ms 49368 KB Output is correct
68 Correct 169 ms 49380 KB Output is correct
69 Correct 152 ms 49244 KB Output is correct
70 Correct 202 ms 49232 KB Output is correct
71 Correct 164 ms 49232 KB Output is correct
72 Correct 161 ms 49140 KB Output is correct
73 Correct 164 ms 49372 KB Output is correct
74 Correct 176 ms 49492 KB Output is correct
75 Correct 158 ms 49612 KB Output is correct
76 Correct 161 ms 49232 KB Output is correct
77 Correct 148 ms 49232 KB Output is correct
78 Correct 128 ms 49240 KB Output is correct
79 Correct 128 ms 49372 KB Output is correct
80 Correct 125 ms 49376 KB Output is correct
81 Correct 181 ms 49372 KB Output is correct
82 Correct 148 ms 49244 KB Output is correct
83 Correct 200 ms 49372 KB Output is correct
84 Correct 136 ms 49372 KB Output is correct
85 Correct 156 ms 49352 KB Output is correct
86 Correct 221 ms 49344 KB Output is correct
87 Correct 191 ms 49236 KB Output is correct
88 Correct 161 ms 49344 KB Output is correct
89 Correct 137 ms 49236 KB Output is correct
90 Correct 173 ms 49236 KB Output is correct
91 Correct 196 ms 49368 KB Output is correct
92 Correct 154 ms 49136 KB Output is correct
93 Correct 144 ms 49236 KB Output is correct
94 Correct 154 ms 49264 KB Output is correct
95 Correct 137 ms 49236 KB Output is correct
96 Correct 159 ms 49240 KB Output is correct
97 Correct 148 ms 49232 KB Output is correct
98 Correct 156 ms 49236 KB Output is correct
99 Correct 173 ms 49368 KB Output is correct
100 Correct 154 ms 49240 KB Output is correct
101 Correct 161 ms 49368 KB Output is correct
102 Correct 145 ms 49208 KB Output is correct