oj.uz

Submission #295086

# Submission time Handle Problem Language Result Execution time Memory
295086 2020-09-09T13:13:52 Z CaroLinda New Home (APIO18_new_home) C++14
57 / 100
 5000 ms 675452 KB 
#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,fma,tune=native")
#pragma GCC optimize("unroll-loops")

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

const int MAXN = 3e5+100 ;
const int MAXT = 1e8+10 ;
const int MAX_COORD = 3e8+7 ;

using namespace std ;

struct Event
{
    int xConta, xIntercept, type , t1, t2 ;
    Event(int a=0, int b=0, int c=0, int d=0, int e=0) : xConta(a), xIntercept(b), type(c) , t1(d), t2(e){}

};

int ansQuery[MAXN] ;

struct Seg
{

    int n ;
    vector<Event> tree[MAXN*2] ;

    int m(int l, int r) { return (l+r)>>1 ; }

    void insertEvent(int t1, int t2,  Event e)
    {

        if(e.type > 0)
        {
            for(t1 += n ; t1 >= 1 ; t1 >>= 1)
                tree[t1].pb(e) ;

            return ;
        }

        for(t1 += n , t2 += n ; t1 < t2 ; t1 >>= 1 , t2>>=1 )
        {
            if( t1&1 ) tree[t1].pb(e), t1++ ;
            if( t2&1 ) t2--, tree[t2].pb(e) ;
        }

    }

    void solve(int forbiddenType )
    {
        for(int i = 1 ; i < 2*n ; i++ )
        {
            int mxNegative = -MAXT , mnPositive = MAXT ;

            for(auto e : tree[i])
            {
                if( e.type == forbiddenType ) continue ;
                if( e.type > 0 )
                {
                    ansQuery[ e.type ] = max( ansQuery[e.type] , (forbiddenType == 0) ? mxNegative - e.xConta : e.xConta-mnPositive ) ;
                }
                else
                {
                    if(forbiddenType == 0) mxNegative = max(mxNegative, e.xIntercept ) ;
                    else mnPositive = min(mnPositive, e.xIntercept ) ;
                }
            }
        }
    }

} seg ;

//O ANO PODE IR ATÉ 10^8
//VAI TER QUE FAZER COMPRESSÃO

int N , K , Q ;
vector<int> compressionTime ;
set<int> store[MAXN] ;
vector< tiii > myVecOfTuples ;
map< pii , int > segments[MAXN] ;
vector<Event> sweep ;
map<int, vector<pii> > mySet[MAXN] ;

void operation( set<int>::iterator itLess, set<int>::iterator itMore , int type , int clock , bool isRemoval )
{
    int midPointL = (*itMore - *itLess)>>1 ;
    midPointL += *itLess ;

    int midPointR = midPointL ;

    if( (*itMore - (*itLess)) % 2 != 0 ) midPointR++;


    if(isRemoval)
    {
        Event a = Event( midPointL, *itLess, 0 , segments[type][ mk(midPointL,*itLess) ] , clock );
        Event b = Event( midPointR, *itMore, -1 , segments[type][ mk(midPointR, *itMore) ] , clock ) ;

        segments[type].erase( segments[type].find( mk(midPointL, *itLess) ) ) ;
        segments[type].erase( segments[type].find( mk(midPointR, *itMore) ) ) ;

        if(a.t1 <= a.t2)
            sweep.pb(a);
        if(b.t1 <= b.t2 )
            sweep.pb(b) ;
    }
    else
    {
        segments[ type ].insert( mk(mk(midPointL, *itLess), clock) ) ;
        segments[type].insert( mk(mk(midPointR, *itMore),clock) ) ;
    }

}

void insertion(int x_coord, int type, int clock )
{

    auto itMore = store[type].lower_bound(x_coord) ;
    auto itLess = itMore ; itLess-- ;

    operation( itLess, itMore, type, clock-1 , true) ;

    store[type].insert( x_coord ) ;

    itMore = store[type].find( x_coord ) ;
    itLess = itMore ; itLess-- ;

    operation( itLess, itMore, type, clock, false ) ;

    itLess = itMore ; itLess++ ;
    swap(itMore, itLess) ;

    operation( itLess, itMore, type, clock, false );

}

