oj.uz

답안 #1099160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099160 2024-10-10T16:08:56 Z Tymond Dango Maker (JOI18_dango_maker) C++17
13 / 100
 35 ms 71004 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 3e3 + 7;
char tab[MAXN][MAXN];
int used[MAXN][MAXN];
int f[MAXN][MAXN][2];
int n, m;

const int MAXK = 3e6 + 7;
vi g[MAXK];
int c[MAXK];
int vis[MAXK];
int k;
int num[2];

void dfs(int v){
    vis[v] = 1;
    num[c[v]]++;
    for(auto u : g[v]){
        if(!vis[u]){
            c[u] = !c[v];
            dfs(u);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> tab[i][j];
            f[i][j][0] = f[i][j][1] = -1;
        }
    }

    k = 1;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(j + 2 <= m && tab[i][j] == 'R' && tab[i][j + 1] == 'G' && tab[i][j + 2] == 'W'){
                f[i][j][0] = k++;
                if(i > 1 && j < m && f[i - 1][j + 1][1] != -1){
                    g[f[i][j][0]].pb(f[i - 1][j + 1][1]);
                    g[f[i - 1][j + 1][1]].pb(f[i][j][0]);
                }

                if(i > 2 && j < m - 1 && f[i - 2][j + 2][1] != -1){
                    g[f[i][j][0]].pb(f[i - 2][j + 2][1]);
                    g[f[i - 2][j + 2][1]].pb(f[i][j][0]);
                }
            }

            if(i + 2 <= n && tab[i][j] == 'R' && tab[i + 1][j] == 'G' && tab[i + 2][j] == 'W'){
                f[i][j][1] = k++;
                if(j > 1 && i < n && f[i + 1][j - 1][0] != -1){
                    g[f[i][j][1]].pb(f[i + 1][j - 1][0]);
                    g[f[i + 1][j - 1][0]].pb(f[i][j][1]);
                }

                if(j > 2 && i < n - 1 && f[i + 2][j - 2][0] != -1){
                    g[f[i][j][1]].pb(f[i + 2][j - 2][0]);
                    g[f[i + 2][j - 2][0]].pb(f[i][j][1]);
                }
            }

            if(f[i][j][0] != -1 && f[i][j][1] != -1){
                g[f[i][j][0]].pb(f[i][j][1]);
                g[f[i][j][1]].pb(f[i][j][0]);
            }
        }
    }

    int ans = 0;
    for(int i = 1; i < k; i++){
        if(!vis[i]){
            num[0] = num[1] = 0;
            dfs(i);
            ans += max(num[0], num[1]);
        }
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70732 KB Output is correct
2 Correct 34 ms 70736 KB Output is correct
3 Correct 29 ms 70748 KB Output is correct
4 Correct 33 ms 70740 KB Output is correct
5 Correct 33 ms 70748 KB Output is correct
6 Correct 29 ms 70740 KB Output is correct
7 Correct 28 ms 70736 KB Output is correct
8 Correct 29 ms 70736 KB Output is correct
9 Correct 29 ms 70740 KB Output is correct
10 Correct 28 ms 70744 KB Output is correct
11 Correct 28 ms 70864 KB Output is correct
12 Correct 29 ms 70800 KB Output is correct
13 Correct 29 ms 70744 KB Output is correct
14 Correct 28 ms 70748 KB Output is correct
15 Correct 28 ms 70736 KB Output is correct
16 Correct 28 ms 70740 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70732 KB Output is correct
2 Correct 34 ms 70736 KB Output is correct
3 Correct 29 ms 70748 KB Output is correct
4 Correct 33 ms 70740 KB Output is correct
5 Correct 33 ms 70748 KB Output is correct
6 Correct 29 ms 70740 KB Output is correct
7 Correct 28 ms 70736 KB Output is correct
8 Correct 29 ms 70736 KB Output is correct
9 Correct 29 ms 70740 KB Output is correct
10 Correct 28 ms 70744 KB Output is correct
11 Correct 28 ms 70864 KB Output is correct
12 Correct 29 ms 70800 KB Output is correct
13 Correct 29 ms 70744 KB Output is correct
14 Correct 28 ms 70748 KB Output is correct
15 Correct 28 ms 70736 KB Output is correct
16 Correct 28 ms 70740 KB Output is correct
17 Correct 29 ms 70912 KB Output is correct
18 Correct 28 ms 70748 KB Output is correct
19 Correct 28 ms 70736 KB Output is correct
20 Correct 28 ms 70744 KB Output is correct
21 Correct 30 ms 71004 KB Output is correct
22 Correct 31 ms 71004 KB Output is correct
23 Correct 31 ms 70736 KB Output is correct
24 Correct 29 ms 70736 KB Output is correct
25 Correct 29 ms 71004 KB Output is correct
26 Correct 32 ms 70744 KB Output is correct
27 Correct 28 ms 70740 KB Output is correct
28 Correct 32 ms 70992 KB Output is correct
29 Correct 34 ms 70744 KB Output is correct
30 Correct 30 ms 70748 KB Output is correct
31 Correct 33 ms 71004 KB Output is correct
32 Correct 31 ms 71004 KB Output is correct
33 Correct 32 ms 70880 KB Output is correct
34 Incorrect 32 ms 71000 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70732 KB Output is correct
2 Correct 34 ms 70736 KB Output is correct
3 Correct 29 ms 70748 KB Output is correct
4 Correct 33 ms 70740 KB Output is correct
5 Correct 33 ms 70748 KB Output is correct
6 Correct 29 ms 70740 KB Output is correct
7 Correct 28 ms 70736 KB Output is correct
8 Correct 29 ms 70736 KB Output is correct
9 Correct 29 ms 70740 KB Output is correct
10 Correct 28 ms 70744 KB Output is correct
11 Correct 28 ms 70864 KB Output is correct
12 Correct 29 ms 70800 KB Output is correct
13 Correct 29 ms 70744 KB Output is correct
14 Correct 28 ms 70748 KB Output is correct
15 Correct 28 ms 70736 KB Output is correct
16 Correct 28 ms 70740 KB Output is correct
17 Correct 29 ms 70912 KB Output is correct
18 Correct 28 ms 70748 KB Output is correct
19 Correct 28 ms 70736 KB Output is correct
20 Correct 28 ms 70744 KB Output is correct
21 Correct 30 ms 71004 KB Output is correct
22 Correct 31 ms 71004 KB Output is correct
23 Correct 31 ms 70736 KB Output is correct
24 Correct 29 ms 70736 KB Output is correct
25 Correct 29 ms 71004 KB Output is correct
26 Correct 32 ms 70744 KB Output is correct
27 Correct 28 ms 70740 KB Output is correct
28 Correct 32 ms 70992 KB Output is correct
29 Correct 34 ms 70744 KB Output is correct
30 Correct 30 ms 70748 KB Output is correct
31 Correct 33 ms 71004 KB Output is correct
32 Correct 31 ms 71004 KB Output is correct
33 Correct 32 ms 70880 KB Output is correct
34 Incorrect 32 ms 71000 KB Output isn't correct
35 Halted 0 ms 0 KB -