oj.uz

Submission #815018

# Submission time Handle Problem Language Result Execution time Memory
815018 2023-08-08T11:46:00 Z trucmai Dango Maker (JOI18_dango_maker) C++17
100 / 100
 267 ms 221456 KB 
    #include <bits/stdc++.h>
    using namespace std;
     
    #ifdef LOCAL
      #include "/home/trucmai/.vim/tools.h"
      #define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
      #else
      #define debug(x...)
    #endif
     
    void open(){
      if(fopen("i.inp","r")){
        freopen("i.inp","r",stdin);
        freopen("o.out","w",stdout);
      }
    }
     
    #define ll int
    #define all(a) (a).begin(), (a).end()
    #define vi vector<ll>
    #define pi pair<ll,ll>
    #define pii pair<ll,pair<ll,ll>>
    #define fi first
    #define se second
    #define gcd __gcd
    #define mset(a,v) memset(a, v, sizeof(a))
    #define endl '\n'
    #define spc " "
     
    const int MN = 3001,LOG = 27;
    const ll MOD = 1e9 + 7,INF = 1e9;
    ll n,m,dp[MN][MN][3],dango[MN][MN][3];
    char a[MN][MN];
    void solve(){
      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){
          if(a[i-1][j] == 'R' && a[i][j] == 'G' && a[i+1][j] == 'W') dango[i][j][1] = 1; 
          if(a[i][j-1] == 'R' && a[i][j] == 'G' && a[i][j+1] == 'W') dango[i][j][2] = 1;
        }
      for(ll i = 1;i <= n;++i){
        for(ll j = 1;j <= m;++j){
          dp[i][j][0] += max({dp[i-1][j+1][0],dp[i-1][j+1][1],dp[i-1][j+1][2]});
          dp[i][j][1] += max({dp[i-1][j+1][0],dp[i-1][j+1][1]}) + dango[i][j][1];
          dp[i][j][2] += max({dp[i-1][j+1][0],dp[i-1][j+1][2]}) + dango[i][j][2];
        }
      }
      ll res = 0; 
      for(ll i = 1;i <= n;++i)
        res += max(dp[i][1][0],max(dp[i][1][1],dp[i][1][2])); 
      for(ll i = 2;i <= m;++i)
        res += max(dp[n][i][0],max(dp[n][i][1],dp[n][i][2]));
      cout<<res<<endl;
    }
     
    signed main(){
      cin.tie(0) -> sync_with_stdio(0);
      open();
      ll t = 1; //cin>>t;
      while(t--) solve(); 
      cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    }

Compilation message

dango_maker.cpp: In function 'void open()':
dango_maker.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         freopen("i.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~
dango_maker.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen("o.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 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 0 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 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 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 0 ms 340 KB Output is correct
35 Correct 0 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 0 ms 340 KB Output is correct
39 Correct 0 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 1 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 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 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 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 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 0 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 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 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 0 ms 340 KB Output is correct
35 Correct 0 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 0 ms 340 KB Output is correct
39 Correct 0 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 1 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 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 9 ms 21948 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 9 ms 21576 KB Output is correct
58 Correct 32 ms 34468 KB Output is correct
59 Correct 255 ms 221456 KB Output is correct
60 Correct 228 ms 221316 KB Output is correct
61 Correct 267 ms 221216 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 234 ms 221320 KB Output is correct
64 Correct 175 ms 221208 KB Output is correct
65 Correct 172 ms 221316 KB Output is correct
66 Correct 181 ms 221252 KB Output is correct
67 Correct 158 ms 154952 KB Output is correct
68 Correct 164 ms 154964 KB Output is correct
69 Correct 176 ms 162100 KB Output is correct
70 Correct 27 ms 35152 KB Output is correct
71 Correct 27 ms 35056 KB Output is correct
72 Correct 27 ms 35072 KB Output is correct
73 Correct 26 ms 35172 KB Output is correct
74 Correct 27 ms 35120 KB Output is correct
75 Correct 27 ms 35148 KB Output is correct
76 Correct 26 ms 35124 KB Output is correct
77 Correct 29 ms 35244 KB Output is correct
78 Correct 27 ms 35140 KB Output is correct
79 Correct 26 ms 35084 KB Output is correct
80 Correct 27 ms 35100 KB Output is correct
81 Correct 28 ms 35172 KB Output is correct
82 Correct 27 ms 35132 KB Output is correct
83 Correct 27 ms 35148 KB Output is correct
84 Correct 26 ms 35132 KB Output is correct
85 Correct 27 ms 35148 KB Output is correct
86 Correct 29 ms 35164 KB Output is correct
87 Correct 27 ms 35176 KB Output is correct
88 Correct 28 ms 35172 KB Output is correct
89 Correct 25 ms 35120 KB Output is correct
90 Correct 27 ms 35132 KB Output is correct