oj.uz

Submission #435524

# Submission time Handle Problem Language Result Execution time Memory
435524 2021-06-23T11:57:00 Z Benq Fountain Parks (IOI21_parks) C++17
100 / 100
 543 ms 43304 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>; 
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>; 
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back 
#define pf push_front
#define rtn return

#define lb lower_bound
#define ub upper_bound 
tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); }

// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

// bitwise ops
// also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html
constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ...
    return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int p2(int x) { return 1<<x; }
constexpr int msk2(int x) { return p2(x)-1; }

ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down

tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; } // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; }

tcTU> T fstTrue(T lo, T hi, U f) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo)/2;
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
tcTU> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = lo+(hi-lo+1)/2;
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
tcT> void remDup(vector<T>& v) { // sort and remove duplicates
    sort(all(v)); v.erase(unique(all(v)),end(v)); }
tcTU> void erase(T& t, const U& u) { // don't erase
    auto it = t.find(u); assert(it != end(t));
    t.erase(it); } // element that doesn't exist from (multi)set

#define tcTUU tcT, class ...U

inline namespace Helpers {
    //////////// is_iterable
    // https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
    // this gets used only when we can call begin() and end() on that type
    tcT, class = void> struct is_iterable : false_type {};
    tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
                                      decltype(end(declval<T>()))
                                     >
                           > : true_type {};
    tcT> constexpr bool is_iterable_v = is_iterable<T>::value;

    //////////// is_readable
    tcT, class = void> struct is_readable : false_type {};
    tcT> struct is_readable<T,
            typename std::enable_if_t<
                is_same_v<decltype(cin >> declval<T&>()), istream&>
            >
        > : true_type {};
    tcT> constexpr bool is_readable_v = is_readable<T>::value;

    //////////// is_printable
    // // https://nafe.es/posts/2020-02-29-is-printable/
    tcT, class = void> struct is_printable : false_type {};
    tcT> struct is_printable<T,
            typename std::enable_if_t<
                is_same_v<decltype(cout << declval<T>()), ostream&>
            >
        > : true_type {};
    tcT> constexpr bool is_printable_v = is_printable<T>::value;
}

inline namespace Input {
    tcT> constexpr bool needs_input_v = !is_readable_v<T> && is_iterable_v<T>;
    tcTUU> void re(T& t, U&... u);
    tcTU> void re(pair<T,U>& p); // pairs

    // re: read
    tcT> typename enable_if<is_readable_v<T>,void>::type re(T& x) { cin >> x; } // default
    tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; } // complex
    tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i); // ex. vectors, arrays
    tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
    tcT> typename enable_if<needs_input_v<T>,void>::type re(T& i) {
        each(x,i) re(x); }
    tcTUU> void re(T& t, U&... u) { re(t); re(u...); } // read multiple

    // rv: resize and read vectors
    void rv(size_t) {}
    tcTUU> void rv(size_t N, V<T>& t, U&... u);
    template<class...U> void rv(size_t, size_t N2, U&... u);
    tcTUU> void rv(size_t N, V<T>& t, U&... u) {
        t.rsz(N); re(t);
        rv(N,u...); }
    template<class...U> void rv(size_t, size_t N2, U&... u) {
        rv(N2,u...); }

    // dumb shortcuts to read in ints
    void decrement() {} // subtract one from each
    tcTUU> void decrement(T& t, U&... u) { --t; decrement(u...); }
    #define ints(...) int __VA_ARGS__; re(__VA_ARGS__);
    #define int1(...) ints(__VA_ARGS__); decrement(__VA_ARGS__);
}

