제출 #988307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
988307		steveonalex	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	628 KiB

dango_maker

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 7e3 + 69;
vector<pair<int, int>> pos[N];


int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<string> s(n);
    for(int i = 0; i<n; ++i) cin >> s[i];

    for(int i= 0; i<n; ++i) for(int j = 0; j<m; ++j) if (s[i][j] == 'G'){
        int vorp = 0;
        if (i > 0 && i + 1 < n && s[i-1][j] == 'R' && s[i+1][j] == 'W'){
            vorp += 1;
        }
        if (j > 0 && j + 1 < m && s[i][j-1] == 'R' && s[i][j+1] == 'W'){
            vorp += 2;
        }
        if (vorp) pos[i+j].push_back({i, vorp});
    }

    int ans = 0;
    for(int i = 0; i<n+m;++i) if (pos[i].size()){

        int cur = 1;
        for(int j = 1; j < pos[i].size(); ++j){
            bool check = true;
            if (pos[i][j].first - pos[i][j-1].first > 1) check = false;
            if (check){
                check = false;
                for(int x = 0; x <= 1; ++x)
                if (GETBIT(pos[i][j].second, x) && GETBIT(pos[i][j-1].second, 1^x)) check = true;
            }
            if (!check){
                ans += (cur + 1) / 2;
                cur = 1;
            }
            else cur++;
        }
        ans += (cur + 1) / 2;
    }
    cout << ans << "\n";

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:73:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int j = 1; j < pos[i].size(); ++j){
      |                        ~~^~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67