oj.uz

답안 #565462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565462 2022-05-20T22:52:02 Z shrimb Building Skyscrapers (CEOI19_skyscrapers) C++17
61 / 100
 3500 ms 160352 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};
// 0 4 6 2 3 5 1 7    0  1  2   3   4   5   6   7
const int roundx[] = {1, 1, 0, -1, -1, -1,  0,  1};
const int roundy[] = {0, 1, 1,  1,  0, -1, -1, -1};

int ddd[] = {0,4,6,2,3,5,1,7};
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;
    bool isout = 0;
    for (int d = 0 ; d < 8 ; d+=2) {
        int u2 = u + roundx[d];
        int v2 = v + roundy[d];
        if (!FF[id][d]) {
            int cmp = Find(Empty[HASH(u2,v2)]);
            if (out[cmp]) isout = 1;
        }
    }
    if (!isout) {expendable.erase(c);return;}
    // 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};
    }
    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))) {
                if(!Empty.count(HASH(u,v))) {
                    int id = Empty[HASH(u,v)] = ID++;
                    dsu[id] = id;
                    vec[id].push_back({u, v});
                }
            } else {
                FF[Full[HASH(u, v)]][ddd[d]] = 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))) {
                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));
        for (int d = 0 ; d < 8 ; d++) {
            int u = a + dx[d];
            int v = b + dy[d];
            if (S.count(HASH(u,v))) {
                FF[Full[HASH(u, v)]][ddd[d]] = 0;
            }
        }
        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);
            }
        }
    }

    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:75:9: warning: variable 'prev' set but not used [-Wunused-but-set-variable]
   75 |     int prev = -1;
      |         ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 40276 KB ans=YES N=1
