oj.uz

답안 #347376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347376 2021-01-12T16:23:27 Z doowey Building Skyscrapers (CEOI19_skyscrapers) C++14
61 / 100
 3500 ms 74476 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)151111;

int dir[8][2] = {{-1,-1},{0,-1},{+1,-1},{+1,0},{+1,+1},{0,+1},{-1,+1},{-1,0}};
int adj[4][2] = {{-1,0},{+1,0},{0,-1},{0,+1}};

set<pii> graf;
map<ll, int> full;
map<pii, int> col;
set<pii> inq;

int ci[N], cj[N];
priority_queue<int> cand;

set<pii> vso;

const int D = (int)2e9 + 7;

ll getid(pii vv){
    vv.fi += (int)1e9 + 3;
    vv.se += (int)1e9 + 3;
    return vv.fi * 1ll * D + vv.se;
}

void check(pii cur){
    vso.insert(cur);
    pii nx;
    for(int q =0 ; q < 8 ; q ++ ){
        nx = mp(cur.fi+dir[q][0],cur.se+dir[q][1]);
        if(!vso.count(nx) && full.count(getid(nx))){
            check(nx);
        }
    }
}

void add_outside(pii cur){
    pii nx;
    col[cur]=0;
    for(int d = 0; d < 4; d ++ ){
        nx = mp(cur.fi+adj[d][0],cur.se+adj[d][1]);
        if(!graf.count(nx)) continue;
        if(full.count(getid(nx))){
            if(inq.count(nx)) continue;
            inq.insert(nx);
            col[nx]=0;
            cand.push(full[getid(nx)]);
        }
        else{
            if(!col.count(nx) || col[nx] > 0){
                add_outside(nx);
            }
        }
    }
}

void fillc(pii cur, int cl){
    pii nx;
    col[cur]=cl;
    for(int d = 0; d < 4; d ++ ){
        nx = mp(cur.fi+adj[d][0],cur.se+adj[d][1]);
        if(!graf.count(nx)) continue;
        if(full.count(getid(nx))) continue;
        if(col.count(nx)) continue;
        fillc(nx,cl);
    }
}

bool is_valid(pii xx){
    vector<int> q;
    pii nx;
    int cnt = 0;
    for(int t = 0; t < 8 ; t ++ ){
        nx = mp(xx.fi + dir[t][0], xx.se + dir[t][1]);
        if(full.count(getid(nx))){
            cnt ++ ;
            q.push_back(-1);
        }
        else{
            q.push_back(col[nx]);
        }
    }
    if(cnt <= 1 || cnt >= 7) return true;
    int pt, qt;
    for(int t = 0 ; t < 8 ; t += 2){ // corner
        pt = (t - 1 + 8) % 8;
        qt = (t + 1) % 8;
        if(q[t] == -1 && q[pt] >= 0 && q[pt] == q[qt]){
            return false;
        }
    }
    if(q[1] >= 0 && q[1] == q[5] && min({q[2],q[3],q[4]}) == -1 && min({q[0],q[6],q[7]}) == -1){
        return false;
    }
    if(q[3] >= 0 && q[3] == q[7] && min({q[0],q[1],q[2]}) == -1 && min({q[4],q[5],q[6]}) == -1){
        return false;
    }
    return true;
}

bool active[N];

