이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int N = 3010;
int m,n;
char c[N][N];
int v[N][N],h[N][N],dp[N][N];
int cv[N][N],ch[N][N];
bool bm[N][N];
set<tuple<int,int,int,int> > s;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> m >> n;
for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) cin >> c[i][j];
for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)
{
if(i>2 and c[i-2][j]=='R' and c[i-1][j]=='G' and c[i][j]=='W') v[i][j] = 1;
if(j>2 and c[i][j-2]=='R' and c[i][j-1]=='G' and c[i][j]=='W') h[i][j] = 1;
}
for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++)
{
if(v[i][j]) cv[i][j] = h[i][j]+h[i-1][j+1]+h[i-2][j+2],s.insert({-cv[i][j],i,j,0});
if(h[i][j]) ch[i][j] = v[i][j]+v[i+1][j-1]+v[i+2][j-2],s.insert({-ch[i][j],i,j,1});
}
while(!s.empty())
{
auto [c,x,y,t] = (*s.begin());
if(c==0) break;
if(t==0)
{
auto it = s.find({-ch[x-2][y+2],x-2,y+2,1});
if(it!=s.end()) ch[x-2][y+2]--,s.erase(it),s.insert({-ch[x-2][y+2],x-2,y+2,1});
it = s.find({-ch[x-1][y+1],x-1,y+1,1});
if(it!=s.end()) ch[x-1][y+1]--,s.erase(it),s.insert({-ch[x-1][y+1],x-1,y+1,1});
it = s.find({-ch[x][y],x,y,1});
if(it!=s.end()) ch[x][y]--,s.erase(it),s.insert({-ch[x][y],x,y,1});
}
else
{
auto it = s.find({-cv[x+2][y-2],x+2,y-2,0});
if(it!=s.end()) cv[x+2][y-2]--,s.erase(it),s.insert({-cv[x+2][y-2],x+2,y-2,0});
it = s.find({-cv[x+1][y-1],x+1,y-1,0});
if(it!=s.end()) cv[x+1][y-1]--,s.erase(it),s.insert({-cv[x+1][y-1],x+1,y-1,0});
it = s.find({-cv[x][y],x,y,0});
if(it!=s.end()) cv[x][y]--,s.erase(it),s.insert({-cv[x][y],x,y,0});
}
s.erase({c,x,y,t});
}
cout << s.size();
}
컴파일 시 표준 에러 (stderr) 메시지
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:31:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
auto [c,x,y,t] = (*s.begin());
^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |