oj.uz

Submission #391956

# Submission time Handle Problem Language Result Execution time Memory
391956 2021-04-20T08:44:35 Z MrDomino Painting Walls (APIO20_paint) C++14
0 / 100
 1500 ms 6500 KB 
#include <bits/stdc++.h>
#include "paint.h"

using namespace std;

int sum(int a, int b) {
  return a * b;
}

const int INF = (int) 1e9;

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> sizes, vector<vector<int>> b) {
  vector<int> can(n, 0);
  vector<vector<int>> guys(k);
  for (int i = 0; i < m; i++) {
    for (auto &j : b[i]) {
      guys[j].push_back(i);
    }
  }
  deque<int> dq;

  for (int raz = 0; raz < m; raz++) {
    vector<int> acum(n, 0);

    for (int i = 0; i + m - 1 < n; i++) {
      acum[i] = 1;
    }

    for (int sum = 0; sum <= n; sum++) {
      for (int j = 0; j < m && j <= sum; j++) {
        int i = sum - j;
        if (0 <= i && i + m - 1 < n) {

        } else {
          continue;
        }
        assert(0 <= i && i + m - 1 < n);
        bool ok = 0;
        for (auto &x : guys[c[i + j]]) {
          if (x == (raz + j) % m) {
            ok = 1;
            break;
          }
        }
        if (!ok) {
          acum[i] = 0;
          break;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      can[i] |= acum[i];
    }
  }

  { /// shift can by 1
    reverse(can.begin(), can.end());
    can.push_back(0);
    reverse(can.begin(), can.end());
  }
  vector<int> dp(n + 1, INF);
  dp[0] = 0;
  dq.clear();
  dq.push_back(0);
  for (int i = m; i <= n; i++) {
    /// finish at position i => I've started at position i-k+1
    int start = i - m + 1;
    if (!can[start]) {
      continue;
    }
    while (!dq.empty() && dq.front() < start - 1) {
      dq.pop_front();
    }
    while (!dq.empty() && dp[i] <= dp[dq.back()]) {
      dq.pop_back();
    }
    if (!dq.empty()) {
      dp[i] = dp[dq.front()] + 1;
    }
    dq.push_back(i);
  }
  if (dp[n] == INF) {
    dp[n] = -1;
  }
  return dp[n];
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 8 ms 2636 KB Output is correct
14 Correct 8 ms 2704 KB Output is correct
15 Correct 8 ms 2704 KB Output is correct
16 Correct 8 ms 2696 KB Output is correct
17 Correct 8 ms 2636 KB Output is correct
18 Correct 8 ms 2700 KB Output is correct
19 Correct 8 ms 2712 KB Output is correct
20 Correct 8 ms 2712 KB Output is correct
21 Correct 7 ms 2636 KB Output is correct
22 Correct 29 ms 6480 KB Output is correct
23 Correct 29 ms 6476 KB Output is correct
24 Correct 30 ms 6500 KB Output is correct
25 Correct 3 ms 588 KB Output is correct
26 Correct 3 ms 588 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 4 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Execution timed out 1583 ms 3788 KB Time limit exceeded
32 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 8 ms 2636 KB Output is correct
14 Correct 8 ms 2704 KB Output is correct
15 Correct 8 ms 2704 KB Output is correct
16 Correct 8 ms 2696 KB Output is correct
17 Correct 8 ms 2636 KB Output is correct
18 Correct 8 ms 2700 KB Output is correct
19 Correct 8 ms 2712 KB Output is correct
20 Correct 8 ms 2712 KB Output is correct
21 Correct 7 ms 2636 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 4 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 5 ms 2252 KB Output is correct
34 Correct 5 ms 1740 KB Output is correct
35 Correct 3 ms 1612 KB Output is correct
36 Correct 5 ms 2636 KB Output is correct
37 Correct 6 ms 2124 KB Output is correct
38 Correct 2 ms 2380 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 5 ms 2124 KB Output is correct
41 Correct 4 ms 332 KB Output is correct
42 Correct 3 ms 2508 KB Output is correct
43 Incorrect 2 ms 2380 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 8 ms 2636 KB Output is correct
16 Correct 8 ms 2704 KB Output is correct
17 Correct 8 ms 2704 KB Output is correct
18 Correct 8 ms 2696 KB Output is correct
19 Correct 8 ms 2636 KB Output is correct
20 Correct 8 ms 2700 KB Output is correct
21 Correct 8 ms 2712 KB Output is correct
22 Correct 8 ms 2712 KB Output is correct
23 Correct 7 ms 2636 KB Output is correct
24 Correct 29 ms 6480 KB Output is correct
25 Correct 29 ms 6476 KB Output is correct
26 Correct 30 ms 6500 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 4 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 5 ms 2252 KB Output is correct
37 Correct 5 ms 1740 KB Output is correct
38 Correct 3 ms 1612 KB Output is correct
39 Correct 5 ms 2636 KB Output is correct
40 Correct 6 ms 2124 KB Output is correct
41 Correct 2 ms 2380 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 5 ms 2124 KB Output is correct
44 Correct 4 ms 332 KB Output is correct
45 Correct 3 ms 2508 KB Output is correct
46 Incorrect 2 ms 2380 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 8 ms 2636 KB Output is correct
16 Correct 8 ms 2704 KB Output is correct
17 Correct 8 ms 2704 KB Output is correct
18 Correct 8 ms 2696 KB Output is correct
19 Correct 8 ms 2636 KB Output is correct
20 Correct 8 ms 2700 KB Output is correct
21 Correct 8 ms 2712 KB Output is correct
22 Correct 8 ms 2712 KB Output is correct
23 Correct 7 ms 2636 KB Output is correct
24 Correct 29 ms 6480 KB Output is correct
25 Correct 29 ms 6476 KB Output is correct
26 Correct 30 ms 6500 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 3 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 4 ms 588 KB Output is correct
33 Execution timed out 1583 ms 3788 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 8 ms 2636 KB Output is correct
16 Correct 8 ms 2704 KB Output is correct
17 Correct 8 ms 2704 KB Output is correct
18 Correct 8 ms 2696 KB Output is correct
19 Correct 8 ms 2636 KB Output is correct
20 Correct 8 ms 2700 KB Output is correct
21 Correct 8 ms 2712 KB Output is correct
22 Correct 8 ms 2712 KB Output is correct
23 Correct 7 ms 2636 KB Output is correct
24 Correct 29 ms 6480 KB Output is correct
25 Correct 29 ms 6476 KB Output is correct
26 Correct 30 ms 6500 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 3 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 4 ms 588 KB Output is correct
33 Execution timed out 1583 ms 3788 KB Time limit exceeded
34 Halted 0 ms 0 KB -