oj.uz

Submission #1095539

# Submission time Handle Problem Language Result Execution time Memory
1095539 2024-10-02T14:12:05 Z Lakshya108 Dango Maker (JOI18_dango_maker) C++14
0 / 100
 1 ms 348 KB 
// https://oj.uz/problem/view/JOI18_dango_maker
// OI\JOI18\JOI18-Dango Maker.pdf

#include <bits/stdc++.h>
using namespace std;

// Macros
#define pb          push_back
#define pf          push_front
#define ff          first
#define ss          second
#define all(v)      v.begin(), v.end()
#define rall(v)     v.rbegin(), v.rend()

// #define rep(i, x, n)   for(int i = x; i < n; ++i)
// #define rrep(i, x, n)  for(int i = x; i >= n; --i)

// Read and Print
#define read(a, n) for(ll i = 0; i < n; ++i) cin >> a[i];
#define print(a, n) for(ll i = 0; i < n; ++i){ cout << a[i] << " ";} cout << "\n";
#define endl "\n"
#define sp " "

// Typedefs
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <ll> vi;
typedef vector <vector <ll>> vvi;
using vec = vector<int>;

// Constants
const ll mxn = 1e6 + 5;
const ll mod = 1e9 + 7;

// Solve

void solve() {
    int n, m;   cin>>n>>m;
    vector<pii> coords(n*m);
    vector<vec> a(n+1, vec(m+1));
    int k = 0;
    for(int i = 0; i<n; i++){
        string st;  cin>>st;
        for(int j = 0; j<m; j++){
            char ch = st[j];
            if(ch == 'R'){
                a[i][j] = 1;
                coords[k].ff  = i;
                coords[k].ss = j;
                k++;
            }
            else if(ch == 'G')  a[i][j] = 2;
            else a[i][j] = 3;
        }
    }
    int cnt = 0;
    for(int i = 0; i<k; i++){
        int x = coords[i].ff, y = coords[i].ss;
        if(x+2<n && a[x+1][y]==2 && a[x+2][y]==3)    cnt++;
        if(y+2<m && a[x][y+1]==2 && a[x][y+2]==3)    cnt++;
    }
    cout<<cnt<<endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();

    return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 -