oj.uz

Submission #1083015

# Submission time Handle Problem Language Result Execution time Memory
1083015 2024-09-02T09:52:56 Z steveonalex Lamps (JOI19_lamps) C++17
100 / 100
 190 ms 5820 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int n;
string s1, s2;
int dp[2][16];
const int INF = 1e9 + 69;

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    vector<vector<int>> S;
    vector<int> perm(3);
    for(int i = 0; i<3; ++i) perm[i] = i;
    do{
        vector<int> cur;
        for(int i: perm){
            cur.push_back(i);
            S.push_back(cur);
        }
    } while(next_permutation(ALL(perm)));
    S.push_back({});
    remove_dup(S);

    int kost[S.size()][S.size()];
    for(int i = 0; i < (int)S.size(); ++i) for(int j = 0; j < (int)S.size(); ++j){
        vector<int> s1 = S[i], s2 = S[j];
        int x = s1.size(), y = s2.size();
        int dp[x+1][y+1];
        memset(dp, 0, sizeof dp);
        for(int i = 1; i<=x; ++i) for(int j = 1; j<=y; ++j){
            dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
            if (s1[i-1] == s2[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
        }
        kost[i][j] = s2.size() - dp[x][y];
    }

    int transition[S.size()][2];
    for(int i = 0; i < (int)S.size(); ++i) for(int j = 0; j <= 1; ++j){
        int cur =j;
        for(int k: S[i]){
            if (k == 0) cur ^= 1;
            if (k == 1) cur = 0;
            if (k == 2) cur = 1;
        }
        transition[i][j] = cur;
    }

    cin >> n;
    cin >> s1 >> s2;
    s1 = "0" + s1;
    s2 = "0" + s2;

    fill(dp[0], dp[1] + 16, INF);
    dp[0][0] = 0;
    for(int i = 1; i<=n; ++i){
        int digit1 = s1[i] - '0', digit2 = s2[i] - '0';
        for(int j = 0; j < 16; ++j) if (dp[0][j] != INF) {
            for(int k = 0; k < 16; ++k) if (transition[k][digit1] == digit2){
                minimize(dp[1][k], dp[0][j] + kost[j][k]);
            }
        }
        for(int j = 0; j < 16; ++j){
            // if (dp[1][j] != INF) cout << i << " " << j << " " << dp[1][j] << "\n";
            dp[0][j] = dp[1][j];
            dp[1][j] = INF;
        }
    }

    int ans = INF;
    for(int i = 0; i<16; ++i) minimize(ans, dp[0][i]);

    cout << ans << "\n";


    cerr << "Time elapsed: " << clock() - start << " ms\n";
    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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 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 600 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 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 468 KB Output is correct
53 Correct 1 ms 348 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 344 KB Output is correct
57 Correct 1 ms 348 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 1 ms 348 KB Output is correct
3 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 98 ms 5388 KB Output is correct
8 Correct 139 ms 5436 KB Output is correct
9 Correct 111 ms 5460 KB Output is correct
10 Correct 98 ms 5340 KB Output is correct
11 Correct 190 ms 5332 KB Output is correct
12 Correct 97 ms 5336 KB Output is correct
13 Correct 113 ms 5340 KB Output is correct
14 Correct 102 ms 5336 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 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 600 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 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 468 KB Output is correct
53 Correct 1 ms 348 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 344 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 600 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 98 ms 5388 KB Output is correct
66 Correct 139 ms 5436 KB Output is correct
67 Correct 111 ms 5460 KB Output is correct
68 Correct 98 ms 5340 KB Output is correct
69 Correct 190 ms 5332 KB Output is correct
70 Correct 97 ms 5336 KB Output is correct
71 Correct 113 ms 5340 KB Output is correct
72 Correct 102 ms 5336 KB Output is correct
73 Correct 151 ms 5340 KB Output is correct
74 Correct 125 ms 5340 KB Output is correct
75 Correct 121 ms 5552 KB Output is correct
76 Correct 101 ms 5340 KB Output is correct
77 Correct 102 ms 5340 KB Output is correct
78 Correct 147 ms 5340 KB Output is correct
79 Correct 143 ms 5548 KB Output is correct
80 Correct 147 ms 5336 KB Output is correct
81 Correct 107 ms 5820 KB Output is correct
82 Correct 112 ms 5484 KB Output is correct
83 Correct 151 ms 5336 KB Output is correct
84 Correct 174 ms 5340 KB Output is correct
85 Correct 118 ms 5336 KB Output is correct
86 Correct 121 ms 5340 KB Output is correct
87 Correct 114 ms 5336 KB Output is correct
88 Correct 176 ms 5808 KB Output is correct
89 Correct 114 ms 5512 KB Output is correct
90 Correct 118 ms 5340 KB Output is correct
91 Correct 164 ms 5500 KB Output is correct
92 Correct 137 ms 5336 KB Output is correct
93 Correct 135 ms 5336 KB Output is correct
94 Correct 155 ms 5336 KB Output is correct
95 Correct 136 ms 5340 KB Output is correct
96 Correct 140 ms 5336 KB Output is correct
97 Correct 142 ms 5336 KB Output is correct
98 Correct 141 ms 5336 KB Output is correct
99 Correct 137 ms 5336 KB Output is correct
100 Correct 134 ms 5336 KB Output is correct
101 Correct 136 ms 5356 KB Output is correct
102 Correct 137 ms 5336 KB Output is correct