제출 #409012

#제출 시각아이디문제언어결과실행 시간메모리
409012arwaeystoamnegDango Maker (JOI18_dango_maker)C++17
0 / 100
1 ms332 KiB
// EXPLOSION! #define _CRT_SECURE_NO_WARNINGS #include<bits/stdc++.h> #include<unordered_set> #include<unordered_map> #include<chrono> using namespace std; typedef pair<int, int> pii; typedef long long ll; typedef pair<ll, ll> pll; typedef long double ld; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pair<int, int>> vpi; typedef vector<pair<ll, ll>> vpll; #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) #define pb push_back #define mp make_pair #define rsz resize #define sz(x) int(x.size()) #define all(x) x.begin(),x.end() #define f first #define s second #define cont continue #define endl '\n' //#define ednl '\n' #define test int testc;cin>>testc;while(testc--) #define pr(a, b) trav(x,a)cerr << x << b; cerr << endl; #define message cout << "Hello World" << endl; const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!! const ll linf = 4000000000000000000LL; const ll inf = 1000000007;//998244353 void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; } }void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; } void setIO(string s) { ios_base::sync_with_stdio(0); cin.tie(0); #ifdef arwaeystoamneg if (sz(s)) { freopen((s + ".in").c_str(), "r", stdin); if (s != "test1") freopen((s + ".out").c_str(), "w", stdout); } #endif } const int MAX = 3003, MAX_ = 18000003; int n, m, a[MAX][MAX]; int adj[MAX_][3], cur[MAX_]; bitset<MAX_>b, v; bool check(int i, int j, int t) { F0R(k, 3) { int x = i, y = j; if (x >= 0 && y >= 0 && x < n && y < m) { if (a[x][y] != k)return 0; } else { return 0; } i += dx[t], j += dy[t]; } return 1; } int c, d; void dfs(int i, int t = 1) { v[i] = 1; c += t; d++; F0R(j, cur[i]) { int x = adj[i][j]; if (v[x])continue; dfs(x, t ^ 1); } } int main() { setIO("test1"); cin >> n >> m; F0R(i, n) { string t; cin >> t; F0R(j, m)a[i][j] = (t[j] == 'R' ? 0 : (t[j] == 'G' ? 1 : 2)); } F0R(i, n) { F0R(j, m) { b[m * i + j] = check(i, j, 0); b[m * n + m * i + j] = check(i, j, 1); } } F0R(i, n) { F0R(j, m) { if (a[i][j] == 0) { if (b[m * n + m * i + j] && b[m * i + j]) { adj[m * n + m * i + j][cur[m * n + m * i + j]++] = (m * i + j); adj[m * i + j][cur[m * i + j]++] = (m * n + m * i + j); } } else if (a[i][j] == 1) { if (i > 0 && j > 0) { if (b[m * n + m * (i - 1) + (j - 1)] && b[m * (i - 1) + (j - 1)]) { adj[m * n + m * (i - 1) + (j - 1)][cur[m * n + m * (i - 1) + (j - 1)]++] = (m * (i - 1) + (j - 1)); adj[m * (i - 1) + (j - 1)][cur[m * (i - 1) + (j - 1)]++] = (m * n + m * (i - 1) + (j - 1)); } } } else { if (i > 1 && j > 1) { if (b[m * n + m * (i - 2) + (j - 2)] && b[m * (i - 2) + (j - 2)]) { adj[m * n + m * (i - 2) + (j - 2)][cur[m * n + m * (i - 2) + (j - 2)]++] = (m * (i - 2) + (j - 2)); adj[m * (i - 2) + (j - 2)][cur[m * (i - 2) + (j - 2)]++] = (m * n + m * (i - 2) + (j - 2)); } } } // couldve just written a loop ... } } int ans = 0; F0R(i, 2 * n * m) { if (b[i] && !v[i]) { c = 0, d = 0; dfs(i); if (c < d - c)c = d - c; ans += c; } } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...