Gym 101532 2017 JUST Programming Contest

A

B-Array Reconstructing

#include<bits/stdc++.h>

using namespace std;

int a[1005];

int main(){
    int t,n,m,i;
    cin>>t;
    while(t--){
        cin>>n>>m;
        int sum=0;
        for(i=1;i<=n;i++){
            cin>>a[i];
            if(a[i]==-1)
                sum++;
            if(a[i]==-1&&i!=1&&a[i-1]!=-1){
                a[i]=(a[i-1]+1)%m;
                sum--;
            }
        }
        if(sum){
            for(i=sum;i>=1;i--){
                if(a[i+1]==0)
                    a[i]=m-1;
                else
                    a[i]=a[i+1]-1;
            }
        }
        for(i=1;i<=n;i++)
            cout<<a[i]<<" ";
        cout<<endl;
    }
    return 0;
}

C

D

E

F

G-Magical Indices

#include<bits/stdc++.h>

using namespace std;
int a[1000005];
int tong[1000005];
int main(){
    int t,n,i,j;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(i=0;i<n;i++){
            scanf("%d",&a[i]);
            tong[i]=1;
        }
        int mmin=a[0],mmax=a[n-1];
        for(i=1;i<n-1;i++){
            if(a[i]<mmin)
                tong[i]=0;
            mmin=max(mmin,a[i]);
        }
        for(i=n-2;i>=1;i--){
            if(a[i]>mmax)
                tong[i]=0;
                mmax=min(mmax,a[i]);
        }
        int ans=0;
        for(i=1;i<=n-2;i++){
            if(tong[i])
                ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}

H-Corrupted Images

#include<bits/stdc++.h>

using namespace std;

int main(){
    int t,n,i,j,k,l,m;
    char str[100][100];
    scanf("%d",&t);
    while(t--){
        int sum=0,s=0;
        scanf("%d%d",&n,&m);
        for(i=0;i<n;i++)
            scanf("%s",str[i]);
        for(i=0;i<n;i++){
            for(j=0;j<m;j++){
                if(str[i][j]=='1')
                    s++;
                if(i==0||i==n-1||j==0||j==m-1)
                    if(str[i][j]=='1')
                        sum++;
            }
        }
        int x=m*2+n*2-4;
        if(s<x)
            printf("-1\n");
        else
            printf("%d\n",x-sum);
    }
    return 0;
}

I-The Crazy Jumper

#include<bits/stdc++.h>

using namespace std;

int a[200005];//存箱子的颜色
int d[200005];//记录走到每个箱子的最小步数
int j[200005];//记录当前箱子可以从左边哪个箱子跳过来
int main(){
    int t,n,i;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        map<int,int>ma;
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(i=1;i<=n;i++){
            j[i]=-1;
            if(ma[a[i]])//如果这个颜色在前面出现过
                j[i]=ma[a[i]];
            ma[a[i]]=i;//记录这个颜色的位置
        }
        d[0]=-1;
        for(i=1;i<=n;i++){
            d[i]=d[i-1]+1;//每次跳一个箱子
            if(j[i]!=-1)
                d[i]=min(d[i],d[j[i]]+1);//取最小值
        }
        printf("%d\n",d[n]);
    }
    return 0;
}

J-The Hell Boy

#include <bits/stdc++.h>
using namespace std;
const int MD=1e9+7;
int main()
{
    ios::sync_with_stdio(0);
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        long long t=0;
        for(int i=0,x; i<n; i++)cin>>x,t=(t+t*x+x)%MD;
        cout<<t<<"\n";
    }
    return 0;
}

K-Palindromes Building

#include<bits/stdc++.h>

using namespace std;

char str[21];
int f[11];
int a[30];
int main(){
    int t,n,i,j;
    cin>>t;
    f[0]=1;
    for(i=1;i<=10;i++)f[i]=f[i-1]*i;
    while(t--){
        cin>>n;
        cin>>str;
        memset(a,0,sizeof(a));
        for(i=0;i<n;i++)
            a[str[i]-'a']++;
        int flag=0,ans=0;
        for(i=0;i<26;i++){
            flag+=(a[i]&1);//奇数的个数
            a[i]>>=1;//等同于除2
        }
        if(flag>1){
            cout<<"0"<<endl;
            continue;
        }
        else{
            n/=2;
            ans=f[n];
            for(i=0;i<26;i++)
                ans/=f[a[i]];
        }
        cout<<ans<<endl;
    }
    return 0;
}