oj.uz

Submission #679244

# Submission time Handle Problem Language Result Execution time Memory
679244 2023-01-07T22:29:25 Z Joshua_Andersson Railway (BOI17_railway) C++14
100 / 100
 229 ms 83000 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;

#define enablell 1

typedef long long ll;
typedef unsigned long long ull;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define PBDS 0
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
uint32_t clz(uint32_t x) { return _lzcnt_u32(x); }
uint32_t ctz(uint32_t x) { return _tzcnt_u32(x); }
#define bswap64(x) _byteswap_uint64(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin_popcount(x)
uint32_t clz(uint32_t x) { return __builtin_clz(x); }
uint32_t ctz(uint32_t x) { return __builtin_ctzll(x); }
#define bswap64(x) __builtin_bswap64(x)
#define gc() getchar_unlocked()
#if PBDS
using namespace __gnu_pbds;
// lower_bound is now upper_bound and vice versa (multiset). generally a bit broken
template<typename T> using indexed_multiset = tree<int, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return __builtin_bswap64(x * C); }
};

template<typename T, typename U> using fast_map = __gnu_pbds::gp_hash_table<T, U, chash>;
template<typename T> using fast_set = __gnu_pbds::gp_hash_table<T, null_type, chash>;
template<typename T, typename H> using fast_set_h = __gnu_pbds::gp_hash_table<T, null_type, H>;
#endif

#endif

#define FAST_INPUT 0
#define FILE_TC 0
#if FILE_TC && _LOCAL
//ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
ifstream filein("E:\\downloads\\test_data\\test_data\\005-case05.in");
//ifstream filein("E:\\desktop\\po-repos\\swedish-olympiad-2023\\online\\tomtplanering\\data\\secret\\group10\\010-case10.in");

#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast() {}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if FAST_INPUT && !FILE_TC
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
inline void read(int& u, int& v, int& k) { read(u); read(v); read(k); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))

#define ceildiv(x,y) ((x + y - 1) / y)

