답안 #68069 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68069	2018-08-15T21:00:10 Z	wleung_bvg	철인 이종 경기 (APIO18_duathlon)	C++14	82 / 100	1000 ms	1049600 KB

count_triplets

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define all(a) (a).begin(),(a).end()
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define FOR(i,b) For(i,0,b)
#define Rev(i,a,b) for(auto i=(a);i>(b);i--)
#define REV(i,a) Rev(i,a,-1)
#define sz(a) ((int)(a).size())
using ll=long long;using ld=long double;using uint=unsigned int;using ull=unsigned long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pill=pair<int,ll>;using plli=pair<ll,int>;using pdd=pair<double,double>;using pld=pair<ld,ld>;
constexpr const char nl='\n',sp=' ';constexpr const int INT_INF=0x3f3f3f3f;constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f;
constexpr const double D_INF=numeric_limits<double>::infinity();constexpr const ld LD_INF=numeric_limits<ld>::infinity();constexpr const double EPS=1e-9;
template<typename T1,typename T2>bool feq(const T1&x,const T2&y){return is_floating_point<common_type_t<T1,T2>>::value?abs(x-y)<=EPS:x==y;}
template<typename T1,typename T2>bool flt(const T1&x,const T2&y){return is_floating_point<common_type_t<T1,T2>>::value?x<y-EPS:x<y;}
template<typename T1,typename T2>bool fgt(const T1&x,const T2&y){return is_floating_point<common_type_t<T1,T2>>::value?x>y+EPS:x>y;}
template<typename T>constexpr const T&_min(const T&x,const T&y){return x<y?x:y;}template<typename T>constexpr const T&_max(const T&x,const T&y){return x<y?y:x;}
template<typename T,typename...Ts>constexpr const T&_min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<typename T,typename...Ts>constexpr const T&_max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
template<typename T,typename...Ts>void MIN(T&x,const Ts&...xs){x=_min(x,xs...);}template<typename T,typename...Ts>void MAX(T&x,const Ts&...xs){x=_max(x,xs...);}
template<typename T>constexpr const T&_clamp(const T&v,const T&lo,const T&hi){return v<lo?lo:hi<v?hi:v;}template<typename T>void CLAMP(T&v,const T&lo,const T&hi){v=_clamp(v,lo,hi);}
template<typename T,typename...Args>unique_ptr<T>_make_unique(Args&&...args){return unique_ptr<T>(new T(forward<Args>(args)...));}
template<typename T,typename...Args>shared_ptr<T>_make_shared(Args&&...args){return shared_ptr<T>(new T(forward<Args>(args)...));}
#define min _min
#define max _max
#define clamp _clamp
#define make_unique _make_unique
#define make_shared _make_shared
template<typename...Ts>using uset=unordered_set<Ts...>;template<typename...Ts>using umap=unordered_map<Ts...>;template<typename...Ts>using pq=priority_queue<Ts...>;
template<typename T>using minpq=pq<T,vector<T>,greater<T>>;template<typename T>using maxpq=pq<T,vector<T>,less<T>>;
template<typename T1,typename T2,typename H1=hash<T1>,typename H2=hash<T2>>struct pair_hash{size_t operator()(const pair<T1,T2>&p)const{return 31*H1{}(p.first)+H2{}(p.second);}};
seed_seq seq {
    (uint64_t)chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t)__builtin_ia32_rdtsc(),(uint64_t)(uintptr_t)make_unique<char>().get()
};
mt19937 rng(seq);

