Codeforces Round #362 (Div. 1) 题解(待续)

Lorenzo Von Matterhorn

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
map<ll,ll> h;
void rull(ll i,ll v){
    while(i>1) {
        if(h.count(i)) h[i]+=v; 
        else h[i] = v;
        i/=2;
    }
}
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);
    int q=read();
    while(q--) {
        int p=read();
        if (p==2) {
            ll u,v;
            cin>>u>>v;
            ll ans=0;
            while(u^v) {
                if (u>v) {
                    if(h.count(u))ans+=h[u];
                    u/=2;
                } else {
                    if(h.count(v))ans+=h[v];
                    v/=2;
                }
            }
            cout<<ans<<endl; continue;
        }
        ll u,v,w;
        cin>>u>>v>>w;
        while(u^v) {
            if (u>v) {
                if(h.count(u)) h[u]+=w; else h[u]=w;
                u/=2;
            } else {
                if(h.count(v)) h[v]+=w; else h[v]=w;
                v/=2;
            }
        }
    }



    return 0;
}

Puzzles

算概率$p[v]=p[x]+1+(siz[x]-1-siz[v])/2$

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (100000+10)
vi e[MAXN];
int son[MAXN],fa[MAXN],sz[MAXN];
void dfs(int x, int f) {
    int Sz=e[x].size();
    sz[x]=1;
    son[x]=0;
    Rep(i,Sz) {
        int v=e[x][i];
        if (v==f) continue;
        dfs(v,x);
        sz[x]+=sz[v]; son[x]++;
    }
}
double p[MAXN];
double dfs2(int x, int f) {
    int Sz=e[x].size();
    double an=p[x]+1+pow(2,son[x]-1)*(sz[x]-1);

    Rep(i,Sz) {
        int v=e[x][i];
        if (v==f) continue;
        double an2=p[x]+1+(sz[x]-1-sz[v])/(double)2;
        p[v]=an2;
        dfs2(v,x);
    }
}
int main()
{
//  freopen("b.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    Fork(i,2,n) {
        fa[i]=read();
        e[i].pb(fa[i]);
        e[fa[i]].pb(i);
    }
    p[1]=1;
    dfs(1,0);dfs2(1,0);
    cout<<setiosflags(ios::fixed)<<setprecision(10);
    PRi(p,n)
    return 0;
}

PLEASE

$ans=\frac {2^{k-1}+(-1)^k} {2^{k-1}*3}, k=\Pi a_i$
显然$3|{2^{k-1}+(-1)^k}$
$p= [2^{k-1}+(-1)^k]*inv(3) ,q={2^{k-1}}$

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 

ll pow2(ll a,int b,ll p)  //a^b mod p 
{  
    if (b==0) return 1%p;  
    if (b==1) return a%p;  
    ll c=pow2(a,b/2,p)%p;  
    c=c*c%p;  
    if (b&1) c=c*a%p;  
    return c%p;  
}  
ll inv(ll a,ll p) {
    return pow2(a,p-2,p);
}
ll a[100000+10];
int main()
{
//  freopen("c.in","r",stdin);
//  freopen(".out","w",stdout);
    int n;
    cin>>n;
    ll p3=inv(3,F);
    ll k=1;
    For(i,n) {
        cin>>a[i];
    }
    ll t=1;
    For(i,n) if (a[i]%2==0) t=0;
    For(i,n) a[i]%=F-1;
    if (t%2) {
        ll c=1;
        For(i,n) c=c%(F-1)*a[i]%(F-1);
        c=(c-1+F-1)%(F-1);
        ll p=pow2(2,c,F);
        ll q=p;
        p=(p-1+F)%F;
        p=mul(p,p3);
        cout<<p<<'/'<<q<<endl;      
    } else {
        ll c=1;
        For(i,n)
            c=c%(F-1)*(a[i]%(F-1))%(F-1);
        c=(c-1+F-1)%(F-1);
        ll p=pow2(2,c,F);
        ll q=p;
        p=(p+1)%F;
        p=mul(p,p3);
        cout<<p<<'/'<<q<<endl;      
    }
    return 0;
}