Submission #364981

#	Time	Username	Problem	Language	Result	Execution time	Memory
364981		Mamnoon_Siam	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	230 ms	185708 KiB

dango_maker

#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 (stderr)

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 / 13
• Subtask 2: 20 / 20
• Subtask 3: 67 / 67