oj.uz

Submission #744888

# Submission time Handle Problem Language Result Execution time Memory
744888 2023-05-19T07:38:30 Z arush_agu Painting Walls (APIO20_paint) C++17
28 / 100
 184 ms 524288 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

int minimumInstructions(int n, int m, int k, vi c, vi a, vvi b) {
  vvi bb(m, vi(k));
  for (int i=0; i<m; i++) {
    for (int col : b[i]) bb[i][col] = 1;
  }

  vvi by_col(k); for (int i=0; i<m; i++) for (int col : b[i]) by_col[col].push_back(i);

  vb poss(n);
  for (int st=0; st+m<=n; st++) {
    for (int cont : by_col[c[st]]) {
      bool f = 1;
      int cont_id = cont;
      for (int j=st; j<st+m; j++) {
        if (!bb[cont_id][c[j]]) {
          f = 0;
          break;
        }

        cont_id = (cont_id + 1) % m;
      }

      if (f) {
        poss[st] = 1;
        break;
      }
    }
  }

  vb can(n); for (int i=0; i<n; i++) if (poss[i]) {
    for (int j=i; j<i+m; j++) can[j] = 1;
  }
  for (int i=0; i<n; i++) if (!can[i]) {
    return -1;
  }

  int ans = 0;
  int idx = 0;
  while (idx < n) {
    ans++;
    while (!poss[idx]) idx--;
    idx += m;
  }

  return ans;
}

#ifdef DEBUG
void solve() {
  int n, m, k; cin >> n >> m >> k;
  vi c(n); for (int &x : c) cin >> x;
  vi a(m); vvi b(m);
  for (int i=0; i<m; i++) {
    cin >> a[i];
    for (int j=0; j<a[i]; j++) {
      int x; cin >> x;
      b[i].push_back(x);
    }
  }

  cerr << n << " " << m << " " << k << "\n";
  cerr << c << "\n";
  cerr << a << "\n";
  cerr << b << "\n";

  cout << minimumInstructions(n, m, k, c, a, b) << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  /* cin >> test_cases; */

  while (test_cases--)
    solve();

  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
  return 0;
}
#endif

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 35 ms 81156 KB Output is correct
14 Correct 35 ms 81180 KB Output is correct
15 Correct 34 ms 81196 KB Output is correct
16 Correct 43 ms 81140 KB Output is correct
17 Correct 40 ms 81144 KB Output is correct
18 Correct 37 ms 81228 KB Output is correct
19 Correct 33 ms 80452 KB Output is correct
20 Correct 34 ms 80076 KB Output is correct
21 Correct 33 ms 80836 KB Output is correct
22 Correct 50 ms 85128 KB Output is correct
23 Correct 50 ms 85124 KB Output is correct
24 Correct 53 ms 85176 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 352 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Runtime error 184 ms 524288 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 35 ms 81156 KB Output is correct
14 Correct 35 ms 81180 KB Output is correct
15 Correct 34 ms 81196 KB Output is correct
16 Correct 43 ms 81140 KB Output is correct
17 Correct 40 ms 81144 KB Output is correct
18 Correct 37 ms 81228 KB Output is correct
19 Correct 33 ms 80452 KB Output is correct
20 Correct 34 ms 80076 KB Output is correct
21 Correct 33 ms 80836 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 24 ms 55812 KB Output is correct
34 Correct 19 ms 42712 KB Output is correct
35 Correct 13 ms 30064 KB Output is correct
36 Correct 26 ms 62168 KB Output is correct
37 Correct 24 ms 57224 KB Output is correct
38 Correct 2 ms 3708 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 24 ms 50696 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 19 ms 33476 KB Output is correct
43 Correct 10 ms 21868 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 33 ms 81208 KB Output is correct
51 Correct 33 ms 81204 KB Output is correct
52 Correct 33 ms 81224 KB Output is correct
53 Correct 35 ms 81248 KB Output is correct
54 Correct 38 ms 81148 KB Output is correct
55 Correct 36 ms 81196 KB Output is correct
56 Correct 32 ms 81204 KB Output is correct
57 Correct 1 ms 724 KB Output is correct
58 Correct 33 ms 80076 KB Output is correct
59 Correct 1 ms 724 KB Output is correct
60 Correct 35 ms 81272 KB Output is correct
61 Correct 1 ms 724 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 35 ms 81156 KB Output is correct
16 Correct 35 ms 81180 KB Output is correct
17 Correct 34 ms 81196 KB Output is correct
18 Correct 43 ms 81140 KB Output is correct
19 Correct 40 ms 81144 KB Output is correct
20 Correct 37 ms 81228 KB Output is correct
21 Correct 33 ms 80452 KB Output is correct
22 Correct 34 ms 80076 KB Output is correct
23 Correct 33 ms 80836 KB Output is correct
24 Correct 50 ms 85128 KB Output is correct
25 Correct 50 ms 85124 KB Output is correct
26 Correct 53 ms 85176 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 24 ms 55812 KB Output is correct
37 Correct 19 ms 42712 KB Output is correct
38 Correct 13 ms 30064 KB Output is correct
39 Correct 26 ms 62168 KB Output is correct
40 Correct 24 ms 57224 KB Output is correct
41 Correct 2 ms 3708 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 24 ms 50696 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 19 ms 33476 KB Output is correct
46 Correct 10 ms 21868 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 33 ms 81208 KB Output is correct
54 Correct 33 ms 81204 KB Output is correct
55 Correct 33 ms 81224 KB Output is correct
56 Correct 35 ms 81248 KB Output is correct
57 Correct 38 ms 81148 KB Output is correct
58 Correct 36 ms 81196 KB Output is correct
59 Correct 32 ms 81204 KB Output is correct
60 Correct 1 ms 724 KB Output is correct
61 Correct 33 ms 80076 KB Output is correct
62 Correct 1 ms 724 KB Output is correct
63 Correct 35 ms 81272 KB Output is correct
64 Correct 1 ms 724 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 32 ms 63588 KB Output is correct
71 Correct 20 ms 43508 KB Output is correct
72 Correct 10 ms 20076 KB Output is correct
73 Correct 4 ms 6464 KB Output is correct
74 Correct 17 ms 35740 KB Output is correct
75 Correct 31 ms 74656 KB Output is correct
76 Correct 33 ms 36008 KB Output is correct
77 Correct 18 ms 6408 KB Output is correct
78 Correct 31 ms 18520 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 1 ms 340 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 37 ms 81392 KB Output is correct
85 Correct 34 ms 81448 KB Output is correct
86 Correct 36 ms 81396 KB Output is correct
87 Correct 35 ms 81348 KB Output is correct
88 Correct 39 ms 81308 KB Output is correct
89 Correct 37 ms 81380 KB Output is correct
90 Correct 57 ms 84900 KB Output is correct
91 Correct 58 ms 84844 KB Output is correct
92 Correct 58 ms 84880 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 35 ms 81156 KB Output is correct
16 Correct 35 ms 81180 KB Output is correct
17 Correct 34 ms 81196 KB Output is correct
18 Correct 43 ms 81140 KB Output is correct
19 Correct 40 ms 81144 KB Output is correct
20 Correct 37 ms 81228 KB Output is correct
21 Correct 33 ms 80452 KB Output is correct
22 Correct 34 ms 80076 KB Output is correct
23 Correct 33 ms 80836 KB Output is correct
24 Correct 50 ms 85128 KB Output is correct
25 Correct 50 ms 85124 KB Output is correct
26 Correct 53 ms 85176 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Runtime error 184 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 35 ms 81156 KB Output is correct
16 Correct 35 ms 81180 KB Output is correct
17 Correct 34 ms 81196 KB Output is correct
18 Correct 43 ms 81140 KB Output is correct
19 Correct 40 ms 81144 KB Output is correct
20 Correct 37 ms 81228 KB Output is correct
21 Correct 33 ms 80452 KB Output is correct
22 Correct 34 ms 80076 KB Output is correct
23 Correct 33 ms 80836 KB Output is correct
24 Correct 50 ms 85128 KB Output is correct
25 Correct 50 ms 85124 KB Output is correct
26 Correct 53 ms 85176 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Runtime error 184 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -