| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 463927 | NhatMinh0208 | Dango Maker (JOI18_dango_maker) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
#include <atcoder/maxflow>
using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[3001][3001];
vector<int> lmao[3001][3001];
int main()
{
fio;
cin>>n>>m;
char c;
for (i=1;i<=n;i++) for (j=1;j<=m;j++)
{
cin>>c;
if (c=='R') arr[i][j]=0;
else if (c=='G') arr[i][j]=1;
else arr[i][j]=2;
}
t=0;
for (i=1;i<=n;i++) for (j=1;j<=m-2;j++)
{
if (arr[i][j]==0 && arr[i][j+1]==1 && arr[i][j+2]==2)
{
t++;
lmao[i][j].push_back(t);
lmao[i][j+1].push_back(t);
lmao[i][j+2].push_back(t);
}
}
t1=t;
for (i=1;i<=n-2;i++) for (j=1;j<=m;j++)
{
if (arr[i][j]==0 && arr[i+1][j]==1 && arr[i+2][j]==2)
{
t++;
lmao[i][j].push_back(t);
lmao[i+1][j].push_back(t);
lmao[i+2][j].push_back(t);
}
}
mf_graph<int> gr(t+2);
for (i=1;i<=t1;i++) gr.add_edge(0,i,1);
for (i=t1+1;i<=t;i++) gr.add_edge(i,t+1,1);
for (i=1;i<=n;i++) for (j=1;j<=m;j++) if (lmao[i][j].size()==2)
{
gr.add_edge(lmao[i][j][0],lmao[i][j][1],1);
}
cout<<t-gr.flow(0,t+1);
}
// Normie28