oj.uz

Submission #412618

# Submission time Handle Problem Language Result Execution time Memory
412618 2021-05-27T07:54:10 Z b00n0rp Event Hopping 2 (JOI21_event2) C++17
100 / 100
 489 ms 67196 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 = 200005;
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 = 1000000007;
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,k;
pii a[MAXN],b[MAXN];
int prv[MAXN][21];

int get(int l,int r){
    int res = 0;
    FORD(j,20,0){
        if(prv[r][j] >= l){
            res += (1<<j);
            r = prv[r][j];
        }
    }
    return res;
}
 
void solvethetestcase(){
    cin >> n >> k;
    set<int> s;
    mii m;
    REP(i,n){
        cin >> a[i].F >> a[i].S;
        s.insert(a[i].F);
        s.insert(a[i].S);
    }
    int cur = 1;
    for(auto x:s) m[x] = cur++;
    REP(i,n){
        a[i].F = m[a[i].F];
        a[i].S = m[a[i].S];
        b[i] = {a[i].S,a[i].F};
    }
    sort(b,b+n);
    prv[0][0] = 0;
    int ind = 0,mx = 0;
    FOR(i,1,2*n+1){
        while(ind < n and b[ind].F <= i){
            remax(mx,b[ind].S);
            ind++;
        }
        prv[i][0] = mx;
    }
    FOR(j,1,21){
        REP(i,2*n+1){
            prv[i][j] = prv[prv[i][j-1]][j-1];
        }
    }
    set<pii> gg;
    gg.insert({1,1});
    gg.insert({2*n,2*n});
    mx = get(1,2*n);
    if(mx < k){
        cout << "-1\n";
        return;
    }
    vi ans;
    REP(i,n){
        auto itl = gg.lower_bound({a[i].F,INF});
        itl--;
        int l = (*itl).S;
        auto itr = gg.lower_bound({a[i].S,a[i].S});
        int r = (*itr).F;
        if(l > a[i].F or r < a[i].S) continue;
        itl++;
        if(itl != itr) continue;
        int new_mx = mx+1+get(l,a[i].F)+get(a[i].S,r)-get(l,r);
        if(new_mx < k) continue;
        ans.pb(i+1);
        mx = new_mx;
        gg.insert(a[i]);
        if(SZ(ans) == k) break;
    }
    for(auto x:ans){
        cout << x << "\n";
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 284 ms 65256 KB Output is correct
5 Correct 277 ms 66920 KB Output is correct
6 Correct 273 ms 66500 KB Output is correct
7 Correct 293 ms 65856 KB Output is correct
8 Correct 279 ms 67196 KB Output is correct
9 Correct 290 ms 66868 KB Output is correct
10 Correct 281 ms 66588 KB Output is correct
11 Correct 288 ms 65860 KB Output is correct
12 Correct 282 ms 64512 KB Output is correct
13 Correct 249 ms 64276 KB Output is correct
14 Correct 252 ms 64068 KB Output is correct
15 Correct 247 ms 63676 KB Output is correct
16 Correct 223 ms 61164 KB Output is correct
17 Correct 282 ms 61060 KB Output is correct
18 Correct 222 ms 60916 KB Output is correct
19 Correct 223 ms 60228 KB Output is correct
20 Correct 220 ms 60252 KB Output is correct
21 Correct 219 ms 60168 KB Output is correct
22 Correct 229 ms 60096 KB Output is correct
23 Correct 220 ms 60108 KB Output is correct
24 Correct 228 ms 60168 KB Output is correct
25 Correct 247 ms 60184 KB Output is correct
26 Correct 242 ms 60244 KB Output is correct
27 Correct 281 ms 60100 KB Output is correct
28 Correct 235 ms 60200 KB Output is correct
29 Correct 205 ms 60060 KB Output is correct
30 Correct 209 ms 60140 KB Output is correct
31 Correct 221 ms 60128 KB Output is correct
32 Correct 216 ms 60204 KB Output is correct
33 Correct 245 ms 60056 KB Output is correct
34 Correct 240 ms 62720 KB Output is correct
35 Correct 265 ms 61868 KB Output is correct
36 Correct 209 ms 61012 KB Output is correct
37 Correct 285 ms 63932 KB Output is correct
38 Correct 258 ms 63832 KB Output is correct
39 Correct 283 ms 63708 KB Output is correct
40 Correct 287 ms 63548 KB Output is correct
41 Correct 266 ms 63312 KB Output is correct
42 Correct 218 ms 60168 KB Output is correct
43 Correct 267 ms 63832 KB Output is correct
44 Correct 254 ms 63688 KB Output is correct
45 Correct 256 ms 63468 KB Output is correct
46 Correct 251 ms 63292 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 332 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 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 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 332 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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 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 332 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 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 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 332 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 6 ms 1972 KB Output is correct
29 Correct 6 ms 1996 KB Output is correct
30 Correct 6 ms 1996 KB Output is correct
31 Correct 6 ms 2080 KB Output is correct
32 Correct 6 ms 1996 KB Output is correct
33 Correct 6 ms 1996 KB Output is correct
34 Correct 6 ms 1996 KB Output is correct
35 Correct 7 ms 2252 KB Output is correct
36 Correct 9 ms 2252 KB Output is correct
37 Correct 7 ms 2124 KB Output is correct
38 Correct 5 ms 1996 KB Output is correct
39 Correct 7 ms 2236 KB Output is correct
40 Correct 7 ms 2252 KB Output is correct
41 Correct 7 ms 2180 KB Output is correct
42 Correct 5 ms 1996 KB Output is correct
43 Correct 6 ms 2124 KB Output is correct
44 Correct 6 ms 2124 KB Output is correct
45 Correct 6 ms 2068 KB Output is correct
46 Correct 5 ms 1996 KB Output is correct
47 Correct 6 ms 2092 KB Output is correct
48 Correct 6 ms 1996 KB Output is correct
49 Correct 6 ms 1996 KB Output is correct
50 Correct 7 ms 1996 KB Output is correct
51 Correct 6 ms 1996 KB Output is correct
52 Correct 7 ms 1996 KB Output is correct
53 Correct 6 ms 1980 KB Output is correct
54 Correct 6 ms 1996 KB Output is correct
55 Correct 5 ms 1868 KB Output is correct
56 Correct 8 ms 1868 KB Output is correct
57 Correct 5 ms 1868 KB Output is correct
58 Correct 5 ms 1868 KB Output is correct
59 Correct 5 ms 1868 KB Output is correct
60 Correct 5 ms 1868 KB Output is correct
61 Correct 5 ms 1884 KB Output is correct
62 Correct 5 ms 1868 KB Output is correct
63 Correct 5 ms 1868 KB Output is correct
64 Correct 4 ms 1740 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 284 ms 65256 KB Output is correct
5 Correct 277 ms 66920 KB Output is correct
6 Correct 273 ms 66500 KB Output is correct
7 Correct 293 ms 65856 KB Output is correct
8 Correct 279 ms 67196 KB Output is correct
9 Correct 290 ms 66868 KB Output is correct
10 Correct 281 ms 66588 KB Output is correct
11 Correct 288 ms 65860 KB Output is correct
12 Correct 282 ms 64512 KB Output is correct
13 Correct 249 ms 64276 KB Output is correct
14 Correct 252 ms 64068 KB Output is correct
15 Correct 247 ms 63676 KB Output is correct
16 Correct 223 ms 61164 KB Output is correct
17 Correct 282 ms 61060 KB Output is correct
18 Correct 222 ms 60916 KB Output is correct
19 Correct 223 ms 60228 KB Output is correct
20 Correct 220 ms 60252 KB Output is correct
21 Correct 219 ms 60168 KB Output is correct
22 Correct 229 ms 60096 KB Output is correct
23 Correct 220 ms 60108 KB Output is correct
24 Correct 228 ms 60168 KB Output is correct
25 Correct 247 ms 60184 KB Output is correct
26 Correct 242 ms 60244 KB Output is correct
27 Correct 281 ms 60100 KB Output is correct
28 Correct 235 ms 60200 KB Output is correct
29 Correct 205 ms 60060 KB Output is correct
30 Correct 209 ms 60140 KB Output is correct
31 Correct 221 ms 60128 KB Output is correct
32 Correct 216 ms 60204 KB Output is correct
33 Correct 245 ms 60056 KB Output is correct
34 Correct 240 ms 62720 KB Output is correct
35 Correct 265 ms 61868 KB Output is correct
36 Correct 209 ms 61012 KB Output is correct
37 Correct 285 ms 63932 KB Output is correct
38 Correct 258 ms 63832 KB Output is correct
39 Correct 283 ms 63708 KB Output is correct
40 Correct 287 ms 63548 KB Output is correct
41 Correct 266 ms 63312 KB Output is correct
42 Correct 218 ms 60168 KB Output is correct
43 Correct 267 ms 63832 KB Output is correct
44 Correct 254 ms 63688 KB Output is correct
45 Correct 256 ms 63468 KB Output is correct
46 Correct 251 ms 63292 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 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 1 ms 332 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 6 ms 1972 KB Output is correct
75 Correct 6 ms 1996 KB Output is correct
76 Correct 6 ms 1996 KB Output is correct
77 Correct 6 ms 2080 KB Output is correct
78 Correct 6 ms 1996 KB Output is correct
79 Correct 6 ms 1996 KB Output is correct
80 Correct 6 ms 1996 KB Output is correct
81 Correct 7 ms 2252 KB Output is correct
82 Correct 9 ms 2252 KB Output is correct
83 Correct 7 ms 2124 KB Output is correct
84 Correct 5 ms 1996 KB Output is correct
85 Correct 7 ms 2236 KB Output is correct
86 Correct 7 ms 2252 KB Output is correct
87 Correct 7 ms 2180 KB Output is correct
88 Correct 5 ms 1996 KB Output is correct
89 Correct 6 ms 2124 KB Output is correct
90 Correct 6 ms 2124 KB Output is correct
91 Correct 6 ms 2068 KB Output is correct
92 Correct 5 ms 1996 KB Output is correct
93 Correct 6 ms 2092 KB Output is correct
94 Correct 6 ms 1996 KB Output is correct
95 Correct 6 ms 1996 KB Output is correct
96 Correct 7 ms 1996 KB Output is correct
97 Correct 6 ms 1996 KB Output is correct
98 Correct 7 ms 1996 KB Output is correct
99 Correct 6 ms 1980 KB Output is correct
100 Correct 6 ms 1996 KB Output is correct
101 Correct 5 ms 1868 KB Output is correct
102 Correct 8 ms 1868 KB Output is correct
103 Correct 5 ms 1868 KB Output is correct
104 Correct 5 ms 1868 KB Output is correct
105 Correct 5 ms 1868 KB Output is correct
106 Correct 5 ms 1868 KB Output is correct
107 Correct 5 ms 1884 KB Output is correct
108 Correct 5 ms 1868 KB Output is correct
109 Correct 5 ms 1868 KB Output is correct
110 Correct 4 ms 1740 KB Output is correct
111 Correct 438 ms 60164 KB Output is correct
112 Correct 475 ms 60120 KB Output is correct
113 Correct 430 ms 60304 KB Output is correct
114 Correct 445 ms 60084 KB Output is correct
115 Correct 436 ms 60176 KB Output is correct
116 Correct 489 ms 60064 KB Output is correct
117 Correct 433 ms 60064 KB Output is correct
118 Correct 488 ms 67188 KB Output is correct
119 Correct 440 ms 66472 KB Output is correct
120 Correct 461 ms 63608 KB Output is correct
121 Correct 371 ms 60120 KB Output is correct
122 Correct 431 ms 64528 KB Output is correct
123 Correct 449 ms 64052 KB Output is correct
124 Correct 419 ms 63600 KB Output is correct
125 Correct 339 ms 60188 KB Output is correct
126 Correct 410 ms 61084 KB Output is correct
127 Correct 433 ms 61116 KB Output is correct
128 Correct 414 ms 61000 KB Output is correct
129 Correct 343 ms 60168 KB Output is correct
130 Correct 458 ms 60224 KB Output is correct
131 Correct 410 ms 60268 KB Output is correct
132 Correct 429 ms 60308 KB Output is correct
133 Correct 418 ms 60168 KB Output is correct
134 Correct 437 ms 60176 KB Output is correct
135 Correct 431 ms 60116 KB Output is correct
136 Correct 381 ms 60248 KB Output is correct
137 Correct 484 ms 60100 KB Output is correct
138 Correct 434 ms 60184 KB Output is correct
139 Correct 419 ms 60272 KB Output is correct
140 Correct 435 ms 60124 KB Output is correct
141 Correct 394 ms 60172 KB Output is correct
142 Correct 256 ms 56756 KB Output is correct
143 Correct 276 ms 56768 KB Output is correct
144 Correct 263 ms 56744 KB Output is correct
145 Correct 233 ms 56848 KB Output is correct
146 Correct 231 ms 56684 KB Output is correct
147 Correct 230 ms 56596 KB Output is correct
148 Correct 220 ms 56372 KB Output is correct
149 Correct 228 ms 56220 KB Output is correct
150 Correct 213 ms 56036 KB Output is correct
151 Correct 218 ms 55444 KB Output is correct
152 Correct 160 ms 49304 KB Output is correct
153 Correct 233 ms 56812 KB Output is correct
154 Correct 275 ms 56720 KB Output is correct
155 Correct 231 ms 56500 KB Output is correct
156 Correct 233 ms 56428 KB Output is correct
157 Correct 250 ms 56264 KB Output is correct
158 Correct 234 ms 56076 KB Output is correct
159 Correct 229 ms 55348 KB Output is correct
160 Correct 180 ms 49312 KB Output is correct
161 Correct 365 ms 58476 KB Output is correct
162 Correct 370 ms 58416 KB Output is correct
163 Correct 364 ms 58148 KB Output is correct
164 Correct 356 ms 57956 KB Output is correct
165 Correct 403 ms 57992 KB Output is correct
166 Correct 213 ms 60096 KB Output is correct
167 Correct 286 ms 63816 KB Output is correct
168 Correct 270 ms 63640 KB Output is correct
169 Correct 275 ms 63532 KB Output is correct
170 Correct 286 ms 63292 KB Output is correct
171 Correct 278 ms 63316 KB Output is correct
172 Correct 296 ms 63932 KB Output is correct
173 Correct 302 ms 52988 KB Output is correct
174 Correct 325 ms 52964 KB Output is correct
175 Correct 307 ms 52908 KB Output is correct
176 Correct 291 ms 52284 KB Output is correct