답안 #225764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
225764	2020-04-21T14:09:32 Z	CaroLinda	Building Skyscrapers (CEOI19_skyscrapers)	C++14	61 / 100	3273 ms	61728 KB

skyscrapers

#include <bits/stdc++.h>

#define debug printf
#define all(x) x.begin(),x.end()
#define lp(i,a,b) for(int i = a ; i< b ; i++)
#define ss second
#define ff first
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mk make_pair

const int MAX = 1e6+10 ;
const int MAXN = 1e5+10 ;
const int inf = 1e9+10 ;

using namespace std ;

int N , T , idx ;
int X[MAX] , Y[MAX] , vet[MAXN] , pai[MAX] , pai_aux[MAXN] ;
int dx[8] = { 1,-1,0,0, 1,-1,1,-1 } , dy[8] = { 0,0,1,-1, -1,1, 1, -1} ;
int dx_cyclic[8] = { -1 , -1 , 0 , 1 , 1 ,1 , 0, -1 } , dy_cyclic[8] = { 0 , -1 , -1 , -1, 0 , 1 , 1 ,1  } ;
pii id[MAX] ;
bool is_full[MAX] , reachable[MAX] , marc[MAXN] ;
map< pii , int > mp ;
set<int> s ;
vector<int> ans ;
vector<int> componente[MAX] ;
set<int>::iterator it ;
bool vv ;

// ------------------------------------------------

int get_code(int x, int y)
{

    if( mp.find( mk(x,y) ) == mp.end() ) return 0 ;
    return mp.find( mk(x,y) )->ss ;

}

int find(int x)
{
    if( x == pai[x] ) return x ;
    return pai[x] = find( pai[x] ) ;
}


bool identify_articulation(int name)
{
    int j = -1 ;
    vector<int> group ;

    for(int i = 0 , nx , ny ; i < 8 ; i ++ )
    {
        nx = X[name] + dx_cyclic[i] ;
        ny = Y[name] + dy_cyclic[i] ;

        if( is_full[ get_code(nx,ny) ] ) { j = i ; break ; }

    }

    if( j == -1 ) return false ;

    int beg = -1, en = beg , times = 0 ;

    for(int i = (j+1)%8 ; true ; i = (i+1)%8 )
    {

        if( i == ((j+1)%8) && times == 1 ) break ;
        else if( i == ((j+1)%8) && times == 0 ) times ++ ;

        int nx = X[name] + dx_cyclic[i] ;
        int ny = Y[name] + dy_cyclic[i] ;
        int c = get_code(nx,ny) ;

        if( is_full[c] )
        {

            if( beg == -1 ) continue ;
            if( beg % 2 == 1 && en == beg )  { beg = -1 ; continue ; }
            group.pb( find( get_code( X[name]+dx_cyclic[beg] , Y[name]+dy_cyclic[beg] ) ) ) ;
            beg = -1 ;
            continue ;
        }

        if( beg == -1 ) beg = en = i ;
        else en = i ;

    }

    sort(all(group) ) ;

    for(int i = 1 ; i < group.size() ; i++ )
        if( group[i] == group[i-1] ) return true ;

    return false ;

}

bool identify_infinity(int name)
{
    for(int i = 0 ,c ; i < 4 ; i++ )
    {

        c = get_code( dx[i] + X[name] , dy[i] + Y[name] ) ;
        c = find(c) ;
        if( reachable[c] ) return true ;

    }

    return false ;

}
bool check(int i) { return ( !identify_articulation(i) )&identify_infinity(i) ; }

inline void to_change(int name)
{

    for(int i = 0 ; i < 8 ; i++ )
    {

        int nx = X[name] + dx[i] ;
        int ny = Y[name] + dy[i] ;
        int c = get_code( nx, ny ) ;

        if( c == 0 || !is_full[c] ) continue ;

        if( check(c) && s.find(c) == s.end() ) s.insert(c) ;
        else if( !check(c) && s.find(c) != s.end() ) s.erase( s.find(c) ) ;

    }

}

