Codeforces Round #369 (Div. 2)

原创 2016年08月30日 19:14:08

我冲动的拿起了我的菜刀。。。。。MD 顺秒A加网速给力加B的翻译,以为是好运的开始。。。然后才知道,是厄运的降临。

A. Bus to Udayland
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has n rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.

ZS and Chris are good friends. They insist to get a pair of neighbouring empty seats. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of rows of seats in the bus.

Then, n lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '|') and the last two of them denote the second pair of seats in the row.

Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, 'X' denotes an occupied seat. See the sample cases for more details.

Output

If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next n lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by exactly two charaters (they should be equal to 'O' in the input and to '+' in the output).

If there is no pair of seats for Chris and ZS, print "NO" (without quotes) in a single line.

If there are multiple solutions, you may print any of them.

Examples
Input
6
OO|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX
Output
YES
++|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX
Input
4
XO|OX
XO|XX
OX|OX
XX|OX
Output
NO
Input
5
XX|XX
XX|XX
XO|OX
XO|OO
OX|XO
Output
YES
XX|XX
XX|XX
XO|OX
XO|++
OX|XO
Note

Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair.

O+|+X

XO|XX

OX|OO

XX|OX

OO|OO

OO|XX


题意:

给出一公共汽车平面图。o是空位。x是有人,|是过道。问有没有相邻空座,有,把0改成+。多解输出任意。(注意过道两侧不算相邻)

模拟题。
代码:

<span style="font-size:14px;">#include <bits/stdc++.h>
using namespace std;
const int M=100000;
char a[1005][10];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",&a[i]);
    }
    int flag=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i][0]=='O'&&a[i][1]=='O')
        {
            flag=1;
            a[i][0]=a[i][1]='+';
        }
         if(flag)
            break;
        if(a[i][3]=='O'&&a[i][4]=='O')
        {
             flag=1;
            a[i][3]=a[i][4]='+';
        }
        if(flag)
            break;
    }
    if(flag)
    {
        printf("YES\n");
        for(int i=1;i<=n;i++)
        {
            printf("%s\n",a[i]);
        }
    }
    else
        printf("NO\n");

}</span>

B. Chris and Magic Square
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.

Chris tried filling in random numbers but it didn't work. ZS the Coder realizes that they need to fill in a positive integer such that the numbers in the grid form a magic square. This means that he has to fill in a positive integer so that the sum of the numbers in each row of the grid (), each column of the grid (), and the two long diagonals of the grid (the main diagonal — and the secondary diagonal — ) are equal.

Chris doesn't know what number to fill in. Can you help Chris find the correct positive integer to fill in or determine that it is impossible?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 500) — the number of rows and columns of the magic grid.

n lines follow, each of them contains n integers. The j-th number in the i-th of them denotes ai, j (1 ≤ ai, j ≤ 109 or ai, j = 0), the number in the i-th row and j-th column of the magic grid. If the corresponding cell is empty, ai, j will be equal to 0. Otherwise, ai, j is positive.

It is guaranteed that there is exactly one pair of integers i, j (1 ≤ i, j ≤ n) such that ai, j = 0.

Output

Output a single integer, the positive integer x (1 ≤ x ≤ 1018) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer x does not exist, output  - 1 instead.

If there are multiple solutions, you may print any of them.

Examples
Input
3
4 0 2
3 5 7
8 1 6
Output
9
Input
4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1
Output
1
Input
4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1
Output
-1
Note

In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed,

The sum of numbers in each row is:

4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15.

The sum of numbers in each column is:

4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15.

The sum of numbers in the two diagonals is:

4 + 5 + 6 = 2 + 5 + 8 = 15.

In the third sample case, it is impossible to fill a number in the empty square such that the resulting grid is a magic square.

题意:在矩阵中 0位置是空出来的,问是否存在一个正整数,使矩阵的所有行,所有列,对角线值相等,没有输出-1。

题解:

随便找两行(一个是含有“0”的,另一个随意)。求出0位置该填什么(此时填的数得保证是正整数),然后判断所有行,所有列, 对角线是否相等,

