Submission #1158459

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158459		omtheprogrammer1	Paint By Numbers (IOI16_paint)	C++20	100 / 100	472 ms	164164 KiB

paint

#include <bits/stdc++.h>
#include "paint.h"

using namespace std;

#define endl "\n"
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define mp make_pair
#define pb push_back
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define ins insert
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define sz(v) (ll)v.size()
#define readgraph(list, edges) for (ll i = 0; i < edges; i++) {ll a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define F_OR(i, a, b, s) for (ll i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

ll prexor(ll i) {
  i++;
  if ((i % 4) == 0) return 0;
  else if ((i % 4) == 1) return i - 1;
  else if ((i % 4) == 2) return 1;
  else return i;
}
ll rangexor(ll l, ll r) {
  if (l == 0) return prexor(r);
  return prexor(r)^prexor(l - 1);
}
ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb) / 2;
    f(mb) ? rb = mb : lb = mb + 1;
  }
  return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb + 1) / 2;
    f(mb) ? lb = mb : rb = mb - 1;
  }
  return lb;
}

template<class A> void read(vector<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) {
  cin >> x;
}
void read(double& d) {
  string t;
  read(t);
  d = stod(t);
}
void read(long double& d) {
  string t;
  read(t);
  d = stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
  read(h);
  read(t...);
}
template<class A> void read(vector<A>& x) {
  EACH(a, x)
  read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
  EACH(a, x)
  read(a);
}

// #define cerr cout
namespace __DEBUG_UTIL__
{
/* Primitive Datatypes Print */
void print(const char *x) { cerr << x; }
void print(bool x) { cerr << (x ? "T" : "F"); }
void print(char x) { cerr << '\'' << x << '\''; }
void print(signed short int x) { cerr << x; }
void print(unsigned short int x) { cerr << x; }
void print(signed int x) { cerr << x; }
void print(unsigned int x) { cerr << x; }
void print(signed long int x) { cerr << x; }
void print(unsigned long int x) { cerr << x; }
void print(signed long long int x) { cerr << x; }
void print(unsigned long long int x) { cerr << x; }
void print(float x) { cerr << x; }
void print(double x) { cerr << x; }
void print(long double x) { cerr << x; }
void print(string x) { cerr << '\"' << x << '\"'; }
template <size_t N>
void print(bitset<N> x) { cerr << x; }
void print(vector<bool> v)
{ /* Overloaded this because stl optimizes vector<bool> by using
      _Bit_reference instead of bool to conserve space. */
  int f = 0;
  cerr << '{';
  for (auto && i : v)
    cerr << (f++ ? "," : "") << (i ? "T" : "F");
  cerr << "}";
}
/* Templates Declarations to support nested datatypes */
template <typename T>
void print(T &&x);
template <typename T>
void print(vector<vector<T>> mat);
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M]);
template <typename F, typename S>
void print(pair<F, S> x);
template <typename T, size_t N>
struct Tuple;
template <typename T>
struct Tuple<T, 1>;
template <typename... Args>
void print(tuple<Args...> t);
template <typename... T>
void print(priority_queue<T...> pq);
template <typename T>
void print(stack<T> st);
template <typename T>
void print(queue<T> q);
/* Template Datatypes Definitions */
template <typename T>
void print(T &&x)
{
  /*  This works for every container that supports range-based loop
      i.e. vector, set, map, oset, omap, dequeue */
  int f = 0;
  cerr << '{';
  for (auto && i : x)
    cerr << (f++ ? "," : ""), print(i);
  cerr << "}";
}
template <typename T>
void print(vector<vector<T>> mat)
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M])
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename F, typename S>
void print(pair<F, S> x)
{
  cerr << '(';
  print(x.first);
  cerr << ',';
  print(x.second);
  cerr << ')';
}
template <typename T, size_t N>
struct Tuple
{
  static void printTuple(T t)
  {
    Tuple < T, N - 1 >::printTuple(t);
    cerr << ",", print(get < N - 1 > (t));
  }
};
template <typename T>
struct Tuple<T, 1>
{
  static void printTuple(T t) { print(get<0>(t)); }
};
template <typename... Args>
void print(tuple<Args...> t)
{
  cerr << "(";
  Tuple<decltype(t), sizeof...(Args)>::printTuple(t);
  cerr << ")";
}
template <typename... T>
void print(priority_queue<T...> pq)
{
  int f = 0;
  cerr << '{';
  while (!pq.empty())
    cerr << (f++ ? "," : ""), print(pq.top()), pq.pop();
  cerr << "}";
}
template <typename T>
void print(stack<T> st)
{
  int f = 0;
  cerr << '{';
  while (!st.empty())
    cerr << (f++ ? "," : ""), print(st.top()), st.pop();
  cerr << "}";
}
template <typename T>
void print(queue<T> q)
{
  int f = 0;
  cerr << '{';
  while (!q.empty())
    cerr << (f++ ? "," : ""), print(q.front()), q.pop();
  cerr << "}";
}
/* Printer functions */
void printer(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail)
{
  /* Using && to capture both lvalues and rvalues */
  int i = 0;
  for (size_t bracket = 0; names[i] != '\0' and (names[i] != ',' or bracket != 0); i++)
    if (names[i] == '(' or names[i] == '<' or names[i] == '{')
      bracket++;
    else if (names[i] == ')' or names[i] == '>' or names[i] == '}')
      bracket--;
  cerr.write(names, i) << " = ";
  print(head);
  if (sizeof...(tail))
    cerr << " ||", printer(names + i + 1, tail...);
  else
    cerr << "]\n";
}
/* PrinterArr */
void printerArr(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printerArr(const char *names, T arr[], size_t N, V... tail)
{
  size_t ind = 0;
  for (; names[ind] and names[ind] != ','; ind++)
    cerr << names[ind];
  for (ind++; names[ind] and names[ind] != ','; ind++)
    ;
  cerr << " = {";
  for (size_t i = 0; i < N; i++)
    cerr << (i ? "," : ""), print(arr[i]);
  cerr << "}";
  if (sizeof...(tail))
    cerr << " ||", printerArr(names + ind + 1, tail...);
  else
    cerr << "]\n";
}
}

