oj.uz

Submission #874000

# Submission time Handle Problem Language Result Execution time Memory
874000 2023-11-16T07:23:55 Z vjudge1 Lamps (JOI19_lamps) C++17
100 / 100
 49 ms 51468 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 1e6 + 8, M = 1e9, SQ = 500, INF = 1e9 + 8, LGN = 22, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, dp[N][3][2];
string s, t;

int32_t main(){
  fast_io;
  cin >> n >> s >> t;
  s = 'A' + s;
  t = 'A' + t;
  for (int i = 0; i <= n; ++ i){
    for (int j = 0; j < 3; ++ j){
      dp[i][j][0] = INF;
      dp[i][j][1] = INF;
    }
  }
  dp[0][2][0] = 0;
  for (int i = 1; i <= n; ++ i){
    for (int j = 0; j < 3; ++ j){
      for (int k = 0; k < 2; ++ k){
        int cur = 0;
        if (j == 2){
          cur = ((s[i] - '0') ^ k);
        }
        else {
          cur = (j ^ k);
        }
        if (cur == t[i] - '0'){
          for (int jj = 0; jj < 3; ++ jj){
            for (int kk = 0; kk < 2; ++ kk){
              int xx = 0;
              if (jj != j && j != 2){
                ++ xx;
              }
              if (k != kk && k == 1){
                ++ xx;
              }
              dp[i][j][k] = min (dp[i][j][k], dp[i-1][jj][kk] + xx);
            }
          }
        }
      }
    }
  }
  cout << min (dp[n][0][0], min (dp[n][0][1], min (dp[n][1][0], min (dp[n][1][1], min (dp[n][2][0], dp[n][2][1])))));
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

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 348 KB Output is correct
6 Correct 0 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 348 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 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 464 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 468 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 348 KB Output is correct
6 Correct 0 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 348 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 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 464 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 376 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 536 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 464 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 464 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 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 36 ms 50536 KB Output is correct
8 Correct 36 ms 50540 KB Output is correct
9 Correct 33 ms 50428 KB Output is correct
10 Correct 34 ms 50424 KB Output is correct
11 Correct 35 ms 51204 KB Output is correct
12 Correct 36 ms 50432 KB Output is correct
13 Correct 34 ms 50504 KB Output is correct
14 Correct 33 ms 50464 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 348 KB Output is correct
6 Correct 0 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 348 KB Output is correct
10 Correct 0 ms 344 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 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 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 464 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 376 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 536 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 464 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 464 KB Output is correct
61 Correct 0 ms 348 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 344 KB Output is correct
65 Correct 36 ms 50536 KB Output is correct
66 Correct 36 ms 50540 KB Output is correct
67 Correct 33 ms 50428 KB Output is correct
68 Correct 34 ms 50424 KB Output is correct
69 Correct 35 ms 51204 KB Output is correct
70 Correct 36 ms 50432 KB Output is correct
71 Correct 34 ms 50504 KB Output is correct
72 Correct 33 ms 50464 KB Output is correct
73 Correct 33 ms 51136 KB Output is correct
74 Correct 39 ms 51192 KB Output is correct
75 Correct 33 ms 51200 KB Output is correct
76 Correct 35 ms 51196 KB Output is correct
77 Correct 32 ms 51200 KB Output is correct
78 Correct 34 ms 51204 KB Output is correct
79 Correct 33 ms 51200 KB Output is correct
80 Correct 39 ms 51196 KB Output is correct
81 Correct 33 ms 51196 KB Output is correct
82 Correct 35 ms 51196 KB Output is correct
83 Correct 38 ms 51196 KB Output is correct
84 Correct 38 ms 51200 KB Output is correct
85 Correct 38 ms 51196 KB Output is correct
86 Correct 45 ms 51456 KB Output is correct
87 Correct 39 ms 51468 KB Output is correct
88 Correct 39 ms 51196 KB Output is correct
89 Correct 39 ms 51404 KB Output is correct
90 Correct 40 ms 51204 KB Output is correct
91 Correct 42 ms 51200 KB Output is correct
92 Correct 44 ms 51192 KB Output is correct
93 Correct 46 ms 51192 KB Output is correct
94 Correct 44 ms 51204 KB Output is correct
95 Correct 44 ms 51192 KB Output is correct
96 Correct 46 ms 51196 KB Output is correct
97 Correct 49 ms 51452 KB Output is correct
98 Correct 44 ms 51208 KB Output is correct
99 Correct 44 ms 51104 KB Output is correct
100 Correct 44 ms 51204 KB Output is correct
101 Correct 44 ms 51192 KB Output is correct
102 Correct 45 ms 51196 KB Output is correct