Submission #329317

#TimeUsernameProblemLanguageResultExecution timeMemory
329317HoneyBadgerDango Maker (JOI18_dango_maker)C++17
100 / 100
1326 ms45016 KiB
#include <iostream> #include <iomanip> #include <cstdio> #include <vector> #include <bitset> #include <string> #include <cstring> #include <map> #include <set> #include <stack> #include <queue> #include <deque> #include <utility> #include <algorithm> #include <random> #include <cmath> #include <cassert> #include <climits> #include <ctime> #include <chrono> /*#pragma GCC optimize("Ofast") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native") */ #ifdef LOCAL #define dbg(x) cout << #x << " : " << x << endl; #else #define dbg(x) #endif #define pb push_back #define ppb pop_back() #define mp make_pair #define fi(a, b) for (int i = a; i < b; i++) #define fj(a, b) for (int j = a; j < b; j++) #define fk(a, b) for (int k = a; k < b; k++) #define fi1(a, b) for (int i = a - 1; i >= b; i--) #define fj1(a, b) for (int j = a - 1; j >= b; j--) #define fk1(a, b) for (int k = a - 1; k >= b; k--) #define fx(x, a) for (auto& x : a) #define rep(i, a, b) for (int i = a; i < b; ++i) #define rep1(i, a, b) for (int i = a - 1; i >= b; --i) #define siz(x) (int)x.size() #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() using namespace std; template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; } template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; } ostream& operator << (ostream &out, const vector<int> &b) { for (auto k : b) out << k << ' '; return out; } typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef char ch; typedef string str; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pii> vpii; typedef vector<vpii> vvpii; typedef vector<ch> vch; typedef vector<vch> vvch; typedef vector<str> vs; const int MOD = 1000000007; const int INF = 1000000050; const long long BIG = (long long)2e18 + 50; const int MX = 3010; const double EPS = 1e-9; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int t[MX][MX]; int n, m; bool good(int i, int j) { return i >= 0 && j >= 0 && i < n && j < m; } int tod(int i, int j) { fk(0, 3) { if (!good(i, j) || t[i][j] != k) { return 0; } ++i; } return 1; } int tor(int i, int j) { fk(0, 3) { if (!good(i, j) || t[i][j] != k) { return 0; } ++j; } return 1; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; fi(0, n) { fj(0, m) { char c; cin >> c; if (c == 'R') t[i][j] = 0; else if (c == 'G') t[i][j] = 1; else t[i][j] = 2; } } int ans = 0; for (int sum = 0; sum <= n + m; ++sum) { int i = max(0, sum - m + 1); int j = sum - i; vvi dp(1, vi(3, 0)); while (good(i, j)) { vi w(3); w[2] = tod(i, j) + *max_element(all(dp.back())); w[1] = dp.back()[2]; w[0] = max(dp.back()[0] + tor(i, j), dp.back()[1]); dp.pb(w); ++i, --j; } ans += *max_element(all(dp.back())); } assert(ans <= n * m / 3); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...