oj.uz

Submission #1029181

# Submission time Handle Problem Language Result Execution time Memory
1029181 2024-07-20T13:34:22 Z marvinthang Flooding Wall (BOI24_wall) C++17
100 / 100
 1731 ms 125540 KB 
/*************************************
*    author: marvinthang             *
*    created: 06.05.2024 16:21:48    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

const int MOD = 1e9 + 7;
namespace MODULAR {
    inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) {
        unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
    #ifdef __GNUC__
        asm(
            "divl %4 \n\t"
            : "=a" (d), "=d" (m)
            : "d" (xh), "a" (xl), "r" (y)
        );
    #else
        __asm {
            mov edx, dword ptr[xh];
            mov eax, dword ptr[xl];
            div dword ptr[y];
            mov dword ptr[d], eax;
            mov dword ptr[m], edx;
        };
    #endif
        out_d = d; out_m = m;
    }
    template <class T> T invGeneral(T a, T b) {
        a %= b;
        if (!a) return b == 1 ? 0 : -1;
        T x = invGeneral(b, a);
        return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b;
    }
    template <int MOD> struct ModInt {
        unsigned int val;
        ModInt(void): val(0) {}
        ModInt(const long long &x) { *this = x; }
        ModInt & normalize(const unsigned int &v) {
            val = v >= MOD ? v - MOD : v;
            return *this;
        }
        bool operator ! (void) { return !val; }
        ModInt & operator = (const ModInt &x) { val = x.val; return *this; }
        ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); }
        ModInt operator - (void) { return ModInt(MOD - val); }
        ModInt & operator += (const ModInt &other) { return normalize(val + other.val); }
        ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); }
        ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); }
        ModInt & operator *= (const ModInt &other) {
            unsigned dummy;
            fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val);
            return *this;
        }
        ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; }
        ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; }
        ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; }
        ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; }
        ModInt pow(long long n) const {
            assert(n >= 0);
            ModInt res = 1, a = *this;
            for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
            return res;
        }
        ModInt inv(void) const {
            int i = invGeneral((int) val, MOD);
            assert(~i);
            return i;
        }
        ModInt & operator ++ (void) { return *this += 1; }
        ModInt & operator -- (void) { return *this -= 1; }
        ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; }
        ModInt operator -- (int) { ModInt old = *this; operator --(); return old; }
        friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; }
        friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; }
        friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; }
        friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; }
        friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; }
        friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; }
        explicit operator bool(void) const { return val; }
        explicit operator int(void) const { return val; }
    };  
    using Modular = ModInt <MOD>;
}
using namespace MODULAR;

// end of template

vector <Modular> pw2, pw_inv2;

struct SegmentTree {
	int n;
	vector <Modular> st;
	vector <int> lazy;
	SegmentTree(const vector <Modular> &val) {
		n = val.size();	
		st.resize(n * 4 + 23);
		lazy.resize(n * 4 + 23);
		build(1, 0, n, val);
	}
	void build(int i, int l, int r, const vector <Modular> &val) {
		if (r - l == 1) {
			st[i] = val[l];
			return;
		}
		int m = l + r >> 1;
		build(i << 1, l, m, val);
		build(i << 1 | 1, m, r, val);
		st[i] = st[i << 1] + st[i << 1 | 1];
	}
	void apply(int i, int v) {
	}
	void pushDown(int i) {
		if (lazy[i]) {
			Modular v = lazy[i] > 0 ? pw2[lazy[i]] : pw_inv2[-lazy[i]];
			st[i << 1] *= v;
			st[i << 1 | 1] *= v;
			lazy[i << 1] += lazy[i];
			lazy[i << 1 | 1] += lazy[i];
			lazy[i] = 0;
		}
	}
	void update(int i, int l, int r, int u, int v, int val) {
		if (l >= v || r <= u || u >= v) return;
		if (u <= l && r <= v) {
			lazy[i] += val;
			st[i] *= (val > 0 ? pw2[val] : pw_inv2[-val]);
			return;
		}
		pushDown(i);
		int m = l + r >> 1;
		update(i << 1, l, m, u, v, val);
		update(i << 1 | 1, m, r, u, v, val);
		st[i] = st[i << 1] + st[i << 1 | 1];
	}
	Modular get(int i, int l, int r, int u, int v) {
		if (l >= v || r <= u || u >= v) return 0;
		if (u <= l && r <= v) return st[i];
		pushDown(i);
		int m = l + r >> 1;
		return get(i << 1, l, m, u, v) + get(i << 1 | 1, m, r, u, v);
	}
	void update(int l, int r, int v) {
		update(1, 0, n, l, r, v);
	}
	Modular get(int l, int r) {
		return get(1, 0, n, l, r);
	}
};

void process(void) {
	int n; cin >> n;
	vector <int> a(n), b(n); cin >> a >> b;
	vector <int> c(a); c.insert(c.end(), ALL(b));
	sort(ALL(c)); c.erase(unique(ALL(c)), c.end());
	int m = c.size();
	REP(i, n) {
		a[i] = lower_bound(ALL(c), a[i]) - c.begin();
		b[i] = lower_bound(ALL(c), b[i]) - c.begin();
		if (a[i] > b[i]) swap(a[i], b[i]);
	}
	Modular res;
	pw2.resize(n + 1);
	pw_inv2.resize(n + 1);
	pw2[0] = pw_inv2[0] = 1;
	Modular inv2 = Modular(2).inv();
	FORE(i, 1, n) pw2[i] = pw2[i - 1] + pw2[i - 1];
	FORE(i, 1, n) pw_inv2[i] = pw_inv2[i - 1] * inv2;

	vector <Modular> v(m);
	REP(i, m) v[i] = c[i] - (i ? c[i - 1] : 0);
	SegmentTree st_pref(v);

	vector <int> cnt(m);
	REP(i, n) ++cnt[b[i]];
	int cur = 0;
	REP(i, m) {
		v[i] *= pw2[cur];
		cur += cnt[i];
	}
	SegmentTree st_suff(v), st_pxs(v);

	vector <int> suff(n);
	REPD(i, n - 1) suff[i] = max(suff[i + 1], a[i + 1]);
	int pref = 0;
	REP(i, n) {
		st_suff.update(b[i] + 1, m, -1);
		st_pxs.update(b[i] + 1, m, -1);
		auto calc = [&] (int v) {
			Modular cur = pw2[n - 1] * (c.back() - c[v]), a, b, ab;
			cur -= st_pref.get(max(v, pref) + 1, m) * pw2[n - i - 1];
			cur -= st_suff.get(max(v, suff[i]) + 1, m) * pw2[i];
			cur += st_pxs.get(max({v, pref, suff[i]}) + 1, m);
			return cur;
		};
		res += calc(a[i]) + calc(b[i]);
		st_pref.update(b[i] + 1, m, +1);
		st_pxs.update(b[i] + 1, m, +1);
		pref = max(pref, a[i]);
	}
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("wall");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

Main.cpp: In member function 'void SegmentTree::build(int, int, int, const std::vector<MODULAR::ModInt<1000000007> >&)':
Main.cpp:141:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  141 |   int m = l + r >> 1;
      |           ~~^~~
Main.cpp: In member function 'void SegmentTree::update(int, int, int, int, int, int)':
Main.cpp:166:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  166 |   int m = l + r >> 1;
      |           ~~^~~
Main.cpp: In member function 'MODULAR::Modular SegmentTree::get(int, int, int, int, int)':
Main.cpp:175:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  175 |   int m = l + r >> 1;
      |           ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:241:2: note: in expansion of macro 'file'
  241 |  file("wall");
      |  ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:241:2: note: in expansion of macro 'file'
  241 |  file("wall");
      |  ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 388 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 856 KB Output is correct
28 Correct 11 ms 860 KB Output is correct
29 Correct 2 ms 576 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 5 ms 600 KB Output is correct
32 Correct 5 ms 604 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 4 ms 604 KB Output is correct
35 Correct 5 ms 856 KB Output is correct
36 Correct 5 ms 604 KB Output is correct
37 Correct 2 ms 576 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 4 ms 776 KB Output is correct
40 Correct 4 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 388 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 508 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 12 ms 856 KB Output is correct
50 Correct 11 ms 860 KB Output is correct
51 Correct 2 ms 576 KB Output is correct
52 Correct 2 ms 600 KB Output is correct
53 Correct 5 ms 600 KB Output is correct
54 Correct 5 ms 604 KB Output is correct
55 Correct 4 ms 604 KB Output is correct
56 Correct 4 ms 604 KB Output is correct
57 Correct 5 ms 856 KB Output is correct
58 Correct 5 ms 604 KB Output is correct
59 Correct 2 ms 576 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 4 ms 776 KB Output is correct
62 Correct 4 ms 604 KB Output is correct
63 Correct 19 ms 2908 KB Output is correct
64 Correct 19 ms 2904 KB Output is correct
65 Correct 5 ms 912 KB Output is correct
66 Correct 5 ms 604 KB Output is correct
67 Correct 5 ms 900 KB Output is correct
68 Correct 4 ms 536 KB Output is correct
69 Correct 13 ms 1116 KB Output is correct
70 Correct 13 ms 1116 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 83 ms 15872 KB Output is correct
15 Correct 79 ms 16048 KB Output is correct
16 Correct 84 ms 15876 KB Output is correct
17 Correct 83 ms 16044 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 388 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 508 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 12 ms 856 KB Output is correct
50 Correct 11 ms 860 KB Output is correct
51 Correct 2 ms 576 KB Output is correct
52 Correct 2 ms 600 KB Output is correct
53 Correct 5 ms 600 KB Output is correct
54 Correct 5 ms 604 KB Output is correct
55 Correct 4 ms 604 KB Output is correct
56 Correct 4 ms 604 KB Output is correct
57 Correct 5 ms 856 KB Output is correct
58 Correct 5 ms 604 KB Output is correct
59 Correct 2 ms 576 KB Output is correct
60 Correct 2 ms 604 KB Output is correct
61 Correct 4 ms 776 KB Output is correct
62 Correct 4 ms 604 KB Output is correct
63 Correct 19 ms 2908 KB Output is correct
64 Correct 19 ms 2904 KB Output is correct
65 Correct 5 ms 912 KB Output is correct
66 Correct 5 ms 604 KB Output is correct
67 Correct 5 ms 900 KB Output is correct
68 Correct 4 ms 536 KB Output is correct
69 Correct 13 ms 1116 KB Output is correct
70 Correct 13 ms 1116 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 2 ms 600 KB Output is correct
81 Correct 2 ms 572 KB Output is correct
82 Correct 3 ms 604 KB Output is correct
83 Correct 3 ms 604 KB Output is correct
84 Correct 83 ms 15872 KB Output is correct
85 Correct 79 ms 16048 KB Output is correct
86 Correct 84 ms 15876 KB Output is correct
87 Correct 83 ms 16044 KB Output is correct
88 Correct 1669 ms 125528 KB Output is correct
89 Correct 1731 ms 125540 KB Output is correct
90 Correct 215 ms 15968 KB Output is correct
91 Correct 243 ms 23784 KB Output is correct
92 Correct 240 ms 15972 KB Output is correct
93 Correct 244 ms 16084 KB Output is correct
94 Correct 232 ms 23768 KB Output is correct
95 Correct 233 ms 15960 KB Output is correct
96 Correct 962 ms 45396 KB Output is correct
97 Correct 874 ms 45456 KB Output is correct