#define debug(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printer(#__VA_ARGS__, __VA_ARGS__);
#define debugArr(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printerArr(#__VA_ARGS__, __VA_ARGS__);


mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
  return uniform_int_distribution<ll>(a, b)(mt_rng);
}
/*--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/

const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e17;
const int d4i[4] = { -1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = { -1, -1, 0, 1, 1, 1, 0, -1}, d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int kni[8] = { +2, +2, -2, -2, 1, -1, 1, -1}, knj[8] = {1, -1, 1, -1, 2, 2, -2, -2};

int n, m, k, q, l, r, x, y, z , h;
const int tas = 2e5 + 10;
int a[tas];
int ca[tas];
int cb[tas];
int dp[tas][102];
int rdp[tas][102];
int rd1[102];
int prex[tas];
int prew[tas];
string s, t;
// vector<int> grid[tas];
// vector<pii> edges[tas];
int ans = 0;

void add(int l, int r) {
  cb[r + 1] += -1;
  cb[l] += 1;
}

void keep(int i, int j, int val) {
  if (i < -1) return;
  if (i >= 0) rdp[i][j] |= val;
  else {
    rd1[j] |= val;
  }
}

bool checkx(int l, int r) {
  // debug(l, r)
  return ((prex[r] - (l ? prex[l - 1] : 0)) == 0);
}

bool checkw(int l, int r) {
  // debug(l, r)
  return ((prew[r] - (l ? prew[l - 1] : 0)) == 0);
}

int get(int i, int j) {
  // debug(i, j)
  // return 1;
  if (i == -1) {
    return rd1[j];
  }
  else {
    return rdp[i][j];
  }
}

string solve_puzzle(string s, vector<int> c) {
  n = sz(s);
  k = sz(c);
  string ans;
  // debug(n)
  FOR(n) prex[i] = (s[i] == 'X');
  FOR(n) prew[i] = (s[i] == '_');
  FOR(i, 1, n) prew[i] += prew[i - 1], prex[i] += prex[i - 1];
  FOR(n + 1) FOR(j, 0, k + 1) dp[i][j] = 0;
  dp[0][0] = 1;
  FOR(n) FOR(j, 0, k + 1) {
    // debug(i, j, dp[i][j])
    if (s[i] != 'X') {
      dp[i + 1][j] |= dp[i][j];
    }
    if (s[i] != '_') {
      if (j != k && (i + c[j]) <= n && checkw(i, i + c[j] - 1)) {
        bool can = 1;
        if (i + c[j] < n) can &= checkx(i + c[j], i + c[j]);
        if (can) {
          dp[i + c[j] + 1][j + 1] |= dp[i][j];
        }
      }
    }
  }
  FOR(n + 1) FOR(j, 0, k + 1) rdp[i][j] = 0;
  rdp[n - 1][k] = 1;
  FOR(i, n - 1, -1, -1) FOR(j, 0, k + 1) {
    if (s[i] != 'X') {
      keep(i - 1, j, rdp[i][j]);
    }
    if (s[i] != '_') {
      if (j != 0 && (i - c[j - 1]) >= -1 && checkw(i - c[j - 1] + 1,i)) {
        bool can = 1;
        if (i - c[j - 1] >= 0)can &= checkx(i - c[j - 1], i - c[j - 1]);
        if (can) keep(i - c[j - 1] - 1, j - 1, rdp[i][j]);
      }
    }
  }
  // debug(get(n - 2, 0))
  FOR(n) {
    if (s[i] == '.') {
      FOR(j, 0, k + 1) {
        ca[i] |= dp[i + 1][j] & get(i - 1, j);
        if (i == n - 1) {
          // debug(dp[i + 1][j], j)
        }
      }
      // debug(ca[n - 1])
      // debug(i, ca[i])
    }
  }
  FOR(k) {
    for (int l = 0; l + c[i] <= n; l++) {
      // debug(l + c[i] - 1)
      if (dp[l][i] && get(l + c[i] - 1, i + 1) && checkw(l, l + c[i] - 1)) {
        add(l, l + c[i] - 1);
      }
    }
  }
  FOR(i, 1, n) {
    // debug(i)
    cb[i] += cb[i - 1];
  }
  FOR(n) {
    // debug(i)
    if (s[i] != '.') {
      ans += s[i];
    }
    else {
      // debug(i)
      // debug(i, ca[i], cb[i])
      if (ca[i] && cb[i]) ans += "?";
      else if (ca[i]) ans += "_";
      else if (cb[i]) ans += "X";
    }
  }
  return ans;
}

// void solve(int tc = 0) {

//   cin >> k;
//   vector<int> vec;
//   FOR(k) cin >> a[i], vec.pb(a[i]);
//   cin >> s;
//   // debug(s)
//   solve_puzzle(s, vec);
// }


// int main() {
//   fastio

// #ifdef LOCAL
//   auto begin = std::chrono::high_resolution_clock::now();
//   freopen("input.txt", "r", stdin);
//   freopen("output.txt", "w", stdout);
//   freopen("error.txt", "w", stderr);
// #endif

//   ll tc = 1;
//   // cin >> tc;
//   for (int t = 0; t < tc; t++) solve(t);
// #ifdef LOCAL
//   auto end = std::chrono::high_resolution_clock::now();
//   auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
//   // cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
// #endif
// }

Compilation message (stderr)

paint.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
paint_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 7 / 7
• Subtask 2: 3 / 3
• Subtask 3: 22 / 22
• Subtask 4: 27 / 27
• Subtask 5: 21 / 21
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10