oj.uz

Submission #943157

# Submission time Handle Problem Language Result Execution time Memory
943157 2024-03-11T08:47:16 Z Baizho Dango Maker (JOI18_dango_maker) C++14
13 / 100
 8 ms 27476 KB 
#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

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); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 6 ms 25180 KB Output is correct
4 Correct 6 ms 25180 KB Output is correct
5 Correct 6 ms 25204 KB Output is correct
6 Correct 7 ms 27228 KB Output is correct
7 Correct 7 ms 27228 KB Output is correct
8 Correct 6 ms 27224 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 6 ms 27228 KB Output is correct
11 Correct 7 ms 27252 KB Output is correct
12 Correct 6 ms 27228 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 6 ms 27228 KB Output is correct
16 Correct 7 ms 27228 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 6 ms 25180 KB Output is correct
4 Correct 6 ms 25180 KB Output is correct
5 Correct 6 ms 25204 KB Output is correct
6 Correct 7 ms 27228 KB Output is correct
7 Correct 7 ms 27228 KB Output is correct
8 Correct 6 ms 27224 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 6 ms 27228 KB Output is correct
11 Correct 7 ms 27252 KB Output is correct
12 Correct 6 ms 27228 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 6 ms 27228 KB Output is correct
16 Correct 7 ms 27228 KB Output is correct
17 Correct 7 ms 25436 KB Output is correct
18 Correct 7 ms 25180 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 25180 KB Output is correct
21 Correct 5 ms 25180 KB Output is correct
22 Correct 6 ms 27228 KB Output is correct
23 Correct 6 ms 27328 KB Output is correct
24 Correct 5 ms 25180 KB Output is correct
25 Correct 6 ms 25176 KB Output is correct
26 Correct 6 ms 25180 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 6 ms 27312 KB Output is correct
31 Correct 8 ms 27476 KB Output is correct
32 Correct 6 ms 27228 KB Output is correct
33 Correct 6 ms 27224 KB Output is correct
34 Incorrect 6 ms 25180 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 6 ms 25180 KB Output is correct
4 Correct 6 ms 25180 KB Output is correct
5 Correct 6 ms 25204 KB Output is correct
6 Correct 7 ms 27228 KB Output is correct
7 Correct 7 ms 27228 KB Output is correct
8 Correct 6 ms 27224 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 6 ms 27228 KB Output is correct
11 Correct 7 ms 27252 KB Output is correct
12 Correct 6 ms 27228 KB Output is correct
13 Correct 6 ms 25180 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 6 ms 27228 KB Output is correct
16 Correct 7 ms 27228 KB Output is correct
17 Correct 7 ms 25436 KB Output is correct
18 Correct 7 ms 25180 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 25180 KB Output is correct
21 Correct 5 ms 25180 KB Output is correct
22 Correct 6 ms 27228 KB Output is correct
23 Correct 6 ms 27328 KB Output is correct
24 Correct 5 ms 25180 KB Output is correct
25 Correct 6 ms 25176 KB Output is correct
26 Correct 6 ms 25180 KB Output is correct
27 Correct 6 ms 27228 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 6 ms 27312 KB Output is correct
31 Correct 8 ms 27476 KB Output is correct
32 Correct 6 ms 27228 KB Output is correct
33 Correct 6 ms 27224 KB Output is correct
34 Incorrect 6 ms 25180 KB Output isn't correct
35 Halted 0 ms 0 KB -