oj.uz

Submission #225806

# Submission time Handle Problem Language Result Execution time Memory
225806 2020-04-21T17:53:06 Z CaroLinda Building Skyscrapers (CEOI19_skyscrapers) C++11
8 / 100
 783 ms 89608 KB 
#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 = 850100 ;
const int MAXN = 150100 ;
const int inf = 1e9+10 ;

using namespace std ;

int N , T , idx ;
int X[MAX] , Y[MAX] , vet[MAXN] , pai[MAX] , pai_aux[MAXN] , freq[MAX] ;
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] , checked[MAX] ;
map< pii , int > mp ;
set<int> s ;
vector<int> ans , fila ;
vector<int> componente[MAX] , adj[MAX] , adj_cyclic[MAX] ;
set<int>::iterator it ;

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

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 ;

    lp(i,0,8)
        if( is_full[ adj_cyclic[name][i] ] ) { j = i ; break ; }

    if( j == -1 ) return false ;

    int beg = -1, en = beg , times = 0 ;
    bool ok = false ;

    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 c = adj_cyclic[name][i] ;

        if( is_full[c] )
        {

            if( beg == -1 ) continue ;
            if( beg % 2 == 1 && en == beg )  { beg = -1 ; continue ; }

            if( (++freq[ find( adj_cyclic[name][beg] ) ]) == 2 ) ok = true ; ;

            beg = -1 ;
            continue ;
        }

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

    }

    for(int i = 0 ; i < 8 ; i+= 2)
        if( !is_full[ adj[name][i] ] ) freq[ find(adj[name][i]) ] = 0 ;

    return ok ;

}

bool identify_infinity(int name)
{
    lp(i,0,4)
    {
        int c = adj[name][i] ;
        if(c != 0 && reachable[ find(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 c = adj[name][i] ;

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

        if( check(c) && !checked[c] )
        {
            s.insert(c) ;
            checked[c] = true ;
        }
        else if( !check(c) && checked[c] )
        {
            s.erase( s.find(c) ) ;
            checked[c] = false ;
        }

    }

}

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 ;
        if(ok) for(int i : componente[b] ) fila.pb(i) ;
    }

    for( int i : componente[a] )
    {
        componente[b].pb(i) ;
        if( ok ) fila.pb(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 ) ;

        for(int j = 0 , nx , ny , c ; j < 8 ; j++ )
        {

            nx = p.ff.ff + dx[j] ;
            ny = p.ff.ss + dy[j] ;
            c = get_code(nx,ny) ;

            adj[p.ss].pb(c) ;

            nx = p.ff.ff + dx_cyclic[j] ;
            ny = p.ff.ss + dy_cyclic[j] ;
            c = get_code(nx,ny) ;

            adj_cyclic[p.ss].pb( c ) ;

        }

    }

    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 ;

        lp(i,0,4)
            if( adj[p.ss][i] != 0 && !is_full[ adj[p.ss][i] ] )
                join( p.ss , adj[p.ss][i] , false ) ;

    }


    lp(i,1,N+1)
        if( check(i) )
        {
            s.insert(i) ;
            checked[i] = true ;
        }

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

        int best_id = *it ;
        s.erase(it) ;

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

        lp(i,0,4)
            if( !is_full[ adj[best_id][i] ] )
                join(best_id, adj[best_id][i] , true ) ;


        for(int i : fila ) to_change(i) ;
        fila.clear() ;

    }

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

}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:177: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:180: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

# Verdict Execution time Memory Grader output
1 Correct 46 ms 60408 KB ans=YES N=1
2 Correct 45 ms 60416 KB ans=YES N=4
3 Correct 39 ms 60280 KB ans=NO N=4
4 Correct 46 ms 60280 KB ans=YES N=5
5 Correct 39 ms 60288 KB ans=YES N=9
6 Correct 38 ms 60280 KB ans=YES N=5
7 Correct 39 ms 60288 KB ans=NO N=9
8 Correct 40 ms 60288 KB ans=NO N=10
9 Correct 40 ms 60288 KB ans=YES N=10
10 Correct 39 ms 60280 KB ans=YES N=10
11 Correct 42 ms 60408 KB ans=YES N=10
12 Correct 39 ms 60288 KB ans=YES N=9
13 Correct 38 ms 60288 KB ans=YES N=9
14 Correct 43 ms 60288 KB ans=YES N=8
15 Correct 41 ms 60280 KB ans=YES N=8
16 Correct 38 ms 60288 KB ans=NO N=2

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 60408 KB ans=YES N=1
2 Correct 45 ms 60416 KB ans=YES N=4
3 Correct 39 ms 60280 KB ans=NO N=4
4 Correct 46 ms 60280 KB ans=YES N=5
5 Correct 39 ms 60288 KB ans=YES N=9
6 Correct 38 ms 60280 KB ans=YES N=5
7 Correct 39 ms 60288 KB ans=NO N=9
8 Correct 40 ms 60288 KB ans=NO N=10
9 Correct 40 ms 60288 KB ans=YES N=10
10 Correct 39 ms 60280 KB ans=YES N=10
11 Correct 42 ms 60408 KB ans=YES N=10
12 Correct 39 ms 60288 KB ans=YES N=9
13 Correct 38 ms 60288 KB ans=YES N=9
14 Correct 43 ms 60288 KB ans=YES N=8
15 Correct 41 ms 60280 KB ans=YES N=8
16 Correct 38 ms 60288 KB ans=NO N=2
17 Correct 40 ms 60416 KB ans=YES N=17
18 Correct 39 ms 60288 KB ans=YES N=25
19 Correct 40 ms 60288 KB ans=YES N=100
20 Incorrect 41 ms 60288 KB Full cells must be connected
21 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 60408 KB ans=YES N=1
2 Correct 45 ms 60416 KB ans=YES N=4
3 Correct 39 ms 60280 KB ans=NO N=4
4 Correct 46 ms 60280 KB ans=YES N=5
5 Correct 39 ms 60288 KB ans=YES N=9
6 Correct 38 ms 60280 KB ans=YES N=5
7 Correct 39 ms 60288 KB ans=NO N=9
8 Correct 40 ms 60288 KB ans=NO N=10
9 Correct 40 ms 60288 KB ans=YES N=10
10 Correct 39 ms 60280 KB ans=YES N=10
11 Correct 42 ms 60408 KB ans=YES N=10
12 Correct 39 ms 60288 KB ans=YES N=9
13 Correct 38 ms 60288 KB ans=YES N=9
14 Correct 43 ms 60288 KB ans=YES N=8
15 Correct 41 ms 60280 KB ans=YES N=8
16 Correct 38 ms 60288 KB ans=NO N=2
17 Correct 40 ms 60416 KB ans=YES N=17
18 Correct 39 ms 60288 KB ans=YES N=25
19 Correct 40 ms 60288 KB ans=YES N=100
20 Incorrect 41 ms 60288 KB Full cells must be connected
21 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 61304 KB ans=NO N=1934
2 Correct 45 ms 60664 KB ans=NO N=1965
3 Incorrect 53 ms 60664 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 60408 KB ans=YES N=1
2 Correct 45 ms 60416 KB ans=YES N=4
3 Correct 39 ms 60280 KB ans=NO N=4
4 Correct 46 ms 60280 KB ans=YES N=5
5 Correct 39 ms 60288 KB ans=YES N=9
6 Correct 38 ms 60280 KB ans=YES N=5
7 Correct 39 ms 60288 KB ans=NO N=9
8 Correct 40 ms 60288 KB ans=NO N=10
9 Correct 40 ms 60288 KB ans=YES N=10
10 Correct 39 ms 60280 KB ans=YES N=10
11 Correct 42 ms 60408 KB ans=YES N=10
12 Correct 39 ms 60288 KB ans=YES N=9
13 Correct 38 ms 60288 KB ans=YES N=9
14 Correct 43 ms 60288 KB ans=YES N=8
15 Correct 41 ms 60280 KB ans=YES N=8
16 Correct 38 ms 60288 KB ans=NO N=2
17 Correct 40 ms 60416 KB ans=YES N=17
18 Correct 39 ms 60288 KB ans=YES N=25
19 Correct 40 ms 60288 KB ans=YES N=100
20 Incorrect 41 ms 60288 KB Full cells must be connected
21 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 68072 KB ans=NO N=66151
2 Correct 487 ms 89608 KB ans=NO N=64333
3 Incorrect 783 ms 76772 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 61304 KB ans=NO N=1934
2 Correct 45 ms 60664 KB ans=NO N=1965
3 Incorrect 53 ms 60664 KB Full cells must be connected
4 Halted 0 ms 0 KB -