oj.uz

Submission #143366

# Submission time Handle Problem Language Result Execution time Memory
143366 2019-08-13T20:12:13 Z rqi Vision Program (IOI19_vision) C++14
100 / 100
 15 ms 1784 KB 

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include "vision.h"
#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 all(x) begin(x), end(x)
#define rsz resize
 
const int MOD = 998244353; // 998244353
const ll INF = 1e18;
const int MX = 200005;
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); }
 
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; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        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> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    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 modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
    friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }
 
    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};
 
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rows[205];
int cols[205];
int nrows[205];
int ncols[205];
int zero, one;
int curnum;
vi sumbits;
vi kbits;
vi xorbits;

void ad(int pindex){
	// put carry first, remember to update curnum
	// smallest bit to largest bit
	int carry = pindex;
	for(int i = 0; i < 9; i++){
		vector<int> v = {sumbits[i], carry};
		carry = add_and(v);
		sumbits[i] = add_xor(v);
	}
}
void construct_network(int H, int W, int K){
	// construct row 1s and 0s
	for(int i = 0; i < H; i++){
		vector<int> v;
		for(int j = 0; j < W; j++){
			v.pb(W*i+j);
		}
		rows[i] = add_xor(v);
    }
    
    
	for(int i = 0; i < W; i++){
		vector<int> v;
		for(int j = 0; j < H; j++){
			v.pb(i+W*j);
		}
		cols[i] = add_xor(v);
    }
    // make 0 and 1
	zero = add_and({0, add_not(0)});
	one = add_or({0, add_not(0)});
	
	// make nrows
	nrows[0] = add_or({rows[0]});
	for(int i = 1; i < H; i++){
		nrows[i] = add_xor({rows[i], nrows[i-1]});
	}
	// make ncols
	ncols[0] = add_or({cols[0]});
	for(int i = 1; i < W; i++){
		ncols[i] = add_xor({cols[i], ncols[i-1]});
	}
	// add 1
	for(int i = 0; i < 9; i++){
		sumbits.pb(add_or({zero})); //9 bits
	}
	for(int i = 0; i < H; i++){
		ad(nrows[i]);
	}
	
	for(int i = 0; i < W; i++){
		ad(ncols[i]);
    }
    // construct kbits
    int bits = K;
    for(int i = 0; i < 9; i++){
		if(bits % 2 == 1){
			kbits.pb(add_or({one}));
		}
		else{
			kbits.pb(add_or({zero}));
		}
		bits/=2;
	}
	// construct xorbits
	for(int i = 0; i < 9; i++){
		xorbits.pb(add_xor({kbits[i], sumbits[i]}));
	}
	// 1 when it should be a 0
	// output ans
	add_not(add_or(xorbits));
}

Compilation message

