oj.uz

답안 #704525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704525 2023-03-02T08:59:21 Z KenIsGenius Dango Maker (JOI18_dango_maker) C++17
33 / 100
 451 ms 262144 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;

#ifdef LOCAL
#define WOSAOJI freopen("in.txt", "r", stdin);
#else
#define WOSAOJI ios_base::sync_with_stdio(0), cin.tie(0);
#endif

#define chmax(a, b) (a) = (a) > (b) ? (a) : (b)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)

int n, m, cnt;
char c[3005][3005];
int a[3005][3005];
vector<int> adj[5000005];

void add_edge(int a, int b) {
    adj[a].pb(b);
    adj[b].pb(a);
}
bool crow(int i, int j) {
    int ok = 1;
    ok &= (c[i][j - 2] == 'R');
    ok &= (c[i][j - 1] == 'G');
    ok &= (c[i][j    ] == 'W');
    return ok;
}
bool col(int i, int j) {
    int ok = 1;
    ok &= (c[i - 2][j] == 'R');
    ok &= (c[i - 1][j] == 'G');
    ok &= (c[i    ][j] == 'W');
    return ok;
}
int match[5000005];
void dfs(int x, int v) {
    match[x] = v;
    for (int i : adj[x]) {
        if (match[i] == v) {
            dfs(i, v ^ 1);
            return;
        }
    }
}
signed main() {
    WOSAOJI
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> c[i][j];
            if (j >= 3 and crow(i, j)) {
                cnt++;
                a[i][j] = a[i][j - 1] = a[i][j - 2] = cnt;
            }
        }
    }
    for (int i = 3; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (col(i, j)) {
                cnt++;
                if (a[i - 2][j]) ;
                    add_edge(a[i - 2][j], cnt);
                if (a[i - 1][j]) ;
                    add_edge(a[i - 1][j], cnt);
                if (a[i    ][j]) ;
                    add_edge(a[i    ][j], cnt);
            }
        }
    }
    for (int i = 1; i <= cnt; i++) {
        if (!match[i]) dfs(i, 1);
    }
    int ans = 0;
    for (int i = 1; i <= cnt; i++) {
        ans += match[i];
    }
    cout << ans << '\n';
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:67:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   67 |                 if (a[i - 2][j]) ;
      |                 ^~
dango_maker.cpp:68:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   68 |                     add_edge(a[i - 2][j], cnt);
      |                     ^~~~~~~~
dango_maker.cpp:69:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   69 |                 if (a[i - 1][j]) ;
      |                 ^~
dango_maker.cpp:70:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   70 |                     add_edge(a[i - 1][j], cnt);
      |                     ^~~~~~~~
dango_maker.cpp:71:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   71 |                 if (a[i    ][j]) ;
      |                 ^~
dango_maker.cpp:72:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   72 |                     add_edge(a[i    ][j], cnt);
      |                     ^~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 117724 KB Output is correct
