oj.uz

답안 #1030766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030766 2024-07-22T09:42:50 Z PCTprobability 장난감 기차 (IOI17_train) C++17
16 / 100
 10 ms 11356 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<int> g[202020],g2[202020];
int id[202020];
int now=0;
vector<vector<int>> sc;
int seen[202020];
vector<int> q;
void dfs2(int a){
  seen[a]=1;
  q.pb(a);
  for(auto e:g2[a]){
    if(!seen[e]) dfs2(e);
  }
}
void dfs(int a){
  seen[a]=1;
  for(auto e:g[a]){
    if(seen[e]) continue;
    dfs(e);
  }
  id[a]=now;
  now++;
}
vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){
  int n=a.size(),m=u.size();
  bool one=true;
  for(int i=0;i<m;i++){
    if(v[i]==u[i]||u[i]+1==v[i]) continue;
    one=false;
  }
  bool three=true;
  for(auto e:a){
    if(e==0) three=false;
  }
  bool four=true;
  for(auto e:a){
    if(e) four=false;
  }
  if(one){
    vector<int> x(n),y(n);
    for(int i=0;i<m;i++){
      if(v[i]==u[i]) x[v[i]]=1;
      else y[u[i]]=1;
    }
    vector<int> ans(n);
    for(int i=n-1;i>=0;i--){
      ans[i]=1-a[i];
      if(x[i]){
        if(a[i]&&r[i]) ans[i]=1;
        if(a[i]==0&&r[i]==0) ans[i]=0;
      }
      if(y[i]){
        if(ans[i+1]==a[i]) ans[i]=a[i];
      }
    }
    return ans;
  }
  if(four){
    //充電を全部消して、葉を消していく
    vector<int> d(n);
    vector<vector<int>> g(n),g2(n),g3(n);
    for(int i=0;i<m;i++){
      if(r[u[i]]||r[v[i]]) continue;
      g[u[i]].pb(v[i]);
      g2[v[i]].pb(u[i]);
    }
    for(int i=0;i<m;i++){
      g3[v[i]].pb(u[i]);
    }
    vector<int> st;
    vector<int> ans(n);
    for(int i=0;i<n;i++){
      d[i]=g[i].size();
      if(d[i]==0){
        ans[i]=1;
        st.pb(i);
      }
    }
    while(st.size()){
      int x=st.back();
      st.pop_back();
      for(auto e:g2[x]){
        d[e]--;
        if(d[e]==0){
          st.pb(e);
          ans[e]=1;
        }
      }
    }
    for(int i=0;i<n;i++){
      if(ans[i]==0) st.pb(i);
    }
    while(st.size()){
      int x=st.back();
      st.pop_back();
      for(auto e:g3[x]){
        if(ans[e]){
          ans[e]=0;
          st.pb(e);
        }
      }
    }
    return ans;
  }
  if(three){
    //scc して 1 があり n = 1 なら自己ループに行けるところが勝ち
    for(int i=0;i<m;i++){
      g[u[i]].pb(v[i]);
      g2[v[i]].pb(u[i]);
    }
    for(int i=0;i<n;i++) id[i]=-1;
    for(int i=0;i<n;i++){
      if(id[i]==-1){
        dfs(i);
      }
    }
    vector<pair<int,int>> p;
    for(int i=0;i<n;i++) p.pb({id[i],i});
    sor(p);
    rever(p);
    for(int i=0;i<n;i++) seen[i]=0;
    for(auto e:p){
      if(seen[e.se]==0){
        dfs2(e.se);
        sc.pb(q);
        q.clear();
      }
    }
    vector<int> lp(n);
    for(int i=0;i<m;i++){
      if(u[i]==v[i]) lp[i]=1;
    }
    vector<int> ans(n);
    for(auto e:sc){
      int ch=0;
      for(auto f:e){
        if(r[f]) ch=1;
      }
      if(e.size()==1&&ch){
        if(lp[e[0]]==0) ch=0;
      }
      for(auto f:e){
        ans[f]=ch;
      }
    }
    vector<int> st;
    for(int i=0;i<n;i++){
      if(ans[i]==1) st.pb(i);
    }
    while(st.size()){
      int x=st.back();
      st.pop_back();
      for(auto e:g2[x]){
        if(ans[e]==0){
          st.pb(e);
          ans[e]=1;
        }
      }
    }
    return ans;
  }
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:238:1: warning: control reaches end of non-void function [-Wreturn-type]
  238 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10076 KB Output is correct
2 Correct 6 ms 10076 KB Output is correct
3 Correct 9 ms 10076 KB Output is correct
4 Correct 6 ms 10076 KB Output is correct
5 Correct 6 ms 10076 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 6 ms 10072 KB Output is correct
8 Correct 7 ms 10072 KB Output is correct
9 Correct 6 ms 10076 KB Output is correct
10 Correct 5 ms 10076 KB Output is correct
11 Correct 9 ms 10016 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 9816 KB 3rd lines differ - on the 8th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 11356 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 10844 KB Output is correct
2 Correct 9 ms 11136 KB Output is correct
3 Correct 9 ms 11100 KB Output is correct
4 Correct 9 ms 11100 KB Output is correct
5 Correct 9 ms 11352 KB Output is correct
6 Correct 9 ms 11100 KB Output is correct
7 Correct 9 ms 11100 KB Output is correct
8 Correct 9 ms 11100 KB Output is correct
9 Correct 8 ms 10844 KB Output is correct
10 Correct 8 ms 11032 KB Output is correct
11 Correct 8 ms 10944 KB Output is correct
12 Correct 8 ms 10844 KB Output is correct
13 Correct 10 ms 11100 KB Output is correct
14 Correct 9 ms 11012 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 11012 KB 3rd lines differ - on the 2nd token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10076 KB Output is correct
2 Correct 6 ms 10076 KB Output is correct
3 Correct 9 ms 10076 KB Output is correct
4 Correct 6 ms 10076 KB Output is correct
5 Correct 6 ms 10076 KB Output is correct
6 Correct 6 ms 10076 KB Output is correct
7 Correct 6 ms 10072 KB Output is correct
8 Correct 7 ms 10072 KB Output is correct
9 Correct 6 ms 10076 KB Output is correct
10 Correct 5 ms 10076 KB Output is correct
11 Correct 9 ms 10016 KB Output is correct
12 Incorrect 4 ms 9816 KB 3rd lines differ - on the 8th token, expected: '0', found: '1'
13 Halted 0 ms 0 KB -