Codeforces Round #237 (Div. 2)

A - Valera and X

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=310;
int n;
char a[maxn][maxn];
bool solve()
{
    char tmp=a[1][1],x;
    bool first=true;
    for(int i=1;i<=n;i++)
        if(a[i][i]!=tmp){return false;}
    for(int i=1;i<=n;i++)
        if(a[i][n+1-i]!=tmp)return false;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            if(i==j||i+j==n+1)continue;
            if(a[i][j]==tmp)return false;
            if(first){x=a[i][j];first=false;}
            else if(a[i][j]!=x)return false;
        }
    return true;
}
int main()
{
    //freopen("in.txt","r",stdin);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>(a[i]+1);
    if(solve())cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}

B - Marathon

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
double a,d;
int n;
int main()
{
    //freopen("in.txt","r",stdin);
    cin>>a>>d>>n;
    double cur=0;
    for(int i=1;i<=n;i++)
    {
        cur=i*d;
        long long t=(long long)(cur/a);
        double res=cur-t*a;t%=4;
        if(t==0)printf("%.10lf %.10lf\n",res,0.0);
        else if(t==1)printf("%.10lf %.10lf\n",a,res);
        else if(t==2)printf("%.10lf %.10lf\n",a-res,a);
        else if(t==3)printf("%.10lf %.10lf\n",0.0,a-res);
    }
    return 0;
}

C - Restore Graph

保存同一距离的点的编号，然后根据距离进行连边

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=100010;
int n,k;
vector<int> v[maxn];
vector<pair<int,int> > grid;
int main()
{
    //freopen("in.txt","r",stdin);
    int x,maxdis=-1;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        v[x].push_back(i);
        maxdis=max(x,maxdis);
    }
    if(v[0].size()!=1){cout<<-1<<endl;return 0;}
    for(int i=1;i<=maxdis;i++)
    {
        int edge=(i!=1),cnt=0;
        for(int j=0;j<v[i].size();j++)
        {
            if(edge==k)
            {
                edge=(i!=1);
                cnt++;
            }
            if(cnt==v[i-1].size()){cout<<-1<<endl;return 0;}
            grid.push_back(make_pair(v[i-1][cnt],v[i][j]));
            edge++;
        }
    }
    cout<<grid.size()<<endl;
    for(int i=0;i<grid.size();i++)
        cout<<grid[i].first<<" "<<grid[i].second<<endl;
    return 0;

}