oj.uz

Submission #384814

# Submission time Handle Problem Language Result Execution time Memory
384814 2021-04-02T10:53:31 Z ACmachine Lamps (JOI19_lamps) C++17
100 / 100
 413 ms 199932 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
    int n; cin >> n;
    string a, b;
    cin >> a >> b;
    vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(3, vector<int>(2, INF))); // ofc always toggle before set
    // so like last sol, maybe I won't make mistake in impl
    dp[0][2][0] = 0;
    dp[0][2][1] = 1;
    REP(i, n){
        REP(setting, 3){
            dp[i][setting][0] = min(dp[i][setting][0], dp[i][setting][1]);
            dp[i][setting][1] = min(dp[i][setting][1], dp[i][setting][0] + 1); // like in the prev sol, swap / no swap
            REP(swapping, 2){
                // setting has priority
                int curr = a[i] - '0';
                int oth = b[i] - '0';
                // not keep setting
                if((curr ^ swapping) == oth){
                    dp[i + 1][2][swapping] = min(dp[i + 1][2][swapping], dp[i][setting][swapping]);
                }
                // keep setting
                int ncurr = curr;
                if(setting != 2)
                    ncurr = setting;
                if((ncurr ^ swapping) == oth){
                    dp[i + 1][setting][swapping] = min(dp[i + 1][setting][swapping], dp[i][setting][swapping]);
                }
                // set to something because not equal
                dp[i + 1][oth ^ swapping][swapping] = min(dp[i + 1][oth ^ swapping][swapping], dp[i][setting][swapping] + 1);
            }
        }
    }
    int ans = INF;
    REP(setting, 3){
        REP(swapping, 2){
            ans = min(ans, dp[n][setting][swapping]);
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
6.0 / 6.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 2 ms 364 KB Output is correct
8 Correct 2 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 2 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 1 ms 364 KB Output is correct
17 Correct 1 ms 364 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 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 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 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct

Subtask #2
41.0 / 41.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 2 ms 364 KB Output is correct
8 Correct 2 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 2 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 1 ms 364 KB Output is correct
17 Correct 1 ms 364 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 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 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 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 2 ms 748 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 2 ms 748 KB Output is correct
39 Correct 2 ms 748 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 2 ms 748 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 2 ms 748 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 2 ms 876 KB Output is correct
47 Correct 2 ms 748 KB Output is correct
48 Correct 2 ms 748 KB Output is correct
49 Correct 2 ms 748 KB Output is correct
50 Correct 3 ms 748 KB Output is correct
51 Correct 2 ms 748 KB Output is correct
52 Correct 2 ms 748 KB Output is correct
53 Correct 2 ms 748 KB Output is correct
54 Correct 2 ms 748 KB Output is correct
55 Correct 3 ms 896 KB Output is correct
56 Correct 2 ms 748 KB Output is correct
57 Correct 2 ms 748 KB Output is correct
58 Correct 2 ms 748 KB Output is correct

Subtask #3
4.0 / 4.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 376 ms 199896 KB Output is correct
8 Correct 375 ms 199740 KB Output is correct
9 Correct 361 ms 199792 KB Output is correct
10 Correct 380 ms 199868 KB Output is correct
11 Correct 363 ms 199784 KB Output is correct
12 Correct 372 ms 199884 KB Output is correct
13 Correct 372 ms 199740 KB Output is correct
14 Correct 364 ms 199872 KB Output is correct

Subtask #4
49.0 / 49.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 2 ms 364 KB Output is correct
8 Correct 2 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 2 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 1 ms 364 KB Output is correct
17 Correct 1 ms 364 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 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 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 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 2 ms 748 KB Output is correct
36 Correct 2 ms 748 KB Output is correct
37 Correct 2 ms 748 KB Output is correct
38 Correct 2 ms 748 KB Output is correct
39 Correct 2 ms 748 KB Output is correct
40 Correct 2 ms 748 KB Output is correct
41 Correct 2 ms 748 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 2 ms 748 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 2 ms 876 KB Output is correct
47 Correct 2 ms 748 KB Output is correct
48 Correct 2 ms 748 KB Output is correct
49 Correct 2 ms 748 KB Output is correct
50 Correct 3 ms 748 KB Output is correct
51 Correct 2 ms 748 KB Output is correct
52 Correct 2 ms 748 KB Output is correct
53 Correct 2 ms 748 KB Output is correct
54 Correct 2 ms 748 KB Output is correct
55 Correct 3 ms 896 KB Output is correct
56 Correct 2 ms 748 KB Output is correct
57 Correct 2 ms 748 KB Output is correct
58 Correct 2 ms 748 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 376 ms 199896 KB Output is correct
66 Correct 375 ms 199740 KB Output is correct
67 Correct 361 ms 199792 KB Output is correct
68 Correct 380 ms 199868 KB Output is correct
69 Correct 363 ms 199784 KB Output is correct
70 Correct 372 ms 199884 KB Output is correct
71 Correct 372 ms 199740 KB Output is correct
72 Correct 364 ms 199872 KB Output is correct
73 Correct 361 ms 199612 KB Output is correct
74 Correct 363 ms 199612 KB Output is correct
75 Correct 365 ms 199728 KB Output is correct
76 Correct 361 ms 199740 KB Output is correct
77 Correct 362 ms 199932 KB Output is correct
78 Correct 375 ms 199856 KB Output is correct
79 Correct 362 ms 199616 KB Output is correct
80 Correct 377 ms 199616 KB Output is correct
81 Correct 360 ms 199616 KB Output is correct
82 Correct 361 ms 199616 KB Output is correct
83 Correct 410 ms 199740 KB Output is correct
84 Correct 362 ms 199612 KB Output is correct
85 Correct 364 ms 199740 KB Output is correct
86 Correct 375 ms 199740 KB Output is correct
87 Correct 371 ms 199740 KB Output is correct
88 Correct 363 ms 199612 KB Output is correct
89 Correct 370 ms 199868 KB Output is correct
90 Correct 368 ms 199808 KB Output is correct
91 Correct 363 ms 199740 KB Output is correct
92 Correct 376 ms 199612 KB Output is correct
93 Correct 370 ms 199740 KB Output is correct
94 Correct 371 ms 199740 KB Output is correct
95 Correct 375 ms 199632 KB Output is correct
96 Correct 413 ms 199612 KB Output is correct
97 Correct 364 ms 199696 KB Output is correct
98 Correct 368 ms 199744 KB Output is correct
99 Correct 379 ms 199744 KB Output is correct
100 Correct 366 ms 199616 KB Output is correct
101 Correct 365 ms 199744 KB Output is correct
102 Correct 371 ms 199732 KB Output is correct