oj.uz

답안 #1046436

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046436 2024-08-06T14:40:41 Z c2zi6 Toy (CEOI24_toy) C++14
9 / 100
 4 ms 19292 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<bool> VB;
typedef vector<VB> VVB;
 
int MAXN = 1500;

char a[1500][1500];
bool vis[1500][1500];
int uw[1500][1500], dw[1500][1500], rw[1500][1500], lw[1500][1500];

int intersection(int al, int ar, int bl, int br) {
    return min(ar, br) - max(al, bl) - 1;
}

void solve() {
    int m, n, K, L;
    cin >> m >> n >> K >> L;
    int hy, hx, vy, vx;
    cin >> hy >> hx >> vy >> vx;
    rep(i, n) rep(j, m) cin >> a[i][j];
    rep(i, n) {
        int last;
        last = -1;
        replr(j, 0, m-1) {
            if (a[i][j] == 'X') last = j;
            lw[i][j] = last;
        }
        last = m;
        reprl(j, m-1, 0) {
            if (a[i][j] == 'X') last = j;
            rw[i][j] = last;
        }
    }
    rep(j, m) {
        int last;
        last = -1;
        replr(i, 0, n-1) {
            if (a[i][j] == 'X') last = i;
            uw[i][j] = last;
        }
        last = m;
        reprl(i, n-1, 0) {
            if (a[i][j] == 'X') last = i;
            dw[i][j] = last;
        }
    }
    rep(i, n) rep(j, m) vis[i][j] = false;
    queue<PII> q;
    q.push({hx, vy});
    vis[hx][vy] = true;
    while (q.size()) {
        auto[x, y] = q.front();
        q.pop();
        for (int vx : {x-1, x+1}) {
            if (vx < 0 || vx >= n) continue;
            if (vis[vx][y]) continue;
            if (intersection(lw[vx][y], rw[vx][y], lw[x][y], rw[x][y]) >= K) {
                q.push({vx, y});
                vis[vx][y] = true;
            }
        }
        for (int vy : {y-1, y+1}) {
            if (vy < 0 || vy >= m) continue;
            if (vis[x][vy]) continue;
            if (intersection(uw[x][vy], dw[x][vy], uw[x][y], dw[x][y]) >= L) {
                q.push({x, vy});
                vis[x][vy] = true;
            }
        }
    }
    rep(i, n) rep(j, m) {
        if (a[i][j] == '*') {
            if (vis[i][j]) cout << "YES" << endl;
            else cout << "NO" << endl;
            return;
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
    /*freopen("mincross.in", "r", stdin); */
    /*freopen("test.out", "w", stdout); */
    int t = 1;
    /*cin >> t; */
    while (t--) solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:84:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |         auto[x, y] = q.front();
      |             ^

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct

Subtask #1
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 12892 KB Output is correct
5 Correct 1 ms 12892 KB Output is correct
6 Incorrect 1 ms 12892 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 12892 KB Output is correct
5 Correct 1 ms 12892 KB Output is correct
6 Incorrect 1 ms 12892 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10844 KB Output is correct
4 Correct 3 ms 19036 KB Output is correct
5 Correct 3 ms 19000 KB Output is correct
6 Correct 1 ms 12892 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 2 ms 15000 KB Output is correct
10 Correct 3 ms 19036 KB Output is correct
11 Correct 3 ms 19292 KB Output is correct
12 Correct 2 ms 16988 KB Output is correct
13 Correct 2 ms 19036 KB Output is correct
14 Correct 2 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 3 ms 19036 KB Output is correct
18 Correct 3 ms 19036 KB Output is correct
19 Correct 3 ms 19036 KB Output is correct
20 Correct 3 ms 19036 KB Output is correct
21 Correct 3 ms 19036 KB Output is correct
22 Correct 3 ms 19036 KB Output is correct
23 Correct 3 ms 19036 KB Output is correct
24 Correct 3 ms 19036 KB Output is correct
25 Correct 3 ms 19036 KB Output is correct
26 Correct 3 ms 19036 KB Output is correct
27 Correct 3 ms 19036 KB Output is correct
28 Correct 3 ms 19180 KB Output is correct
29 Correct 3 ms 19172 KB Output is correct
30 Correct 4 ms 19032 KB Output is correct
31 Correct 3 ms 19036 KB Output is correct
32 Correct 3 ms 19160 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 3 ms 16988 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 2 ms 19036 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 3 ms 18980 KB Output is correct
39 Correct 2 ms 19036 KB Output is correct
40 Correct 3 ms 18984 KB Output is correct
41 Correct 3 ms 19036 KB Output is correct
42 Correct 4 ms 19176 KB Output is correct
43 Correct 4 ms 19036 KB Output is correct
44 Correct 3 ms 19172 KB Output is correct
45 Correct 3 ms 19032 KB Output is correct
46 Correct 2 ms 19036 KB Output is correct

Subtask #4
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 12892 KB Output is correct
5 Correct 1 ms 12892 KB Output is correct
6 Incorrect 1 ms 12892 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 12892 KB Output is correct
5 Correct 1 ms 12892 KB Output is correct
6 Incorrect 1 ms 12892 KB Output isn't correct
7 Halted 0 ms 0 KB -