Codeforces Round #401 (Div. 2) A B C 水 贪心 dp

A. Shell Game

time limit per test

0.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles the shells by swapping some pairs and the player has to guess the current position of the ball.

Bomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).

Let's number shells from 0 to 2 from left to right. Thus the left shell is assigned number 0, the middle shell is 1 and the right shell is 2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactly nmovements were made by the operator and the ball was under shell x at the end. Now he wonders, what was the initial position of the ball?

Input

The first line of the input contains an integer n (1 ≤ n ≤ 2·109) — the number of movements made by the operator.

The second line contains a single integer x (0 ≤ x ≤ 2) — the index of the shell where the ball was found after n movements.

Output

Print one integer from 0 to 2 — the index of the shell where the ball was initially placed.

Examples

input

4
2

output

1

input

1
1

output

0

Note

In the first sample, the ball was initially placed beneath the middle shell and the operator completed four movements.

1. During the first move operator swapped the left shell and the middle shell. The ball is now under the left shell.
2. During the second move operator swapped the middle shell and the right one. The ball is still under the left shell.
3. During the third move operator swapped the left shell and the middle shell again. The ball is again in the middle.
4. Finally, the operators swapped the middle shell and the right shell. The ball is now beneath the right shell.

题意：三个位置上的东西 0 1 2   先0/1交换后1/2交换 告诉你交换n次之后的位置判断初始位置

题解：%6 水

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#define ll  __int64
#define mod 1000000007
#define dazhi 2147483647
using namespace  std;
int m[10][10];
int main()
{
    m[0][0]=0;
    m[1][1]=0;
    m[2][2]=0;
    m[2][3]=0;
    m[1][4]=0;
    m[0][5]=0;

    m[1][0]=1;
    m[0][1]=1;
    m[0][2]=1;
    m[1][3]=1;
    m[2][4]=1;
    m[2][5]=1;

    m[2][0]=2;
    m[2][1]=2;
    m[1][2]=2;
    m[0][3]=2;
    m[0][4]=2;
    m[1][5]=2;
    ll n;
    ll x;
    scanf("%I64d",&n);
    n=n%6;
    scanf("%I64d",&x);
    printf("%d
",m[x][n]);
    return 0;
}

B. Game of Credit Cards

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.

Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n = 3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1 and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick.

Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name 2, 3and 1 to give Sherlock two flicks.

Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of digits in the cards Sherlock and Moriarty are going to use.

The second line contains n digits — Sherlock's credit card number.

The third line contains n digits — Moriarty's credit card number.

Output

First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.

Examples

input

3
123
321

output

0
2

input

2
88
00

output

2
0

Note

First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

题意：两组n位数字a,b  对于相同的某一位i进行比较 a[i]<b[i]  则a的flicks值增加1  a[i]>b[i]  则b的flicks值增加1  

任意排列两组的n位数字 问max(a_flicks) min(b_flicks)

题解：两种不同的贪心思路 具体看代码。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#define ll  __int64
#define mod 1000000007
#define dazhi 2147483647
using namespace  std;
char a[1005];
char b[1005];
int mp[5][20];
int main()
{
    int n;
    memset(mp,0,sizeof(mp));
    scanf("%d",&n);
    getchar();
    scanf("%s",a);
    //cout<<a<<endl;
    scanf("%s",b);
    for(int i=0;i<n;i++)
        mp[1][a[i]-'0']++;
    for(int i=0;i<n;i++)
        mp[2][b[i]-'0']++;
    int exm1=0;
    int ans1=0;
    for(int i=0;i<=9;i++)
    {
        exm1+=mp[1][i];
        if(exm1>=mp[2][i])
        {
            exm1-=mp[2][i];
        }
        else
        {
            ans1+=(mp[2][i]-exm1);
            exm1=0;
        }
    }
    int exm2=mp[2][9];
    int ans2=0;
    for(int i=8;i>=0;i--)
    {
        if(exm2>=mp[1][i])
        {
            ans2+=mp[1][i];
            exm2=exm2-mp[1][i];
        }
        else
        {
            ans2+=exm2;
            exm2=0;
        }
        exm2+=mp[2][i];
    }
    printf("%d
%d
",ans1,ans2);

    return 0;
}

C. Alyona and Spreadsheet

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.

Now she has a table filled with integers. The table consists of n rows and m columns. By ai, j we will denote the integer located at the i-th row and the j-th column. We say that the table is sorted in non-decreasing order in the column j if ai, j ≤ ai + 1, j for all i from 1 to n - 1.

Teacher gave Alyona k tasks. For each of the tasks two integers l and r are given and Alyona has to answer the following question: if one keeps the rows from l to r inclusive and deletes all others, will the table be sorted in non-decreasing order in at least one column? Formally, does there exist such j that ai, j ≤ ai + 1, j for all i from l to r - 1 inclusive.

Alyona is too small to deal with this task and asks you to help!

Input

The first line of the input contains two positive integers n and m (1 ≤ n·m ≤ 100 000) — the number of rows and the number of columns in the table respectively. Note that your are given a constraint that bound the product of these two integers, i.e. the number of elements in the table.

Each of the following n lines contains m integers. The j-th integers in the i of these lines stands for ai, j (1 ≤ ai, j ≤ 109).

The next line of the input contains an integer k (1 ≤ k ≤ 100 000) — the number of task that teacher gave to Alyona.

The i-th of the next k lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n).

Output

Print "Yes" to the i-th line of the output if the table consisting of rows from li to ri inclusive is sorted in non-decreasing order in at least one column. Otherwise, print "No".

Example

input

5 4
1 2 3 5
3 1 3 2
4 5 2 3
5 5 3 2
4 4 3 4
6
1 1
2 5
4 5
3 5
1 3
1 5

output

Yes
No
Yes
Yes
Yes
No

Note

In the sample, the whole table is not sorted in any column. However, rows 1–3 are sorted in column 1, while rows 4–5 are sorted in column 3.

 题意：n*m的数字矩阵 k组查询[l,r] 问[l,r]行是否存在一列的值自上至下非递减

 题解：ve[i]表示以第i行为末行最多有多少行满足题目要求。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <map>
#define ll  __int64
#define mod 1000000007
#define dazhi 2147483647
using namespace  std;
int n,m;
int mp[100005];
int ve[100005];
int re[100005];
int  l,r;
int k;
int main()
{
    memset(re,0,sizeof(re));
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
            scanf("%d",&mp[i*m+j]);
    }
    for(int i=0;i<n*m;i++)
        ve[i]=1;
    for(int j=0;j<m;j++)
    {
        for(int i=1;i<n;i++)
        {
            if(mp[i*m+j]>=mp[(i-1)*m+j])
            {
                ve[i*m+j]+=ve[(i-1)*m+j];
            }
            re[i]=max(re[i],ve[i*m+j]);
        }
    }
    re[0]=1;
    scanf("%d",&k);
    for(int i=1;i<=k;i++)
    {
        scanf("%d %d",&l,&r);
        if(r-1-re[r-1]+1>l-1)
            printf("No
");
        else
            printf("Yes
");
    }
    return 0;
}