oj.uz

Submission #259777

# Submission time Handle Problem Language Result Execution time Memory
259777 2020-08-08T13:53:41 Z mkisic Lamps (JOI19_lamps) C++14
6 / 100
 237 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair
#define pb push_back

const int MAXN = 1000010;
const int inf = 2000000;

int n;

char s[MAXN], p[MAXN];

int dp[MAXN][4][4][4];

vector <pii> tmp;

void normal(vector <int> &v) {
  tmp.clear();
  REP(i, 3) tmp.pb({v[i], i});
  sort(all(tmp));
  int cnt = 1;
  REP(i, 3) {
    if (tmp[i].fi) v[tmp[i].sec] = cnt++;
  }
}

int rek(int i, vector <int> v) {
  normal(v);
  int a = v[0], b = v[1], c = v[2];
  if (i == n + 1) return 0;
  if (dp[i][a][b][c] != -1) return dp[i][a][b][c];

  int ret = inf;

  int t = s[i];

  if (b && b > c && b > a) t = 0;
  if (c && c > b && c > a) t = 1;
  if (a && a > b && a > c) {
    if (b && b > c) t = 1;
    if (c && c > b) t = 0;
    if (!b && !c) t = s[i] ^ 1;
  }

  if (a && b && c && t != p[i]) return dp[i][a][b][c] = inf;
  
  if (!a) ret = min(ret, rek(i, {3, b, c}) + 1);
  if (!b) ret = min(ret, rek(i, {a, 3, c}) + 1);
  if (!c) ret = min(ret, rek(i, {a, b, 3}) + 1);
  
  if (t == p[i]) {
    ret = min(ret, rek(i + 1, {a, b, c}));
    ret = min(ret, rek(i + 1, {0, b, c}));
    ret = min(ret, rek(i + 1, {0, 0, c}));
    ret = min(ret, rek(i + 1, {0, 0, 0}));
    ret = min(ret, rek(i + 1, {a, 0, c}));
    ret = min(ret, rek(i + 1, {a, b, 0}));
    ret = min(ret, rek(i + 1, {a, 0, 0}));
    ret = min(ret, rek(i + 1, {0, b, 0}));
  }
  return dp[i][a][b][c] = ret;
}

