oj.uz

Submission #1041346

# Submission time Handle Problem Language Result Execution time Memory
1041346 2024-08-01T22:13:56 Z PCTprobability Simurgh (IOI17_simurgh) C++17
30 / 100
 957 ms 2140 KB 
#include "simurgh.h"
#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 UnionFind{
  vector<int> p,sz;
  UnionFind(int n){
    p.resize(n);
    sz.resize(n);
    for(int i=0;i<n;i++) p[i]=i;
    for(int i=0;i<n;i++) sz[i]=1;
  }
  ll root(ll x){
    if(x==p[x]) return x;
    return p[x]=root(p[x]);
  }
  bool merge(ll x,ll y){
    x=root(x);
    y=root(y);
    if(x==y) return false;
    if(sz[x]<sz[y]) swap(x,y);
    sz[x]+=sz[y];
    p[y]=x;
    return true;
  }
  ll size(ll x){
    return sz[root(x)];
  }
};
vector<int> find_roads(int n,vector<int> u,vector<int> v){
  vector<int> a,b;
  UnionFind t(n);
  int m=u.size();
  for(int i=0;i<m;i++){
    if(t.merge(u[i],v[i])) a.pb(i);
  }
  for(int i=0;i<m;i++){
    bool f=false;
    for(auto e:a) if(e==i) f=true;
    for(auto e:b) if(e==i) f=true;
    if(f) continue;
    vector<int> c;
    for(auto e:a) c.pb(e);
    for(auto e:b) c.pb(e);
    int nm=count_common_roads(c);
    for(auto e:a){
      UnionFind t2(n);
      t2.merge(u[i],v[i]);
      vector<int> d;
      d.pb(i);
      for(auto f:a){
        if(f!=e){
          t2.merge(u[f],v[f]);
          d.pb(f);
        }
      }
      for(auto f:b){
        d.pb(f);
        t2.merge(u[f],v[f]);
      }
      if(t2.size(0)==n){
        int nm2=count_common_roads(d);
        if(nm<nm2){
          b.pb(i);
          vector<int> a2;
          for(auto f:a) if(f!=e) a2.pb(f);
          a=a2;
          break;
        }
      }
    }
  }
  vector<int> c;
  for(auto e:a) c.pb(e);
  for(auto e:b) c.pb(e);
  return c;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 604 KB correct
8 Correct 0 ms 360 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 604 KB correct
8 Correct 0 ms 360 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 19 ms 344 KB correct
15 Correct 12 ms 464 KB correct
16 Correct 16 ms 440 KB correct
17 Correct 16 ms 344 KB correct
18 Correct 5 ms 348 KB correct
19 Correct 15 ms 440 KB correct
20 Correct 12 ms 344 KB correct
21 Correct 14 ms 348 KB correct
22 Correct 19 ms 456 KB correct
23 Correct 17 ms 452 KB correct
24 Correct 16 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 16 ms 348 KB correct
27 Correct 16 ms 448 KB correct
28 Correct 6 ms 344 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 17 ms 452 KB correct
31 Correct 18 ms 444 KB correct
32 Correct 19 ms 344 KB correct
33 Correct 22 ms 348 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 604 KB correct
8 Correct 0 ms 360 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 19 ms 344 KB correct
15 Correct 12 ms 464 KB correct
16 Correct 16 ms 440 KB correct
17 Correct 16 ms 344 KB correct
18 Correct 5 ms 348 KB correct
19 Correct 15 ms 440 KB correct
20 Correct 12 ms 344 KB correct
21 Correct 14 ms 348 KB correct
22 Correct 19 ms 456 KB correct
23 Correct 17 ms 452 KB correct
24 Correct 16 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 16 ms 348 KB correct
27 Correct 16 ms 448 KB correct
28 Correct 6 ms 344 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 17 ms 452 KB correct
31 Correct 18 ms 444 KB correct
32 Correct 19 ms 344 KB correct
33 Correct 22 ms 348 KB correct
34 Incorrect 957 ms 856 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Incorrect 918 ms 2140 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB correct
2 Correct 0 ms 344 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 604 KB correct
8 Correct 0 ms 360 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 440 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 19 ms 344 KB correct
15 Correct 12 ms 464 KB correct
16 Correct 16 ms 440 KB correct
17 Correct 16 ms 344 KB correct
18 Correct 5 ms 348 KB correct
19 Correct 15 ms 440 KB correct
20 Correct 12 ms 344 KB correct
21 Correct 14 ms 348 KB correct
22 Correct 19 ms 456 KB correct
23 Correct 17 ms 452 KB correct
24 Correct 16 ms 344 KB correct
25 Correct 1 ms 348 KB correct
26 Correct 16 ms 348 KB correct
27 Correct 16 ms 448 KB correct
28 Correct 6 ms 344 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 17 ms 452 KB correct
31 Correct 18 ms 444 KB correct
32 Correct 19 ms 344 KB correct
33 Correct 22 ms 348 KB correct
34 Incorrect 957 ms 856 KB WA in grader: NO
35 Halted 0 ms 0 KB -