oj.uz

Submission #65003

# Submission time Handle Problem Language Result Execution time Memory
65003 2018-08-06T12:06:46 Z patrikpavic2 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 2000 ms 263168 KB 
#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

const int N = 3e3 + 50;
const int M = N * N / 3;

vector < int > v[M];

int bio[M];
bool ty[M];
int mat[M], kk[N][N][2];
char s[N][N];
int n, m, edg, cnt = 1, cookie = 1;

int dfs( int node ) {
    if( bio[ node ] == cookie) return 0;
    bio[ node ] = cookie;
    for(int sus : v[node]){
        if( mat[ sus ] == -1 || dfs( mat[ sus ]) ) {
            mat[ sus ] = node;
            return 1;
        }
    }
    return 0;
}

int matching( ) {
    int sol = 0;
    memset( mat, -1, sizeof( mat ) );
    for( int i = 1; i < cnt; i++) {
        if(ty[i]) continue;
        cookie++;
        sol += dfs(i);

    }
    return sol;
}


int main(){
    memset(s, '.', sizeof(s));
    scanf("%d%d", &n, &m);
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            char c = getchar_unlocked();
            while(c != 'R' && c != 'W' && c != 'G') c = getchar_unlocked();
            s[i][j] = c;
        }
    }
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            if(s[i][j] != 'G') continue;
            int kol = 0;
            if(s[i - 1][j] == 'R' && s[i + 1][j] == 'W'){
                kk[i][j][0] = cnt;
                cnt++;kol++;
            }
            if(s[i][j - 1] == 'R' && s[i][j + 1] == 'W'){
                ty[cnt] = 1;
                kk[i][j][1] = cnt;
                cnt++;kol++;
            }
            if(kol == 2){
                v[cnt - 1].push_back(cnt - 2);
                v[cnt - 2].push_back(cnt - 1);
                edg++;
            }
        }
    }
    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            if(i + 1 < n && j + 1 < m && s[i][j] == 'R' && s[i + 1][j] == 'G' && s[i][j + 1] == 'G' && s[i + 2][j] == 'W' && s[i][j + 2] == 'W'){
                v[kk[i + 1][j][0]].push_back(kk[i][j + 1][1]);
                v[kk[i][j + 1][1]].push_back(kk[i + 1][j][0]);
                //printf("AT %d %d\n", i, j);
                edg++;
            }
            if(i > 2 && j > 2 && s[i][j] == 'W' && s[i - 1][j] == 'G' && s[i][j - 1] == 'G' && s[i - 2][j] == 'R' && s[i][j - 2] == 'R'){
                v[kk[i - 1][j][0]].push_back(kk[i][j - 1][1]);
                v[kk[i][j - 1][1]].push_back(kk[i - 1][j][0]);
                //printf("AT %d %d\n", i, j);
                edg++;
            }

        }
    }
    //printf("EDG %d\n", edg);
    printf("%d\n", cnt - matching() - 1);
    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94328 KB Output is correct
