oj.uz

Submission #364969

# Submission time Handle Problem Language Result Execution time Memory
364969 2021-02-10T16:08:50 Z farhan132 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 306 ms 159724 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};


ll dp[4][3005][3005];
char a[3005][3005];

ll sum[60010];

void solve(){

    mem(a, 'A');
    mem(sum , 0);
    mem(dp, 0);
    ll n , m;
    cin >> n >> m;
    for(ll i = 1; i <= n; i++){
        for(ll j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }
    for(ll i = 1; i <= n; i++){
        for(ll j = 1; j <= m; j++){
            dp[0][i][j] = max({dp[0][i-1][j+1] , dp[1][i-1][j+1] , dp[2][i-1][j+1]});
            if(a[i][j] == 'G' && a[i][j+1] == 'W' && a[i][j-1] == 'R') dp[1][i][j] = max(dp[1][i-1][j+1], dp[0][i-1][j+1]) + 1;
            if(a[i][j] == 'G' && a[i-1][j] == 'R' && a[i+1][j] == 'W') dp[2][i][j] = max(dp[2][i-1][j+1], dp[0][i-1][j+1]) + 1;
            sum[i + j] = max(sum[i + j] , max({dp[0][i][j] , dp[1][i][j] , dp[2][i][j]}));
        }
    }
    ll ans = 0;
    for(ll i = 2; i <= n+m; i++) ans += sum[i];
    cout << ans;
    
    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 150892 KB Output is correct
2 Correct 81 ms 150764 KB Output is correct
3 Correct 82 ms 150892 KB Output is correct
4 Correct 84 ms 150764 KB Output is correct
5 Correct 81 ms 150764 KB Output is correct
6 Correct 83 ms 150764 KB Output is correct
7 Correct 86 ms 150764 KB Output is correct
8 Correct 90 ms 150764 KB Output is correct
9 Correct 82 ms 150764 KB Output is correct
10 Correct 82 ms 150764 KB Output is correct
11 Correct 81 ms 150764 KB Output is correct
12 Correct 83 ms 150892 KB Output is correct
13 Correct 82 ms 150764 KB Output is correct
14 Correct 83 ms 150788 KB Output is correct
15 Correct 82 ms 150764 KB Output is correct
16 Correct 82 ms 150764 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 150892 KB Output is correct
2 Correct 81 ms 150764 KB Output is correct
3 Correct 82 ms 150892 KB Output is correct
4 Correct 84 ms 150764 KB Output is correct
5 Correct 81 ms 150764 KB Output is correct
6 Correct 83 ms 150764 KB Output is correct
7 Correct 86 ms 150764 KB Output is correct
8 Correct 90 ms 150764 KB Output is correct
9 Correct 82 ms 150764 KB Output is correct
10 Correct 82 ms 150764 KB Output is correct
11 Correct 81 ms 150764 KB Output is correct
12 Correct 83 ms 150892 KB Output is correct
13 Correct 82 ms 150764 KB Output is correct
14 Correct 83 ms 150788 KB Output is correct
15 Correct 82 ms 150764 KB Output is correct
16 Correct 82 ms 150764 KB Output is correct
17 Correct 81 ms 150764 KB Output is correct
18 Correct 81 ms 150764 KB Output is correct
19 Correct 83 ms 150764 KB Output is correct
20 Correct 81 ms 150764 KB Output is correct
21 Correct 81 ms 150764 KB Output is correct
22 Correct 83 ms 150764 KB Output is correct
23 Correct 81 ms 150764 KB Output is correct
24 Correct 80 ms 150892 KB Output is correct
25 Correct 82 ms 150764 KB Output is correct
26 Correct 82 ms 150892 KB Output is correct
27 Correct 81 ms 150892 KB Output is correct
28 Correct 83 ms 150892 KB Output is correct
29 Correct 81 ms 150892 KB Output is correct
30 Correct 82 ms 150764 KB Output is correct
31 Correct 82 ms 150764 KB Output is correct
32 Correct 83 ms 150764 KB Output is correct
33 Correct 82 ms 150780 KB Output is correct
34 Correct 81 ms 150764 KB Output is correct
35 Correct 84 ms 150764 KB Output is correct
36 Correct 84 ms 150764 KB Output is correct
37 Correct 87 ms 150764 KB Output is correct
38 Correct 81 ms 150764 KB Output is correct
39 Correct 81 ms 150764 KB Output is correct
40 Correct 82 ms 150764 KB Output is correct
41 Correct 80 ms 150892 KB Output is correct
42 Correct 81 ms 150764 KB Output is correct
43 Correct 82 ms 150764 KB Output is correct
44 Correct 83 ms 150764 KB Output is correct
45 Correct 81 ms 150764 KB Output is correct
46 Correct 83 ms 150764 KB Output is correct
47 Correct 81 ms 150764 KB Output is correct
48 Correct 81 ms 150764 KB Output is correct
49 Correct 82 ms 150764 KB Output is correct
50 Correct 83 ms 150728 KB Output is correct
51 Correct 81 ms 150764 KB Output is correct
52 Correct 83 ms 150764 KB Output is correct
53 Correct 81 ms 150832 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 150892 KB Output is correct
2 Correct 81 ms 150764 KB Output is correct
3 Correct 82 ms 150892 KB Output is correct
4 Correct 84 ms 150764 KB Output is correct
5 Correct 81 ms 150764 KB Output is correct
6 Correct 83 ms 150764 KB Output is correct
7 Correct 86 ms 150764 KB Output is correct
8 Correct 90 ms 150764 KB Output is correct
9 Correct 82 ms 150764 KB Output is correct
10 Correct 82 ms 150764 KB Output is correct
11 Correct 81 ms 150764 KB Output is correct
12 Correct 83 ms 150892 KB Output is correct
13 Correct 82 ms 150764 KB Output is correct
14 Correct 83 ms 150788 KB Output is correct
15 Correct 82 ms 150764 KB Output is correct
16 Correct 82 ms 150764 KB Output is correct
17 Correct 81 ms 150764 KB Output is correct
18 Correct 81 ms 150764 KB Output is correct
19 Correct 83 ms 150764 KB Output is correct
20 Correct 81 ms 150764 KB Output is correct
21 Correct 81 ms 150764 KB Output is correct
22 Correct 83 ms 150764 KB Output is correct
23 Correct 81 ms 150764 KB Output is correct
24 Correct 80 ms 150892 KB Output is correct
25 Correct 82 ms 150764 KB Output is correct
26 Correct 82 ms 150892 KB Output is correct
27 Correct 81 ms 150892 KB Output is correct
28 Correct 83 ms 150892 KB Output is correct
29 Correct 81 ms 150892 KB Output is correct
30 Correct 82 ms 150764 KB Output is correct
31 Correct 82 ms 150764 KB Output is correct
32 Correct 83 ms 150764 KB Output is correct
33 Correct 82 ms 150780 KB Output is correct
34 Correct 81 ms 150764 KB Output is correct
35 Correct 84 ms 150764 KB Output is correct
36 Correct 84 ms 150764 KB Output is correct
37 Correct 87 ms 150764 KB Output is correct
38 Correct 81 ms 150764 KB Output is correct
39 Correct 81 ms 150764 KB Output is correct
40 Correct 82 ms 150764 KB Output is correct
41 Correct 80 ms 150892 KB Output is correct
42 Correct 81 ms 150764 KB Output is correct
43 Correct 82 ms 150764 KB Output is correct
44 Correct 83 ms 150764 KB Output is correct
45 Correct 81 ms 150764 KB Output is correct
46 Correct 83 ms 150764 KB Output is correct
47 Correct 81 ms 150764 KB Output is correct
48 Correct 81 ms 150764 KB Output is correct
49 Correct 82 ms 150764 KB Output is correct
50 Correct 83 ms 150728 KB Output is correct
51 Correct 81 ms 150764 KB Output is correct
52 Correct 83 ms 150764 KB Output is correct
53 Correct 81 ms 150832 KB Output is correct
54 Correct 81 ms 150764 KB Output is correct
55 Correct 82 ms 150848 KB Output is correct
56 Correct 83 ms 150764 KB Output is correct
57 Correct 83 ms 150892 KB Output is correct
58 Correct 108 ms 151788 KB Output is correct
59 Correct 306 ms 159724 KB Output is correct
60 Correct 304 ms 159596 KB Output is correct
61 Correct 304 ms 159596 KB Output is correct
62 Correct 82 ms 150892 KB Output is correct
63 Correct 297 ms 159340 KB Output is correct
64 Correct 247 ms 159660 KB Output is correct
65 Correct 248 ms 159596 KB Output is correct
66 Correct 249 ms 159596 KB Output is correct
67 Correct 242 ms 159596 KB Output is correct
68 Correct 253 ms 159596 KB Output is correct
69 Correct 251 ms 159596 KB Output is correct
70 Correct 101 ms 151788 KB Output is correct
71 Correct 101 ms 151916 KB Output is correct
72 Correct 100 ms 151916 KB Output is correct
73 Correct 101 ms 151916 KB Output is correct
74 Correct 100 ms 151788 KB Output is correct
75 Correct 100 ms 151788 KB Output is correct
76 Correct 101 ms 151916 KB Output is correct
77 Correct 101 ms 151788 KB Output is correct
78 Correct 100 ms 151788 KB Output is correct
79 Correct 103 ms 151788 KB Output is correct
80 Correct 104 ms 151788 KB Output is correct
81 Correct 100 ms 151788 KB Output is correct
82 Correct 102 ms 151788 KB Output is correct
83 Correct 101 ms 151916 KB Output is correct
84 Correct 100 ms 151788 KB Output is correct
85 Correct 103 ms 151788 KB Output is correct
86 Correct 101 ms 151788 KB Output is correct
87 Correct 101 ms 151788 KB Output is correct
88 Correct 101 ms 151788 KB Output is correct
89 Correct 103 ms 151788 KB Output is correct
90 Correct 105 ms 151788 KB Output is correct