Submission #469358

#	Time	Username	Problem	Language	Result	Execution time	Memory
469358		BorisBarca	Paint By Numbers (IOI16_paint)	C++14	100 / 100	775 ms	102380 KiB

paint

/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
 
using namespace std;
 
#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map
 
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC
 
const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};
 
inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}
 
inline void add(int &a, int b){
	a = sum(a, b);
}
 
inline int mul(ll a, ll b){
	return (ll)(a * b) % MOD;
}
 
inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}
 
inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}
 
inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}
 
ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}
 
inline int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}
 
 
inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}
 
void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}
 
void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}
 
string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}
 
ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 2e5 + 10;
const int K = 105;

#include "paint.h"

int n, k, ok[N][2], ans[N][2], memo[N][K];
vi C;

int mogu(int i, int l){
  return ((ok[i + l - 1][1] - (i ? ok[i - 1][1] : 0)) == l && ok[i + l][0]);
}

int dp(int i, int j){
  if (i >= n)
    return (j == k);
  int &ret = memo[i][j];
  if (~ret)
    return ret;
  ret = 0;
  if (ok[i][0]){
    if (dp(i + 1, j))
      ans[i][0]++, ret = 1;
  }

  if (j < k){
    if (i + C[j] - 1 < n && mogu(i, C[j])){
      ret = max(ret, dp(i + C[j] + 1, j + 1));
      if (dp(i + C[j] + 1, j + 1)){
        ans[i][1]++; 
        ans[i + C[j]][1]--;
        ans[i + C[j]][0]++;
      }
    }
  }
  return ret;
}

string solve_puzzle(string s, vi c){
  string ret = "";
  k = sz(c);
  n = sz(s);
  C = c;
  ok[n][0] = 1;
  REP(i, n){
    if (s[i] == '.')
      ok[i][0] = ok[i][1] = 1;
    else if (s[i] == 'X')
      ok[i][1] = 1;
    else 
      ok[i][0] = 1;
    if (i){
      ok[i][1] += ok[i - 1][1];
    }    
  }

  memset(memo, -1, sizeof memo);
  dp(0, 0);
  int tmp = 0;
  REP(i, n){
    tmp += ans[i][1];
    if (tmp && ans[i][0])
      ret += "?";
    else if (tmp)
      ret += 'X';
    else
      ret += '_';
  }

  return ret;
}
 
/*int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

  cout << solve_puzzle(".X........", {3}) << '\n';
 
	return 0;
}*/
  

• 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