oj.uz

Submission #404400

# Submission time Handle Problem Language Result Execution time Memory
404400 2021-05-14T11:09:33 Z rrrr10000 Alternating Current (BOI18_alternating) C++14
100 / 100
 115 ms 12852 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
 
int main(){
    ll n,m;cin>>n>>m;
    vp v(m),srt(m);
    vi cnt(n*2+1);
    rep(i,m){
        ll a,b;cin>>a>>b;a--;b--;
        if(a>b)b+=n;
        v[i]=P(a,b);
        srt[i]=P(a,i);
        cnt[a]++;cnt[b+1]--;
    }rep(i,n*2)cnt[i+1]+=cnt[i];rep(i,n)if(cnt[i]+cnt[i+n]<2)dame("impossible");
    sort(all(srt));
    P ma=P(-1,-1);
    vvi g(m);
    vi rui(n*2+1);vp tmp;
    deque<P> deq;
    rep(i,m){
        ll id=srt[i].se;
        if(ma.fi<v[id].se){
            chmax(ma,P(v[id].se,id));
            // tmp.pb(srt[i]);
            deq.pb(srt[i]);
        }
        else{
            g[ma.se].pb(id);
            rui[v[id].fi]++;rui[v[id].se+1]--;
        }
    }
    while(deq.size()){
        if(v[deq.front().se].se<=ma.fi-n)g[ma.se].pb(deq.front().se);
        else tmp.pb(deq.front());
        deq.pop_front();
    }
    rep(i,n*2)rui[i+1]+=rui[i];
    rep(i,n){
        if(rui[i]||rui[i+n]){
            rui[i]=0;rui[i+n]=0;
        }
        else{
            rui[i]=1;rui[i+n]=1;
        }
    }
    rep(i,n*2)rui[i+1]+=rui[i];
    auto rng=[&](ll l,ll r){
        if(l>r)return 0ll;
        ll res=rui[r];if(l)res-=rui[l-1];
        return res;
    };
    vi ans(m,-1);
    // outvp(tmp);
    if(tmp.size()%2==0){
        rep(i,tmp.size())ans[tmp[i].se]=i%2;
    }
    else{
        ll t=-1;
        rep(i,tmp.size()){
            ll a=v[tmp[i].se].se,b=v[tmp[(i+3)%tmp.size()].se].fi;
            if(i+3>=tmp.size())b+=n;
            if(rng(a+1,b-1)==0)t=(i+2)%tmp.size();
        }
        if(t==-1)dame("impossible");
        rep(i,tmp.size())ans[tmp[(i+t)%tmp.size()].se]=i%2;
    }
    queue<ll> que;
    rep(i,m)if(ans[i]!=-1)que.push(i);
    while(!que.empty()){
        ll t=que.front();que.pop();
        for(ll x:g[t]){
            ans[x]=1-ans[t];que.push(x);
        }
    }
    rep(i,m)cout<<ans[i];cout<<endl;
}

Compilation message

alternating.cpp: In function 'int main()':
alternating.cpp:108:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             if(i+3>=tmp.size())b+=n;
      |                ~~~^~~~~~~~~~~~
alternating.cpp:3:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    3 | #define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
      |                    ^~~
alternating.cpp:122:5: note: in expansion of macro 'rep'
  122 |     rep(i,m)cout<<ans[i];cout<<endl;
      |     ^~~
alternating.cpp:122:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  122 |     rep(i,m)cout<<ans[i];cout<<endl;
      |                          ^~~~

Subtask #1
13.0 / 13.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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 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 1 ms 292 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 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 296 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 204 KB Output is correct

Subtask #2
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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 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 1 ms 292 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 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 296 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 296 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 296 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 224 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 1 ms 292 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 296 KB Output is correct
66 Correct 1 ms 292 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 296 KB Output is correct

