Submission #223060

#	Time	Username	Problem	Language	Result	Execution time	Memory
223060		Autoratch	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	767 ms	262148 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

const int N = 3010;

int m,n,ans;
char c[N][N];
int v[N][N],h[N][N];
int cv[N][N],ch[N][N];
set<tuple<int,int,int,int> > s;

void del(tuple<int,int,int,int> a,tuple<int,int,int,int> tt)
{
    auto [c,x,y,t] = a;
    if(t==0)
    {
        auto it = s.find({ch[x-2][y+2],x-2,y+2,1});
        if(it!=s.end() and *it!=tt) 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() and *it!=tt) 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() and *it!=tt) 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() and *it!=tt) 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() and *it!=tt) 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() and *it!=tt) cv[x][y]--,s.erase(it),s.insert({cv[x][y],x,y,0});
    }
    s.erase({c,x,y,t}); 
}

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())
    {
        tuple<int,int,int,int> tt = (*s.begin());
        auto [c,x,y,t] = tt;
        ans++;
        if(t==0)
        {
            auto it = s.find({ch[x-2][y+2],x-2,y+2,1});
            if(it!=s.end()) del({ch[x-2][y+2],x-2,y+2,1},tt);
            it = s.find({ch[x-1][y+1],x-1,y+1,1});
            if(it!=s.end()) del({ch[x-1][y+1],x-1,y+1,1},tt);
            it = s.find({ch[x][y],x,y,1});
            if(it!=s.end()) del({ch[x][y],x,y,1},tt);
        }
        else
        {
            auto it = s.find({cv[x+2][y-2],x+2,y-2,0});
            if(it!=s.end()) del({cv[x+2][y-2],x+2,y-2,0},tt);
            it = s.find({cv[x+1][y-1],x+1,y-1,0});
            if(it!=s.end()) del({cv[x+1][y-1],x+1,y-1,0},tt);
            it = s.find({cv[x][y],x,y,0});
            if(it!=s.end()) del({cv[x][y],x,y,0},tt);
        }
        s.erase({c,x,y,t});
    }
    cout << ans;
}

Compilation message (stderr)

dango_maker.cpp: In function 'void del(std::tuple<int, int, int, int>, std::tuple<int, int, int, int>)':
dango_maker.cpp:14:10: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
     auto [c,x,y,t] = a;
          ^
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:55:14: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
         auto [c,x,y,t] = tt;
              ^

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 0 / 67