oj.uz

Submission #880514

# Submission time Handle Problem Language Result Execution time Memory
880514 2023-11-29T15:08:18 Z frostray8653 Dango Maker (JOI18_dango_maker) C++17
13 / 100
 2000 ms 600 KB 
#include <bits/stdc++.h>
#define int long long
#define IO ios::sync_with_stdio(0), cin.tie(0)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
using pii = pair<int, int>;
void dbg() {;}
template<class T, class ...U>
void dbg(T a, U ...b) { cout << a << " "; dbg(b...); }
void ent() { cout << "\n"; }
const int INF = 1e17;
const int N = 105;
char a[N][N];
int vis[N][N];
int ans = 0, res = 0;
int n, m;

void dfs(int x, int y) {
    if (x == n + 1) {
        ans = max(ans, res);
        return;
    }
    if (y == m + 1) {
        dfs(x + 1, 1);
        return;
    }
    if (vis[x][y]) {
        dfs(x, y + 1);
        return;
    }
    if (a[x][y] == 'R') {
        if (y + 2 <= m && a[x][y + 1] == 'G' && a[x][y + 2] == 'W' && !vis[x][y + 1] && !vis[x][y + 2]) {
            vis[x][y] = vis[x][y + 1] = vis[x][y + 2] = true;
            res += 1;
            dfs(x, y + 3);
            vis[x][y] = vis[x][y + 1] = vis[x][y + 2] = false;
            res -= 1;
        }
        if (x + 2 <= n && a[x + 1][y] == 'G' && a[x + 2][y] == 'W' && !vis[x + 1][y] && !vis[x + 2][y]) {
            vis[x][y] = vis[x + 1][y] = vis[x + 2][y] = true;
            res += 1;
            dfs(x, y + 1);
            vis[x][y] = vis[x + 1][y] = vis[x + 2][y] = false;
            res -= 1;
        }
    }
    dfs(x, y + 1);
}

signed main() {
    IO;
    
    cin >> n >> m;
    FOR(i, 1, n)
        FOR(j, 1, m)
            cin >> a[i][j];
    dfs(1, 1);
    cout << ans << "\n";

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 7 ms 472 KB Output is correct
21 Correct 11 ms 472 KB Output is correct
22 Correct 54 ms 500 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Execution timed out 2093 ms 348 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 7 ms 472 KB Output is correct
21 Correct 11 ms 472 KB Output is correct
22 Correct 54 ms 500 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Execution timed out 2093 ms 348 KB Time limit exceeded
28 Halted 0 ms 0 KB -