int main(){
    fastIO;
    int n, tip;
    cin >> n >> tip;
    pii nx;
    pii low = mp((int)1e9 + 7, (int)1e9 + 7);
    for(int i = 1; i <= n; i ++ ){
        cin >> ci[i] >> cj[i];
        active[i]=true;
        graf.insert(mp(ci[i],cj[i]));
        full[getid(mp(ci[i],cj[i]))]=i;
        for(int j = 0 ;j < 8; j ++ ){
            nx = mp(ci[i]+dir[j][0],cj[i]+dir[j][1]);
            low = min(low, nx);
            graf.insert(nx);
        }
    }
    check(mp(ci[1],cj[1]));
    if(vso.size() != n){
        cout << "NO\n";
        return 0;
    }
    add_outside(low);
    int cnt = 1;
    for(auto v : graf){
        if(full.count(getid(v)) || col.count(v)) continue;
        fillc(v, cnt);
        cnt ++ ;
    }
    int node;
    vector<int> que;
    int hi, wi;
    for(int delet = 0; delet < n; delet ++ ){
        while(!cand.empty()){
            node = cand.top();
            cand.pop();
            if(!active[node]){
                continue;
            }
            if(is_valid(mp(ci[node],cj[node]))){
                active[node]=false;
                que.push_back(node);
                full.erase(getid(mp(ci[node],cj[node])));
                hi = -1;
                for(int i = 0 ; i < 2; i ++ ){
                    wi = -1;
                    for(int j = 0; j < 2; j ++ ){
                        nx = mp(ci[node]+hi,cj[node]+wi);
                        if(full.count(getid(nx)) && col.count(nx) && !inq.count(nx)){
                            inq.insert(nx);
                            cand.push(full[getid(nx)]);
                        }
                        wi *= -1;
                    }
                    hi *= -1;
                }
                add_outside(mp(ci[node],cj[node]));

                break;
            }
            else{
                inq.erase(mp(ci[node],cj[node]));
            }
        }
    }
    cout << "YES\n";
    reverse(que.begin(), que.end());
    for(auto x : que){
        cout << x << " ";
    }
    cout << "\n";
    return 0;
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:131:19: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  131 |     if(vso.size() != n){
      |        ~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 0 ms 364 KB ans=NO N=4
4 Correct 1 ms 364 KB ans=YES N=5
5 Correct 1 ms 364 KB ans=YES N=9
6 Correct 1 ms 364 KB ans=YES N=5
7 Correct 0 ms 364 KB ans=NO N=9
8 Correct 1 ms 364 KB ans=NO N=10
9 Correct 1 ms 364 KB ans=YES N=10
10 Correct 1 ms 364 KB ans=YES N=10
11 Correct 1 ms 364 KB ans=YES N=10
12 Correct 1 ms 364 KB ans=YES N=9
13 Correct 1 ms 364 KB ans=YES N=9
14 Correct 1 ms 364 KB ans=YES N=8
15 Correct 1 ms 364 KB ans=YES N=8
16 Correct 0 ms 364 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 0 ms 364 KB ans=NO N=4
4 Correct 1 ms 364 KB ans=YES N=5
5 Correct 1 ms 364 KB ans=YES N=9
6 Correct 1 ms 364 KB ans=YES N=5
7 Correct 0 ms 364 KB ans=NO N=9
8 Correct 1 ms 364 KB ans=NO N=10
9 Correct 1 ms 364 KB ans=YES N=10
10 Correct 1 ms 364 KB ans=YES N=10
11 Correct 1 ms 364 KB ans=YES N=10
12 Correct 1 ms 364 KB ans=YES N=9
13 Correct 1 ms 364 KB ans=YES N=9
14 Correct 1 ms 364 KB ans=YES N=8
15 Correct 1 ms 364 KB ans=YES N=8
16 Correct 0 ms 364 KB ans=NO N=2
17 Correct 1 ms 384 KB ans=YES N=17
18 Correct 1 ms 376 KB ans=YES N=25
19 Correct 1 ms 364 KB ans=YES N=100
20 Correct 2 ms 364 KB ans=YES N=185
21 Correct 1 ms 364 KB ans=NO N=174
22 Correct 1 ms 364 KB ans=YES N=90
23 Correct 1 ms 364 KB ans=YES N=63
24 Correct 1 ms 364 KB ans=YES N=87
25 Correct 2 ms 364 KB ans=YES N=183
26 Correct 2 ms 364 KB ans=YES N=188
27 Correct 3 ms 492 KB ans=YES N=183
28 Correct 2 ms 364 KB ans=YES N=189
29 Correct 2 ms 364 KB ans=YES N=200
30 Correct 3 ms 492 KB ans=YES N=190
31 Correct 2 ms 364 KB ans=YES N=187
32 Correct 2 ms 384 KB ans=YES N=187
33 Correct 2 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 620 KB ans=YES N=188
36 Correct 2 ms 492 KB ans=YES N=181
37 Correct 3 ms 492 KB ans=YES N=188
38 Correct 3 ms 492 KB ans=YES N=191
39 Correct 2 ms 492 KB ans=YES N=196
40 Correct 2 ms 492 KB ans=YES N=196
41 Correct 2 ms 492 KB ans=YES N=196
42 Correct 2 ms 492 KB ans=YES N=196
43 Correct 2 ms 492 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 0 ms 364 KB ans=NO N=4
4 Correct 1 ms 364 KB ans=YES N=5
5 Correct 1 ms 364 KB ans=YES N=9
6 Correct 1 ms 364 KB ans=YES N=5
7 Correct 0 ms 364 KB ans=NO N=9
8 Correct 1 ms 364 KB ans=NO N=10
9 Correct 1 ms 364 KB ans=YES N=10
10 Correct 1 ms 364 KB ans=YES N=10
11 Correct 1 ms 364 KB ans=YES N=10
12 Correct 1 ms 364 KB ans=YES N=9
13 Correct 1 ms 364 KB ans=YES N=9
14 Correct 1 ms 364 KB ans=YES N=8
15 Correct 1 ms 364 KB ans=YES N=8
16 Correct 0 ms 364 KB ans=NO N=2
17 Correct 1 ms 384 KB ans=YES N=17
18 Correct 1 ms 376 KB ans=YES N=25
19 Correct 1 ms 364 KB ans=YES N=100
20 Correct 2 ms 364 KB ans=YES N=185
21 Correct 1 ms 364 KB ans=NO N=174
22 Correct 1 ms 364 KB ans=YES N=90
23 Correct 1 ms 364 KB ans=YES N=63
24 Correct 1 ms 364 KB ans=YES N=87
25 Correct 2 ms 364 KB ans=YES N=183
26 Correct 2 ms 364 KB ans=YES N=188
27 Correct 3 ms 492 KB ans=YES N=183
28 Correct 2 ms 364 KB ans=YES N=189
29 Correct 2 ms 364 KB ans=YES N=200
30 Correct 3 ms 492 KB ans=YES N=190
31 Correct 2 ms 364 KB ans=YES N=187
32 Correct 2 ms 384 KB ans=YES N=187
33 Correct 2 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 620 KB ans=YES N=188
36 Correct 2 ms 492 KB ans=YES N=181
37 Correct 3 ms 492 KB ans=YES N=188
38 Correct 3 ms 492 KB ans=YES N=191
39 Correct 2 ms 492 KB ans=YES N=196
40 Correct 2 ms 492 KB ans=YES N=196
41 Correct 2 ms 492 KB ans=YES N=196
42 Correct 2 ms 492 KB ans=YES N=196
43 Correct 2 ms 492 KB ans=YES N=195
44 Correct 5 ms 1260 KB ans=NO N=1934
45 Correct 4 ms 748 KB ans=NO N=1965
46 Correct 14 ms 1004 KB ans=YES N=1824
47 Correct 16 ms 1004 KB ans=YES N=1981
48 Correct 14 ms 1004 KB ans=YES N=1814
49 Correct 18 ms 1004 KB ans=YES N=1854
50 Correct 15 ms 1004 KB ans=YES N=1831
51 Correct 17 ms 1132 KB ans=YES N=2000
52 Correct 19 ms 1132 KB ans=YES N=1847
53 Correct 21 ms 1260 KB ans=YES N=1819
54 Correct 16 ms 1132 KB ans=YES N=1986
55 Correct 32 ms 1388 KB ans=YES N=2000
56 Correct 27 ms 1644 KB ans=YES N=1834
57 Correct 26 ms 1516 KB ans=YES N=1860
58 Correct 29 ms 1644 KB ans=YES N=1898
59 Correct 22 ms 1388 KB ans=YES N=1832
60 Correct 27 ms 2284 KB ans=YES N=1929
61 Correct 18 ms 1132 KB ans=YES N=1919
62 Correct 23 ms 1644 KB ans=YES N=1882
63 Correct 27 ms 2412 KB ans=YES N=1922
64 Correct 16 ms 1260 KB ans=YES N=1989
65 Correct 18 ms 1516 KB ans=YES N=1978
66 Correct 19 ms 1644 KB ans=YES N=1867
67 Correct 24 ms 1388 KB ans=YES N=1942

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1260 KB ans=NO N=1934
2 Correct 4 ms 748 KB ans=NO N=1965
3 Correct 14 ms 1004 KB ans=YES N=1824
4 Correct 16 ms 1004 KB ans=YES N=1981
5 Correct 14 ms 1004 KB ans=YES N=1814
6 Correct 17 ms 1004 KB ans=YES N=1854
7 Correct 15 ms 1004 KB ans=YES N=1831
8 Correct 17 ms 1132 KB ans=YES N=2000
9 Correct 20 ms 1132 KB ans=YES N=1847
10 Correct 21 ms 1260 KB ans=YES N=1819
11 Correct 16 ms 1132 KB ans=YES N=1986
12 Correct 26 ms 1388 KB ans=YES N=2000
13 Correct 25 ms 1644 KB ans=YES N=1834
14 Correct 26 ms 1516 KB ans=YES N=1860
15 Correct 27 ms 1644 KB ans=YES N=1898
16 Correct 22 ms 1388 KB ans=YES N=1832
17 Correct 27 ms 2284 KB ans=YES N=1929
18 Correct 18 ms 1132 KB ans=YES N=1919
19 Correct 23 ms 1644 KB ans=YES N=1882
20 Correct 28 ms 2412 KB ans=YES N=1922
21 Correct 17 ms 1280 KB ans=YES N=1989
22 Correct 17 ms 1516 KB ans=YES N=1978
23 Correct 19 ms 1644 KB ans=YES N=1867

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 0 ms 364 KB ans=NO N=4
4 Correct 1 ms 364 KB ans=YES N=5
5 Correct 1 ms 364 KB ans=YES N=9
6 Correct 1 ms 364 KB ans=YES N=5
7 Correct 0 ms 364 KB ans=NO N=9
8 Correct 1 ms 364 KB ans=NO N=10
9 Correct 1 ms 364 KB ans=YES N=10
10 Correct 1 ms 364 KB ans=YES N=10
11 Correct 1 ms 364 KB ans=YES N=10
12 Correct 1 ms 364 KB ans=YES N=9
13 Correct 1 ms 364 KB ans=YES N=9
14 Correct 1 ms 364 KB ans=YES N=8
15 Correct 1 ms 364 KB ans=YES N=8
16 Correct 0 ms 364 KB ans=NO N=2
17 Correct 1 ms 384 KB ans=YES N=17
18 Correct 1 ms 376 KB ans=YES N=25
19 Correct 1 ms 364 KB ans=YES N=100
20 Correct 2 ms 364 KB ans=YES N=185
21 Correct 1 ms 364 KB ans=NO N=174
22 Correct 1 ms 364 KB ans=YES N=90
23 Correct 1 ms 364 KB ans=YES N=63
24 Correct 1 ms 364 KB ans=YES N=87
25 Correct 2 ms 364 KB ans=YES N=183
26 Correct 2 ms 364 KB ans=YES N=188
27 Correct 3 ms 492 KB ans=YES N=183
28 Correct 2 ms 364 KB ans=YES N=189
29 Correct 2 ms 364 KB ans=YES N=200
30 Correct 3 ms 492 KB ans=YES N=190
31 Correct 2 ms 364 KB ans=YES N=187
32 Correct 2 ms 384 KB ans=YES N=187
33 Correct 2 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 620 KB ans=YES N=188
36 Correct 2 ms 492 KB ans=YES N=181
37 Correct 3 ms 492 KB ans=YES N=188
38 Correct 3 ms 492 KB ans=YES N=191
39 Correct 2 ms 492 KB ans=YES N=196
40 Correct 2 ms 492 KB ans=YES N=196
41 Correct 2 ms 492 KB ans=YES N=196
42 Correct 2 ms 492 KB ans=YES N=196
43 Correct 2 ms 492 KB ans=YES N=195
44 Correct 5 ms 1260 KB ans=NO N=1934
45 Correct 4 ms 748 KB ans=NO N=1965
46 Correct 14 ms 1004 KB ans=YES N=1824
47 Correct 16 ms 1004 KB ans=YES N=1981
48 Correct 14 ms 1004 KB ans=YES N=1814
49 Correct 18 ms 1004 KB ans=YES N=1854
50 Correct 15 ms 1004 KB ans=YES N=1831
51 Correct 17 ms 1132 KB ans=YES N=2000
52 Correct 19 ms 1132 KB ans=YES N=1847
53 Correct 21 ms 1260 KB ans=YES N=1819
54 Correct 16 ms 1132 KB ans=YES N=1986
55 Correct 32 ms 1388 KB ans=YES N=2000
56 Correct 27 ms 1644 KB ans=YES N=1834
57 Correct 26 ms 1516 KB ans=YES N=1860
58 Correct 29 ms 1644 KB ans=YES N=1898
59 Correct 22 ms 1388 KB ans=YES N=1832
60 Correct 27 ms 2284 KB ans=YES N=1929
61 Correct 18 ms 1132 KB ans=YES N=1919
62 Correct 23 ms 1644 KB ans=YES N=1882
63 Correct 27 ms 2412 KB ans=YES N=1922
64 Correct 16 ms 1260 KB ans=YES N=1989
65 Correct 18 ms 1516 KB ans=YES N=1978
66 Correct 19 ms 1644 KB ans=YES N=1867
67 Correct 24 ms 1388 KB ans=YES N=1942
68 Correct 318 ms 17680 KB ans=NO N=66151
69 Correct 312 ms 26372 KB ans=NO N=64333
70 Correct 953 ms 23168 KB ans=YES N=69316
71 Correct 925 ms 22424 KB ans=YES N=66695
72 Correct 937 ms 23156 KB ans=YES N=68436
73 Correct 989 ms 23572 KB ans=YES N=70000
74 Correct 983 ms 23272 KB ans=YES N=68501
75 Correct 1027 ms 24292 KB ans=YES N=70000
76 Correct 1020 ms 23876 KB ans=YES N=65009
77 Correct 1618 ms 31460 KB ans=YES N=67007
78 Correct 1784 ms 34892 KB ans=YES N=66357
79 Correct 1841 ms 41012 KB ans=YES N=65430
80 Correct 1858 ms 37092 KB ans=YES N=65790
81 Correct 1813 ms 33940 KB ans=YES N=66020
82 Correct 1677 ms 32384 KB ans=YES N=65809
83 Correct 1271 ms 25352 KB ans=YES N=65651
84 Correct 2215 ms 45776 KB ans=YES N=68040
85 Correct 1952 ms 43256 KB ans=YES N=66570
86 Correct 992 ms 23144 KB ans=YES N=65421
87 Correct 1067 ms 21752 KB ans=YES N=68351
88 Correct 870 ms 22324 KB ans=YES N=67027
89 Correct 1096 ms 31972 KB ans=YES N=68879
90 Correct 1220 ms 25756 KB ans=YES N=67256
91 Correct 2574 ms 50352 KB ans=YES N=148315
92 Correct 837 ms 63468 KB ans=NO N=142745
93 Correct 630 ms 74476 KB ans=NO N=148443
94 Correct 2457 ms 49116 KB ans=YES N=148328
95 Correct 2444 ms 48988 KB ans=YES N=147855
96 Correct 2547 ms 49628 KB ans=YES N=150000
97 Correct 2405 ms 48092 KB ans=YES N=144725
98 Correct 2506 ms 49428 KB ans=YES N=149445
99 Correct 2429 ms 48276 KB ans=YES N=144455
100 Correct 2376 ms 47712 KB ans=YES N=143487
101 Correct 2519 ms 50020 KB ans=YES N=149688
102 Execution timed out 3565 ms 66536 KB Time limit exceeded
103 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 336 ms 17260 KB ans=NO N=66151
2 Correct 317 ms 26092 KB ans=NO N=64333
3 Correct 938 ms 22892 KB ans=YES N=69316
4 Correct 912 ms 22268 KB ans=YES N=66695
5 Correct 939 ms 23008 KB ans=YES N=68436
6 Correct 982 ms 23536 KB ans=YES N=70000
7 Correct 971 ms 23140 KB ans=YES N=68501
8 Correct 1006 ms 24052 KB ans=YES N=70000
9 Correct 1044 ms 23960 KB ans=YES N=65009
10 Correct 1618 ms 31444 KB ans=YES N=67007
11 Correct 1779 ms 35128 KB ans=YES N=66357
12 Correct 1829 ms 41208 KB ans=YES N=65430
13 Correct 1857 ms 36836 KB ans=YES N=65790
14 Correct 1795 ms 34016 KB ans=YES N=66020
15 Correct 1643 ms 32552 KB ans=YES N=65809
16 Correct 1191 ms 25412 KB ans=YES N=65651
17 Correct 2226 ms 45548 KB ans=YES N=68040
18 Correct 2001 ms 43184 KB ans=YES N=66570
19 Correct 998 ms 23016 KB ans=YES N=65421
20 Correct 1150 ms 21844 KB ans=YES N=68351
21 Correct 876 ms 22388 KB ans=YES N=67027
22 Correct 1103 ms 31976 KB ans=YES N=68879
23 Correct 1209 ms 25444 KB ans=YES N=67256

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1260 KB ans=NO N=1934
2 Correct 4 ms 748 KB ans=NO N=1965
3 Correct 14 ms 1004 KB ans=YES N=1824
4 Correct 16 ms 1004 KB ans=YES N=1981
5 Correct 14 ms 1004 KB ans=YES N=1814
6 Correct 17 ms 1004 KB ans=YES N=1854
7 Correct 15 ms 1004 KB ans=YES N=1831
8 Correct 17 ms 1132 KB ans=YES N=2000
9 Correct 20 ms 1132 KB ans=YES N=1847
10 Correct 21 ms 1260 KB ans=YES N=1819
11 Correct 16 ms 1132 KB ans=YES N=1986
12 Correct 26 ms 1388 KB ans=YES N=2000
13 Correct 25 ms 1644 KB ans=YES N=1834
14 Correct 26 ms 1516 KB ans=YES N=1860
15 Correct 27 ms 1644 KB ans=YES N=1898
16 Correct 22 ms 1388 KB ans=YES N=1832
17 Correct 27 ms 2284 KB ans=YES N=1929
18 Correct 18 ms 1132 KB ans=YES N=1919
19 Correct 23 ms 1644 KB ans=YES N=1882
20 Correct 28 ms 2412 KB ans=YES N=1922
21 Correct 17 ms 1280 KB ans=YES N=1989
22 Correct 17 ms 1516 KB ans=YES N=1978
23 Correct 19 ms 1644 KB ans=YES N=1867
24 Correct 336 ms 17260 KB ans=NO N=66151
25 Correct 317 ms 26092 KB ans=NO N=64333
26 Correct 938 ms 22892 KB ans=YES N=69316
27 Correct 912 ms 22268 KB ans=YES N=66695
28 Correct 939 ms 23008 KB ans=YES N=68436
29 Correct 982 ms 23536 KB ans=YES N=70000
30 Correct 971 ms 23140 KB ans=YES N=68501
31 Correct 1006 ms 24052 KB ans=YES N=70000
32 Correct 1044 ms 23960 KB ans=YES N=65009
33 Correct 1618 ms 31444 KB ans=YES N=67007
34 Correct 1779 ms 35128 KB ans=YES N=66357
35 Correct 1829 ms 41208 KB ans=YES N=65430
36 Correct 1857 ms 36836 KB ans=YES N=65790
37 Correct 1795 ms 34016 KB ans=YES N=66020
38 Correct 1643 ms 32552 KB ans=YES N=65809
39 Correct 1191 ms 25412 KB ans=YES N=65651
40 Correct 2226 ms 45548 KB ans=YES N=68040
41 Correct 2001 ms 43184 KB ans=YES N=66570
42 Correct 998 ms 23016 KB ans=YES N=65421
43 Correct 1150 ms 21844 KB ans=YES N=68351
44 Correct 876 ms 22388 KB ans=YES N=67027
45 Correct 1103 ms 31976 KB ans=YES N=68879
46 Correct 1209 ms 25444 KB ans=YES N=67256
47 Correct 2563 ms 50140 KB ans=YES N=148315
48 Correct 841 ms 63596 KB ans=NO N=142745
49 Correct 633 ms 74476 KB ans=NO N=148443
50 Correct 2477 ms 49160 KB ans=YES N=148328
51 Correct 2447 ms 49416 KB ans=YES N=147855
52 Correct 2493 ms 49628 KB ans=YES N=150000
53 Correct 2372 ms 47980 KB ans=YES N=144725
54 Correct 2475 ms 49440 KB ans=YES N=149445
55 Correct 2458 ms 48092 KB ans=YES N=144455
56 Correct 2335 ms 47712 KB ans=YES N=143487
57 Correct 2531 ms 50344 KB ans=YES N=149688
58 Execution timed out 3574 ms 66672 KB Time limit exceeded
59 Halted 0 ms 0 KB -