oj.uz

답안 #1045778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1045778 2024-08-06T07:35:36 Z c2zi6 Toy (CEOI24_toy) C++14
35 / 100
 791 ms 142436 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 n, m;
int K, L;

void replace(VVC& table, char a, char b) {
    rep(i, n) rep(j, m) if (table[i][j] == a) table[i][j] = b;
}

void expose(VVC& table, int sx, int sy) {
    VVB vis(n, VB(m));
    queue<PII> q;
    q.push({sx, sy});
    vis[sx][sy] = true;
    while (q.size()) {
        auto[ux, uy] = q.front();
        q.pop();
        VPI harevan;
        harevan.pb({ux-1, uy});
        harevan.pb({ux+1, uy});
        harevan.pb({ux, uy-1});
        harevan.pb({ux, uy+1});
        for (auto[vx, vy] : harevan) {
            if (vx < 0 || vx >= n || vy < 0 || vy >= m) continue;
            if (vis[vx][vy]) continue;
            if (table[vx][vy] == 'X') continue;
            q.push({vx, vy});
            vis[vx][vy] = true;
        }
    }
    rep(i, n) rep(j, m) if (vis[i][j]) table[i][j] = 'G';
    replace(table, '.', 'X');
    replace(table, 'G', '.');
}

const int MAXN = 90;
struct STATE {
    int ax, ay, bx, by;
    /*1 1, 1 0*/
    bool canbe() {
        /*ax is in range [bx, bx+L-1]*/
        /*ay is in range [by-K+1, by]*/
        bool p1 = (bx <= ax && ax <= bx+L-1);
        bool p2 = (by-K+1 <= ay && ay <= by);
        return p1 && p2;
    }
    int ind() {
        return MAXN*MAXN*MAXN*ax + MAXN*MAXN*ay + MAXN*bx + by;
    }
    vector<STATE> harevan() {
        vector<STATE> ret;
        ret.pb({ax-1, ay, bx, by});
        ret.pb({ax+1, ay, bx, by});
        ret.pb({ax, ay-1, bx, by});
        ret.pb({ax, ay+1, bx, by});
        ret.pb({ax, ay, bx-1, by});
        ret.pb({ax, ay, bx+1, by});
        ret.pb({ax, ay, bx, by-1});
        ret.pb({ax, ay, bx, by+1});
        vector<STATE> ret2;
        for (STATE a : ret) {
            if (a.ax < 0 || a.ax >= n || a.bx < 0 || a.bx >= n) continue;
            if (a.ay < 0 || a.ay >= m || a.by < 0 || a.by >= m) continue;
            ret2.pb(a);
        }
        return ret2;
    }
};

void solve() {
    cin >> m >> n >> K >> L;
    // K - width, L - height
    int hx, hy, vx, vy;
    cin >> hy >> hx >> vy >> vx;
    VVC table, a, b;
    table = a = b = VVC(n, VC(m, 'X'));
    rep(i, n) rep(j, m) cin >> table[i][j];
    int destx, desty;
    rep(i, n) rep(j, m) {
        if (table[i][j] == '*') {
            destx = i;
            desty = j;
            table[i][j] = '.';
            break;
        }
    }
    rep(i, n) rep(j, m) {
        if (j+K-1 < m) {
            bool can = true;
            replr(c, j, j+K-1) {
                if (table[i][c] == 'X') can = false;
            }
            if (can) a[i][j] = '.';
        }
        if (i+L-1 < n) {
            bool can = true;
            replr(r, i, i+L-1) {
                if (table[r][j] == 'X') can = false;
            }
            if (can) b[i][j] = '.';
        }
    }
    expose(a, hx, hy);
    expose(b, vx, vy);
    /*cout << endl << "possible moves horizontal" << endl;*/
    /*rep(i, n) {*/
    /*    rep(j, m) cout << a[i][j];*/
    /*    cout << endl;*/
    /*}*/
    /*cout << endl << "possible moves vertical" << endl;*/
    /*rep(i, n) {*/
    /*    rep(j, m) cout << b[i][j];*/
    /*    cout << endl;*/
    /*}*/
    STATE start{hx, hy, vx, vy};
    queue<STATE> q;
    VB vis(MAXN*MAXN*MAXN*MAXN);
    q.push(start);
    vis[start.ind()] = true;

    vector<STATE> states;
    states.pb(start);

    while (q.size()) {
        STATE u = q.front();
        q.pop();
        for (STATE v : u.harevan()) {
            if (vis[v.ind()]) continue;
            if (a[v.ax][v.ay] == 'X') continue;
            if (b[v.bx][v.by] == 'X') continue;
            if (!v.canbe()) continue;
            vis[v.ind()] = true;
            q.push(v);
            states.pb(v);
        }
    }

    for (STATE s : states) {
        /*cout << "State (" << s.ay << ", " << s.ax << "), (" << s.by << ", " << s.bx << ")" << endl;*/
        bool p1 = (s.ax == destx && desty-K+1 <= s.ay && s.ay <= desty);
        bool p2 = (s.by == desty && destx-L+1 <= s.bx && s.bx <= destx);
        if (p1 && p2) {
            cout << "YES" << endl;
            return;
        }
        /*cout << "State (" << s.ax << ", " << s.ay << "), (" << s.bx << ", " << s.by << ")" << endl;*/
    }
    cout << "NO" << endl;
}
 
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 expose(VVC&, int, int)':
Main.cpp:50:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |         auto[ux, uy] = q.front();
      |             ^