bool join(int a, int b, bool ok )
{

    a = find(a) ;
    b = find(b) ;

    if(a==b) return false ;

    if( componente[a].size() > componente[b].size() ) swap( a , b  );

    pai[a] = b ;
    if( !reachable[b] && reachable[a] )
    {

        reachable[b] = true ;
        for(int i : componente[b] ) to_change(i) ;
    }

    for( int i : componente[a] )
    {
        componente[b].pb(i) ;
        if( ok ) to_change(i) ;
    }
    componente[a].clear() ;

    return true ;

}

int find_aux(int x)
{
    if( x == pai_aux[x] ) return x ;
    return pai_aux[x] = find_aux( pai_aux[x] ) ;
}
inline void join_aux(int a, int b)
{
    a = find_aux(a) ;
    b = find_aux(b) ;

    if( rand() % 2 ) swap(a,b) ;

    pai_aux[a] = b ;

}

int main()
{
    scanf("%d%d", &N , &T ) ;
    lp(i,1,N+1)
    {
        scanf("%d%d", &X[i] , &Y[i]) ;
        mp.insert( mk( mk( X[i] , Y[i] ) , i ) ) ;
        is_full[i] = true ;
        vet[i] = pai_aux[i] = i ;
    }

    idx = N ;

    lp(i,1,N+1)
    {
        for(int j = 0 ; j < 8 ; j++ )
        {

            int nx = dx[j] + X[i] ;
            int ny = dy[j] + Y[i] ;

            if( mp.find( mk(nx,ny) ) == mp.end() ) mp.insert( mk( mk(nx,ny) , ++idx ) ) ;

            if( is_full[ get_code(nx,ny) ] ) join_aux( i , get_code(nx,ny) ) ;

        }
    }

    lp(i,2,N+1)
        if( find_aux(i) != find_aux(1) ) {  printf("NO\n") ; return 0 ; }

    for(auto p : mp )
    {
        X[p.ss] = p.ff.ff ;
        Y[p.ss] = p.ff.ss ;
        pai[ p.ss ] = p.ss ;
        componente[p.ss].pb( p.ss ) ;
    }

    int id = -1 , mn = inf ;

    for(auto p : mp )
        if( p.ff.ff < mn ) mn = p.ff.ff , id = p.ss ;
    reachable[id] = true ;

    for(auto p : mp )
    {

        if( is_full[p.ss] ) continue ;

        for(int i = 0 , nx , ny , c ; i < 4 ; i++ )
        {
            nx = dx[i] + p.ff.ff ;
            ny = dy[i] + p.ff.ss ;
            c = get_code(nx,ny) ;

            if( c == 0 || is_full[c] ) continue ;

            join( c , p.ss , false ) ;

        }

    }


    lp(i,1,N+1)
        if( check(i) ) s.insert(i) ;

    while( s.size() > 0 )
    {
        it = prev( s.end() ) ;

        int best_id = *it ;
        s.erase(it) ;
        
        if( !check(best_id) ) continue ;

        ans.pb( best_id ) ;
        is_full[best_id] = false ;


        for(int i = 0 , nx , ny ,c ; i < 4 ; i++ )
        {
            nx = dx[i] + X[best_id] ;
            ny = dy[i] + Y[ best_id ] ;
            c = get_code( nx,ny ) ;

            if( is_full[c] ) continue ;

            join( c , best_id, true ) ;

        }

        to_change(best_id) ;


    }

    printf("YES\n") ;
    reverse(all(ans)) ;
    for(int i : ans ) printf("%d\n" , i ) ;

}

Compilation message

skyscrapers.cpp: In function 'bool identify_articulation(int)':
skyscrapers.cpp:94:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1 ; i < group.size() ; i++ )
                     ~~^~~~~~~~~~~~~~
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:183:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N , &T ) ;
     ~~~~~^~~~~~~~~~~~~~~~~~
