oj.uz

Submission #331773

# Submission time Handle Problem Language Result Execution time Memory
331773 2020-11-30T03:11:00 Z daniel920712 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 261 ms 134400 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>

using namespace std;
char all[3005][3005];
vector < int > Next[2][1000005];
vector < pair < int , int > > tt;
set < pair < int , int > > vis;
bool have[2][1000005]={0};
bool use[2][1000005]={0};
bool is[2][1000005]={0};
int nxt[2][1000005]={0};
int ans=0,a,b;
void F(int x,int y)
{
    if(have[x][y]) return ;
    a++;
    have[x][y]=1;
    tt.push_back(make_pair(x,y));
    for(auto i:Next[x][y]) F(1-x,i);

}
bool F2(int x,int y,int fx,int fy,int deg)
{
    if(vis.find(make_pair(x,y))!=vis.end()) return 0;
    vis.insert(make_pair(x,y));
    if(nxt[x][y]==-1&&deg==1)
    {
        nxt[x][y]=fy;
        return 1;
    }
    if(deg==1)
    {
        if(F2(1-x,nxt[x][y],x,y,1-deg))
        {
            nxt[x][y]=fy;
            return 1;
        }
    }
    else
    {
        for(auto i:Next[x][y])
        {
            if(F2(1-x,i,x,y,1-deg))
            {
                nxt[x][y]=i;
                return 1;
            }
        }
    }
    return 0;

}
int main()
{
    int N,M,i,j;
    scanf("%d %d",&N,&M);
    for(i=0;i<N;i++) scanf("%s",all[i]);
    for(i=0;i<N;i++) for(j=0;j<M-2;j++) if(all[i][j]=='R'&&all[i][j+1]=='G'&&all[i][j+2]=='W') is[0][i*M+j]=1;
    for(i=0;i<N-2;i++) for(j=0;j<M;j++) if(all[i][j]=='R'&&all[i+1][j]=='G'&&all[i+2][j]=='W') is[1][i*M+j]=1;

    for(i=0;i<N;i++)
    {
        for(j=0;j<M;j++)
        {
            if(is[0][i*M+j]&&is[1][i*M+j])
            {
                Next[0][i*M+j].push_back(i*M+j);
                Next[1][i*M+j].push_back(i*M+j);
            }
            if(is[0][i*M+j]&&i>=1&&j+1<M&&is[1][(i-1)*M+j+1])
            {
                Next[0][i*M+j].push_back((i-1)*M+j+1);
                Next[1][(i-1)*M+j+1].push_back(i*M+j);
            }
            if(is[0][i*M+j]&&i>=2&&j+2<M&&is[1][(i-2)*M+j+2])
            {
                Next[0][i*M+j].push_back((i-2)*M+j+2);
                Next[1][(i-2)*M+j+2].push_back(i*M+j);
            }
        }
    }
    for(i=0;i<N*M;i++)
    {
        if(is[0][i]&&!have[0][i])
        {
            tt.clear();
            a=0;
            F(0,i);
            ans+=a;
            for(auto i:tt) nxt[i.first][i.second]=-1;
            for(auto i:tt)
            {
                if(nxt[i.first][i.second]==-1)
                {
                    vis.clear();
                    if(F2(i.first,i.second,-1,-1,0)) ans--;
                }

            }

        }

        if(is[1][i]&&!have[1][i])
        {
            tt.clear();
            a=0;
            F(1,i);
            ans+=a;
            for(auto i:tt) nxt[i.first][i.second]=-1;
            for(auto i:tt)
            {
                if(nxt[i.first][i.second]==-1)
                {
                    vis.clear();
                    if(F2(i.first,i.second,-1,-1,0)) ans--;
                }

            }
        }
    }
    printf("%d\n",ans);
    //printf("aa\n");
    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
dango_maker.cpp:64:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     for(i=0;i<N;i++) scanf("%s",all[i]);
      |                      ~~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47340 KB Output is correct
2 Correct 28 ms 47340 KB Output is correct
3 Correct 28 ms 47340 KB Output is correct
4 Correct 28 ms 47340 KB Output is correct
5 Correct 28 ms 47360 KB Output is correct
6 Correct 28 ms 47468 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 28 ms 47340 KB Output is correct
9 Correct 28 ms 47340 KB Output is correct
10 Correct 30 ms 47340 KB Output is correct
11 Correct 28 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 28 ms 47340 KB Output is correct
14 Correct 28 ms 47340 KB Output is correct
15 Correct 28 ms 47340 KB Output is correct
16 Correct 28 ms 47468 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47340 KB Output is correct
2 Correct 28 ms 47340 KB Output is correct
3 Correct 28 ms 47340 KB Output is correct
4 Correct 28 ms 47340 KB Output is correct
5 Correct 28 ms 47360 KB Output is correct
6 Correct 28 ms 47468 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 28 ms 47340 KB Output is correct
9 Correct 28 ms 47340 KB Output is correct
10 Correct 30 ms 47340 KB Output is correct
11 Correct 28 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 28 ms 47340 KB Output is correct
14 Correct 28 ms 47340 KB Output is correct
15 Correct 28 ms 47340 KB Output is correct
16 Correct 28 ms 47468 KB Output is correct
17 Correct 28 ms 47340 KB Output is correct
18 Correct 29 ms 47340 KB Output is correct
19 Correct 28 ms 47340 KB Output is correct
20 Correct 29 ms 47340 KB Output is correct
21 Correct 28 ms 47340 KB Output is correct
22 Correct 30 ms 47340 KB Output is correct
23 Correct 29 ms 47340 KB Output is correct
24 Correct 28 ms 47340 KB Output is correct
25 Correct 29 ms 47340 KB Output is correct
26 Correct 30 ms 47340 KB Output is correct
27 Correct 32 ms 47340 KB Output is correct
28 Correct 28 ms 47340 KB Output is correct
29 Correct 28 ms 47340 KB Output is correct
30 Correct 28 ms 47340 KB Output is correct
31 Correct 28 ms 47340 KB Output is correct
32 Correct 29 ms 47340 KB Output is correct
33 Correct 28 ms 47340 KB Output is correct
34 Correct 28 ms 47340 KB Output is correct
35 Correct 28 ms 47340 KB Output is correct
36 Correct 28 ms 47340 KB Output is correct
37 Correct 28 ms 47468 KB Output is correct
38 Correct 29 ms 47340 KB Output is correct
39 Correct 29 ms 47340 KB Output is correct
40 Correct 28 ms 47340 KB Output is correct
41 Correct 28 ms 47340 KB Output is correct
42 Correct 31 ms 47340 KB Output is correct
43 Correct 28 ms 47340 KB Output is correct
44 Correct 28 ms 47340 KB Output is correct
45 Correct 28 ms 47340 KB Output is correct
46 Correct 28 ms 47340 KB Output is correct
47 Correct 29 ms 47340 KB Output is correct
48 Correct 28 ms 47340 KB Output is correct
49 Correct 28 ms 47340 KB Output is correct
50 Correct 28 ms 47340 KB Output is correct
51 Correct 28 ms 47340 KB Output is correct
52 Correct 28 ms 47340 KB Output is correct
53 Correct 28 ms 47340 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47340 KB Output is correct
2 Correct 28 ms 47340 KB Output is correct
3 Correct 28 ms 47340 KB Output is correct
4 Correct 28 ms 47340 KB Output is correct
5 Correct 28 ms 47360 KB Output is correct
6 Correct 28 ms 47468 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 28 ms 47340 KB Output is correct
9 Correct 28 ms 47340 KB Output is correct
10 Correct 30 ms 47340 KB Output is correct
11 Correct 28 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 28 ms 47340 KB Output is correct
14 Correct 28 ms 47340 KB Output is correct
15 Correct 28 ms 47340 KB Output is correct
16 Correct 28 ms 47468 KB Output is correct
17 Correct 28 ms 47340 KB Output is correct
18 Correct 29 ms 47340 KB Output is correct
19 Correct 28 ms 47340 KB Output is correct
20 Correct 29 ms 47340 KB Output is correct
21 Correct 28 ms 47340 KB Output is correct
22 Correct 30 ms 47340 KB Output is correct
23 Correct 29 ms 47340 KB Output is correct
24 Correct 28 ms 47340 KB Output is correct
25 Correct 29 ms 47340 KB Output is correct
26 Correct 30 ms 47340 KB Output is correct
27 Correct 32 ms 47340 KB Output is correct
28 Correct 28 ms 47340 KB Output is correct
29 Correct 28 ms 47340 KB Output is correct
30 Correct 28 ms 47340 KB Output is correct
31 Correct 28 ms 47340 KB Output is correct
32 Correct 29 ms 47340 KB Output is correct
33 Correct 28 ms 47340 KB Output is correct
34 Correct 28 ms 47340 KB Output is correct
35 Correct 28 ms 47340 KB Output is correct
36 Correct 28 ms 47340 KB Output is correct
37 Correct 28 ms 47468 KB Output is correct
38 Correct 29 ms 47340 KB Output is correct
39 Correct 29 ms 47340 KB Output is correct
40 Correct 28 ms 47340 KB Output is correct
41 Correct 28 ms 47340 KB Output is correct
42 Correct 31 ms 47340 KB Output is correct
43 Correct 28 ms 47340 KB Output is correct
44 Correct 28 ms 47340 KB Output is correct
45 Correct 28 ms 47340 KB Output is correct
46 Correct 28 ms 47340 KB Output is correct
47 Correct 29 ms 47340 KB Output is correct
48 Correct 28 ms 47340 KB Output is correct
49 Correct 28 ms 47340 KB Output is correct
50 Correct 28 ms 47340 KB Output is correct
51 Correct 28 ms 47340 KB Output is correct
52 Correct 28 ms 47340 KB Output is correct
53 Correct 28 ms 47340 KB Output is correct
54 Correct 28 ms 47428 KB Output is correct
55 Correct 33 ms 56172 KB Output is correct
56 Correct 30 ms 47596 KB Output is correct
57 Correct 33 ms 53484 KB Output is correct
58 Correct 75 ms 63724 KB Output is correct
59 Runtime error 261 ms 134400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
60 Halted 0 ms 0 KB -