代码:

#include <bits/stdc++.h>
#define LL  long long
using namespace std;
const int M=100000;
LL a[505][505];
LL solo(int n)
{
    int ll,rr;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            scanf("%I64d",&a[i][j]);
            if(a[i][j]==0)
            {
                ll=i;
                rr=j;
            }
        }
    }
    LL sum=0;
    LL ssum=0;
    int flag=0;
    int flagg=0;
     for(int i=1;i<=n;i++)
    {
        if(i==ll)
        {
        for(int j=1;j<=n;j++)
            ssum+=a[i][j];
        flagg=1;
        }
        if(flagg)
            break;
    }
     for(int i=1;i<=n;i++)
    {
      if(i!=ll)
        {
        for(int j=1;j<=n;j++)
            sum+=a[i][j];
           flag=1;
        }
        if(flag)
            break;
    }
    LL ja=sum-ssum;
    if(ja<1)
        return -1;
        a[ll][rr]=ja;
        for(int i=1;i<=n;i++)
        {
            ssum=0;
            for(int j=1;j<=n;j++)
            {
                ssum+=a[i][j];
            }
            if(ssum!=sum)
                return -1;
        }
        for(int j=1;j<=n;j++)
        {
            ssum=0;
            for(int i=1;i<=n;i++)
                ssum+=a[i][j];
            if(ssum!=sum)
                return -1;
        }
        LL q,w;
        q=w=0;
        for(int i=1;i<=n;i++)
        {
            q+=a[i][i];
            w+=a[i][n-i+1];
        }

        if(q!=sum||w!=sum)
            return -1;
            return ja;
}
int main()
{
    int n,ll,rr;
    scanf("%d",&n);
    if(n==1)
    {
        printf("1\n");
        return 0;
    }
    printf("%I64d\n",solo(n));
}



版权声明:加油 加油 加油^-^ 举报

相关文章推荐

Codeforces Round #369 (Div. 2)

这比赛比较坑啊,看了一下A题过了7000+人,B题直接只剩2000+人。这套题的B题非常坑,很多陷阱。 A: 水题 B: 这题就是一个幻方,但是非常坑,有这么几个坑点:1.如果n==1,随便输出一个数...

Codeforces Round #369 (Div. 2) -- C. Coloring Trees (三维DP)

大体题意: 给你n 个树,你要给这些树染色,  标号是0 表示这棵树还没有染色,标号不是0 表示这棵树已经染色 不需要再染,这片树的美丽程度是  连续相同颜色的数目! 告诉你指定美丽程度K,和  最多...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量+组合计数

[Codeforces Round #369 (Div. 2)D. Directed Roads]Tarjan强连通分量题目链接:[Codeforces Round #369 (Div. 2)D. D...

Codeforces Round #369 (Div. 2) 手速练习赛

一不小心打开cf发现有一场div2在20:00,感觉非常资瓷,作为一个unrated狗感觉是个很好的涨分机会,然后就去注册了。        打比赛前发现注册8000+,害怕。。。        比赛...

Codeforces Round #369 (Div. 2)

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes ...

[Codeforces Round #369 (Div. 2) C. Coloring Trees] DP

[Codeforces Round #369 (Div. 2) C. Coloring Trees] DP题目链接:[Codeforces Round #369 (Div. 2) C. Colorin...

codeforces Round #369 (Div. 2) C. Coloring Trees (三维DP)

 C. Coloring Trees time limit per test 2 seconds memory limit per test ...

Codeforces Round #369 (Div. 2) D. Directed Roads

题目链接题意:给你一个n个点,n条有向边的图,你可以使任意条边反向,但是每条边只能反向一次,请求出使图不存在环的所有方案数量仔细思考我们发现,对于一个点数为x的环,除去全部不反向和全部反向两种情况,其...
  • naipp
  • naipp
  • 2016-08-30 23:28
  • 86

Codeforces Round #369 (Div. 2) A~D

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes input sta...

Codeforces Round #369 (Div. 2)

A. Bus to Udayland time limit per test 2 seconds memory limit per test 256 megab...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)