skyscrapers.cpp:186:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &X[i] , &Y[i]) ;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	23936 KB	ans=YES N=1
2	Correct	21 ms	23808 KB	ans=YES N=4
3	Correct	17 ms	23808 KB	ans=NO N=4
4	Correct	19 ms	23808 KB	ans=YES N=5
5	Correct	17 ms	23808 KB	ans=YES N=9
6	Correct	17 ms	23808 KB	ans=YES N=5
7	Correct	17 ms	23808 KB	ans=NO N=9
8	Correct	18 ms	23808 KB	ans=NO N=10
9	Correct	21 ms	23808 KB	ans=YES N=10
10	Correct	17 ms	23808 KB	ans=YES N=10
11	Correct	18 ms	23808 KB	ans=YES N=10
12	Correct	17 ms	23808 KB	ans=YES N=9
13	Correct	18 ms	23808 KB	ans=YES N=9
14	Correct	17 ms	23808 KB	ans=YES N=8
15	Correct	20 ms	23808 KB	ans=YES N=8
16	Correct	19 ms	23808 KB	ans=NO N=2
17	Correct	17 ms	23808 KB	ans=YES N=17
18	Correct	18 ms	23936 KB	ans=YES N=25
19	Correct	19 ms	23808 KB	ans=YES N=100
20	Correct	21 ms	23936 KB	ans=YES N=185
21	Correct	19 ms	23948 KB	ans=NO N=174
22	Correct	19 ms	23936 KB	ans=YES N=90
23	Correct	18 ms	23808 KB	ans=YES N=63
24	Correct	20 ms	23936 KB	ans=YES N=87
25	Correct	21 ms	23936 KB	ans=YES N=183
26	Correct	22 ms	23936 KB	ans=YES N=188
27	Correct	22 ms	23936 KB	ans=YES N=183
28	Correct	22 ms	23944 KB	ans=YES N=189
29	Correct	23 ms	23936 KB	ans=YES N=200
30	Correct	21 ms	23936 KB	ans=YES N=190
31	Correct	21 ms	23936 KB	ans=YES N=187
32	Correct	22 ms	23936 KB	ans=YES N=187
33	Correct	22 ms	23936 KB	ans=YES N=182
34	Correct	21 ms	23936 KB	ans=YES N=184
35	Correct	21 ms	24064 KB	ans=YES N=188
36	Correct	21 ms	23936 KB	ans=YES N=181
37	Correct	22 ms	23936 KB	ans=YES N=188
38	Correct	20 ms	23936 KB	ans=YES N=191
39	Correct	23 ms	23936 KB	ans=YES N=196
40	Correct	23 ms	23936 KB	ans=YES N=196
41	Correct	25 ms	23936 KB	ans=YES N=196
42	Correct	22 ms	23936 KB	ans=YES N=196
43	Correct	23 ms	23936 KB	ans=YES N=195
44	Correct	26 ms	24960 KB	ans=NO N=1934
45	Correct	24 ms	24192 KB	ans=NO N=1965
46	Correct	65 ms	24184 KB	ans=YES N=1824
47	Correct	74 ms	24192 KB	ans=YES N=1981
48	Correct	64 ms	24192 KB	ans=YES N=1814
49	Correct	77 ms	24312 KB	ans=YES N=1854
50	Correct	66 ms	24440 KB	ans=YES N=1831
51	Correct	73 ms	24312 KB	ans=YES N=2000
52	Correct	73 ms	24320 KB	ans=YES N=1847
53	Correct	73 ms	24440 KB	ans=YES N=1819
54	Correct	68 ms	24192 KB	ans=YES N=1986
55	Correct	82 ms	24732 KB	ans=YES N=2000
56	Correct	80 ms	24696 KB	ans=YES N=1834
57	Correct	68 ms	24696 KB	ans=YES N=1860
58	Correct	71 ms	24696 KB	ans=YES N=1898
59	Correct	71 ms	24568 KB	ans=YES N=1832
60	Correct	53 ms	24780 KB	ans=YES N=1929
61	Correct	69 ms	24312 KB	ans=YES N=1919
62	Correct	64 ms	24568 KB	ans=YES N=1882
63	Correct	50 ms	24832 KB	ans=YES N=1922
64	Correct	65 ms	24384 KB	ans=YES N=1989
65	Correct	45 ms	24536 KB	ans=YES N=1978
66	Correct	51 ms	24568 KB	ans=YES N=1867
67	Correct	73 ms	24576 KB	ans=YES N=1942

Subtask #4
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	24960 KB	ans=NO N=1934
2	Correct	24 ms	24192 KB	ans=NO N=1965
3	Correct	66 ms	24184 KB	ans=YES N=1824
4	Correct	71 ms	24312 KB	ans=YES N=1981
5	Correct	65 ms	24192 KB	ans=YES N=1814
6	Correct	68 ms	24192 KB	ans=YES N=1854
7	Correct	64 ms	24184 KB	ans=YES N=1831
8	Correct	70 ms	24184 KB	ans=YES N=2000
9	Correct	71 ms	24312 KB	ans=YES N=1847
10	Correct	76 ms	24320 KB	ans=YES N=1819
11	Correct	70 ms	24440 KB	ans=YES N=1986
12	Correct	77 ms	24568 KB	ans=YES N=2000
13	Correct	73 ms	24696 KB	ans=YES N=1834
14	Correct	69 ms	24696 KB	ans=YES N=1860
15	Correct	73 ms	24824 KB	ans=YES N=1898
16	Correct	67 ms	24568 KB	ans=YES N=1832
17	Correct	53 ms	24832 KB	ans=YES N=1929
18	Correct	72 ms	24320 KB	ans=YES N=1919
19	Correct	63 ms	24576 KB	ans=YES N=1882
20	Correct	50 ms	24824 KB	ans=YES N=1922
21	Correct	70 ms	24320 KB	ans=YES N=1989
22	Correct	45 ms	24448 KB	ans=YES N=1978
23	Correct	53 ms	24568 KB	ans=YES N=1867

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	23936 KB	ans=YES N=1
2	Correct	21 ms	23808 KB	ans=YES N=4
3	Correct	17 ms	23808 KB	ans=NO N=4
4	Correct	19 ms	23808 KB	ans=YES N=5
5	Correct	17 ms	23808 KB	ans=YES N=9
6	Correct	17 ms	23808 KB	ans=YES N=5
7	Correct	17 ms	23808 KB	ans=NO N=9
8	Correct	18 ms	23808 KB	ans=NO N=10
9	Correct	21 ms	23808 KB	ans=YES N=10
10	Correct	17 ms	23808 KB	ans=YES N=10
11	Correct	18 ms	23808 KB	ans=YES N=10
12	Correct	17 ms	23808 KB	ans=YES N=9
13	Correct	18 ms	23808 KB	ans=YES N=9
14	Correct	17 ms	23808 KB	ans=YES N=8
15	Correct	20 ms	23808 KB	ans=YES N=8
16	Correct	19 ms	23808 KB	ans=NO N=2
17	Correct	17 ms	23808 KB	ans=YES N=17
18	Correct	18 ms	23936 KB	ans=YES N=25
19	Correct	19 ms	23808 KB	ans=YES N=100
20	Correct	21 ms	23936 KB	ans=YES N=185
21	Correct	19 ms	23948 KB	ans=NO N=174
22	Correct	19 ms	23936 KB	ans=YES N=90
23	Correct	18 ms	23808 KB	ans=YES N=63
24	Correct	20 ms	23936 KB	ans=YES N=87
25	Correct	21 ms	23936 KB	ans=YES N=183
26	Correct	22 ms	23936 KB	ans=YES N=188
27	Correct	22 ms	23936 KB	ans=YES N=183
28	Correct	22 ms	23944 KB	ans=YES N=189
29	Correct	23 ms	23936 KB	ans=YES N=200
30	Correct	21 ms	23936 KB	ans=YES N=190
31	Correct	21 ms	23936 KB	ans=YES N=187
32	Correct	22 ms	23936 KB	ans=YES N=187
33	Correct	22 ms	23936 KB	ans=YES N=182
34	Correct	21 ms	23936 KB	ans=YES N=184
35	Correct	21 ms	24064 KB	ans=YES N=188
36	Correct	21 ms	23936 KB	ans=YES N=181
37	Correct	22 ms	23936 KB	ans=YES N=188
38	Correct	20 ms	23936 KB	ans=YES N=191
39	Correct	23 ms	23936 KB	ans=YES N=196
40	Correct	23 ms	23936 KB	ans=YES N=196
41	Correct	25 ms	23936 KB	ans=YES N=196
42	Correct	22 ms	23936 KB	ans=YES N=196
43	Correct	23 ms	23936 KB	ans=YES N=195
44	Correct	26 ms	24960 KB	ans=NO N=1934
45	Correct	24 ms	24192 KB	ans=NO N=1965
46	Correct	65 ms	24184 KB	ans=YES N=1824
47	Correct	74 ms	24192 KB	ans=YES N=1981
48	Correct	64 ms	24192 KB	ans=YES N=1814
49	Correct	77 ms	24312 KB	ans=YES N=1854
50	Correct	66 ms	24440 KB	ans=YES N=1831
51	Correct	73 ms	24312 KB	ans=YES N=2000
52	Correct	73 ms	24320 KB	ans=YES N=1847
53	Correct	73 ms	24440 KB	ans=YES N=1819
54	Correct	68 ms	24192 KB	ans=YES N=1986
55	Correct	82 ms	24732 KB	ans=YES N=2000
56	Correct	80 ms	24696 KB	ans=YES N=1834
57	Correct	68 ms	24696 KB	ans=YES N=1860
58	Correct	71 ms	24696 KB	ans=YES N=1898
59	Correct	71 ms	24568 KB	ans=YES N=1832
60	Correct	53 ms	24780 KB	ans=YES N=1929
61	Correct	69 ms	24312 KB	ans=YES N=1919
62	Correct	64 ms	24568 KB	ans=YES N=1882
63	Correct	50 ms	24832 KB	ans=YES N=1922
64	Correct	65 ms	24384 KB	ans=YES N=1989
65	Correct	45 ms	24536 KB	ans=YES N=1978
66	Correct	51 ms	24568 KB	ans=YES N=1867
67	Correct	73 ms	24576 KB	ans=YES N=1942
68	Correct	379 ms	32120 KB	ans=NO N=66151
69	Correct	451 ms	53752 KB	ans=NO N=64333
70	Correct	2510 ms	34344 KB	ans=YES N=69316
71	Correct	2332 ms	34156 KB	ans=YES N=66695
72	Correct	2424 ms	34452 KB	ans=YES N=68436
73	Correct	2526 ms	35108 KB	ans=YES N=70000
74	Correct	2468 ms	34960 KB	ans=YES N=68501
75	Correct	2596 ms	35704 KB	ans=YES N=70000
76	Correct	2557 ms	36088 KB	ans=YES N=65009
77	Correct	3077 ms	45172 KB	ans=YES N=67007
78	Correct	2947 ms	49448 KB	ans=YES N=66357
79	Correct	2837 ms	52160 KB	ans=YES N=65430
80	Correct	3101 ms	50784 KB	ans=YES N=65790
81	Correct	3273 ms	49172 KB	ans=YES N=66020
82	Correct	3029 ms	46768 KB	ans=YES N=65809
83	Correct	2663 ms	38900 KB	ans=YES N=65651
84	Correct	3230 ms	58760 KB	ans=YES N=68040
85	Correct	2915 ms	54444 KB	ans=YES N=66570
86	Correct	2468 ms	35340 KB	ans=YES N=65421
87	Correct	2542 ms	36776 KB	ans=YES N=68351
88	Correct	2329 ms	33860 KB	ans=YES N=67027
89	Correct	1337 ms	41804 KB	ans=YES N=68879
90	Correct	2959 ms	36912 KB	ans=YES N=67256
91	Incorrect	1103 ms	61728 KB	Contestant did not find solution
92	Halted	0 ms	0 KB	-

Subtask #6
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	351 ms	31480 KB	ans=NO N=66151
2	Correct	450 ms	53216 KB	ans=NO N=64333
3	Correct	2440 ms	34012 KB	ans=YES N=69316
4	Correct	2320 ms	33516 KB	ans=YES N=66695
5	Correct	2431 ms	33808 KB	ans=YES N=68436
6	Correct	2486 ms	34024 KB	ans=YES N=70000
7	Correct	2450 ms	34176 KB	ans=YES N=68501
8	Correct	2570 ms	34800 KB	ans=YES N=70000
9	Correct	2570 ms	35648 KB	ans=YES N=65009
10	Correct	3085 ms	44820 KB	ans=YES N=67007
11	Correct	2979 ms	48956 KB	ans=YES N=66357
12	Correct	2815 ms	51988 KB	ans=YES N=65430
13	Correct	2988 ms	51156 KB	ans=YES N=65790
14	Correct	3053 ms	49280 KB	ans=YES N=66020
15	Correct	3027 ms	46596 KB	ans=YES N=65809
16	Correct	2710 ms	38832 KB	ans=YES N=65651
17	Correct	3258 ms	58800 KB	ans=YES N=68040
18	Correct	2925 ms	54620 KB	ans=YES N=66570
19	Correct	2460 ms	35212 KB	ans=YES N=65421
20	Correct	2509 ms	36988 KB	ans=YES N=68351
21	Correct	2296 ms	34184 KB	ans=YES N=67027
22	Correct	1327 ms	41812 KB	ans=YES N=68879
23	Correct	2883 ms	36848 KB	ans=YES N=67256

Subtask #7
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	24960 KB	ans=NO N=1934
2	Correct	24 ms	24192 KB	ans=NO N=1965
3	Correct	66 ms	24184 KB	ans=YES N=1824
4	Correct	71 ms	24312 KB	ans=YES N=1981
5	Correct	65 ms	24192 KB	ans=YES N=1814
6	Correct	68 ms	24192 KB	ans=YES N=1854
7	Correct	64 ms	24184 KB	ans=YES N=1831
8	Correct	70 ms	24184 KB	ans=YES N=2000
9	Correct	71 ms	24312 KB	ans=YES N=1847
10	Correct	76 ms	24320 KB	ans=YES N=1819
11	Correct	70 ms	24440 KB	ans=YES N=1986
12	Correct	77 ms	24568 KB	ans=YES N=2000
13	Correct	73 ms	24696 KB	ans=YES N=1834
14	Correct	69 ms	24696 KB	ans=YES N=1860
15	Correct	73 ms	24824 KB	ans=YES N=1898
16	Correct	67 ms	24568 KB	ans=YES N=1832
17	Correct	53 ms	24832 KB	ans=YES N=1929
18	Correct	72 ms	24320 KB	ans=YES N=1919
19	Correct	63 ms	24576 KB	ans=YES N=1882
20	Correct	50 ms	24824 KB	ans=YES N=1922
21	Correct	70 ms	24320 KB	ans=YES N=1989
22	Correct	45 ms	24448 KB	ans=YES N=1978
23	Correct	53 ms	24568 KB	ans=YES N=1867
24	Correct	351 ms	31480 KB	ans=NO N=66151
25	Correct	450 ms	53216 KB	ans=NO N=64333
26	Correct	2440 ms	34012 KB	ans=YES N=69316
27	Correct	2320 ms	33516 KB	ans=YES N=66695
28	Correct	2431 ms	33808 KB	ans=YES N=68436
29	Correct	2486 ms	34024 KB	ans=YES N=70000
30	Correct	2450 ms	34176 KB	ans=YES N=68501
31	Correct	2570 ms	34800 KB	ans=YES N=70000
32	Correct	2570 ms	35648 KB	ans=YES N=65009
33	Correct	3085 ms	44820 KB	ans=YES N=67007
34	Correct	2979 ms	48956 KB	ans=YES N=66357
35	Correct	2815 ms	51988 KB	ans=YES N=65430
36	Correct	2988 ms	51156 KB	ans=YES N=65790
37	Correct	3053 ms	49280 KB	ans=YES N=66020
38	Correct	3027 ms	46596 KB	ans=YES N=65809
39	Correct	2710 ms	38832 KB	ans=YES N=65651
40	Correct	3258 ms	58800 KB	ans=YES N=68040
41	Correct	2925 ms	54620 KB	ans=YES N=66570
42	Correct	2460 ms	35212 KB	ans=YES N=65421
43	Correct	2509 ms	36988 KB	ans=YES N=68351
44	Correct	2296 ms	34184 KB	ans=YES N=67027
45	Correct	1327 ms	41812 KB	ans=YES N=68879
46	Correct	2883 ms	36848 KB	ans=YES N=67256
47	Incorrect	1086 ms	61664 KB	Contestant did not find solution
48	Halted	0 ms	0 KB	-

답안 #225764

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 14.0 / 14.0

Subtask #3 12.0 / 12.0

Subtask #4 17.0 / 17.0

Subtask #5 0 / 20.0

Subtask #6 10.0 / 10.0

Subtask #7 0 / 19.0

Subtask #1
8.0 / 8.0

Subtask #2
14.0 / 14.0

Subtask #3
12.0 / 12.0

Subtask #4
17.0 / 17.0

Subtask #5
0 / 20.0

Subtask #6
10.0 / 10.0

Subtask #7
0 / 19.0