Submission #943157

#TimeUsernameProblemLanguageResultExecution timeMemory
943157BaizhoDango Maker (JOI18_dango_maker)C++14
13 / 100
8 ms27476 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt,sse3,avx") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(1e6)+100; const int M = ll(2e5) + 100; const long long inf = 5e18; //const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } int n, m, comp, id[3005][3005], siz, ans; bool vis[N]; char a[3005][3005]; vector<int> g[N]; void dfs(int v, int p = 0) { siz ++; vis[v] = 1; for(auto to : g[v]) { if(vis[to]) continue; dfs(to, v); } } void Baizho() { cin>>n>>m; for(int i = 1; i <= n; i ++) { for(int j = 1; j <= m; j ++) { cin>>a[i][j]; } } for(int i = 1; i <= n; i ++) { for(int j = 1; j <= m; j ++) { if(i + 2 <= n && a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W') { comp ++; id[i][j] = id[i + 1][j] = id[i + 2][j] = comp; } if(j + 2 <= m && a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W') { comp ++; if(id[i][j]) { // intersect is happening g[comp].pb(id[i][j]); g[id[i][j]].pb(comp); } if(id[i][j + 1]) { // intersect is happening g[comp].pb(id[i][j + 1]); g[id[i][j + 1]].pb(comp); } if(id[i][j + 2]) { // intersect is happening g[comp].pb(id[i][j + 2]); g[id[i][j + 2]].pb(comp); } } } } for(int i = 1; i <= comp; i ++) { if(!vis[i]) { siz = 0; dfs(i); ans += (siz + 1) / 2; } } cout<<ans<<"\n"; } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }

Compilation message (stderr)

dango_maker.cpp: In function 'void Freopen(std::string)':
dango_maker.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...