oj.uz

Submission #166615

# Submission time Handle Problem Language Result Execution time Memory
166615 2019-12-03T05:08:44 Z wleung_bvg Bridges (APIO19_bridges) C++14
100 / 100
 1915 ms 10644 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;using namespace __gnu_pbds;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;using ld=long double;using uint=unsigned int;using ull=unsigned long long;
using pii=std::pair<int,int>;using pll=std::pair<ll,ll>;using pill=std::pair<int,ll>;using plli=std::pair<ll,int>;using pdd=std::pair<double,double>;using pld=std::pair<ld,ld>;
#if __SIZEOF_INT128__
    using i128=__int128_t;using ui128=__uint128_t;using pi128=std::pair<i128,i128>;
#endif
constexpr const char nl='\n',sp=' ';constexpr const int INT_INF=0x3f3f3f3f;constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f;
constexpr const double D_INF=std::numeric_limits<double>::infinity();constexpr const ld LD_INF=std::numeric_limits<ld>::infinity();
template<class T>constexpr const T&_min(const T&x,const T&y){return x<y?x:y;}template<class T>constexpr const T&_max(const T&x,const T&y){return x<y?y:x;}
template<class T,class...Ts>constexpr const T&_min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T,class...Ts>constexpr const T&_max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
template<class T,class...Ts>void MIN(T&x,const Ts&...xs){x=_min(x,xs...);}template<class T,class...Ts>void MAX(T&x,const Ts&...xs){x=_max(x,xs...);}
template<class T,class...Args>std::unique_ptr<T>_make_unique(Args&&...args){return std::unique_ptr<T>(new T(std::forward<Args>(args)...));}
template<class T,class...Args>std::shared_ptr<T>_make_shared(Args&&...args){return std::shared_ptr<T>(new T(std::forward<Args>(args)...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
#define make_unique _make_unique
#define make_shared _make_shared
std::seed_seq seq{
    (uint64_t)std::chrono::duration_cast<std::chrono::nanoseconds>(std::chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t)__builtin_ia32_rdtsc(),(uint64_t)(uintptr_t)make_unique<char>().get()
};
std::mt19937 rng(seq);std::mt19937_64 rng64(seq);const std::size_t RANDOM=std::uniform_int_distribution<std::size_t>(0,(std::numeric_limits<std::size_t>::max)())(rng64);
template<class T,class H=std::hash<T>>struct rand_hash{
    static uint64_t splitmix64(uint64_t x){x+=0x9e3779b97f4a7c15;x=(x^(x>>30))*0xbf58476d1ce4e5b9;x=(x^(x>>27))*0x94d049bb133111eb;return x^(x>>31);}
    std::size_t operator()(const T&x)const{return splitmix64(H{}(x)+RANDOM);}
};
template<class K,class H=rand_hash<K>,class...Ts>using hashset=__gnu_pbds::gp_hash_table<K,__gnu_pbds::null_type,H,Ts...>;
template<class K,class V,class H=rand_hash<K>,class...Ts>using hashmap=__gnu_pbds::gp_hash_table<K,V,H,Ts...>;
template<class K,class C=std::less<K>,class...Ts>using treeset=__gnu_pbds::tree<K,__gnu_pbds::null_type,C,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update,Ts...>;
template<class K,class V,class C=std::less<K>,class...Ts>using treemap=__gnu_pbds::tree<K,V,C,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update,Ts...>;
template<class K,class H=rand_hash<K>,class...Ts>using uset=std::unordered_set<K,H,Ts...>;
template<class K,class V,class H=rand_hash<K>,class...Ts>using umap=std::unordered_map<K,V,H,Ts...>;
template<class T>using minpq=std::priority_queue<T,std::vector<T>,std::greater<T>>;template<class T>using maxpq=std::priority_queue<T,std::vector<T>,std::less<T>>;
template<class T>using minpairingheap=__gnu_pbds::priority_queue<T,std::greater<T>,__gnu_pbds::pairing_heap_tag>;
template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,std::less<T>,__gnu_pbds::pairing_heap_tag>;
template<class T1,class T2,class H1=rand_hash<T1>,class H2=rand_hash<T2>>struct pair_hash{
    std::size_t operator()(const std::pair<T1,T2>&p)const{return 31*H1{}(p.first)+H2{}(p.second);}
};
template<class T>struct is_iterator{
    template<class U,typename std::enable_if<!std::is_convertible<U,const char*>::value,int>::type=0>constexpr static auto has_indirection(int)->decltype(*std::declval<U>(),bool()){return true;}
    template<class>constexpr static bool has_indirection(long){return false;}constexpr static bool value=has_indirection<T>(0);
};

#define INTERACTIVE_INPUT 0
constexpr const int _bufferSize=1<<16,_maxNumLength=128;
char _inputBuffer[_bufferSize+1],*_inputPtr=_inputBuffer,_outputBuffer[_bufferSize],_c,_last,_sign,*_tempInputBuf=nullptr,_numBuf[_maxNumLength],_tempOutputBuf[_maxNumLength],_fill=' ';
FILE*_input=stdin,*_output=stdout,*_error=stderr;const char*_delimiter=" ";int _cur,_outputPtr=0,_numPtr=0,_precision=9,_width=0,_tempOutputPtr=0,_cnt;ull _precisionBase=1000000000;
#ifdef _WIN32
    #define getchar_unlocked getchar
    #define fread_unlocked fread
    #define fwrite_unlocked fwrite
#endif
#if INTERACTIVE_INPUT
    char _getchar(){return _last=getchar_unlocked();}
    char _getcharskipr(){while(_getchar()=='\r');return _last;}
#else
    char _peekchar(){return*_inputPtr?*_inputPtr:(_inputBuffer[fread_unlocked(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr);}
    char _peekcharskipr(){while(_peekchar()=='\r')_last=*_inputPtr++;return _peekchar();}
    char _getchar(){return _last=*_inputPtr?*_inputPtr++:(_inputBuffer[fread_unlocked(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr++);}
    char _getcharskipr(){while(_getchar()=='\r');return _last;}
    bool hasNext(){return (_last&&_peekcharskipr())||!feof(_input);}bool hasNextToken(){while(hasNext()&&_peekchar()<=' ')_getchar();return hasNext();}
#endif
template<class I>void _readSigned(I&x){while((_c=_getchar())<=' ');_sign=_c=='-';if(_sign)_c=_getchar();if(_c>='0')for(x=_c-'0';(_c=_getchar())>='0';x=x*10+_c-'0');}
template<class UI>void _readUnsigned(UI&x){while((_c=_getchar())<=' ');for(x=_c-'0';(_c=_getchar())>='0';x=x*10+_c-'0');}
template<class F>void _readFloatingPoint(F&x){for(F _div=1.0;(_c=_getchar())>='0';x+=(_c-'0')/(_div*=10));}
void setLength(int x){if(_tempInputBuf)delete[](_tempInputBuf);_tempInputBuf=new char[x+1];}
template<class I>typename std::enable_if<std::is_integral<I>::value&&std::is_signed<I>::value>::type read(I&x){_readSigned(x);if(_sign)x=-x;}
template<class UI>typename std::enable_if<std::is_integral<UI>::value&&std::is_unsigned<UI>::value>::type read(UI&x){_readUnsignedSigned(x);}
#if __SIZEOF_INT128__
    void read(i128&x){_readSigned(x);if(_sign)x=-x;}void read(ui128&x){_readUnsigned(x);}
#endif
template<class F>typename std::enable_if<std::is_floating_point<F>::value>::type read(F&x){_readSigned(x);if(_c=='.')_readFloatingPoint(x);if(_sign)x=-x;}
void read(char&x){while((x=_getchar())<=' ');}void read(char*x){_cur=0;do{_c=_getchar();}while(_c<=' ');do{x[_cur++]=_c;}while((_c=_getchar())>' ');x[_cur]='\0';}
void readln(char*x){if(_last=='\r')_getcharskipr();for(_cur=0;(_c=_getcharskipr())!='\n'&&_c;x[_cur++]=_c);x[_cur]='\0';}
void read(std::string&x){if(!_tempInputBuf)assert(0);read(_tempInputBuf);x=std::string(_tempInputBuf,_cur);}
void readln(std::string &x){if(!_tempInputBuf)assert(0);readln(_tempInputBuf);x=std::string(_tempInputBuf,_cur);}
template<class T1,class T2>void read(std::pair<T1,T2>&x){read(x.first);read(x.second);}template<class T>void read(std::complex<T>&x){T _re,_im;read(_re);read(_im);x.real(_re);x.imag(_im);}
template<class T>typename std::enable_if<is_iterator<typename T::iterator>::value>::type read(T&x);template<class T,class...Ts>void read(T&x,Ts&&...xs);
template<class It>typename std::enable_if<is_iterator<It>::value>::type read(It st,It en){for(It _i=st;_i!=en;_i++)read(*_i);}
template<class It,class...Ts>typename std::enable_if<is_iterator<It>::value>::type read(It st,It en,Ts&&...xs){read(st,en);read(std::forward<Ts>(xs)...);}
template<class T>typename std::enable_if<is_iterator<typename T::iterator>::value>::type read(T&x){for(auto&&_i:x)read(_i);}
template<class T,class...Ts>void read(T&x,Ts&&...xs){read(x);read(std::forward<Ts>(xs)...);}
void setInput(FILE*file){*_inputPtr='\0';_input=file;}void setInput(const char*s){*_inputPtr='\0';_input=fopen(s,"r");}void setInput(const std::string&s){*_inputPtr='\0';_input=fopen(s.c_str(),"r");}
int _flushBuf(){fwrite_unlocked(_outputBuffer,1,_outputPtr,_output);return _outputPtr=0;}void flush(){_flushBuf();fflush(_output);}
int _putchar(char x){return _outputBuffer[_outputPtr==_bufferSize?_flushBuf():_outputPtr]=x,_outputPtr++;}
void _writeTempBuf(char x){_tempOutputBuf[_tempOutputPtr++]=x;}void _writeOutput(){for(int _i=0;_i<_tempOutputPtr;_putchar(_tempOutputBuf[_i++]));_tempOutputPtr=0;}
void _fillBuf(int x){for(int _i=0;_i<x;_i++)_putchar(_fill);}void _flushNumBuf(){for(;_numPtr;_writeTempBuf(_numBuf[--_numPtr]));}
void _flushTempBuf(){int _tempLen=_tempOutputPtr;_fillBuf(_width-_tempLen);_writeOutput();_fillBuf(-_width-_tempLen);}
void setPrecision(int x){_precision=x;_precisionBase=1;for(int _i=0;_i<x;_i++,_precisionBase*=10);}void setWidth(int x){_width=x;}void setFill(char x){_fill=x;}
void setDelimiter(const char*x){_delimiter=x;}void setDelimiter(const std::string&x){_delimiter=x.c_str();}
void writeDelimiter(){for(const char*_p=_delimiter;*_p;_putchar(*_p++));}
template<class T>void _writeNum(const T&x,int digits){_cnt=0;for(T _y=x;_y;_y/=10,_cnt++)_numBuf[_numPtr++]='0'+_y%10;for(;_cnt<digits;_cnt++)_numBuf[_numPtr++]='0';_flushNumBuf();}
template<class F>void _writeFloatingPoint(const F&x){ull _I=ull(x);ull _F=(x-_I)*_precisionBase+F(0.5);if(_F>=_precisionBase){_I++;_F=0;}_writeNum(_I,1);_writeTempBuf('.');_writeNum(_F,_precision);}
void write(const bool&x){if(x)_writeTempBuf('1');else _writeTempBuf('0');_flushTempBuf();}void write(const char&x){_writeTempBuf(x);_flushTempBuf();}
void write(const char*x){int _slen=strlen(x);_fillBuf(_width-_slen);for(const char*_p=x;*_p;_putchar(*_p++));_fillBuf(-_width-_slen);}
void write(const std::string&x){_fillBuf(_width-int(x.length()));for(int _i=0;_i<int(x.length());_putchar(x[_i++]));_fillBuf(-_width-int(x.length()));}
template<class I>typename std::enable_if<std::is_integral<I>::value&&std::is_signed<I>::value>::type write(const I&x){
    using UI=typename std::make_unsigned<I>::type;if(x<0){_writeTempBuf('-');_writeNum(UI(-x),1);}else{_writeNum(UI(x),1);}_flushTempBuf();
}
template<class UI>typename std::enable_if<std::is_integral<UI>::value&&std::is_unsigned<UI>::value>::type write(const UI&x){_writeNum(x,1);_flushTempBuf();}
template<class F>typename std::enable_if<std::is_floating_point<F>::value>::type write(const F&x){
    if(std::isnan(x)){write("NaN");}else if(std::isinf(x)){write("Inf");}else if(x<0){_writeTempBuf('-');_writeFloatingPoint(-x);}else{_writeFloatingPoint(x);}_flushTempBuf();
}
#if __SIZEOF_INT128__
    void write(const i128&x){if(x<0){_writeTempBuf('-');_writeNum(ui128(-x),1);}else{_writeNum(ui128(x),1);}_flushTempBuf();}void write(const ui128&x){_writeNum(x,1);_flushTempBuf();}
#endif
template<class T1,class T2>void write(const std::pair<T1,T2>&x){write(x.first);writeDelimiter();write(x.second);}
template<class T>void write(const std::complex<T>&x){write(x.real());writeDelimiter();write(x.imag());}
template<class T>typename std::enable_if<is_iterator<typename T::iterator>::value>::type write(const T&x);template<class T,class...Ts>void write(const T&x,Ts&&...xs);
template<class It>typename std::enable_if<is_iterator<It>::value>::type write(It st,It en){bool _first=1;for(It _i=st;_i!=en;_i++){if(_first)_first=0;else writeDelimiter();write(*_i);}}
template<class It,class...Ts>typename std::enable_if<is_iterator<It>::value>::type write(It st,It en,Ts&&...xs){write(st,en);writeDelimiter();write(std::forward<Ts>(xs)...);}
template<class T>typename std::enable_if<is_iterator<typename T::iterator>::value>::type write(const T&x){bool _first=1;for(auto&&_i:x){if(_first)_first=0;else writeDelimiter();write(_i);}}
template<class T,class...Ts>void write(const T&x,Ts&&...xs){write(x);writeDelimiter();write(std::forward<Ts>(xs)...);}
void writeln(){_putchar('\n');}template<class...Ts>void writeln(Ts&&...xs){write(std::forward<Ts>(xs)...);_putchar('\n');}
class IOManager{public:~IOManager(){flush();if(_tempInputBuf)delete[](_tempInputBuf);}};std::unique_ptr<IOManager>iomanager=make_unique<IOManager>();
void setOutput(FILE*file){flush();_output=file;}void setOutput(const char*s){flush();_output=fopen(s,"w");}void setOutput(const std::string&s){flush();_output=fopen(s.c_str(),"w");}
template<class...Ts>void debug(const Ts&...xs){FILE*_temp=_output;setOutput(_error);write(xs...);setOutput(_temp);}
template<class...Ts>void debugln(const Ts&...xs){FILE*_temp=_output;setOutput(_error);writeln(xs...);setOutput(_temp);}
void setError(FILE*file){flush();_error=file;}void setError(const char*s){flush();_error=fopen(s,"w");}void setError(const std::string&s){flush();_error=fopen(s.c_str(),"w");}

template <const int MAXN, const bool ONE_INDEXED> struct UnionFindUndo {
    int UF[MAXN], cnt; vector<pair<pair<int, int>, int>> history;
    void init(int N) { cnt = N; fill(UF, UF + N + ONE_INDEXED, -1); history.clear(); }
    int find(int v) { return UF[v] < 0 ? v : find(UF[v]); }
    bool join(int v, int w) {
        if ((v = find(v)) == (w = find(w))) return false;
        if (UF[v] > UF[w]) swap(v, w);
        history.emplace_back(make_pair(v, w), UF[w]); UF[v] += UF[w]; UF[w] = v; cnt--; return true;
    }
    void undo() {
        int v = history.back().first.first, w = history.back().first.second, ufw = history.back().second;
        history.pop_back(); UF[w] = ufw; UF[v] -= UF[w]; cnt++;
    }
    bool connected(int v, int w) { return find(v) == find(w); }
    int getSize(int v) { return -UF[find(v)]; }
};

const int MAXN = 5e4 + 5, MAXM = 1e5 + 5, MAXQ = 1e5 + 5, BSZ = 1100;

int N, M, Q, last[MAXM], T[MAXQ], A[MAXQ], B[MAXQ], ans[MAXQ];
bool changed[MAXM];
pair<pii, int> E[MAXM];
UnionFindUndo<MAXN, 0> uf;

int main() {
    // setInput("in.txt");
    // setOutput("out.txt");
    // setError("err.txt");
    read(N, M);
    for (int i = 0; i < M; i++) {
        read(E[i]);
        --E[i].first.first;
        --E[i].first.second;
        last[i] = i;
    }
    read(Q);
    for (int i = 0; i < Q; i++) {
        read(T[i], A[i], B[i]);
        --A[i];
    }
    for (int st = 0; st < Q; st += BSZ) {
        int en = min(st + BSZ, Q);
        fill(changed, changed + M, false);
        vector<pair<pii, int>> queries;
        for (int i = st; i < en; i++) {
            if (T[i] == 1) changed[A[i]] = true;
            else queries.emplace_back(make_pair(A[i], B[i]), i);
        }
        vector<int> changedInds, origWeights;
        vector<pair<pii, int>> changedEdges, fixedEdges;
        for (int i = 0; i < M; i++) {
            if (changed[i]) {
                changedEdges.push_back(E[i]);
                changedInds.push_back(i);
                origWeights.push_back(E[i].second);
            } else fixedEdges.push_back(E[i]);
        }
        for (int i = st; i < en; i++) if (T[i] == 1) {
            E[A[i]].second = B[i];
            A[i] = lower_bound(changedInds.begin(), changedInds.end(), A[i]) - changedInds.begin();
        }
        sort(queries.begin(), queries.end(), [&] (const pair<pii, int> &a, const pair<pii, int> &b) {
            return a.first.second > b.first.second;
        });
        sort(fixedEdges.begin(), fixedEdges.end(), [&] (const pair<pii, int> &a, const pair<pii, int> &b) {
            return a.second > b.second;
        });
        uf.init(N);
        int i = 0;
        for (auto &&q : queries) {
            for (; i < sz(fixedEdges) && fixedEdges[i].second >= q.first.second; i++) uf.join(fixedEdges[i].first.first, fixedEdges[i].first.second);
            int curSize = uf.history.size();
            for (int j = 0; j < sz(changedInds); j++) changedEdges[j].second = origWeights[j];
            for (int j = st; j <= q.second; j++) if (T[j] == 1) changedEdges[A[j]].second = B[j];
            for (int j = 0; j < sz(changedInds); j++) if (changedEdges[j].second >= q.first.second) uf.join(changedEdges[j].first.first, changedEdges[j].first.second);
            ans[q.second] = uf.getSize(q.first.first);
            while (int(uf.history.size()) > curSize) uf.undo();
        }
    }
    for (int i = 0; i < Q; i++) if (T[i] == 2) writeln(ans[i]);
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 32 ms 664 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 15 ms 760 KB Output is correct
6 Correct 13 ms 632 KB Output is correct
7 Correct 15 ms 632 KB Output is correct
8 Correct 16 ms 632 KB Output is correct
9 Correct 17 ms 636 KB Output is correct
10 Correct 16 ms 632 KB Output is correct
11 Correct 15 ms 632 KB Output is correct
12 Correct 17 ms 612 KB Output is correct
13 Correct 20 ms 632 KB Output is correct
14 Correct 19 ms 632 KB Output is correct
15 Correct 17 ms 760 KB Output is correct
16 Correct 16 ms 632 KB Output is correct
17 Correct 16 ms 632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1138 ms 5120 KB Output is correct
2 Correct 1156 ms 5320 KB Output is correct
3 Correct 1176 ms 5180 KB Output is correct
4 Correct 1162 ms 5444 KB Output is correct
5 Correct 1155 ms 5208 KB Output is correct
6 Correct 1778 ms 5404 KB Output is correct
7 Correct 1663 ms 5256 KB Output is correct
8 Correct 1658 ms 5268 KB Output is correct
9 Correct 72 ms 3576 KB Output is correct
10 Correct 999 ms 6808 KB Output is correct
11 Correct 956 ms 5920 KB Output is correct
12 Correct 1079 ms 7096 KB Output is correct
13 Correct 990 ms 7352 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 864 ms 4540 KB Output is correct
2 Correct 613 ms 4360 KB Output is correct
3 Correct 1025 ms 6112 KB Output is correct
4 Correct 896 ms 5104 KB Output is correct
5 Correct 77 ms 3580 KB Output is correct
6 Correct 964 ms 6144 KB Output is correct
7 Correct 809 ms 5996 KB Output is correct
8 Correct 761 ms 6132 KB Output is correct
9 Correct 630 ms 5844 KB Output is correct
10 Correct 600 ms 6044 KB Output is correct
11 Correct 603 ms 6204 KB Output is correct
12 Correct 573 ms 5988 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1333 ms 10448 KB Output is correct
2 Correct 72 ms 2652 KB Output is correct
3 Correct 171 ms 6980 KB Output is correct
4 Correct 92 ms 7004 KB Output is correct
5 Correct 791 ms 10100 KB Output is correct
6 Correct 1356 ms 10508 KB Output is correct
7 Correct 791 ms 9608 KB Output is correct
8 Correct 739 ms 7736 KB Output is correct
9 Correct 696 ms 7836 KB Output is correct
10 Correct 727 ms 7696 KB Output is correct
11 Correct 990 ms 9368 KB Output is correct
12 Correct 973 ms 9628 KB Output is correct
13 Correct 1008 ms 9244 KB Output is correct
14 Correct 772 ms 9400 KB Output is correct
15 Correct 777 ms 10076 KB Output is correct
16 Correct 1320 ms 8652 KB Output is correct
17 Correct 1347 ms 10564 KB Output is correct
18 Correct 1354 ms 10644 KB Output is correct
19 Correct 1328 ms 10600 KB Output is correct
20 Correct 1115 ms 10116 KB Output is correct
21 Correct 1124 ms 10148 KB Output is correct
22 Correct 1277 ms 10564 KB Output is correct
23 Correct 794 ms 9028 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1138 ms 5120 KB Output is correct
2 Correct 1156 ms 5320 KB Output is correct
3 Correct 1176 ms 5180 KB Output is correct
4 Correct 1162 ms 5444 KB Output is correct
5 Correct 1155 ms 5208 KB Output is correct
6 Correct 1778 ms 5404 KB Output is correct
7 Correct 1663 ms 5256 KB Output is correct
8 Correct 1658 ms 5268 KB Output is correct
9 Correct 72 ms 3576 KB Output is correct
10 Correct 999 ms 6808 KB Output is correct
11 Correct 956 ms 5920 KB Output is correct
12 Correct 1079 ms 7096 KB Output is correct
13 Correct 990 ms 7352 KB Output is correct
14 Correct 864 ms 4540 KB Output is correct
15 Correct 613 ms 4360 KB Output is correct
16 Correct 1025 ms 6112 KB Output is correct
17 Correct 896 ms 5104 KB Output is correct
18 Correct 77 ms 3580 KB Output is correct
19 Correct 964 ms 6144 KB Output is correct
20 Correct 809 ms 5996 KB Output is correct
21 Correct 761 ms 6132 KB Output is correct
22 Correct 630 ms 5844 KB Output is correct
23 Correct 600 ms 6044 KB Output is correct
24 Correct 603 ms 6204 KB Output is correct
25 Correct 573 ms 5988 KB Output is correct
26 Correct 1144 ms 7388 KB Output is correct
27 Correct 1563 ms 7348 KB Output is correct
28 Correct 1247 ms 7352 KB Output is correct
29 Correct 964 ms 7104 KB Output is correct
30 Correct 1415 ms 6252 KB Output is correct
31 Correct 1436 ms 6004 KB Output is correct
32 Correct 1463 ms 7080 KB Output is correct
33 Correct 1267 ms 7396 KB Output is correct
34 Correct 1217 ms 7224 KB Output is correct
35 Correct 1359 ms 7216 KB Output is correct
36 Correct 979 ms 7056 KB Output is correct
37 Correct 946 ms 7220 KB Output is correct
38 Correct 957 ms 7324 KB Output is correct
39 Correct 827 ms 7212 KB Output is correct
40 Correct 887 ms 7104 KB Output is correct
41 Correct 841 ms 7244 KB Output is correct
42 Correct 833 ms 7176 KB Output is correct
43 Correct 784 ms 7152 KB Output is correct
44 Correct 748 ms 7292 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 32 ms 664 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 15 ms 760 KB Output is correct
6 Correct 13 ms 632 KB Output is correct
7 Correct 15 ms 632 KB Output is correct
8 Correct 16 ms 632 KB Output is correct
9 Correct 17 ms 636 KB Output is correct
10 Correct 16 ms 632 KB Output is correct
11 Correct 15 ms 632 KB Output is correct
12 Correct 17 ms 612 KB Output is correct
13 Correct 20 ms 632 KB Output is correct
14 Correct 19 ms 632 KB Output is correct
15 Correct 17 ms 760 KB Output is correct
16 Correct 16 ms 632 KB Output is correct
17 Correct 16 ms 632 KB Output is correct
18 Correct 1138 ms 5120 KB Output is correct
19 Correct 1156 ms 5320 KB Output is correct
20 Correct 1176 ms 5180 KB Output is correct
21 Correct 1162 ms 5444 KB Output is correct
22 Correct 1155 ms 5208 KB Output is correct
23 Correct 1778 ms 5404 KB Output is correct
24 Correct 1663 ms 5256 KB Output is correct
25 Correct 1658 ms 5268 KB Output is correct
26 Correct 72 ms 3576 KB Output is correct
27 Correct 999 ms 6808 KB Output is correct
28 Correct 956 ms 5920 KB Output is correct
29 Correct 1079 ms 7096 KB Output is correct
30 Correct 990 ms 7352 KB Output is correct
31 Correct 864 ms 4540 KB Output is correct
32 Correct 613 ms 4360 KB Output is correct
33 Correct 1025 ms 6112 KB Output is correct
34 Correct 896 ms 5104 KB Output is correct
35 Correct 77 ms 3580 KB Output is correct
36 Correct 964 ms 6144 KB Output is correct
37 Correct 809 ms 5996 KB Output is correct
38 Correct 761 ms 6132 KB Output is correct
39 Correct 630 ms 5844 KB Output is correct
40 Correct 600 ms 6044 KB Output is correct
41 Correct 603 ms 6204 KB Output is correct
42 Correct 573 ms 5988 KB Output is correct
43 Correct 1333 ms 10448 KB Output is correct
44 Correct 72 ms 2652 KB Output is correct
45 Correct 171 ms 6980 KB Output is correct
46 Correct 92 ms 7004 KB Output is correct
47 Correct 791 ms 10100 KB Output is correct
48 Correct 1356 ms 10508 KB Output is correct
49 Correct 791 ms 9608 KB Output is correct
50 Correct 739 ms 7736 KB Output is correct
51 Correct 696 ms 7836 KB Output is correct
52 Correct 727 ms 7696 KB Output is correct
53 Correct 990 ms 9368 KB Output is correct
54 Correct 973 ms 9628 KB Output is correct
55 Correct 1008 ms 9244 KB Output is correct
56 Correct 772 ms 9400 KB Output is correct
57 Correct 777 ms 10076 KB Output is correct
58 Correct 1320 ms 8652 KB Output is correct
59 Correct 1347 ms 10564 KB Output is correct
60 Correct 1354 ms 10644 KB Output is correct
61 Correct 1328 ms 10600 KB Output is correct
62 Correct 1115 ms 10116 KB Output is correct
63 Correct 1124 ms 10148 KB Output is correct
64 Correct 1277 ms 10564 KB Output is correct
65 Correct 794 ms 9028 KB Output is correct
66 Correct 1144 ms 7388 KB Output is correct
67 Correct 1563 ms 7348 KB Output is correct
68 Correct 1247 ms 7352 KB Output is correct
69 Correct 964 ms 7104 KB Output is correct
70 Correct 1415 ms 6252 KB Output is correct
71 Correct 1436 ms 6004 KB Output is correct
72 Correct 1463 ms 7080 KB Output is correct
73 Correct 1267 ms 7396 KB Output is correct
74 Correct 1217 ms 7224 KB Output is correct
75 Correct 1359 ms 7216 KB Output is correct
76 Correct 979 ms 7056 KB Output is correct
77 Correct 946 ms 7220 KB Output is correct
78 Correct 957 ms 7324 KB Output is correct
79 Correct 827 ms 7212 KB Output is correct
80 Correct 887 ms 7104 KB Output is correct
81 Correct 841 ms 7244 KB Output is correct
82 Correct 833 ms 7176 KB Output is correct
83 Correct 784 ms 7152 KB Output is correct
84 Correct 748 ms 7292 KB Output is correct
85 Correct 1819 ms 9592 KB Output is correct
86 Correct 195 ms 6780 KB Output is correct
87 Correct 121 ms 7080 KB Output is correct
88 Correct 1146 ms 9440 KB Output is correct
89 Correct 1794 ms 9704 KB Output is correct
90 Correct 1177 ms 9536 KB Output is correct
91 Correct 1331 ms 7152 KB Output is correct
92 Correct 1351 ms 7412 KB Output is correct
93 Correct 1763 ms 7272 KB Output is correct
94 Correct 1545 ms 8852 KB Output is correct
95 Correct 1527 ms 8836 KB Output is correct
96 Correct 1750 ms 8788 KB Output is correct
97 Correct 936 ms 9828 KB Output is correct
98 Correct 985 ms 9320 KB Output is correct
99 Correct 1854 ms 9580 KB Output is correct
100 Correct 1802 ms 9612 KB Output is correct
101 Correct 1915 ms 9628 KB Output is correct
102 Correct 1865 ms 9672 KB Output is correct
103 Correct 1860 ms 9236 KB Output is correct
104 Correct 1825 ms 9252 KB Output is correct
105 Correct 1420 ms 8604 KB Output is correct
106 Correct 1110 ms 8316 KB Output is correct
107 Correct 1416 ms 8948 KB Output is correct
108 Correct 1842 ms 9096 KB Output is correct
109 Correct 1342 ms 8732 KB Output is correct