제출 #1122529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122529		gdragon	Dango Maker (JOI18_dango_maker)	C++20	13 / 100	187 ms	212608 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 3e3 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
int n, m;
char a[N][N];
int dp[N * N][2];
bool vis[N * N];
int timer = 0;
vector<int> node[N][N], adj[N];
void read() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) cin >> a[i][j];
    }
}
void addEdge(int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
    // cerr << u << ' ' << v << endl;
}
bool vis1[2][N * N];
int dfs(int u, int p, int c, int t) {
    vis[u] = 1;
    if (vis1[t][u]) return dp[u][c];
    vis1[t][u] = 1;
    dp[u][c] = c;
    for(int v: adj[u]) if (v != p) {
        dp[u][c] += dfs(v, u, c ^ 1, t);
    }
    return dp[u][c];
}
void solve() {
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) if (a[i][j] == 'R') {
            if (i + 2 <= n && a[i + 1][j] == 'G' && a[i + 2][j] == 'W') {
                ++timer;
                // cerr << i << ' ' << j << endl;
                int u = timer;
                for(int x = i; x <= i + 2; x++) {
                    for(int v: node[x][j]) addEdge(u, v);
                    node[x][j].push_back(u);
                }
            }
            if (j + 2 <= m && a[i][j + 1] == 'G' && a[i][j + 2] == 'W') {
                ++timer;
                int u = timer;
                // cerr << i << ' ' << j << endl;
                for(int x = j; x <= j + 2; x++) {
                    for(int v: node[i][x]) addEdge(u, v);
                    node[i][x].push_back(u);
                }
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= timer; i++) if (!vis[i]) {
        for(int j = 0; j < 2; j++) dfs(i, -1, j, j);
        ans += max(dp[i][0], dp[i][1]);
    }
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

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

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:87:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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