2 Correct 53 ms 117748 KB Output is correct
3 Correct 57 ms 117632 KB Output is correct
4 Correct 64 ms 117676 KB Output is correct
5 Correct 55 ms 117708 KB Output is correct
6 Correct 56 ms 117756 KB Output is correct
7 Correct 54 ms 117756 KB Output is correct
8 Correct 59 ms 117740 KB Output is correct
9 Correct 59 ms 117720 KB Output is correct
10 Correct 55 ms 117648 KB Output is correct
11 Correct 53 ms 117732 KB Output is correct
12 Correct 53 ms 117728 KB Output is correct
13 Correct 57 ms 117688 KB Output is correct
14 Correct 53 ms 117640 KB Output is correct
15 Correct 63 ms 117712 KB Output is correct
16 Correct 54 ms 117664 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 117724 KB Output is correct
2 Correct 53 ms 117748 KB Output is correct
3 Correct 57 ms 117632 KB Output is correct
4 Correct 64 ms 117676 KB Output is correct
5 Correct 55 ms 117708 KB Output is correct
6 Correct 56 ms 117756 KB Output is correct
7 Correct 54 ms 117756 KB Output is correct
8 Correct 59 ms 117740 KB Output is correct
9 Correct 59 ms 117720 KB Output is correct
10 Correct 55 ms 117648 KB Output is correct
11 Correct 53 ms 117732 KB Output is correct
12 Correct 53 ms 117728 KB Output is correct
13 Correct 57 ms 117688 KB Output is correct
14 Correct 53 ms 117640 KB Output is correct
15 Correct 63 ms 117712 KB Output is correct
16 Correct 54 ms 117664 KB Output is correct
17 Correct 54 ms 117668 KB Output is correct
18 Correct 53 ms 117748 KB Output is correct
19 Correct 54 ms 117756 KB Output is correct
20 Correct 61 ms 117688 KB Output is correct
21 Correct 56 ms 117732 KB Output is correct
22 Correct 56 ms 117784 KB Output is correct
23 Correct 54 ms 117720 KB Output is correct
24 Correct 53 ms 117720 KB Output is correct
25 Correct 53 ms 117688 KB Output is correct
26 Correct 57 ms 117656 KB Output is correct
27 Correct 58 ms 117788 KB Output is correct
28 Correct 65 ms 117800 KB Output is correct
29 Correct 55 ms 117844 KB Output is correct
30 Correct 54 ms 117760 KB Output is correct
31 Correct 55 ms 117652 KB Output is correct
32 Correct 55 ms 117728 KB Output is correct
33 Correct 63 ms 117692 KB Output is correct
34 Correct 55 ms 117752 KB Output is correct
35 Correct 59 ms 117756 KB Output is correct
36 Correct 54 ms 117728 KB Output is correct
37 Correct 58 ms 117708 KB Output is correct
38 Correct 53 ms 117752 KB Output is correct
39 Correct 57 ms 117756 KB Output is correct
40 Correct 54 ms 117792 KB Output is correct
41 Correct 54 ms 117708 KB Output is correct
42 Correct 56 ms 117780 KB Output is correct
43 Correct 53 ms 117808 KB Output is correct
44 Correct 54 ms 117808 KB Output is correct
45 Correct 53 ms 117732 KB Output is correct
46 Correct 55 ms 117800 KB Output is correct
47 Correct 56 ms 117748 KB Output is correct
48 Correct 53 ms 117684 KB Output is correct
49 Correct 61 ms 117776 KB Output is correct
50 Correct 54 ms 117732 KB Output is correct
51 Correct 55 ms 117708 KB Output is correct
52 Correct 60 ms 117732 KB Output is correct
53 Correct 55 ms 117724 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 117724 KB Output is correct
2 Correct 53 ms 117748 KB Output is correct
3 Correct 57 ms 117632 KB Output is correct
4 Correct 64 ms 117676 KB Output is correct
5 Correct 55 ms 117708 KB Output is correct
6 Correct 56 ms 117756 KB Output is correct
7 Correct 54 ms 117756 KB Output is correct
8 Correct 59 ms 117740 KB Output is correct
9 Correct 59 ms 117720 KB Output is correct
10 Correct 55 ms 117648 KB Output is correct
11 Correct 53 ms 117732 KB Output is correct
12 Correct 53 ms 117728 KB Output is correct
13 Correct 57 ms 117688 KB Output is correct
14 Correct 53 ms 117640 KB Output is correct
15 Correct 63 ms 117712 KB Output is correct
16 Correct 54 ms 117664 KB Output is correct
17 Correct 54 ms 117668 KB Output is correct
18 Correct 53 ms 117748 KB Output is correct
19 Correct 54 ms 117756 KB Output is correct
20 Correct 61 ms 117688 KB Output is correct
21 Correct 56 ms 117732 KB Output is correct
22 Correct 56 ms 117784 KB Output is correct
23 Correct 54 ms 117720 KB Output is correct
24 Correct 53 ms 117720 KB Output is correct
25 Correct 53 ms 117688 KB Output is correct
26 Correct 57 ms 117656 KB Output is correct
27 Correct 58 ms 117788 KB Output is correct
28 Correct 65 ms 117800 KB Output is correct
29 Correct 55 ms 117844 KB Output is correct
30 Correct 54 ms 117760 KB Output is correct
31 Correct 55 ms 117652 KB Output is correct
32 Correct 55 ms 117728 KB Output is correct
33 Correct 63 ms 117692 KB Output is correct
34 Correct 55 ms 117752 KB Output is correct
35 Correct 59 ms 117756 KB Output is correct
36 Correct 54 ms 117728 KB Output is correct
37 Correct 58 ms 117708 KB Output is correct
38 Correct 53 ms 117752 KB Output is correct
39 Correct 57 ms 117756 KB Output is correct
40 Correct 54 ms 117792 KB Output is correct
41 Correct 54 ms 117708 KB Output is correct
42 Correct 56 ms 117780 KB Output is correct
43 Correct 53 ms 117808 KB Output is correct
44 Correct 54 ms 117808 KB Output is correct
45 Correct 53 ms 117732 KB Output is correct
46 Correct 55 ms 117800 KB Output is correct
47 Correct 56 ms 117748 KB Output is correct
48 Correct 53 ms 117684 KB Output is correct
49 Correct 61 ms 117776 KB Output is correct
50 Correct 54 ms 117732 KB Output is correct
51 Correct 55 ms 117708 KB Output is correct
52 Correct 60 ms 117732 KB Output is correct
53 Correct 55 ms 117724 KB Output is correct
54 Correct 56 ms 117704 KB Output is correct
55 Correct 61 ms 126540 KB Output is correct
56 Correct 58 ms 117896 KB Output is correct
57 Correct 61 ms 128844 KB Output is correct
58 Correct 88 ms 131688 KB Output is correct
59 Correct 275 ms 182528 KB Output is correct
60 Correct 313 ms 182724 KB Output is correct
61 Correct 266 ms 182584 KB Output is correct
62 Correct 55 ms 117708 KB Output is correct
63 Correct 275 ms 182096 KB Output is correct
64 Runtime error 451 ms 262144 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -