oj.uz

답안 #744886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744886 2023-05-19T07:35:51 Z arush_agu 벽 칠하기 (APIO20_paint) C++17
28 / 100
 187 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;
  }

  vb poss(n);
  for (int st=0; st+m<=n; st++) {
    for (int cont=0; cont<m; cont++) {
      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;
}

// 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();
//
// #ifdef DEBUG
//   cerr << fixed << setprecision(10)
//        << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
//        << "s\n";
// #endif
//   return 0;
// }

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 33 ms 79232 KB Output is correct
14 Correct 32 ms 79180 KB Output is correct
15 Correct 32 ms 79212 KB Output is correct
16 Correct 33 ms 79256 KB Output is correct
17 Correct 32 ms 79180 KB Output is correct
18 Correct 32 ms 79156 KB Output is correct
19 Correct 35 ms 78404 KB Output is correct
20 Correct 33 ms 78028 KB Output is correct
21 Correct 33 ms 78772 KB Output is correct
22 Correct 43 ms 80600 KB Output is correct
23 Correct 43 ms 80588 KB Output is correct
24 Correct 41 ms 80632 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 3 ms 416 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 2 ms 416 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Runtime error 187 ms 524288 KB Execution killed with signal 9
32 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 33 ms 79232 KB Output is correct
14 Correct 32 ms 79180 KB Output is correct
15 Correct 32 ms 79212 KB Output is correct
16 Correct 33 ms 79256 KB Output is correct
17 Correct 32 ms 79180 KB Output is correct
18 Correct 32 ms 79156 KB Output is correct
19 Correct 35 ms 78404 KB Output is correct
20 Correct 33 ms 78028 KB Output is correct
21 Correct 33 ms 78772 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 23 ms 54168 KB Output is correct
34 Correct 17 ms 41400 KB Output is correct
35 Correct 13 ms 28952 KB Output is correct
36 Correct 25 ms 60244 KB Output is correct
37 Correct 23 ms 55604 KB Output is correct
38 Correct 1 ms 2004 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 22 ms 49224 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 14 ms 31572 KB Output is correct
43 Correct 9 ms 20048 KB Output is correct
44 Correct 0 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 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 33 ms 79160 KB Output is correct
51 Correct 32 ms 79156 KB Output is correct
52 Correct 33 ms 79212 KB Output is correct
53 Correct 34 ms 79180 KB Output is correct
54 Correct 32 ms 79196 KB Output is correct
55 Correct 33 ms 79268 KB Output is correct
56 Correct 33 ms 79160 KB Output is correct
57 Correct 1 ms 684 KB Output is correct
58 Correct 32 ms 78028 KB Output is correct
59 Correct 1 ms 724 KB Output is correct
60 Correct 34 ms 79176 KB Output is correct
61 Correct 1 ms 724 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 33 ms 79232 KB Output is correct
16 Correct 32 ms 79180 KB Output is correct
17 Correct 32 ms 79212 KB Output is correct
18 Correct 33 ms 79256 KB Output is correct
19 Correct 32 ms 79180 KB Output is correct
20 Correct 32 ms 79156 KB Output is correct
21 Correct 35 ms 78404 KB Output is correct
22 Correct 33 ms 78028 KB Output is correct
23 Correct 33 ms 78772 KB Output is correct
24 Correct 43 ms 80600 KB Output is correct
25 Correct 43 ms 80588 KB Output is correct
26 Correct 41 ms 80632 KB Output is correct
27 Correct 1 ms 300 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 1 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 23 ms 54168 KB Output is correct
37 Correct 17 ms 41400 KB Output is correct
38 Correct 13 ms 28952 KB Output is correct
39 Correct 25 ms 60244 KB Output is correct
40 Correct 23 ms 55604 KB Output is correct
41 Correct 1 ms 2004 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 22 ms 49224 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 14 ms 31572 KB Output is correct
46 Correct 9 ms 20048 KB Output is correct
47 Correct 0 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 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 33 ms 79160 KB Output is correct
54 Correct 32 ms 79156 KB Output is correct
55 Correct 33 ms 79212 KB Output is correct
56 Correct 34 ms 79180 KB Output is correct
57 Correct 32 ms 79196 KB Output is correct
58 Correct 33 ms 79268 KB Output is correct
59 Correct 33 ms 79160 KB Output is correct
60 Correct 1 ms 684 KB Output is correct
61 Correct 32 ms 78028 KB Output is correct
62 Correct 1 ms 724 KB Output is correct
63 Correct 34 ms 79176 KB Output is correct
64 Correct 1 ms 724 KB Output is correct
65 Correct 1 ms 300 KB Output is correct
66 Correct 1 ms 304 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 300 KB Output is correct
70 Correct 28 ms 61928 KB Output is correct
71 Correct 20 ms 42068 KB Output is correct
72 Correct 10 ms 18812 KB Output is correct
73 Correct 3 ms 5076 KB Output is correct
74 Correct 16 ms 34176 KB Output is correct
75 Correct 32 ms 72716 KB Output is correct
76 Correct 26 ms 33632 KB Output is correct
77 Correct 12 ms 3272 KB Output is correct
78 Correct 23 ms 15180 KB Output is correct
79 Correct 1 ms 292 KB Output is correct
80 Correct 1 ms 340 KB Output is correct
81 Correct 1 ms 300 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 34 ms 79436 KB Output is correct
85 Correct 36 ms 79436 KB Output is correct
86 Correct 35 ms 79448 KB Output is correct
87 Correct 34 ms 79364 KB Output is correct
88 Correct 35 ms 79408 KB Output is correct
89 Correct 35 ms 79452 KB Output is correct
90 Correct 53 ms 81332 KB Output is correct
91 Correct 47 ms 81368 KB Output is correct
92 Correct 52 ms 81320 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 33 ms 79232 KB Output is correct
16 Correct 32 ms 79180 KB Output is correct
17 Correct 32 ms 79212 KB Output is correct
18 Correct 33 ms 79256 KB Output is correct
19 Correct 32 ms 79180 KB Output is correct
20 Correct 32 ms 79156 KB Output is correct
21 Correct 35 ms 78404 KB Output is correct
22 Correct 33 ms 78028 KB Output is correct
23 Correct 33 ms 78772 KB Output is correct
24 Correct 43 ms 80600 KB Output is correct
25 Correct 43 ms 80588 KB Output is correct
26 Correct 41 ms 80632 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 3 ms 416 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 2 ms 416 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Runtime error 187 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 33 ms 79232 KB Output is correct
16 Correct 32 ms 79180 KB Output is correct
17 Correct 32 ms 79212 KB Output is correct
18 Correct 33 ms 79256 KB Output is correct
19 Correct 32 ms 79180 KB Output is correct
20 Correct 32 ms 79156 KB Output is correct
21 Correct 35 ms 78404 KB Output is correct
22 Correct 33 ms 78028 KB Output is correct
23 Correct 33 ms 78772 KB Output is correct
24 Correct 43 ms 80600 KB Output is correct
25 Correct 43 ms 80588 KB Output is correct
26 Correct 41 ms 80632 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 3 ms 416 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 2 ms 416 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Runtime error 187 ms 524288 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -