oj.uz

답안 #295089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295089 2020-09-09T13:15:58 Z CaroLinda 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 672432 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)
    {

        auto it = segments[type].find( mk(midPointL, *itLess) ) ;

        if(it != segments[type].end() )
        {
            Event a = Event( midPointL, *itLess, 0 , it->ss , clock );
            segments[type].erase( it ) ;
            if(a.t1 <= a.t2)
            sweep.pb(a);
        }

        it= segments[type].find( mk(midPointR, *itMore) ) ;

        if(it != segments[type].end())
        {
            Event b = Event( midPointR, *itMore, -1 , segments[type][ mk(midPointR, *itMore) ] , clock ) ;
            segments[type].erase( segments[type].find( mk(midPointR, *itMore) ) ) ;
            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:222:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  222 |     scanf("%d%d%d", &N , &K , &Q ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:234:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  234 |         scanf("%d%d%d%d", &x, &t, &a, &b ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:286:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  286 |         scanf("%d%d", &l, &y ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 39 ms 56696 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 40 ms 56696 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 43 ms 57080 KB Output is correct
7 Correct 41 ms 57216 KB Output is correct
8 Correct 42 ms 57208 KB Output is correct
9 Correct 41 ms 57336 KB Output is correct
10 Correct 43 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56952 KB Output is correct
13 Correct 40 ms 56952 KB Output is correct
14 Correct 42 ms 56956 KB Output is correct
15 Correct 43 ms 57088 KB Output is correct
16 Correct 42 ms 57088 KB Output is correct
17 Correct 42 ms 57080 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 41 ms 57208 KB Output is correct
20 Correct 40 ms 57080 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 40 ms 57344 KB Output is correct
23 Correct 41 ms 57336 KB Output is correct
24 Correct 40 ms 57216 KB Output is correct
25 Correct 43 ms 57080 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 39 ms 56960 KB Output is correct
28 Correct 40 ms 56952 KB Output is correct
29 Correct 41 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 39 ms 56696 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 40 ms 56696 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 43 ms 57080 KB Output is correct
7 Correct 41 ms 57216 KB Output is correct
8 Correct 42 ms 57208 KB Output is correct
9 Correct 41 ms 57336 KB Output is correct
10 Correct 43 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56952 KB Output is correct
13 Correct 40 ms 56952 KB Output is correct
14 Correct 42 ms 56956 KB Output is correct
15 Correct 43 ms 57088 KB Output is correct
16 Correct 42 ms 57088 KB Output is correct
17 Correct 42 ms 57080 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 41 ms 57208 KB Output is correct
20 Correct 40 ms 57080 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 40 ms 57344 KB Output is correct
23 Correct 41 ms 57336 KB Output is correct
24 Correct 40 ms 57216 KB Output is correct
25 Correct 43 ms 57080 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 39 ms 56960 KB Output is correct
28 Correct 40 ms 56952 KB Output is correct
29 Correct 41 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 988 ms 157880 KB Output is correct
32 Correct 114 ms 65932 KB Output is correct
33 Correct 949 ms 151760 KB Output is correct
34 Correct 879 ms 151756 KB Output is correct
35 Correct 1004 ms 158068 KB Output is correct
36 Correct 1067 ms 157416 KB Output is correct
37 Correct 744 ms 142288 KB Output is correct
38 Correct 762 ms 142164 KB Output is correct
39 Correct 605 ms 127572 KB Output is correct
40 Correct 637 ms 131640 KB Output is correct
41 Correct 734 ms 138688 KB Output is correct
42 Correct 742 ms 138964 KB Output is correct
43 Correct 107 ms 62528 KB Output is correct
44 Correct 735 ms 138480 KB Output is correct
45 Correct 707 ms 129052 KB Output is correct
46 Correct 630 ms 113616 KB Output is correct
47 Correct 456 ms 112024 KB Output is correct
48 Correct 436 ms 107632 KB Output is correct
49 Correct 501 ms 118580 KB Output is correct
50 Correct 561 ms 136092 KB Output is correct
51 Correct 489 ms 113944 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2771 ms 434360 KB Output is correct
2 Correct 3013 ms 407800 KB Output is correct
3 Correct 3029 ms 650928 KB Output is correct
4 Correct 2723 ms 468020 KB Output is correct
5 Correct 3227 ms 419328 KB Output is correct
6 Correct 3104 ms 414340 KB Output is correct
7 Correct 2890 ms 672432 KB Output is correct
8 Correct 2592 ms 464948 KB Output is correct
9 Correct 2516 ms 411120 KB Output is correct
10 Correct 2550 ms 398824 KB Output is correct
11 Correct 2172 ms 380976 KB Output is correct
12 Correct 2113 ms 417528 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4479 ms 529240 KB Output is correct
2 Correct 404 ms 110316 KB Output is correct
3 Execution timed out 5135 ms 524540 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 39 ms 56696 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 40 ms 56696 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 43 ms 57080 KB Output is correct
7 Correct 41 ms 57216 KB Output is correct
8 Correct 42 ms 57208 KB Output is correct
9 Correct 41 ms 57336 KB Output is correct
10 Correct 43 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56952 KB Output is correct
13 Correct 40 ms 56952 KB Output is correct
14 Correct 42 ms 56956 KB Output is correct
15 Correct 43 ms 57088 KB Output is correct
16 Correct 42 ms 57088 KB Output is correct
17 Correct 42 ms 57080 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 41 ms 57208 KB Output is correct
20 Correct 40 ms 57080 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 40 ms 57344 KB Output is correct
23 Correct 41 ms 57336 KB Output is correct
24 Correct 40 ms 57216 KB Output is correct
25 Correct 43 ms 57080 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 39 ms 56960 KB Output is correct
28 Correct 40 ms 56952 KB Output is correct
29 Correct 41 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 988 ms 157880 KB Output is correct
32 Correct 114 ms 65932 KB Output is correct
33 Correct 949 ms 151760 KB Output is correct
34 Correct 879 ms 151756 KB Output is correct
35 Correct 1004 ms 158068 KB Output is correct
36 Correct 1067 ms 157416 KB Output is correct
37 Correct 744 ms 142288 KB Output is correct
38 Correct 762 ms 142164 KB Output is correct
39 Correct 605 ms 127572 KB Output is correct
40 Correct 637 ms 131640 KB Output is correct
41 Correct 734 ms 138688 KB Output is correct
42 Correct 742 ms 138964 KB Output is correct
43 Correct 107 ms 62528 KB Output is correct
44 Correct 735 ms 138480 KB Output is correct
45 Correct 707 ms 129052 KB Output is correct
46 Correct 630 ms 113616 KB Output is correct
47 Correct 456 ms 112024 KB Output is correct
48 Correct 436 ms 107632 KB Output is correct
49 Correct 501 ms 118580 KB Output is correct
50 Correct 561 ms 136092 KB Output is correct
51 Correct 489 ms 113944 KB Output is correct
52 Correct 970 ms 197884 KB Output is correct
53 Correct 957 ms 187220 KB Output is correct
54 Correct 948 ms 170800 KB Output is correct
55 Correct 765 ms 153668 KB Output is correct
56 Correct 760 ms 158716 KB Output is correct
57 Correct 769 ms 143692 KB Output is correct
58 Correct 812 ms 158540 KB Output is correct
59 Correct 823 ms 168788 KB Output is correct
60 Correct 789 ms 146276 KB Output is correct
61 Correct 277 ms 101604 KB Output is correct
62 Correct 916 ms 193624 KB Output is correct
63 Correct 900 ms 179152 KB Output is correct
64 Correct 858 ms 173260 KB Output is correct
65 Correct 842 ms 162900 KB Output is correct
66 Correct 751 ms 146376 KB Output is correct
67 Correct 328 ms 96468 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 39 ms 56696 KB Output is correct
3 Correct 38 ms 56696 KB Output is correct
4 Correct 40 ms 56696 KB Output is correct
5 Correct 39 ms 56832 KB Output is correct
6 Correct 43 ms 57080 KB Output is correct
7 Correct 41 ms 57216 KB Output is correct
8 Correct 42 ms 57208 KB Output is correct
9 Correct 41 ms 57336 KB Output is correct
10 Correct 43 ms 57080 KB Output is correct
11 Correct 40 ms 57080 KB Output is correct
12 Correct 41 ms 56952 KB Output is correct
13 Correct 40 ms 56952 KB Output is correct
14 Correct 42 ms 56956 KB Output is correct
15 Correct 43 ms 57088 KB Output is correct
16 Correct 42 ms 57088 KB Output is correct
17 Correct 42 ms 57080 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 41 ms 57208 KB Output is correct
20 Correct 40 ms 57080 KB Output is correct
21 Correct 40 ms 57080 KB Output is correct
22 Correct 40 ms 57344 KB Output is correct
23 Correct 41 ms 57336 KB Output is correct
24 Correct 40 ms 57216 KB Output is correct
25 Correct 43 ms 57080 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 39 ms 56960 KB Output is correct
28 Correct 40 ms 56952 KB Output is correct
29 Correct 41 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 988 ms 157880 KB Output is correct
32 Correct 114 ms 65932 KB Output is correct
33 Correct 949 ms 151760 KB Output is correct
34 Correct 879 ms 151756 KB Output is correct
35 Correct 1004 ms 158068 KB Output is correct
36 Correct 1067 ms 157416 KB Output is correct
37 Correct 744 ms 142288 KB Output is correct
38 Correct 762 ms 142164 KB Output is correct
39 Correct 605 ms 127572 KB Output is correct
40 Correct 637 ms 131640 KB Output is correct
41 Correct 734 ms 138688 KB Output is correct
42 Correct 742 ms 138964 KB Output is correct
43 Correct 107 ms 62528 KB Output is correct
44 Correct 735 ms 138480 KB Output is correct
45 Correct 707 ms 129052 KB Output is correct
46 Correct 630 ms 113616 KB Output is correct
47 Correct 456 ms 112024 KB Output is correct
48 Correct 436 ms 107632 KB Output is correct
49 Correct 501 ms 118580 KB Output is correct
50 Correct 561 ms 136092 KB Output is correct
51 Correct 489 ms 113944 KB Output is correct
52 Correct 2771 ms 434360 KB Output is correct
53 Correct 3013 ms 407800 KB Output is correct
54 Correct 3029 ms 650928 KB Output is correct
55 Correct 2723 ms 468020 KB Output is correct
56 Correct 3227 ms 419328 KB Output is correct
57 Correct 3104 ms 414340 KB Output is correct
58 Correct 2890 ms 672432 KB Output is correct
59 Correct 2592 ms 464948 KB Output is correct
60 Correct 2516 ms 411120 KB Output is correct
61 Correct 2550 ms 398824 KB Output is correct
62 Correct 2172 ms 380976 KB Output is correct
63 Correct 2113 ms 417528 KB Output is correct
64 Correct 4479 ms 529240 KB Output is correct
65 Correct 404 ms 110316 KB Output is correct
66 Execution timed out 5135 ms 524540 KB Time limit exceeded
67 Halted 0 ms 0 KB -