Codeforces Round #549 (Div. 2)(A,B,C,D)

题目链接:http://codeforces.com/contest/1143/problem

第一题(模拟):

#include<bits/stdc++.h>
using namespace std;
#define min(x,y) ((x)<(y)?(x):(y))
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
int mod=20100501;
const int maxn=2e5+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}

int n,a[maxn];

int main(){
    cin>>n;
    rep(i,1,n+1) cin>>a[i];
    int x=n;while(a[x]) x--;
    int y=n;while(a[y]==0) y--;
    cout<<min(x,y)<<endl;
    return 0;
}

第二题(枚举+贪心): 

#include<bits/stdc++.h>
using namespace std;
#define min(x,y) ((x)<(y)?(x):(y))
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
int mod=20100501;
const int maxn=30+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
int x,dig[30],cnt=0;
 ll pw[15];
ll ans=0;
int main(){
    cin>>x;
    pw[0]=1;for(int i=1;i<15;i++) pw[i]=pw[i-1]*9;
    while(x) dig[cnt++]=x%10,x/=10;
    for(int i=0;i<cnt;i++){
        if(i==0){
            ll tmp=1;for(int j=i;j<cnt;j++) tmp=tmp*dig[j];
            ans=max(ans,tmp);
        }else{
            ll tmp=1;for(int j=i+1;j<cnt;j++) tmp*=dig[j];
            if(i==cnt-1) ans=max(ans,tmp*max(1,dig[i]-1)*pw[i]);
            else ans=max(ans,tmp*(dig[i]-1)*pw[i]);
        }
    }
    cout<<ans<<endl;
    return 0;
}

第三题(DFS+思维):

#include<bits/stdc++.h>
using namespace std;
#define min(x,y) ((x)<(y)?(x):(y))
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
int mod=20100501;
const int maxn=1e5+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
int n,x,y,c[maxn];
int rot=1e5+1;
int ans[maxn],cnt=0;
vector<int> g[maxn];
void dfs(int u,int pre){
    int tmp=c[u];
    for(int i=0;i<g[u].size();i++){
        if(g[u][i]==pre) continue;
        tmp&=c[g[u][i]];
        dfs(g[u][i],u);
    }
    if(tmp&&u!=rot) ans[cnt++]=u;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>x>>y;
        if(x==-1) x=rot;
        c[i]=y;
        g[x].push_back(i);
        g[i].push_back(x);
    }
    dfs(rot,-1);
    sort(ans,ans+cnt);
    if(cnt==0) puts("-1");
    else rep(i,0,cnt) cout<<ans[i]<<" ";
    return 0;
}

第四题(数论+枚举):

#include<bits/stdc++.h>
using namespace std;
#define min(x,y) ((x)<(y)?(x):(y))
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
int mod=20100501;
const int maxn=30+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll a,b,n,k;
ll minv=1e18,maxv=0;
ll solve(ll x){
    return 1LL*n*k/gcd(x,n*k);
}
void cal(ll x){
    minv=min(minv,solve(x));
    maxv=max(maxv,solve(x));
}
int main(){
    cin>>n>>k>>a>>b;
    ll ta=k-a,tb=k-b;
    rep(i,0,n){
        cal(ta+tb+i*k);
        cal(a+b+i*k);
        cal(ta+b+i*k);
        cal(a+tb+i*k);
    }
    cout<<minv<<" "<<maxv<<endl;
    return 0;
}