oj.uz

Submission #889294

# Submission time Handle Problem Language Result Execution time Memory
889294 2023-12-19T09:52:15 Z alexander707070 Dango Maker (JOI18_dango_maker) C++14
13 / 100
 36 ms 146260 KB 
#include<bits/stdc++.h>
#define MAXN 6000007
using namespace std;

int n,m;
char t[3007][3007];

vector<int> v[MAXN];
int s[MAXN],cnt1,cnt2,ans;
int num[3007][3007],num2[3007][3007],total;

void dfs(int x,int p,int side){
    s[x]=side;
    if(side==1)cnt1++;
    else cnt2++;

    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p)continue;
        if(s[v[x][i]]==0)dfs(v[x][i],x,3-side);
    }
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m;

    for(int i=0;i<=n+1;i++){
        for(int f=0;f<=m+1;f++){
            t[i][f]='#';
        }
    }

    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){
            cin>>t[i][f];
        }
    }

    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){

            if(t[i][f]=='R' and t[i][f+1]=='G' and t[i][f+2]=='W'){
                total++; num[i][f]=total;
            }
            if(t[i][f]=='R' and t[i+1][f]=='G' and t[i+2][f]=='W'){
                total++; num2[i][f]=total;
            }

            if(t[i][f]=='R' and t[i][f+1]=='G' and t[i][f+2]=='W' and t[i+1][f]=='G' and t[i+2][f]=='W'){
                v[num[i][f]].push_back(num2[i][f]);
                v[num2[i][f]].push_back(num[i][f]);
            }
        }
    }

    for(int i=1;i<=n;i++){
        for(int f=1;f<=m;f++){
            if(t[i][f]=='G' and t[i][f-1]=='R' and t[i][f+1]=='W' and t[i-1][f]=='R' and t[i+1][f]=='W'){
                v[num[i][f-1]].push_back(num2[i-1][f]);
                v[num2[i-1][f]].push_back(num[i][f-1]);
            }
        }
    }

    for(int i=2;i<=n;i++){
        for(int f=2;f<=m;f++){
            if(t[i][f]=='W' and t[i][f-2]=='R' and t[i][f-1]=='G' and t[i-2][f]=='R' and t[i-1][f]=='G'){
                v[num[i][f-2]].push_back(num2[i-2][f]);
                v[num2[i-2][f]].push_back(num[i][f-2]);
            }
        }
    }

    if(!v[0].empty())cout<<1/0;

    for(int i=1;i<=total;i++){
        if(s[i]==0){
            cnt1=cnt2=0;
            dfs(i,0,1);

            ans+=max(cnt1,cnt2);
        }
    }

    cout<<ans<<"\n";

    return 0;
}

Compilation message

dango_maker.cpp: In function 'void dfs(int, int, int)':
dango_maker.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:78:29: warning: division by zero [-Wdiv-by-zero]
   78 |     if(!v[0].empty())cout<<1/0;
      |                            ~^~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 143960 KB Output is correct
2 Correct 34 ms 144220 KB Output is correct
3 Correct 35 ms 143952 KB Output is correct
4 Correct 31 ms 143964 KB Output is correct
5 Correct 32 ms 144104 KB Output is correct
6 Correct 31 ms 146088 KB Output is correct
7 Correct 32 ms 146040 KB Output is correct
8 Correct 32 ms 146008 KB Output is correct
9 Correct 32 ms 146260 KB Output is correct
10 Correct 31 ms 143964 KB Output is correct
11 Correct 31 ms 146120 KB Output is correct
12 Correct 32 ms 146092 KB Output is correct
13 Correct 34 ms 146012 KB Output is correct
14 Correct 36 ms 143964 KB Output is correct
15 Correct 32 ms 143960 KB Output is correct
16 Correct 31 ms 144052 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 143960 KB Output is correct
2 Correct 34 ms 144220 KB Output is correct
3 Correct 35 ms 143952 KB Output is correct
4 Correct 31 ms 143964 KB Output is correct
5 Correct 32 ms 144104 KB Output is correct
6 Correct 31 ms 146088 KB Output is correct
7 Correct 32 ms 146040 KB Output is correct
8 Correct 32 ms 146008 KB Output is correct
9 Correct 32 ms 146260 KB Output is correct
10 Correct 31 ms 143964 KB Output is correct
11 Correct 31 ms 146120 KB Output is correct
12 Correct 32 ms 146092 KB Output is correct
13 Correct 34 ms 146012 KB Output is correct
14 Correct 36 ms 143964 KB Output is correct
15 Correct 32 ms 143960 KB Output is correct
16 Correct 31 ms 144052 KB Output is correct
17 Correct 33 ms 146148 KB Output is correct
18 Correct 32 ms 146000 KB Output is correct
19 Correct 31 ms 146008 KB Output is correct
20 Correct 31 ms 146000 KB Output is correct
21 Correct 31 ms 146008 KB Output is correct
22 Correct 33 ms 146056 KB Output is correct
23 Correct 33 ms 146148 KB Output is correct
24 Correct 32 ms 145892 KB Output is correct
25 Correct 33 ms 143944 KB Output is correct
26 Correct 31 ms 143964 KB Output is correct
27 Correct 31 ms 146188 KB Output is correct
28 Correct 35 ms 146012 KB Output is correct
29 Correct 30 ms 145960 KB Output is correct
30 Correct 31 ms 143964 KB Output is correct
31 Correct 32 ms 143964 KB Output is correct
32 Correct 33 ms 143968 KB Output is correct
33 Correct 35 ms 146132 KB Output is correct
34 Incorrect 33 ms 146000 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 143960 KB Output is correct
2 Correct 34 ms 144220 KB Output is correct
3 Correct 35 ms 143952 KB Output is correct
4 Correct 31 ms 143964 KB Output is correct
5 Correct 32 ms 144104 KB Output is correct
6 Correct 31 ms 146088 KB Output is correct
7 Correct 32 ms 146040 KB Output is correct
8 Correct 32 ms 146008 KB Output is correct
9 Correct 32 ms 146260 KB Output is correct
10 Correct 31 ms 143964 KB Output is correct
11 Correct 31 ms 146120 KB Output is correct
12 Correct 32 ms 146092 KB Output is correct
13 Correct 34 ms 146012 KB Output is correct
14 Correct 36 ms 143964 KB Output is correct
15 Correct 32 ms 143960 KB Output is correct
16 Correct 31 ms 144052 KB Output is correct
17 Correct 33 ms 146148 KB Output is correct
18 Correct 32 ms 146000 KB Output is correct
19 Correct 31 ms 146008 KB Output is correct
20 Correct 31 ms 146000 KB Output is correct
21 Correct 31 ms 146008 KB Output is correct
22 Correct 33 ms 146056 KB Output is correct
23 Correct 33 ms 146148 KB Output is correct
24 Correct 32 ms 145892 KB Output is correct
25 Correct 33 ms 143944 KB Output is correct
26 Correct 31 ms 143964 KB Output is correct
27 Correct 31 ms 146188 KB Output is correct
28 Correct 35 ms 146012 KB Output is correct
29 Correct 30 ms 145960 KB Output is correct
30 Correct 31 ms 143964 KB Output is correct
31 Correct 32 ms 143964 KB Output is correct
32 Correct 33 ms 143968 KB Output is correct
33 Correct 35 ms 146132 KB Output is correct
34 Incorrect 33 ms 146000 KB Output isn't correct
35 Halted 0 ms 0 KB -