2 Correct 19 ms 40328 KB ans=YES N=4
3 Correct 22 ms 40308 KB ans=NO N=4
4 Correct 19 ms 40404 KB ans=YES N=5
5 Correct 19 ms 40296 KB ans=YES N=9
6 Correct 20 ms 40348 KB ans=YES N=5
7 Correct 19 ms 40396 KB ans=NO N=9
8 Correct 20 ms 40388 KB ans=NO N=10
9 Correct 21 ms 40404 KB ans=YES N=10
10 Correct 20 ms 40292 KB ans=YES N=10
11 Correct 20 ms 40356 KB ans=YES N=10
12 Correct 20 ms 40292 KB ans=YES N=9
13 Correct 19 ms 40404 KB ans=YES N=9
14 Correct 20 ms 40404 KB ans=YES N=8
15 Correct 20 ms 40356 KB ans=YES N=8
16 Correct 19 ms 40308 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 40276 KB ans=YES N=1
2 Correct 19 ms 40328 KB ans=YES N=4
3 Correct 22 ms 40308 KB ans=NO N=4
4 Correct 19 ms 40404 KB ans=YES N=5
5 Correct 19 ms 40296 KB ans=YES N=9
6 Correct 20 ms 40348 KB ans=YES N=5
7 Correct 19 ms 40396 KB ans=NO N=9
8 Correct 20 ms 40388 KB ans=NO N=10
9 Correct 21 ms 40404 KB ans=YES N=10
10 Correct 20 ms 40292 KB ans=YES N=10
11 Correct 20 ms 40356 KB ans=YES N=10
12 Correct 20 ms 40292 KB ans=YES N=9
13 Correct 19 ms 40404 KB ans=YES N=9
14 Correct 20 ms 40404 KB ans=YES N=8
15 Correct 20 ms 40356 KB ans=YES N=8
16 Correct 19 ms 40308 KB ans=NO N=2
17 Correct 19 ms 40404 KB ans=YES N=17
18 Correct 20 ms 40404 KB ans=YES N=25
19 Correct 21 ms 40340 KB ans=YES N=100
20 Correct 21 ms 40416 KB ans=YES N=185
21 Correct 20 ms 40360 KB ans=NO N=174
22 Correct 20 ms 40404 KB ans=YES N=90
23 Correct 21 ms 40348 KB ans=YES N=63
24 Correct 20 ms 40404 KB ans=YES N=87
25 Correct 21 ms 40352 KB ans=YES N=183
26 Correct 22 ms 40444 KB ans=YES N=188
27 Correct 23 ms 40532 KB ans=YES N=183
28 Correct 21 ms 40404 KB ans=YES N=189
29 Correct 26 ms 40404 KB ans=YES N=200
30 Correct 26 ms 40480 KB ans=YES N=190
31 Correct 21 ms 40452 KB ans=YES N=187
32 Correct 23 ms 40404 KB ans=YES N=187
33 Correct 21 ms 40404 KB ans=YES N=182
34 Correct 22 ms 40484 KB ans=YES N=184
35 Correct 22 ms 40448 KB ans=YES N=188
36 Correct 22 ms 40392 KB ans=YES N=181
37 Correct 23 ms 40504 KB ans=YES N=188
38 Correct 23 ms 40656 KB ans=YES N=191
39 Correct 21 ms 40460 KB ans=YES N=196
40 Correct 21 ms 40360 KB ans=YES N=196
41 Correct 22 ms 40448 KB ans=YES N=196
42 Correct 20 ms 40404 KB ans=YES N=196
43 Correct 21 ms 40404 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 40276 KB ans=YES N=1
2 Correct 19 ms 40328 KB ans=YES N=4
3 Correct 22 ms 40308 KB ans=NO N=4
4 Correct 19 ms 40404 KB ans=YES N=5
5 Correct 19 ms 40296 KB ans=YES N=9
6 Correct 20 ms 40348 KB ans=YES N=5
7 Correct 19 ms 40396 KB ans=NO N=9
8 Correct 20 ms 40388 KB ans=NO N=10
9 Correct 21 ms 40404 KB ans=YES N=10
10 Correct 20 ms 40292 KB ans=YES N=10
11 Correct 20 ms 40356 KB ans=YES N=10
12 Correct 20 ms 40292 KB ans=YES N=9
13 Correct 19 ms 40404 KB ans=YES N=9
14 Correct 20 ms 40404 KB ans=YES N=8
15 Correct 20 ms 40356 KB ans=YES N=8
16 Correct 19 ms 40308 KB ans=NO N=2
17 Correct 19 ms 40404 KB ans=YES N=17
18 Correct 20 ms 40404 KB ans=YES N=25
19 Correct 21 ms 40340 KB ans=YES N=100
20 Correct 21 ms 40416 KB ans=YES N=185
21 Correct 20 ms 40360 KB ans=NO N=174
22 Correct 20 ms 40404 KB ans=YES N=90
23 Correct 21 ms 40348 KB ans=YES N=63
24 Correct 20 ms 40404 KB ans=YES N=87
25 Correct 21 ms 40352 KB ans=YES N=183
26 Correct 22 ms 40444 KB ans=YES N=188
27 Correct 23 ms 40532 KB ans=YES N=183
28 Correct 21 ms 40404 KB ans=YES N=189
29 Correct 26 ms 40404 KB ans=YES N=200
30 Correct 26 ms 40480 KB ans=YES N=190
31 Correct 21 ms 40452 KB ans=YES N=187
32 Correct 23 ms 40404 KB ans=YES N=187
33 Correct 21 ms 40404 KB ans=YES N=182
34 Correct 22 ms 40484 KB ans=YES N=184
35 Correct 22 ms 40448 KB ans=YES N=188
36 Correct 22 ms 40392 KB ans=YES N=181
37 Correct 23 ms 40504 KB ans=YES N=188
38 Correct 23 ms 40656 KB ans=YES N=191
39 Correct 21 ms 40460 KB ans=YES N=196
40 Correct 21 ms 40360 KB ans=YES N=196
41 Correct 22 ms 40448 KB ans=YES N=196
42 Correct 20 ms 40404 KB ans=YES N=196
43 Correct 21 ms 40404 KB ans=YES N=195
44 Correct 25 ms 40660 KB ans=NO N=1934
45 Correct 22 ms 40720 KB ans=NO N=1965
46 Correct 26 ms 40912 KB ans=YES N=1824
47 Correct 30 ms 40872 KB ans=YES N=1981
48 Correct 28 ms 40852 KB ans=YES N=1814
49 Correct 28 ms 40996 KB ans=YES N=1854
50 Correct 27 ms 40916 KB ans=YES N=1831
51 Correct 28 ms 40916 KB ans=YES N=2000
52 Correct 31 ms 41044 KB ans=YES N=1847
53 Correct 32 ms 41016 KB ans=YES N=1819
54 Correct 27 ms 40840 KB ans=YES N=1986
55 Correct 37 ms 41504 KB ans=YES N=2000
56 Correct 38 ms 41468 KB ans=YES N=1834
57 Correct 40 ms 41528 KB ans=YES N=1860
58 Correct 40 ms 41512 KB ans=YES N=1898
59 Correct 36 ms 41284 KB ans=YES N=1832
60 Correct 42 ms 41824 KB ans=YES N=1929
61 Correct 30 ms 40916 KB ans=YES N=1919
62 Correct 36 ms 41436 KB ans=YES N=1882
63 Correct 42 ms 41928 KB ans=YES N=1922
64 Correct 33 ms 41124 KB ans=YES N=1989
65 Correct 39 ms 41448 KB ans=YES N=1978
66 Correct 32 ms 41436 KB ans=YES N=1867
67 Correct 35 ms 41312 KB ans=YES N=1942

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 40672 KB ans=NO N=1934
2 Correct 25 ms 40628 KB ans=NO N=1965
3 Correct 28 ms 40908 KB ans=YES N=1824
4 Correct 27 ms 40916 KB ans=YES N=1981
5 Correct 27 ms 40872 KB ans=YES N=1814
6 Correct 30 ms 40988 KB ans=YES N=1854
7 Correct 27 ms 40916 KB ans=YES N=1831
8 Correct 28 ms 40912 KB ans=YES N=2000
9 Correct 30 ms 41044 KB ans=YES N=1847
10 Correct 33 ms 41088 KB ans=YES N=1819
11 Correct 27 ms 40980 KB ans=YES N=1986
12 Correct 36 ms 41400 KB ans=YES N=2000
13 Correct 37 ms 41524 KB ans=YES N=1834
14 Correct 38 ms 41488 KB ans=YES N=1860
15 Correct 40 ms 41592 KB ans=YES N=1898
16 Correct 37 ms 41348 KB ans=YES N=1832
17 Correct 42 ms 41860 KB ans=YES N=1929
18 Correct 29 ms 40920 KB ans=YES N=1919
19 Correct 35 ms 41356 KB ans=YES N=1882
20 Correct 44 ms 41940 KB ans=YES N=1922
21 Correct 29 ms 41164 KB ans=YES N=1989
22 Correct 38 ms 41408 KB ans=YES N=1978
23 Correct 32 ms 41420 KB ans=YES N=1867

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 40276 KB ans=YES N=1
2 Correct 19 ms 40328 KB ans=YES N=4
3 Correct 22 ms 40308 KB ans=NO N=4
4 Correct 19 ms 40404 KB ans=YES N=5
5 Correct 19 ms 40296 KB ans=YES N=9
6 Correct 20 ms 40348 KB ans=YES N=5
7 Correct 19 ms 40396 KB ans=NO N=9
8 Correct 20 ms 40388 KB ans=NO N=10
9 Correct 21 ms 40404 KB ans=YES N=10
10 Correct 20 ms 40292 KB ans=YES N=10
11 Correct 20 ms 40356 KB ans=YES N=10
12 Correct 20 ms 40292 KB ans=YES N=9
13 Correct 19 ms 40404 KB ans=YES N=9
14 Correct 20 ms 40404 KB ans=YES N=8
15 Correct 20 ms 40356 KB ans=YES N=8
16 Correct 19 ms 40308 KB ans=NO N=2
17 Correct 19 ms 40404 KB ans=YES N=17
18 Correct 20 ms 40404 KB ans=YES N=25
19 Correct 21 ms 40340 KB ans=YES N=100
20 Correct 21 ms 40416 KB ans=YES N=185
21 Correct 20 ms 40360 KB ans=NO N=174
22 Correct 20 ms 40404 KB ans=YES N=90
23 Correct 21 ms 40348 KB ans=YES N=63
24 Correct 20 ms 40404 KB ans=YES N=87
25 Correct 21 ms 40352 KB ans=YES N=183
26 Correct 22 ms 40444 KB ans=YES N=188
27 Correct 23 ms 40532 KB ans=YES N=183
28 Correct 21 ms 40404 KB ans=YES N=189
29 Correct 26 ms 40404 KB ans=YES N=200
30 Correct 26 ms 40480 KB ans=YES N=190
31 Correct 21 ms 40452 KB ans=YES N=187
32 Correct 23 ms 40404 KB ans=YES N=187
33 Correct 21 ms 40404 KB ans=YES N=182
34 Correct 22 ms 40484 KB ans=YES N=184
35 Correct 22 ms 40448 KB ans=YES N=188
36 Correct 22 ms 40392 KB ans=YES N=181
37 Correct 23 ms 40504 KB ans=YES N=188
38 Correct 23 ms 40656 KB ans=YES N=191
39 Correct 21 ms 40460 KB ans=YES N=196
40 Correct 21 ms 40360 KB ans=YES N=196
41 Correct 22 ms 40448 KB ans=YES N=196
42 Correct 20 ms 40404 KB ans=YES N=196
43 Correct 21 ms 40404 KB ans=YES N=195
44 Correct 25 ms 40660 KB ans=NO N=1934
45 Correct 22 ms 40720 KB ans=NO N=1965
46 Correct 26 ms 40912 KB ans=YES N=1824
47 Correct 30 ms 40872 KB ans=YES N=1981
48 Correct 28 ms 40852 KB ans=YES N=1814
49 Correct 28 ms 40996 KB ans=YES N=1854
50 Correct 27 ms 40916 KB ans=YES N=1831
51 Correct 28 ms 40916 KB ans=YES N=2000
52 Correct 31 ms 41044 KB ans=YES N=1847
53 Correct 32 ms 41016 KB ans=YES N=1819
54 Correct 27 ms 40840 KB ans=YES N=1986
55 Correct 37 ms 41504 KB ans=YES N=2000
56 Correct 38 ms 41468 KB ans=YES N=1834
57 Correct 40 ms 41528 KB ans=YES N=1860
58 Correct 40 ms 41512 KB ans=YES N=1898
59 Correct 36 ms 41284 KB ans=YES N=1832
60 Correct 42 ms 41824 KB ans=YES N=1929
61 Correct 30 ms 40916 KB ans=YES N=1919
62 Correct 36 ms 41436 KB ans=YES N=1882
63 Correct 42 ms 41928 KB ans=YES N=1922
64 Correct 33 ms 41124 KB ans=YES N=1989
65 Correct 39 ms 41448 KB ans=YES N=1978
66 Correct 32 ms 41436 KB ans=YES N=1867
67 Correct 35 ms 41312 KB ans=YES N=1942
68 Correct 68 ms 51816 KB ans=NO N=66151
69 Correct 82 ms 51528 KB ans=NO N=64333
70 Correct 450 ms 57580 KB ans=YES N=69316
71 Correct 498 ms 56968 KB ans=YES N=66695
72 Correct 450 ms 57524 KB ans=YES N=68436
73 Correct 469 ms 57904 KB ans=YES N=70000
74 Correct 473 ms 57668 KB ans=YES N=68501
75 Correct 504 ms 58424 KB ans=YES N=70000
76 Correct 522 ms 58388 KB ans=YES N=65009
77 Correct 1051 ms 69184 KB ans=YES N=67007
78 Correct 1327 ms 77968 KB ans=YES N=66357
79 Correct 1382 ms 81620 KB ans=YES N=65430
80 Correct 1367 ms 78700 KB ans=YES N=65790
81 Correct 1254 ms 75392 KB ans=YES N=66020
82 Correct 995 ms 70976 KB ans=YES N=65809
83 Correct 677 ms 62012 KB ans=YES N=65651
84 Correct 1604 ms 105584 KB ans=YES N=68040
85 Correct 1442 ms 85088 KB ans=YES N=66570
86 Correct 487 ms 57912 KB ans=YES N=65421
87 Correct 581 ms 60564 KB ans=YES N=68351
88 Correct 406 ms 57020 KB ans=YES N=67027
89 Correct 1488 ms 70964 KB ans=YES N=68879
90 Correct 704 ms 60120 KB ans=YES N=67256
91 Correct 1242 ms 78136 KB ans=YES N=148315
92 Correct 152 ms 65084 KB ans=NO N=142745
93 Correct 182 ms 66112 KB ans=NO N=148443
94 Correct 1150 ms 76732 KB ans=YES N=148328
95 Correct 1160 ms 76972 KB ans=YES N=147855
96 Correct 1271 ms 77212 KB ans=YES N=150000
97 Correct 1113 ms 76044 KB ans=YES N=144725
98 Correct 1248 ms 77312 KB ans=YES N=149445
99 Correct 1211 ms 76428 KB ans=YES N=144455
100 Correct 1180 ms 75988 KB ans=YES N=143487
101 Correct 1239 ms 77632 KB ans=YES N=149688
102 Correct 2868 ms 115104 KB ans=YES N=141481
103 Execution timed out 3573 ms 160352 KB Time limit exceeded
104 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 51892 KB ans=NO N=66151
2 Correct 71 ms 51520 KB ans=NO N=64333
3 Correct 474 ms 57668 KB ans=YES N=69316
4 Correct 460 ms 57068 KB ans=YES N=66695
5 Correct 478 ms 57456 KB ans=YES N=68436
6 Correct 489 ms 57996 KB ans=YES N=70000
7 Correct 476 ms 57744 KB ans=YES N=68501
8 Correct 495 ms 58404 KB ans=YES N=70000
9 Correct 494 ms 58304 KB ans=YES N=65009
10 Correct 1029 ms 69184 KB ans=YES N=67007
11 Correct 1352 ms 78188 KB ans=YES N=66357
12 Correct 1342 ms 81656 KB ans=YES N=65430
13 Correct 1325 ms 78756 KB ans=YES N=65790
14 Correct 1160 ms 75308 KB ans=YES N=66020
15 Correct 959 ms 70988 KB ans=YES N=65809
16 Correct 648 ms 62052 KB ans=YES N=65651
17 Correct 1544 ms 105756 KB ans=YES N=68040
18 Correct 1356 ms 85232 KB ans=YES N=66570
19 Correct 483 ms 58356 KB ans=YES N=65421
20 Correct 586 ms 60536 KB ans=YES N=68351
21 Correct 354 ms 56932 KB ans=YES N=67027
22 Correct 1486 ms 70988 KB ans=YES N=68879
23 Correct 696 ms 60080 KB ans=YES N=67256

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 40672 KB ans=NO N=1934
2 Correct 25 ms 40628 KB ans=NO N=1965
3 Correct 28 ms 40908 KB ans=YES N=1824
4 Correct 27 ms 40916 KB ans=YES N=1981
5 Correct 27 ms 40872 KB ans=YES N=1814
6 Correct 30 ms 40988 KB ans=YES N=1854
7 Correct 27 ms 40916 KB ans=YES N=1831
8 Correct 28 ms 40912 KB ans=YES N=2000
9 Correct 30 ms 41044 KB ans=YES N=1847
10 Correct 33 ms 41088 KB ans=YES N=1819
11 Correct 27 ms 40980 KB ans=YES N=1986
12 Correct 36 ms 41400 KB ans=YES N=2000
13 Correct 37 ms 41524 KB ans=YES N=1834
14 Correct 38 ms 41488 KB ans=YES N=1860
15 Correct 40 ms 41592 KB ans=YES N=1898
16 Correct 37 ms 41348 KB ans=YES N=1832
17 Correct 42 ms 41860 KB ans=YES N=1929
18 Correct 29 ms 40920 KB ans=YES N=1919
19 Correct 35 ms 41356 KB ans=YES N=1882
20 Correct 44 ms 41940 KB ans=YES N=1922
21 Correct 29 ms 41164 KB ans=YES N=1989
22 Correct 38 ms 41408 KB ans=YES N=1978
23 Correct 32 ms 41420 KB ans=YES N=1867
24 Correct 75 ms 51892 KB ans=NO N=66151
25 Correct 71 ms 51520 KB ans=NO N=64333
26 Correct 474 ms 57668 KB ans=YES N=69316
27 Correct 460 ms 57068 KB ans=YES N=66695
28 Correct 478 ms 57456 KB ans=YES N=68436
29 Correct 489 ms 57996 KB ans=YES N=70000
30 Correct 476 ms 57744 KB ans=YES N=68501
31 Correct 495 ms 58404 KB ans=YES N=70000
32 Correct 494 ms 58304 KB ans=YES N=65009
33 Correct 1029 ms 69184 KB ans=YES N=67007
34 Correct 1352 ms 78188 KB ans=YES N=66357
35 Correct 1342 ms 81656 KB ans=YES N=65430
36 Correct 1325 ms 78756 KB ans=YES N=65790
37 Correct 1160 ms 75308 KB ans=YES N=66020
38 Correct 959 ms 70988 KB ans=YES N=65809
39 Correct 648 ms 62052 KB ans=YES N=65651
40 Correct 1544 ms 105756 KB ans=YES N=68040
41 Correct 1356 ms 85232 KB ans=YES N=66570
42 Correct 483 ms 58356 KB ans=YES N=65421
43 Correct 586 ms 60536 KB ans=YES N=68351
44 Correct 354 ms 56932 KB ans=YES N=67027
45 Correct 1486 ms 70988 KB ans=YES N=68879
46 Correct 696 ms 60080 KB ans=YES N=67256
47 Correct 1233 ms 78276 KB ans=YES N=148315
48 Correct 152 ms 65128 KB ans=NO N=142745
49 Correct 170 ms 66056 KB ans=NO N=148443
50 Correct 1127 ms 76900 KB ans=YES N=148328
51 Correct 1125 ms 76820 KB ans=YES N=147855
52 Correct 1180 ms 77424 KB ans=YES N=150000
53 Correct 1089 ms 76056 KB ans=YES N=144725
54 Correct 1166 ms 76952 KB ans=YES N=149445
55 Correct 1149 ms 76448 KB ans=YES N=144455
56 Correct 1097 ms 75972 KB ans=YES N=143487
57 Correct 1193 ms 77792 KB ans=YES N=149688
58 Correct 2760 ms 115276 KB ans=YES N=141481
59 Execution timed out 3569 ms 157744 KB Time limit exceeded
60 Halted 0 ms 0 KB -