oj.uz

답안 #223186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223186 2020-04-15T04:41:58 Z Autoratch Dango Maker (JOI18_dango_maker) C++14
13 / 100
 5 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
#define ti tuple<int,int,int,bool> 

const int N = 3010;

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

void del(ti a,ti 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),ans++;
        else if(x>2 and y+2<=n and ch[x-2][y+2])
        {
            ch[x-2][y+2]--;
            if(ch[x-2][y+2]==1) 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),ans++;
        else if(x>1 and y+1<=n and ch[x-1][y+1])
        {
            ch[x-1][y+1]--;
            if(ch[x-1][y+1]==1) 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),ans++;
        else if(ch[x][y])
        {
            ch[x][y]--;
            if(ch[x][y]==1) s.insert({ch[x][y],x,y,1});
        }
        cv[x][y] = 0;
    }
    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),ans++;
        else if(x+2<=m and y>2 and cv[x+2][y-2])
        {
            cv[x+2][y-2]--;
            if(cv[x+2][y-2]==1) 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),ans++;
        else if(x+1<=m and y>1 and cv[x+1][y-1])
        {
            cv[x+1][y-1]--;
            if(cv[x+1][y-1]==1) 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),ans++;
        else if(cv[x][y])
        {
            cv[x][y]--;
            if(cv[x][y]==1) s.insert({cv[x][y],x,y,0});
        }
        ch[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] = (int)h[i][j]+(int)h[i-1][j+1]+(int)h[i-2][j+2];
        if(h[i][j]) ch[i][j] = (int)v[i][j]+(int)v[i+1][j-1]+(int)v[i+2][j-2];
        if(v[i][j]){ if(!cv[i][j]) ans++; else if(cv[i][j]==1) s.insert({cv[i][j],i,j,0}); }
        if(h[i][j]){ if(!ch[i][j]) ans++; else if(ch[i][j]==1) s.insert({ch[i][j],i,j,1}); }
    }
    while(!s.empty())
    {
        ti tt = (*s.begin());
        auto &[c,x,y,t] = tt;
        ans++;
        if(t==0)
        {
            cv[x][y] = 0;
            if(x>2 and y+2<=n and ch[x-2][y+2]) del({ch[x-2][y+2],x-2,y+2,1},tt);
            if(x>1 and y+1<=n and ch[x-1][y+1]) del({ch[x-1][y+1],x-1,y+1,1},tt);
            if(ch[x][y]) del({ch[x][y],x,y,1},tt);
        }
        else
        {
            ch[x][y] = 0;
            if(x+2<=m and y>2 and cv[x+2][y-2]) del({cv[x+2][y-2],x+2,y-2,0},tt);
            if(x+1<=m and y>1 and cv[x+1][y-1]) del({cv[x+1][y-1],x+1,y-1,0},tt);
            if(cv[x][y]) del({cv[x][y],x,y,0},tt);
        }
        s.erase({c,x,y,t});
    }
    cout << ans;
}

Compilation message

dango_maker.cpp: In function 'void del(std::tuple<int, int, int, bool>, std::tuple<int, int, int, bool>)':
dango_maker.cpp:15:11: 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:90:15: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
         auto &[c,x,y,t] = tt;
               ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Incorrect 5 ms 512 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 4 ms 512 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Incorrect 5 ms 512 KB Output isn't correct
29 Halted 0 ms 0 KB -