oj.uz

Submission #1045727

# Submission time Handle Problem Language Result Execution time Memory
1045727 2024-08-06T07:15:01 Z VahanAbraham Toy (CEOI24_toy) C++14
14 / 100
 1500 ms 12196 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 = 93;
const ll oo = 100000000000000000, MOD = 1000000007;

struct cord {
    int x, y;
};

char grid[N][N];
bool ok[N][N][N][N];
int w, h, k, l, xend, yend;

int dxhor[3] = { 1,-1,0 };
int dxver[3] = { 1,-1,0 };
int dyhor[3] = { 1,-1,0 };
int dyver[3] = { 1,-1,0 };

queue<pair<cord, cord>> q;

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

bool mejnahor(cord hor) {
    if (hor.x >= 0 && hor.x + k - 1 <= w - 1 && hor.y >= 0 && hor.y <= h - 1) {
        return true;
    }
    return false;
}

bool mejnaver(cord ver) {
    if (ver.x >= 0 && ver.x <= w - 1 && ver.y >= 0 && ver.y+l-1 <= h - 1) {
        return true;
    }
    return false;
}

bool normalhor(cord hor) {
    for (int i = hor.x; i <= hor.x + k - 1; ++i) {
        if (grid[hor.y][i] == 'X') {
            return false;
        }
    }
    return true;
}

bool normalver(cord ver) {
    for (int i = ver.y; i <= ver.y + l - 1; ++i) {
        if (grid[i][ver.x] == 'X') {
            return false;
        }
    }
    return true;
}

bool stug(cord hor1, cord ver1) {
    if (mejnahor(hor1) == 1 && mejnaver(ver1) == 1 && normalhor(hor1)==1 && normalver(ver1)==1) {
        pair<int, int> p = hatvumen(hor1, ver1);
        if (p.fr == xend && p.sc == yend){
            return true;
        }
        else {
            if (p.fr != -1) {
                if (ok[hor1.x][hor1.y][ver1.x][ver1.y] != 1) {
                    ok[hor1.x][hor1.y][ver1.x][ver1.y] = 1;
                    q.push({ hor1,ver1 });
                    return false;
                }
                return false;
            }
            return false;
        }
        return false;
    }
    return false;
}


void solve() {
    cin >> w >> h >> k >> l;
    int xh, yh, xv, yv;
    cin >> xh >> yh >> xv >> yv;
    cord hor, ver;
    hor.x = xh;
    hor.y = yh;
    ver.x = xv;
    ver.y = yv;
    ok[hor.x][hor.y][ver.x][ver.y] = 1;
    q.push({ hor,ver });
    for (int i = 0; i < h; ++i) {
        for (int j = 0; j < w; ++j) {
            cin >> grid[i][j];
            if (grid[i][j] == '*') {
                xend = j, yend = i;
            }
        }
    }
    /*cout << xend << " " << yend << endl;
    cord vv;
    vv.x = 1, vv.y = 0;
    cout << normalver(vv) << endl;*/
    while (q.empty() != 1) {
        hor = q.front().fr;
        ver = q.front().sc;
        //cout << hor.x << " " << hor.y << " " << ver.x << " " << ver.y << endl;
        q.pop();
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                cord hor1 = hor, ver1 = ver;
                hor1.x += dxhor[i];
                ver1.x += dxver[j];
                if (stug(hor1, ver1)) {
                    //cout << hor1.x << " " << hor1.y << " " << ver1.x << " " << ver1.y << endl;
                    cout << "YES" << endl;
                    return;
                }
            }
            for (int j = 0; j < 3; ++j) {
                cord hor1 = hor, ver1 = ver;
                hor1.x += dxhor[i];
                ver1.y += dyver[j];
                if (stug(hor1, ver1)) {
                    //cout << hor1.x << " " << hor1.y << " " << ver1.x << " " << ver1.y << endl;
                    cout << "YES" << endl;
                    return;
                }
            }
        }
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                cord hor1 = hor, ver1 = ver;
                hor1.y += dyhor[i];
                ver1.x += dxver[j];
                if (stug(hor1, ver1)) {
                    //cout << hor1.x << " " << hor1.y << " " << ver1.x << " " << ver1.y << endl;
                    cout << "YES" << endl;
                    return;
                }
            }
            for (int j = 0; j < 3; ++j) {
                cord hor1 = hor, ver1 = ver;
                hor1.y += dyhor[i];
                ver1.y += dyver[j];
                if (stug(hor1, ver1)) {
                    //cout << hor1.x << " " << hor1.y << " " << ver1.x << " " << ver1.y << endl;
                    cout << "YES" << endl;
                    return;
                }
            }
        }
    }
    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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 354 ms 9260 KB Output is correct