constexpr int _bufferSize=4096,_maxNumLength=128;
char _inputBuffer[_bufferSize+1],*_inputPtr=_inputBuffer,_outputBuffer[_bufferSize],_c,_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=6,_width=0,_tempOutputPtr=0,_cnt;ull _precisionBase=1000000;
#define _peekchar() (*_inputPtr?*_inputPtr:(_inputBuffer[fread(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr))
#define _getchar() (*_inputPtr?*_inputPtr++:(_inputBuffer[fread(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr++))
#define _hasNext() (*_inputPtr||!feof(_input))
#define _readSignAndNum(x) do{(x)=_getchar();}while((x)<=' ');_sign=(x)=='-';if(_sign)(x)=_getchar();for((x)-='0';(_c=_getchar())>='0';(x)=(x)*10+_c-'0')
#define _readFloatingPoint(x,T) for(T _div=1.0;(_c=_getchar())>='0';(x)+=(_c-'0')/(_div*=10))
#define rc(x) do{do{(x)=_getchar();}while((x)<=' ');}while(0)
#define ri(x) do{_readSignAndNum(x);if(_sign)(x)=-(x);}while(0)
#define rd(x) do{_readSignAndNum(x);if(_c=='.')_readFloatingPoint(x,double);if(_sign)(x)=-(x);}while(0)
#define rld(x) do{_readSignAndNum(x);if(_c=='.')_readFloatingPoint(x,ld);if(_sign)(x)=-(x);}while(0)
#define rcs(x) do{_cur=0;do{_c=_getchar();}while(_c<=' ');do{(x)[_cur++]=_c;}while((_c=_getchar())>' ');(x)[_cur]='\0';}while(0)
#define rs(x) do{if(!_tempInputBuf)assert(0);rcs(_tempInputBuf);(x)=string(_tempInputBuf,_cur);}while(0)
#define rcln(x) do{_cur=0;do{_c=_getchar();}while(_c<=' ');do{(x)[_cur++]=_c;}while((_c=_getchar())>=' ');(x)[_cur]='\0';}while(0)
#define rln(x) do{if(!_tempInputBuf)assert(0);rcln(_tempInputBuf);(x)=string(_tempInputBuf,_cur);}while(0)
#define setLength(x) do{if(_tempInputBuf)delete[](_tempInputBuf);_tempInputBuf=new char[(x)+1];}while(0)
void read(int&x){ri(x);}void read(uint&x){ri(x);}void read(ll&x){ri(x);}void read(ull&x){ri(x);}void read(double&x){rd(x);}void read(ld&x){rld(x);}
void read(char&x){rc(x);}void read(char*x){rcs(x);}void read(string&x){rs(x);}
template<typename T1,typename T2>void read(pair<T1,T2>&x){read(x.first);read(x.second);}template<typename T>void read(complex<T>&x){T _re,_im;read(_re);read(_im);x.real(_re);x.imag(_im);}
bool hasNext(){while(_hasNext()&&_peekchar()<=' ')_getchar();return _hasNext();}
template<typename T,typename...Ts>void read(T&x,Ts&...xs){read(x);read(xs...);}
void setInput(FILE*file){*_inputPtr='\0';_input=file;}void setInput(const char*s){*_inputPtr='\0';_input=fopen(s,"r");}void setInput(const string&s){*_inputPtr='\0';_input=fopen(s.c_str(),"r");}
#define _flush() do{_flushBuf();fflush(_output);}while(0)
#define _flushBuf() (fwrite(_outputBuffer,1,_outputPtr,_output),_outputPtr=0)
#define _putchar(x) (_outputBuffer[_outputPtr==_bufferSize?_flushBuf():_outputPtr]=(x),_outputPtr++)
#define _writeTempBuf(x) (_tempOutputBuf[_tempOutputPtr++]=(x))
#define _writeOutput() for(int _i=0;_i<_tempOutputPtr;_putchar(_tempOutputBuf[_i++]));_tempOutputPtr=0
#define _writeNum(x,T,digits) _cnt=0;for(T _y=(x);_y;_y/=10,_cnt++)_numBuf[_numPtr++]='0'+_y%10;for(;_cnt<digits;_cnt++)_numBuf[_numPtr++]='0';_flushNumBuf();
#define _writeFloatingPoint(x,T) ull _I=(ull)(x);ull _F=((x)-_I)*_precisionBase+(T)(0.5);if(_F>=_precisionBase){_I++;_F=0;}_writeNum(_I,ull,1);_writeTempBuf('.');_writeNum(_F,ull,_precision)
#define _checkFinite(x) if(std::isnan(x)){wcs("NaN");}else if(std::isinf(x)){wcs("Inf");}
#define _flushNumBuf() for(;_numPtr;_writeTempBuf(_numBuf[--_numPtr]))
#define _fillBuf(x) for(int _i=0;_i<(x);_i++)_putchar(_fill)
#define _flushTempBuf() int _tempLen=_tempOutputPtr;_fillBuf(_width-_tempLen);_writeOutput();_fillBuf(-_width-_tempLen)
#define wb(x) do{if(x)_writeTempBuf('1');else _writeTempBuf('0');_flushTempBuf();}while(0)
#define wc(x) do{_writeTempBuf(x); _flushTempBuf();}while(0)
#define wi(x) do{if((x)<0){_writeTempBuf('-');_writeNum(-(x),uint,1);}else{_writeNum(x,uint,1);}_flushTempBuf();}while(0)
#define wll(x) do{if((x)<0){_writeTempBuf('-');_writeNum(-(x),ull,1);}else{_writeNum(x,ull,1);}_flushTempBuf();}while(0)
#define wd(x) do{_checkFinite(x)else if((x)<0){_writeTempBuf('-');_writeFloatingPoint(-(x),double);}else{_writeFloatingPoint(x,double);}_flushTempBuf();}while(0)
#define wld(x) do{_checkFinite(x)else if((x)<0){_writeTempBuf('-');_writeFloatingPoint(-(x),ld);}else{_writeFloatingPoint(x,ld);}_flushTempBuf();}while(0)
#define wcs(x) do{int _slen=strlen(x);_fillBuf(_width-_slen);for(const char*_p=(x);*_p;_putchar(*_p++));_fillBuf(-_width-_slen);}while(0)
#define ws(x) do{_fillBuf(_width-(int)(x).length());for(int _i=0;_i<(int)(x).length();_putchar(x[_i++]));_fillBuf(-_width-(int)(x).length());}while(0)
#define setPrecision(x) do{_precision=(x);_precisionBase=1;for(int _i=0;_i<(x);_i++,_precisionBase*=10);}while(0)
#define setDelimiter(x) do{_delimiter=(x);}while(0)
#define setWidth(x) do{_width=(x);}while(0)
#define setFill(x) do{_fill=(x);}while(0)
void writeDelimiter(){for(const char*_p=_delimiter;*_p;_putchar(*_p++));}
void write(const bool&x){wb(x);}void write(const int&x){wi(x);}void write(const uint&x){wi(x);}void write(const ll&x){wll(x);}void write(const ull&x){wll(x);}
void write(const double&x){wd(x);}void write(const ld&x){wld(x);}void write(const char&x){wc(x);}void write(const char*x){wcs(x);}void write(const string&x){ws(x);}
template<typename T1,typename T2>void write(const pair<T1,T2>&x){write(x.first);writeDelimiter();write(x.second);}
template<typename T>void write(const complex<T>&x){write(x.real());writeDelimiter();write(x.imag());}
template<typename T>void write(const T&x){bool _first=1;for(auto&&_i:x){if(_first)_first=0;else writeDelimiter();write(_i);}}
template<typename T,typename...Ts>void write(const T&x,const Ts&...xs){write(x);writeDelimiter();write(xs...);}
void writeln(){_putchar('\n');}template<typename...Ts>void writeln(const Ts&...xs){write(xs...);_putchar('\n');}
void flush(){_flush();}class IOManager{public:~IOManager(){flush();}};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 string&s){flush();_output=fopen(s.c_str(),"w");}
template<typename...Ts>void debug(const Ts&...xs){FILE*_temp=_output;setOutput(_error);write(xs...);setOutput(_temp);}
template<typename...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 string&s){flush();_error=fopen(s.c_str(),"w");}

#define MAXN 100005

int N, M, low[MAXN], pre[MAXN], cnt = 0, SZ[MAXN * 2];
ll ans = 0;
bool vis[MAXN];
vector<int> adj[MAXN], adj2[MAXN * 2];
vector<vector<int>> comp;
stack<pii> s;

void bcc(int v, int prev) {
    int children = 0;
    pre[v] = low[v] = cnt++;
    for (int w : adj[v]) {
        if (pre[w] == -1) {
            children++;
            s.emplace(v, w);
            bcc(w, v);
            MIN(low[v], low[w]);
            if ((prev == v && children > 1) || (prev != v && low[w] >= pre[v])) {
                comp.eb();
                while (s.top().f != v && s.top().s != w) {
                    comp.back().pb(s.top().f);
                    comp.back().pb(s.top().s);
                    s.pop();
                }
                comp.back().pb(s.top().f);
                comp.back().pb(s.top().s);
                s.pop();
            }
        } else if (w != prev && pre[w] < low[v]) {
            low[v] = pre[w];
            s.emplace(v, w);
        }
    }
}

void dfs1(int v, int prev) {
    if (v < N) vis[v] = true;
    SZ[v] = v < N;
    for (int w : adj2[v]) {
        if (w == prev) continue;
        dfs1(w, v);
        SZ[v] += SZ[w];
    }
}

void dfs2(int v, int r, int prev) {
    if (v < N) for (int w : adj2[v]) ans -= (w == prev ? SZ[v] * ll(SZ[v] - 1) : (SZ[r] - SZ[w]) * ll(SZ[r] - SZ[w] - 1)) * ll(sz(comp[w - N]) - 1);
    for (int w : adj2[v]) if (w != prev) dfs2(w, r, v);
}

