oj.uz

Submission #364981

# Submission time Handle Problem Language Result Execution time Memory
364981 2021-02-10T16:58:00 Z Mamnoon_Siam Dango Maker (JOI18_dango_maker) C++17
100 / 100
 230 ms 185708 KB 
#include <bits/stdc++.h>
using namespace std;

/* sorry, this is the bare minimum :'( */
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
#define all(v) begin(v), end(v)
#define sz(v) (int)(v).size()
#define fi first
#define se second

string to_string(string s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 3003;

int dp[N][N][3]; // 0 = nothin, 1 = vertical, 2 = horizontal
char g[N][N];
int cnt[3][N][N];
int n, m;

int main(int argc, char const *argv[])
{
  cin.sync_with_stdio(0); cin.tie(0);
  cin.exceptions(cin.failbit);
#ifdef LOCAL
  freopen("in", "r", stdin);
#endif
  cin >> n >> m;
  for(int i = 1; i <= n; ++i) {
    cin >> (g[i] + 1);
  }
  for(int i = 1; i <= n; ++i) {
    for(int j = 1; j <= m; ++j) {
      if(g[i-1][j] == 'R' and g[i][j] == 'G' and g[i+1][j] == 'W')
        cnt[1][i][j] = 1;
      if(g[i][j-1] == 'R' and g[i][j] == 'G' and g[i][j+1] == 'W')
        cnt[2][i][j] = 1;
    }
  }
  for(int i = 1; i <= n; ++i) {
    for(int 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]});
      for(int k : {1, 2}) {
        dp[i][j][k] = max({dp[i-1][j+1][k], dp[i-1][j+1][0]}) + cnt[k][i][j];
      }
    }
  }
  int ans = 0;
  for(int i = 1; i <= n; ++i) {
    ans += max({dp[i][1][0], dp[i][1][1], dp[i][1][2]});
    debug(max({dp[i][1][0], dp[i][1][1], dp[i][1][2]}));
  }
  for(int j = 2; j <= m; ++j) {
    ans += max({dp[n][j][0], dp[n][j][1], dp[n][j][2]});
    debug(max({dp[n][j][0], dp[n][j][1], dp[n][j][2]}));
  }
  cout << ans << endl;
  return 0;
}

Compilation message

dango_maker.cpp: In function 'int main(int, const char**)':
dango_maker.cpp:56:20: warning: statement has no effect [-Wunused-value]
   56 | #define debug(...) 42
      |                    ^~
dango_maker.cpp:96:5: note: in expansion of macro 'debug'
   96 |     debug(max({dp[i][1][0], dp[i][1][1], dp[i][1][2]}));
      |     ^~~~~
dango_maker.cpp:56:20: warning: statement has no effect [-Wunused-value]
   56 | #define debug(...) 42
      |                    ^~
dango_maker.cpp:100:5: note: in expansion of macro 'debug'
  100 |     debug(max({dp[n][j][0], dp[n][j][1], dp[n][j][2]}));
      |     ^~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 492 KB Output is correct
44 Correct 1 ms 492 KB Output is correct
45 Correct 1 ms 492 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 1 ms 492 KB Output is correct
48 Correct 1 ms 492 KB Output is correct
49 Correct 1 ms 492 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 1 ms 492 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 15 ms 21996 KB Output is correct
56 Correct 1 ms 620 KB Output is correct
57 Correct 14 ms 24556 KB Output is correct
58 Correct 33 ms 34668 KB Output is correct
59 Correct 218 ms 185600 KB Output is correct
60 Correct 219 ms 185580 KB Output is correct
61 Correct 230 ms 185580 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 219 ms 185580 KB Output is correct
64 Correct 143 ms 185708 KB Output is correct
65 Correct 141 ms 185580 KB Output is correct
66 Correct 142 ms 185580 KB Output is correct
67 Correct 125 ms 130924 KB Output is correct
68 Correct 125 ms 131052 KB Output is correct
69 Correct 131 ms 140780 KB Output is correct
70 Correct 23 ms 34924 KB Output is correct
71 Correct 23 ms 34924 KB Output is correct
72 Correct 24 ms 34924 KB Output is correct
73 Correct 27 ms 34924 KB Output is correct
74 Correct 24 ms 34924 KB Output is correct
75 Correct 24 ms 34924 KB Output is correct
76 Correct 24 ms 34924 KB Output is correct
77 Correct 23 ms 34924 KB Output is correct
78 Correct 24 ms 34924 KB Output is correct
79 Correct 24 ms 34924 KB Output is correct
80 Correct 24 ms 34924 KB Output is correct
81 Correct 24 ms 34924 KB Output is correct
82 Correct 23 ms 34924 KB Output is correct
83 Correct 24 ms 34924 KB Output is correct
84 Correct 24 ms 34924 KB Output is correct
85 Correct 23 ms 34924 KB Output is correct
86 Correct 24 ms 34924 KB Output is correct
87 Correct 23 ms 34924 KB Output is correct
88 Correct 23 ms 34924 KB Output is correct
89 Correct 23 ms 34924 KB Output is correct
90 Correct 24 ms 34924 KB Output is correct