int main() {
  cin >> n;
  cin >> s >> p;
  REP(i, n) {
    s[i] -= '0';
    p[i] -= '0';
  }

  for (int i = n; i > 0; i--) {
    s[i] = s[i - 1];
    p[i] = p[i - 1];
  }

  memset(dp, -1, sizeof dp);
  cout << rek(1, {0, 0, 0}) << endl;

  //FOR(i, 1, n + 1) TRACE(i _ rek(i, {0, 0, 0}));

  return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 250872 KB Output is correct
2 Correct 128 ms 250744 KB Output is correct
3 Correct 127 ms 250744 KB Output is correct
4 Correct 128 ms 250744 KB Output is correct
5 Correct 128 ms 250744 KB Output is correct
6 Correct 127 ms 250824 KB Output is correct
7 Correct 128 ms 250744 KB Output is correct
8 Correct 127 ms 250744 KB Output is correct
9 Correct 128 ms 250872 KB Output is correct
10 Correct 128 ms 250744 KB Output is correct
11 Correct 128 ms 250744 KB Output is correct
12 Correct 130 ms 250808 KB Output is correct
13 Correct 137 ms 250872 KB Output is correct
14 Correct 129 ms 250872 KB Output is correct
15 Correct 129 ms 250744 KB Output is correct
16 Correct 129 ms 250744 KB Output is correct
17 Correct 128 ms 250744 KB Output is correct
18 Correct 128 ms 250848 KB Output is correct
19 Correct 127 ms 250744 KB Output is correct
20 Correct 128 ms 250744 KB Output is correct
21 Correct 131 ms 250744 KB Output is correct
22 Correct 128 ms 250872 KB Output is correct
23 Correct 127 ms 250848 KB Output is correct
24 Correct 142 ms 250744 KB Output is correct
25 Correct 127 ms 250856 KB Output is correct
26 Correct 129 ms 250744 KB Output is correct
27 Correct 127 ms 250744 KB Output is correct
28 Correct 127 ms 250744 KB Output is correct
29 Correct 131 ms 250744 KB Output is correct
30 Correct 132 ms 250744 KB Output is correct
31 Correct 128 ms 250744 KB Output is correct
32 Correct 133 ms 250744 KB Output is correct
33 Correct 140 ms 250852 KB Output is correct
34 Correct 138 ms 250832 KB Output is correct

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 250872 KB Output is correct
2 Correct 128 ms 250744 KB Output is correct
3 Correct 127 ms 250744 KB Output is correct
4 Correct 128 ms 250744 KB Output is correct
5 Correct 128 ms 250744 KB Output is correct
6 Correct 127 ms 250824 KB Output is correct
7 Correct 128 ms 250744 KB Output is correct
8 Correct 127 ms 250744 KB Output is correct
9 Correct 128 ms 250872 KB Output is correct
10 Correct 128 ms 250744 KB Output is correct
11 Correct 128 ms 250744 KB Output is correct
12 Correct 130 ms 250808 KB Output is correct
13 Correct 137 ms 250872 KB Output is correct
14 Correct 129 ms 250872 KB Output is correct
15 Correct 129 ms 250744 KB Output is correct
16 Correct 129 ms 250744 KB Output is correct
17 Correct 128 ms 250744 KB Output is correct
18 Correct 128 ms 250848 KB Output is correct
19 Correct 127 ms 250744 KB Output is correct
20 Correct 128 ms 250744 KB Output is correct
21 Correct 131 ms 250744 KB Output is correct
22 Correct 128 ms 250872 KB Output is correct
23 Correct 127 ms 250848 KB Output is correct
24 Correct 142 ms 250744 KB Output is correct
25 Correct 127 ms 250856 KB Output is correct
26 Correct 129 ms 250744 KB Output is correct
27 Correct 127 ms 250744 KB Output is correct
28 Correct 127 ms 250744 KB Output is correct
29 Correct 131 ms 250744 KB Output is correct
30 Correct 132 ms 250744 KB Output is correct
31 Correct 128 ms 250744 KB Output is correct
32 Correct 133 ms 250744 KB Output is correct
33 Correct 140 ms 250852 KB Output is correct
34 Correct 138 ms 250832 KB Output is correct
35 Correct 145 ms 251344 KB Output is correct
36 Correct 142 ms 251384 KB Output is correct
37 Correct 149 ms 251260 KB Output is correct
38 Correct 142 ms 251260 KB Output is correct
39 Correct 143 ms 251216 KB Output is correct
40 Incorrect 152 ms 251256 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 250744 KB Output is correct
2 Correct 128 ms 250872 KB Output is correct
3 Correct 128 ms 250828 KB Output is correct
4 Correct 131 ms 250872 KB Output is correct
5 Correct 128 ms 250864 KB Output is correct
6 Correct 128 ms 250744 KB Output is correct
7 Runtime error 237 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 250872 KB Output is correct
2 Correct 128 ms 250744 KB Output is correct
3 Correct 127 ms 250744 KB Output is correct
4 Correct 128 ms 250744 KB Output is correct
5 Correct 128 ms 250744 KB Output is correct
6 Correct 127 ms 250824 KB Output is correct
7 Correct 128 ms 250744 KB Output is correct
8 Correct 127 ms 250744 KB Output is correct
9 Correct 128 ms 250872 KB Output is correct
10 Correct 128 ms 250744 KB Output is correct
11 Correct 128 ms 250744 KB Output is correct
12 Correct 130 ms 250808 KB Output is correct
13 Correct 137 ms 250872 KB Output is correct
14 Correct 129 ms 250872 KB Output is correct
15 Correct 129 ms 250744 KB Output is correct
16 Correct 129 ms 250744 KB Output is correct
17 Correct 128 ms 250744 KB Output is correct
18 Correct 128 ms 250848 KB Output is correct
19 Correct 127 ms 250744 KB Output is correct
20 Correct 128 ms 250744 KB Output is correct
21 Correct 131 ms 250744 KB Output is correct
22 Correct 128 ms 250872 KB Output is correct
23 Correct 127 ms 250848 KB Output is correct
24 Correct 142 ms 250744 KB Output is correct
25 Correct 127 ms 250856 KB Output is correct
26 Correct 129 ms 250744 KB Output is correct
27 Correct 127 ms 250744 KB Output is correct
28 Correct 127 ms 250744 KB Output is correct
29 Correct 131 ms 250744 KB Output is correct
30 Correct 132 ms 250744 KB Output is correct
31 Correct 128 ms 250744 KB Output is correct
32 Correct 133 ms 250744 KB Output is correct
33 Correct 140 ms 250852 KB Output is correct
34 Correct 138 ms 250832 KB Output is correct
35 Correct 145 ms 251344 KB Output is correct
36 Correct 142 ms 251384 KB Output is correct
37 Correct 149 ms 251260 KB Output is correct
38 Correct 142 ms 251260 KB Output is correct
39 Correct 143 ms 251216 KB Output is correct
40 Incorrect 152 ms 251256 KB Output isn't correct
41 Halted 0 ms 0 KB -