oj.uz

Submission #295123

# Submission time Handle Problem Language Result Execution time Memory
295123 2020-09-09T13:36:01 Z CaroLinda New Home (APIO18_new_home) C++14
80 / 100
 5000 ms 853144 KB 
#include <bits/stdc++.h>

static struct FASTIO {

  char READ_CHARACTER; bool REMAINING_CHARACTER = false;

  inline void ignore(); inline void flush();

  template <typename T> inline bool READ_INT(T &x); template <typename T> inline bool READ_STRING(T &x);
  /*                                                          Fast I/O Code Optimizer                                                          */
  template<size_t N> inline bool READ_CHAR_ARRAY(char (&x)[N]); template<size_t N> inline bool READ_VAR(char (&x)[N]);
  /*                    A tool to optimize execution time of C++ codes by replacing methods of reading and writing variables                   */
  template <typename T> inline bool READ_CHAR(T &x); inline bool READ_CHAR_ARRAY(char*& x); inline bool READ_GETLINE(std::string &x);
  /*                                                    Use it on fastio.pythonanywhere.com                                                    */
  template <typename T> inline bool READ_FLOAT(T &x); template <typename T> inline bool READ_DOUBLE(T &x);
  /*                                          Github Project: github.com/bfs07/Fast-IO-Code-Optimizer                                          */
  template<std::size_t N> inline bool READ_BITSET(std::bitset<N> &bit); template<std::size_t N> inline bool READ_VAR(std::bitset<N> &bit);
  inline bool READ_VAR(bool &x); inline bool READ_VAR(short int &x); inline bool READ_VAR(int &x); 
  inline bool READ_VAR(long int &x); inline bool READ_VAR(long long int &x); inline bool READ_VAR(unsigned short int &x);
  inline bool READ_VAR(unsigned int &x); inline bool READ_VAR(unsigned long &x); inline bool READ_VAR(unsigned long long &x);
  inline bool READ_VAR(std::string &x); inline bool READ_VAR(char &x); inline bool READ_VAR(char*& x); inline bool READ_VAR(float &x);
  inline bool READ_VAR(double &x); inline bool READ_VAR(long double &x); template <typename T> inline void WRITE_INT(T x);
  inline void WRITE_STRING(std::string &x); inline void WRITE_CHAR(char x); inline void WRITE_CHAR_ARRAY(const char *x);
  inline void WRITE_FLOAT(float x); template <typename T> inline void WRITE_DOUBLE(T x); inline void WRITE_VAR(bool x);
  inline void WRITE_VAR(short int x); inline void WRITE_VAR(int x); inline void WRITE_VAR(long int x); inline void WRITE_VAR(long long int x);
  inline void WRITE_VAR(unsigned short int x); inline void WRITE_VAR(unsigned int x); inline void WRITE_VAR(unsigned long x);
  inline void WRITE_VAR(unsigned long long x); inline void WRITE_VAR(char x); inline void WRITE_VAR(const char *x); 
  inline void WRITE_VAR(std::string &x); inline void WRITE_VAR(float x); inline void WRITE_VAR(double x); inline void WRITE_VAR(long double x);
  template<std::size_t N> inline void WRITE_VAR(std::bitset<N> &bit); template<std::size_t N> inline void WRITE_BITSET(std::bitset<N> &bit);

} __FIO__;


#include <bits/stdc++.h>

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
 
#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  
#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 ;

 
 

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

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 ) ;
        myStores[t].pb( mkt(x,a,b) ) ;
        compressionX.pb(x) ;
    }

    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 )
                {
                    myVecOfTuples.pb( mkt( mnTime , -i , compressionX[X] ) ) ;
                    myVecOfTuples.pb( mkt( mxTime , i , compressionX[X] ) ) ;

                    mnTime = coordX[X][g].ff ;
                    mxTime = coordX[X][g].ss ;
                }
                else mxTime = max(mxTime, coordX[X][g].ss ) ;
            }

            coordX[X].clear() ;

        }

    }

    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) ;
    }

     
    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) ;
    

    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] ) ;

}

 


#undef lp
#undef sz
#undef all
#undef lp
#undef pb
#undef sz
#undef all
#undef debug
#undef tiii
#undef mkt
#undef pii
#undef mk
#undef ll
#undef ff
#undef ss

inline void FASTIO::ignore() {
  if(REMAINING_CHARACTER == true) REMAINING_CHARACTER = false; else READ_CHARACTER = getchar();
}

inline void FASTIO::flush() {
  fflush(stdout);
}

// cin modifications

template <typename T>
inline bool FASTIO::READ_INT(T &x) {
  x = 0; T sig = 1;
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  while (!isdigit(READ_CHARACTER) && READ_CHARACTER != EOF) sig = (READ_CHARACTER == '-' ? -sig : sig), READ_CHARACTER = getchar();
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  while (isdigit(READ_CHARACTER)) x = x * 10 + READ_CHARACTER - '0', READ_CHARACTER = getchar();
  x *= sig; REMAINING_CHARACTER = true;
  return true;
}

template <typename T>
inline bool FASTIO::READ_STRING(T &x) {
  x = "";
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = getchar();
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  while ((READ_CHARACTER != '\n' && READ_CHARACTER != '\t' && READ_CHARACTER != ' ' && READ_CHARACTER != EOF)) x += READ_CHARACTER, READ_CHARACTER = getchar();
  REMAINING_CHARACTER = true;
  return true;
}

inline bool FASTIO::READ_GETLINE(std::string &x) {
  x = "";
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  while ((READ_CHARACTER != '\n' && READ_CHARACTER != EOF)) x += READ_CHARACTER, READ_CHARACTER = getchar();
  REMAINING_CHARACTER = false;
  return true;
}

template <typename T>
inline bool FASTIO::READ_CHAR(T &x) {
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = getchar();
  x = READ_CHARACTER; REMAINING_CHARACTER = false;
  return true;
}


template<size_t N>
inline bool FASTIO::READ_CHAR_ARRAY(char (&x)[N]) {
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = getchar();
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  char *ptr = &x[0];
  while ((READ_CHARACTER != '\n' && READ_CHARACTER != '\t' && READ_CHARACTER != ' ' && READ_CHARACTER != EOF)) *ptr++ = READ_CHARACTER, READ_CHARACTER = getchar();
  *ptr = '\0', REMAINING_CHARACTER = true;
  return true;
}

inline bool FASTIO::READ_CHAR_ARRAY(char*& x) {
  std::string y;
  if(READ_STRING(y) == false)
    return false;
  x = new char[(int)y.size() + 1];
  strcpy(x, y.c_str());
  return true;
}

template <typename T>
inline bool FASTIO::READ_FLOAT(T &x) {
  return (scanf("%f", &x) != EOF);
}

template <typename T>
inline bool FASTIO::READ_DOUBLE(T &x) {
  double y;
  if(scanf("%lf", &y) == EOF) return false;
  x = y;
  return true;
}

template<std::size_t N>
inline bool FASTIO::READ_BITSET(std::bitset<N> &x) {
  if(!REMAINING_CHARACTER) READ_CHARACTER = getchar(), REMAINING_CHARACTER = true; else REMAINING_CHARACTER = false;
  while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = getchar();
  if(READ_CHARACTER == EOF) return REMAINING_CHARACTER = false, false;
  int i = 0; REMAINING_CHARACTER = true;
  while (READ_CHARACTER == '0' || READ_CHARACTER == '1') x[i++] = READ_CHARACTER - '0', READ_CHARACTER = getchar();
  return true;
}

inline bool FASTIO::READ_VAR(short int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(long int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(long long int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(unsigned short int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(unsigned int &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(unsigned long &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(unsigned long long &x) {
  return READ_INT(x);    
}

inline bool FASTIO::READ_VAR(std::string &x) {
  return READ_STRING(x);    
}

inline bool FASTIO::READ_VAR(char &x) {
  return READ_CHAR(x);
}

template<size_t N>
inline bool FASTIO::READ_VAR(char (&x)[N]) {
  return READ_CHAR_ARRAY(x);
}

inline bool FASTIO::READ_VAR(char*& x) {
  return READ_CHAR_ARRAY(x);
}

inline bool FASTIO::READ_VAR(float &x) {
  return READ_FLOAT(x);
}

inline bool FASTIO::READ_VAR(double &x) {
  return READ_DOUBLE(x);
}

inline bool FASTIO::READ_VAR(long double &x) {
  return READ_DOUBLE(x);
}

template<std::size_t N>
inline bool FASTIO::READ_VAR(std::bitset<N> &x) {
  return READ_BITSET(x);
}

// cout modifications

template <typename T>
inline void FASTIO::WRITE_INT(T x) {
  if (x < 0) {putchar('-'); x = -x; }
  char writeBuffer[20], *writePtr = writeBuffer;
  do {
    *writePtr++ = '0' + x % 10;
    x /= 10;
  }
  while (x);
  do  { putchar(*--writePtr); }
  while (writePtr > writeBuffer);
}

inline void FASTIO::WRITE_CHAR(char x) {
  putchar(x);
}

inline void FASTIO::WRITE_CHAR_ARRAY(const char *x) {
  while(*x != '\0')
    putchar(*x++);
}

inline void FASTIO::WRITE_STRING(std::string &x) {
  for(char c: x) 
    putchar(c);
}

inline void FASTIO::WRITE_FLOAT(float x) {
  printf("%f", x);
}

template <typename T>
inline void FASTIO::WRITE_DOUBLE(T x) {
  printf("%lf", (double)x);
}

template<std::size_t N>
inline void FASTIO::WRITE_BITSET(std::bitset<N> &x) {
  for(int i = (int)x.size() - 1; i >= 0; i--)
    putchar(x[i] + 48);
}

inline void FASTIO::WRITE_VAR(bool x) {
  WRITE_INT(x);
}

inline void FASTIO::WRITE_VAR(short int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(long int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(long long int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(unsigned short int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(unsigned int x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(unsigned long x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(unsigned long long x) {
  WRITE_INT(x);    
}

inline void FASTIO::WRITE_VAR(std::string &x) {
  WRITE_STRING(x);    
}

inline void FASTIO::WRITE_VAR(char x) {
  WRITE_CHAR(x);
}

inline void FASTIO::WRITE_VAR(const char *x) {
  WRITE_CHAR_ARRAY(x);
}

inline void FASTIO::WRITE_VAR(float x) {
  WRITE_FLOAT(x);
}

inline void FASTIO::WRITE_VAR(double x) {
  WRITE_DOUBLE(x);
}

inline void FASTIO::WRITE_VAR(long double x) {
  WRITE_DOUBLE(x);
}

template<std::size_t N>
inline void FASTIO::WRITE_VAR(std::bitset<N> &x) {
  WRITE_BITSET(x);
}

Compilation message

new_home.cpp: In instantiation of 'void FASTIO::WRITE_INT(T) [with T = bool]':
new_home.cpp:616:14:   required from here
new_home.cpp:575:9: warning: comparison of constant '0' with boolean expression is always false [-Wbool-compare]
  575 |   if (x < 0) {putchar('-'); x = -x; }
      |       ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:256:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  256 |     scanf("%d%d%d", &N , &K , &Q ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:268:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  268 |         scanf("%d%d%d%d", &x, &t, &a, &b ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:347:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  347 |         scanf("%d%d", &l, &y ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~
new_home.cpp:283:52: warning: 'mid' may be used uninitialized in this function [-Wmaybe-uninitialized]
  283 |             int l = 0 , r = sz(compressionX) - 1 , mid ;
      |                                                    ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 41 ms 56772 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 36 ms 56704 KB Output is correct
5 Correct 41 ms 56824 KB Output is correct
6 Correct 42 ms 57088 KB Output is correct
7 Correct 48 ms 57208 KB Output is correct
8 Correct 44 ms 57336 KB Output is correct
9 Correct 44 ms 57208 KB Output is correct
10 Correct 55 ms 57080 KB Output is correct
11 Correct 45 ms 57080 KB Output is correct
12 Correct 42 ms 56960 KB Output is correct
13 Correct 44 ms 56948 KB Output is correct
14 Correct 42 ms 56952 KB Output is correct
15 Correct 43 ms 57144 KB Output is correct
16 Correct 42 ms 57080 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 44 ms 57208 KB Output is correct
20 Correct 47 ms 57080 KB Output is correct
21 Correct 41 ms 56952 KB Output is correct
22 Correct 43 ms 57216 KB Output is correct
23 Correct 44 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 41 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 43 ms 56952 KB Output is correct
28 Correct 45 ms 56952 KB Output is correct
29 Correct 40 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 41 ms 56772 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 36 ms 56704 KB Output is correct
5 Correct 41 ms 56824 KB Output is correct
6 Correct 42 ms 57088 KB Output is correct
7 Correct 48 ms 57208 KB Output is correct
8 Correct 44 ms 57336 KB Output is correct
9 Correct 44 ms 57208 KB Output is correct
10 Correct 55 ms 57080 KB Output is correct
11 Correct 45 ms 57080 KB Output is correct
12 Correct 42 ms 56960 KB Output is correct
13 Correct 44 ms 56948 KB Output is correct
14 Correct 42 ms 56952 KB Output is correct
15 Correct 43 ms 57144 KB Output is correct
16 Correct 42 ms 57080 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 44 ms 57208 KB Output is correct
20 Correct 47 ms 57080 KB Output is correct
21 Correct 41 ms 56952 KB Output is correct
22 Correct 43 ms 57216 KB Output is correct
23 Correct 44 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 41 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 43 ms 56952 KB Output is correct
28 Correct 45 ms 56952 KB Output is correct
29 Correct 40 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 983 ms 155012 KB Output is correct
32 Correct 114 ms 66568 KB Output is correct
33 Correct 932 ms 148560 KB Output is correct
34 Correct 871 ms 149096 KB Output is correct
35 Correct 993 ms 154828 KB Output is correct
36 Correct 1041 ms 153960 KB Output is correct
37 Correct 724 ms 138796 KB Output is correct
38 Correct 768 ms 138680 KB Output is correct
39 Correct 589 ms 124104 KB Output is correct
40 Correct 641 ms 127956 KB Output is correct
41 Correct 749 ms 135172 KB Output is correct
42 Correct 821 ms 135952 KB Output is correct
43 Correct 113 ms 63112 KB Output is correct
44 Correct 737 ms 135060 KB Output is correct
45 Correct 745 ms 125748 KB Output is correct
46 Correct 645 ms 110040 KB Output is correct
47 Correct 451 ms 108664 KB Output is correct
48 Correct 434 ms 104288 KB Output is correct
49 Correct 487 ms 115088 KB Output is correct
50 Correct 561 ms 133044 KB Output is correct
51 Correct 481 ms 110596 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2764 ms 417708 KB Output is correct
2 Correct 2794 ms 389024 KB Output is correct
3 Correct 3142 ms 637776 KB Output is correct
4 Correct 2769 ms 451332 KB Output is correct
5 Correct 2926 ms 400460 KB Output is correct
6 Correct 2933 ms 395576 KB Output is correct
7 Correct 3275 ms 659548 KB Output is correct
8 Correct 2789 ms 447984 KB Output is correct
9 Correct 2646 ms 394084 KB Output is correct
10 Correct 2657 ms 381280 KB Output is correct
11 Correct 2187 ms 362856 KB Output is correct
12 Correct 2166 ms 400196 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4320 ms 504344 KB Output is correct
2 Correct 418 ms 109732 KB Output is correct
3 Correct 4874 ms 501748 KB Output is correct
4 Correct 4986 ms 758576 KB Output is correct
5 Correct 4379 ms 536916 KB Output is correct
6 Correct 4415 ms 571964 KB Output is correct
7 Correct 4990 ms 488280 KB Output is correct
8 Correct 4866 ms 504564 KB Output is correct
9 Correct 4545 ms 776376 KB Output is correct
10 Correct 4314 ms 560448 KB Output is correct
11 Correct 4300 ms 533280 KB Output is correct
12 Correct 4701 ms 497544 KB Output is correct
13 Correct 2791 ms 465740 KB Output is correct
14 Correct 2962 ms 458496 KB Output is correct
15 Correct 3139 ms 475664 KB Output is correct
16 Correct 3199 ms 484080 KB Output is correct
17 Correct 3279 ms 473592 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 41 ms 56772 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 36 ms 56704 KB Output is correct
5 Correct 41 ms 56824 KB Output is correct
6 Correct 42 ms 57088 KB Output is correct
7 Correct 48 ms 57208 KB Output is correct
8 Correct 44 ms 57336 KB Output is correct
9 Correct 44 ms 57208 KB Output is correct
10 Correct 55 ms 57080 KB Output is correct
11 Correct 45 ms 57080 KB Output is correct
12 Correct 42 ms 56960 KB Output is correct
13 Correct 44 ms 56948 KB Output is correct
14 Correct 42 ms 56952 KB Output is correct
15 Correct 43 ms 57144 KB Output is correct
16 Correct 42 ms 57080 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 44 ms 57208 KB Output is correct
20 Correct 47 ms 57080 KB Output is correct
21 Correct 41 ms 56952 KB Output is correct
22 Correct 43 ms 57216 KB Output is correct
23 Correct 44 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 41 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 43 ms 56952 KB Output is correct
28 Correct 45 ms 56952 KB Output is correct
29 Correct 40 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 983 ms 155012 KB Output is correct
32 Correct 114 ms 66568 KB Output is correct
33 Correct 932 ms 148560 KB Output is correct
34 Correct 871 ms 149096 KB Output is correct
35 Correct 993 ms 154828 KB Output is correct
36 Correct 1041 ms 153960 KB Output is correct
37 Correct 724 ms 138796 KB Output is correct
38 Correct 768 ms 138680 KB Output is correct
39 Correct 589 ms 124104 KB Output is correct
40 Correct 641 ms 127956 KB Output is correct
41 Correct 749 ms 135172 KB Output is correct
42 Correct 821 ms 135952 KB Output is correct
43 Correct 113 ms 63112 KB Output is correct
44 Correct 737 ms 135060 KB Output is correct
45 Correct 745 ms 125748 KB Output is correct
46 Correct 645 ms 110040 KB Output is correct
47 Correct 451 ms 108664 KB Output is correct
48 Correct 434 ms 104288 KB Output is correct
49 Correct 487 ms 115088 KB Output is correct
50 Correct 561 ms 133044 KB Output is correct
51 Correct 481 ms 110596 KB Output is correct
52 Correct 949 ms 196272 KB Output is correct
53 Correct 917 ms 185208 KB Output is correct
54 Correct 917 ms 168516 KB Output is correct
55 Correct 733 ms 151056 KB Output is correct
56 Correct 745 ms 156492 KB Output is correct
57 Correct 732 ms 140304 KB Output is correct
58 Correct 795 ms 156284 KB Output is correct
59 Correct 834 ms 166292 KB Output is correct
60 Correct 769 ms 143884 KB Output is correct
61 Correct 265 ms 97120 KB Output is correct
62 Correct 901 ms 192032 KB Output is correct
63 Correct 895 ms 176652 KB Output is correct
64 Correct 866 ms 170508 KB Output is correct
65 Correct 824 ms 160148 KB Output is correct
66 Correct 747 ms 143628 KB Output is correct
67 Correct 314 ms 91476 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 56696 KB Output is correct
2 Correct 41 ms 56772 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 36 ms 56704 KB Output is correct
5 Correct 41 ms 56824 KB Output is correct
6 Correct 42 ms 57088 KB Output is correct
7 Correct 48 ms 57208 KB Output is correct
8 Correct 44 ms 57336 KB Output is correct
9 Correct 44 ms 57208 KB Output is correct
10 Correct 55 ms 57080 KB Output is correct
11 Correct 45 ms 57080 KB Output is correct
12 Correct 42 ms 56960 KB Output is correct
13 Correct 44 ms 56948 KB Output is correct
14 Correct 42 ms 56952 KB Output is correct
15 Correct 43 ms 57144 KB Output is correct
16 Correct 42 ms 57080 KB Output is correct
17 Correct 41 ms 57088 KB Output is correct
18 Correct 41 ms 57088 KB Output is correct
19 Correct 44 ms 57208 KB Output is correct
20 Correct 47 ms 57080 KB Output is correct
21 Correct 41 ms 56952 KB Output is correct
22 Correct 43 ms 57216 KB Output is correct
23 Correct 44 ms 57208 KB Output is correct
24 Correct 42 ms 57208 KB Output is correct
25 Correct 41 ms 57088 KB Output is correct
26 Correct 42 ms 56952 KB Output is correct
27 Correct 43 ms 56952 KB Output is correct
28 Correct 45 ms 56952 KB Output is correct
29 Correct 40 ms 56952 KB Output is correct
30 Correct 40 ms 56952 KB Output is correct
31 Correct 983 ms 155012 KB Output is correct
32 Correct 114 ms 66568 KB Output is correct
33 Correct 932 ms 148560 KB Output is correct
34 Correct 871 ms 149096 KB Output is correct
35 Correct 993 ms 154828 KB Output is correct
36 Correct 1041 ms 153960 KB Output is correct
37 Correct 724 ms 138796 KB Output is correct
38 Correct 768 ms 138680 KB Output is correct
39 Correct 589 ms 124104 KB Output is correct
40 Correct 641 ms 127956 KB Output is correct
41 Correct 749 ms 135172 KB Output is correct
42 Correct 821 ms 135952 KB Output is correct
43 Correct 113 ms 63112 KB Output is correct
44 Correct 737 ms 135060 KB Output is correct
45 Correct 745 ms 125748 KB Output is correct
46 Correct 645 ms 110040 KB Output is correct
47 Correct 451 ms 108664 KB Output is correct
48 Correct 434 ms 104288 KB Output is correct
49 Correct 487 ms 115088 KB Output is correct
50 Correct 561 ms 133044 KB Output is correct
51 Correct 481 ms 110596 KB Output is correct
52 Correct 2764 ms 417708 KB Output is correct
53 Correct 2794 ms 389024 KB Output is correct
54 Correct 3142 ms 637776 KB Output is correct
55 Correct 2769 ms 451332 KB Output is correct
56 Correct 2926 ms 400460 KB Output is correct
57 Correct 2933 ms 395576 KB Output is correct
58 Correct 3275 ms 659548 KB Output is correct
59 Correct 2789 ms 447984 KB Output is correct
60 Correct 2646 ms 394084 KB Output is correct
61 Correct 2657 ms 381280 KB Output is correct
62 Correct 2187 ms 362856 KB Output is correct
63 Correct 2166 ms 400196 KB Output is correct
64 Correct 4320 ms 504344 KB Output is correct
65 Correct 418 ms 109732 KB Output is correct
66 Correct 4874 ms 501748 KB Output is correct
67 Correct 4986 ms 758576 KB Output is correct
68 Correct 4379 ms 536916 KB Output is correct
69 Correct 4415 ms 571964 KB Output is correct
70 Correct 4990 ms 488280 KB Output is correct
71 Correct 4866 ms 504564 KB Output is correct
72 Correct 4545 ms 776376 KB Output is correct
73 Correct 4314 ms 560448 KB Output is correct
74 Correct 4300 ms 533280 KB Output is correct
75 Correct 4701 ms 497544 KB Output is correct
76 Correct 2791 ms 465740 KB Output is correct
77 Correct 2962 ms 458496 KB Output is correct
78 Correct 3139 ms 475664 KB Output is correct
79 Correct 3199 ms 484080 KB Output is correct
80 Correct 3279 ms 473592 KB Output is correct
81 Correct 949 ms 196272 KB Output is correct
82 Correct 917 ms 185208 KB Output is correct
83 Correct 917 ms 168516 KB Output is correct
84 Correct 733 ms 151056 KB Output is correct
85 Correct 745 ms 156492 KB Output is correct
86 Correct 732 ms 140304 KB Output is correct
87 Correct 795 ms 156284 KB Output is correct
88 Correct 834 ms 166292 KB Output is correct
89 Correct 769 ms 143884 KB Output is correct
90 Correct 265 ms 97120 KB Output is correct
91 Correct 901 ms 192032 KB Output is correct
92 Correct 895 ms 176652 KB Output is correct
93 Correct 866 ms 170508 KB Output is correct
94 Correct 824 ms 160148 KB Output is correct
95 Correct 747 ms 143628 KB Output is correct
96 Correct 314 ms 91476 KB Output is correct
97 Execution timed out 5135 ms 853144 KB Time limit exceeded
98 Halted 0 ms 0 KB -