oj.uz

Submission #915628

# Submission time Handle Problem Language Result Execution time Memory
915628 2024-01-24T12:03:06 Z efedmrlr Dango Maker (JOI18_dango_maker) C++17
13 / 100
 22 ms 35984 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e3+5;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,m,q;
vector<string> a(N);
vector<vector<int> > vis(N, vector<int>(N, 0));
int ans = 0;
inline void solve() {
    cin>>n>>m;
    for(int i = 1; i<=n; i++) {
        cin>>a[i];
        a[i] = '0' + a[i];
    }
    for(int i = 1; i<=n; i++) {
        for(int j = 1; j<=m; j++) {
            if(a[i][j] != 'W') continue;
            if(i > 2 && a[i - 1][j] == 'G' && a[i - 2][j] == 'R' && !vis[i - 1][j] && !vis[i - 2][j]) {
                ans++;
                vis[i - 1][j] = 1; vis[i - 2][j] = 1;
            }
            else if(j > 2 && a[i][j - 1] == 'G' && a[i][j - 2] == 'R' && !vis[i][j - 1] && !vis[i][j - 2] ){
                ans++;
                vis[i][j - 1] = 1; vis[i][j - 2] = 1;
            }
        }
    }
    cout << ans << "\n";
   

}
 
signed main() {

    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35920 KB Output is correct
2 Correct 19 ms 35784 KB Output is correct
3 Correct 18 ms 35928 KB Output is correct
4 Correct 18 ms 35932 KB Output is correct
5 Correct 19 ms 35932 KB Output is correct
6 Correct 20 ms 35932 KB Output is correct
7 Correct 19 ms 35932 KB Output is correct
8 Correct 19 ms 35932 KB Output is correct
9 Correct 22 ms 35984 KB Output is correct
10 Correct 19 ms 35920 KB Output is correct
11 Correct 19 ms 35932 KB Output is correct
12 Correct 19 ms 35928 KB Output is correct
13 Correct 18 ms 35928 KB Output is correct
14 Correct 19 ms 35928 KB Output is correct
15 Correct 19 ms 35928 KB Output is correct
16 Correct 19 ms 35932 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35920 KB Output is correct
2 Correct 19 ms 35784 KB Output is correct
3 Correct 18 ms 35928 KB Output is correct
4 Correct 18 ms 35932 KB Output is correct
5 Correct 19 ms 35932 KB Output is correct
6 Correct 20 ms 35932 KB Output is correct
7 Correct 19 ms 35932 KB Output is correct
8 Correct 19 ms 35932 KB Output is correct
9 Correct 22 ms 35984 KB Output is correct
10 Correct 19 ms 35920 KB Output is correct
11 Correct 19 ms 35932 KB Output is correct
12 Correct 19 ms 35928 KB Output is correct
13 Correct 18 ms 35928 KB Output is correct
14 Correct 19 ms 35928 KB Output is correct
15 Correct 19 ms 35928 KB Output is correct
16 Correct 19 ms 35932 KB Output is correct
17 Correct 19 ms 35932 KB Output is correct
18 Correct 17 ms 35788 KB Output is correct
19 Correct 19 ms 35932 KB Output is correct
20 Incorrect 19 ms 35932 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 35920 KB Output is correct
2 Correct 19 ms 35784 KB Output is correct
3 Correct 18 ms 35928 KB Output is correct
4 Correct 18 ms 35932 KB Output is correct
5 Correct 19 ms 35932 KB Output is correct
6 Correct 20 ms 35932 KB Output is correct
7 Correct 19 ms 35932 KB Output is correct
8 Correct 19 ms 35932 KB Output is correct
9 Correct 22 ms 35984 KB Output is correct
10 Correct 19 ms 35920 KB Output is correct
11 Correct 19 ms 35932 KB Output is correct
12 Correct 19 ms 35928 KB Output is correct
13 Correct 18 ms 35928 KB Output is correct
14 Correct 19 ms 35928 KB Output is correct
15 Correct 19 ms 35928 KB Output is correct
16 Correct 19 ms 35932 KB Output is correct
17 Correct 19 ms 35932 KB Output is correct
18 Correct 17 ms 35788 KB Output is correct
19 Correct 19 ms 35932 KB Output is correct
20 Incorrect 19 ms 35932 KB Output isn't correct
21 Halted 0 ms 0 KB -