oj.uz

Submission #1046134

# Submission time Handle Problem Language Result Execution time Memory
1046134 2024-08-06T10:25:36 Z VahanAbraham Toy (CEOI24_toy) C++17
0 / 100
 4 ms 19036 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <list>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <bitset>
#include <cmath>
#include <vector>
#include <iomanip>
#include <random>
#include <chrono>
#include <cassert>

using namespace std;

#define ll long long
#define fr first
#define sc second
#define pb push_back
#define US freopen(".in", "r", stdin); freopen("j.out", "w", stdout);

ll gcd(ll a, ll b)
{
    if (a == 0 || b == 0) {
        return  max(a, b);
    }
    if (a <= b) {
        return gcd(a, b % a);
    }
    else {
        return gcd(a % b, b);
    }
}
ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

const int N = 1505;
const ll oo = 100000000000000000, MOD = 1000000007;

struct cord {
    int x, y;
};

char grid[N][N];
bool ok[N][N];
int lhor[N][N], rhor[N][N], lver[N][N], rver[N][N];
int w, h, k, l, xend, yend;
int dx[4] = { 1,-1,0,0 };
int dy[4] = { 0,0,1,-1 };

queue<pair<int,int>> q;

pair<int, int> hatvumen(cord hor, cord ver) {
    int i = ver.x;
    if (hor.y >= ver.y && hor.y <= ver.y + l - 1 && i >= hor.x && i <= hor.x + k - 1) {
        return { hor.y,i};
    }
    return{ -1,-1 };
}

int hatacmas(int l1, int r1, int l2, int r2) {
    return min(r2, r1) - max(l1, l2) + 1;
}


void solve() {
    cin >> w >> h >> k >> l;
    int xh, yh, xv, yv;
    cin >> xh >> yh >> xv >> yv;
    ++xh;
    ++yh;
    ++xv;
    ++yv;
    cord hor, ver;
    hor.x = xh;
    hor.y = yh;
    ver.x = xv;
    ver.y = yv;
    q.push(hatvumen(hor, ver));
    for (int i = 1; i <= h; ++i) {
        for (int j = 1; j <= w; ++j) {
            cin >> grid[i][j];
            if (grid[i][j] == '*') {
                xend = j, yend = i;
            }
        }
    }
    for (int i = 1; i <= h; ++i) {
        lhor[i][0] = 1;
        for (int j = 1; j <= w; ++j) {
            lhor[i][j] = lhor[i][j-1];
            if (grid[i][j - 1] == 'X') {
                lhor[i][j] = j;
            }
        }
    }
    for (int i = 1; i <= h; ++i) {
        rhor[i][w + 1] = w;
        for (int j = w; j >= 1; --j) {
            rhor[i][j] = rhor[i][j + 1];
            if (grid[i][j + 1] == 'X') {
                rhor[i][j] = j;
            }
        }
    }
    for (int j = 1; j <= w; ++j) {
        lver[0][j] = 1;
        for (int i = 1; i <= h; ++i) {
            lver[i][j] = lver[i-1][j];
            if (grid[i-1][j] == 'X') {
                lver[i][j] = i - 1;
            }
        }
    }
    for (int j = 1; j <= w; ++j) {
        rver[h + 1][j] = h;
        for (int i = h; i >= 1; --i) {
            rver[i][j] = rver[i+1][j];
            if (grid[i+1][j] == 'X') {
                rver[i][j] = j;
            }
        }
    }
    ok[hatvumen(hor, ver).fr][hatvumen(hor, ver).sc] = 1;
    while (q.empty() != 1) {
        pair<int, int> p = q.front();
        //cout << p.fr << " " << p.sc << endl;
        q.pop();
        for (int i = 0; i < 4; ++i) {
            int x1 = p.fr + dx[i];
            int y1 = p.sc + dy[i];
            if (grid[x1][y1] != 'X' && ok[x1][y1]!=1 && x1>=1 &&x1<=h && y1>=1 && y1<=w ) {
                if (hatacmas(lhor[x1][y1],rhor[x1][y1],lhor[p.fr][p.sc],rhor[p.fr][p.sc]) >= k && hatacmas(lver[x1][y1], rver[x1][y1], lver[p.fr][p.sc], rver[p.fr][p.sc]) >=l) {
                    ok[x1][y1] = 1;
                    q.push({ x1,y1 });
                }
            }
        }
    }
    if (ok[yend][xend] == 1) {
        cout << "YES" << endl;
    }
    else {
        cout << "NO" << endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    //US
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct

Subtask #1
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10584 KB Output is correct
4 Correct 1 ms 14940 KB Output is correct
5 Correct 1 ms 14940 KB Output is correct
6 Correct 1 ms 14940 KB Output is correct
7 Correct 1 ms 14940 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 1 ms 12892 KB Output is correct
10 Correct 1 ms 14940 KB Output is correct
11 Correct 1 ms 14940 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 14940 KB Output is correct
14 Correct 1 ms 14940 KB Output is correct
15 Incorrect 1 ms 14940 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10584 KB Output is correct
4 Correct 1 ms 14940 KB Output is correct
5 Correct 1 ms 14940 KB Output is correct
6 Correct 1 ms 14940 KB Output is correct
7 Correct 1 ms 14940 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 1 ms 12892 KB Output is correct
10 Correct 1 ms 14940 KB Output is correct
11 Correct 1 ms 14940 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 14940 KB Output is correct
14 Correct 1 ms 14940 KB Output is correct
15 Incorrect 1 ms 14940 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 12892 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 4 ms 18900 KB Output is correct
6 Correct 1 ms 14816 KB Output is correct
7 Incorrect 2 ms 19036 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10584 KB Output is correct
4 Correct 1 ms 14940 KB Output is correct
5 Correct 1 ms 14940 KB Output is correct
6 Correct 1 ms 14940 KB Output is correct
7 Correct 1 ms 14940 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 1 ms 12892 KB Output is correct
10 Correct 1 ms 14940 KB Output is correct
11 Correct 1 ms 14940 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 14940 KB Output is correct
14 Correct 1 ms 14940 KB Output is correct
15 Incorrect 1 ms 14940 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10584 KB Output is correct
4 Correct 1 ms 14940 KB Output is correct
5 Correct 1 ms 14940 KB Output is correct
6 Correct 1 ms 14940 KB Output is correct
7 Correct 1 ms 14940 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 1 ms 12892 KB Output is correct
10 Correct 1 ms 14940 KB Output is correct
11 Correct 1 ms 14940 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 14940 KB Output is correct
14 Correct 1 ms 14940 KB Output is correct
15 Incorrect 1 ms 14940 KB Output isn't correct
16 Halted 0 ms 0 KB -