Codeforces Round #238 (Div. 2) 总结



A. Gravity Flip

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.

There are n columns of toy cubes in the box arranged in a line. The i-th column contains a_i cubes. At first, the gravity in the box is pulling the cubes downwards. When Chris switches the gravity, it begins to pull all the cubes to the right side of the box. The figure shows the initial and final configurations of the cubes in the box: the cubes that have changed their position are highlighted with orange.

Given the initial configuration of the toy cubes in the box, find the amounts of cubes in each of the n columns after the gravity switch!

Input

The first line of input contains an integer n (1 ≤ n ≤ 100), the number of the columns in the box. The next line contains n space-separated integer numbers. The i-th number a_i (1 ≤ a_i ≤ 100) denotes the number of cubes in the i-th column.

Output

Output n integer numbers separated by spaces, where the i-th number is the amount of cubes in the i-th column after the gravity switch.

Sample test(s)

input

4
3 2 1 2

output

1 2 2 3 

input

3
2 3 8

output

2 3 8 

Note

The first example case is shown on the figure. The top cube of the first column falls to the top of the last column; the top cube of the second column falls to the top of the third column; the middle cube of the first column falls to the top of the second column.

In the second example case the gravity switch does not change the heights of the columns.

题意：排序

<span style="font-size:14px;">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e3+10;
int a[maxm];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);
        for(int i=0;i<n;i++)
        {
            printf("%d ",a[i]);
        }
        printf("\n");
    }
    return 0;
}</span>

B. Domino Effect

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Chris knows there's no fun in playing dominoes, he thinks it's too random and doesn't require skill. Instead, he decided to play withthe dominoes and make a "domino show".

Chris arranges n dominoes in a line, placing each piece vertically upright. In the beginning, he simultaneously pushes some of the dominoes either to the left or to the right. However, somewhere between every two dominoes pushed in the same direction there is at least one domino pushed in the opposite direction.

After each second, each domino that is falling to the left pushes the adjacent domino on the left. Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right. When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces. The figure shows one possible example of the process.

Given the initial directions Chris has pushed the dominoes, find the number of the dominoes left standing vertically at the end of the process!

Input

The first line contains a single integer n (1 ≤ n ≤ 3000), the number of the dominoes in the line. The next line contains a character strings of length n. The i-th character of the string s_i is equal to

• "L", if the i-th domino has been pushed to the left;
• "R", if the i-th domino has been pushed to the right;
• ".", if the i-th domino has not been pushed.

It is guaranteed that if s_i = s_j = "L" and i < j, then there exists such k that i < k < j and s_k = "R"; if s_i = s_j = "R" and i < j, then there exists such k that i < k < j and s_k = "L".

Output

Output a single integer, the number of the dominoes that remain vertical at the end of the process.

Sample test(s)

input

14
.L.R...LR..L..

output

4

input

5
R....

output

0

input

1
.

output

1

Note

The first example case is shown on the figure. The four pieces that remain standing vertically are highlighted with orange.

In the second example case, all pieces fall down since the first piece topples all the other pieces.

In the last example case, a single piece has not been pushed in either direction.

题意：题目的意思是有一列竖着的砖头，现在有些砖头向左倒，有些砖头向右倒，问最后能立着的还有几块砖头，这道题的难点在于砖头倒下时中间的砖头会立着，在遍历时需要找到每一对L和R之间的砖块数，如果里面包含3块，那么中间那块肯定是立着的。

<span style="font-size:14px;">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e4+10;
char s[maxm];
int main()
{
    int n;
    while(scanf("%d%s",&n,s)!=EOF)
    {
        int x=0,y=-1;
        int sum=0;
        for(int i=0; i<n; i++)
        {
            if(s[i]=='.')
                x++;
            else if(s[i]=='R')
            {
                if(y==-1)
                    sum+=x;
                x=y=0;
            }
            else if(s[i]=='L')
            {
                if(y==0)
                    sum+=(x%2);
                x=0,y=-1;
            }
        }
        if(y==-1)
            sum+=x;
        printf("%d\n",sum);
    }
    return 0;
}</span>

C. Unusual Product

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Chris is a huge fan of linear algebra. This time he has been given a homework about the unusual square of a square matrix.

The dot product of two integer number vectors x and y of size n is the sum of the products of the corresponding components of the vectors. The unusual square of an n × n square matrix A is defined as the sum of n dot products. The i-th of them is the dot product of the i-th row vector and the i-th column vector in the matrix A.

Fortunately for Chris, he has to work only in GF(2)! This means that all operations (addition, multiplication) are calculated modulo 2. In fact, the matrix A is binary: each element of A is either 0 or 1. For example, consider the following matrix A:

The unusual square of A is equal to (1·1 + 1·0 + 1·1) + (0·1 + 1·1 + 1·0) + (1·1 + 0·1 + 0·0) = 0 + 1 + 1 = 0.

However, there is much more to the homework. Chris has to process q queries; each query can be one of the following:

1. given a row index i, flip all the values in the i-th row in A;
2. given a column index i, flip all the values in the i-th column in A;
3. find the unusual square of A.

To flip a bit value w means to change it to 1 - w, i.e., 1 changes to 0 and 0 changes to 1.

Given the initial matrix A, output the answers for each query of the third type! Can you solve Chris's homework?

Input

