제출 #1292275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292275		yf_yusuf	무지개나라 (APIO17_rainbow)	C++20	0 / 100	2 ms	644 KiB

rainbow

//```//    YF YUSUF
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <set>
// #include <map>
// #include <algorithm>
// #include <cmath>
// #include <numeric>
// #include <queue>
// #include <stack>
// #include <cassert>
// #include <climits>
// #include <string>
// #include <cstdlib>
// #include <random>
// #include <iomanip>
// #include <ctime>
using namespace std;
#ifdef YF_CHECK
	bool LOCAL = 1;
#else
	#pragma GCC optimize ("unroll-loops")
	#pragma GCC optimize ("inline")
	#pragma GCC optimize ("Ofast")
	#pragma GCC optimize ("O3")
	bool LOCAL = 0;
#endif
using ll   = long long;
using ld   = long double;
using vll  = vector <ll>;
using mll  = map <ll,ll>;
using pll  = pair <ll,ll>;
using vvl  = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
	if(b==0)return 1;
	ll q=BP(a,b/2,mod);
	return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll  mod=998244353;
const ll  INF=1e18;
const ll  inf=1e9+7;
const ll  N  =1000+7;
pll nx[N];
ll ln, rn, rm, lm;
bool g[N][N], used[N][N];
vpll D = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
void init(int R, int C, int sr, int sc, int M, char *s){
	g[sr][sc] = 1;
	for(int i=0;i<M;i++){
		sr += nx[s[i]].F;
		sc += nx[s[i]].S;
		g[sr][sc] = 1;
	}
}
bool CHECK(int x, int y){
	return ((ln <= x && x <= rn) && (lm <= y && y <= rm));
}
bool check(int x, int y){
	return (CHECK(x, y) && !used[x][y] && !g[x][y]);
}
void dfs(int x, int y){
	used[x][y] = 1;
	for(auto [dx, dy] : D){
		int X = x + dx;
		int Y = y + dy;
		if(check(X, Y))dfs(X, Y);
	}
}
int colour(int ar, int ac, int br, int bc) {
	ln = ar; lm = ac;
	rn = br; rm = bc;
	int cnt=0;
	for(int i=ln; i<=rn; i++){
		for(int j=lm; j<=rm; j++){
			if(check(i, j)){
				dfs(i, j);
				// cout<<i<<" "<<j<<", ";
				cnt++;
			}
		}
	}
	for(int i=ln; i<=rn; i++)
		for(int j=lm; j<=rm; j++)
			used[i][j] = 0;
	
  return cnt;
}
void YF_MAIN(ll TEST){
	int R, C, sr, sc, M, q;
	string s;
	cin>>R>>C>>M>>q>>sr>>sc>>s;
	vector<char> buf(s.begin(), s.end());
	buf.push_back('\0');
	init(R, C, sr, sc, M, buf.data());
	while(q--){
		int ar, ac, br, bc;
		cin>>ar>>ac>>br>>bc;
		cout<<colour(ar, ac, br, bc)<<"\n";
	}
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PNK(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PNK(n,k)*inv[k  ]%FMOD;}
void BEFORE(){
	nx['N'] = {-1, 0};
	nx['S'] = { 1, 0};
	nx['W'] = { 0,-1};
	nx['E'] = { 0, 1};
	for(ll i=2;i<SN;i++){
		if(SM[i])continue;
		for(ll j=i;j<SN;j+=i)
			MAX(SM[j],i);
	}
	FACT[0]=inv[0]=1;
	for(int i=1;i<FN;i++){
		FACT[i]=FACT[i-1]*i%FMOD;
		inv[i]=BP(FACT[i],FMOD-2,FMOD);
	}
}
#ifdef YF_CHECK
signed main(){
	// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
	if(FLSH){
		ios_base::sync_with_stdio(0);
		cout.setf(ios::fixed);
		cout.precision(0);
		cout.tie(0);
		cin.tie(0);
	}
	int TEST=1;
	if(TECT)
		cin>>TEST;
	BEFORE();
	for(int T=1;T<=TEST;T++){
		// cout<<"Case "<<T<<": ";
		YF_MAIN(T);
		cout<<(T==TEST ? "" : "\n");
	}
	return 0;
} 
#else
#include "rainbow.h"
#endif
//   YF YUSUF ```

• Subtask 1: 0 / 11
• Subtask 2: 0 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26