Subtask #3
22.0 / 22.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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 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 1 ms 292 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 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 296 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 296 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 296 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 224 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 1 ms 292 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 296 KB Output is correct
66 Correct 1 ms 292 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 296 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 2 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 1 ms 332 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 1 ms 332 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 1 ms 292 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 2 ms 332 KB Output is correct
85 Correct 1 ms 332 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 1 ms 332 KB Output is correct
90 Correct 2 ms 332 KB Output is correct
91 Correct 1 ms 292 KB Output is correct
92 Correct 1 ms 332 KB Output is correct
93 Correct 1 ms 204 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 296 KB Output is correct
96 Correct 2 ms 332 KB Output is correct
97 Correct 2 ms 332 KB Output is correct
98 Correct 2 ms 332 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 11372 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 35 ms 3404 KB Output is correct
4 Correct 40 ms 7388 KB Output is correct
5 Correct 94 ms 12132 KB Output is correct
6 Correct 65 ms 5060 KB Output is correct
7 Correct 82 ms 10824 KB Output is correct
8 Correct 5 ms 3660 KB Output is correct
9 Correct 4 ms 3276 KB Output is correct
10 Correct 115 ms 12604 KB Output is correct
11 Correct 69 ms 9796 KB Output is correct
12 Correct 80 ms 10540 KB Output is correct
13 Correct 2 ms 1868 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 91 ms 11372 KB Output is correct
16 Correct 33 ms 3420 KB Output is correct
17 Correct 93 ms 11384 KB Output is correct
18 Correct 84 ms 8364 KB Output is correct
19 Correct 5 ms 1996 KB Output is correct
20 Correct 87 ms 11448 KB Output is correct

Subtask #5
26.0 / 26.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 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 292 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 296 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 1 ms 292 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 292 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 296 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 296 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 296 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 224 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 1 ms 292 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 296 KB Output is correct
66 Correct 1 ms 292 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 296 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 2 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 1 ms 332 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 1 ms 332 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 1 ms 292 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 2 ms 332 KB Output is correct
85 Correct 1 ms 332 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 1 ms 332 KB Output is correct
90 Correct 2 ms 332 KB Output is correct
91 Correct 1 ms 292 KB Output is correct
92 Correct 1 ms 332 KB Output is correct
93 Correct 1 ms 204 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 296 KB Output is correct
96 Correct 2 ms 332 KB Output is correct
97 Correct 2 ms 332 KB Output is correct
98 Correct 2 ms 332 KB Output is correct
99 Correct 74 ms 11372 KB Output is correct
100 Correct 3 ms 3404 KB Output is correct
101 Correct 35 ms 3404 KB Output is correct
102 Correct 40 ms 7388 KB Output is correct
103 Correct 94 ms 12132 KB Output is correct
104 Correct 65 ms 5060 KB Output is correct
105 Correct 82 ms 10824 KB Output is correct
106 Correct 5 ms 3660 KB Output is correct
107 Correct 4 ms 3276 KB Output is correct
108 Correct 115 ms 12604 KB Output is correct
109 Correct 69 ms 9796 KB Output is correct
110 Correct 80 ms 10540 KB Output is correct
111 Correct 2 ms 1868 KB Output is correct
112 Correct 2 ms 1868 KB Output is correct
113 Correct 91 ms 11372 KB Output is correct
114 Correct 33 ms 3420 KB Output is correct
115 Correct 93 ms 11384 KB Output is correct
116 Correct 84 ms 8364 KB Output is correct
117 Correct 5 ms 1996 KB Output is correct
118 Correct 87 ms 11448 KB Output is correct
119 Correct 3 ms 3404 KB Output is correct
120 Correct 67 ms 11704 KB Output is correct
121 Correct 45 ms 8252 KB Output is correct
122 Correct 1 ms 204 KB Output is correct
123 Correct 5 ms 1996 KB Output is correct
124 Correct 24 ms 3412 KB Output is correct
125 Correct 34 ms 6344 KB Output is correct
126 Correct 3 ms 3404 KB Output is correct
127 Correct 11 ms 4284 KB Output is correct
128 Correct 76 ms 11448 KB Output is correct
129 Correct 45 ms 7856 KB Output is correct
130 Correct 55 ms 9160 KB Output is correct
131 Correct 3 ms 3404 KB Output is correct
132 Correct 4 ms 3404 KB Output is correct
133 Correct 92 ms 12852 KB Output is correct
134 Correct 27 ms 5980 KB Output is correct
135 Correct 3 ms 3404 KB Output is correct
136 Correct 39 ms 4284 KB Output is correct
137 Correct 65 ms 5200 KB Output is correct
138 Correct 4 ms 3532 KB Output is correct