Codeforces Round #436 (Div. 2)

Codeforces Round #436 (Div. 2)

A. Fair Game

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
#define vec vector
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
int a[1000],f[1000];
int main(){
    int n=read(),num=0,a1=0,a2=0;
    for (int i=1;i<=n;i++) a[i]=read(),f[a[i]]++;
    for (int i=1;i<=100;i++)
        if (f[i]>0) {
            if (!a1){
                a1=i;
            } else a2=i;
            num++;
        }
    if (num!=2 || f[a1]!=f[a2]) puts("NO");
    else {
        puts("YES");
        printf("%d %d
",a1,a2);
    }
    return 0;
} 

B. Polycarp and Letters

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
#define vec vector
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
char ch[500];
int f[100],num,ans;
int main(){
    int n=read();
    scanf("%s",ch+1);
    for (int i=1;i<=n;i++){
        if (ch[i]>='a' && ch[i]<='z'){
            if (!f[ch[i]-'a']) num++;
            f[ch[i]-'a']=1;
            ans=max(ans,num);
        } else {
            num=0; memset(f,0,sizeof(f));
        }
    }
    printf("%d",ans);
    return 0;
} 

C. Bus

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
#define vec vector
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
int main(){
    int a=read(),b=read(),f=read(),k=read(),now=b,le=f,a_=(a-f)*2,o_=f*2,flag=1,num=0;
    if (k==1){
        if (f>b || a-f>b) {puts("-1"); return 0;}
        if (a>b) {
            puts("1"); return 0;
        } else {
            puts("0"); return 0;
        }
    }
    now-=f;
    if (now<0){
        puts("-1");
        return 0;
    }
    if (a_>now) {now=b; num++;}
    for (int i=1;i<=k-1;i++){
        if (now<0){
            puts("-1");
            return 0;
        }
        if (i&1){
            now-=a_;
            if (now<0){
                puts("-1");
                return 0;
            }
            if (i<k-1 && o_>now) {now=b; num++;}
        } else {
            now-=o_;
            if (now<0){
                puts("-1");
                return 0;
            }
            if (i<k-1 && a_>now) {now=b; num++;}
        }
    }
    if (k%2==0){
    if (now<f) {now=b; num++;}
    now-=f;
    if (now<0){
        puts("-1");
        return 0;
    }
    printf("%d
",num);
    } else {
    if (now<(a-f)) {now=b; num++;}
    now-=(a-f);
    if (now<0){
        puts("-1");
        return 0;
    }
    printf("%d
",num);
    }
    return 0;
} 

D. Make a Permutation!

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
#define vec vector
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
const int N=200005;
int f[N],flag[N],a[N],q[N],nu[N];
int main(){
    int n=read(),nuu=0,h=0,che=0;
    for (int i=1;i<=n;i++) a[i]=read(),f[a[i]]++;
    for (int i=1;i<=n;i++)
        if (f[i]==0){
            q[++nuu]=i; ++che;
        }
    for (int i=1;i<=n;i++){
        if (f[a[i]]>1){
             if (flag[a[i]] || q[h+1]<a[i])
                        {
                            f[a[i]]--;
                            a[i]=q[++h];
                         } else flag[a[i]]=1;
        } else flag[a[i]]=1;
    }
    printf("%d
",che);
    for (int i=1;i<=n;i++)
        printf("%d ",a[i]);
    return 0;
} 

E. Fire

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
#define vec vector
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
struct node{
    int t,d,p,id;
    friend bool operator <(node a,node b){
        return a.d<b.d;
    }
}f[200];
int dp[200][3000],a[200][3000],q[200],nu,t[200][3000];
void dfs(int i,int x){
    if (i==0) return ;
    if (a[i][x]) {
        q[++nu]=f[i].id; dfs(i-1,t[i][x]);
    }
    else dfs(i-1,x);
}
int main(){
    int n=read();
    for (int i=1;i<=n;i++) f[i].t=read(),f[i].d=read(),f[i].p=read(),f[i].id=i,f[i].d--;
    sort(f+1,f+n+1);
    for (int i=1;i<=n;i++) {
        for (int j=0;j<=f[i].d;j++)    {
            if (j>=f[i].t && dp[i-1][j]<dp[i-1][j-f[i].t]+f[i].p) {
                dp[i][j]=dp[i-1][j-f[i].t]+f[i].p,a[i][j]=1; t[i][j]=j-f[i].t;
            } else dp[i][j]=dp[i-1][j],a[i][j]=0,t[i][j]=j;
            //if (i<6) cout<<i<<" "<<j<<" "<<dp[i][j]<<" "<<a[i][j]<<endl;
        }
        for (int j=f[i].d+1;j<=f[n].d;j++) dp[i][j]=dp[i][j-1],a[i][j]=a[i][j-1],t[i][j]=t[i][j-1];
    } 
    dfs(n,f[n].d);
    printf("%d
%d
",dp[n][f[n].d],nu);
    while (nu){
        printf("%d ",q[nu]);
        nu--;
    }
    return 0;
} 

F. Cities Excursions

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof(a))
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define pq priority_queue
#define pqb priority_queue <int, vector<int>, less<int> >
#define pqs priority_queue <int, vector<int>, greater<int> >
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
//void add(int x,int y,int z){ v[++e]=y; next[e]=head[x]; head[x]=e; cost[e]=z; }
int dx[5]={0,-1,1,0,0},dy[5]={0,0,0,-1,1};
ll read(){ ll ans=0; char last=' ',ch=getchar();
while(ch<'0' || ch>'9')last=ch,ch=getchar();
while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
if(last=='-')ans=-ans; return ans;
}
const int N=400005;
struct node{
    int a,c,i;
};
vector<node> vec[N];
int v[N],head[N],Next[N],q[N],ans[N],f[16][N],g[N],vis[N],e;
void add(int x,int y){ v[++e]=y; Next[e]=head[x]; head[x]=e; }
void dfs(int u){
    vis[u]=1;
    for (int i=head[u];i;i=Next[i]){
        int v_=v[i];
        if (g[v_]!=0) g[v_]=min(g[v_],u);
        if (!vis[v_]) g[v_]=u,dfs(v_);
    }
}
int main(){
    int n=read(),m=read(),q=read();
    for (int i=1;i<=m;i++){
        int a=read(),b=read();
        add(b,a);
    }
    for (int i=1;i<=q;i++){
        int a=read(),b=read(),c=read();
        vec[b].push_back((node){a,c,i});
    }
    for (int t=1;t<=n;t++){
        int size=vec[t].size();
        if (size==0) continue;
        memset(g,0,sizeof(g));
        memset(vis,0,sizeof(vis));
        dfs(t);
        for (int i=1;i<=n;i++) f[0][i]=g[i];
        for (int i=1;i<=15;i++)
            for (int j=1;j<=n;j++)
                f[i][j]=f[i-1][f[i-1][j]];
        for (int i=0;i<size;i++){ 
            if (!g[vec[t][i].a]||f[15][vec[t][i].a]) {
                ans[vec[t][i].i]=-1;
                continue;
            }
            int k=vec[t][i].c,p=0,no=vec[t][i].a; k--;
            for (;k;k>>=1,p++)
            if (k&1){
                no=f[p][no];
            }
            if (no==0) ans[vec[t][i].i]=-1;
            else ans[vec[t][i].i]=no;
        }
    }
    for (int i=1;i<=q;i++){
        printf("%d
",ans[i]);
    }    
    return 0;
}