Submission #981608

#	Time	Username	Problem	Language	Result	Execution time	Memory
981608		yoav_s	Painting Walls (APIO20_paint)	C++17	63 / 100	1553 ms	410836 KiB

paint

#include <bits/stdc++.h>
using namespace std;

typedef int ll;
typedef pair<ll,ll> p;
typedef pair<ll, p> tri;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<p> vp;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<vv> vvv;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef vector<vvvp> vvvvp;
#define double long double
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;

const ll mod = 1e9 + 7;
const ll INF = 1e18;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define loop(a) for (ll i = 0; i < a; i++)
#define setmin(a, b) a = min(a, b)
#define setmax(a, b) a = max(a, b)
#define all(v) v.begin(), v.end()

#include "paint.h"

bool query(ll l, ll r, vv &st)
{
    ll n = st.size() / 2;
    l += n; r += n;
    v cur;
    bool first = false;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            if (first)
            {
                v next;
                set_intersection(all(cur),all(st[l]),back_inserter(next));
                cur = next;
            }
            else
            {
                cur = st[l];
                first = true;
            }
            l++;
        }
        if (r % 2 == 0)
        {
            if (first)
            {
                v next;
                set_intersection(all(cur),all(st[r]),back_inserter(next));
                cur = next;
            }
            else
            {
                cur = st[r];
                first = true;
            }
            r--;
        }
        l /= 2; r /= 2;
    }
    return cur.size() > 0;
}

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
    ll n = pow(2, ceil(log2(N)));
    vv validStartIndices(2 * n);
    vv appearingIn(K);
    for (ll i = 0; i < N; i++) appearingIn[C[i]].pb(i);
    for (ll i = 0; i < M; i++)
    {
        for (ll x : B[i])
        {
            for (ll y : appearingIn[x]) validStartIndices[y + n].pb((i - y + M * N) % M);
        }
    }
    for (ll i = 0; i < N; i++) sort(all(validStartIndices[i + n]));
    for (ll i = n - 1; i > 0; i--)
    {
        set_intersection(all(validStartIndices[2 * i]), all(validStartIndices[2 * i + 1]), back_inserter(validStartIndices[i]));
    }
    vb poss(N - M + 1);
    for (ll i = 0; i <= N - M; i++) poss[i] = query(i, i + M - 1, validStartIndices);
    ll res = 0;
    bool possible = true;
    ll last = 0;
    ll lastDone = 0;
    while (last < N)
    {
        ll lastFound = -1;
        for (;lastDone<=min(last, N - M);lastDone++)
        {
            if (poss[lastDone]) lastFound = lastDone;
        }
        if (lastFound == -1)
        {
            possible = false;
            break;
        }
        last = lastFound + M;
        res++;
    }
    if (!possible) return -1;
    return res;
}
/*
int main() {
  int N, M, K;
  assert(3 == scanf("%d %d %d", &N, &M, &K));
  
  vector<int> C(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &C[i]));
  }

  vector<int> A(M);
  vector<vector<int>> B(M);
  for (int i = 0; i < M; ++i) {
    assert(1 == scanf("%d", &A[i]));
    B[i].resize(A[i]);
    for (int j = 0; j < A[i]; ++j) {
      assert(1 == scanf("%d", &B[i][j]));
    }
  }

  int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
  printf("%d\n", minimum_instructions);
  
  return 0;
}
/**/

Compilation message (stderr)

paint.cpp:149:1: warning: "/*" within comment [-Wcomment]
  149 | /**/
      |  
paint.cpp:27:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   27 | const ll INF = 1e18;
      |                ^~~~

• Subtask 1: 12 / 12
• Subtask 2: 15 / 15
• Subtask 3: 13 / 13
• Subtask 4: 23 / 23
• Subtask 5: 0 / 37