void removal(int x_coord, int type, int clock )
{

    auto itMore = store[type].find(x_coord) ;
    auto itLess = itMore ; itLess-- ;

    operation( itLess, itMore, type, clock, true ) ;

    itLess = itMore ; itLess++ ;
    swap(itMore, itLess) ;

    operation( itLess, itMore, type, clock, true ) ;

    store[type].erase(itLess);

    itMore = store[type].lower_bound(x_coord);
    itLess = itMore ; itLess--;

    operation( itLess, itMore, type, clock+1, false ) ;

}

int maiorIgual(int x)
{

    int l = 0 , r = sz(compressionTime) - 1 , mid , best = r+1 ;

    while( l <= r )
    {
        mid = (l+r)>>1 ;
        if(compressionTime[mid] >= x)
        {
            best = mid ;
            r = mid - 1 ;
        }
        else l = mid + 1 ;
    }
    return best ;
}
int menorIgual(int x)
{
    int l = 0 , r = sz(compressionTime)-1 , mid , best = -1 ;

    while(l <= r)
    {
        mid = (l+r)>>1 ;
        if(compressionTime[mid] <= x )
        {
            best = mid ;
            l = mid + 1 ;
        }
        else r = mid - 1 ;
    }

    return best ;
}

int main()
{

    scanf("%d%d%d", &N , &K , &Q ) ;
    for(int i = 1 ; i <= K ; i++ )
    {

        store[i].insert( -MAX_COORD ) ;
        store[i].insert( MAX_COORD ) ;

        operation( store[i].begin() , prev( store[i].end() ) , i , 1, false ) ;

    }
    for(int i = 1 , x , t , a , b ; i <= N ; i++ )
    {
        scanf("%d%d%d%d", &x, &t, &a, &b ) ;
        mySet[t][x].push_back( mk(a,b) ) ;
    }

    for(int i = 1 ; i <= K ; i++ )
    {

        for(auto &aux: mySet[i] )
        {
            vector<pii> x_coord = aux.ss ;

            sort(all(x_coord)) ;
            x_coord.pb( mk( MAXT, MAXT ) ) ;

            int mnTime = x_coord[0].ff ;
            int mxTime = x_coord[0].ss ;

            for(int j = 1 ; j < sz(x_coord) ; j++ )
            {
                if( x_coord[j].ff > mxTime )
                {
                    myVecOfTuples.pb( mkt( mnTime , -i, aux.ff ) ) ;
                    myVecOfTuples.pb( mkt( mxTime, i, aux.ff ) ) ;

                    mnTime = x_coord[j].ff ;
                    mxTime = x_coord[j].ss ;
                }
                else mxTime = max(mxTime, x_coord[j].ss ) ;
            }

        }
    }

    sort(all(myVecOfTuples)) ;

    for(auto tup : myVecOfTuples )
    {

        int clock = get<0>(tup) ;
        int type = get<1>(tup) ;
        int x_coord = get<2>(tup) ;

        if( type < 0 ) insertion( x_coord , -type, clock ) ;
        else removal( x_coord, type, clock );

    }

    for(int i = 1 ; i <= K ; i++ )
        operation( store[i].begin() , prev( store[i].end() ) , i , MAXT, true ) ;

    for(int i = 1 , l , y ; i <= Q ; i++ )
    {
        scanf("%d%d", &l, &y ) ;
        sweep.pb( Event(l,l,i,y,y) );
        compressionTime.pb(y) ;
    }

    //Indeed, compression time!
    sort(all(compressionTime)) ;
    compressionTime.erase( unique(all(compressionTime)) , compressionTime.end() );
    //

    sort(all(sweep), [&](Event a, Event b)
         {
             if( a.xConta != b.xConta ) return a.xConta < b.xConta ;
             else return a.type < b.type ;
         } );

    for(auto &e : sweep ) e.t1 = maiorIgual(e.t1) , e.t2 = menorIgual(e.t2) ;
   // for(auto e : sweep ) printf("coord %d %d, e tempo %d %d e tipo %d\n" , e.xConta, e.xIntercept, e.t1, e.t2, e.type ) ;

    seg.n = sz(compressionTime) ;

    for(auto e : sweep )
        if( e.type != 0 && e.t1 <= e.t2 )
            seg.insertEvent( e.t1, e.t2+1 , e ) ;

    seg.solve( 0 ) ;

    sort(all(sweep), [&](Event a, Event b)
     {
         if( a.xConta != b.xConta ) return a.xConta > b.xConta ;
         else return a.type < b.type ;
     } );

    for(int i = 1 ; i < 2*seg.n ; i++ ) seg.tree[i].clear() ;

    for(auto e : sweep )
        if(e.type != -1 && e.t1 <= e.t2 )
            seg.insertEvent( e.t1, e.t2+1, e ) ;

    seg.solve( -1 ) ;

    for(int i = 1 ; i <= Q ; i++ ) printf("%d\n" , ansQuery[i] > 100000010 ? -1 : ansQuery[i] ) ;

}

/*
2 1 1
39682063 1 1 100000000
29000832 1 1 100000000
34341447 100000000

2 1 1
39682063 1 1 100000000
29000832 1 1 100000000
34341447 100000000

5 4 1
39682063 3 1 100000000
37986244 2 1 100000000
29273266 1 1 100000000
33173370 4 1 100000000
29000832 3 1 100000000
34341447 100000000



5 2 2
4 2 3 3
5 1 2 5
5 1 2 5
5 1 5 5
4 1 3 3
90 3
7 10

1 1 1
5 1 1 10
7 5

2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

6 3 4
10 1 1 100000000
13 2 1 100000000
10 2 1 100000000
1 3 1 100000000
15 1 1 100000000
26 3 1 100000000
15 20
30 100000000
50 800
100000000 1

4 2 4
3 1 1 10
4 1 8 10
9 2 2 4
7 2 5 7
5 3
5 6
5 9
1 10

1 1 1
100000000 1 1 1 1
1 1

*/

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:211:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  211 |     scanf("%d%d%d", &N , &K , &Q ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:223:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  223 |         scanf("%d%d%d%d", &x, &t, &a, &b ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:275:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  275 |         scanf("%d%d", &l, &y ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56704 KB Output is correct
2 Correct 38 ms 56704 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 38 ms 56704 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 41 ms 57088 KB Output is correct
7 Correct 51 ms 57208 KB Output is correct
8 Correct 41 ms 57216 KB Output is correct
9 Correct 41 ms 57340 KB Output is correct
10 Correct 41 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56960 KB Output is correct
13 Correct 40 ms 56960 KB Output is correct
14 Correct 40 ms 56952 KB Output is correct
15 Correct 40 ms 57080 KB Output is correct
16 Correct 40 ms 57212 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57208 KB Output is correct
19 Correct 42 ms 57208 KB Output is correct
20 Correct 41 ms 57088 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 41 ms 57336 KB Output is correct
23 Correct 42 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 42 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 41 ms 57088 KB Output is correct
28 Correct 42 ms 57080 KB Output is correct
29 Correct 42 ms 56952 KB Output is correct
30 Correct 41 ms 56952 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56704 KB Output is correct
2 Correct 38 ms 56704 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 38 ms 56704 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 41 ms 57088 KB Output is correct
7 Correct 51 ms 57208 KB Output is correct
8 Correct 41 ms 57216 KB Output is correct
9 Correct 41 ms 57340 KB Output is correct
10 Correct 41 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56960 KB Output is correct
13 Correct 40 ms 56960 KB Output is correct
14 Correct 40 ms 56952 KB Output is correct
15 Correct 40 ms 57080 KB Output is correct
16 Correct 40 ms 57212 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57208 KB Output is correct
19 Correct 42 ms 57208 KB Output is correct
20 Correct 41 ms 57088 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 41 ms 57336 KB Output is correct
23 Correct 42 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 42 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 41 ms 57088 KB Output is correct
28 Correct 42 ms 57080 KB Output is correct
29 Correct 42 ms 56952 KB Output is correct
30 Correct 41 ms 56952 KB Output is correct
31 Correct 1004 ms 160756 KB Output is correct
32 Correct 113 ms 66828 KB Output is correct
33 Correct 937 ms 154828 KB Output is correct
34 Correct 892 ms 154700 KB Output is correct
35 Correct 997 ms 161008 KB Output is correct
36 Correct 1059 ms 160160 KB Output is correct
37 Correct 763 ms 145100 KB Output is correct
38 Correct 772 ms 145224 KB Output is correct
39 Correct 621 ms 130408 KB Output is correct
40 Correct 643 ms 134480 KB Output is correct
41 Correct 736 ms 141644 KB Output is correct
42 Correct 739 ms 141908 KB Output is correct
43 Correct 120 ms 64964 KB Output is correct
44 Correct 745 ms 141512 KB Output is correct
45 Correct 735 ms 132296 KB Output is correct
46 Correct 674 ms 116564 KB Output is correct
47 Correct 462 ms 114776 KB Output is correct
48 Correct 461 ms 110296 KB Output is correct
49 Correct 500 ms 121296 KB Output is correct
50 Correct 556 ms 138956 KB Output is correct
51 Correct 501 ms 116556 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2751 ms 434080 KB Output is correct
2 Correct 3067 ms 407164 KB Output is correct
3 Correct 3006 ms 650368 KB Output is correct
4 Correct 2729 ms 467872 KB Output is correct
5 Correct 3242 ms 418900 KB Output is correct
6 Correct 3093 ms 417404 KB Output is correct
7 Correct 2840 ms 675452 KB Output is correct
8 Correct 2514 ms 468520 KB Output is correct
9 Correct 2466 ms 413896 KB Output is correct
10 Correct 2480 ms 402008 KB Output is correct
11 Correct 2033 ms 383828 KB Output is correct
12 Correct 2041 ms 420664 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4488 ms 521976 KB Output is correct
2 Correct 404 ms 107344 KB Output is correct
3 Execution timed out 5074 ms 529976 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56704 KB Output is correct
2 Correct 38 ms 56704 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 38 ms 56704 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 41 ms 57088 KB Output is correct
7 Correct 51 ms 57208 KB Output is correct
8 Correct 41 ms 57216 KB Output is correct
9 Correct 41 ms 57340 KB Output is correct
10 Correct 41 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56960 KB Output is correct
13 Correct 40 ms 56960 KB Output is correct
14 Correct 40 ms 56952 KB Output is correct
15 Correct 40 ms 57080 KB Output is correct
16 Correct 40 ms 57212 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57208 KB Output is correct
19 Correct 42 ms 57208 KB Output is correct
20 Correct 41 ms 57088 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 41 ms 57336 KB Output is correct
23 Correct 42 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 42 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 41 ms 57088 KB Output is correct
28 Correct 42 ms 57080 KB Output is correct
29 Correct 42 ms 56952 KB Output is correct
30 Correct 41 ms 56952 KB Output is correct
31 Correct 1004 ms 160756 KB Output is correct
32 Correct 113 ms 66828 KB Output is correct
33 Correct 937 ms 154828 KB Output is correct
34 Correct 892 ms 154700 KB Output is correct
35 Correct 997 ms 161008 KB Output is correct
36 Correct 1059 ms 160160 KB Output is correct
37 Correct 763 ms 145100 KB Output is correct
38 Correct 772 ms 145224 KB Output is correct
39 Correct 621 ms 130408 KB Output is correct
40 Correct 643 ms 134480 KB Output is correct
41 Correct 736 ms 141644 KB Output is correct
42 Correct 739 ms 141908 KB Output is correct
43 Correct 120 ms 64964 KB Output is correct
44 Correct 745 ms 141512 KB Output is correct
45 Correct 735 ms 132296 KB Output is correct
46 Correct 674 ms 116564 KB Output is correct
47 Correct 462 ms 114776 KB Output is correct
48 Correct 461 ms 110296 KB Output is correct
49 Correct 500 ms 121296 KB Output is correct
50 Correct 556 ms 138956 KB Output is correct
51 Correct 501 ms 116556 KB Output is correct
52 Correct 957 ms 198788 KB Output is correct
53 Correct 924 ms 187836 KB Output is correct
54 Correct 918 ms 171580 KB Output is correct
55 Correct 739 ms 154316 KB Output is correct
56 Correct 733 ms 159316 KB Output is correct
57 Correct 729 ms 144332 KB Output is correct
58 Correct 787 ms 159308 KB Output is correct
59 Correct 820 ms 169564 KB Output is correct
60 Correct 759 ms 147156 KB Output is correct
61 Correct 267 ms 101608 KB Output is correct
62 Correct 887 ms 194268 KB Output is correct
63 Correct 869 ms 179792 KB Output is correct
64 Correct 869 ms 173908 KB Output is correct
65 Correct 830 ms 163540 KB Output is correct
66 Correct 754 ms 146852 KB Output is correct
67 Correct 327 ms 96204 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56704 KB Output is correct
2 Correct 38 ms 56704 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 38 ms 56704 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 41 ms 57088 KB Output is correct
7 Correct 51 ms 57208 KB Output is correct
8 Correct 41 ms 57216 KB Output is correct
9 Correct 41 ms 57340 KB Output is correct
10 Correct 41 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56960 KB Output is correct
13 Correct 40 ms 56960 KB Output is correct
14 Correct 40 ms 56952 KB Output is correct
15 Correct 40 ms 57080 KB Output is correct
16 Correct 40 ms 57212 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57208 KB Output is correct
19 Correct 42 ms 57208 KB Output is correct
20 Correct 41 ms 57088 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 41 ms 57336 KB Output is correct
23 Correct 42 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 42 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 41 ms 57088 KB Output is correct
28 Correct 42 ms 57080 KB Output is correct
29 Correct 42 ms 56952 KB Output is correct
30 Correct 41 ms 56952 KB Output is correct
31 Correct 1004 ms 160756 KB Output is correct
32 Correct 113 ms 66828 KB Output is correct
33 Correct 937 ms 154828 KB Output is correct
34 Correct 892 ms 154700 KB Output is correct
35 Correct 997 ms 161008 KB Output is correct
36 Correct 1059 ms 160160 KB Output is correct
37 Correct 763 ms 145100 KB Output is correct
38 Correct 772 ms 145224 KB Output is correct
39 Correct 621 ms 130408 KB Output is correct
40 Correct 643 ms 134480 KB Output is correct
41 Correct 736 ms 141644 KB Output is correct
42 Correct 739 ms 141908 KB Output is correct
43 Correct 120 ms 64964 KB Output is correct
44 Correct 745 ms 141512 KB Output is correct
45 Correct 735 ms 132296 KB Output is correct
46 Correct 674 ms 116564 KB Output is correct
47 Correct 462 ms 114776 KB Output is correct
48 Correct 461 ms 110296 KB Output is correct
49 Correct 500 ms 121296 KB Output is correct
50 Correct 556 ms 138956 KB Output is correct
51 Correct 501 ms 116556 KB Output is correct
52 Correct 2751 ms 434080 KB Output is correct
53 Correct 3067 ms 407164 KB Output is correct
54 Correct 3006 ms 650368 KB Output is correct
55 Correct 2729 ms 467872 KB Output is correct
56 Correct 3242 ms 418900 KB Output is correct
57 Correct 3093 ms 417404 KB Output is correct
58 Correct 2840 ms 675452 KB Output is correct
59 Correct 2514 ms 468520 KB Output is correct
60 Correct 2466 ms 413896 KB Output is correct
61 Correct 2480 ms 402008 KB Output is correct
62 Correct 2033 ms 383828 KB Output is correct
63 Correct 2041 ms 420664 KB Output is correct
64 Correct 4488 ms 521976 KB Output is correct
65 Correct 404 ms 107344 KB Output is correct
66 Execution timed out 5074 ms 529976 KB Time limit exceeded
67 Halted 0 ms 0 KB -