oj.uz

Submission #1013297

# Submission time Handle Problem Language Result Execution time Memory
1013297 2024-07-03T11:43:24 Z PCTprobability Homework (CEOI22_homework) C++17
100 / 100
 264 ms 288700 KB 
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
#define die(a) {cout<<a<<endl;return 0;}
#define dier(a) {return a;}
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
vector<ll> g[1010101];
ll st[1010101];
vector<ll> solve(ll a){
  vector<ll> p,q;
  for(auto e:g[a]){
    auto r=solve(e);
    if(p.size()==0) p=r;
    else q=r;
  }
  if(p.size()==0){
    p={1,1,1};
  }
  if(q.size()==0){
    q={1,1,1};
  }
  if(st[a]==1){
    return {p[0]+q[0],p[1]+q[1],max(p[2]+q[0],p[0]+q[2])};
  }
  else{
    p={p[0],p[0]-p[2]+1,p[0]-p[1]+1};
    q={q[0],q[0]-q[2]+1,q[0]-q[1]+1};
    vector<ll> r={p[0]+q[0],p[1]+q[1],max(p[2]+q[0],p[0]+q[2])};
    r={r[0],r[0]-r[2]+1,r[0]-r[1]+1};
    return r;
  }
}
int main(){
  cincout();
  string s;
  cin>>s;
  ll now=0;
  int i=0;
  ll n=0;
  vector<ll> v;
  while(i<s.size()){
    if(s[i]==','){
      i++;
      continue;
    }
    if(s[i]=='?'){
      i++;
      continue;
    }
    if(s[i+1]=='a'){
      n++;
      if(v.size()) g[v.back()].pb(now);
      st[now]=1;
      v.pb(now);
      now++;
      i+=4;
      continue;
    }
    if(s[i+1]=='i'){
      n++;
      if(v.size()) g[v.back()].pb(now);
      st[now]=0;
      v.pb(now);
      now++;
      i+=4;
      continue;
    }
    if(s[i]==')'){
      v.pop_back();
      i++;
      continue;
    }
  }
  auto a=solve(0);
  cout<<a[2]-a[1]+1<<endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:112:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |   while(i<s.size()){
      |         ~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25692 KB Output is correct
2 Correct 8 ms 25544 KB Output is correct
3 Correct 7 ms 25696 KB Output is correct
4 Correct 7 ms 25696 KB Output is correct
5 Correct 7 ms 25692 KB Output is correct
6 Correct 8 ms 25532 KB Output is correct
7 Correct 8 ms 25692 KB Output is correct
8 Correct 8 ms 25740 KB Output is correct
9 Correct 8 ms 25740 KB Output is correct
10 Correct 8 ms 25692 KB Output is correct
11 Correct 8 ms 25692 KB Output is correct
12 Correct 8 ms 25692 KB Output is correct
13 Correct 9 ms 25688 KB Output is correct
14 Correct 8 ms 25748 KB Output is correct
15 Correct 10 ms 25764 KB Output is correct
16 Correct 9 ms 25612 KB Output is correct
17 Correct 8 ms 25688 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 9 ms 25692 KB Output is correct
20 Correct 9 ms 25692 KB Output is correct
21 Correct 8 ms 25692 KB Output is correct
22 Correct 8 ms 25692 KB Output is correct
23 Correct 9 ms 25768 KB Output is correct
24 Correct 8 ms 25692 KB Output is correct
25 Correct 9 ms 25728 KB Output is correct
26 Correct 9 ms 25692 KB Output is correct
27 Correct 8 ms 25692 KB Output is correct
28 Correct 8 ms 25692 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25692 KB Output is correct
2 Correct 8 ms 25544 KB Output is correct
3 Correct 7 ms 25696 KB Output is correct
4 Correct 7 ms 25696 KB Output is correct
5 Correct 7 ms 25692 KB Output is correct
6 Correct 8 ms 25532 KB Output is correct
7 Correct 8 ms 25692 KB Output is correct
8 Correct 8 ms 25740 KB Output is correct
9 Correct 8 ms 25740 KB Output is correct
10 Correct 8 ms 25692 KB Output is correct
11 Correct 8 ms 25692 KB Output is correct
12 Correct 8 ms 25692 KB Output is correct
13 Correct 9 ms 25688 KB Output is correct
14 Correct 8 ms 25748 KB Output is correct
15 Correct 10 ms 25764 KB Output is correct
16 Correct 9 ms 25612 KB Output is correct
17 Correct 8 ms 25688 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 9 ms 25692 KB Output is correct
20 Correct 9 ms 25692 KB Output is correct
21 Correct 8 ms 25692 KB Output is correct
22 Correct 8 ms 25692 KB Output is correct
23 Correct 9 ms 25768 KB Output is correct
24 Correct 8 ms 25692 KB Output is correct
25 Correct 9 ms 25728 KB Output is correct
26 Correct 9 ms 25692 KB Output is correct
27 Correct 8 ms 25692 KB Output is correct
28 Correct 8 ms 25692 KB Output is correct
29 Correct 8 ms 25692 KB Output is correct
30 Correct 8 ms 25548 KB Output is correct
31 Correct 8 ms 25692 KB Output is correct
32 Correct 9 ms 25692 KB Output is correct
33 Correct 9 ms 25768 KB Output is correct
34 Correct 9 ms 25592 KB Output is correct
35 Correct 9 ms 25764 KB Output is correct
36 Correct 8 ms 25692 KB Output is correct
37 Correct 8 ms 25692 KB Output is correct
38 Correct 8 ms 25692 KB Output is correct
39 Correct 8 ms 25692 KB Output is correct
40 Correct 8 ms 25764 KB Output is correct
41 Correct 10 ms 25688 KB Output is correct
42 Correct 10 ms 25632 KB Output is correct
43 Correct 8 ms 25692 KB Output is correct
44 Correct 10 ms 25692 KB Output is correct
45 Correct 9 ms 25764 KB Output is correct
46 Correct 9 ms 25692 KB Output is correct
47 Correct 9 ms 25720 KB Output is correct
48 Correct 9 ms 25692 KB Output is correct
49 Correct 9 ms 25688 KB Output is correct
50 Correct 9 ms 25692 KB Output is correct
51 Correct 8 ms 25696 KB Output is correct
52 Correct 8 ms 25696 KB Output is correct
53 Correct 9 ms 25696 KB Output is correct
54 Correct 8 ms 25696 KB Output is correct
55 Correct 9 ms 25692 KB Output is correct
56 Correct 9 ms 25692 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 288244 KB Output is correct
2 Correct 233 ms 288188 KB Output is correct
3 Correct 264 ms 288700 KB Output is correct
4 Correct 250 ms 288188 KB Output is correct
5 Correct 257 ms 288192 KB Output is correct
6 Correct 253 ms 288252 KB Output is correct
7 Correct 228 ms 288188 KB Output is correct
8 Correct 246 ms 288240 KB Output is correct
9 Correct 243 ms 288412 KB Output is correct
10 Correct 243 ms 288316 KB Output is correct
11 Correct 247 ms 288232 KB Output is correct
12 Correct 243 ms 288236 KB Output is correct
13 Correct 8 ms 25692 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25692 KB Output is correct
2 Correct 8 ms 25544 KB Output is correct
3 Correct 7 ms 25696 KB Output is correct
4 Correct 7 ms 25696 KB Output is correct
5 Correct 7 ms 25692 KB Output is correct
6 Correct 8 ms 25532 KB Output is correct
7 Correct 8 ms 25692 KB Output is correct
8 Correct 8 ms 25740 KB Output is correct
9 Correct 8 ms 25740 KB Output is correct
10 Correct 8 ms 25692 KB Output is correct
11 Correct 8 ms 25692 KB Output is correct
12 Correct 8 ms 25692 KB Output is correct
13 Correct 9 ms 25688 KB Output is correct
14 Correct 8 ms 25748 KB Output is correct
15 Correct 10 ms 25764 KB Output is correct
16 Correct 9 ms 25612 KB Output is correct
17 Correct 8 ms 25688 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 9 ms 25692 KB Output is correct
20 Correct 9 ms 25692 KB Output is correct
21 Correct 8 ms 25692 KB Output is correct
22 Correct 8 ms 25692 KB Output is correct
23 Correct 9 ms 25768 KB Output is correct
24 Correct 8 ms 25692 KB Output is correct
25 Correct 9 ms 25728 KB Output is correct
26 Correct 9 ms 25692 KB Output is correct
27 Correct 8 ms 25692 KB Output is correct
28 Correct 8 ms 25692 KB Output is correct
29 Correct 8 ms 25692 KB Output is correct
30 Correct 8 ms 25548 KB Output is correct
31 Correct 8 ms 25692 KB Output is correct
32 Correct 9 ms 25692 KB Output is correct
33 Correct 9 ms 25768 KB Output is correct
34 Correct 9 ms 25592 KB Output is correct
35 Correct 9 ms 25764 KB Output is correct
36 Correct 8 ms 25692 KB Output is correct
37 Correct 8 ms 25692 KB Output is correct
38 Correct 8 ms 25692 KB Output is correct
39 Correct 8 ms 25692 KB Output is correct
40 Correct 8 ms 25764 KB Output is correct
41 Correct 10 ms 25688 KB Output is correct
42 Correct 10 ms 25632 KB Output is correct
43 Correct 8 ms 25692 KB Output is correct
44 Correct 10 ms 25692 KB Output is correct
45 Correct 9 ms 25764 KB Output is correct
46 Correct 9 ms 25692 KB Output is correct
47 Correct 9 ms 25720 KB Output is correct
48 Correct 9 ms 25692 KB Output is correct
49 Correct 9 ms 25688 KB Output is correct
50 Correct 9 ms 25692 KB Output is correct
51 Correct 8 ms 25696 KB Output is correct
52 Correct 8 ms 25696 KB Output is correct
53 Correct 9 ms 25696 KB Output is correct
54 Correct 8 ms 25696 KB Output is correct
55 Correct 9 ms 25692 KB Output is correct
56 Correct 9 ms 25692 KB Output is correct
57 Correct 8 ms 25692 KB Output is correct
58 Correct 9 ms 25784 KB Output is correct
59 Correct 11 ms 25768 KB Output is correct
60 Correct 8 ms 25676 KB Output is correct
61 Correct 9 ms 25692 KB Output is correct
62 Correct 9 ms 25692 KB Output is correct
63 Correct 10 ms 25688 KB Output is correct
64 Correct 10 ms 25692 KB Output is correct
65 Correct 9 ms 25888 KB Output is correct
66 Correct 9 ms 25780 KB Output is correct
67 Correct 8 ms 25688 KB Output is correct
68 Correct 9 ms 25796 KB Output is correct
69 Correct 8 ms 25688 KB Output is correct
70 Correct 8 ms 25692 KB Output is correct
71 Correct 8 ms 25740 KB Output is correct
72 Correct 9 ms 25840 KB Output is correct
73 Correct 8 ms 26200 KB Output is correct
74 Correct 9 ms 25948 KB Output is correct
75 Correct 8 ms 25944 KB Output is correct
76 Correct 10 ms 25920 KB Output is correct
77 Correct 9 ms 25692 KB Output is correct
78 Correct 10 ms 25692 KB Output is correct
79 Correct 8 ms 25808 KB Output is correct
80 Correct 8 ms 25692 KB Output is correct
81 Correct 7 ms 25764 KB Output is correct
82 Correct 9 ms 25692 KB Output is correct
83 Correct 9 ms 25604 KB Output is correct
84 Correct 8 ms 25760 KB Output is correct
85 Correct 8 ms 25688 KB Output is correct
86 Correct 8 ms 25760 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25692 KB Output is correct
2 Correct 8 ms 25544 KB Output is correct
3 Correct 7 ms 25696 KB Output is correct
4 Correct 7 ms 25696 KB Output is correct
5 Correct 7 ms 25692 KB Output is correct
6 Correct 8 ms 25532 KB Output is correct
7 Correct 8 ms 25692 KB Output is correct
8 Correct 8 ms 25740 KB Output is correct
9 Correct 8 ms 25740 KB Output is correct
10 Correct 8 ms 25692 KB Output is correct
11 Correct 8 ms 25692 KB Output is correct
12 Correct 8 ms 25692 KB Output is correct
13 Correct 9 ms 25688 KB Output is correct
14 Correct 8 ms 25748 KB Output is correct
15 Correct 10 ms 25764 KB Output is correct
16 Correct 9 ms 25612 KB Output is correct
17 Correct 8 ms 25688 KB Output is correct
18 Correct 8 ms 25688 KB Output is correct
19 Correct 9 ms 25692 KB Output is correct
20 Correct 9 ms 25692 KB Output is correct
21 Correct 8 ms 25692 KB Output is correct
22 Correct 8 ms 25692 KB Output is correct
23 Correct 9 ms 25768 KB Output is correct
24 Correct 8 ms 25692 KB Output is correct
25 Correct 9 ms 25728 KB Output is correct
26 Correct 9 ms 25692 KB Output is correct
27 Correct 8 ms 25692 KB Output is correct
28 Correct 8 ms 25692 KB Output is correct
29 Correct 8 ms 25692 KB Output is correct
30 Correct 8 ms 25548 KB Output is correct
31 Correct 8 ms 25692 KB Output is correct
32 Correct 9 ms 25692 KB Output is correct
33 Correct 9 ms 25768 KB Output is correct
34 Correct 9 ms 25592 KB Output is correct
35 Correct 9 ms 25764 KB Output is correct
36 Correct 8 ms 25692 KB Output is correct
37 Correct 8 ms 25692 KB Output is correct
38 Correct 8 ms 25692 KB Output is correct
39 Correct 8 ms 25692 KB Output is correct
40 Correct 8 ms 25764 KB Output is correct
41 Correct 10 ms 25688 KB Output is correct
42 Correct 10 ms 25632 KB Output is correct
43 Correct 8 ms 25692 KB Output is correct
44 Correct 10 ms 25692 KB Output is correct
45 Correct 9 ms 25764 KB Output is correct
46 Correct 9 ms 25692 KB Output is correct
47 Correct 9 ms 25720 KB Output is correct
48 Correct 9 ms 25692 KB Output is correct
49 Correct 9 ms 25688 KB Output is correct
50 Correct 9 ms 25692 KB Output is correct
51 Correct 8 ms 25696 KB Output is correct
52 Correct 8 ms 25696 KB Output is correct
53 Correct 9 ms 25696 KB Output is correct
54 Correct 8 ms 25696 KB Output is correct
55 Correct 9 ms 25692 KB Output is correct
56 Correct 9 ms 25692 KB Output is correct
57 Correct 251 ms 288244 KB Output is correct
58 Correct 233 ms 288188 KB Output is correct
59 Correct 264 ms 288700 KB Output is correct
60 Correct 250 ms 288188 KB Output is correct
61 Correct 257 ms 288192 KB Output is correct
62 Correct 253 ms 288252 KB Output is correct
63 Correct 228 ms 288188 KB Output is correct
64 Correct 246 ms 288240 KB Output is correct
65 Correct 243 ms 288412 KB Output is correct
66 Correct 243 ms 288316 KB Output is correct
67 Correct 247 ms 288232 KB Output is correct
68 Correct 243 ms 288236 KB Output is correct
69 Correct 8 ms 25692 KB Output is correct
70 Correct 8 ms 25692 KB Output is correct
71 Correct 9 ms 25784 KB Output is correct
72 Correct 11 ms 25768 KB Output is correct
73 Correct 8 ms 25676 KB Output is correct
74 Correct 9 ms 25692 KB Output is correct
75 Correct 9 ms 25692 KB Output is correct
76 Correct 10 ms 25688 KB Output is correct
77 Correct 10 ms 25692 KB Output is correct
78 Correct 9 ms 25888 KB Output is correct
79 Correct 9 ms 25780 KB Output is correct
80 Correct 8 ms 25688 KB Output is correct
81 Correct 9 ms 25796 KB Output is correct
82 Correct 8 ms 25688 KB Output is correct
83 Correct 8 ms 25692 KB Output is correct
84 Correct 8 ms 25740 KB Output is correct
85 Correct 9 ms 25840 KB Output is correct
86 Correct 8 ms 26200 KB Output is correct
87 Correct 9 ms 25948 KB Output is correct
88 Correct 8 ms 25944 KB Output is correct
89 Correct 10 ms 25920 KB Output is correct
90 Correct 9 ms 25692 KB Output is correct
91 Correct 10 ms 25692 KB Output is correct
92 Correct 8 ms 25808 KB Output is correct
93 Correct 8 ms 25692 KB Output is correct
94 Correct 7 ms 25764 KB Output is correct
95 Correct 9 ms 25692 KB Output is correct
96 Correct 9 ms 25604 KB Output is correct
97 Correct 8 ms 25760 KB Output is correct
98 Correct 8 ms 25688 KB Output is correct
99 Correct 8 ms 25760 KB Output is correct
100 Correct 142 ms 65988 KB Output is correct
101 Correct 150 ms 66052 KB Output is correct
102 Correct 151 ms 65992 KB Output is correct
103 Correct 122 ms 65828 KB Output is correct
104 Correct 127 ms 66072 KB Output is correct
105 Correct 173 ms 141176 KB Output is correct
106 Correct 210 ms 141260 KB Output is correct
107 Correct 169 ms 141056 KB Output is correct
108 Correct 155 ms 141004 KB Output is correct
109 Correct 180 ms 141060 KB Output is correct
110 Correct 142 ms 66504 KB Output is correct
111 Correct 139 ms 66504 KB Output is correct
112 Correct 141 ms 66636 KB Output is correct
113 Correct 128 ms 66488 KB Output is correct
114 Correct 135 ms 66548 KB Output is correct
115 Correct 225 ms 288236 KB Output is correct
116 Correct 250 ms 288184 KB Output is correct
117 Correct 230 ms 288180 KB Output is correct
118 Correct 233 ms 288444 KB Output is correct
119 Correct 227 ms 288188 KB Output is correct
120 Correct 134 ms 66504 KB Output is correct
121 Correct 117 ms 66488 KB Output is correct
122 Correct 137 ms 66544 KB Output is correct
123 Correct 141 ms 66640 KB Output is correct
124 Correct 169 ms 177160 KB Output is correct
125 Correct 182 ms 177160 KB Output is correct
126 Correct 154 ms 177160 KB Output is correct
127 Correct 174 ms 177100 KB Output is correct
128 Correct 73 ms 45060 KB Output is correct
129 Correct 67 ms 45060 KB Output is correct
130 Correct 63 ms 45048 KB Output is correct
131 Correct 8 ms 25692 KB Output is correct