oj.uz

답안 #565444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565444 2022-05-20T22:04:02 Z shrimb Building Skyscrapers (CEOI19_skyscrapers) C++17
61 / 100
 3500 ms 105616 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")

#include"bits/stdc++.h"
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;

#define int long long
#define endl '\n'
#define mod 1000000007
//\
#define mod 1686876991

#define MN -1000000001

const int maxn = 150001;
const int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
//
const int roundx[] = {1, 1, 0, -1, -1, -1, 0, 1, 1};
const int roundy[] = {0, 1, 1, 1, 0, -1, -1, -1, 0};

struct cell {int x, y, id;};

struct neal {
static uint64_t splitmix64(uint64_t x)
 {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const
 {
    static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
}
};

// #define HASH(a,b) (1000000000ll*b+a)
long long HASH (int a, int b) {
    return (long long)a + 1000000000ll*b;
}

int n, t, ID = 0, buf;
int x[maxn], y[maxn];
cell cells[maxn];
int dsu[4 * maxn];
vector<pair<int,int>> vec[4 * maxn];
bool out[4 * maxn];
bool FF[4*maxn][8];
pair<int,int> mp[4 * maxn];
unordered_set<long long> S;

unordered_map<int,int> Empty, Full; // maps cell to dsu
set<cell> active, expendable;

bool operator < (const cell& a, const cell& b) {
    return a.id > b.id;
}

int Find (int x) {
    return dsu[x] == x ? x : dsu[x] = Find(dsu[x]);
}

void check (const cell &c) {
    auto [u, v, id] = c;
    int prev = -1;
    bool artic = 0, sep = 0;
    vector<int> to_reset;
    for (int d = 0 ; d < 8 ; d++) {
        int u2 = u + roundx[d];
        int v2 = v + roundy[d];
        if (S.count(HASH(u2,v2))) FF[id][d] = 1;
        else FF[id][d] = 0;
    }
    for (int w = 0 ; w < 9 ; w++) {
        int d = w%8;
        int u2 = u + roundx[d];
        int v2 = v + roundy[d];
        if (FF[id][d]) sep = 1;
        else {
            if (d & 1) {
                continue;
            }
            int cmp = Find(Empty[HASH(u2,v2)]);
            if (mp[cmp].first != MN and sep == 1) {
                auto [pu, pv] = mp[cmp];
                bool bad = 0;
                for (int ww = w ; ; ww++) {
                    int d2 = ww % 8;
                    int u3 = u + roundx[d2];
                    int v3 = v + roundy[d2];
                    if (u3 == pu and v3 == pv) {
                        break;
                    }
                    else {
                        if (FF[id][d2]) {
                            bad = 1;
                            break;
                        }
                    }
                }
                if (bad) artic = 1;
            }
            mp[cmp] = {u2, v2};
            to_reset.push_back(cmp);
            sep = 0;
            prev = cmp;
        }
    }

    for (int cmp : to_reset) {
        mp[cmp] = {MN,-1};
    }
    bool isout = 0;
    if (!artic) {
        for (int d = 0 ; d < 4 ; d++) {
            int u2 = u + dx[d];
            int v2 = v + dy[d];
            if (Empty.count(HASH(u2,v2))) {
                int cmp = Find(Empty[HASH(u2,v2)]);
                if (out[cmp]) isout = 1;
            }
        }
    }
    if (isout and !artic) expendable.insert(c);
    else expendable.erase(c);
}


void Union (int a, int b) {
    int x = Find(a), y = Find(b);
    if (x == y) return;
    if (vec[x].size() < vec[y].size()) {
        out[y] |= out[x];
        dsu[x] = y;
        for (auto [u, v] : vec[x]) {
            vec[y].push_back({u, v});
            for (int d = 0 ; d < 8 ; d++) {
                if (Full.count(HASH(u + dx[d],v + dy[d]))) check(cells[Full[HASH(u + dx[d],v + dy[d])]]);
            }
        }
        vec[x].clear();
    } else {
        out[x] |= out[y];
        dsu[y] = x;
        for (auto [u, v] : vec[y]) {
            vec[x].push_back({u, v});
            for (int d = 0 ; d < 8 ; d++) {
                if (Full.count(HASH(u + dx[d],v + dy[d]))) check(cells[Full[HASH(u + dx[d],v + dy[d])]]);
            }
        }
        vec[y].clear();
    }
}

signed main () {
    cin.tie(0)->sync_with_stdio(0);
    Empty.reserve(4*262144);
    Full.reserve(4*262144);
    Empty.max_load_factor(0.25);
    Full.max_load_factor(0.25);
    cin >> n >> t;
    for (auto& [i, j] : mp) i = j = MN;

    for (int i = 0 ; i < n ; i++) {
        cin >> x[i] >> y[i];
        cells[i] = {x[i], y[i], i};
        Full[HASH(x[i],y[i])] = i;
        S.insert(HASH(x[i], y[i]));
        active.insert(cells[i]);
    }

    if (n > 1) {
        for (int i = 0 ; i < n ; i++) {
            bool good = 0;
            for (int d = 0 ; d < 8 ; d++) {
                int u = x[i] + dx[d];
                int v = y[i] + dy[d];
                good |= Full.count(HASH(u,v));
            }
            if (!good) {
                cout << "NO\n";
                return 0;
            }
        }
    }

    /* set at leat one node as out (for reference) */ {
        pair<int,int> mn = {x[0], y[0]};

        for (int i = 0 ; i < n ; i++) {
            mn = min(mn, {x[i], y[i]});
        }
        auto [u, v] = mn; u--;
        int id = Empty[HASH(u,v)] = ID++;
        dsu[id] = id;
        vec[id].push_back({u, v});
        out[id] = 1;
    }

    for (int i = 0 ; i < n ; i++) {
        for (int d = 0 ; d < 8 ; d++) {
            int u = x[i] + dx[d];
            int v = y[i] + dy[d];
            if (!S.count(HASH(u,v)) and !Empty.count(HASH(u,v))) {
                int id = Empty[HASH(u,v)] = ID++;
                dsu[id] = id;
                vec[id].push_back({u, v});
            }
        }
    }

    for (int i = 0 ; i < n ; i++) {
        for (int d = 0 ; d < 8 ; d++) {
            int u = x[i] + dx[d];
            int v = y[i] + dy[d];
            if (!S.count(HASH(u,v))) {
                for (int d2 = 0 ; d2 < 4 ; d2++) {
                    int u2 = u + dx[d2];
                    int v2 = v + dy[d2];
                    if (Empty.count(HASH(u2,v2))) {
                        Union(Empty[HASH(u,v)], Empty[HASH(u2,v2)]);
                    }
                }
            }
        }
    }

    for (int i = 0 ; i < n ; i++) check(cells[i]);

    cout << "YES\n";

    vector<int> ans;

    while (expendable.size()) {
        auto [a, b, c] = *expendable.begin();
        expendable.erase(expendable.begin());
        ans.push_back(c + 1);
        Full.erase(HASH(a,b));
        S.erase(HASH(a, b));
        int id = Empty[HASH(a,b)] = ID++;
        dsu[id] = id;
        vec[id].push_back({a, b});
        for (int d = 0 ; d < 4 ; d++) {
            int u = a + dx[d];
            int v = b + dy[d];
            if (Empty.count(HASH(u,v))) {
                Union(Empty[HASH(u,v)], id);
            }
        }
        for (int d = 0 ; d < 8 ; d++) {
            int u = a + dx[d];
            int v = b + dy[d];
            if (S.count(HASH(u,v))) check(cells[Full[HASH(u,v)]]);
        }
    }

    reverse(ans.begin(), ans.end());

    for (int i : ans) cout << i << "\n";
}

Compilation message

skyscrapers.cpp:17:1: warning: multi-line comment [-Wcomment]
   17 | //\
      | ^
skyscrapers.cpp: In function 'void check(const cell&)':
skyscrapers.cpp:74:9: warning: variable 'prev' set but not used [-Wunused-but-set-variable]
   74 |     int prev = -1;
      |         ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 40276 KB ans=YES N=1
2 Correct 20 ms 40368 KB ans=YES N=4
3 Correct 20 ms 40360 KB ans=NO N=4
4 Correct 20 ms 40384 KB ans=YES N=5
5 Correct 21 ms 40304 KB ans=YES N=9
6 Correct 19 ms 40292 KB ans=YES N=5
7 Correct 21 ms 40252 KB ans=NO N=9
8 Correct 20 ms 40276 KB ans=NO N=10
9 Correct 20 ms 40404 KB ans=YES N=10
10 Correct 24 ms 40352 KB ans=YES N=10
11 Correct 21 ms 40312 KB ans=YES N=10
12 Correct 21 ms 40404 KB ans=YES N=9
13 Correct 21 ms 40308 KB ans=YES N=9
14 Correct 21 ms 40332 KB ans=YES N=8
15 Correct 20 ms 40296 KB ans=YES N=8
16 Correct 24 ms 40276 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 40276 KB ans=YES N=1
2 Correct 20 ms 40368 KB ans=YES N=4
3 Correct 20 ms 40360 KB ans=NO N=4
4 Correct 20 ms 40384 KB ans=YES N=5
5 Correct 21 ms 40304 KB ans=YES N=9
6 Correct 19 ms 40292 KB ans=YES N=5
7 Correct 21 ms 40252 KB ans=NO N=9
8 Correct 20 ms 40276 KB ans=NO N=10
9 Correct 20 ms 40404 KB ans=YES N=10
10 Correct 24 ms 40352 KB ans=YES N=10
11 Correct 21 ms 40312 KB ans=YES N=10
12 Correct 21 ms 40404 KB ans=YES N=9
13 Correct 21 ms 40308 KB ans=YES N=9
14 Correct 21 ms 40332 KB ans=YES N=8
15 Correct 20 ms 40296 KB ans=YES N=8
16 Correct 24 ms 40276 KB ans=NO N=2
17 Correct 22 ms 40348 KB ans=YES N=17
18 Correct 21 ms 40340 KB ans=YES N=25
19 Correct 22 ms 40404 KB ans=YES N=100
20 Correct 24 ms 40388 KB ans=YES N=185
21 Correct 22 ms 40364 KB ans=NO N=174
22 Correct 21 ms 40404 KB ans=YES N=90
23 Correct 27 ms 40404 KB ans=YES N=63
24 Correct 22 ms 40336 KB ans=YES N=87
25 Correct 23 ms 40404 KB ans=YES N=183
26 Correct 25 ms 40404 KB ans=YES N=188
27 Correct 23 ms 40404 KB ans=YES N=183
28 Correct 23 ms 40460 KB ans=YES N=189
29 Correct 23 ms 40456 KB ans=YES N=200
30 Correct 23 ms 40404 KB ans=YES N=190
31 Correct 23 ms 40404 KB ans=YES N=187
32 Correct 24 ms 40404 KB ans=YES N=187
33 Correct 23 ms 40404 KB ans=YES N=182
34 Correct 23 ms 40484 KB ans=YES N=184
35 Correct 23 ms 40500 KB ans=YES N=188
36 Correct 23 ms 40404 KB ans=YES N=181
37 Correct 24 ms 40404 KB ans=YES N=188
38 Correct 24 ms 40428 KB ans=YES N=191
39 Correct 23 ms 40404 KB ans=YES N=196
40 Correct 24 ms 40404 KB ans=YES N=196
41 Correct 22 ms 40500 KB ans=YES N=196
42 Correct 21 ms 40404 KB ans=YES N=196
43 Correct 27 ms 40440 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 40276 KB ans=YES N=1
2 Correct 20 ms 40368 KB ans=YES N=4
3 Correct 20 ms 40360 KB ans=NO N=4
4 Correct 20 ms 40384 KB ans=YES N=5
5 Correct 21 ms 40304 KB ans=YES N=9
6 Correct 19 ms 40292 KB ans=YES N=5
7 Correct 21 ms 40252 KB ans=NO N=9
8 Correct 20 ms 40276 KB ans=NO N=10
9 Correct 20 ms 40404 KB ans=YES N=10
10 Correct 24 ms 40352 KB ans=YES N=10
11 Correct 21 ms 40312 KB ans=YES N=10
12 Correct 21 ms 40404 KB ans=YES N=9
13 Correct 21 ms 40308 KB ans=YES N=9
14 Correct 21 ms 40332 KB ans=YES N=8
15 Correct 20 ms 40296 KB ans=YES N=8
16 Correct 24 ms 40276 KB ans=NO N=2
17 Correct 22 ms 40348 KB ans=YES N=17
18 Correct 21 ms 40340 KB ans=YES N=25
19 Correct 22 ms 40404 KB ans=YES N=100
20 Correct 24 ms 40388 KB ans=YES N=185
21 Correct 22 ms 40364 KB ans=NO N=174
22 Correct 21 ms 40404 KB ans=YES N=90
23 Correct 27 ms 40404 KB ans=YES N=63
24 Correct 22 ms 40336 KB ans=YES N=87
25 Correct 23 ms 40404 KB ans=YES N=183
26 Correct 25 ms 40404 KB ans=YES N=188
27 Correct 23 ms 40404 KB ans=YES N=183
28 Correct 23 ms 40460 KB ans=YES N=189
29 Correct 23 ms 40456 KB ans=YES N=200
30 Correct 23 ms 40404 KB ans=YES N=190
31 Correct 23 ms 40404 KB ans=YES N=187
32 Correct 24 ms 40404 KB ans=YES N=187
33 Correct 23 ms 40404 KB ans=YES N=182
34 Correct 23 ms 40484 KB ans=YES N=184
35 Correct 23 ms 40500 KB ans=YES N=188
36 Correct 23 ms 40404 KB ans=YES N=181
37 Correct 24 ms 40404 KB ans=YES N=188
38 Correct 24 ms 40428 KB ans=YES N=191
39 Correct 23 ms 40404 KB ans=YES N=196
40 Correct 24 ms 40404 KB ans=YES N=196
41 Correct 22 ms 40500 KB ans=YES N=196
42 Correct 21 ms 40404 KB ans=YES N=196
43 Correct 27 ms 40440 KB ans=YES N=195
44 Correct 23 ms 40704 KB ans=NO N=1934
45 Correct 23 ms 40736 KB ans=NO N=1965
46 Correct 32 ms 40916 KB ans=YES N=1824
47 Correct 35 ms 40960 KB ans=YES N=1981
48 Correct 31 ms 40916 KB ans=YES N=1814
49 Correct 38 ms 40976 KB ans=YES N=1854
50 Correct 33 ms 40820 KB ans=YES N=1831
51 Correct 36 ms 40916 KB ans=YES N=2000
52 Correct 40 ms 40916 KB ans=YES N=1847
53 Correct 44 ms 41072 KB ans=YES N=1819
54 Correct 35 ms 40928 KB ans=YES N=1986
55 Correct 52 ms 41296 KB ans=YES N=2000
56 Correct 61 ms 41548 KB ans=YES N=1834
57 Correct 58 ms 41524 KB ans=YES N=1860
58 Correct 59 ms 41484 KB ans=YES N=1898
59 Correct 49 ms 41340 KB ans=YES N=1832
60 Correct 70 ms 41872 KB ans=YES N=1929
61 Correct 38 ms 41036 KB ans=YES N=1919
62 Correct 54 ms 41468 KB ans=YES N=1882
63 Correct 66 ms 41932 KB ans=YES N=1922
64 Correct 39 ms 41116 KB ans=YES N=1989
65 Correct 55 ms 41480 KB ans=YES N=1978
66 Correct 47 ms 41512 KB ans=YES N=1867
67 Correct 51 ms 41292 KB ans=YES N=1942

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 40588 KB ans=NO N=1934
2 Correct 24 ms 40624 KB ans=NO N=1965
3 Correct 33 ms 40916 KB ans=YES N=1824
4 Correct 37 ms 40860 KB ans=YES N=1981
5 Correct 37 ms 40788 KB ans=YES N=1814
6 Correct 38 ms 40928 KB ans=YES N=1854
7 Correct 42 ms 40864 KB ans=YES N=1831
8 Correct 36 ms 40860 KB ans=YES N=2000
9 Correct 42 ms 40956 KB ans=YES N=1847
10 Correct 43 ms 41036 KB ans=YES N=1819
11 Correct 37 ms 40908 KB ans=YES N=1986
12 Correct 53 ms 41356 KB ans=YES N=2000
13 Correct 66 ms 41548 KB ans=YES N=1834
14 Correct 58 ms 41456 KB ans=YES N=1860
15 Correct 60 ms 41572 KB ans=YES N=1898
16 Correct 53 ms 41288 KB ans=YES N=1832
17 Correct 70 ms 41856 KB ans=YES N=1929
18 Correct 40 ms 41036 KB ans=YES N=1919
19 Correct 56 ms 41424 KB ans=YES N=1882
20 Correct 66 ms 41952 KB ans=YES N=1922
21 Correct 38 ms 41064 KB ans=YES N=1989
22 Correct 59 ms 41480 KB ans=YES N=1978
23 Correct 48 ms 41424 KB ans=YES N=1867

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 40276 KB ans=YES N=1
2 Correct 20 ms 40368 KB ans=YES N=4
3 Correct 20 ms 40360 KB ans=NO N=4
4 Correct 20 ms 40384 KB ans=YES N=5
5 Correct 21 ms 40304 KB ans=YES N=9
6 Correct 19 ms 40292 KB ans=YES N=5
7 Correct 21 ms 40252 KB ans=NO N=9
8 Correct 20 ms 40276 KB ans=NO N=10
9 Correct 20 ms 40404 KB ans=YES N=10
10 Correct 24 ms 40352 KB ans=YES N=10
11 Correct 21 ms 40312 KB ans=YES N=10
12 Correct 21 ms 40404 KB ans=YES N=9
13 Correct 21 ms 40308 KB ans=YES N=9
14 Correct 21 ms 40332 KB ans=YES N=8
15 Correct 20 ms 40296 KB ans=YES N=8
16 Correct 24 ms 40276 KB ans=NO N=2
17 Correct 22 ms 40348 KB ans=YES N=17
18 Correct 21 ms 40340 KB ans=YES N=25
19 Correct 22 ms 40404 KB ans=YES N=100
20 Correct 24 ms 40388 KB ans=YES N=185
21 Correct 22 ms 40364 KB ans=NO N=174
22 Correct 21 ms 40404 KB ans=YES N=90
23 Correct 27 ms 40404 KB ans=YES N=63
24 Correct 22 ms 40336 KB ans=YES N=87
25 Correct 23 ms 40404 KB ans=YES N=183
26 Correct 25 ms 40404 KB ans=YES N=188
27 Correct 23 ms 40404 KB ans=YES N=183
28 Correct 23 ms 40460 KB ans=YES N=189
29 Correct 23 ms 40456 KB ans=YES N=200
30 Correct 23 ms 40404 KB ans=YES N=190
31 Correct 23 ms 40404 KB ans=YES N=187
32 Correct 24 ms 40404 KB ans=YES N=187
33 Correct 23 ms 40404 KB ans=YES N=182
34 Correct 23 ms 40484 KB ans=YES N=184
35 Correct 23 ms 40500 KB ans=YES N=188
36 Correct 23 ms 40404 KB ans=YES N=181
37 Correct 24 ms 40404 KB ans=YES N=188
38 Correct 24 ms 40428 KB ans=YES N=191
39 Correct 23 ms 40404 KB ans=YES N=196
40 Correct 24 ms 40404 KB ans=YES N=196
41 Correct 22 ms 40500 KB ans=YES N=196
42 Correct 21 ms 40404 KB ans=YES N=196
43 Correct 27 ms 40440 KB ans=YES N=195
44 Correct 23 ms 40704 KB ans=NO N=1934
45 Correct 23 ms 40736 KB ans=NO N=1965
46 Correct 32 ms 40916 KB ans=YES N=1824
47 Correct 35 ms 40960 KB ans=YES N=1981
48 Correct 31 ms 40916 KB ans=YES N=1814
49 Correct 38 ms 40976 KB ans=YES N=1854
50 Correct 33 ms 40820 KB ans=YES N=1831
51 Correct 36 ms 40916 KB ans=YES N=2000
52 Correct 40 ms 40916 KB ans=YES N=1847
53 Correct 44 ms 41072 KB ans=YES N=1819
54 Correct 35 ms 40928 KB ans=YES N=1986
55 Correct 52 ms 41296 KB ans=YES N=2000
56 Correct 61 ms 41548 KB ans=YES N=1834
57 Correct 58 ms 41524 KB ans=YES N=1860
58 Correct 59 ms 41484 KB ans=YES N=1898
59 Correct 49 ms 41340 KB ans=YES N=1832
60 Correct 70 ms 41872 KB ans=YES N=1929
61 Correct 38 ms 41036 KB ans=YES N=1919
62 Correct 54 ms 41468 KB ans=YES N=1882
63 Correct 66 ms 41932 KB ans=YES N=1922
64 Correct 39 ms 41116 KB ans=YES N=1989
65 Correct 55 ms 41480 KB ans=YES N=1978
66 Correct 47 ms 41512 KB ans=YES N=1867
67 Correct 51 ms 41292 KB ans=YES N=1942
68 Correct 71 ms 51908 KB ans=NO N=66151
69 Correct 76 ms 51696 KB ans=NO N=64333
70 Correct 709 ms 57532 KB ans=YES N=69316
71 Correct 689 ms 56980 KB ans=YES N=66695
72 Correct 685 ms 57448 KB ans=YES N=68436
73 Correct 711 ms 57940 KB ans=YES N=70000
74 Correct 711 ms 57720 KB ans=YES N=68501
75 Correct 755 ms 58480 KB ans=YES N=70000
76 Correct 733 ms 58384 KB ans=YES N=65009
77 Correct 1616 ms 69296 KB ans=YES N=67007
78 Correct 2208 ms 77972 KB ans=YES N=66357
79 Correct 2348 ms 81484 KB ans=YES N=65430
80 Correct 2169 ms 78776 KB ans=YES N=65790
81 Correct 1922 ms 75412 KB ans=YES N=66020
82 Correct 1524 ms 70988 KB ans=YES N=65809
83 Correct 1012 ms 62036 KB ans=YES N=65651
84 Correct 2614 ms 105616 KB ans=YES N=68040
85 Correct 2378 ms 85260 KB ans=YES N=66570
86 Correct 724 ms 57920 KB ans=YES N=65421
87 Correct 891 ms 60476 KB ans=YES N=68351
88 Correct 523 ms 57012 KB ans=YES N=67027
89 Correct 2551 ms 70956 KB ans=YES N=68879
90 Correct 1070 ms 60236 KB ans=YES N=67256
91 Correct 1689 ms 78192 KB ans=YES N=148315
92 Correct 157 ms 65088 KB ans=NO N=142745
93 Correct 181 ms 66116 KB ans=NO N=148443
94 Correct 1635 ms 76724 KB ans=YES N=148328
95 Correct 1689 ms 77112 KB ans=YES N=147855
96 Correct 1674 ms 77440 KB ans=YES N=150000
97 Correct 1601 ms 76084 KB ans=YES N=144725
98 Correct 1631 ms 77080 KB ans=YES N=149445
99 Correct 1632 ms 76476 KB ans=YES N=144455
100 Correct 1550 ms 76076 KB ans=YES N=143487
101 Correct 1656 ms 77584 KB ans=YES N=149688
102 Execution timed out 3579 ms 97020 KB Time limit exceeded
103 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 51824 KB ans=NO N=66151
2 Correct 76 ms 51516 KB ans=NO N=64333
3 Correct 691 ms 57552 KB ans=YES N=69316
4 Correct 643 ms 57140 KB ans=YES N=66695
5 Correct 684 ms 57648 KB ans=YES N=68436
6 Correct 716 ms 58012 KB ans=YES N=70000
7 Correct 710 ms 57848 KB ans=YES N=68501
8 Correct 753 ms 58468 KB ans=YES N=70000
9 Correct 743 ms 58276 KB ans=YES N=65009
10 Correct 1612 ms 69356 KB ans=YES N=67007
11 Correct 2191 ms 77976 KB ans=YES N=66357
12 Correct 2359 ms 81568 KB ans=YES N=65430
13 Correct 2191 ms 78916 KB ans=YES N=65790
14 Correct 1929 ms 75292 KB ans=YES N=66020
15 Correct 1532 ms 70948 KB ans=YES N=65809
16 Correct 1025 ms 62112 KB ans=YES N=65651
17 Correct 2606 ms 105548 KB ans=YES N=68040
18 Correct 2366 ms 85128 KB ans=YES N=66570
19 Correct 717 ms 57948 KB ans=YES N=65421
20 Correct 893 ms 60396 KB ans=YES N=68351
21 Correct 502 ms 57060 KB ans=YES N=67027
22 Correct 2563 ms 70996 KB ans=YES N=68879
23 Correct 1031 ms 60052 KB ans=YES N=67256

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 40588 KB ans=NO N=1934
2 Correct 24 ms 40624 KB ans=NO N=1965
3 Correct 33 ms 40916 KB ans=YES N=1824
4 Correct 37 ms 40860 KB ans=YES N=1981
5 Correct 37 ms 40788 KB ans=YES N=1814
6 Correct 38 ms 40928 KB ans=YES N=1854
7 Correct 42 ms 40864 KB ans=YES N=1831
8 Correct 36 ms 40860 KB ans=YES N=2000
9 Correct 42 ms 40956 KB ans=YES N=1847
10 Correct 43 ms 41036 KB ans=YES N=1819
11 Correct 37 ms 40908 KB ans=YES N=1986
12 Correct 53 ms 41356 KB ans=YES N=2000
13 Correct 66 ms 41548 KB ans=YES N=1834
14 Correct 58 ms 41456 KB ans=YES N=1860
15 Correct 60 ms 41572 KB ans=YES N=1898
16 Correct 53 ms 41288 KB ans=YES N=1832
17 Correct 70 ms 41856 KB ans=YES N=1929
18 Correct 40 ms 41036 KB ans=YES N=1919
19 Correct 56 ms 41424 KB ans=YES N=1882
20 Correct 66 ms 41952 KB ans=YES N=1922
21 Correct 38 ms 41064 KB ans=YES N=1989
22 Correct 59 ms 41480 KB ans=YES N=1978
23 Correct 48 ms 41424 KB ans=YES N=1867
24 Correct 69 ms 51824 KB ans=NO N=66151
25 Correct 76 ms 51516 KB ans=NO N=64333
26 Correct 691 ms 57552 KB ans=YES N=69316
27 Correct 643 ms 57140 KB ans=YES N=66695
28 Correct 684 ms 57648 KB ans=YES N=68436
29 Correct 716 ms 58012 KB ans=YES N=70000
30 Correct 710 ms 57848 KB ans=YES N=68501
31 Correct 753 ms 58468 KB ans=YES N=70000
32 Correct 743 ms 58276 KB ans=YES N=65009
33 Correct 1612 ms 69356 KB ans=YES N=67007
34 Correct 2191 ms 77976 KB ans=YES N=66357
35 Correct 2359 ms 81568 KB ans=YES N=65430
36 Correct 2191 ms 78916 KB ans=YES N=65790
37 Correct 1929 ms 75292 KB ans=YES N=66020
38 Correct 1532 ms 70948 KB ans=YES N=65809
39 Correct 1025 ms 62112 KB ans=YES N=65651
40 Correct 2606 ms 105548 KB ans=YES N=68040
41 Correct 2366 ms 85128 KB ans=YES N=66570
42 Correct 717 ms 57948 KB ans=YES N=65421
43 Correct 893 ms 60396 KB ans=YES N=68351
44 Correct 502 ms 57060 KB ans=YES N=67027
45 Correct 2563 ms 70996 KB ans=YES N=68879
46 Correct 1031 ms 60052 KB ans=YES N=67256
47 Correct 1650 ms 78164 KB ans=YES N=148315
48 Correct 154 ms 65120 KB ans=NO N=142745
49 Correct 176 ms 66112 KB ans=NO N=148443
50 Correct 1587 ms 76920 KB ans=YES N=148328
51 Correct 1664 ms 76920 KB ans=YES N=147855
52 Correct 1669 ms 77332 KB ans=YES N=150000
53 Correct 1564 ms 76216 KB ans=YES N=144725
54 Correct 1656 ms 76992 KB ans=YES N=149445
55 Correct 1667 ms 76416 KB ans=YES N=144455
56 Correct 1570 ms 76080 KB ans=YES N=143487
57 Correct 1669 ms 77604 KB ans=YES N=149688
58 Execution timed out 3550 ms 96848 KB Time limit exceeded
59 Halted 0 ms 0 KB -