oj.uz

답안 #102408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102408 2019-03-24T17:32:29 Z Benq Mergers (JOI19_mergers) C++14
100 / 100
 1012 ms 74488 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 500001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); } 
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;


template<int SZ> struct DSU {
    int par[SZ], sz[SZ];

    DSU() {
        F0R(i,SZ) par[i] = i, sz[i] = 1;
    }

    int get(int x) { // path compression
        if (par[x] != x) par[x] = get(par[x]);
        return par[x];
    }

    bool unite(int x, int y) { // union-by-rank
        x = get(x), y = get(y);
        if (x == y) return 0;
        sz[x] += sz[y], par[y] = x;
        return 1;
    }
};

DSU<MX> D;

int N,K,par[MX],depth[MX];
vi group[MX], adj[MX];

void dfs(int a) {
    trav(i,adj[a]) if (i != par[a]) {
        par[i] = a; depth[i] = depth[a]+1;
        dfs(i);
    }
}

void compress(int a, int b) {
    a = D.get(a), b = D.get(b);
    while (a != b) {
        if (depth[a] < depth[b]) swap(a,b);
        D.unite(par[a],a);
        a = D.get(par[a]);
    }
}

int deg[MX];

int main() {
    setIO(); re(N,K);
    F0R(i,N-1) {
        int a,b; re(a,b);
        adj[a].pb(b), adj[b].pb(a);
    }
    dfs(1);
    FOR(i,1,N+1) {
        int S; re(S);
        group[S].pb(i);
    }
    FOR(i,1,K+1) FOR(j,1,sz(group[i])) compress(group[i][0],group[i][j]);
    FOR(i,1,N+1) trav(j,adj[i]) if (D.get(i) != D.get(j)) deg[D.get(i)] ++;
    int co = 0;
    FOR(i,1,N+1) if (deg[i] == 1) co ++;
    ps((co+1)/2);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

mergers.cpp: In function 'void io::setIn(std::__cxx11::string)':
mergers.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mergers.cpp: In function 'void io::setOut(std::__cxx11::string)':
mergers.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27748 KB Output is correct
2 Correct 30 ms 27776 KB Output is correct
3 Correct 28 ms 27768 KB Output is correct
4 Correct 28 ms 27740 KB Output is correct
5 Correct 32 ms 27784 KB Output is correct
6 Correct 31 ms 27776 KB Output is correct
7 Correct 28 ms 27788 KB Output is correct
8 Correct 32 ms 27748 KB Output is correct
9 Correct 28 ms 27776 KB Output is correct
10 Correct 29 ms 27724 KB Output is correct
11 Correct 31 ms 27776 KB Output is correct
12 Correct 29 ms 27676 KB Output is correct
13 Correct 29 ms 27776 KB Output is correct
14 Correct 28 ms 27768 KB Output is correct
15 Correct 30 ms 27748 KB Output is correct
16 Correct 30 ms 27768 KB Output is correct
17 Correct 30 ms 27740 KB Output is correct
18 Correct 30 ms 27768 KB Output is correct
19 Correct 28 ms 27764 KB Output is correct
20 Correct 29 ms 27764 KB Output is correct
21 Correct 30 ms 27768 KB Output is correct
22 Correct 28 ms 27816 KB Output is correct
23 Correct 27 ms 27684 KB Output is correct
24 Correct 29 ms 27748 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27748 KB Output is correct
2 Correct 30 ms 27776 KB Output is correct
3 Correct 28 ms 27768 KB Output is correct
4 Correct 28 ms 27740 KB Output is correct
5 Correct 32 ms 27784 KB Output is correct
6 Correct 31 ms 27776 KB Output is correct
7 Correct 28 ms 27788 KB Output is correct
8 Correct 32 ms 27748 KB Output is correct
9 Correct 28 ms 27776 KB Output is correct
10 Correct 29 ms 27724 KB Output is correct
11 Correct 31 ms 27776 KB Output is correct
12 Correct 29 ms 27676 KB Output is correct
13 Correct 29 ms 27776 KB Output is correct
14 Correct 28 ms 27768 KB Output is correct
15 Correct 30 ms 27748 KB Output is correct
16 Correct 30 ms 27768 KB Output is correct
17 Correct 30 ms 27740 KB Output is correct
18 Correct 30 ms 27768 KB Output is correct
19 Correct 28 ms 27764 KB Output is correct
20 Correct 29 ms 27764 KB Output is correct
21 Correct 30 ms 27768 KB Output is correct
22 Correct 28 ms 27816 KB Output is correct
23 Correct 27 ms 27684 KB Output is correct
24 Correct 29 ms 27748 KB Output is correct
25 Correct 30 ms 27736 KB Output is correct
26 Correct 30 ms 27924 KB Output is correct
27 Correct 30 ms 27904 KB Output is correct
28 Correct 34 ms 28028 KB Output is correct
29 Correct 37 ms 27996 KB Output is correct
30 Correct 30 ms 27896 KB Output is correct
31 Correct 34 ms 27776 KB Output is correct
32 Correct 30 ms 28004 KB Output is correct
33 Correct 28 ms 27792 KB Output is correct
34 Correct 30 ms 27936 KB Output is correct
35 Correct 31 ms 28024 KB Output is correct
36 Correct 40 ms 27920 KB Output is correct
37 Correct 38 ms 27896 KB Output is correct
38 Correct 31 ms 27768 KB Output is correct
39 Correct 31 ms 27904 KB Output is correct
40 Correct 29 ms 27884 KB Output is correct
41 Correct 28 ms 28032 KB Output is correct
42 Correct 28 ms 27896 KB Output is correct
43 Correct 31 ms 28024 KB Output is correct
44 Correct 34 ms 27768 KB Output is correct
45 Correct 34 ms 28024 KB Output is correct
46 Correct 33 ms 27896 KB Output is correct
47 Correct 35 ms 27768 KB Output is correct
48 Correct 36 ms 27896 KB Output is correct
49 Correct 29 ms 28032 KB Output is correct
50 Correct 31 ms 28076 KB Output is correct
51 Correct 29 ms 27904 KB Output is correct
52 Correct 28 ms 27904 KB Output is correct
53 Correct 28 ms 28024 KB Output is correct
54 Correct 29 ms 27944 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27748 KB Output is correct
2 Correct 30 ms 27776 KB Output is correct
3 Correct 28 ms 27768 KB Output is correct
4 Correct 28 ms 27740 KB Output is correct
5 Correct 32 ms 27784 KB Output is correct
6 Correct 31 ms 27776 KB Output is correct
7 Correct 28 ms 27788 KB Output is correct
8 Correct 32 ms 27748 KB Output is correct
9 Correct 28 ms 27776 KB Output is correct
10 Correct 29 ms 27724 KB Output is correct
11 Correct 31 ms 27776 KB Output is correct
12 Correct 29 ms 27676 KB Output is correct
13 Correct 29 ms 27776 KB Output is correct
14 Correct 28 ms 27768 KB Output is correct
15 Correct 30 ms 27748 KB Output is correct
16 Correct 30 ms 27768 KB Output is correct
17 Correct 30 ms 27740 KB Output is correct
18 Correct 30 ms 27768 KB Output is correct
19 Correct 28 ms 27764 KB Output is correct
20 Correct 29 ms 27764 KB Output is correct
21 Correct 30 ms 27768 KB Output is correct
22 Correct 28 ms 27816 KB Output is correct
23 Correct 27 ms 27684 KB Output is correct
24 Correct 29 ms 27748 KB Output is correct
25 Correct 29 ms 27788 KB Output is correct
26 Correct 89 ms 32564 KB Output is correct
27 Correct 152 ms 32312 KB Output is correct
28 Correct 29 ms 27896 KB Output is correct
29 Correct 34 ms 27780 KB Output is correct
30 Correct 35 ms 27768 KB Output is correct
31 Correct 161 ms 32360 KB Output is correct
32 Correct 29 ms 27896 KB Output is correct
33 Correct 148 ms 35072 KB Output is correct
34 Correct 135 ms 32388 KB Output is correct
35 Correct 30 ms 28024 KB Output is correct
36 Correct 153 ms 32556 KB Output is correct
37 Correct 35 ms 27896 KB Output is correct
38 Correct 29 ms 27904 KB Output is correct
39 Correct 97 ms 32512 KB Output is correct
40 Correct 29 ms 28032 KB Output is correct
41 Correct 113 ms 32500 KB Output is correct
42 Correct 135 ms 33144 KB Output is correct
43 Correct 31 ms 27896 KB Output is correct
44 Correct 146 ms 35400 KB Output is correct
45 Correct 138 ms 33620 KB Output is correct
46 Correct 36 ms 27896 KB Output is correct
47 Correct 32 ms 27896 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 32624 KB Output is correct
2 Correct 105 ms 35540 KB Output is correct
3 Correct 33 ms 28024 KB Output is correct
4 Correct 30 ms 27896 KB Output is correct
5 Correct 28 ms 27768 KB Output is correct
6 Correct 28 ms 27768 KB Output is correct
7 Correct 36 ms 27896 KB Output is correct
8 Correct 142 ms 33804 KB Output is correct
9 Correct 29 ms 27896 KB Output is correct
10 Correct 119 ms 32704 KB Output is correct
11 Correct 28 ms 27688 KB Output is correct
12 Correct 128 ms 32644 KB Output is correct
13 Correct 129 ms 33628 KB Output is correct
14 Correct 118 ms 35332 KB Output is correct
15 Correct 91 ms 32596 KB Output is correct
16 Correct 31 ms 28068 KB Output is correct
17 Correct 27 ms 27732 KB Output is correct
18 Correct 105 ms 35420 KB Output is correct
19 Correct 142 ms 36728 KB Output is correct
20 Correct 38 ms 27900 KB Output is correct
21 Correct 32 ms 27692 KB Output is correct
22 Correct 96 ms 34028 KB Output is correct
23 Correct 40 ms 27944 KB Output is correct
24 Correct 181 ms 32996 KB Output is correct
25 Correct 138 ms 36316 KB Output is correct
26 Correct 32 ms 28032 KB Output is correct
27 Correct 38 ms 28024 KB Output is correct
28 Correct 29 ms 27896 KB Output is correct
29 Correct 32 ms 27896 KB Output is correct
30 Correct 36 ms 27896 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 27748 KB Output is correct
2 Correct 30 ms 27776 KB Output is correct
3 Correct 28 ms 27768 KB Output is correct
4 Correct 28 ms 27740 KB Output is correct
5 Correct 32 ms 27784 KB Output is correct
6 Correct 31 ms 27776 KB Output is correct
7 Correct 28 ms 27788 KB Output is correct
8 Correct 32 ms 27748 KB Output is correct
9 Correct 28 ms 27776 KB Output is correct
10 Correct 29 ms 27724 KB Output is correct
11 Correct 31 ms 27776 KB Output is correct
12 Correct 29 ms 27676 KB Output is correct
13 Correct 29 ms 27776 KB Output is correct
14 Correct 28 ms 27768 KB Output is correct
15 Correct 30 ms 27748 KB Output is correct
16 Correct 30 ms 27768 KB Output is correct
17 Correct 30 ms 27740 KB Output is correct
18 Correct 30 ms 27768 KB Output is correct
19 Correct 28 ms 27764 KB Output is correct
20 Correct 29 ms 27764 KB Output is correct
21 Correct 30 ms 27768 KB Output is correct
22 Correct 28 ms 27816 KB Output is correct
23 Correct 27 ms 27684 KB Output is correct
24 Correct 29 ms 27748 KB Output is correct
25 Correct 30 ms 27736 KB Output is correct
26 Correct 30 ms 27924 KB Output is correct
27 Correct 30 ms 27904 KB Output is correct
28 Correct 34 ms 28028 KB Output is correct
29 Correct 37 ms 27996 KB Output is correct
30 Correct 30 ms 27896 KB Output is correct
31 Correct 34 ms 27776 KB Output is correct
32 Correct 30 ms 28004 KB Output is correct
33 Correct 28 ms 27792 KB Output is correct
34 Correct 30 ms 27936 KB Output is correct
35 Correct 31 ms 28024 KB Output is correct
36 Correct 40 ms 27920 KB Output is correct
37 Correct 38 ms 27896 KB Output is correct
38 Correct 31 ms 27768 KB Output is correct
39 Correct 31 ms 27904 KB Output is correct
40 Correct 29 ms 27884 KB Output is correct
41 Correct 28 ms 28032 KB Output is correct
42 Correct 28 ms 27896 KB Output is correct
43 Correct 31 ms 28024 KB Output is correct
44 Correct 34 ms 27768 KB Output is correct
45 Correct 34 ms 28024 KB Output is correct
46 Correct 33 ms 27896 KB Output is correct
47 Correct 35 ms 27768 KB Output is correct
48 Correct 36 ms 27896 KB Output is correct
49 Correct 29 ms 28032 KB Output is correct
50 Correct 31 ms 28076 KB Output is correct
51 Correct 29 ms 27904 KB Output is correct
52 Correct 28 ms 27904 KB Output is correct
53 Correct 28 ms 28024 KB Output is correct
54 Correct 29 ms 27944 KB Output is correct
55 Correct 29 ms 27788 KB Output is correct
56 Correct 89 ms 32564 KB Output is correct
57 Correct 152 ms 32312 KB Output is correct
58 Correct 29 ms 27896 KB Output is correct
59 Correct 34 ms 27780 KB Output is correct
60 Correct 35 ms 27768 KB Output is correct
61 Correct 161 ms 32360 KB Output is correct
62 Correct 29 ms 27896 KB Output is correct
63 Correct 148 ms 35072 KB Output is correct
64 Correct 135 ms 32388 KB Output is correct
65 Correct 30 ms 28024 KB Output is correct
66 Correct 153 ms 32556 KB Output is correct
67 Correct 35 ms 27896 KB Output is correct
68 Correct 29 ms 27904 KB Output is correct
69 Correct 97 ms 32512 KB Output is correct
70 Correct 29 ms 28032 KB Output is correct
71 Correct 113 ms 32500 KB Output is correct
72 Correct 135 ms 33144 KB Output is correct
73 Correct 31 ms 27896 KB Output is correct
74 Correct 146 ms 35400 KB Output is correct
75 Correct 138 ms 33620 KB Output is correct
76 Correct 36 ms 27896 KB Output is correct
77 Correct 32 ms 27896 KB Output is correct
78 Correct 98 ms 32624 KB Output is correct
79 Correct 105 ms 35540 KB Output is correct
80 Correct 33 ms 28024 KB Output is correct
81 Correct 30 ms 27896 KB Output is correct
82 Correct 28 ms 27768 KB Output is correct
83 Correct 28 ms 27768 KB Output is correct
84 Correct 36 ms 27896 KB Output is correct
85 Correct 142 ms 33804 KB Output is correct
86 Correct 29 ms 27896 KB Output is correct
87 Correct 119 ms 32704 KB Output is correct
88 Correct 28 ms 27688 KB Output is correct
89 Correct 128 ms 32644 KB Output is correct
90 Correct 129 ms 33628 KB Output is correct
91 Correct 118 ms 35332 KB Output is correct
92 Correct 91 ms 32596 KB Output is correct
93 Correct 31 ms 28068 KB Output is correct
94 Correct 27 ms 27732 KB Output is correct
95 Correct 105 ms 35420 KB Output is correct
96 Correct 142 ms 36728 KB Output is correct
97 Correct 38 ms 27900 KB Output is correct
98 Correct 32 ms 27692 KB Output is correct
99 Correct 96 ms 34028 KB Output is correct
100 Correct 40 ms 27944 KB Output is correct
101 Correct 181 ms 32996 KB Output is correct
102 Correct 138 ms 36316 KB Output is correct
103 Correct 32 ms 28032 KB Output is correct
104 Correct 38 ms 28024 KB Output is correct
105 Correct 29 ms 27896 KB Output is correct
106 Correct 32 ms 27896 KB Output is correct
107 Correct 36 ms 27896 KB Output is correct
108 Correct 760 ms 57788 KB Output is correct
109 Correct 1008 ms 56996 KB Output is correct
110 Correct 921 ms 61420 KB Output is correct
111 Correct 894 ms 74488 KB Output is correct
112 Correct 939 ms 70628 KB Output is correct
113 Correct 694 ms 65324 KB Output is correct
114 Correct 778 ms 49952 KB Output is correct
115 Correct 771 ms 50000 KB Output is correct
116 Correct 1000 ms 54568 KB Output is correct
117 Correct 787 ms 65448 KB Output is correct
118 Correct 856 ms 52008 KB Output is correct
119 Correct 813 ms 65556 KB Output is correct
120 Correct 901 ms 70672 KB Output is correct
121 Correct 846 ms 65572 KB Output is correct
122 Correct 1012 ms 59240 KB Output is correct
123 Correct 583 ms 66932 KB Output is correct
124 Correct 932 ms 64388 KB Output is correct