8.5做题记录

上午

#include <bits/stdc++.h>
#define int long long
using namespace std;
int ans[20],s;
signed main()
{
    freopen("x3.in","r",stdin);
    freopen("x3.out","w",stdout);
    int n,l,maxn=-1;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        l=0;
        while(x)
        {
            l++;
            if(x&1)
                ans[l]++;
            x>>=1;
        }
        maxn=max(maxn,l);
    }
    for(int i=1;i<=maxn;i++)
        s+=(1<<(i-1))*ans[i]*(n-ans[i]);
    cout<<s;
    return 0;
}

//40pts
#include <bits/stdc++.h>
using namespace std;
int n,m,a[500005],zx[500005];
vector < int > v[500005];
int main()
{
    freopen("place.in","r",stdin);
    freopen("place.out","w",stdout);
    zx[1]=1;
    cin>>n>>m>>a[1];
    for(int i=2;i<=n;i++)
        v[1].push_back(i);
    for(int i=2;i<=n;i++)
    {
        int x;
        cin>>a[i]>>x;
        zx[i]=x;
        int p=x;
        while(zx[p]!=p)
        {
            v[p].push_back(i);
            p=zx[p];
        }
    }
    /*for(int i=1;i<=n;i++)
    {
        cout<<zx[i]<<endl;
        for(int j=0;j<v[i].size();j++)
            cout<<
    }*/
    while(m--)
    {
        char c;
        cin>>c;
        if(c=='p')
        {
            int x,y;
            cin>>x>>y;
            for(int i=0;i<v[x].size();i++)
                a[v[x][i]]+=y;
        }
        else
        {
            int x;
            cin>>x;
            cout<<a[x]<<endl;
        }
    }
    return 0;
}

#include <bits/stdc++.h>
#define int long long
#define N 1000000000
using namespace std;
int n,ss[1000005],t,b,k=1,p,l,r,mid;
bool bz[100005];
void dfs(int x,int s,int h)
{
    if(x==t || s*ss[x]>mid)
    {
        if(h&1)
            b+=mid/s;
        else b-=mid/s;
        return;
    }
    if(s*ss[x]<=mid)
        dfs(x+1,s*ss[x],h+1);
    dfs(x+1,s,h);
}
signed main()
{
    freopen("broj.in","r",stdin);
    freopen("broj.out","w",stdout);
    cin>>n>>p;
    if(n==1)
    {
        cout<<p;
        return 0;
    }
    else if(p*p>N)
    {
        cout<<0;
        return 0;
    }
    for(int i=2;i<=p;i++)
    {
        if(!bz[i])
            ss[++t]=i;
        for(int j=1;j<=t;j++)
        {
            if(i*ss[j]>p)
                break;
            bz[i*ss[j]]=1;
            if(i%ss[j]==0)
                break;
        }
    }
    l=p,r=N/p+1;
    while(l<=r)
    {
        mid=l+r>>1;
        b=mid,dfs(1,1,0);
        b=mid-b;
        if (b<n) l=mid+1;
        else r=mid-1;
    }
    if (l*p>N)
        cout<<0;
    else
        cout<<l*p;
    return 0;
}

下午

#include <bits/stdc++.h>
using namespace std;
char a[105][105],s; 
int main()
{
    freopen("puzzle.in","r",stdin);
    freopen("puzzle.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cin>>a[i][j];
            if(a[i][j]=='#')
                s++;     
        }
    }
    if(s%5!=0)
    {
        puts("NO");
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]=='#')
            {
                if(a[i+1][j]=='#' && a[i+1][j-1]=='#' && a[i+1][j+1]=='#' && a[i+2][j]=='#')
                {
                    a[i+1][j]='.';
                    a[i+1][j-1]='.';
                    a[i+1][j+1]='.';
                    a[i+2][j]='.';
                }
                else
                {
                    puts("NO");
                    return 0; 
                }
            }
        }
    }
    puts("YES");
    return 0;
}

 

#include<bits/stdc++.h>
using namespace std;
int n,a[5005],v[5005],ans,m;
int main()
{
    freopen("box.in","r",stdin);
    freopen("box.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
        if(!v[i])
        {
            ans++;
            m=1;
            for(int j=i+1;j<=n;j++)
            if(!v[j]&&a[j]>=m)
            {
                v[j]=1;
                m++;
            }
        }
    cout<<ans<<endl;
    return 0;
}

 

#include <bits/stdc++.h>
using namespace std;
struct node{
    int x,y,z;
}f[100005];
int n,m,a[20005],vis[20005];
bool cmp(node a,node vis)
{
    return a.z>vis.z;
}
int find(int x)
{
    if(a[x]==x)
        return x;
    a[x]=find(a[x]);
    return a[x];
}
void add(int x,int y)
{
    x=find(a[x]);
    y=find(a[y]);
    a[x]=y;
}
bool check(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x==y) return 1;
    return 0;
}
int main()
{
    freopen("love.in","r",stdin);
    freopen("love.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        a[i]=i;
    for(int i=1;i<=m;i++)
        cin>>f[i].x>>f[i].y>>f[i].z;
    sort(f+1,f+m+1,cmp);
    for(int i=1;i<=m+1;i++)
    {
        if(check(f[i].x,f[i].y))
        {
            cout<<f[i].z;
            return 0;
        }
        else
        {
            if(!vis[f[i].x])
                vis[f[i].x]=f[i].y;
            else
                add(vis[f[i].x],f[i].y);
            if(!vis[f[i].y])
                vis[f[i].y]=f[i].x;
            else
                add(vis[f[i].y],f[i].x);
        }
    }
    return 0;
}

 

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
vector < int > g[300005],v;
int a[300005];
bool vis[300005];
int n,m,sum,ans=1;
int qsm(int p,int q)
{
    int re=1;
    while(q!=0)
    {
        if(q&1)
            re=re*p%mod;
        p=p*p%mod;
        q>>=1;
    }
    return re;
}
void dfs(int x,int dep)
{
    vis[x]=1;
    a[x]=dep;
    for(int i=0;i<g[x].size();i++)
    {
        int t=g[x][i];
        if(vis[t] && dep-a[t]>1)
            v.push_back(dep+1-a[t]);
        else if(!vis[t])
            dfs(t,dep+1);
    }
    vis[x]=1;
}
signed main()
{
    freopen("desert.in","r",stdin);
    freopen("desert.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        if(!vis[i])
            dfs(i,1);
    for(int i=0;i<v.size();i++)
    {
        ans=ans*(qsm(2,v[i])-1)%mod;
        sum+=v[i];
    }
    ans=ans*qsm(2,m-sum)%mod;
    cout<<ans;
    return 0;
}