vision.cpp: In function 'void io::setIn(std::__cxx11::string)':
vision.cpp:116: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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
vision.cpp: In function 'void io::setOut(std::__cxx11::string)':
vision.cpp:117: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 5 ms 632 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 6 ms 888 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 6 ms 760 KB Output is correct
46 Correct 6 ms 760 KB Output is correct
47 Correct 6 ms 760 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 4 ms 632 KB Output is correct
8 Correct 5 ms 760 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 5 ms 760 KB Output is correct
11 Correct 5 ms 760 KB Output is correct
12 Correct 5 ms 764 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 4 ms 632 KB Output is correct
18 Correct 4 ms 636 KB Output is correct
19 Correct 4 ms 636 KB Output is correct
20 Correct 9 ms 1140 KB Output is correct
21 Correct 9 ms 1140 KB Output is correct
22 Correct 9 ms 1140 KB Output is correct
23 Correct 9 ms 1140 KB Output is correct
24 Correct 10 ms 1140 KB Output is correct
25 Correct 9 ms 1140 KB Output is correct
26 Correct 9 ms 1140 KB Output is correct
27 Correct 14 ms 1780 KB Output is correct
28 Correct 14 ms 1780 KB Output is correct
29 Correct 14 ms 1652 KB Output is correct
30 Correct 14 ms 1780 KB Output is correct
31 Correct 14 ms 1652 KB Output is correct
32 Correct 2 ms 372 KB Output is correct
33 Correct 2 ms 376 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1784 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 5 ms 760 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 632 KB Output is correct
7 Correct 9 ms 1140 KB Output is correct
8 Correct 9 ms 1112 KB Output is correct
9 Correct 14 ms 1656 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 5 ms 632 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 6 ms 888 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 6 ms 760 KB Output is correct
46 Correct 6 ms 760 KB Output is correct
47 Correct 6 ms 760 KB Output is correct
48 Correct 4 ms 632 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 4 ms 632 KB Output is correct
51 Correct 4 ms 632 KB Output is correct
52 Correct 4 ms 636 KB Output is correct
53 Correct 4 ms 632 KB Output is correct
54 Correct 4 ms 632 KB Output is correct
55 Correct 4 ms 632 KB Output is correct
56 Correct 4 ms 632 KB Output is correct
57 Correct 4 ms 632 KB Output is correct
58 Correct 4 ms 632 KB Output is correct
59 Correct 4 ms 636 KB Output is correct
60 Correct 4 ms 632 KB Output is correct
61 Correct 5 ms 632 KB Output is correct
62 Correct 4 ms 632 KB Output is correct
63 Correct 4 ms 632 KB Output is correct
64 Correct 5 ms 632 KB Output is correct
65 Correct 4 ms 632 KB Output is correct
66 Correct 4 ms 632 KB Output is correct
67 Correct 4 ms 632 KB Output is correct
68 Correct 2 ms 256 KB Output is correct
69 Correct 2 ms 256 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 2 ms 376 KB Output is correct
72 Correct 4 ms 632 KB Output is correct
73 Correct 4 ms 632 KB Output is correct
74 Correct 4 ms 632 KB Output is correct
75 Correct 4 ms 632 KB Output is correct
76 Correct 4 ms 632 KB Output is correct
77 Correct 5 ms 760 KB Output is correct
78 Correct 5 ms 760 KB Output is correct
79 Correct 5 ms 760 KB Output is correct
80 Correct 5 ms 760 KB Output is correct
81 Correct 5 ms 764 KB Output is correct
82 Correct 4 ms 632 KB Output is correct
83 Correct 4 ms 632 KB Output is correct
84 Correct 4 ms 632 KB Output is correct
85 Correct 4 ms 632 KB Output is correct
86 Correct 4 ms 632 KB Output is correct
87 Correct 4 ms 636 KB Output is correct
88 Correct 4 ms 636 KB Output is correct
89 Correct 9 ms 1140 KB Output is correct
90 Correct 9 ms 1140 KB Output is correct
91 Correct 9 ms 1140 KB Output is correct
92 Correct 9 ms 1140 KB Output is correct
93 Correct 10 ms 1140 KB Output is correct
94 Correct 9 ms 1140 KB Output is correct
95 Correct 9 ms 1140 KB Output is correct
96 Correct 14 ms 1780 KB Output is correct
97 Correct 14 ms 1780 KB Output is correct
98 Correct 14 ms 1652 KB Output is correct
99 Correct 14 ms 1780 KB Output is correct
100 Correct 14 ms 1652 KB Output is correct
101 Correct 2 ms 372 KB Output is correct
102 Correct 2 ms 376 KB Output is correct
103 Correct 14 ms 1784 KB Output is correct
104 Correct 2 ms 376 KB Output is correct
105 Correct 4 ms 632 KB Output is correct
106 Correct 5 ms 760 KB Output is correct
107 Correct 4 ms 632 KB Output is correct
108 Correct 4 ms 632 KB Output is correct
109 Correct 9 ms 1140 KB Output is correct
110 Correct 9 ms 1112 KB Output is correct
111 Correct 14 ms 1656 KB Output is correct
112 Correct 2 ms 256 KB Output is correct
113 Correct 2 ms 376 KB Output is correct
114 Correct 14 ms 1780 KB Output is correct
115 Correct 4 ms 632 KB Output is correct
116 Correct 4 ms 632 KB Output is correct
117 Correct 9 ms 1140 KB Output is correct
118 Correct 9 ms 1112 KB Output is correct
119 Correct 14 ms 1652 KB Output is correct
120 Correct 14 ms 1700 KB Output is correct
121 Correct 15 ms 1780 KB Output is correct
122 Correct 15 ms 1780 KB Output is correct
123 Correct 15 ms 1780 KB Output is correct
124 Correct 15 ms 1724 KB Output is correct
125 Correct 14 ms 1780 KB Output is correct
126 Correct 14 ms 1780 KB Output is correct
127 Correct 15 ms 1780 KB Output is correct
128 Correct 15 ms 1780 KB Output is correct