The first line of input contains an integer n (1 ≤ n ≤ 1000), the number of rows and the number of columns in the matrix A. The next nlines describe the matrix: the i-th line contains n space-separated bits and describes the i-th row of A. The j-th number of the i-th linea_ij (0 ≤ a_ij ≤ 1) is the element on the intersection of the i-th row and the j-th column of A.

The next line of input contains an integer q (1 ≤ q ≤ 10⁶), the number of queries. Each of the next q lines describes a single query, which can be one of the following:

• 1 i — flip the values of the i-th row;
• 2 i — flip the values of the i-th column;
• 3 — output the unusual square of A.

Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Output

Let the number of the 3rd type queries in the input be m. Output a single string s of length m, where the i-th symbol of s is the value of the unusual square of A for the i-th query of the 3rd type as it appears in the input.

Sample test(s)

input

3
1 1 1
0 1 1
1 0 0
12
3
2 3
3
2 2
2 2
1 3
3
3
1 2
2 1
1 1
3

output

01001

题意：

给出一个n*n的矩阵，有q个操作，输入3时，输出A ，A等于第i行乘以第i列的对应元素的和（mod2），输入1 x，表示将第x行的元素翻转（即0变成1,1变成0），输入2 x,表示将第x列的元素翻转.

思路：

根据A的计算方式可知A的最终结果只由左对角线上的元素将决定，如果左对角线上的元素为1的个数有奇数个（可通过异或计算），则A=1，否则A=0。翻转的时候每翻转一行或一列，都会改变对角线的元素，故结果应异或上1.

<span style="font-size:14px;">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e6+10;
int t[maxm];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int sum=0;
        int a;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&a);
                if(i==j)
                    sum^=a;
            }
        }
        int q;
        scanf("%d",&q);
        int cnt=0;
        while(q--)
        {
            int x,y;
            scanf("%d",&x);
            if(x==3)
                t[cnt++]=sum;
            else
            {
                scanf("%d",&y);
                sum^=1;
            }
        }
        for(int i=0;i<cnt;i++)
            printf("%d",t[i]);
        printf("\n");
    }
    return 0;
}</span>

D. Toy Sum

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Chris is very keen on his toy blocks. His teacher, however, wants Chris to solve more problems, so he decided to play a trick on Chris.

There are exactly s blocks in Chris's set, each block has a unique number from 1 to s. Chris's teacher picks a subset of blocks X and keeps it to himself. He will give them back only if Chris can pick such a non-empty subset Y from the remaining blocks, that the equality holds:

"Are you kidding me?", asks Chris.

For example, consider a case where s = 8 and Chris's teacher took the blocks with numbers 1, 4 and 5. One way for Chris to choose a set is to pick the blocks with numbers 3 and 6, see figure. Then the required sums would be equal:(1 - 1) + (4 - 1) + (5 - 1) = (8 - 3) + (8 - 6) = 7.

However, now Chris has exactly s = 10⁶ blocks. Given the set X of blocks his teacher chooses, help Chris to find the required set Y!

Input

The first line of input contains a single integer n (1 ≤ n ≤ 5·10⁵), the number of blocks in the set X. The next line contains n distinct space-separated integers x₁, x₂, ..., x_n (1 ≤ x_i ≤ 10⁶), the numbers of the blocks in X.

Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Output

In the first line of output print a single integer m (1 ≤ m ≤ 10⁶ - n), the number of blocks in the set Y. In the next line output m distinct space-separated integers y₁, y₂, ..., y_m (1 ≤ y_i ≤ 10⁶), such that the required equality holds. The sets X and Y should not intersect, i.e.x_i ≠ y_j for all i, j (1 ≤ i ≤ n; 1 ≤ j ≤ m). It is guaranteed that at least one solution always exists. If there are multiple solutions, output any of them.

Sample test(s)

input

3
1 4 5

output

2
999993 1000000

input

1
1

output

1
1000000 

题意：已知集合S={1,2,3......1000000},s=1000000，从集合S中选择n个数，X={x1,x2,x3,...xn}，计算sum=x1-1+x2-1+....+xn-1;从剩下的元素Y={y1,y2,y3,...}中选择一些数，使得s-y1+s-y2+...=sum,输出yi的个数及yi。

思路：可以根据元素的对称性来找yi。因为x-1=s-y，则y=s-x+1，即对于每一个x，对应的可选择一个y=s-x+1，如果y不在X集合中，则直接输出y。如果y也在X集合中，由于(x-1)+(y-1)=x-1+s-x+1-1=s-1，此时只要在Y集合中选两个对称的数输出即可。因为（s-y1）+（s-y2) = 2s-(y1+y2) = 2s-(s+1) = s-1,两者的最终结果是相同的，故可以互相替代。所以可以找出符合条件的n个y元素。

<span style="font-size:14px;">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm=1e6+10;
int vis[maxm];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int a;
        memset(vis,0,sizeof(vis));
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a);
            vis[a]=1;
        }
        printf("%d\n",n);
        int cnt=0;
        int s=1e6;
        for(int i=1;i<=s;i++)
        {
            if(vis[i]&&!vis[s-i+1])
            {
                printf("%d ",s-i+1);
                cnt++;
            }
        }
        for(int i=1;i<=s&&cnt!=n;i++)
        {
            if(!vis[i]&&!vis[s-i+1])
            {
                printf("%d %d ",i,s-i+1);
                cnt+=2;
            }
        }
        printf("\n");
    }
    return 0;
}</span>