oj.uz

Submission #884963

# Submission time Handle Problem Language Result Execution time Memory
884963 2023-12-08T18:14:58 Z maxFedorchuk Dango Maker (JOI18_dango_maker) C++17
33 / 100
 340 ms 262144 KB 
#include <bits/stdc++.h>

#pragma GCC target("avx2,sse4,popcnt,bmi")
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

const int MX=3020;

int mtr[MX][MX];
char ch[MX][MX];

const int MXK=(MX*MX)/3;
vector < int > mas[2*MXK];
int usea[2*MXK];
int pr[2*MXK];

int timer=0,koma,komb;

bool khuna(int zar)
{
    if(usea[zar])
    {
        return 0;
    }

    usea[zar]=1;

    for(auto u:mas[zar])
    {
        if(pr[u]==0)
        {
            pr[zar]=u;
            pr[u]=zar;
            return 1;
        }
    }

    for(auto u:mas[zar])
    {
        if(khuna(pr[u]))
        {
            pr[zar]=u;
            pr[u]=zar;
            return 1;
        }
    }

    return 0;
}
void kntkhuna()
{
    while(true)
    {
        fill(usea+1,usea+1+timer,0);

        bool p=0;

        for(int i=1;i<=koma;i++)
        {
            if(pr[i]==0)
            {
                if(khuna(i))
                {
                    p=1;
                }
            }
        }

        if(!p)
        {
            return;
        }
    }

    return;
}

