oj.uz

답안 #1066345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066345 2024-08-19T18:38:52 Z PCTprobability Joker (BOI20_joker) C++17
100 / 100
 1515 ms 61172 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 = 4000000000000000000ll;
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);
}
struct weight_UnionFind{
  vector<ll> p;
  vector<ll> sz;
  vector<ll> w;
  vector<vector<vector<ll>>> ch;
  weight_UnionFind(){
  }
  weight_UnionFind(ll n){
    p.resize(n);
    sz.resize(n);
    w.resize(n);
    for(int i=0;i<n;i++){
      p[i]=i,sz[i]=1;
    }
  }
  ll root(ll x){
    while(x!=p[x]) x=p[x];
    return x;
  }
  ll weight(ll x){
    ll cnt=0;
    while(x!=p[x]){
      cnt^=w[x];
      x=p[x];
    }
    return cnt;
  }
  bool canb(ll a,ll b){
    if(root(a)!=root(b)) return true;
    return weight(a)!=weight(b);
  }
  bool merge(ll a,ll b){
    ll we=1;
    we^=weight(a);
    we^=weight(b);
    ch.pb({});
    a=root(a);
    b=root(b);
    if(a==b) return false;
    if(sz[a]<sz[b]) swap(a,b);
    ch.back().pb({2,a,sz[a]});
    sz[a]+=sz[b];
    ch.back().pb({1,b,p[b]});
    p[b]=a;
    ch.back().pb({3,b,w[b]});
    w[b]=we;
    return true;
  }
  void undo(){
    for(auto e:ch.back()){
      if(e[0]==1){
        p[e[1]]=e[2];
      }
      if(e[0]==2){
        sz[e[1]]=e[2];
      }
      if(e[0]==3){
        w[e[1]]=e[2];
      }
    }
    ch.pop_back();
  }
};
int main(){
  cincout();
  ll n,m,q;
  cin>>n>>m>>q;
  vector<ll> a(m),b(m);
  for(int i=0;i<m;i++){
    cin>>a[i]>>b[i];
    a[i]--;
    b[i]--;
  }
  weight_UnionFind uf(n);
  vector<ll> ans(m,m+1);
  ll id=0;
  while(id<m&&uf.canb(a[id],b[id])){
    uf.merge(a[id],b[id]);
    id++;
  }
  if(id==m){
    for(int i=0;i<q;i++){
      cout<<"NO"<<endl;
    }
    return 0;
  }
  while(uf.ch.size()) uf.undo();
  auto solve = [&](ll l,ll r,ll x,ll y,auto& self) -> void {
    //cerr<<l<<" "<<r<<" "<<x<<" "<<y<<endl;
    if(l>r) return;
    ll mid=(l+r)/2;
    for(int i=l;i<=mid-1;i++){
      //cerr<<"M"<<" "<<a[i]<<" "<<b[i]<<endl;
      uf.merge(a[i],b[i]);
    }
    ll v=y;
    while(v>=x&&uf.canb(a[v],b[v])){
      /*for(int i=0;i<n;i++) cerr<<uf.p[i]<<" ";
      cerr<<endl;
      cerr<<"M"<<" "<<a[v]<<" "<<b[v]<<endl;*/
      uf.merge(a[v],b[v]);
      v--;
    }
    for(int i=v+1;i<=y;i++) uf.undo();
    for(int i=l;i<=mid-1;i++) uf.undo();
    for(int i=v+1;i<=y;i++) uf.merge(a[i],b[i]);
    //cerr<<mid<<" "<<v<<endl;
    ans[mid]=v;//v を追加すると奇閉路になる
    self(l,mid-1,x,ans[mid],self);
    for(int i=v+1;i<=y;i++) uf.undo();
    for(int i=l;i<=mid;i++) uf.merge(a[i],b[i]);
    self(mid+1,r,ans[mid],y,self);
    for(int i=l;i<=mid;i++) uf.undo();
  };
  solve(0,min(id,m-1),0,m-1,solve);
  //for(auto e:ans) cout<<e<<" ";
  //cout<<endl;
  for(int i=0;i<q;i++){
    ll l,r;
    cin>>l>>r;
    l--;
    r--;
    cout<<(ans[l]<=r?"NO":"YES")<<endl;
  }
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 7 ms 648 KB Output is correct
31 Correct 4 ms 600 KB Output is correct
32 Correct 4 ms 724 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 5 ms 796 KB Output is correct
37 Correct 15 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 5 ms 992 KB Output is correct
40 Correct 4 ms 604 KB Output is correct
41 Correct 4 ms 604 KB Output is correct
42 Correct 7 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 5 ms 968 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 9 ms 860 KB Output is correct
47 Correct 3 ms 736 KB Output is correct
48 Correct 6 ms 860 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 856 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 4 ms 604 KB Output is correct
53 Correct 4 ms 604 KB Output is correct
54 Correct 5 ms 856 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 730 ms 34684 KB Output is correct
4 Correct 87 ms 58436 KB Output is correct
5 Correct 863 ms 54932 KB Output is correct
6 Correct 537 ms 34812 KB Output is correct
7 Correct 580 ms 34820 KB Output is correct
8 Correct 442 ms 24624 KB Output is correct
9 Correct 628 ms 30976 KB Output is correct
10 Correct 951 ms 37380 KB Output is correct
11 Correct 644 ms 31744 KB Output is correct
12 Correct 796 ms 38452 KB Output is correct
13 Correct 252 ms 16308 KB Output is correct
14 Correct 445 ms 25088 KB Output is correct
15 Correct 802 ms 34912 KB Output is correct
16 Correct 935 ms 37888 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 730 ms 34684 KB Output is correct
30 Correct 87 ms 58436 KB Output is correct
31 Correct 863 ms 54932 KB Output is correct
32 Correct 537 ms 34812 KB Output is correct
33 Correct 580 ms 34820 KB Output is correct
34 Correct 442 ms 24624 KB Output is correct
35 Correct 628 ms 30976 KB Output is correct
36 Correct 951 ms 37380 KB Output is correct
37 Correct 644 ms 31744 KB Output is correct
38 Correct 796 ms 38452 KB Output is correct
39 Correct 252 ms 16308 KB Output is correct
40 Correct 445 ms 25088 KB Output is correct
41 Correct 802 ms 34912 KB Output is correct
42 Correct 935 ms 37888 KB Output is correct
43 Correct 762 ms 34924 KB Output is correct
44 Correct 86 ms 58412 KB Output is correct
45 Correct 1515 ms 60240 KB Output is correct
46 Correct 500 ms 35072 KB Output is correct
47 Correct 540 ms 35064 KB Output is correct
48 Correct 703 ms 31528 KB Output is correct
49 Correct 1058 ms 38516 KB Output is correct
50 Correct 623 ms 29340 KB Output is correct
51 Correct 674 ms 35356 KB Output is correct
52 Correct 813 ms 38924 KB Output is correct
53 Correct 254 ms 16640 KB Output is correct
54 Correct 584 ms 28928 KB Output is correct
55 Correct 781 ms 35388 KB Output is correct
56 Correct 962 ms 38588 KB Output is correct

Subtask #5
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 7 ms 648 KB Output is correct
31 Correct 4 ms 600 KB Output is correct
32 Correct 4 ms 724 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 5 ms 796 KB Output is correct
37 Correct 15 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 5 ms 992 KB Output is correct
40 Correct 4 ms 604 KB Output is correct
41 Correct 4 ms 604 KB Output is correct
42 Correct 7 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 5 ms 968 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 9 ms 860 KB Output is correct
47 Correct 3 ms 736 KB Output is correct
48 Correct 6 ms 860 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 856 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 4 ms 604 KB Output is correct
53 Correct 4 ms 604 KB Output is correct
54 Correct 5 ms 856 KB Output is correct
55 Correct 711 ms 32308 KB Output is correct
56 Correct 75 ms 57592 KB Output is correct
57 Correct 805 ms 52728 KB Output is correct
58 Correct 493 ms 32516 KB Output is correct
59 Correct 642 ms 29184 KB Output is correct
60 Correct 873 ms 33700 KB Output is correct
61 Correct 674 ms 29676 KB Output is correct
62 Correct 829 ms 36096 KB Output is correct
63 Correct 357 ms 19204 KB Output is correct
64 Correct 695 ms 31236 KB Output is correct
65 Correct 869 ms 34596 KB Output is correct

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 7 ms 648 KB Output is correct
31 Correct 4 ms 600 KB Output is correct
32 Correct 4 ms 724 KB Output is correct
33 Correct 2 ms 600 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 5 ms 796 KB Output is correct
37 Correct 15 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 5 ms 992 KB Output is correct
40 Correct 4 ms 604 KB Output is correct
41 Correct 4 ms 604 KB Output is correct
42 Correct 7 ms 604 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 5 ms 968 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 9 ms 860 KB Output is correct
47 Correct 3 ms 736 KB Output is correct
48 Correct 6 ms 860 KB Output is correct
49 Correct 6 ms 604 KB Output is correct
50 Correct 5 ms 856 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 4 ms 604 KB Output is correct
53 Correct 4 ms 604 KB Output is correct
54 Correct 5 ms 856 KB Output is correct
55 Correct 730 ms 34684 KB Output is correct
56 Correct 87 ms 58436 KB Output is correct
57 Correct 863 ms 54932 KB Output is correct
58 Correct 537 ms 34812 KB Output is correct
59 Correct 580 ms 34820 KB Output is correct
60 Correct 442 ms 24624 KB Output is correct
61 Correct 628 ms 30976 KB Output is correct
62 Correct 951 ms 37380 KB Output is correct
63 Correct 644 ms 31744 KB Output is correct
64 Correct 796 ms 38452 KB Output is correct
65 Correct 252 ms 16308 KB Output is correct
66 Correct 445 ms 25088 KB Output is correct
67 Correct 802 ms 34912 KB Output is correct
68 Correct 935 ms 37888 KB Output is correct
69 Correct 762 ms 34924 KB Output is correct
70 Correct 86 ms 58412 KB Output is correct
71 Correct 1515 ms 60240 KB Output is correct
72 Correct 500 ms 35072 KB Output is correct
73 Correct 540 ms 35064 KB Output is correct
74 Correct 703 ms 31528 KB Output is correct
75 Correct 1058 ms 38516 KB Output is correct
76 Correct 623 ms 29340 KB Output is correct
77 Correct 674 ms 35356 KB Output is correct
78 Correct 813 ms 38924 KB Output is correct
79 Correct 254 ms 16640 KB Output is correct
80 Correct 584 ms 28928 KB Output is correct
81 Correct 781 ms 35388 KB Output is correct
82 Correct 962 ms 38588 KB Output is correct
83 Correct 711 ms 32308 KB Output is correct
84 Correct 75 ms 57592 KB Output is correct
85 Correct 805 ms 52728 KB Output is correct
86 Correct 493 ms 32516 KB Output is correct
87 Correct 642 ms 29184 KB Output is correct
88 Correct 873 ms 33700 KB Output is correct
89 Correct 674 ms 29676 KB Output is correct
90 Correct 829 ms 36096 KB Output is correct
91 Correct 357 ms 19204 KB Output is correct
92 Correct 695 ms 31236 KB Output is correct
93 Correct 869 ms 34596 KB Output is correct
94 Correct 738 ms 35840 KB Output is correct
95 Correct 1305 ms 60916 KB Output is correct
96 Correct 798 ms 55996 KB Output is correct
97 Correct 559 ms 35836 KB Output is correct
98 Correct 594 ms 35844 KB Output is correct
99 Correct 523 ms 26112 KB Output is correct
100 Correct 833 ms 39196 KB Output is correct
101 Correct 583 ms 30460 KB Output is correct
102 Correct 767 ms 36168 KB Output is correct
103 Correct 873 ms 41328 KB Output is correct
104 Correct 435 ms 22020 KB Output is correct
105 Correct 730 ms 34596 KB Output is correct
106 Correct 894 ms 37888 KB Output is correct
107 Correct 818 ms 61172 KB Output is correct
108 Correct 752 ms 35576 KB Output is correct
109 Correct 736 ms 35584 KB Output is correct
110 Correct 790 ms 35780 KB Output is correct
111 Correct 766 ms 35576 KB Output is correct
112 Correct 740 ms 35616 KB Output is correct
113 Correct 766 ms 35472 KB Output is correct
114 Correct 750 ms 35624 KB Output is correct
115 Correct 747 ms 35584 KB Output is correct
116 Correct 785 ms 35584 KB Output is correct