oj.uz

답안 #1107837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107837 2024-11-02T07:19:44 Z whatthemomooofun1729 Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 4432 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr long double EPS = (ld)1e-10, PI = 3.1415926535;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

pii dxdy[2] = {pii{1, 0}, pii{0, 1}};
const int MAXN = int(3e3) + 5;
int N, M, V = 0;
char grid[MAXN][MAXN];
int vert[MAXN][MAXN][2];
vc<vi> adj;
vi vst;
vi label;

int check(pii a, pii b, pii c) {
    if (a.ff < 0 || a.ff > N || a.ss < 0 || a.ss > M || b.ff < 0
            || b.ff > N || b.ss < 0 || b.ss > M || c.ff < 0
                    || c.ff > N || c.ss < 0 || c.ss > M) return 0;
    return grid[a.ff][a.ss] == 'R' && grid[b.ff][b.ss] == 'G' && grid[c.ff][c.ss] == 'W';
}

int check(int x, int y, int k) {
    if (x < 0 || x > N || y < 0 || y > M) return 0;
    pii pts[3];
    pts[0] = {x, y};
    for (int l = 1; l < 3; ++l) {
        x += dxdy[k].ff, y += dxdy[k].ss;
        pts[l] = {x, y};
    }
    return check(pts[0], pts[1], pts[2]);
}

int add_node(int x, int y, int k) {
    if (vert[x][y][k] == -1) {
        vert[x][y][k] = V;
        adj.PB({});
        return V++;
    } else return vert[x][y][k];
}

void reset(int comp) {
    queue<int> q;
    q.push(comp);
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        fch(u, adj[v]) {
            if (label[u] != -1) continue;
            label[u] = -1;
            q.push(u);
        }
    }
}

void sett(int comp) {
    queue<int> q;
    q.push(comp);
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        fch(u, adj[v]) {
            if (!vst[u]) {
                vst[u] = 1;
                q.push(u);
            }
        }
    }
}

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> M;
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            cin >> grid[i][j];
            vert[i][j][0] = vert[i][j][1] = -1;
        }
    }
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            for (int k = 0; k < 2; ++k) {
                if (check(i, j, k)) {
                    int cur_node = add_node(i, j, k);
                    int x = i, y = j;
                    for (int l = 0; l < 3; ++l) {
                        if (check(x, y, k ^ 1)) {
                            int node = add_node(x, y, k ^ 1);
                            adj[cur_node].PB(node);
                            adj[node].PB(cur_node);
                        }
                        x += dxdy[k].ff, y += dxdy[k].ss;
                        if (k == 0) y--;
                        else x--;
                    }
                }
            }
        }
    }
//    for (int i = 0; i < N; ++i) {
//        for (int j = 0; j < M; ++j) {
//            for (int k = 0; k < 2; ++k) {
//                debug(i, j, k, vert[i][j][k]);
//            }
//        }
//    }
//    for (int i = 0; i < V; ++i) {
//        debug(i);
//        debug(adj[i]);
//    }
    vst.rsz(V, 0), label.rsz(V, -1);
    int ans = 0;
    for (int i = 0; i < V; ++i) {
        if (vst[i]) continue;
        int n1_ = 0, _ = 0;
        queue<int> q;
        q.push(i);
        label[i] = 1;
        n1_ = 1;
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            fch(u, adj[v]) {
                if (label[u] != -1) continue;
                label[u] = label[v] ^ 1;
                if (label[u] == 1) n1_++;
                q.push(u);
            }
        }
        if (!adj[i].empty()) {
            reset(i);
            int j = adj[i][0];
            q.push(j);
            label[j] = 1;
            _ = 1;
            while (!q.empty()) {
                int v = q.front();
                q.pop();
                fch(u, adj[v]) {
                    if (label[u] != -1) continue;
                    label[u] = label[v] ^ 1;
                    if (label[u] == 1) _++;
                    q.push(u);
                }
            }
        }
        ans += max(_, n1_);
        sett(i);
    }
    cout << ans;
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

dango_maker.cpp: In function 'void setIO(const string&)':
dango_maker.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2556 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2556 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2528 KB Output is correct
20 Incorrect 1 ms 4432 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2556 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2528 KB Output is correct
20 Incorrect 1 ms 4432 KB Output isn't correct
21 Halted 0 ms 0 KB -