void DFS(int zar)
{
    usea[zar]=1;

    if(zar<=koma)
    {
        for(auto u:mas[zar])
        {
            if(pr[u]!=zar && usea[u]==0)
            {
                DFS(u);
            }
        }
    }
    else
    {
        if(usea[pr[zar]]==0)
        {
            DFS(pr[zar]);
        }
    }

    return;
}
int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    int n,m;
    cin>>n>>m;

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

    for(int i=1;i<=n;i++)
    {
        for(int j=1;(j+2)<=m;j++)
        {
            if(ch[i][j]=='R' && ch[i][j+1]=='G' && ch[i][j+2]=='W')
            {
                timer++;
                mtr[i][j]=timer;
            }
        }
    }
    koma=timer;


    for(int i=1;(i+2)<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(ch[i][j]=='R' && ch[i+1][j]=='G' && ch[i+2][j]=='W')
            {
                timer++;

                for(int corx=i;corx<=(i+2);corx++)
                {
                    for(int cory=max(1,j-2);cory<=j;cory++)
                    {
                        if(mtr[corx][cory])
                        {
                            mas[mtr[corx][cory]].push_back(timer);
                            mas[timer].push_back(mtr[corx][cory]);
                        }
                    }
                }
            }
        }
    }
    komb=timer-koma;

    if(koma==0)
    {
        cout<<komb<<"\n";
        return 0;
    }

    if(komb==0)
    {
        cout<<koma<<"\n";
        return 0;
    }

    kntkhuna();
    fill(usea+1,usea+koma+komb+1,0);

    for(int i=1;i<=koma;i++)
    {
        if(pr[i]==0)
        {
            DFS(i);
        }
    }

    int res=0;
    for(int i=1;i<=koma;i++)
    {
        res+=(usea[i]==1);
    }

    for(int i=(koma+1);i<=(koma+komb);i++)
    {
        res+=(usea[i]==0);
    }

    cout<<res<<"\n";
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 144036 KB Output is correct
2 Correct 32 ms 143964 KB Output is correct
3 Correct 31 ms 143964 KB Output is correct
4 Correct 31 ms 143960 KB Output is correct
5 Correct 32 ms 143964 KB Output is correct
6 Correct 34 ms 148048 KB Output is correct
7 Correct 33 ms 148048 KB Output is correct
8 Correct 32 ms 148048 KB Output is correct
9 Correct 32 ms 148056 KB Output is correct
10 Correct 31 ms 144048 KB Output is correct
11 Correct 31 ms 148024 KB Output is correct
12 Correct 32 ms 148060 KB Output is correct
13 Correct 31 ms 148060 KB Output is correct
14 Correct 32 ms 143964 KB Output is correct
15 Correct 31 ms 143956 KB Output is correct
16 Correct 30 ms 143932 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 144036 KB Output is correct
2 Correct 32 ms 143964 KB Output is correct
3 Correct 31 ms 143964 KB Output is correct
4 Correct 31 ms 143960 KB Output is correct
5 Correct 32 ms 143964 KB Output is correct
6 Correct 34 ms 148048 KB Output is correct
7 Correct 33 ms 148048 KB Output is correct
8 Correct 32 ms 148048 KB Output is correct
9 Correct 32 ms 148056 KB Output is correct
10 Correct 31 ms 144048 KB Output is correct
11 Correct 31 ms 148024 KB Output is correct
12 Correct 32 ms 148060 KB Output is correct
13 Correct 31 ms 148060 KB Output is correct
14 Correct 32 ms 143964 KB Output is correct
15 Correct 31 ms 143956 KB Output is correct
16 Correct 30 ms 143932 KB Output is correct
17 Correct 31 ms 148048 KB Output is correct
18 Correct 31 ms 148020 KB Output is correct
19 Correct 32 ms 148108 KB Output is correct
20 Correct 31 ms 148048 KB Output is correct
21 Correct 33 ms 148056 KB Output is correct
22 Correct 31 ms 148060 KB Output is correct
23 Correct 32 ms 148060 KB Output is correct
24 Correct 31 ms 146116 KB Output is correct
25 Correct 31 ms 143956 KB Output is correct
26 Correct 31 ms 143964 KB Output is correct
27 Correct 32 ms 148156 KB Output is correct
28 Correct 33 ms 148060 KB Output is correct
29 Correct 31 ms 148052 KB Output is correct
30 Correct 31 ms 143964 KB Output is correct
31 Correct 30 ms 143856 KB Output is correct
32 Correct 32 ms 143960 KB Output is correct
33 Correct 33 ms 148052 KB Output is correct
34 Correct 31 ms 148048 KB Output is correct
35 Correct 31 ms 147932 KB Output is correct
36 Correct 31 ms 148056 KB Output is correct
37 Correct 33 ms 148048 KB Output is correct
38 Correct 32 ms 148060 KB Output is correct
39 Correct 31 ms 148048 KB Output is correct
40 Correct 31 ms 148052 KB Output is correct
41 Correct 31 ms 148052 KB Output is correct
42 Correct 31 ms 148060 KB Output is correct
43 Correct 31 ms 148056 KB Output is correct
44 Correct 31 ms 148060 KB Output is correct
45 Correct 31 ms 148052 KB Output is correct
46 Correct 31 ms 148192 KB Output is correct
47 Correct 31 ms 148060 KB Output is correct
48 Correct 32 ms 148052 KB Output is correct
49 Correct 32 ms 148060 KB Output is correct
50 Correct 31 ms 148312 KB Output is correct
51 Correct 32 ms 148060 KB Output is correct
52 Correct 31 ms 148368 KB Output is correct
53 Correct 31 ms 148060 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 144036 KB Output is correct
2 Correct 32 ms 143964 KB Output is correct
3 Correct 31 ms 143964 KB Output is correct
4 Correct 31 ms 143960 KB Output is correct
5 Correct 32 ms 143964 KB Output is correct
6 Correct 34 ms 148048 KB Output is correct
7 Correct 33 ms 148048 KB Output is correct
8 Correct 32 ms 148048 KB Output is correct
9 Correct 32 ms 148056 KB Output is correct
10 Correct 31 ms 144048 KB Output is correct
11 Correct 31 ms 148024 KB Output is correct
12 Correct 32 ms 148060 KB Output is correct
13 Correct 31 ms 148060 KB Output is correct
14 Correct 32 ms 143964 KB Output is correct
15 Correct 31 ms 143956 KB Output is correct
16 Correct 30 ms 143932 KB Output is correct
17 Correct 31 ms 148048 KB Output is correct
18 Correct 31 ms 148020 KB Output is correct
19 Correct 32 ms 148108 KB Output is correct
20 Correct 31 ms 148048 KB Output is correct
21 Correct 33 ms 148056 KB Output is correct
22 Correct 31 ms 148060 KB Output is correct
23 Correct 32 ms 148060 KB Output is correct
24 Correct 31 ms 146116 KB Output is correct
25 Correct 31 ms 143956 KB Output is correct
26 Correct 31 ms 143964 KB Output is correct
27 Correct 32 ms 148156 KB Output is correct
28 Correct 33 ms 148060 KB Output is correct
29 Correct 31 ms 148052 KB Output is correct
30 Correct 31 ms 143964 KB Output is correct
31 Correct 30 ms 143856 KB Output is correct
32 Correct 32 ms 143960 KB Output is correct
33 Correct 33 ms 148052 KB Output is correct
34 Correct 31 ms 148048 KB Output is correct
35 Correct 31 ms 147932 KB Output is correct
36 Correct 31 ms 148056 KB Output is correct
37 Correct 33 ms 148048 KB Output is correct
38 Correct 32 ms 148060 KB Output is correct
39 Correct 31 ms 148048 KB Output is correct
40 Correct 31 ms 148052 KB Output is correct
41 Correct 31 ms 148052 KB Output is correct
42 Correct 31 ms 148060 KB Output is correct
43 Correct 31 ms 148056 KB Output is correct
44 Correct 31 ms 148060 KB Output is correct
45 Correct 31 ms 148052 KB Output is correct
46 Correct 31 ms 148192 KB Output is correct
47 Correct 31 ms 148060 KB Output is correct
48 Correct 32 ms 148052 KB Output is correct
49 Correct 32 ms 148060 KB Output is correct
50 Correct 31 ms 148312 KB Output is correct
51 Correct 32 ms 148060 KB Output is correct
52 Correct 31 ms 148368 KB Output is correct
53 Correct 31 ms 148060 KB Output is correct
54 Correct 31 ms 146164 KB Output is correct
55 Correct 32 ms 154192 KB Output is correct
56 Correct 31 ms 148060 KB Output is correct
57 Correct 36 ms 176988 KB Output is correct
58 Correct 54 ms 164592 KB Output is correct
59 Correct 220 ms 209540 KB Output is correct
60 Correct 223 ms 209992 KB Output is correct
61 Correct 222 ms 209492 KB Output is correct
62 Correct 31 ms 146008 KB Output is correct
63 Correct 213 ms 208980 KB Output is correct
64 Runtime error 340 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -