Codeforces Round #134 (Div. 2)

A. Mountain Scenery

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Bolek has found a picture with n mountain peaks painted on it. The n painted peaks are represented by a non-closed polyline, consisting of 2n segments. The segments go through 2n + 1 points with coordinates (1, y₁), (2, y₂), ..., (2n + 1, y_2n + 1), with the i-th segment connecting the point (i, y_i) and the point (i + 1, y_i + 1). For any even i (2 ≤ i ≤ 2n) the following condition holds: y_i - 1 < y_i and y_i > y_i + 1.

We shall call a vertex of a polyline with an even x coordinate a mountain peak.

The figure to the left shows the initial picture, the figure to the right shows what the picture looks like after Bolek's actions. The affected peaks are marked red, k = 2.

 

Bolek fancied a little mischief. He chose exactly k mountain peaks, rubbed out the segments that went through those peaks and increased each peak's height by one (that is, he increased the y coordinate of the corresponding points). Then he painted the missing segments to get a new picture of mountain peaks. Let us denote the points through which the new polyline passes on Bolek's new picture as (1, r₁), (2, r₂), ..., (2n + 1, r_2n + 1).

Given Bolek's final picture, restore the initial one.

Input

The first line contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 100). The next line contains 2n + 1 space-separated integers r₁, r₂, ..., r_2n + 1 (0 ≤ r_i ≤ 100) — the y coordinates of the polyline vertices on Bolek's picture.

It is guaranteed that we can obtain the given picture after performing the described actions on some picture of mountain peaks.

Output

Print 2n + 1 integers y₁, y₂, ..., y_2n + 1 — the y coordinates of the vertices of the polyline on the initial picture. If there are multiple answers, output any one of them.

Sample test(s)

Input

3 2 0 5 3 5 1 5 2

Output

0 5 3 4 1 4 2 

Input

1 1 0 2 0

Output

0 1 0 

这题马虎了一下 边输边判的 忘记a[i+1]还没输进去。。

#include <iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int a[301];
int main()
{
    int i,j,k,n;
    scanf("%d %d",&n,&k);
    for(i = 1; i <= 2*n+1 ; i++)
    {
        scanf("%d", &a[i]);
    }
    for(i = 1; i <= 2*n+1 ; i++)
    {
        if(i%2==0&&k&&((a[i]-1)>a[i-1]&&(a[i]-1)>a[i+1]))
        {
            a[i]--;
            k--;
        }
    }
    for(i = 1; i <= 2*n ;i++)
    printf("%d ",a[i]);
    printf("%d\n",a[2*n+1]);
    return 0;
}

B. Airport

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Lolek and Bolek are about to travel abroad by plane. The local airport has a special "Choose Your Plane" offer. The offer's conditions are as follows:

• it is up to a passenger to choose a plane to fly on;
• if the chosen plane has x (x > 0) empty seats at the given moment, then the ticket for such a plane costs x zlotys (units of Polish currency).

 

The only ticket office of the airport already has a queue of n passengers in front of it. Lolek and Bolek have not stood in the queue yet, but they are already wondering what is the maximum and the minimum number of zlotys the airport administration can earn if all n passengers buy tickets according to the conditions of this offer?

The passengers buy tickets in turn, the first person in the queue goes first, then goes the second one, and so on up to n-th person.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of passengers in the queue and the number of planes in the airport, correspondingly. The next line contains m integers a₁, a₂, ..., a_m (1 ≤ a_i ≤ 1000) — a_i stands for the number of empty seats in the i-th plane before the ticket office starts selling tickets.

The numbers in the lines are separated by a space. It is guaranteed that there are at least n empty seats in total.

Output

Print two integers — the maximum and the minimum number of zlotys that the airport administration can earn, correspondingly.

Sample test(s)

Input

4 3 2 1 1

Output

5 5

Input

4 3 2 2 2

Output

7 6

Note

In the first test sample the number of passengers is equal to the number of empty seats, so regardless of the way the planes are chosen, the administration will earn the same sum.

In the second sample the sum is maximized if the 1-st person in the queue buys a ticket to the 1-st plane, the 2-nd person — to the 2-nd plane, the 3-rd person — to the 3-rd plane, the 4-th person — to the 1-st plane. The sum is minimized if the 1-st person in the queue buys a ticket to the 1-st plane, the 2-nd person — to the 1-st plane, the 3-rd person — to the 2-nd plane, the 4-th person — to the 2-nd plane.

#include <iostream>
#include<cstdio>
#include<string.h>
using namespace std;
int main()
{
    int i,j,k,n,m,x[1001],y[1001],min = 0,max = 0,a,b,a1,b1;
    scanf("%d%d",&n,&m);
    for(i = 1; i <= m ; i++)
    {
        scanf("%d",&x[i]);
        y[i] = x[i];
    }
    for(i = 1; i <= n ;i++)
    {
        a = 0;
        for(j = 1 ; j <= m ;j++)
        if(x[j]>a)
        {
            a = x[j];
            a1 = j;
        }
        x[a1]--;
        max+=a;
    }
    for(i = 1; i <= n ;i++)
    {
        a = 2000;
        for(j = 1; j <= m ; j++)
        if(y[j]<a&&y[j]>0)
        {
            a1 = j;
            a = y[j];
        }
        y[a1]--;
        if(a!=2000)
        min+=a;
    }
    printf("%d %d\n",max,min);
    return 0;
}

C. Ice Skating

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves. He now wants to heap up some additional snow drifts, so that he can get from any snow drift to any other one. He asked you to find the minimal number of snow drifts that need to be created.

We assume that Bajtek can only heap up snow drifts at integer coordinates.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 100) — the number of snow drifts. Each of the following n lines contains two integers x_i and y_i (1 ≤ x_i, y_i ≤ 1000) — the coordinates of the i-th snow drift.

Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift's locations are distinct.

Output

Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.

Sample test(s)

Input

2 2 1 1 2

Output

1

Input

2 2 1 4 1

Output

0

并查集

#include <iostream>
#include<cstdio>
#include<string.h>
using namespace std;
struct node
{
    int x,y;
}q[110];
int father[110];
int find(int x)
{
    if(x!=father[x])
    father[x] = find(father[x]);
    return father[x];
}
int main()
{
    int n,i,j,k,num = 0;
    scanf("%d", &n);
    for(i = 1; i <= n ;i++)
    {
        scanf("%d%d",&q[i].x,&q[i].y);
    }
    for(i = 1; i <= n ;i++)
    father[i] = i;
    for(i = 1; i < n ; i++)
    {
        for(j = i+1; j <= n ;j++)
        {
            if(q[j].x==q[i].x||q[j].y==q[i].y)
            {
                int px = find(i);
                int py = find(j);
                if(px!=py);
                father[px] = py;
            }
        }
    }
    for(i = 1; i <= n ; i++)
    if(father[i] == i)
    num++;
    printf("%d\n",num-1);
    return 0;
}