oj.uz

답안 #347374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347374 2021-01-12T16:17:44 Z doowey Building Skyscrapers (CEOI19_skyscrapers) C++14
61 / 100
 3500 ms 75756 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<pii, int> full;
map<pii, int> col;
set<pii> inq;

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

set<pii> vso;

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(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(nx)){
            if(inq.count(nx)) continue;
            inq.insert(nx);
            col[nx]=0;
            cand.push(full[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(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(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[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(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(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(nx) && col.count(nx) && !inq.count(nx)){
                            inq.insert(nx);
                            cand.push(full[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:123: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]
  123 |     if(vso.size() != n){
      |        ~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 1 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 1 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 1 ms 364 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 1 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 1 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 1 ms 364 KB ans=NO N=2
17 Correct 1 ms 364 KB ans=YES N=17
18 Correct 1 ms 364 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 2 ms 364 KB ans=YES N=90
23 Correct 2 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 2 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 2 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 3 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 492 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 3 ms 492 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 1 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 1 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 1 ms 364 KB ans=NO N=2
17 Correct 1 ms 364 KB ans=YES N=17
18 Correct 1 ms 364 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 2 ms 364 KB ans=YES N=90
23 Correct 2 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 2 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 2 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 3 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 492 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 3 ms 492 KB ans=YES N=195
44 Correct 5 ms 1388 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 18 ms 1004 KB ans=YES N=1981
48 Correct 14 ms 1004 KB ans=YES N=1814
49 Correct 17 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 26 ms 1388 KB ans=YES N=2000
56 Correct 26 ms 1516 KB ans=YES N=1834
57 Correct 26 ms 1644 KB ans=YES N=1860
58 Correct 29 ms 1644 KB ans=YES N=1898
59 Correct 25 ms 1516 KB ans=YES N=1832
60 Correct 28 ms 2156 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 28 ms 2284 KB ans=YES N=1922
64 Correct 17 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 26 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 5 ms 748 KB ans=NO N=1965
3 Correct 15 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 18 ms 1004 KB ans=YES N=1831
8 Correct 17 ms 1132 KB ans=YES N=2000
9 Correct 19 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 27 ms 1388 KB ans=YES N=2000
13 Correct 26 ms 1516 KB ans=YES N=1834
14 Correct 27 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 28 ms 2156 KB ans=YES N=1929
18 Correct 19 ms 1260 KB ans=YES N=1919
19 Correct 24 ms 1516 KB ans=YES N=1882
20 Correct 29 ms 2284 KB ans=YES N=1922
21 Correct 17 ms 1260 KB ans=YES N=1989
22 Correct 18 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 1 ms 364 KB ans=YES N=1
2 Correct 1 ms 364 KB ans=YES N=4
3 Correct 1 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 1 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 1 ms 364 KB ans=NO N=2
17 Correct 1 ms 364 KB ans=YES N=17
18 Correct 1 ms 364 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 2 ms 364 KB ans=YES N=90
23 Correct 2 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 2 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 2 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 3 ms 492 KB ans=YES N=182
34 Correct 2 ms 492 KB ans=YES N=184
35 Correct 3 ms 492 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 3 ms 492 KB ans=YES N=195
44 Correct 5 ms 1388 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 18 ms 1004 KB ans=YES N=1981
48 Correct 14 ms 1004 KB ans=YES N=1814
49 Correct 17 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 26 ms 1388 KB ans=YES N=2000
56 Correct 26 ms 1516 KB ans=YES N=1834
57 Correct 26 ms 1644 KB ans=YES N=1860
58 Correct 29 ms 1644 KB ans=YES N=1898
59 Correct 25 ms 1516 KB ans=YES N=1832
60 Correct 28 ms 2156 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 28 ms 2284 KB ans=YES N=1922
64 Correct 17 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 26 ms 1388 KB ans=YES N=1942
68 Correct 323 ms 17772 KB ans=NO N=66151
69 Correct 305 ms 26732 KB ans=NO N=64333
70 Correct 973 ms 23508 KB ans=YES N=69316
71 Correct 890 ms 22776 KB ans=YES N=66695
72 Correct 952 ms 23400 KB ans=YES N=68436
73 Correct 995 ms 23908 KB ans=YES N=70000
74 Correct 1035 ms 23832 KB ans=YES N=68501
75 Correct 1039 ms 24420 KB ans=YES N=70000
76 Correct 1061 ms 24296 KB ans=YES N=65009
77 Correct 1629 ms 31816 KB ans=YES N=67007
78 Correct 1801 ms 35008 KB ans=YES N=66357
79 Correct 1835 ms 40736 KB ans=YES N=65430
80 Correct 1865 ms 36988 KB ans=YES N=65790
81 Correct 1783 ms 34368 KB ans=YES N=66020
82 Correct 1704 ms 32744 KB ans=YES N=65809
83 Correct 1254 ms 25976 KB ans=YES N=65651
84 Correct 2244 ms 45832 KB ans=YES N=68040
85 Correct 1991 ms 42952 KB ans=YES N=66570
86 Correct 1000 ms 23400 KB ans=YES N=65421
87 Correct 1134 ms 21976 KB ans=YES N=68351
88 Correct 884 ms 22764 KB ans=YES N=67027
89 Correct 1121 ms 32348 KB ans=YES N=68879
90 Correct 1195 ms 25880 KB ans=YES N=67256
91 Correct 2537 ms 50688 KB ans=YES N=148315
92 Correct 871 ms 63980 KB ans=NO N=142745
93 Correct 623 ms 75628 KB ans=NO N=148443
94 Correct 2518 ms 50324 KB ans=YES N=148328
95 Correct 2435 ms 50304 KB ans=YES N=147855
96 Correct 2528 ms 50744 KB ans=YES N=150000
97 Correct 2366 ms 49116 KB ans=YES N=144725
98 Correct 2504 ms 50884 KB ans=YES N=149445
99 Correct 2383 ms 49244 KB ans=YES N=144455
100 Correct 2395 ms 48780 KB ans=YES N=143487
101 Correct 2472 ms 51172 KB ans=YES N=149688
102 Execution timed out 3556 ms 67896 KB Time limit exceeded
103 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 17260 KB ans=NO N=66151
2 Correct 304 ms 26092 KB ans=NO N=64333
3 Correct 952 ms 23028 KB ans=YES N=69316
4 Correct 900 ms 22644 KB ans=YES N=66695
5 Correct 961 ms 23600 KB ans=YES N=68436
6 Correct 991 ms 24224 KB ans=YES N=70000
7 Correct 968 ms 23924 KB ans=YES N=68501
8 Correct 1014 ms 24564 KB ans=YES N=70000
9 Correct 1037 ms 24424 KB ans=YES N=65009
10 Correct 1626 ms 31976 KB ans=YES N=67007
11 Correct 1779 ms 35460 KB ans=YES N=66357
12 Correct 1845 ms 40952 KB ans=YES N=65430
13 Correct 1850 ms 36892 KB ans=YES N=65790
14 Correct 1826 ms 34100 KB ans=YES N=66020
15 Correct 1665 ms 32868 KB ans=YES N=65809
16 Correct 1211 ms 25848 KB ans=YES N=65651
17 Correct 2210 ms 45708 KB ans=YES N=68040
18 Correct 1960 ms 43016 KB ans=YES N=66570
19 Correct 1010 ms 23272 KB ans=YES N=65421
20 Correct 1086 ms 22028 KB ans=YES N=68351
21 Correct 873 ms 22768 KB ans=YES N=67027
22 Correct 1127 ms 32488 KB ans=YES N=68879
23 Correct 1221 ms 25956 KB ans=YES N=67256

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1260 KB ans=NO N=1934
2 Correct 5 ms 748 KB ans=NO N=1965
3 Correct 15 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 18 ms 1004 KB ans=YES N=1831
8 Correct 17 ms 1132 KB ans=YES N=2000
9 Correct 19 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 27 ms 1388 KB ans=YES N=2000
13 Correct 26 ms 1516 KB ans=YES N=1834
14 Correct 27 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 28 ms 2156 KB ans=YES N=1929
18 Correct 19 ms 1260 KB ans=YES N=1919
19 Correct 24 ms 1516 KB ans=YES N=1882
20 Correct 29 ms 2284 KB ans=YES N=1922
21 Correct 17 ms 1260 KB ans=YES N=1989
22 Correct 18 ms 1516 KB ans=YES N=1978
23 Correct 19 ms 1644 KB ans=YES N=1867
24 Correct 323 ms 17260 KB ans=NO N=66151
25 Correct 304 ms 26092 KB ans=NO N=64333
26 Correct 952 ms 23028 KB ans=YES N=69316
27 Correct 900 ms 22644 KB ans=YES N=66695
28 Correct 961 ms 23600 KB ans=YES N=68436
29 Correct 991 ms 24224 KB ans=YES N=70000
30 Correct 968 ms 23924 KB ans=YES N=68501
31 Correct 1014 ms 24564 KB ans=YES N=70000
32 Correct 1037 ms 24424 KB ans=YES N=65009
33 Correct 1626 ms 31976 KB ans=YES N=67007
34 Correct 1779 ms 35460 KB ans=YES N=66357
35 Correct 1845 ms 40952 KB ans=YES N=65430
36 Correct 1850 ms 36892 KB ans=YES N=65790
37 Correct 1826 ms 34100 KB ans=YES N=66020
38 Correct 1665 ms 32868 KB ans=YES N=65809
39 Correct 1211 ms 25848 KB ans=YES N=65651
40 Correct 2210 ms 45708 KB ans=YES N=68040
41 Correct 1960 ms 43016 KB ans=YES N=66570
42 Correct 1010 ms 23272 KB ans=YES N=65421
43 Correct 1086 ms 22028 KB ans=YES N=68351
44 Correct 873 ms 22768 KB ans=YES N=67027
45 Correct 1127 ms 32488 KB ans=YES N=68879
46 Correct 1221 ms 25956 KB ans=YES N=67256
47 Correct 2577 ms 50588 KB ans=YES N=148315
48 Correct 833 ms 64084 KB ans=NO N=142745
49 Correct 635 ms 75756 KB ans=NO N=148443
50 Correct 2416 ms 50372 KB ans=YES N=148328
51 Correct 2415 ms 50244 KB ans=YES N=147855
52 Correct 2450 ms 50792 KB ans=YES N=150000
53 Correct 2365 ms 49252 KB ans=YES N=144725
54 Correct 2446 ms 50668 KB ans=YES N=149445
55 Correct 2340 ms 49392 KB ans=YES N=144455
56 Correct 2328 ms 49020 KB ans=YES N=143487
57 Correct 2490 ms 51000 KB ans=YES N=149688
58 Execution timed out 3572 ms 67720 KB Time limit exceeded
59 Halted 0 ms 0 KB -