oj.uz

답안 #295268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295268 2020-09-09T14:50:29 Z CaroLinda 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 778512 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 = 1e9+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++ )
        {
        	//debug("Em %d:\n" , i ) ;
            int mxNegative = -MAXT , mnPositive = MAXT ;
 
            for(auto e : tree[i])
            {
                if( e.type == forbiddenType ) continue ;

                //debug("coord %d %d, e tempo %d %d e tipo %d\n" , e.xConta, e.xIntercept, e.t1, e.t2, e.type ) ;

                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 ;
int timeRight[MAXN] , timeLeft[MAXN] , midRight[MAXN] ,midLeft[MAXN] ;
vector<int> compressionTime , compressionX ;
set<int> lojinhas ;
vector< pii > myVecOfPairs ;
vector<pii> coordX[MAXN] ;
vector<tiii> myStores[MAXN] ;
map< pii , int > segments[MAXN] ;
vector<Event> sweep ;
 
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 ;
}
 
void coloca(set<int>::iterator l , set<int>::iterator r , int t )
{
 
    int xl = compressionX[*l] ;
    int xr = compressionX[*r] ;
 
    midRight[*l] = (xr - xl)>>1 ;
    midRight[*l] += xl ;
    midLeft[*r] = ( (xr-xl)%2 == 0 ) ? midRight[*l] : ( midRight[*l]+1);
 
    timeRight[*l] = t ;
    timeLeft[*r] = t ;
 
}
 
void apaga( set<int>::iterator l , set<int>::iterator r , int t )
{
 
    int xl = compressionX[*l] ;
    int xr = compressionX[*r] ;
 
    if(timeRight[*l] <= t )
        sweep.pb( Event( midRight[*l] , xl , 0 , timeRight[*l] , t ) ) ;
 
    if(timeLeft[*r] <= t)
        sweep.pb( Event( midLeft[*r] , xr , -1, timeLeft[*r] , t ) ) ;
 
}
 
 
int main()
{
 
    scanf("%d%d%d", &N , &K , &Q ) ;
 
    for(int i = 1 , x , t , a , b ; i <= N ; i++ )
    {
        scanf("%d%d%d%d", &x, &t, &a, &b ) ;
        myStores[t].pb( mkt(x,a,b) ) ;
        compressionX.pb(x) ;
    }
 
    compressionX.pb(-MAXT) ;
    compressionX.pb(MAXT);
    sort(all(compressionX));
    compressionX.erase( unique( all(compressionX) ) , compressionX.end() ) ;
 
    for(int i = 1 ; i <= K ; i++ )
    {
 
        sort(all(myStores[i])) ;
 
        for(auto &tup : myStores[i])
        {
            int l = 0 , r = sz(compressionX) - 1 , mid ;
 
            while(l <= r)
            {
                mid = (l+r)>>1 ;
 
                if( compressionX[mid] == get<0>(tup) ) break ;
                else if( compressionX[mid] < get<0>(tup) ) l =mid+1 ;
                else r = mid - 1 ;
            }
 
            get<0>(tup) = mid ;
            coordX[mid].pb( mk(get<1>(tup) , get<2>(tup)) ) ;
        }
 
       for(int j = 0 ; j < sz(myStores[i]) ; j++ )
        {
 
            int X = get<0>(myStores[i][j]) ;
 
            if(j != 0 && X == get<0>(myStores[i][j-1]) ) continue ;
 
            int mnTime =  coordX[ X ][0].ff ;
            int mxTime =  coordX[ X ][0].ss ;
            coordX[X].pb( mk(MAXT, MAXT) ) ;
 
            for(int g = 1 ; g < sz( coordX[ X ] ) ; g++ )
            {
                if( coordX[X][g].ff > mxTime )
                {
                    myVecOfPairs.pb( mk( mnTime , -X ) ) ;
                    myVecOfPairs.pb( mk( mxTime , X ) ) ;
 
                    mnTime = coordX[X][g].ff ;
                    mxTime = coordX[X][g].ss ;
                }
                else mxTime = max(mxTime, coordX[X][g].ss ) ;
            }
 
            coordX[X].clear() ;
 
        }
 
        //Cada x eh unico e ta comprimido, pode ser o id dele
 
        sort(all(myVecOfPairs)) ;
 
        lojinhas.insert(0) ;
        lojinhas.insert( sz(compressionX) - 1 ) ;
 
        coloca( lojinhas.begin() , prev( lojinhas.end() ) , 1 ) ;
 
        for(auto e : myVecOfPairs )
        {
            int t = e.ff ;
            int x = e.ss ;
 
            set<int>::iterator itMore , itLess;
 
            if(x < 0)
            {
                itMore = lojinhas.upper_bound(-x) ;
                itLess = itMore , itLess-- ;
 
                apaga(itLess, itMore, t-1) ;
 
                lojinhas.insert(-x) ;
 
                itMore = lojinhas.find(-x) ;
                itLess = itMore , itLess-- ;
 
                coloca(itLess, itMore , t) ;
 
                itLess = itMore , itLess++ ;
                swap(itLess, itMore) ;
 
                coloca(itLess, itMore, t) ;
 
            }
            else
            {
                itMore = lojinhas.find(x) ;
                itLess = itMore , itLess-- ;
 
                apaga(itLess, itMore , t ) ;
 
 
                itLess = itMore , itLess++ ;
                swap(itLess, itMore ) ;
 
                apaga(itLess, itMore, t ) ;
 
                lojinhas.erase(itLess) ;
 
                itMore = lojinhas.upper_bound(x) ;
                itLess = itMore , itLess-- ;
 
                coloca(itLess, itMore, t+1 ) ;
 
            }
 
        }
 
        apaga( lojinhas.begin() , prev(lojinhas.end() ) , MAXT ) ;
 
        myVecOfPairs.clear() ;
        lojinhas.clear() ;
 
    }
 
   // for(auto e : sweep ) debug("[%d,%d] %d time[%d,%d]\n", e.xConta, e.xIntercept, e.type , e.t1, e.t2 ) ;
 
    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] > 100000000 ? -1 : ansQuery[i] ) ;
 
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:172:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  172 |     scanf("%d%d%d", &N , &K , &Q ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:176:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  176 |         scanf("%d%d%d%d", &x, &t, &a, &b ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:307:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  307 |         scanf("%d%d", &l, &y ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~
new_home.cpp:193:52: warning: 'mid' may be used uninitialized in this function [-Wmaybe-uninitialized]
  193 |             int l = 0 , r = sz(compressionX) - 1 , mid ;
      |                                                    ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 42624 KB Output is correct
2 Correct 30 ms 42624 KB Output is correct
3 Correct 30 ms 42624 KB Output is correct
4 Correct 34 ms 42620 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 43000 KB Output is correct
7 Correct 36 ms 43136 KB Output is correct
8 Correct 31 ms 43060 KB Output is correct
9 Correct 33 ms 43136 KB Output is correct
10 Correct 40 ms 43112 KB Output is correct
11 Correct 30 ms 43004 KB Output is correct
12 Correct 32 ms 42860 KB Output is correct
13 Correct 32 ms 42880 KB Output is correct
14 Correct 31 ms 42872 KB Output is correct
15 Correct 33 ms 43000 KB Output is correct
16 Correct 32 ms 43008 KB Output is correct
17 Correct 30 ms 43000 KB Output is correct
18 Correct 36 ms 43000 KB Output is correct
19 Correct 31 ms 43136 KB Output is correct
20 Correct 39 ms 43008 KB Output is correct
21 Correct 30 ms 42752 KB Output is correct
22 Correct 39 ms 43128 KB Output is correct
23 Correct 39 ms 43132 KB Output is correct
24 Correct 30 ms 43128 KB Output is correct
25 Correct 30 ms 43008 KB Output is correct
26 Correct 30 ms 42880 KB Output is correct
27 Correct 37 ms 42880 KB Output is correct
28 Correct 29 ms 42880 KB Output is correct
29 Correct 34 ms 42872 KB Output is correct
30 Correct 28 ms 42880 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 42624 KB Output is correct
2 Correct 30 ms 42624 KB Output is correct
3 Correct 30 ms 42624 KB Output is correct
4 Correct 34 ms 42620 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 43000 KB Output is correct
7 Correct 36 ms 43136 KB Output is correct
8 Correct 31 ms 43060 KB Output is correct
9 Correct 33 ms 43136 KB Output is correct
10 Correct 40 ms 43112 KB Output is correct
11 Correct 30 ms 43004 KB Output is correct
12 Correct 32 ms 42860 KB Output is correct
13 Correct 32 ms 42880 KB Output is correct
14 Correct 31 ms 42872 KB Output is correct
15 Correct 33 ms 43000 KB Output is correct
16 Correct 32 ms 43008 KB Output is correct
17 Correct 30 ms 43000 KB Output is correct
18 Correct 36 ms 43000 KB Output is correct
19 Correct 31 ms 43136 KB Output is correct
20 Correct 39 ms 43008 KB Output is correct
21 Correct 30 ms 42752 KB Output is correct
22 Correct 39 ms 43128 KB Output is correct
23 Correct 39 ms 43132 KB Output is correct
24 Correct 30 ms 43128 KB Output is correct
25 Correct 30 ms 43008 KB Output is correct
26 Correct 30 ms 42880 KB Output is correct
27 Correct 37 ms 42880 KB Output is correct
28 Correct 29 ms 42880 KB Output is correct
29 Correct 34 ms 42872 KB Output is correct
30 Correct 28 ms 42880 KB Output is correct
31 Correct 779 ms 143148 KB Output is correct
32 Correct 112 ms 53256 KB Output is correct
33 Correct 744 ms 136620 KB Output is correct
34 Correct 718 ms 136912 KB Output is correct
35 Correct 751 ms 142412 KB Output is correct
36 Correct 751 ms 142188 KB Output is correct
37 Correct 591 ms 127084 KB Output is correct
38 Correct 591 ms 126948 KB Output is correct
39 Correct 475 ms 112548 KB Output is correct
40 Correct 500 ms 116424 KB Output is correct
41 Correct 666 ms 123232 KB Output is correct
42 Correct 682 ms 124068 KB Output is correct
43 Correct 99 ms 51192 KB Output is correct
44 Correct 682 ms 123248 KB Output is correct
45 Correct 679 ms 114040 KB Output is correct
46 Correct 585 ms 98380 KB Output is correct
47 Correct 399 ms 96748 KB Output is correct
48 Correct 391 ms 92600 KB Output is correct
49 Correct 437 ms 103276 KB Output is correct
50 Correct 504 ms 121176 KB Output is correct
51 Correct 442 ms 98800 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2312 ms 395524 KB Output is correct
2 Correct 2147 ms 382768 KB Output is correct
3 Correct 2866 ms 585108 KB Output is correct
4 Correct 2419 ms 438808 KB Output is correct
5 Correct 2231 ms 398316 KB Output is correct
6 Correct 2144 ms 393076 KB Output is correct
7 Correct 2680 ms 595708 KB Output is correct
8 Correct 2328 ms 435772 KB Output is correct
9 Correct 2225 ms 388968 KB Output is correct
10 Correct 2111 ms 377396 KB Output is correct
11 Correct 1545 ms 359088 KB Output is correct
12 Correct 1667 ms 396396 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3529 ms 490376 KB Output is correct
2 Correct 419 ms 99272 KB Output is correct
3 Correct 3562 ms 497916 KB Output is correct
4 Correct 4136 ms 688956 KB Output is correct
5 Correct 3646 ms 512900 KB Output is correct
6 Correct 3763 ms 543940 KB Output is correct
7 Correct 3674 ms 476620 KB Output is correct
8 Correct 3535 ms 488212 KB Output is correct
9 Correct 3864 ms 707004 KB Output is correct
10 Correct 3613 ms 535268 KB Output is correct
11 Correct 3527 ms 513892 KB Output is correct
12 Correct 3468 ms 480424 KB Output is correct
13 Correct 2000 ms 449412 KB Output is correct
14 Correct 1993 ms 438284 KB Output is correct
15 Correct 2227 ms 454084 KB Output is correct
16 Correct 2479 ms 461960 KB Output is correct
17 Correct 2459 ms 452236 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 42624 KB Output is correct
2 Correct 30 ms 42624 KB Output is correct
3 Correct 30 ms 42624 KB Output is correct
4 Correct 34 ms 42620 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 43000 KB Output is correct
7 Correct 36 ms 43136 KB Output is correct
8 Correct 31 ms 43060 KB Output is correct
9 Correct 33 ms 43136 KB Output is correct
10 Correct 40 ms 43112 KB Output is correct
11 Correct 30 ms 43004 KB Output is correct
12 Correct 32 ms 42860 KB Output is correct
13 Correct 32 ms 42880 KB Output is correct
14 Correct 31 ms 42872 KB Output is correct
15 Correct 33 ms 43000 KB Output is correct
16 Correct 32 ms 43008 KB Output is correct
17 Correct 30 ms 43000 KB Output is correct
18 Correct 36 ms 43000 KB Output is correct
19 Correct 31 ms 43136 KB Output is correct
20 Correct 39 ms 43008 KB Output is correct
21 Correct 30 ms 42752 KB Output is correct
22 Correct 39 ms 43128 KB Output is correct
23 Correct 39 ms 43132 KB Output is correct
24 Correct 30 ms 43128 KB Output is correct
25 Correct 30 ms 43008 KB Output is correct
26 Correct 30 ms 42880 KB Output is correct
27 Correct 37 ms 42880 KB Output is correct
28 Correct 29 ms 42880 KB Output is correct
29 Correct 34 ms 42872 KB Output is correct
30 Correct 28 ms 42880 KB Output is correct
31 Correct 779 ms 143148 KB Output is correct
32 Correct 112 ms 53256 KB Output is correct
33 Correct 744 ms 136620 KB Output is correct
34 Correct 718 ms 136912 KB Output is correct
35 Correct 751 ms 142412 KB Output is correct
36 Correct 751 ms 142188 KB Output is correct
37 Correct 591 ms 127084 KB Output is correct
38 Correct 591 ms 126948 KB Output is correct
39 Correct 475 ms 112548 KB Output is correct
40 Correct 500 ms 116424 KB Output is correct
41 Correct 666 ms 123232 KB Output is correct
42 Correct 682 ms 124068 KB Output is correct
43 Correct 99 ms 51192 KB Output is correct
44 Correct 682 ms 123248 KB Output is correct
45 Correct 679 ms 114040 KB Output is correct
46 Correct 585 ms 98380 KB Output is correct
47 Correct 399 ms 96748 KB Output is correct
48 Correct 391 ms 92600 KB Output is correct
49 Correct 437 ms 103276 KB Output is correct
50 Correct 504 ms 121176 KB Output is correct
51 Correct 442 ms 98800 KB Output is correct
52 Correct 855 ms 171220 KB Output is correct
53 Correct 830 ms 160480 KB Output is correct
54 Correct 781 ms 151644 KB Output is correct
55 Correct 680 ms 134728 KB Output is correct
56 Correct 654 ms 138348 KB Output is correct
57 Correct 678 ms 125656 KB Output is correct
58 Correct 722 ms 139740 KB Output is correct
59 Correct 727 ms 147700 KB Output is correct
60 Correct 702 ms 128600 KB Output is correct
61 Correct 185 ms 65264 KB Output is correct
62 Correct 781 ms 166788 KB Output is correct
63 Correct 782 ms 158240 KB Output is correct
64 Correct 763 ms 154440 KB Output is correct
65 Correct 755 ms 144992 KB Output is correct
66 Correct 738 ms 128856 KB Output is correct
67 Correct 248 ms 74880 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 42624 KB Output is correct
2 Correct 30 ms 42624 KB Output is correct
3 Correct 30 ms 42624 KB Output is correct
4 Correct 34 ms 42620 KB Output is correct
5 Correct 30 ms 42752 KB Output is correct
6 Correct 31 ms 43000 KB Output is correct
7 Correct 36 ms 43136 KB Output is correct
8 Correct 31 ms 43060 KB Output is correct
9 Correct 33 ms 43136 KB Output is correct
10 Correct 40 ms 43112 KB Output is correct
11 Correct 30 ms 43004 KB Output is correct
12 Correct 32 ms 42860 KB Output is correct
13 Correct 32 ms 42880 KB Output is correct
14 Correct 31 ms 42872 KB Output is correct
15 Correct 33 ms 43000 KB Output is correct
16 Correct 32 ms 43008 KB Output is correct
17 Correct 30 ms 43000 KB Output is correct
18 Correct 36 ms 43000 KB Output is correct
19 Correct 31 ms 43136 KB Output is correct
20 Correct 39 ms 43008 KB Output is correct
21 Correct 30 ms 42752 KB Output is correct
22 Correct 39 ms 43128 KB Output is correct
23 Correct 39 ms 43132 KB Output is correct
24 Correct 30 ms 43128 KB Output is correct
25 Correct 30 ms 43008 KB Output is correct
26 Correct 30 ms 42880 KB Output is correct
27 Correct 37 ms 42880 KB Output is correct
28 Correct 29 ms 42880 KB Output is correct
29 Correct 34 ms 42872 KB Output is correct
30 Correct 28 ms 42880 KB Output is correct
31 Correct 779 ms 143148 KB Output is correct
32 Correct 112 ms 53256 KB Output is correct
33 Correct 744 ms 136620 KB Output is correct
34 Correct 718 ms 136912 KB Output is correct
35 Correct 751 ms 142412 KB Output is correct
36 Correct 751 ms 142188 KB Output is correct
37 Correct 591 ms 127084 KB Output is correct
38 Correct 591 ms 126948 KB Output is correct
39 Correct 475 ms 112548 KB Output is correct
40 Correct 500 ms 116424 KB Output is correct
41 Correct 666 ms 123232 KB Output is correct
42 Correct 682 ms 124068 KB Output is correct
43 Correct 99 ms 51192 KB Output is correct
44 Correct 682 ms 123248 KB Output is correct
45 Correct 679 ms 114040 KB Output is correct
46 Correct 585 ms 98380 KB Output is correct
47 Correct 399 ms 96748 KB Output is correct
48 Correct 391 ms 92600 KB Output is correct
49 Correct 437 ms 103276 KB Output is correct
50 Correct 504 ms 121176 KB Output is correct
51 Correct 442 ms 98800 KB Output is correct
52 Correct 2312 ms 395524 KB Output is correct
53 Correct 2147 ms 382768 KB Output is correct
54 Correct 2866 ms 585108 KB Output is correct
55 Correct 2419 ms 438808 KB Output is correct
56 Correct 2231 ms 398316 KB Output is correct
57 Correct 2144 ms 393076 KB Output is correct
58 Correct 2680 ms 595708 KB Output is correct
59 Correct 2328 ms 435772 KB Output is correct
60 Correct 2225 ms 388968 KB Output is correct
61 Correct 2111 ms 377396 KB Output is correct
62 Correct 1545 ms 359088 KB Output is correct
63 Correct 1667 ms 396396 KB Output is correct
64 Correct 3529 ms 490376 KB Output is correct
65 Correct 419 ms 99272 KB Output is correct
66 Correct 3562 ms 497916 KB Output is correct
67 Correct 4136 ms 688956 KB Output is correct
68 Correct 3646 ms 512900 KB Output is correct
69 Correct 3763 ms 543940 KB Output is correct
70 Correct 3674 ms 476620 KB Output is correct
71 Correct 3535 ms 488212 KB Output is correct
72 Correct 3864 ms 707004 KB Output is correct
73 Correct 3613 ms 535268 KB Output is correct
74 Correct 3527 ms 513892 KB Output is correct
75 Correct 3468 ms 480424 KB Output is correct
76 Correct 2000 ms 449412 KB Output is correct
77 Correct 1993 ms 438284 KB Output is correct
78 Correct 2227 ms 454084 KB Output is correct
79 Correct 2479 ms 461960 KB Output is correct
80 Correct 2459 ms 452236 KB Output is correct
81 Correct 855 ms 171220 KB Output is correct
82 Correct 830 ms 160480 KB Output is correct
83 Correct 781 ms 151644 KB Output is correct
84 Correct 680 ms 134728 KB Output is correct
85 Correct 654 ms 138348 KB Output is correct
86 Correct 678 ms 125656 KB Output is correct
87 Correct 722 ms 139740 KB Output is correct
88 Correct 727 ms 147700 KB Output is correct
89 Correct 702 ms 128600 KB Output is correct
90 Correct 185 ms 65264 KB Output is correct
91 Correct 781 ms 166788 KB Output is correct
92 Correct 782 ms 158240 KB Output is correct
93 Correct 763 ms 154440 KB Output is correct
94 Correct 755 ms 144992 KB Output is correct
95 Correct 738 ms 128856 KB Output is correct
96 Correct 248 ms 74880 KB Output is correct
97 Execution timed out 5135 ms 778512 KB Time limit exceeded
98 Halted 0 ms 0 KB -