oj.uz

Submission #744901

# Submission time Handle Problem Language Result Execution time Memory
744901 2023-05-19T07:50:49 Z arush_agu Painting Walls (APIO20_paint) C++17
12 / 100
 44 ms 13644 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 by_col(k); for (int i=0; i<m; i++) for (int col : b[i]) by_col[col].push_back(i);
  for (int i=0; i<n; i++) if (by_col[c[i]].empty()) return -1;

  int curr = (by_col[c[0]][0] + 1) % m;
  for (int i = 1; i < n; i++) {
    if (by_col[c[i]].empty() || by_col[c[i]][0] != curr)
      return -1;
    curr = (curr + 1) % m;
  }
  return ((n + m - 1) / m);

  

  // 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
12.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 1 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 1 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 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 18 ms 6516 KB Output is correct
23 Correct 17 ms 6528 KB Output is correct
24 Correct 17 ms 6484 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 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 7 ms 3668 KB Output is correct
32 Correct 7 ms 3668 KB Output is correct
33 Correct 7 ms 3612 KB Output is correct
34 Correct 7 ms 3668 KB Output is correct
35 Correct 7 ms 3668 KB Output is correct
36 Correct 7 ms 3668 KB Output is correct
37 Correct 21 ms 6860 KB Output is correct
38 Correct 20 ms 6776 KB Output is correct
39 Correct 20 ms 6784 KB Output is correct
40 Correct 6 ms 980 KB Output is correct
41 Correct 5 ms 724 KB Output is correct
42 Correct 7 ms 980 KB Output is correct
43 Correct 5 ms 820 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 7 ms 980 KB Output is correct
46 Correct 35 ms 11640 KB Output is correct
47 Correct 23 ms 8060 KB Output is correct
48 Correct 26 ms 10448 KB Output is correct
49 Correct 32 ms 10760 KB Output is correct
50 Correct 34 ms 10612 KB Output is correct
51 Correct 25 ms 7924 KB Output is correct
52 Correct 8 ms 1236 KB Output is correct
53 Correct 7 ms 1236 KB Output is correct
54 Correct 8 ms 1284 KB Output is correct
55 Correct 7 ms 1236 KB Output is correct
56 Correct 8 ms 1236 KB Output is correct
57 Correct 8 ms 1208 KB Output is correct
58 Correct 44 ms 13604 KB Output is correct
59 Correct 41 ms 13644 KB Output is correct
60 Correct 39 ms 13576 KB Output is correct
61 Correct 43 ms 13640 KB Output is correct
62 Correct 40 ms 13644 KB Output is correct
63 Correct 40 ms 13608 KB Output is correct
64 Correct 41 ms 12848 KB Output is correct
65 Correct 43 ms 12836 KB Output is correct
66 Correct 43 ms 12872 KB Output is correct

Subtask #2
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 1 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 1 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 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Incorrect 0 ms 212 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -