oj.uz

Submission #399430

# Submission time Handle Problem Language Result Execution time Memory
399430 2021-05-05T19:07:23 Z SavicS Dango Maker (JOI18_dango_maker) C++14
100 / 100
 314 ms 35720 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 3005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m;
char mat[maxn][maxn];

bool ok[maxn][maxn][2];
int dp[maxn][3];

int main() 
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n >> m;
    ff(i,1,n)ff(j,1,m)cin >> mat[i][j];

    ff(i,1,n) {
        ff(j,1,m) {
            if(mat[i][j] == 'G') {
                if(i > 1 && i < n && mat[i - 1][j] == 'R' && mat[i + 1][j] == 'W')ok[i][j][0] = 1;
                if(j > 1 && j < m && mat[i][j - 1] == 'R' && mat[i][j + 1] == 'W')ok[i][j][1] = 1;
            }
        }
    }

    int rez = 0;
    ff(a,1,n + m) {
        memset(dp, 0, sizeof(dp));

        ff(i,1,n) {
            if(a - i >= 1 && a - i <= m) {
                int j = a - i;
                dp[i][0] = max({dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]});

                if(ok[i][j][0])dp[i][1] = max(dp[i - 1][0], dp[i - 1][1]) + 1;
                if(ok[i][j][1])dp[i][2] = max(dp[i - 1][0], dp[i - 1][2]) + 1;

            } else ff(j,0,2)dp[i][j] = dp[i - 1][j];
        }

        rez += max({dp[n][0], dp[n][1], dp[n][2]});

    }

    cout << rez << endl;
    return 0;
}
/**

3 4
RGWR
GRGG
RGWW

// probati bojenje sahovski ili slicno

**/

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 5 ms 332 KB Output is correct
55 Correct 34 ms 9632 KB Output is correct
56 Correct 5 ms 332 KB Output is correct
57 Correct 20 ms 13276 KB Output is correct
58 Correct 37 ms 10076 KB Output is correct
59 Correct 290 ms 35520 KB Output is correct
60 Correct 314 ms 35720 KB Output is correct
61 Correct 311 ms 35592 KB Output is correct
62 Correct 4 ms 332 KB Output is correct
63 Correct 304 ms 35528 KB Output is correct
64 Correct 231 ms 35508 KB Output is correct
65 Correct 231 ms 35524 KB Output is correct
66 Correct 250 ms 35524 KB Output is correct
67 Correct 250 ms 27820 KB Output is correct
68 Correct 250 ms 27996 KB Output is correct
69 Correct 250 ms 31772 KB Output is correct
70 Correct 30 ms 10060 KB Output is correct
71 Correct 30 ms 10052 KB Output is correct
72 Correct 31 ms 10280 KB Output is correct
73 Correct 33 ms 10120 KB Output is correct
74 Correct 30 ms 10052 KB Output is correct
75 Correct 30 ms 10044 KB Output is correct
76 Correct 30 ms 10060 KB Output is correct
77 Correct 31 ms 10120 KB Output is correct
78 Correct 30 ms 10112 KB Output is correct
79 Correct 30 ms 10052 KB Output is correct
80 Correct 32 ms 10224 KB Output is correct
81 Correct 30 ms 10108 KB Output is correct
82 Correct 31 ms 10052 KB Output is correct
83 Correct 34 ms 10052 KB Output is correct
84 Correct 31 ms 10072 KB Output is correct
85 Correct 30 ms 10124 KB Output is correct
86 Correct 30 ms 10064 KB Output is correct
87 Correct 31 ms 10060 KB Output is correct
88 Correct 30 ms 10052 KB Output is correct
89 Correct 31 ms 10092 KB Output is correct
90 Correct 31 ms 10108 KB Output is correct