Main.cpp:57:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for (auto[vx, vy] : harevan) {
      |                  ^
Main.cpp: In function 'void solve()':
Main.cpp:112:9: warning: 'destx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  112 |     int destx, desty;
      |         ^~~~~
Main.cpp:112:16: warning: 'desty' may be used uninitialized in this function [-Wmaybe-uninitialized]
  112 |     int destx, desty;
      |                ^~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8692 KB Output is correct
4 Correct 72 ms 18152 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8296 KB Output is correct
10 Correct 1 ms 8284 KB Output is correct
11 Correct 1 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8320 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 69 ms 17588 KB Output is correct
16 Correct 66 ms 16768 KB Output is correct
17 Correct 72 ms 17380 KB Output is correct
18 Correct 75 ms 18392 KB Output is correct
19 Correct 78 ms 16964 KB Output is correct
20 Correct 87 ms 16716 KB Output is correct
21 Correct 85 ms 16868 KB Output is correct
22 Correct 82 ms 16856 KB Output is correct
23 Correct 73 ms 18124 KB Output is correct
24 Correct 35 ms 14364 KB Output is correct
25 Correct 32 ms 13012 KB Output is correct
26 Correct 34 ms 14324 KB Output is correct
27 Correct 33 ms 14548 KB Output is correct
28 Correct 23 ms 10460 KB Output is correct
29 Correct 32 ms 10648 KB Output is correct
30 Correct 23 ms 10460 KB Output is correct
31 Correct 26 ms 14036 KB Output is correct
32 Correct 14 ms 9436 KB Output is correct
33 Correct 15 ms 10564 KB Output is correct
34 Correct 24 ms 10460 KB Output is correct
35 Correct 25 ms 10456 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 8 ms 8936 KB Output is correct
38 Correct 11 ms 9444 KB Output is correct
39 Correct 9 ms 9060 KB Output is correct
40 Correct 9 ms 8936 KB Output is correct
41 Correct 8 ms 9508 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8380 KB Output is correct
46 Correct 2 ms 8284 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8692 KB Output is correct
4 Correct 72 ms 18152 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8296 KB Output is correct
10 Correct 1 ms 8284 KB Output is correct
11 Correct 1 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8320 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 69 ms 17588 KB Output is correct
16 Correct 66 ms 16768 KB Output is correct
17 Correct 72 ms 17380 KB Output is correct
18 Correct 75 ms 18392 KB Output is correct
19 Correct 78 ms 16964 KB Output is correct
20 Correct 87 ms 16716 KB Output is correct
21 Correct 85 ms 16868 KB Output is correct
22 Correct 82 ms 16856 KB Output is correct
23 Correct 73 ms 18124 KB Output is correct
24 Correct 35 ms 14364 KB Output is correct
25 Correct 32 ms 13012 KB Output is correct
26 Correct 34 ms 14324 KB Output is correct
27 Correct 33 ms 14548 KB Output is correct
28 Correct 23 ms 10460 KB Output is correct
29 Correct 32 ms 10648 KB Output is correct
30 Correct 23 ms 10460 KB Output is correct
31 Correct 26 ms 14036 KB Output is correct
32 Correct 14 ms 9436 KB Output is correct
33 Correct 15 ms 10564 KB Output is correct
34 Correct 24 ms 10460 KB Output is correct
35 Correct 25 ms 10456 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 8 ms 8936 KB Output is correct
38 Correct 11 ms 9444 KB Output is correct
39 Correct 9 ms 9060 KB Output is correct
40 Correct 9 ms 8936 KB Output is correct
41 Correct 8 ms 9508 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8380 KB Output is correct
46 Correct 2 ms 8284 KB Output is correct
47 Correct 13 ms 9616 KB Output is correct
48 Correct 15 ms 10700 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8536 KB Output is correct
51 Correct 31 ms 13244 KB Output is correct
52 Correct 2 ms 8540 KB Output is correct
53 Correct 2 ms 8484 KB Output is correct
54 Correct 2 ms 8540 KB Output is correct
55 Correct 1 ms 8540 KB Output is correct
56 Correct 1 ms 8284 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8328 KB Output is correct
59 Correct 589 ms 75204 KB Output is correct
60 Correct 562 ms 75336 KB Output is correct
61 Correct 668 ms 76556 KB Output is correct
62 Correct 791 ms 140728 KB Output is correct
63 Correct 776 ms 140716 KB Output is correct
64 Correct 733 ms 140704 KB Output is correct
65 Correct 771 ms 142196 KB Output is correct
66 Correct 728 ms 142436 KB Output is correct
67 Correct 733 ms 141460 KB Output is correct
68 Correct 342 ms 42412 KB Output is correct
69 Correct 359 ms 43176 KB Output is correct
70 Correct 281 ms 42040 KB Output is correct
71 Correct 233 ms 42668 KB Output is correct
72 Correct 247 ms 41644 KB Output is correct
73 Correct 222 ms 41612 KB Output is correct
74 Correct 92 ms 17596 KB Output is correct
75 Correct 91 ms 18372 KB Output is correct
76 Correct 110 ms 26032 KB Output is correct
77 Correct 55 ms 14784 KB Output is correct
78 Correct 83 ms 17596 KB Output is correct
79 Correct 48 ms 13856 KB Output is correct
80 Correct 5 ms 8796 KB Output is correct
81 Correct 56 ms 17580 KB Output is correct
82 Correct 66 ms 18136 KB Output is correct
83 Correct 64 ms 18136 KB Output is correct
84 Correct 80 ms 17080 KB Output is correct
85 Correct 60 ms 16832 KB Output is correct
86 Correct 3 ms 8796 KB Output is correct
87 Correct 3 ms 8540 KB Output is correct
88 Correct 3 ms 8684 KB Output is correct
89 Correct 3 ms 8536 KB Output is correct
90 Correct 1 ms 8540 KB Output is correct

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 21 ms 10460 KB Output is correct
4 Runtime error 17 ms 17424 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8692 KB Output is correct
4 Correct 72 ms 18152 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8296 KB Output is correct
10 Correct 1 ms 8284 KB Output is correct
11 Correct 1 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8320 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 69 ms 17588 KB Output is correct
16 Correct 66 ms 16768 KB Output is correct
17 Correct 72 ms 17380 KB Output is correct
18 Correct 75 ms 18392 KB Output is correct
19 Correct 78 ms 16964 KB Output is correct
20 Correct 87 ms 16716 KB Output is correct
21 Correct 85 ms 16868 KB Output is correct
22 Correct 82 ms 16856 KB Output is correct
23 Correct 73 ms 18124 KB Output is correct
24 Correct 35 ms 14364 KB Output is correct
25 Correct 32 ms 13012 KB Output is correct
26 Correct 34 ms 14324 KB Output is correct
27 Correct 33 ms 14548 KB Output is correct
28 Correct 23 ms 10460 KB Output is correct
29 Correct 32 ms 10648 KB Output is correct
30 Correct 23 ms 10460 KB Output is correct
31 Correct 26 ms 14036 KB Output is correct
32 Correct 14 ms 9436 KB Output is correct
33 Correct 15 ms 10564 KB Output is correct
34 Correct 24 ms 10460 KB Output is correct
35 Correct 25 ms 10456 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 8 ms 8936 KB Output is correct
38 Correct 11 ms 9444 KB Output is correct
39 Correct 9 ms 9060 KB Output is correct
40 Correct 9 ms 8936 KB Output is correct
41 Correct 8 ms 9508 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8380 KB Output is correct
46 Correct 2 ms 8284 KB Output is correct
47 Correct 13 ms 9616 KB Output is correct
48 Correct 15 ms 10700 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8536 KB Output is correct
51 Correct 31 ms 13244 KB Output is correct
52 Correct 2 ms 8540 KB Output is correct
53 Correct 2 ms 8484 KB Output is correct
54 Correct 2 ms 8540 KB Output is correct
55 Correct 1 ms 8540 KB Output is correct
56 Correct 1 ms 8284 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8328 KB Output is correct
59 Correct 589 ms 75204 KB Output is correct
60 Correct 562 ms 75336 KB Output is correct
61 Correct 668 ms 76556 KB Output is correct
62 Correct 791 ms 140728 KB Output is correct
63 Correct 776 ms 140716 KB Output is correct
64 Correct 733 ms 140704 KB Output is correct
65 Correct 771 ms 142196 KB Output is correct
66 Correct 728 ms 142436 KB Output is correct
67 Correct 733 ms 141460 KB Output is correct
68 Correct 342 ms 42412 KB Output is correct
69 Correct 359 ms 43176 KB Output is correct
70 Correct 281 ms 42040 KB Output is correct
71 Correct 233 ms 42668 KB Output is correct
72 Correct 247 ms 41644 KB Output is correct
73 Correct 222 ms 41612 KB Output is correct
74 Correct 92 ms 17596 KB Output is correct
75 Correct 91 ms 18372 KB Output is correct
76 Correct 110 ms 26032 KB Output is correct
77 Correct 55 ms 14784 KB Output is correct
78 Correct 83 ms 17596 KB Output is correct
79 Correct 48 ms 13856 KB Output is correct
80 Correct 5 ms 8796 KB Output is correct
81 Correct 56 ms 17580 KB Output is correct
82 Correct 66 ms 18136 KB Output is correct
83 Correct 64 ms 18136 KB Output is correct
84 Correct 80 ms 17080 KB Output is correct
85 Correct 60 ms 16832 KB Output is correct
86 Correct 3 ms 8796 KB Output is correct
87 Correct 3 ms 8540 KB Output is correct
88 Correct 3 ms 8684 KB Output is correct
89 Correct 3 ms 8536 KB Output is correct
90 Correct 1 ms 8540 KB Output is correct
91 Correct 21 ms 10460 KB Output is correct
92 Runtime error 17 ms 17424 KB Execution killed with signal 11
93 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8692 KB Output is correct
4 Correct 72 ms 18152 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8280 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8296 KB Output is correct
10 Correct 1 ms 8284 KB Output is correct
11 Correct 1 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8320 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 69 ms 17588 KB Output is correct
16 Correct 66 ms 16768 KB Output is correct
17 Correct 72 ms 17380 KB Output is correct
18 Correct 75 ms 18392 KB Output is correct
19 Correct 78 ms 16964 KB Output is correct
20 Correct 87 ms 16716 KB Output is correct
21 Correct 85 ms 16868 KB Output is correct
22 Correct 82 ms 16856 KB Output is correct
23 Correct 73 ms 18124 KB Output is correct
24 Correct 35 ms 14364 KB Output is correct
25 Correct 32 ms 13012 KB Output is correct
26 Correct 34 ms 14324 KB Output is correct
27 Correct 33 ms 14548 KB Output is correct
28 Correct 23 ms 10460 KB Output is correct
29 Correct 32 ms 10648 KB Output is correct
30 Correct 23 ms 10460 KB Output is correct
31 Correct 26 ms 14036 KB Output is correct
32 Correct 14 ms 9436 KB Output is correct
33 Correct 15 ms 10564 KB Output is correct
34 Correct 24 ms 10460 KB Output is correct
35 Correct 25 ms 10456 KB Output is correct
36 Correct 2 ms 8536 KB Output is correct
37 Correct 8 ms 8936 KB Output is correct
38 Correct 11 ms 9444 KB Output is correct
39 Correct 9 ms 9060 KB Output is correct
40 Correct 9 ms 8936 KB Output is correct
41 Correct 8 ms 9508 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 2 ms 8380 KB Output is correct
46 Correct 2 ms 8284 KB Output is correct
47 Correct 13 ms 9616 KB Output is correct
48 Correct 15 ms 10700 KB Output is correct
49 Correct 2 ms 8540 KB Output is correct
50 Correct 2 ms 8536 KB Output is correct
51 Correct 31 ms 13244 KB Output is correct
52 Correct 2 ms 8540 KB Output is correct
53 Correct 2 ms 8484 KB Output is correct
54 Correct 2 ms 8540 KB Output is correct
55 Correct 1 ms 8540 KB Output is correct
56 Correct 1 ms 8284 KB Output is correct
57 Correct 2 ms 8540 KB Output is correct
58 Correct 2 ms 8328 KB Output is correct
59 Correct 589 ms 75204 KB Output is correct
60 Correct 562 ms 75336 KB Output is correct
61 Correct 668 ms 76556 KB Output is correct
62 Correct 791 ms 140728 KB Output is correct
63 Correct 776 ms 140716 KB Output is correct
64 Correct 733 ms 140704 KB Output is correct
65 Correct 771 ms 142196 KB Output is correct
66 Correct 728 ms 142436 KB Output is correct
67 Correct 733 ms 141460 KB Output is correct
68 Correct 342 ms 42412 KB Output is correct
69 Correct 359 ms 43176 KB Output is correct
70 Correct 281 ms 42040 KB Output is correct
71 Correct 233 ms 42668 KB Output is correct
72 Correct 247 ms 41644 KB Output is correct
73 Correct 222 ms 41612 KB Output is correct
74 Correct 92 ms 17596 KB Output is correct
75 Correct 91 ms 18372 KB Output is correct
76 Correct 110 ms 26032 KB Output is correct
77 Correct 55 ms 14784 KB Output is correct
78 Correct 83 ms 17596 KB Output is correct
79 Correct 48 ms 13856 KB Output is correct
80 Correct 5 ms 8796 KB Output is correct
81 Correct 56 ms 17580 KB Output is correct
82 Correct 66 ms 18136 KB Output is correct
83 Correct 64 ms 18136 KB Output is correct
84 Correct 80 ms 17080 KB Output is correct
85 Correct 60 ms 16832 KB Output is correct
86 Correct 3 ms 8796 KB Output is correct
87 Correct 3 ms 8540 KB Output is correct
88 Correct 3 ms 8684 KB Output is correct
89 Correct 3 ms 8536 KB Output is correct
90 Correct 1 ms 8540 KB Output is correct
91 Correct 21 ms 10460 KB Output is correct
92 Runtime error 17 ms 17424 KB Execution killed with signal 11
93 Halted 0 ms 0 KB -