codeforces-141【B找规律】【C思维】

题目链接：点击打开链接

B. Hopscotch

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

So nearly half of the winter is over and Maria is dreaming about summer. She's fed up with skates and sleds, she was dreaming about Hopscotch all night long. It's a very popular children's game. The game field, the court, looks as is shown in the figure (all blocks are square and are numbered from bottom to top, blocks in the same row are numbered from left to right). Let us describe the hopscotch with numbers that denote the number of squares in the row, staring from the lowest one: 1-1-2-1-2-1-2-(1-2)..., where then the period is repeated (1-2).

The coordinate system is defined as shown in the figure. Side of all the squares are equal and have length a.

Maria is a very smart and clever girl, and she is concerned with quite serious issues: if she throws a stone into a point with coordinates(x, y), then will she hit some square? If the answer is positive, you are also required to determine the number of the square.

It is believed that the stone has fallen into the square if it is located strictly inside it. In other words a stone that has fallen on the square border is not considered a to hit a square.

Input

The only input line contains three integers: a, x, y, where a (1 ≤ a ≤ 100) is the side of the square, x and y( - 106 ≤ x ≤ 106, 0 ≤ y ≤ 106) are coordinates of the stone.

Output

Print the number of the square, inside which the stone fell. If the stone is on a border of some stone or outside the court, print "-1" without the quotes.

Examples

input

1 0 0

output

-1

input

3 1 1

output

1

input

3 0 10

output

5

input

3 0 7

output

-1

input

3 4 0

output

-1

#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int a,x,y;
int main()
{
	while(~scanf("%d%d%d",&a,&x,&y))
	{
		if(y%a==0)
		{
			puts("-1");
			continue;
		}
		int n=floor(y*1.0/a*1.0);
		if(n==0)
		{
			if(fabs(x*1.0)<a*0.5)
				puts("1");
			else
				puts("-1");
		}
		else if(n&1)
		{
			if(fabs(x*1.0)<a*0.5)
				printf("%d\n",3*n+1>>1);
			else
				puts("-1");
		}
		else
		{
			if(x>a*(-1)&&x<0)
				printf("%d\n",3*n/2); 
			else if(x<a&&x>0)
				printf("%d\n",3*n/2+1);
			else
				puts("-1");
		}
	}
	return 0;
}

题目链接： 点击打开链接

C. Queue

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the Main Berland Bank n people stand in a queue at the cashier, everyone knows his/her height hi, and the heights of the other people in the queue. Each of them keeps in mind number ai — how many people who are taller than him/her and stand in queue in front of him.

After a while the cashier has a lunch break and the people in the queue seat on the chairs in the waiting room in a random order.

When the lunch break was over, it turned out that nobody can remember the exact order of the people in the queue, but everyone remembers his number ai.

Your task is to restore the order in which the people stood in the queue if it is possible. There may be several acceptable orders, but you need to find any of them. Also, you need to print a possible set of numbers hi — the heights of people in the queue, so that the numbersai are correct.

Input

The first input line contains integer n — the number of people in the queue (1 ≤ n ≤ 3000). Then n lines contain descriptions of the people as "namei ai" (one description on one line), where namei is a non-empty string consisting of lowercase Latin letters whose length does not exceed 10 characters (the i-th person's name), ai is an integer (0 ≤ ai ≤ n - 1), that represents the number of people who are higher and stand in the queue in front of person i. It is guaranteed that all names are different.

Output

If there's no acceptable order of the people in the queue, print the single line containing "-1" without the quotes. Otherwise, print in nlines the people as "namei hi", where hi is the integer from 1 to 109 (inclusive), the possible height of a man whose name is namei. Print the people in the order in which they stand in the queue, starting from the head of the queue and moving to its tail. Numbers hi are not necessarily unique.

Examples

input

4
a 0
b 2
c 0
d 0

output

a 150
c 170
d 180
b 160

input

4
vasya 0
petya 1
manya 3
dunay 3

output

-1

大意：

一共有N个人，给你每个人前边比这个人高的数量，让你找一个合法的安排，如果找不到输出-1.

思路：（为了方便描述，我们将h【i】=x设定为第i个人前边有x个人比他高）


1、首先我们按照h【i】从小到大排序，如果有h【i】>=i的情况发现，那么一定说明是无解的。

2、如果有解我们继续分析：

①对于第i个人来讲，其前边比他高的人数有h【i】个，那么前边比他矮的人数有i-1-h【i】个，那么我们可以将第i个人的高度设定为i-h【i】，保证前边一定有i-h【i】-1个比他矮的人。

②那么我们按照排好序的顺序设定第i个人的高度为i-h【i】，但是直接这样设定，会影响前边人的高度，那么对应将当前这个人前边的所有大于等于当前人高度的人的高度都加一即可。

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n;
int ans[3010];
struct node
{
	char name[20];
	int num;
}peo[3010];
bool cmp(node x,node y)
{
	return x.num<y.num;
}
int main()
{
	while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%s%d",peo[i].name,&peo[i].num);
		}
		sort(peo+1,peo+n+1,cmp);
		bool flag=0;
		for(int i=1;i<=n;i++)
		{
			if(peo[i].num>=i)
			{
				flag=1;
				break;
			}
			ans[i]=i-peo[i].num;
			for(int j=1;j<i;j++)
			{
				if(ans[j]>=ans[i])
					ans[j]++;
			}
		}
		if(flag)
		{
			puts("-1");
			continue;
		}
		for(int i=1;i<=n;i++)
		{
			printf("%s %d\n",peo[i].name,ans[i]);
		}
	}
	return 0;
}