inline namespace ToString {
    tcT> constexpr bool needs_output_v = !is_printable_v<T> && is_iterable_v<T>;

    // ts: string representation to print
    tcT> typename enable_if<is_printable_v<T>,str>::type ts(T v) {
        stringstream ss; ss << fixed << setprecision(15) << v;
        return ss.str(); } // default
    tcT> str bit_vec(T t) { // bit vector to string
        str res = "{"; F0R(i,sz(t)) res += ts(t[i]);
        res += "}"; return res; }
    str ts(V<bool> v) { return bit_vec(v); }
    template<size_t SZ> str ts(bitset<SZ> b) { return bit_vec(b); } // bit vector
    tcTU> str ts(pair<T,U> p); // pairs
    tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v); // vectors, arrays
    tcTU> str ts(pair<T,U> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; }
    tcT> typename enable_if<is_iterable_v<T>,str>::type ts_sep(T v, str sep) {
        // convert container to string w/ separator sep
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += sep;
            fst = 0; res += ts(x);
        }
        return res;
    }
    tcT> typename enable_if<needs_output_v<T>,str>::type ts(T v) {
        return "{"+ts_sep(v,", ")+"}"; }

    // for nested DS
    template<int, class T> typename enable_if<!needs_output_v<T>,vs>::type 
      ts_lev(const T& v) { return {ts(v)}; }
    template<int lev, class T> typename enable_if<needs_output_v<T>,vs>::type 
      ts_lev(const T& v) {
        if (lev == 0 || !sz(v)) return {ts(v)};
        vs res;
        for (const auto& t: v) {
            if (sz(res)) res.bk += ",";
            vs tmp = ts_lev<lev-1>(t);
            res.ins(end(res),all(tmp));
        }
        F0R(i,sz(res)) {
            str bef = " "; if (i == 0) bef = "{";
            res[i] = bef+res[i];
        }
        res.bk += "}";
        return res;
    }
}

inline namespace Output {
    template<class T> void pr_sep(ostream& os, str, const T& t) { os << ts(t); }
    template<class T, class... U> void pr_sep(ostream& os, str sep, const T& t, const U&... u) {
        pr_sep(os,sep,t); os << sep; pr_sep(os,sep,u...); }
    // print w/ no spaces
    template<class ...T> void pr(const T&... t) { pr_sep(cout,"",t...); } 
    // print w/ spaces, end with newline
    void ps() { cout << "\n"; }
    template<class ...T> void ps(const T&... t) { pr_sep(cout," ",t...); ps(); } 
    // debug to cerr
    template<class ...T> void dbg_out(const T&... t) {
        pr_sep(cerr," | ",t...); cerr << endl; }
    void loc_info(int line, str names) {
        cerr << "Line(" << line << ") -> [" << names << "]: "; }
    template<int lev, class T> void dbgl_out(const T& t) {
        cerr << "\n\n" << ts_sep(ts_lev<lev>(t),"\n") << "\n" << endl; }
    #ifdef LOCAL
        #define dbg(...) loc_info(__LINE__,#__VA_ARGS__), dbg_out(__VA_ARGS__)
        #define dbgl(lev,x) loc_info(__LINE__,#x), dbgl_out<lev>(x)
    #else // don't actually submit with this
        #define dbg(...) 0
        #define dbgl(lev,x) 0
    #endif
}

inline namespace FileIO {
    void setIn(str s)  { freopen(s.c_str(),"r",stdin); }
    void setOut(str s) { freopen(s.c_str(),"w",stdout); }
    void setIO(str s = "") {
        cin.tie(0)->sync_with_stdio(0); // unsync C / C++ I/O streams
        // cin.exceptions(cin.failbit);
        // throws exception when do smth illegal
        // ex. try to read letter into int
        if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for old USACO
    }
}

#include "parks.h"

/**
 * Description: Disjoint Set Union with path compression
     * and union by size. Add edges and test connectivity. 
     * Use for Kruskal's or Boruvka's minimum spanning tree.
 * Time: O(\alpha(N))
 * Source: CSAcademy, KACTL
 * Verification: *
 */

struct DSU {
    vi e; void init(int N) { e = vi(N,-1); }
    int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
    bool sameSet(int a, int b) { return get(a) == get(b); }
    int size(int x) { return -e[get(x)]; }
    bool unite(int x, int y) { // union by size
        x = get(x), y = get(y); if (x == y) return 0;
        if (e[x] > e[y]) swap(x,y);
        e[x] += e[y]; e[y] = x; return 1;
    }
};

/**template<class T> T kruskal(int N, vector<pair<T,pi>> ed) {
    sort(all(ed));
    T ans = 0; DSU D; D.init(N); // edges that unite are in MST
    each(a,ed) if (D.unite(a.s.f,a.s.s)) ans += a.f; 
    return ans;
}*/