template<typename T> inline void eraseOne(multiset<T>& mSet, T k) { auto itr = mSet.find(k); if (itr != mSet.end()) { mSet.erase(itr); } }
template<typename T, typename U> inline T first(U& a) { return *begin(a); }
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
vector<string> split(string s, string d) { size_t k = 0, n, e = d.length(); string t; vector<string> r; while ((n = s.find(d, k)) != string::npos) { t = s.substr(k, n - k); k = n + e; r.push_back(t); } r.push_back(s.substr(k)); return r; }
ll binpow(ll a, ll b) { ll res = 1; while (b > 0) { if (b & 1) res = res * a; a = a * a; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll m) { a %= m; long long res = 1; while (b > 0) { if (b & 1) res = res * a % m; a = a * a % m; b >>= 1; } return res; } // For a < 2^31

#if 1
auto Start = chrono::high_resolution_clock::now();
void resettimer() { Start = chrono::high_resolution_clock::now(); }
int elapsedmillis() { return chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count(); }
random_device rd;
mt19937 rng(rd());
template<typename T> inline T randint(T lo, T hi) { return uniform_int_distribution<T>(lo, hi)(rng); } // [lo,hi]
template<typename T> inline T randel(vector<T>& v) { return v[uniform_int_distribution<T>((int)0, v.size() - 1)(rng)]; } // [lo,hi]
#endif
const ll mod = 1e9 + 7;


template<class T>
struct RMQ {
    vector<vector<T>> jmp;
    RMQ(const vector<T>& V) : jmp(1, V) {
        for (int pw = 1, k = 1; pw * 2 <= sz(V); pw *= 2, ++k) {
            jmp.emplace_back(sz(V) - pw * 2 + 1);
            rep(j, sz(jmp[k]))
                jmp[k][j] = min(jmp[k - 1][j], jmp[k - 1][j + pw]);
        }
    }
    T query(int a, int b) {
        assert(a < b); // or return inf if a == b
        int dep = 31 - clz(b - a);
        return min(jmp[dep][a], jmp[dep][b - (1 << dep)]);
    }
};
struct LCA {
    int T = 0;
    vi time, path, ret;
    RMQ<int> rmq;

    vi timein, timeout;
    int T2 = 0;
    LCA(vector<vi>& C) : time(sz(C)), timein(sz(C)), timeout(sz(C)), rmq((dfs(C, 0, -1), ret)) { dfs2(C, 0, -1);  }
    void dfs(vector<vi>& C, int v, int par) {
        time[v] = T++;
        for (int y : C[v]) if (y != par) {
            path.push_back(v), ret.push_back(time[v]);
            dfs(C, y, v);
        }
    }

    void dfs2(vvi& edges, int u, int p)
    {
        timein[u] = T2++;
        repe(e, edges[u]) if (e != p) dfs2(edges, e, u);
        timeout[u] = T2++;
    }

    int isancestor(int u, int v)
    {
        return timein[u] < timein[v] && timeout[v] < timeout[u];
    }

    int lca(int a, int b) {
        if (a == b) return a;
        if (isancestor(a, b)) return a;
        if (isancestor(b, a)) return b;
        tie(a, b) = minmax(time[a], time[b]);
        return path[rmq.query(a, b)];
    }
    //dist(a,b){return depth[a] + depth[b] - 2*depth[lca(a,b)];}
};

int k = 0;
set<int> ans;
unordered_map<int, int> addedges(int u, int par, vector<unordered_map<int, int>>& add, vector<unordered_map<int, int>>& remove, vvp3& edges)
{


    
    unordered_map<int, int> ministers;
    repe(edge, edges[u])
    {
        int e, _, __;
        tie(e, _, __) = edge;
        if (e == par) continue;
        unordered_map<int,int> others = addedges(e, u, add, remove, edges);
        if (others.size() > ministers.size()) swap(others, ministers);
        assert(others.size() <= ministers.size());
        repe(o, others) ministers[o.first] += o.second;
    }

    
    repe(minister, add[u])
    {
        ministers[minister.first]+=minister.second;
    }
    repe(minister, remove[u])
    {
        ministers[minister.first]-=minister.second;
        if (ministers[minister.first]==0)
        {
            ministers.erase(minister.first);
        }
    }

    if (ministers.size()>=k)
    {
        ans.insert(get<2>(*lower_bound(all(edges[u]), p3(par, 0, 0))));
    }
    return ministers;
    /*unordered_map<int, int> ret = ministers;
    return ret;*/
}

int32_t main()
{
    fast();

    dread2(int, n, m);
    read(k);

    vvp3 edges(n);
    vvi edgesnormal(n);
    
    vector<unordered_map<int,int>> add(n);
    vector<unordered_map<int,int>> remove(n);
    rep(i, n - 1)
    {
        dread2(int, a, b);
        a--; b--;
        edges[a].emplace_back(b, 0, i);
        edges[b].emplace_back(a, 0, i);
        
        edgesnormal[a].emplace_back(b);
        edgesnormal[b].emplace_back(a);
    }
    rep(i, n) sort(all(edges[i]));
    LCA lca(edgesnormal);
    rep(i, m)
    {
        dread(int, s);
        readvector(int, stations, s);
        rep(i, s) stations[i]--;
        repp(j, 1, s)
        {
            int lc = lca.lca(stations[0], stations[j]);
            remove[lc][i]+=2;
            add[stations[0]][i]++;
            add[stations[j]][i]++;

        }
    }

    unordered_map<int, int> ministers;
    addedges(0, -1, add, remove, edges);

    
    
    cout << ans.size() << "\n";
    repe(a, ans)
    {
        cout << a+1 << " ";
    }

    quit;
}

Compilation message

railway.cpp: In constructor 'LCA::LCA(std::vector<std::vector<long long int> >&)':
railway.cpp:181:16: warning: 'LCA::timeout' will be initialized after [-Wreorder]
  181 |     vi timein, timeout;
      |                ^~~~~~~
railway.cpp:179:14: warning:   'RMQ<long long int> LCA::rmq' [-Wreorder]
  179 |     RMQ<int> rmq;
      |              ^~~
railway.cpp:183:5: warning:   when initialized here [-Wreorder]
  183 |     LCA(vector<vi>& C) : time(sz(C)), timein(sz(C)), timeout(sz(C)), rmq((dfs(C, 0, -1), ret)) { dfs2(C, 0, -1);  }
      |     ^~~
railway.cpp: In function 'std::unordered_map<long long int, long long int> addedges(ll, ll, std::vector<std::unordered_map<long long int, long long int> >&, std::vector<std::unordered_map<long long int, long long int> >&, vvp3&)':
railway.cpp:247:25: warning: comparison of integer expressions of different signedness: 'std::unordered_map<long long int, long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  247 |     if (ministers.size()>=k)
      |         ~~~~~~~~~~~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 4564 KB Output is correct
3 Correct 7 ms 4556 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 5976 KB Output is correct
7 Correct 8 ms 4948 KB Output is correct
8 Correct 6 ms 4692 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 4564 KB Output is correct
3 Correct 7 ms 4556 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 5976 KB Output is correct
7 Correct 8 ms 4948 KB Output is correct
8 Correct 6 ms 4692 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 34 ms 8688 KB Output is correct
16 Correct 36 ms 8788 KB Output is correct
17 Correct 37 ms 8912 KB Output is correct
18 Correct 9 ms 5844 KB Output is correct
19 Correct 10 ms 5040 KB Output is correct
20 Correct 39 ms 9528 KB Output is correct
21 Correct 41 ms 9284 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 10 ms 4616 KB Output is correct
24 Correct 7 ms 4568 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 9 ms 5916 KB Output is correct
28 Correct 8 ms 4948 KB Output is correct
29 Correct 7 ms 4696 KB Output is correct
30 Correct 6 ms 4740 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 83000 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 158 ms 81320 KB Output is correct
4 Correct 145 ms 79028 KB Output is correct
5 Correct 148 ms 77416 KB Output is correct
6 Correct 146 ms 77860 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 62260 KB Output is correct
2 Correct 195 ms 54296 KB Output is correct
3 Correct 176 ms 55576 KB Output is correct
4 Correct 160 ms 55740 KB Output is correct
5 Correct 163 ms 55228 KB Output is correct
6 Correct 128 ms 62864 KB Output is correct
7 Correct 122 ms 62516 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 62260 KB Output is correct
2 Correct 195 ms 54296 KB Output is correct
3 Correct 176 ms 55576 KB Output is correct
4 Correct 160 ms 55740 KB Output is correct
5 Correct 163 ms 55228 KB Output is correct
6 Correct 128 ms 62864 KB Output is correct
7 Correct 122 ms 62516 KB Output is correct
8 Correct 141 ms 64452 KB Output is correct
9 Correct 142 ms 64488 KB Output is correct
10 Correct 141 ms 76860 KB Output is correct
11 Correct 140 ms 76664 KB Output is correct
12 Correct 142 ms 53524 KB Output is correct
13 Correct 132 ms 53468 KB Output is correct
14 Correct 142 ms 50320 KB Output is correct
15 Correct 191 ms 50460 KB Output is correct
16 Correct 168 ms 56028 KB Output is correct
17 Correct 159 ms 55884 KB Output is correct
18 Correct 158 ms 55632 KB Output is correct
19 Correct 205 ms 54072 KB Output is correct
20 Correct 134 ms 63524 KB Output is correct
21 Correct 135 ms 64004 KB Output is correct
22 Correct 149 ms 63576 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 4564 KB Output is correct
3 Correct 7 ms 4556 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 5976 KB Output is correct
7 Correct 8 ms 4948 KB Output is correct
8 Correct 6 ms 4692 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 34 ms 8688 KB Output is correct
16 Correct 36 ms 8788 KB Output is correct
17 Correct 37 ms 8912 KB Output is correct
18 Correct 9 ms 5844 KB Output is correct
19 Correct 10 ms 5040 KB Output is correct
20 Correct 39 ms 9528 KB Output is correct
21 Correct 41 ms 9284 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 10 ms 4616 KB Output is correct
24 Correct 7 ms 4568 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 9 ms 5916 KB Output is correct
28 Correct 8 ms 4948 KB Output is correct
29 Correct 7 ms 4696 KB Output is correct
30 Correct 6 ms 4740 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 191 ms 83000 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 158 ms 81320 KB Output is correct
39 Correct 145 ms 79028 KB Output is correct
40 Correct 148 ms 77416 KB Output is correct
41 Correct 146 ms 77860 KB Output is correct
42 Correct 121 ms 62260 KB Output is correct
43 Correct 195 ms 54296 KB Output is correct
44 Correct 176 ms 55576 KB Output is correct
45 Correct 160 ms 55740 KB Output is correct
46 Correct 163 ms 55228 KB Output is correct
47 Correct 128 ms 62864 KB Output is correct
48 Correct 122 ms 62516 KB Output is correct
49 Correct 141 ms 64452 KB Output is correct
50 Correct 142 ms 64488 KB Output is correct
51 Correct 141 ms 76860 KB Output is correct
52 Correct 140 ms 76664 KB Output is correct
53 Correct 142 ms 53524 KB Output is correct
54 Correct 132 ms 53468 KB Output is correct
55 Correct 142 ms 50320 KB Output is correct
56 Correct 191 ms 50460 KB Output is correct
57 Correct 168 ms 56028 KB Output is correct
58 Correct 159 ms 55884 KB Output is correct
59 Correct 158 ms 55632 KB Output is correct
60 Correct 205 ms 54072 KB Output is correct
61 Correct 134 ms 63524 KB Output is correct
62 Correct 135 ms 64004 KB Output is correct
63 Correct 149 ms 63576 KB Output is correct
64 Correct 147 ms 66032 KB Output is correct
65 Correct 229 ms 59288 KB Output is correct
66 Correct 228 ms 55808 KB Output is correct
67 Correct 184 ms 54520 KB Output is correct
68 Correct 118 ms 50072 KB Output is correct
69 Correct 138 ms 50076 KB Output is correct
70 Correct 164 ms 67784 KB Output is correct
71 Correct 130 ms 64076 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 6 ms 4604 KB Output is correct
74 Correct 7 ms 4564 KB Output is correct
75 Correct 0 ms 340 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 9 ms 5972 KB Output is correct
78 Correct 8 ms 4948 KB Output is correct
79 Correct 7 ms 4692 KB Output is correct
80 Correct 7 ms 4776 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 38 ms 8704 KB Output is correct
87 Correct 41 ms 8784 KB Output is correct
88 Correct 43 ms 8964 KB Output is correct
89 Correct 10 ms 5844 KB Output is correct
90 Correct 9 ms 4948 KB Output is correct
91 Correct 46 ms 9544 KB Output is correct
92 Correct 40 ms 9324 KB Output is correct
93 Correct 0 ms 340 KB Output is correct
94 Correct 170 ms 82972 KB Output is correct
95 Correct 166 ms 81228 KB Output is correct
96 Correct 148 ms 79020 KB Output is correct
97 Correct 139 ms 77460 KB Output is correct
98 Correct 146 ms 77872 KB Output is correct
99 Correct 175 ms 56488 KB Output is correct
100 Correct 163 ms 56116 KB Output is correct
101 Correct 174 ms 56072 KB Output is correct
102 Correct 155 ms 54464 KB Output is correct
103 Correct 129 ms 62660 KB Output is correct
104 Correct 132 ms 63736 KB Output is correct
105 Correct 129 ms 62352 KB Output is correct
106 Correct 138 ms 65064 KB Output is correct
107 Correct 151 ms 64304 KB Output is correct
108 Correct 139 ms 76804 KB Output is correct
109 Correct 141 ms 76840 KB Output is correct
110 Correct 137 ms 53592 KB Output is correct
111 Correct 138 ms 53464 KB Output is correct
112 Correct 143 ms 50052 KB Output is correct
113 Correct 158 ms 50612 KB Output is correct