16 Correct 305 ms 9296 KB Output is correct
17 Correct 355 ms 9656 KB Output is correct
18 Correct 403 ms 8528 KB Output is correct
19 Correct 396 ms 8788 KB Output is correct
20 Correct 432 ms 9044 KB Output is correct
21 Correct 406 ms 8528 KB Output is correct
22 Correct 404 ms 8660 KB Output is correct
23 Correct 415 ms 9044 KB Output is correct
24 Correct 143 ms 8752 KB Output is correct
25 Correct 119 ms 8960 KB Output is correct
26 Correct 118 ms 8016 KB Output is correct
27 Correct 92 ms 8304 KB Output is correct
28 Correct 87 ms 8596 KB Output is correct
29 Correct 68 ms 8784 KB Output is correct
30 Correct 27 ms 4180 KB Output is correct
31 Correct 94 ms 8784 KB Output is correct
32 Correct 14 ms 4444 KB Output is correct
33 Correct 39 ms 10404 KB Output is correct
34 Correct 38 ms 4944 KB Output is correct
35 Correct 37 ms 5976 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 21 ms 2396 KB Output is correct
38 Correct 25 ms 2276 KB Output is correct
39 Correct 23 ms 2652 KB Output is correct
40 Correct 22 ms 2664 KB Output is correct
41 Correct 25 ms 2664 KB Output is correct
42 Correct 1 ms 2392 KB Output is correct
43 Correct 2 ms 2648 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 354 ms 9260 KB Output is correct
16 Correct 305 ms 9296 KB Output is correct
17 Correct 355 ms 9656 KB Output is correct
18 Correct 403 ms 8528 KB Output is correct
19 Correct 396 ms 8788 KB Output is correct
20 Correct 432 ms 9044 KB Output is correct
21 Correct 406 ms 8528 KB Output is correct
22 Correct 404 ms 8660 KB Output is correct
23 Correct 415 ms 9044 KB Output is correct
24 Correct 143 ms 8752 KB Output is correct
25 Correct 119 ms 8960 KB Output is correct
26 Correct 118 ms 8016 KB Output is correct
27 Correct 92 ms 8304 KB Output is correct
28 Correct 87 ms 8596 KB Output is correct
29 Correct 68 ms 8784 KB Output is correct
30 Correct 27 ms 4180 KB Output is correct
31 Correct 94 ms 8784 KB Output is correct
32 Correct 14 ms 4444 KB Output is correct
33 Correct 39 ms 10404 KB Output is correct
34 Correct 38 ms 4944 KB Output is correct
35 Correct 37 ms 5976 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 21 ms 2396 KB Output is correct
38 Correct 25 ms 2276 KB Output is correct
39 Correct 23 ms 2652 KB Output is correct
40 Correct 22 ms 2664 KB Output is correct
41 Correct 25 ms 2664 KB Output is correct
42 Correct 1 ms 2392 KB Output is correct
43 Correct 2 ms 2648 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 55 ms 6228 KB Output is correct
48 Correct 137 ms 3092 KB Output is correct
49 Correct 2 ms 2396 KB Output is correct
50 Correct 3 ms 2584 KB Output is correct
51 Correct 184 ms 4692 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 0 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Execution timed out 1597 ms 12196 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 15 ms 10332 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 354 ms 9260 KB Output is correct
16 Correct 305 ms 9296 KB Output is correct
17 Correct 355 ms 9656 KB Output is correct
18 Correct 403 ms 8528 KB Output is correct
19 Correct 396 ms 8788 KB Output is correct
20 Correct 432 ms 9044 KB Output is correct
21 Correct 406 ms 8528 KB Output is correct
22 Correct 404 ms 8660 KB Output is correct
23 Correct 415 ms 9044 KB Output is correct
24 Correct 143 ms 8752 KB Output is correct
25 Correct 119 ms 8960 KB Output is correct
26 Correct 118 ms 8016 KB Output is correct
27 Correct 92 ms 8304 KB Output is correct
28 Correct 87 ms 8596 KB Output is correct
29 Correct 68 ms 8784 KB Output is correct
30 Correct 27 ms 4180 KB Output is correct
31 Correct 94 ms 8784 KB Output is correct
32 Correct 14 ms 4444 KB Output is correct
33 Correct 39 ms 10404 KB Output is correct
34 Correct 38 ms 4944 KB Output is correct
35 Correct 37 ms 5976 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 21 ms 2396 KB Output is correct
38 Correct 25 ms 2276 KB Output is correct
39 Correct 23 ms 2652 KB Output is correct
40 Correct 22 ms 2664 KB Output is correct
41 Correct 25 ms 2664 KB Output is correct
42 Correct 1 ms 2392 KB Output is correct
43 Correct 2 ms 2648 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 55 ms 6228 KB Output is correct
48 Correct 137 ms 3092 KB Output is correct
49 Correct 2 ms 2396 KB Output is correct
50 Correct 3 ms 2584 KB Output is correct
51 Correct 184 ms 4692 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 0 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Execution timed out 1597 ms 12196 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 4 ms 2904 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 354 ms 9260 KB Output is correct
16 Correct 305 ms 9296 KB Output is correct
17 Correct 355 ms 9656 KB Output is correct
18 Correct 403 ms 8528 KB Output is correct
19 Correct 396 ms 8788 KB Output is correct
20 Correct 432 ms 9044 KB Output is correct
21 Correct 406 ms 8528 KB Output is correct
22 Correct 404 ms 8660 KB Output is correct
23 Correct 415 ms 9044 KB Output is correct
24 Correct 143 ms 8752 KB Output is correct
25 Correct 119 ms 8960 KB Output is correct
26 Correct 118 ms 8016 KB Output is correct
27 Correct 92 ms 8304 KB Output is correct
28 Correct 87 ms 8596 KB Output is correct
29 Correct 68 ms 8784 KB Output is correct
30 Correct 27 ms 4180 KB Output is correct
31 Correct 94 ms 8784 KB Output is correct
32 Correct 14 ms 4444 KB Output is correct
33 Correct 39 ms 10404 KB Output is correct
34 Correct 38 ms 4944 KB Output is correct
35 Correct 37 ms 5976 KB Output is correct
36 Correct 2 ms 2652 KB Output is correct
37 Correct 21 ms 2396 KB Output is correct
38 Correct 25 ms 2276 KB Output is correct
39 Correct 23 ms 2652 KB Output is correct
40 Correct 22 ms 2664 KB Output is correct
41 Correct 25 ms 2664 KB Output is correct
42 Correct 1 ms 2392 KB Output is correct
43 Correct 2 ms 2648 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 55 ms 6228 KB Output is correct
48 Correct 137 ms 3092 KB Output is correct
49 Correct 2 ms 2396 KB Output is correct
50 Correct 3 ms 2584 KB Output is correct
51 Correct 184 ms 4692 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 0 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 0 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Execution timed out 1597 ms 12196 KB Time limit exceeded
60 Halted 0 ms 0 KB -