oj.uz

답안 #294998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294998 2020-09-09T11:53:34 Z CaroLinda 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 544588 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>

#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 = 6e5+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
{

    vector<Event> tree[MAXN*2] ;

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

    void insertEvent(int a, int b, int c, int t1, int t2,  Event e)
    {

        vector< tiii > vec ;
        vec.pb( mkt(a,b,c) ) ;
        int ini = 0 ;

        while(ini < sz(vec))
        {

            int pos = get<0>( vec[ini] ) ;
            int l = get<1>( vec[ini] ) ;
            int r = get<2>( vec[ini] );
            ini++ ;

            if( l > t2 || r < t1 ) continue ;

            if(e.type > 0 && !(l >= t1 && r <= t2) ) tree[pos].pb(e) ;
            if(l >= t1 && r <= t2) tree[pos].pb(e) ;
            else
            {
                vec.pb( mkt(pos+1, l,m(l,r)) ) ;
                vec.pb( mkt( pos + ( m(l,r)-l+1 )*2 , m(l,r)+1, r ) ) ;
            }

        }

    }

    void solve(int a, int b, int c , int forbiddenType )
    {

        vector< tiii > vec ;
        vec.pb( mkt(a,b,c) ) ;
        int ini = 0 ;

        while(ini < sz(vec))
        {
            int pos = get<0>(vec[ini]) ;
            int l = get<1>( vec[ini] ) ;
            int r = get<2>( vec[ini] ) ;
            ini++ ;

            int mxNegative = -MAXT , mnPositive = MAXT ;

            for(auto e : tree[pos])
            {
                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 ) ;
                }
            }

            if(l == r) continue ;

            vec.pb( mkt(pos+1, l , m(l,r)) );
            vec.pb( mkt(pos+2*( m(l,r)-l+1 ) , m(l,r)+1, r ) ) ;

        }

    }

} seg ;

 
 

int N , K , Q ;
vector< tiii > myVecOfTuples ;
set<int> store[MAXN] ;
map< pii , int > segments[MAXN] ;
vector<Event> sweep ;
map<int,int> compressionTime ;
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 ][ mk(midPointL, *itLess) ] = clock ;
        segments[type][ 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 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) );
    }

    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 )
    {
        if( compressionTime.find( e.t1 ) == compressionTime.end() )
            compressionTime[e.t1] = 0 ;

        if( compressionTime.find( e.t2 ) == compressionTime.end() )
            compressionTime[e.t2] = 0 ;

    }
    int Key = 1 ;
    for(auto &e : compressionTime ) e.ss = Key++ ;

    for(auto e : sweep )
    {
        if(e.type == 0) continue ;
        seg.insertEvent( 1 , 1 , sz(compressionTime) , compressionTime[e.t1] , compressionTime[e.t2] , e ) ;
    }

    seg.solve(1,1, sz(compressionTime) , 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*MAXN ; i++ ) seg.tree[i].clear() ;

    for(auto e : sweep )
    {
        if(e.type == -1) continue ;
        seg.insertEvent( 1 , 1 , sz(compressionTime) , compressionTime[e.t1] , compressionTime[e.t2] , e ) ;
    }

    seg.solve(1,1, sz(compressionTime) , -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:567:14:   required from here
new_home.cpp:526:9: warning: comparison of constant '0' with boolean expression is always false [-Wbool-compare]
  526 |   if (x < 0) {putchar('-'); x = -x; }
      |       ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:228:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  228 |     scanf("%d%d%d", &N , &K , &Q ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:240:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  240 |         scanf("%d%d%d%d", &x, &t, &a, &b ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:292:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  292 |         scanf("%d%d", &l, &y ) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 113112 KB Output is correct
2 Correct 79 ms 113016 KB Output is correct
3 Correct 81 ms 113016 KB Output is correct
4 Correct 79 ms 113144 KB Output is correct
5 Correct 81 ms 113144 KB Output is correct
6 Correct 90 ms 113912 KB Output is correct
7 Correct 90 ms 113912 KB Output is correct
8 Correct 100 ms 113784 KB Output is correct
9 Correct 109 ms 113912 KB Output is correct
10 Correct 86 ms 113784 KB Output is correct
11 Correct 86 ms 113784 KB Output is correct
12 Correct 87 ms 113656 KB Output is correct
13 Correct 85 ms 113656 KB Output is correct
14 Correct 84 ms 113660 KB Output is correct
15 Correct 98 ms 113784 KB Output is correct
16 Correct 87 ms 113784 KB Output is correct
17 Correct 89 ms 113728 KB Output is correct
18 Correct 89 ms 113784 KB Output is correct
19 Correct 88 ms 113872 KB Output is correct
20 Correct 87 ms 113708 KB Output is correct
21 Correct 89 ms 113528 KB Output is correct
22 Correct 88 ms 113912 KB Output is correct
23 Correct 89 ms 113912 KB Output is correct
24 Correct 97 ms 113784 KB Output is correct
25 Correct 87 ms 113784 KB Output is correct
26 Correct 90 ms 113656 KB Output is correct
27 Correct 84 ms 113400 KB Output is correct
28 Correct 105 ms 113660 KB Output is correct
29 Correct 87 ms 113608 KB Output is correct
30 Correct 90 ms 113524 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 113112 KB Output is correct
2 Correct 79 ms 113016 KB Output is correct
3 Correct 81 ms 113016 KB Output is correct
4 Correct 79 ms 113144 KB Output is correct
5 Correct 81 ms 113144 KB Output is correct
6 Correct 90 ms 113912 KB Output is correct
7 Correct 90 ms 113912 KB Output is correct
8 Correct 100 ms 113784 KB Output is correct
9 Correct 109 ms 113912 KB Output is correct
10 Correct 86 ms 113784 KB Output is correct
11 Correct 86 ms 113784 KB Output is correct
12 Correct 87 ms 113656 KB Output is correct
13 Correct 85 ms 113656 KB Output is correct
14 Correct 84 ms 113660 KB Output is correct
15 Correct 98 ms 113784 KB Output is correct
16 Correct 87 ms 113784 KB Output is correct
17 Correct 89 ms 113728 KB Output is correct
18 Correct 89 ms 113784 KB Output is correct
19 Correct 88 ms 113872 KB Output is correct
20 Correct 87 ms 113708 KB Output is correct
21 Correct 89 ms 113528 KB Output is correct
22 Correct 88 ms 113912 KB Output is correct
23 Correct 89 ms 113912 KB Output is correct
24 Correct 97 ms 113784 KB Output is correct
25 Correct 87 ms 113784 KB Output is correct
26 Correct 90 ms 113656 KB Output is correct
27 Correct 84 ms 113400 KB Output is correct
28 Correct 105 ms 113660 KB Output is correct
29 Correct 87 ms 113608 KB Output is correct
30 Correct 90 ms 113524 KB Output is correct
31 Correct 4058 ms 267344 KB Output is correct
32 Correct 194 ms 123632 KB Output is correct
33 Correct 3428 ms 255616 KB Output is correct
34 Correct 3646 ms 255804 KB Output is correct
35 Correct 3750 ms 267076 KB Output is correct
36 Correct 3633 ms 266884 KB Output is correct
37 Correct 2437 ms 246332 KB Output is correct
38 Correct 2316 ms 246208 KB Output is correct
39 Correct 1655 ms 233304 KB Output is correct
40 Correct 1787 ms 235900 KB Output is correct
41 Correct 3190 ms 239352 KB Output is correct
42 Correct 3388 ms 240444 KB Output is correct
43 Correct 167 ms 119996 KB Output is correct
44 Correct 3203 ms 239056 KB Output is correct
45 Correct 3204 ms 231036 KB Output is correct
46 Correct 2870 ms 216136 KB Output is correct
47 Correct 1450 ms 214972 KB Output is correct
48 Correct 1416 ms 209896 KB Output is correct
49 Correct 1605 ms 221228 KB Output is correct
50 Correct 1732 ms 238716 KB Output is correct
51 Correct 1581 ms 216220 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5091 ms 544588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3997 ms 498944 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 113112 KB Output is correct
2 Correct 79 ms 113016 KB Output is correct
3 Correct 81 ms 113016 KB Output is correct
4 Correct 79 ms 113144 KB Output is correct
5 Correct 81 ms 113144 KB Output is correct
6 Correct 90 ms 113912 KB Output is correct
7 Correct 90 ms 113912 KB Output is correct
8 Correct 100 ms 113784 KB Output is correct
9 Correct 109 ms 113912 KB Output is correct
10 Correct 86 ms 113784 KB Output is correct
11 Correct 86 ms 113784 KB Output is correct
12 Correct 87 ms 113656 KB Output is correct
13 Correct 85 ms 113656 KB Output is correct
14 Correct 84 ms 113660 KB Output is correct
15 Correct 98 ms 113784 KB Output is correct
16 Correct 87 ms 113784 KB Output is correct
17 Correct 89 ms 113728 KB Output is correct
18 Correct 89 ms 113784 KB Output is correct
19 Correct 88 ms 113872 KB Output is correct
20 Correct 87 ms 113708 KB Output is correct
21 Correct 89 ms 113528 KB Output is correct
22 Correct 88 ms 113912 KB Output is correct
23 Correct 89 ms 113912 KB Output is correct
24 Correct 97 ms 113784 KB Output is correct
25 Correct 87 ms 113784 KB Output is correct
26 Correct 90 ms 113656 KB Output is correct
27 Correct 84 ms 113400 KB Output is correct
28 Correct 105 ms 113660 KB Output is correct
29 Correct 87 ms 113608 KB Output is correct
30 Correct 90 ms 113524 KB Output is correct
31 Correct 4058 ms 267344 KB Output is correct
32 Correct 194 ms 123632 KB Output is correct
33 Correct 3428 ms 255616 KB Output is correct
34 Correct 3646 ms 255804 KB Output is correct
35 Correct 3750 ms 267076 KB Output is correct
36 Correct 3633 ms 266884 KB Output is correct
37 Correct 2437 ms 246332 KB Output is correct
38 Correct 2316 ms 246208 KB Output is correct
39 Correct 1655 ms 233304 KB Output is correct
40 Correct 1787 ms 235900 KB Output is correct
41 Correct 3190 ms 239352 KB Output is correct
42 Correct 3388 ms 240444 KB Output is correct
43 Correct 167 ms 119996 KB Output is correct
44 Correct 3203 ms 239056 KB Output is correct
45 Correct 3204 ms 231036 KB Output is correct
46 Correct 2870 ms 216136 KB Output is correct
47 Correct 1450 ms 214972 KB Output is correct
48 Correct 1416 ms 209896 KB Output is correct
49 Correct 1605 ms 221228 KB Output is correct
50 Correct 1732 ms 238716 KB Output is correct
51 Correct 1581 ms 216220 KB Output is correct
52 Correct 3701 ms 291524 KB Output is correct
53 Correct 3921 ms 274572 KB Output is correct
54 Correct 4085 ms 275496 KB Output is correct
55 Correct 3528 ms 256792 KB Output is correct
56 Correct 3654 ms 264064 KB Output is correct
57 Correct 3483 ms 244916 KB Output is correct
58 Correct 3711 ms 256644 KB Output is correct
59 Correct 3756 ms 266248 KB Output is correct
60 Correct 3587 ms 245156 KB Output is correct
61 Correct 376 ms 157024 KB Output is correct
62 Correct 3799 ms 291028 KB Output is correct
63 Correct 3972 ms 277612 KB Output is correct
64 Correct 4029 ms 271300 KB Output is correct
65 Correct 3791 ms 259060 KB Output is correct
66 Correct 3540 ms 243972 KB Output is correct
67 Correct 623 ms 152404 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 113112 KB Output is correct
2 Correct 79 ms 113016 KB Output is correct
3 Correct 81 ms 113016 KB Output is correct
4 Correct 79 ms 113144 KB Output is correct
5 Correct 81 ms 113144 KB Output is correct
6 Correct 90 ms 113912 KB Output is correct
7 Correct 90 ms 113912 KB Output is correct
8 Correct 100 ms 113784 KB Output is correct
9 Correct 109 ms 113912 KB Output is correct
10 Correct 86 ms 113784 KB Output is correct
11 Correct 86 ms 113784 KB Output is correct
12 Correct 87 ms 113656 KB Output is correct
13 Correct 85 ms 113656 KB Output is correct
14 Correct 84 ms 113660 KB Output is correct
15 Correct 98 ms 113784 KB Output is correct
16 Correct 87 ms 113784 KB Output is correct
17 Correct 89 ms 113728 KB Output is correct
18 Correct 89 ms 113784 KB Output is correct
19 Correct 88 ms 113872 KB Output is correct
20 Correct 87 ms 113708 KB Output is correct
21 Correct 89 ms 113528 KB Output is correct
22 Correct 88 ms 113912 KB Output is correct
23 Correct 89 ms 113912 KB Output is correct
24 Correct 97 ms 113784 KB Output is correct
25 Correct 87 ms 113784 KB Output is correct
26 Correct 90 ms 113656 KB Output is correct
27 Correct 84 ms 113400 KB Output is correct
28 Correct 105 ms 113660 KB Output is correct
29 Correct 87 ms 113608 KB Output is correct
30 Correct 90 ms 113524 KB Output is correct
31 Correct 4058 ms 267344 KB Output is correct
32 Correct 194 ms 123632 KB Output is correct
33 Correct 3428 ms 255616 KB Output is correct
34 Correct 3646 ms 255804 KB Output is correct
35 Correct 3750 ms 267076 KB Output is correct
36 Correct 3633 ms 266884 KB Output is correct
37 Correct 2437 ms 246332 KB Output is correct
38 Correct 2316 ms 246208 KB Output is correct
39 Correct 1655 ms 233304 KB Output is correct
40 Correct 1787 ms 235900 KB Output is correct
41 Correct 3190 ms 239352 KB Output is correct
42 Correct 3388 ms 240444 KB Output is correct
43 Correct 167 ms 119996 KB Output is correct
44 Correct 3203 ms 239056 KB Output is correct
45 Correct 3204 ms 231036 KB Output is correct
46 Correct 2870 ms 216136 KB Output is correct
47 Correct 1450 ms 214972 KB Output is correct
48 Correct 1416 ms 209896 KB Output is correct
49 Correct 1605 ms 221228 KB Output is correct
50 Correct 1732 ms 238716 KB Output is correct
51 Correct 1581 ms 216220 KB Output is correct
52 Execution timed out 5091 ms 544588 KB Time limit exceeded
53 Halted 0 ms 0 KB -