oj.uz

답안 #1099152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099152 2024-10-10T15:57:21 Z Tymond Dango Maker (JOI18_dango_maker) C++17
0 / 100
 0 ms 348 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 ans;
int n, m;

void addRow(int x, int y){
    for(int i = y; i <= m; i++){
        if(used[x][i]){
            continue;
        }
        if(i + 2 <= m && !used[x][i + 1] && !used[x][i + 1]){
            if(tab[x][i] == 'R' && tab[x][i + 1] == 'G' && tab[x][i + 2] == 'W'){
                used[x][i] = used[x][i + 1] = used[x][i + 2] = 1;
                ans++;
            }
        }

        if(!used[x][i] && x + 2 <= n && !used[x + 1][i] && !used[x + 2][i]){
            if(tab[x][i] == 'R' && tab[x + 1][i] == 'G' && tab[x + 2][i] == 'W'){
                ans++;
                used[x][i] = used[x + 1][i] = used[x + 2][i] = 1;
            }
        }
    }
}

void addColumn(int x, int y){
    for(int i = y; i <= n; i++){
        if(used[i][x]){
            continue;
        }
        if(i + 2 <= n && !used[i + 1][x] && !used[i + 1][x]){
            if(tab[i][x] == 'R' && tab[i + 1][x] == 'G' && tab[i + 2][x] == 'W'){
                ans++;
                used[i][x] = used[i + 1][x] = used[i + 2][x] = 1;
            }
        }

        if(!used[i][x] && x + 2 <= m && !used[i][x + 1] && !used[i][x + 1]){
            if(tab[i][x] == 'R' && tab[i][x + 1] == 'G' && tab[i][x + 2] == 'W'){
                used[i][x] = used[i][x + 1] = used[i][x + 2] = 1;
                ans++;
            }
        }
    }
}

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];
        }
    }

    ans = 0;
    for(int i = 1; i <= min(n, m); i++){
        addColumn(i, i);
        addRow(i, i);
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -