oj.uz

Submission #678574

# Submission time Handle Problem Language Result Execution time Memory
678574 2023-01-06T07:46:07 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 407 ms 155000 KB 
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

#define LOCALIO "C:/Users/admin/Documents/Code/"
#define maxn 3100

ll n, m, crr;
char a[maxn][maxn];
ll dp[maxn][maxn][2][2];

bool check(ll i, ll j, ll di)
{
    if (di)
    {
        if (i+2>n || i<=0)
            return 0;
        if (a[i][j]!='R' || a[i+1][j]!='G' || a[i+2][j]!='W')
            return 0;
        return 1;
    }
    else
    {
        if (j+2>m || j<=0)
            return 0;
        if (a[i][j]!='R' || a[i][j+1]!='G' || a[i][j+2]!='W')
            return 0;
        return 1;
    }
}

int main()
{
    #ifdef LOCAL
        freopen( LOCALIO "input.txt","r",stdin) ;
        freopen( LOCALIO "output.txt","w",stdout) ;
    #endif

    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
//	freopen("FIBONACCI.inp","r",stdin);
//	freopen("FIBONACCI.out","w",stdout);
    cin >> n >> m;
    for (ll i=1; i<=n; i++)
        for (ll j=1; j<=m; j++)
            cin >> a[i][j];
    ll ans=0;
    for (ll k=2; k<=n+m; k++)
    {
        ll Max=0;
        for (ll i=1; i<=n; i++)
        {
            ll j=k-i; 
            if (j<=0 || j>m)
                continue;
            dp[i][j][0][0]=max(dp[i-1][j+1][0][0], dp[i-1][j+1][0][1]);
            dp[i][j][0][1]=max(dp[i-1][j+1][1][0], dp[i-1][j+1][1][1]);
            if (check(i, j, 1))
                dp[i][j][1][0]=dp[i][j][0][0]+1, dp[i][j][1][1]=dp[i][j][0][1]+1;
            if (check(i, j, 0))
                dp[i][j][0][0]=max(dp[i][j][0][0], dp[i-1][j+1][0][0]+1);
            ll val=max(max(dp[i][j][0][0], dp[i][j][0][1]), max(dp[i][j][1][0], dp[i][j][1][1]));
            // cout << i << " " << j << " " << val << "\n";
            Max=max(Max, val);
        }
        ans+=Max;
    }
    cout << ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 0 ms 340 KB Output is correct
55 Correct 17 ms 21612 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 10 ms 14804 KB Output is correct
58 Correct 39 ms 22976 KB Output is correct
59 Correct 358 ms 154968 KB Output is correct
60 Correct 363 ms 154944 KB Output is correct
61 Correct 407 ms 154940 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 383 ms 154992 KB Output is correct
64 Correct 344 ms 154976 KB Output is correct
65 Correct 345 ms 154948 KB Output is correct
66 Correct 308 ms 154900 KB Output is correct
67 Correct 334 ms 154892 KB Output is correct
68 Correct 335 ms 154904 KB Output is correct
69 Correct 330 ms 155000 KB Output is correct
70 Correct 53 ms 23024 KB Output is correct
71 Correct 33 ms 23008 KB Output is correct
72 Correct 33 ms 22972 KB Output is correct
73 Correct 33 ms 22984 KB Output is correct
74 Correct 41 ms 22968 KB Output is correct
75 Correct 34 ms 22948 KB Output is correct
76 Correct 35 ms 22960 KB Output is correct
77 Correct 39 ms 22984 KB Output is correct
78 Correct 35 ms 22948 KB Output is correct
79 Correct 36 ms 22988 KB Output is correct
80 Correct 45 ms 23156 KB Output is correct
81 Correct 38 ms 22992 KB Output is correct
82 Correct 35 ms 23056 KB Output is correct
83 Correct 40 ms 23064 KB Output is correct
84 Correct 34 ms 22948 KB Output is correct
85 Correct 56 ms 23068 KB Output is correct
86 Correct 38 ms 22976 KB Output is correct
87 Correct 35 ms 22968 KB Output is correct
88 Correct 38 ms 22968 KB Output is correct
89 Correct 33 ms 22988 KB Output is correct
90 Correct 32 ms 22992 KB Output is correct