Submission #939204

#TimeUsernameProblemLanguageResultExecution timeMemory
939204vjudge1Dango Maker (JOI18_dango_maker)C++17
100 / 100
903 ms18580 KiB
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #include <x86intrin.h> #include <bits/stdc++.h> #include <chrono> #include <random> // @author: Vlapos namespace operators { template <typename T1, typename T2> std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x) { in >> x.first >> x.second; return in; } template <typename T1, typename T2> std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x) { out << x.first << " " << x.second; return out; } template <typename T1> std::istream &operator>>(std::istream &in, std::vector<T1> &x) { for (auto &i : x) in >> i; return in; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::vector<T1> &x) { for (auto &i : x) out << i << " "; return out; } template <typename T1> std::ostream &operator<<(std::ostream &out, std::set<T1> &x) { for (auto &i : x) out << i << " "; return out; } } // name spaces using namespace std; using namespace operators; // end of name spaces // defines #define ll long long #define ull unsigned long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define pll pair<ll, ll> #define f first #define s second #define uint unsigned int #define all(vc) vc.begin(), vc.end() // end of defines // usefull stuff void boost() { ios_base ::sync_with_stdio(false); cin.tie(0); cout.tie(0); } inline int getbit(int &x, int &bt) { return (x >> bt) & 1; } const int dx4[4] = {-1, 0, 0, 1}; const int dy4[4] = {0, -1, 1, 0}; const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1}; const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1}; const ll INF = (1e18) + 500; const int BIG = (1e9) * 2 + 100; const int MAXN = (1e5) + 5; const int MOD7 = (1e9) + 7; const int MOD9 = (1e9) + 9; const uint MODFFT = 998244353; #define int ll struct test { void solve(int testcase) { boost(); int n, m; cin >> n >> m; vector<vector<char>> f(n, vector<char>(m)); cin >> f; int res = 0; for (int d = 2; d < n + m; ++d) { vector<vector<int>> dp(n, vector<int>(2, 0)); int cres = 0; for (int i = 0; i < n; ++i) { if (i) { dp[i][0] = dp[i - 1][0]; dp[i][1] = dp[i - 1][1]; } int j = d - i; if (j >= 0 and j < m and i - 2 >= 0 and f[i - 2][j] == 'R' and f[i - 1][j] == 'G' and f[i][j] == 'W') { dp[i][1] = max(dp[i][1], 1 + max(dp[i - 1][1], i - 3 >= 0 ? dp[i - 3][0] : 0)); // cout << "!\n"; } if (j >= 0 and j < m and j - 2 >= 0 and f[i][j - 2] == 'R' and f[i][j - 1] == 'G' and f[i][j] == 'W') { dp[i][0] = max(dp[i][0], 1 + (i ? max(dp[i - 1][0], dp[i - 1][1]) : 0)); // cout << "!\n"; } } res += max(dp[n - 1][0], dp[n - 1][1]); } cout << res << "\n"; } }; main() { boost(); int q = 1; // cin >> q; for (int i = 0; i < q; i++) { test t; t.solve(i); } return 0; } //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]// // // // Coded by Der_Vlἀpos // // // //[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message (stderr)

dango_maker.cpp: In member function 'void test::solve(long long int)':
dango_maker.cpp:108:17: warning: unused variable 'cres' [-Wunused-variable]
  108 |             int cres = 0;
      |                 ^~~~
dango_maker.cpp: At global scope:
dango_maker.cpp:134:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  134 | main()
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...