제출 #823341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
823341		tolbi	Paint By Numbers (IOI16_paint)	C++17	0 / 100	1 ms	340 KiB

paint

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//ahmet23 orz...
//FatihSultanMehmedHan(ortanca da orz)
//AbdulhamidHan
//YavuzSultanSelimHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
template<typename T> istream& operator>>(istream& is, vector<T> &arr){for (auto &it : arr) is>>it;return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T> arr){for (auto &it : arr) os<<it<<" ";return os;}
template<typename T, size_t Y> istream& operator>>(istream& is, array<T,Y> &arr){for (auto &it : arr) is>>it;return is;}
template<typename T, size_t Y> ostream& operator<<(ostream& os, array<T,Y> arr){for (auto &it : arr) os<<it<<" ";return os;}
template<typename T> void coutarr(T __arr){for (auto &it : __arr){cout<<it<<" ";}cout<<endl;}
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define endl '\n'
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define vint(x) vector<int> x
#define tol(bi) (1LL<<((int64_t)(bi)))
typedef long long ll;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "paint.h"

#include <cstdlib>

string solve_puzzle(string s, vector<int> c) {
	int n = s.length();
	int m = c.size();
	vector<vector<int>> dp(n, vector<int>(m,-1));
	string rval = s;
	function<bool(int,int)> f;
	vector<pair<int,int>> w_;
	vector<pair<int,int>> wx;
	vector<int> ans(n,0);
	f = [&](int node, int flag)->bool{
		if (node>=n)return flag==m;
		if (flag>=m){
			for (int i = node; i < n; i++){
				if (s[i]=='X') return false;
			}
			for (int i = node; i < n; i++){
				ans[i]|=2;
			}
			return true;
		}
		if (dp[node][flag]!=-1) return dp[node][flag];
		dp[node][flag]=0;
		if (s[node]!='X' && f(node+1,flag)==1){
			ans[node]|=2;
			dp[node][flag]=1;
		}
		int l = node, r = node+c[flag]-1;
		if (r>=n) return dp[node][flag];
		bool boolean=true;
		for (int i = l; i <= r; i++){
			if (s[i]=='_') boolean=false;
		}
		if (boolean && f(r+2,flag+1)==1){
			if (r+1==n || s[r+1]!='X'){
				ans[r+1]|=2;
				for (int i = l; i <= r; i++){
					ans[i]|=1;
				}
				dp[node][flag]=1;
			}
		}
		return dp[node][flag];
	};
	f(0,0);
	vector<pair<int,int>> isl;
	for (int i = 0; i < wx.size(); i++){
		if (wx[i].second<wx[i].first) continue;
		isl.push_back({wx[i].first,1});
		isl.push_back({wx[i].second+1,-1});
	}
	sortrarr(isl);
	int crr = 0;
	for (int i = 0; i <= n; i++){
		while (isl.size() && isl.back().first<=i){
			crr+=isl.back().second;
			isl.pop_back();
		}
		if (i<n && crr>0) ans[i]|=1;
	}
	isl.clear();
	for (int i = 0; i < w_.size(); i++){
		if (w_[i].second<w_[i].first) continue;
		isl.push_back({w_[i].first,1});
		isl.push_back({w_[i].second+1,-1});
	}
	sortrarr(isl);
	crr = 0;
	for (int i = 0; i <= n; i++){
		while (isl.size() && isl.back().first<=i){
			crr+=isl.back().second;
			isl.pop_back();
		}
		if (i<n && crr>0) ans[i]|=2;
	}
	for (int i = 0; i < n; i++){
		rval[i]='?';
		if (ans[i]==1) rval[i]='X';
		else if (ans[i]==2) rval[i]='_';
	}
	return rval;
}

컴파일 시 표준 에러 (stderr) 메시지

paint.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:79:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |  for (int i = 0; i < wx.size(); i++){
      |                  ~~^~~~~~~~~~~
paint.cpp:94:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |  for (int i = 0; i < w_.size(); i++){
      |                  ~~^~~~~~~~~~~

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