2 Correct 89 ms 94584 KB Output is correct
3 Correct 87 ms 94672 KB Output is correct
4 Correct 84 ms 94672 KB Output is correct
5 Correct 96 ms 94672 KB Output is correct
6 Correct 96 ms 94672 KB Output is correct
7 Correct 95 ms 94672 KB Output is correct
8 Correct 85 ms 94672 KB Output is correct
9 Correct 89 ms 94672 KB Output is correct
10 Correct 87 ms 94672 KB Output is correct
11 Correct 85 ms 94672 KB Output is correct
12 Correct 81 ms 94672 KB Output is correct
13 Correct 85 ms 94672 KB Output is correct
14 Correct 85 ms 94672 KB Output is correct
15 Correct 84 ms 94676 KB Output is correct
16 Correct 85 ms 94676 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94328 KB Output is correct
2 Correct 89 ms 94584 KB Output is correct
3 Correct 87 ms 94672 KB Output is correct
4 Correct 84 ms 94672 KB Output is correct
5 Correct 96 ms 94672 KB Output is correct
6 Correct 96 ms 94672 KB Output is correct
7 Correct 95 ms 94672 KB Output is correct
8 Correct 85 ms 94672 KB Output is correct
9 Correct 89 ms 94672 KB Output is correct
10 Correct 87 ms 94672 KB Output is correct
11 Correct 85 ms 94672 KB Output is correct
12 Correct 81 ms 94672 KB Output is correct
13 Correct 85 ms 94672 KB Output is correct
14 Correct 85 ms 94672 KB Output is correct
15 Correct 84 ms 94676 KB Output is correct
16 Correct 85 ms 94676 KB Output is correct
17 Correct 87 ms 94676 KB Output is correct
18 Correct 87 ms 94676 KB Output is correct
19 Correct 84 ms 94676 KB Output is correct
20 Correct 91 ms 94676 KB Output is correct
21 Correct 84 ms 94808 KB Output is correct
22 Correct 83 ms 94808 KB Output is correct
23 Correct 83 ms 94808 KB Output is correct
24 Correct 80 ms 94808 KB Output is correct
25 Correct 100 ms 94808 KB Output is correct
26 Correct 94 ms 94808 KB Output is correct
27 Correct 101 ms 94808 KB Output is correct
28 Correct 104 ms 94808 KB Output is correct
29 Correct 113 ms 94808 KB Output is correct
30 Correct 103 ms 94808 KB Output is correct
31 Correct 102 ms 94808 KB Output is correct
32 Correct 84 ms 94808 KB Output is correct
33 Correct 101 ms 94808 KB Output is correct
34 Correct 90 ms 94808 KB Output is correct
35 Correct 135 ms 94808 KB Output is correct
36 Correct 92 ms 94808 KB Output is correct
37 Correct 94 ms 94808 KB Output is correct
38 Correct 100 ms 94808 KB Output is correct
39 Correct 94 ms 94808 KB Output is correct
40 Correct 97 ms 94808 KB Output is correct
41 Correct 110 ms 94832 KB Output is correct
42 Correct 98 ms 94832 KB Output is correct
43 Correct 93 ms 94832 KB Output is correct
44 Correct 83 ms 94832 KB Output is correct
45 Correct 89 ms 94832 KB Output is correct
46 Correct 102 ms 94832 KB Output is correct
47 Correct 90 ms 94832 KB Output is correct
48 Correct 92 ms 94832 KB Output is correct
49 Correct 96 ms 94832 KB Output is correct
50 Correct 107 ms 94832 KB Output is correct
51 Correct 99 ms 94832 KB Output is correct
52 Correct 118 ms 94832 KB Output is correct
53 Correct 119 ms 94832 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 94328 KB Output is correct
2 Correct 89 ms 94584 KB Output is correct
3 Correct 87 ms 94672 KB Output is correct
4 Correct 84 ms 94672 KB Output is correct
5 Correct 96 ms 94672 KB Output is correct
6 Correct 96 ms 94672 KB Output is correct
7 Correct 95 ms 94672 KB Output is correct
8 Correct 85 ms 94672 KB Output is correct
9 Correct 89 ms 94672 KB Output is correct
10 Correct 87 ms 94672 KB Output is correct
11 Correct 85 ms 94672 KB Output is correct
12 Correct 81 ms 94672 KB Output is correct
13 Correct 85 ms 94672 KB Output is correct
14 Correct 85 ms 94672 KB Output is correct
15 Correct 84 ms 94676 KB Output is correct
16 Correct 85 ms 94676 KB Output is correct
17 Correct 87 ms 94676 KB Output is correct
18 Correct 87 ms 94676 KB Output is correct
19 Correct 84 ms 94676 KB Output is correct
20 Correct 91 ms 94676 KB Output is correct
21 Correct 84 ms 94808 KB Output is correct
22 Correct 83 ms 94808 KB Output is correct
23 Correct 83 ms 94808 KB Output is correct
24 Correct 80 ms 94808 KB Output is correct
25 Correct 100 ms 94808 KB Output is correct
26 Correct 94 ms 94808 KB Output is correct
27 Correct 101 ms 94808 KB Output is correct
28 Correct 104 ms 94808 KB Output is correct
29 Correct 113 ms 94808 KB Output is correct
30 Correct 103 ms 94808 KB Output is correct
31 Correct 102 ms 94808 KB Output is correct
32 Correct 84 ms 94808 KB Output is correct
33 Correct 101 ms 94808 KB Output is correct
34 Correct 90 ms 94808 KB Output is correct
35 Correct 135 ms 94808 KB Output is correct
36 Correct 92 ms 94808 KB Output is correct
37 Correct 94 ms 94808 KB Output is correct
38 Correct 100 ms 94808 KB Output is correct
39 Correct 94 ms 94808 KB Output is correct
40 Correct 97 ms 94808 KB Output is correct
41 Correct 110 ms 94832 KB Output is correct
42 Correct 98 ms 94832 KB Output is correct
43 Correct 93 ms 94832 KB Output is correct
44 Correct 83 ms 94832 KB Output is correct
45 Correct 89 ms 94832 KB Output is correct
46 Correct 102 ms 94832 KB Output is correct
47 Correct 90 ms 94832 KB Output is correct
48 Correct 92 ms 94832 KB Output is correct
49 Correct 96 ms 94832 KB Output is correct
50 Correct 107 ms 94832 KB Output is correct
51 Correct 99 ms 94832 KB Output is correct
52 Correct 118 ms 94832 KB Output is correct
53 Correct 119 ms 94832 KB Output is correct
54 Correct 91 ms 94832 KB Output is correct
55 Correct 94 ms 95176 KB Output is correct
56 Correct 95 ms 95176 KB Output is correct
57 Correct 98 ms 101756 KB Output is correct
58 Correct 138 ms 107516 KB Output is correct
59 Correct 561 ms 184708 KB Output is correct
60 Correct 510 ms 193496 KB Output is correct
61 Correct 564 ms 202436 KB Output is correct
62 Correct 89 ms 202436 KB Output is correct
63 Correct 477 ms 210700 KB Output is correct
64 Execution timed out 2126 ms 263168 KB Time limit exceeded
65 Halted 0 ms 0 KB -