int main() {
    // setInput("in.txt");
    // setOutput("out.txt");
    // setError("err.txt");
    read(N, M);
    int a, b;
    FOR(i, M) {
        read(a, b);
        adj[--a].pb(--b);
        adj[b].pb(a);
    }
    FOR(i, N) low[i] = pre[i] = -1;
    FOR(i, N) {
        if (pre[i] == -1) bcc(i, i);
        if (!s.empty()) {
            comp.eb();
            while (!s.empty()) {
                comp.back().pb(s.top().f);
                comp.back().pb(s.top().s);
                s.pop();
            }
        }
    }
    FOR(i, sz(comp)) {
        sort(all(comp[i]));
        comp[i].erase(unique(all(comp[i])), comp[i].end()); 
        for (int v : comp[i]) {
            adj2[v].pb(N + i);
            adj2[N + i].pb(v);
        }
    }
    FOR(i, N) vis[i] = false;
    FOR(i, N) {
        if (vis[i]) continue;
        dfs1(i, -1);
        ans += SZ[i] * ll(SZ[i] - 1) * ll(SZ[i] - 2);
        dfs2(i, i, -1);
    }
    writeln(ans);
    return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	9 ms	7540 KB	Output is correct
3	Correct	11 ms	7540 KB	Output is correct
4	Correct	10 ms	7572 KB	Output is correct
5	Correct	9 ms	7608 KB	Output is correct
6	Correct	8 ms	7740 KB	Output is correct
7	Correct	9 ms	7740 KB	Output is correct
8	Correct	9 ms	7740 KB	Output is correct
9	Correct	8 ms	7740 KB	Output is correct
10	Correct	9 ms	7740 KB	Output is correct
11	Correct	10 ms	7740 KB	Output is correct
12	Correct	9 ms	7740 KB	Output is correct
13	Correct	8 ms	7836 KB	Output is correct
14	Correct	9 ms	7836 KB	Output is correct
15	Correct	10 ms	7848 KB	Output is correct
16	Correct	8 ms	7848 KB	Output is correct
17	Correct	8 ms	7848 KB	Output is correct
18	Correct	9 ms	7848 KB	Output is correct
19	Correct	10 ms	7848 KB	Output is correct
20	Correct	8 ms	7848 KB	Output is correct
21	Correct	10 ms	7852 KB	Output is correct
22	Correct	9 ms	7856 KB	Output is correct
23	Correct	9 ms	7860 KB	Output is correct
24	Correct	8 ms	7864 KB	Output is correct
25	Correct	9 ms	7964 KB	Output is correct
26	Correct	9 ms	7964 KB	Output is correct
27	Correct	10 ms	7964 KB	Output is correct
28	Correct	10 ms	7964 KB	Output is correct
29	Correct	10 ms	7964 KB	Output is correct
30	Correct	9 ms	7964 KB	Output is correct
31	Correct	9 ms	7964 KB	Output is correct
32	Correct	11 ms	7964 KB	Output is correct
33	Correct	11 ms	7964 KB	Output is correct
34	Correct	9 ms	7964 KB	Output is correct
35	Correct	8 ms	7964 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	9 ms	7540 KB	Output is correct
3	Correct	11 ms	7540 KB	Output is correct
4	Correct	10 ms	7572 KB	Output is correct
5	Correct	9 ms	7608 KB	Output is correct
6	Correct	8 ms	7740 KB	Output is correct
7	Correct	9 ms	7740 KB	Output is correct
8	Correct	9 ms	7740 KB	Output is correct
9	Correct	8 ms	7740 KB	Output is correct
10	Correct	9 ms	7740 KB	Output is correct
11	Correct	10 ms	7740 KB	Output is correct
12	Correct	9 ms	7740 KB	Output is correct
13	Correct	8 ms	7836 KB	Output is correct
14	Correct	9 ms	7836 KB	Output is correct
15	Correct	10 ms	7848 KB	Output is correct
16	Correct	8 ms	7848 KB	Output is correct
17	Correct	8 ms	7848 KB	Output is correct
18	Correct	9 ms	7848 KB	Output is correct
19	Correct	10 ms	7848 KB	Output is correct
20	Correct	8 ms	7848 KB	Output is correct
21	Correct	10 ms	7852 KB	Output is correct
22	Correct	9 ms	7856 KB	Output is correct
23	Correct	9 ms	7860 KB	Output is correct
24	Correct	8 ms	7864 KB	Output is correct
25	Correct	9 ms	7964 KB	Output is correct
26	Correct	9 ms	7964 KB	Output is correct
27	Correct	10 ms	7964 KB	Output is correct
28	Correct	10 ms	7964 KB	Output is correct
29	Correct	10 ms	7964 KB	Output is correct
30	Correct	9 ms	7964 KB	Output is correct
31	Correct	9 ms	7964 KB	Output is correct
32	Correct	11 ms	7964 KB	Output is correct
33	Correct	11 ms	7964 KB	Output is correct
34	Correct	9 ms	7964 KB	Output is correct
35	Correct	8 ms	7964 KB	Output is correct
36	Correct	10 ms	7964 KB	Output is correct
37	Correct	8 ms	7964 KB	Output is correct
38	Correct	10 ms	7964 KB	Output is correct
39	Correct	11 ms	7964 KB	Output is correct
40	Correct	10 ms	7964 KB	Output is correct
41	Correct	10 ms	7964 KB	Output is correct
42	Correct	9 ms	8064 KB	Output is correct
43	Correct	10 ms	8064 KB	Output is correct
44	Correct	9 ms	8064 KB	Output is correct
45	Correct	9 ms	8064 KB	Output is correct
46	Correct	8 ms	8064 KB	Output is correct
47	Correct	9 ms	8064 KB	Output is correct
48	Correct	10 ms	8064 KB	Output is correct
49	Correct	10 ms	8064 KB	Output is correct
50	Correct	8 ms	8064 KB	Output is correct
51	Correct	8 ms	8064 KB	Output is correct
52	Correct	9 ms	8064 KB	Output is correct
53	Correct	9 ms	8064 KB	Output is correct
54	Correct	8 ms	8084 KB	Output is correct
55	Correct	9 ms	8084 KB	Output is correct
56	Correct	8 ms	8084 KB	Output is correct
57	Correct	8 ms	8084 KB	Output is correct
58	Correct	9 ms	8084 KB	Output is correct
59	Correct	8 ms	8084 KB	Output is correct
60	Correct	8 ms	8084 KB	Output is correct
61	Correct	8 ms	8112 KB	Output is correct
62	Correct	9 ms	8112 KB	Output is correct
63	Correct	10 ms	8112 KB	Output is correct
64	Correct	8 ms	8112 KB	Output is correct
65	Correct	8 ms	8112 KB	Output is correct

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	106 ms	26120 KB	Output is correct
2	Correct	112 ms	27396 KB	Output is correct
3	Correct	194 ms	28404 KB	Output is correct
4	Correct	132 ms	29604 KB	Output is correct
5	Correct	147 ms	29604 KB	Output is correct
6	Correct	208 ms	31608 KB	Output is correct
7	Correct	176 ms	31608 KB	Output is correct
8	Correct	184 ms	33036 KB	Output is correct
9	Correct	153 ms	33036 KB	Output is correct
10	Correct	165 ms	33784 KB	Output is correct
11	Correct	132 ms	33784 KB	Output is correct
12	Correct	139 ms	33784 KB	Output is correct
13	Correct	158 ms	34304 KB	Output is correct
14	Correct	150 ms	34824 KB	Output is correct
15	Correct	120 ms	34824 KB	Output is correct
16	Correct	97 ms	34824 KB	Output is correct
17	Correct	57 ms	34824 KB	Output is correct
18	Correct	13 ms	34824 KB	Output is correct
19	Correct	13 ms	34824 KB	Output is correct
20	Correct	15 ms	34824 KB	Output is correct
21	Correct	12 ms	34824 KB	Output is correct
22	Correct	12 ms	34824 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	34824 KB	Output is correct
2	Correct	11 ms	34824 KB	Output is correct
3	Correct	11 ms	34824 KB	Output is correct
4	Correct	8 ms	34824 KB	Output is correct
5	Correct	14 ms	34824 KB	Output is correct
6	Correct	10 ms	34824 KB	Output is correct
7	Correct	10 ms	34824 KB	Output is correct
8	Correct	11 ms	34824 KB	Output is correct
9	Correct	12 ms	34824 KB	Output is correct
10	Correct	9 ms	34824 KB	Output is correct
11	Correct	10 ms	34824 KB	Output is correct
12	Correct	10 ms	34824 KB	Output is correct
13	Correct	9 ms	34824 KB	Output is correct
14	Correct	13 ms	34824 KB	Output is correct
15	Correct	9 ms	34824 KB	Output is correct
16	Correct	10 ms	34824 KB	Output is correct
17	Correct	9 ms	34824 KB	Output is correct
18	Correct	9 ms	34824 KB	Output is correct
19	Correct	9 ms	34824 KB	Output is correct
20	Correct	10 ms	34824 KB	Output is correct

Subtask #5
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	186 ms	41736 KB	Output is correct
2	Correct	189 ms	43016 KB	Output is correct
3	Correct	194 ms	44384 KB	Output is correct
4	Correct	207 ms	45516 KB	Output is correct
5	Correct	215 ms	46828 KB	Output is correct
6	Correct	198 ms	54712 KB	Output is correct
7	Correct	209 ms	54712 KB	Output is correct
8	Correct	235 ms	54712 KB	Output is correct
9	Correct	202 ms	54712 KB	Output is correct
10	Correct	196 ms	54712 KB	Output is correct
11	Correct	238 ms	54712 KB	Output is correct
12	Correct	208 ms	55648 KB	Output is correct
13	Correct	204 ms	56908 KB	Output is correct
14	Correct	211 ms	56952 KB	Output is correct
15	Correct	186 ms	56952 KB	Output is correct
16	Correct	108 ms	56952 KB	Output is correct
17	Correct	157 ms	61408 KB	Output is correct
18	Correct	165 ms	62736 KB	Output is correct
19	Correct	162 ms	63976 KB	Output is correct
20	Correct	177 ms	65244 KB	Output is correct

Subtask #6
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	65244 KB	Output is correct
2	Correct	10 ms	65244 KB	Output is correct
3	Correct	11 ms	65244 KB	Output is correct
4	Correct	11 ms	65244 KB	Output is correct
5	Correct	10 ms	65244 KB	Output is correct
6	Correct	10 ms	65244 KB	Output is correct
7	Correct	9 ms	65244 KB	Output is correct
8	Correct	11 ms	65244 KB	Output is correct
9	Correct	10 ms	65244 KB	Output is correct
10	Correct	10 ms	65244 KB	Output is correct
11	Correct	11 ms	65244 KB	Output is correct
12	Correct	11 ms	65244 KB	Output is correct
13	Correct	12 ms	65244 KB	Output is correct
14	Correct	11 ms	65244 KB	Output is correct
15	Correct	11 ms	65244 KB	Output is correct
16	Correct	9 ms	65244 KB	Output is correct
17	Correct	9 ms	65244 KB	Output is correct
18	Correct	10 ms	65244 KB	Output is correct
19	Correct	10 ms	65244 KB	Output is correct
20	Correct	11 ms	65244 KB	Output is correct
21	Correct	11 ms	65244 KB	Output is correct
22	Correct	12 ms	65244 KB	Output is correct
23	Correct	13 ms	65244 KB	Output is correct
24	Correct	10 ms	65244 KB	Output is correct
25	Correct	9 ms	65244 KB	Output is correct
26	Correct	11 ms	65244 KB	Output is correct
27	Correct	9 ms	65244 KB	Output is correct

Subtask #7
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	207 ms	65244 KB	Output is correct
2	Correct	172 ms	66020 KB	Output is correct
3	Correct	171 ms	66216 KB	Output is correct
4	Correct	159 ms	66216 KB	Output is correct
5	Correct	150 ms	66216 KB	Output is correct
6	Correct	124 ms	66216 KB	Output is correct
7	Correct	149 ms	67320 KB	Output is correct
8	Correct	151 ms	68064 KB	Output is correct
9	Correct	164 ms	69296 KB	Output is correct
10	Correct	139 ms	70380 KB	Output is correct
11	Correct	128 ms	71448 KB	Output is correct
12	Correct	143 ms	72600 KB	Output is correct
13	Correct	128 ms	73892 KB	Output is correct
14	Correct	122 ms	77036 KB	Output is correct
15	Correct	258 ms	87180 KB	Output is correct
16	Correct	259 ms	87180 KB	Output is correct
17	Correct	271 ms	88288 KB	Output is correct
18	Correct	278 ms	88540 KB	Output is correct
19	Correct	199 ms	88540 KB	Output is correct
20	Correct	211 ms	88540 KB	Output is correct
21	Correct	179 ms	89592 KB	Output is correct
22	Correct	183 ms	90044 KB	Output is correct
23	Correct	142 ms	90340 KB	Output is correct
24	Correct	220 ms	95812 KB	Output is correct
25	Correct	189 ms	97424 KB	Output is correct
26	Correct	174 ms	97676 KB	Output is correct
27	Correct	205 ms	99076 KB	Output is correct

Subtask #8
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	9 ms	7540 KB	Output is correct
3	Correct	11 ms	7540 KB	Output is correct
4	Correct	10 ms	7572 KB	Output is correct
5	Correct	9 ms	7608 KB	Output is correct
6	Correct	8 ms	7740 KB	Output is correct
7	Correct	9 ms	7740 KB	Output is correct
8	Correct	9 ms	7740 KB	Output is correct
9	Correct	8 ms	7740 KB	Output is correct
10	Correct	9 ms	7740 KB	Output is correct
11	Correct	10 ms	7740 KB	Output is correct
12	Correct	9 ms	7740 KB	Output is correct
13	Correct	8 ms	7836 KB	Output is correct
14	Correct	9 ms	7836 KB	Output is correct
15	Correct	10 ms	7848 KB	Output is correct
16	Correct	8 ms	7848 KB	Output is correct
17	Correct	8 ms	7848 KB	Output is correct
18	Correct	9 ms	7848 KB	Output is correct
19	Correct	10 ms	7848 KB	Output is correct
20	Correct	8 ms	7848 KB	Output is correct
21	Correct	10 ms	7852 KB	Output is correct
22	Correct	9 ms	7856 KB	Output is correct
23	Correct	9 ms	7860 KB	Output is correct
24	Correct	8 ms	7864 KB	Output is correct
25	Correct	9 ms	7964 KB	Output is correct
26	Correct	9 ms	7964 KB	Output is correct
27	Correct	10 ms	7964 KB	Output is correct
28	Correct	10 ms	7964 KB	Output is correct
29	Correct	10 ms	7964 KB	Output is correct
30	Correct	9 ms	7964 KB	Output is correct
31	Correct	9 ms	7964 KB	Output is correct
32	Correct	11 ms	7964 KB	Output is correct
33	Correct	11 ms	7964 KB	Output is correct
34	Correct	9 ms	7964 KB	Output is correct
35	Correct	8 ms	7964 KB	Output is correct
36	Correct	10 ms	7964 KB	Output is correct
37	Correct	8 ms	7964 KB	Output is correct
38	Correct	10 ms	7964 KB	Output is correct
39	Correct	11 ms	7964 KB	Output is correct
40	Correct	10 ms	7964 KB	Output is correct
41	Correct	10 ms	7964 KB	Output is correct
42	Correct	9 ms	8064 KB	Output is correct
43	Correct	10 ms	8064 KB	Output is correct
44	Correct	9 ms	8064 KB	Output is correct
45	Correct	9 ms	8064 KB	Output is correct
46	Correct	8 ms	8064 KB	Output is correct
47	Correct	9 ms	8064 KB	Output is correct
48	Correct	10 ms	8064 KB	Output is correct
49	Correct	10 ms	8064 KB	Output is correct
50	Correct	8 ms	8064 KB	Output is correct
51	Correct	8 ms	8064 KB	Output is correct
52	Correct	9 ms	8064 KB	Output is correct
53	Correct	9 ms	8064 KB	Output is correct
54	Correct	8 ms	8084 KB	Output is correct
55	Correct	9 ms	8084 KB	Output is correct
56	Correct	8 ms	8084 KB	Output is correct
57	Correct	8 ms	8084 KB	Output is correct
58	Correct	9 ms	8084 KB	Output is correct
59	Correct	8 ms	8084 KB	Output is correct
60	Correct	8 ms	8084 KB	Output is correct
61	Correct	8 ms	8112 KB	Output is correct
62	Correct	9 ms	8112 KB	Output is correct
63	Correct	10 ms	8112 KB	Output is correct
64	Correct	8 ms	8112 KB	Output is correct
65	Correct	8 ms	8112 KB	Output is correct
66	Correct	9 ms	99076 KB	Output is correct
67	Correct	9 ms	99076 KB	Output is correct
68	Execution timed out	1150 ms	1049600 KB	Time limit exceeded
69	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7416 KB	Output is correct
2	Correct	9 ms	7540 KB	Output is correct
3	Correct	11 ms	7540 KB	Output is correct
4	Correct	10 ms	7572 KB	Output is correct
5	Correct	9 ms	7608 KB	Output is correct
6	Correct	8 ms	7740 KB	Output is correct
7	Correct	9 ms	7740 KB	Output is correct
8	Correct	9 ms	7740 KB	Output is correct
9	Correct	8 ms	7740 KB	Output is correct
10	Correct	9 ms	7740 KB	Output is correct
11	Correct	10 ms	7740 KB	Output is correct
12	Correct	9 ms	7740 KB	Output is correct
13	Correct	8 ms	7836 KB	Output is correct
14	Correct	9 ms	7836 KB	Output is correct
15	Correct	10 ms	7848 KB	Output is correct
16	Correct	8 ms	7848 KB	Output is correct
17	Correct	8 ms	7848 KB	Output is correct
18	Correct	9 ms	7848 KB	Output is correct
19	Correct	10 ms	7848 KB	Output is correct
20	Correct	8 ms	7848 KB	Output is correct
21	Correct	10 ms	7852 KB	Output is correct
22	Correct	9 ms	7856 KB	Output is correct
23	Correct	9 ms	7860 KB	Output is correct
24	Correct	8 ms	7864 KB	Output is correct
25	Correct	9 ms	7964 KB	Output is correct
26	Correct	9 ms	7964 KB	Output is correct
27	Correct	10 ms	7964 KB	Output is correct
28	Correct	10 ms	7964 KB	Output is correct
29	Correct	10 ms	7964 KB	Output is correct
30	Correct	9 ms	7964 KB	Output is correct
31	Correct	9 ms	7964 KB	Output is correct
32	Correct	11 ms	7964 KB	Output is correct
33	Correct	11 ms	7964 KB	Output is correct
34	Correct	9 ms	7964 KB	Output is correct
35	Correct	8 ms	7964 KB	Output is correct
36	Correct	10 ms	7964 KB	Output is correct
37	Correct	8 ms	7964 KB	Output is correct
38	Correct	10 ms	7964 KB	Output is correct
39	Correct	11 ms	7964 KB	Output is correct
40	Correct	10 ms	7964 KB	Output is correct
41	Correct	10 ms	7964 KB	Output is correct
42	Correct	9 ms	8064 KB	Output is correct
43	Correct	10 ms	8064 KB	Output is correct
44	Correct	9 ms	8064 KB	Output is correct
45	Correct	9 ms	8064 KB	Output is correct
46	Correct	8 ms	8064 KB	Output is correct
47	Correct	9 ms	8064 KB	Output is correct
48	Correct	10 ms	8064 KB	Output is correct
49	Correct	10 ms	8064 KB	Output is correct
50	Correct	8 ms	8064 KB	Output is correct
51	Correct	8 ms	8064 KB	Output is correct
52	Correct	9 ms	8064 KB	Output is correct
53	Correct	9 ms	8064 KB	Output is correct
54	Correct	8 ms	8084 KB	Output is correct
55	Correct	9 ms	8084 KB	Output is correct
56	Correct	8 ms	8084 KB	Output is correct
57	Correct	8 ms	8084 KB	Output is correct
58	Correct	9 ms	8084 KB	Output is correct
59	Correct	8 ms	8084 KB	Output is correct
60	Correct	8 ms	8084 KB	Output is correct
61	Correct	8 ms	8112 KB	Output is correct
62	Correct	9 ms	8112 KB	Output is correct
63	Correct	10 ms	8112 KB	Output is correct
64	Correct	8 ms	8112 KB	Output is correct
65	Correct	8 ms	8112 KB	Output is correct
66	Correct	106 ms	26120 KB	Output is correct
67	Correct	112 ms	27396 KB	Output is correct
68	Correct	194 ms	28404 KB	Output is correct
69	Correct	132 ms	29604 KB	Output is correct
70	Correct	147 ms	29604 KB	Output is correct
71	Correct	208 ms	31608 KB	Output is correct
72	Correct	176 ms	31608 KB	Output is correct
73	Correct	184 ms	33036 KB	Output is correct
74	Correct	153 ms	33036 KB	Output is correct
75	Correct	165 ms	33784 KB	Output is correct
76	Correct	132 ms	33784 KB	Output is correct
77	Correct	139 ms	33784 KB	Output is correct
78	Correct	158 ms	34304 KB	Output is correct
79	Correct	150 ms	34824 KB	Output is correct
80	Correct	120 ms	34824 KB	Output is correct
81	Correct	97 ms	34824 KB	Output is correct
82	Correct	57 ms	34824 KB	Output is correct
83	Correct	13 ms	34824 KB	Output is correct
84	Correct	13 ms	34824 KB	Output is correct
85	Correct	15 ms	34824 KB	Output is correct
86	Correct	12 ms	34824 KB	Output is correct
87	Correct	12 ms	34824 KB	Output is correct
88	Correct	30 ms	34824 KB	Output is correct
89	Correct	11 ms	34824 KB	Output is correct
90	Correct	11 ms	34824 KB	Output is correct
91	Correct	8 ms	34824 KB	Output is correct
92	Correct	14 ms	34824 KB	Output is correct
93	Correct	10 ms	34824 KB	Output is correct
94	Correct	10 ms	34824 KB	Output is correct
95	Correct	11 ms	34824 KB	Output is correct
96	Correct	12 ms	34824 KB	Output is correct
97	Correct	9 ms	34824 KB	Output is correct
98	Correct	10 ms	34824 KB	Output is correct
99	Correct	10 ms	34824 KB	Output is correct
100	Correct	9 ms	34824 KB	Output is correct
101	Correct	13 ms	34824 KB	Output is correct
102	Correct	9 ms	34824 KB	Output is correct
103	Correct	10 ms	34824 KB	Output is correct
104	Correct	9 ms	34824 KB	Output is correct
105	Correct	9 ms	34824 KB	Output is correct
106	Correct	9 ms	34824 KB	Output is correct
107	Correct	10 ms	34824 KB	Output is correct
108	Correct	186 ms	41736 KB	Output is correct
109	Correct	189 ms	43016 KB	Output is correct
110	Correct	194 ms	44384 KB	Output is correct
111	Correct	207 ms	45516 KB	Output is correct
112	Correct	215 ms	46828 KB	Output is correct
113	Correct	198 ms	54712 KB	Output is correct
114	Correct	209 ms	54712 KB	Output is correct
115	Correct	235 ms	54712 KB	Output is correct
116	Correct	202 ms	54712 KB	Output is correct
117	Correct	196 ms	54712 KB	Output is correct
118	Correct	238 ms	54712 KB	Output is correct
119	Correct	208 ms	55648 KB	Output is correct
120	Correct	204 ms	56908 KB	Output is correct
121	Correct	211 ms	56952 KB	Output is correct
122	Correct	186 ms	56952 KB	Output is correct
123	Correct	108 ms	56952 KB	Output is correct
124	Correct	157 ms	61408 KB	Output is correct
125	Correct	165 ms	62736 KB	Output is correct
126	Correct	162 ms	63976 KB	Output is correct
127	Correct	177 ms	65244 KB	Output is correct
128	Correct	9 ms	65244 KB	Output is correct
129	Correct	10 ms	65244 KB	Output is correct
130	Correct	11 ms	65244 KB	Output is correct
131	Correct	11 ms	65244 KB	Output is correct
132	Correct	10 ms	65244 KB	Output is correct
133	Correct	10 ms	65244 KB	Output is correct
134	Correct	9 ms	65244 KB	Output is correct
135	Correct	11 ms	65244 KB	Output is correct
136	Correct	10 ms	65244 KB	Output is correct
137	Correct	10 ms	65244 KB	Output is correct
138	Correct	11 ms	65244 KB	Output is correct
139	Correct	11 ms	65244 KB	Output is correct
140	Correct	12 ms	65244 KB	Output is correct
141	Correct	11 ms	65244 KB	Output is correct
142	Correct	11 ms	65244 KB	Output is correct
143	Correct	9 ms	65244 KB	Output is correct
144	Correct	9 ms	65244 KB	Output is correct
145	Correct	10 ms	65244 KB	Output is correct
146	Correct	10 ms	65244 KB	Output is correct
147	Correct	11 ms	65244 KB	Output is correct
148	Correct	11 ms	65244 KB	Output is correct
149	Correct	12 ms	65244 KB	Output is correct
150	Correct	13 ms	65244 KB	Output is correct
151	Correct	10 ms	65244 KB	Output is correct
152	Correct	9 ms	65244 KB	Output is correct
153	Correct	11 ms	65244 KB	Output is correct
154	Correct	9 ms	65244 KB	Output is correct
155	Correct	207 ms	65244 KB	Output is correct
156	Correct	172 ms	66020 KB	Output is correct
157	Correct	171 ms	66216 KB	Output is correct
158	Correct	159 ms	66216 KB	Output is correct
159	Correct	150 ms	66216 KB	Output is correct
160	Correct	124 ms	66216 KB	Output is correct
161	Correct	149 ms	67320 KB	Output is correct
162	Correct	151 ms	68064 KB	Output is correct
163	Correct	164 ms	69296 KB	Output is correct
164	Correct	139 ms	70380 KB	Output is correct
165	Correct	128 ms	71448 KB	Output is correct
166	Correct	143 ms	72600 KB	Output is correct
167	Correct	128 ms	73892 KB	Output is correct
168	Correct	122 ms	77036 KB	Output is correct
169	Correct	258 ms	87180 KB	Output is correct
170	Correct	259 ms	87180 KB	Output is correct
171	Correct	271 ms	88288 KB	Output is correct
172	Correct	278 ms	88540 KB	Output is correct
173	Correct	199 ms	88540 KB	Output is correct
174	Correct	211 ms	88540 KB	Output is correct
175	Correct	179 ms	89592 KB	Output is correct
176	Correct	183 ms	90044 KB	Output is correct
177	Correct	142 ms	90340 KB	Output is correct
178	Correct	220 ms	95812 KB	Output is correct
179	Correct	189 ms	97424 KB	Output is correct
180	Correct	174 ms	97676 KB	Output is correct
181	Correct	205 ms	99076 KB	Output is correct
182	Correct	9 ms	99076 KB	Output is correct
183	Correct	9 ms	99076 KB	Output is correct
184	Execution timed out	1150 ms	1049600 KB	Time limit exceeded
185	Halted	0 ms	0 KB	-

답안 #68069

Compilation message