int construct_roads(std::vector<int> X, std::vector<int> Y) {
    int N = sz(X);
    vpi pos(N);
    F0R(i,N) pos[i] = mp(X[i],Y[i]);
    vi inds(N); iota(all(inds),0);
    sort(all(inds), [&](int a, int b) { return pos[a] < pos[b]; });
    map<pi,int> pos_to_ind;
    DSU D; D.init(N);
    set<pi> used;
    vi U,V,A,B;
    auto tri = [&](pi loc, int u, int v) {
        if (used.count(loc)) return;
        used.ins(loc);
        D.unite(u,v);
        U.pb(u), V.pb(v);
        A.pb(loc.f), B.pb(loc.s);
    };
    auto add_x_edge = [&](int x, int y) {
        int ny = y+((x+y)&2 ? 1 : -1);
        tri({x+1,ny},pos_to_ind[{x,y}],pos_to_ind[{x+2,y}]);
    };
    auto add_y_edge = [&](int x, int y) {
        int nx = x+((x+y)&2 ? -1 : 1);
        tri({nx,y+1},pos_to_ind[{x,y}],pos_to_ind[{x,y+2}]);
    };
    F0R(i,N) {
        int v = inds[i];
        pi p = pos[v];
        pos_to_ind[p] = v;
        if (pos_to_ind.count({p.f-2,p.s})) add_x_edge(p.f-2,p.s);
        if (pos_to_ind.count({p.f,p.s-2})) add_y_edge(p.f,p.s-2);
    }
    if (D.size(0) != N) return 0;
    build(U,V,A,B);
 //    if (x.size() == 1) {
	// build({}, {}, {}, {});
 //        return 1;
 //    }
 //    std::vector<int> u, v, a, b;
 //    u.push_back(0);
 //    v.push_back(1);
 //    a.push_back(x[0]+1);
 //    b.push_back(y[0]-1);
 //    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'void FileIO::setIn(str)':
parks.cpp:245:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  245 |     void setIn(str s)  { freopen(s.c_str(),"r",stdin); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
parks.cpp: In function 'void FileIO::setOut(str)':
parks.cpp:246:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  246 |     void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 518 ms 37804 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 6 ms 844 KB Output is correct
28 Correct 170 ms 15308 KB Output is correct
29 Correct 250 ms 22800 KB Output is correct
30 Correct 349 ms 30308 KB Output is correct
31 Correct 475 ms 37892 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 212 ms 19068 KB Output is correct
46 Correct 249 ms 27500 KB Output is correct
47 Correct 294 ms 27544 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 518 ms 37804 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 6 ms 844 KB Output is correct
28 Correct 170 ms 15308 KB Output is correct
29 Correct 250 ms 22800 KB Output is correct
30 Correct 349 ms 30308 KB Output is correct
31 Correct 475 ms 37892 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 212 ms 19068 KB Output is correct
46 Correct 249 ms 27500 KB Output is correct
47 Correct 294 ms 27544 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 543 ms 37788 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 10 ms 1484 KB Output is correct
59 Correct 13 ms 1884 KB Output is correct
60 Correct 211 ms 19124 KB Output is correct
61 Correct 316 ms 25636 KB Output is correct
62 Correct 389 ms 31404 KB Output is correct
63 Correct 510 ms 37876 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 430 ms 38040 KB Output is correct
68 Correct 486 ms 37860 KB Output is correct
69 Correct 406 ms 37780 KB Output is correct
70 Correct 5 ms 880 KB Output is correct
71 Correct 9 ms 1484 KB Output is correct
72 Correct 169 ms 18976 KB Output is correct
73 Correct 264 ms 28460 KB Output is correct
74 Correct 373 ms 37864 KB Output is correct
75 Correct 469 ms 41728 KB Output is correct
76 Correct 459 ms 37788 KB Output is correct
77 Correct 6 ms 1044 KB Output is correct
78 Correct 11 ms 1740 KB Output is correct
79 Correct 175 ms 20012 KB Output is correct
80 Correct 278 ms 29972 KB Output is correct
81 Correct 391 ms 39848 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 411 ms 37988 KB Output is correct
21 Correct 394 ms 37920 KB Output is correct
22 Correct 390 ms 37924 KB Output is correct
23 Correct 358 ms 32280 KB Output is correct
24 Correct 196 ms 18960 KB Output is correct
25 Correct 361 ms 31500 KB Output is correct
26 Correct 255 ms 31508 KB Output is correct
27 Correct 427 ms 37828 KB Output is correct
28 Correct 387 ms 37868 KB Output is correct
29 Correct 419 ms 37848 KB Output is correct
30 Correct 407 ms 37792 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 22 ms 3200 KB Output is correct
33 Correct 86 ms 9652 KB Output is correct
34 Correct 380 ms 37796 KB Output is correct
35 Correct 18 ms 1888 KB Output is correct
36 Correct 85 ms 8116 KB Output is correct
37 Correct 155 ms 15860 KB Output is correct
38 Correct 142 ms 15360 KB Output is correct
39 Correct 196 ms 21052 KB Output is correct
40 Correct 243 ms 26548 KB Output is correct
41 Correct 328 ms 32336 KB Output is correct
42 Correct 444 ms 37788 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 2 ms 588 KB Output is correct
55 Correct 4 ms 716 KB Output is correct
56 Correct 208 ms 19016 KB Output is correct
57 Correct 249 ms 27544 KB Output is correct
58 Correct 250 ms 27508 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 423 ms 37992 KB Output is correct
63 Correct 412 ms 37836 KB Output is correct
64 Correct 414 ms 37636 KB Output is correct
65 Correct 5 ms 844 KB Output is correct
66 Correct 9 ms 1484 KB Output is correct
67 Correct 163 ms 18988 KB Output is correct
68 Correct 270 ms 28572 KB Output is correct
69 Correct 350 ms 37872 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct
17 Correct 401 ms 37908 KB Output is correct
18 Correct 404 ms 37888 KB Output is correct
19 Correct 385 ms 37904 KB Output is correct
20 Correct 434 ms 43304 KB Output is correct
21 Correct 311 ms 35096 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 56 ms 6400 KB Output is correct
24 Correct 25 ms 3660 KB Output is correct
25 Correct 107 ms 12076 KB Output is correct
26 Correct 184 ms 20412 KB Output is correct
27 Correct 196 ms 20920 KB Output is correct
28 Correct 279 ms 26148 KB Output is correct
29 Correct 296 ms 31212 KB Output is correct
30 Correct 343 ms 36376 KB Output is correct
31 Correct 474 ms 41500 KB Output is correct
32 Correct 493 ms 41620 KB Output is correct
33 Correct 415 ms 37840 KB Output is correct
34 Correct 6 ms 1100 KB Output is correct
35 Correct 11 ms 1740 KB Output is correct
36 Correct 232 ms 20008 KB Output is correct
37 Correct 299 ms 29976 KB Output is correct
38 Correct 380 ms 39852 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 222 ms 19108 KB Output is correct
10 Correct 16 ms 2380 KB Output is correct
11 Correct 96 ms 10364 KB Output is correct
12 Correct 23 ms 3360 KB Output is correct
13 Correct 56 ms 7244 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 4 ms 588 KB Output is correct
16 Correct 195 ms 19048 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 518 ms 37804 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 4 ms 716 KB Output is correct
27 Correct 6 ms 844 KB Output is correct
28 Correct 170 ms 15308 KB Output is correct
29 Correct 250 ms 22800 KB Output is correct
30 Correct 349 ms 30308 KB Output is correct
31 Correct 475 ms 37892 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 212 ms 19068 KB Output is correct
46 Correct 249 ms 27500 KB Output is correct
47 Correct 294 ms 27544 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 543 ms 37788 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 10 ms 1484 KB Output is correct
59 Correct 13 ms 1884 KB Output is correct
60 Correct 211 ms 19124 KB Output is correct
61 Correct 316 ms 25636 KB Output is correct
62 Correct 389 ms 31404 KB Output is correct
63 Correct 510 ms 37876 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 430 ms 38040 KB Output is correct
68 Correct 486 ms 37860 KB Output is correct
69 Correct 406 ms 37780 KB Output is correct
70 Correct 5 ms 880 KB Output is correct
71 Correct 9 ms 1484 KB Output is correct
72 Correct 169 ms 18976 KB Output is correct
73 Correct 264 ms 28460 KB Output is correct
74 Correct 373 ms 37864 KB Output is correct
75 Correct 469 ms 41728 KB Output is correct
76 Correct 459 ms 37788 KB Output is correct
77 Correct 6 ms 1044 KB Output is correct
78 Correct 11 ms 1740 KB Output is correct
79 Correct 175 ms 20012 KB Output is correct
80 Correct 278 ms 29972 KB Output is correct
81 Correct 391 ms 39848 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 411 ms 37988 KB Output is correct
86 Correct 394 ms 37920 KB Output is correct
87 Correct 390 ms 37924 KB Output is correct
88 Correct 358 ms 32280 KB Output is correct
89 Correct 196 ms 18960 KB Output is correct
90 Correct 361 ms 31500 KB Output is correct
91 Correct 255 ms 31508 KB Output is correct
92 Correct 427 ms 37828 KB Output is correct
93 Correct 387 ms 37868 KB Output is correct
94 Correct 419 ms 37848 KB Output is correct
95 Correct 407 ms 37792 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 22 ms 3200 KB Output is correct
98 Correct 86 ms 9652 KB Output is correct
99 Correct 380 ms 37796 KB Output is correct
100 Correct 18 ms 1888 KB Output is correct
101 Correct 85 ms 8116 KB Output is correct
102 Correct 155 ms 15860 KB Output is correct
103 Correct 142 ms 15360 KB Output is correct
104 Correct 196 ms 21052 KB Output is correct
105 Correct 243 ms 26548 KB Output is correct
106 Correct 328 ms 32336 KB Output is correct
107 Correct 444 ms 37788 KB Output is correct
108 Correct 1 ms 204 KB Output is correct
109 Correct 1 ms 204 KB Output is correct
110 Correct 1 ms 204 KB Output is correct
111 Correct 1 ms 204 KB Output is correct
112 Correct 1 ms 204 KB Output is correct
113 Correct 1 ms 204 KB Output is correct
114 Correct 1 ms 204 KB Output is correct
115 Correct 1 ms 204 KB Output is correct
116 Correct 1 ms 204 KB Output is correct
117 Correct 1 ms 204 KB Output is correct
118 Correct 1 ms 204 KB Output is correct
119 Correct 2 ms 588 KB Output is correct
120 Correct 4 ms 716 KB Output is correct
121 Correct 208 ms 19016 KB Output is correct
122 Correct 249 ms 27544 KB Output is correct
123 Correct 250 ms 27508 KB Output is correct
124 Correct 1 ms 204 KB Output is correct
125 Correct 1 ms 204 KB Output is correct
126 Correct 1 ms 204 KB Output is correct
127 Correct 423 ms 37992 KB Output is correct
128 Correct 412 ms 37836 KB Output is correct
129 Correct 414 ms 37636 KB Output is correct
130 Correct 5 ms 844 KB Output is correct
131 Correct 9 ms 1484 KB Output is correct
132 Correct 163 ms 18988 KB Output is correct
133 Correct 270 ms 28572 KB Output is correct
134 Correct 350 ms 37872 KB Output is correct
135 Correct 401 ms 37908 KB Output is correct
136 Correct 404 ms 37888 KB Output is correct
137 Correct 385 ms 37904 KB Output is correct
138 Correct 434 ms 43304 KB Output is correct
139 Correct 311 ms 35096 KB Output is correct
140 Correct 1 ms 204 KB Output is correct
141 Correct 56 ms 6400 KB Output is correct
142 Correct 25 ms 3660 KB Output is correct
143 Correct 107 ms 12076 KB Output is correct
144 Correct 184 ms 20412 KB Output is correct
145 Correct 196 ms 20920 KB Output is correct
146 Correct 279 ms 26148 KB Output is correct
147 Correct 296 ms 31212 KB Output is correct
148 Correct 343 ms 36376 KB Output is correct
149 Correct 474 ms 41500 KB Output is correct
150 Correct 493 ms 41620 KB Output is correct
151 Correct 415 ms 37840 KB Output is correct
152 Correct 6 ms 1100 KB Output is correct
153 Correct 11 ms 1740 KB Output is correct
154 Correct 232 ms 20008 KB Output is correct
155 Correct 299 ms 29976 KB Output is correct
156 Correct 380 ms 39852 KB Output is correct
157 Correct 1 ms 204 KB Output is correct
158 Correct 1 ms 204 KB Output is correct
159 Correct 1 ms 204 KB Output is correct
160 Correct 1 ms 204 KB Output is correct
161 Correct 496 ms 37904 KB Output is correct
162 Correct 387 ms 37912 KB Output is correct
163 Correct 416 ms 37908 KB Output is correct
164 Correct 407 ms 37908 KB Output is correct
165 Correct 457 ms 37996 KB Output is correct
166 Correct 479 ms 37936 KB Output is correct
167 Correct 84 ms 9144 KB Output is correct
168 Correct 42 ms 4972 KB Output is correct
169 Correct 150 ms 12844 KB Output is correct
170 Correct 275 ms 23844 KB Output is correct
171 Correct 338 ms 31632 KB Output is correct
172 Correct 185 ms 19088 KB Output is correct
173 Correct 247 ms 23016 KB Output is correct
174 Correct 347 ms 26572 KB Output is correct
175 Correct 317 ms 30488 KB Output is correct
176 Correct 374 ms 34180 KB Output is correct
177 Correct 408 ms 37924 KB Output is correct