oj.uz

Submission #678562

# Submission time Handle Problem Language Result Execution time Memory
678562 2023-01-06T07:35:36 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
#define ll long long
#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/"

ll n, m, crr;
char a[3005][3005];
ll dp[3005][3005][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>n || 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);
            Max=max(Max, max(max(dp[i][j][0][0], dp[i][j][0][1]), max(dp[i][j][1][0], dp[i][j][1][1])));
        }
        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 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 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 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 0 ms 340 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 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 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 0 ms 340 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Incorrect 0 ms 340 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 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 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 0 ms 340 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Incorrect 0 ms 340 KB Output isn't correct
20 Halted 0 ms 0 KB -