oj.uz

Submission #411696

# Submission time Handle Problem Language Result Execution time Memory
411696 2021-05-25T18:19:23 Z b00n0rp Amusement Park (CEOI19_amusementpark) C++17
100 / 100
 2538 ms 4668 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 998244353;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------

// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 

// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m;
int indp[(1<<20)];
int dp[(1<<20)];
 
void solvethetestcase(){
    cin >> n >> m;
    REP(i,(1<<n)) indp[i] = 1;
    REP(i,m){
        int u,v; cin >> u >> v;
        u--;
        v--;
        REP(j,(1<<n)){
            if((1<<u)&j and (1<<v)&j) indp[j] = 0; 
        }
    }
    dp[0] = 1;
    FOR(i,1,(1<<n)){
        dp[i] = 0;
        for(int j = i; j > 0; j = i&(j-1)){
            if(!indp[j]) continue;
            if(__builtin_popcount(j)%2){
                dp[i] = add(dp[i],dp[i^j]);
            }
            else{
                dp[i] = mod_neg(dp[i],dp[i^j]);
            }
        }
    }
    int ans = dp[(1<<n)-1];
    ans = (ans*((FMOD+1)/2))%FMOD;
    ans = (ans*m)%FMOD;
    cout << ans << "\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 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 332 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 2 ms 328 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 328 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 320 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 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 332 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 2 ms 328 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 328 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 320 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 12 ms 460 KB Output is correct
66 Correct 12 ms 588 KB Output is correct
67 Correct 13 ms 552 KB Output is correct
68 Correct 12 ms 572 KB Output is correct
69 Correct 27 ms 644 KB Output is correct
70 Correct 17 ms 460 KB Output is correct
71 Correct 17 ms 588 KB Output is correct
72 Correct 17 ms 584 KB Output is correct
73 Correct 18 ms 588 KB Output is correct
74 Correct 14 ms 588 KB Output is correct
75 Correct 14 ms 552 KB Output is correct
76 Correct 14 ms 580 KB Output is correct
77 Correct 37 ms 844 KB Output is correct
78 Correct 33 ms 716 KB Output is correct
79 Correct 37 ms 844 KB Output is correct
80 Correct 34 ms 836 KB Output is correct
81 Correct 35 ms 708 KB Output is correct
82 Correct 26 ms 800 KB Output is correct
83 Correct 30 ms 844 KB Output is correct
84 Correct 25 ms 848 KB Output is correct
85 Correct 88 ms 824 KB Output is correct
86 Correct 50 ms 772 KB Output is correct
87 Correct 50 ms 768 KB Output is correct
88 Correct 50 ms 780 KB Output is correct
89 Correct 42 ms 780 KB Output is correct
90 Correct 53 ms 824 KB Output is correct
91 Correct 39 ms 768 KB Output is correct
92 Correct 54 ms 788 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 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 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 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 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 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 332 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 2 ms 328 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 2 ms 328 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 2 ms 320 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 12 ms 460 KB Output is correct
66 Correct 12 ms 588 KB Output is correct
67 Correct 13 ms 552 KB Output is correct
68 Correct 12 ms 572 KB Output is correct
69 Correct 27 ms 644 KB Output is correct
70 Correct 17 ms 460 KB Output is correct
71 Correct 17 ms 588 KB Output is correct
72 Correct 17 ms 584 KB Output is correct
73 Correct 18 ms 588 KB Output is correct
74 Correct 14 ms 588 KB Output is correct
75 Correct 14 ms 552 KB Output is correct
76 Correct 14 ms 580 KB Output is correct
77 Correct 37 ms 844 KB Output is correct
78 Correct 33 ms 716 KB Output is correct
79 Correct 37 ms 844 KB Output is correct
80 Correct 34 ms 836 KB Output is correct
81 Correct 35 ms 708 KB Output is correct
82 Correct 26 ms 800 KB Output is correct
83 Correct 30 ms 844 KB Output is correct
84 Correct 25 ms 848 KB Output is correct
85 Correct 88 ms 824 KB Output is correct
86 Correct 50 ms 772 KB Output is correct
87 Correct 50 ms 768 KB Output is correct
88 Correct 50 ms 780 KB Output is correct
89 Correct 42 ms 780 KB Output is correct
90 Correct 53 ms 824 KB Output is correct
91 Correct 39 ms 768 KB Output is correct
92 Correct 54 ms 788 KB Output is correct
93 Correct 1472 ms 4480 KB Output is correct
94 Correct 1484 ms 4568 KB Output is correct
95 Correct 1462 ms 4348 KB Output is correct
96 Correct 1171 ms 4472 KB Output is correct
97 Correct 1053 ms 4512 KB Output is correct
98 Correct 1140 ms 4412 KB Output is correct
99 Correct 116 ms 1348 KB Output is correct
100 Correct 99 ms 1296 KB Output is correct
101 Correct 92 ms 1360 KB Output is correct
102 Correct 82 ms 1348 KB Output is correct
103 Correct 808 ms 2352 KB Output is correct
104 Correct 463 ms 2244 KB Output is correct
105 Correct 383 ms 2372 KB Output is correct
106 Correct 289 ms 2376 KB Output is correct
107 Correct 2538 ms 4368 KB Output is correct
108 Correct 1100 ms 4412 KB Output is correct
109 Correct 838 ms 4532 KB Output is correct
110 Correct 747 ms 4496 KB Output is correct
111 Correct 81 ms 1348 KB Output is correct
112 Correct 72 ms 1224 KB Output is correct
113 Correct 69 ms 1344 KB Output is correct
114 Correct 199 ms 1400 KB Output is correct
115 Correct 149 ms 1348 KB Output is correct
116 Correct 150 ms 1348 KB Output is correct
117 Correct 143 ms 1320 KB Output is correct
118 Correct 124 ms 1220 KB Output is correct
119 Correct 117 ms 1348 KB Output is correct
120 Correct 116 ms 1344 KB Output is correct
121 Correct 113 ms 1220 KB Output is correct
122 Correct 256 ms 2324 KB Output is correct
123 Correct 223 ms 2372 KB Output is correct
124 Correct 220 ms 2284 KB Output is correct
125 Correct 205 ms 2364 KB Output is correct
126 Correct 196 ms 2524 KB Output is correct
127 Correct 199 ms 2248 KB Output is correct
128 Correct 177 ms 2248 KB Output is correct
129 Correct 174 ms 2452 KB Output is correct
130 Correct 194 ms 2284 KB Output is correct
131 Correct 610 ms 2360 KB Output is correct
132 Correct 476 ms 2372 KB Output is correct
133 Correct 505 ms 2332 KB Output is correct
134 Correct 448 ms 2360 KB Output is correct
135 Correct 373 ms 2356 KB Output is correct
136 Correct 353 ms 2368 KB Output is correct
137 Correct 358 ms 2364 KB Output is correct
138 Correct 339 ms 2340 KB Output is correct
139 Correct 312 ms 2364 KB Output is correct
140 Correct 304 ms 2324 KB Output is correct
141 Correct 298 ms 2328 KB Output is correct
142 Correct 626 ms 4416 KB Output is correct
143 Correct 597 ms 4668 KB Output is correct
144 Correct 569 ms 4372 KB Output is correct
145 Correct 539 ms 4292 KB Output is correct
146 Correct 553 ms 4376 KB Output is correct
147 Correct 503 ms 4420 KB Output is correct
148 Correct 655 ms 4380 KB Output is correct
149 Correct 628 ms 4396 KB Output is correct
150 Correct 625 ms 4528 KB Output is correct
151 Correct 783 ms 4496 KB Output is correct
152 Correct 765 ms 4520 KB Output is correct
153 Correct 1190 ms 4524 KB Output is correct
154 Correct 1168 ms 4548 KB Output is correct
155 Correct 1088 ms 4404 KB Output is correct
156 Correct 1041 ms 4412 KB Output is correct
157 Correct 1105 ms 4472 KB Output is correct
158 Correct 1071 ms 4464 KB Output is correct
159 Correct 1004 ms 4396 KB Output is correct
160 Correct 918 ms 4372 KB Output is correct
161 Correct 866 ms 4420 KB Output is correct
162 Correct 865 ms 4532 KB Output is correct
163 Correct 836 ms 4300 KB Output is correct
164 Correct 793 ms 4508 KB Output is correct
165 Correct 772 ms 4548 KB Output is correct
166 Correct 739 ms 4420 KB Output is correct
167 Correct 719 ms 4532 KB Output is correct