Codeforces Round #313 (Div. 2)

A. Currency System in Geraldion

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A magic island Geraldion, where Gerald lives, has its own currency system. It uses banknotes of several values. But the problem is, the system is not perfect and sometimes it happens that Geraldionians cannot express a certain sum of money with any set of banknotes. Of course, they can use any number of banknotes of each value. Such sum is called unfortunate. Gerald wondered: what is the minimumunfortunate sum?

Input

The first line contains number n (1 ≤ n ≤ 1000) — the number of values of the banknotes that used in Geraldion.

The second line contains n distinct space-separated numbers a1, a2, ..., an (1 ≤ ai ≤ 106) — the values of the banknotes.

Output

Print a single line — the minimum unfortunate sum. If there are no unfortunate sums, print  - 1.

Sample test(s)

input

5
1 2 3 4 5

output

-1

注意只有两种情况就好了。。

AC代码：

#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x7fffffff
using namespace std;

int a[1005];

int vis[10000005];

int main() {
	int n;
	scanf("%d", &n);
	int flag = 0;
	for(int i = 0; i < n; i ++) {
		scanf("%d", &a[i]);
		if(a[i] == 1) {
			flag = 1;
		}
	}
	if(flag == 1) {
		printf("-1\n");
	}
	else {
		printf("1\n");
	}
	return 0;
}

B. Gerald is into Art

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald bought two very rare paintings at the Sotheby's auction and he now wants to hang them on the wall. For that he bought a special board to attach it to the wall and place the paintings on the board. The board has shape of an a1 × b1 rectangle, the paintings have shape of a a2 × b2 and a3 × b3 rectangles.

Since the paintings are painted in the style of abstract art, it does not matter exactly how they will be rotated, but still, one side of both the board, and each of the paintings must be parallel to the floor. The paintings can touch each other and the edges of the board, but can not overlap or go beyond the edge of the board. Gerald asks whether it is possible to place the paintings on the board, or is the board he bought not large enough?

Input

The first line contains two space-separated numbers a1 and b1 — the sides of the board. Next two lines contain numbers a2, b2, a3 andb3 — the sides of the paintings. All numbers ai, bi in the input are integers and fit into the range from 1 to 1000.

Output

If the paintings can be placed on the wall, print "YES" (without the quotes), and if they cannot, print "NO" (without the quotes).

Sample test(s)

input

3 2
1 3
2 1

output

YES

input

5 5
3 3
3 3

output

NO

input

4 2
2 3
1 2

output

YES

Note

That's how we can place the pictures in the first test:

And that's how we can do it in the third one.

分几种情况讨论即可

AC代码：

#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x7fffffff
using namespace std;

int a1, b1, a2, b2, a3, b3;

int main() {
	scanf("%d %d %d %d %d %d", &a1, &b1, &a2, &b2, &a3, &b3);
	if((a1 * b1) >= (a2 * b2 + a3 * b3)) {
		int max1 = max(a1, b1);
		int min1 = min(a1, b1);
		
		int l = b2 + b3;
		int r = max(a2, a3);
		int ll = max(l, r);
		int rr = min(l, r);
		if(ll <= max1 && rr <= min1) {
			printf("YES\n");
			return 0;
		}
		
		l = b2 + a3;
		r = max(b3, a2);
		ll = max(l, r);
		rr = min(l, r);
		if(ll <= max1 && rr <= min1) {
			printf("YES\n");
			return 0;
		}
		
		l = a2 + b3;
		r = max(b2, a3);
		ll = max(l, r);
		rr = min(l, r);
		if(ll <= max1 && rr <= min1) {
			printf("YES\n");
			return 0;
		}
		
		l = a2 + a3;
		r = max(b2, b3);
		ll = max(l, r);
		rr = min(l, r);
		if(ll <= max1 && rr <= min1) {
			printf("YES\n");
			return 0;
		}
		
	}
	printf("NO\n");
	return 0;
}

C. Gerald's Hexagon

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each of them is equal to an integer number of centimeters. There the properties of the hexagon ended and Gerald decided to draw on it.

He painted a few lines, parallel to the sides of the hexagon. The lines split the hexagon into regular triangles with sides of 1 centimeter. Now Gerald wonders how many triangles he has got. But there were so many of them that Gerald lost the track of his counting. Help the boy count the triangles.

Input

The first and the single line of the input contains 6 space-separated integers a1, a2, a3, a4, a5 and a6 (1 ≤ ai ≤ 1000) — the lengths of the sides of the hexagons in centimeters in the clockwise order. It is guaranteed that the hexagon with the indicated properties and the exactly such sides exists.

Output

Print a single integer — the number of triangles with the sides of one 1 centimeter, into which the hexagon is split.

Sample test(s)

input

1 1 1 1 1 1

output

6

input

1 2 1 2 1 2

output

13

Note

This is what Gerald's hexagon looks like in the first sample:

And that's what it looks like in the second sample:

这个题目其实还是蛮好玩的，可以有许多做法，我想的是每个六边形可以看成以a1为顶，a2+a3为层数的六边形，然后逐层算出三角形的个数。。

直到后来，学弟说可以直接补充为完整的三角形再计算，，然后我就发现我的做法有多脑残。。

AC代码（逐层计算）：

#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x7fffffff
using namespace std;

int main() {
	int a1, a2, a3, a4, a5, a6;
	scanf("%d %d %d %d %d %d", &a1, &a2, &a3, &a4, &a5, &a6);
	int ans = 0;
	int len = a2 + a3;
	int shang = a1;
	int xia;
	for(int i = 1; i <= len; i ++) {
		if(i <= a6 && i <= a2) {
			xia = shang + 1;
			ans += shang * 2 + 1;
		}
		else if(i > a6 && i <= a2) {
			xia = shang;
			ans += xia * 2;
		}
		else if(i <= a6 && i > a2) {
			xia = shang;
			ans += xia * 2;
		}
		else if(i > a6 && i > a2) {
			xia = shang - 1;
			ans += xia * 2 + 1;
		}
		shang = xia;
	}
	printf("%d\n", ans);
	return 0;
}

AC代码（补充整个六边形为三角形再减去补充的面积）：

#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x7fffffff
using namespace std;

int main() {
	int a1, a2, a3, a4, a5, a6;
	scanf("%d %d %d %d %d %d", &a1, &a2, &a3, &a4, &a5, &a6);
	printf("%d\n", (a1 + a2 + a3) * (a1 + a2 + a3) - a1 * a1 - a3 * a3 - a5 * a5);
	return 0;
}

D. Equivalent Strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings a and b of equal length are calledequivalent in one of the two cases:

1. They are equal.
2. If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
   1. a1 is equivalent to b1, and a2 is equivalent to b2
   2. a1 is equivalent to b2, and a2 is equivalent to b1

As a home task, the teacher gave two strings to his students and asked to determine if they are equivalent.

Gerald has already completed this home task. Now it's your turn!

Input

The first two lines of the input contain two strings given by the teacher. Each of them has the length from 1 to 200 000 and consists of lowercase English letters. The strings have the same length.

Output

Print "YES" (without the quotes), if these two strings are equivalent, and "NO" (without the quotes) otherwise.

Sample test(s)

input

aaba
abaa

output

YES

input

aabb
abab

output

NO

Note

In the first sample you should split the first string into strings "aa" and "ba", the second one — into strings "ab" and "aa". "aa" is equivalent to "aa"; "ab" is equivalent to "ba" as "ab" = "a" + "b", "ba" = "b" + "a".

In the second sample the first string can be splitted into strings "aa" and "bb", that are equivalent only to themselves. That's why string "aabb" is equivalent only to itself and to string "bbaa".

论脑残的最高境界，我直接用string的substr函数递归调用，结果赤裸裸的超时了，，。。

后来发现可以先排个序。。具体来说就是：对每个字符串，可以先对其前半和后半比较，将较小的放前面（此处为递归比较）；

AC代码：

#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define INF 0x7fffffff
using namespace std;

const int maxn = 200005;

char a[maxn], b[maxn];

int cmp(char a[], int l, int r, int n) {
	for(int i = 0; i < n; i ++) {
		if(a[l + i] != a[r + i]) {
			return a[l + i] - a[r + i];
		}
	}
	return 0;
}

void swap_fun(char a[], int l, int r, int n) {
	for(int i = 0; i < n; i ++) {
		swap(a[l + i], a[r + i]);
	}
}

void sort(char a[], int l, int r) {
	if((r - l + 1) & 1) return;
	int mid = (l + r) >> 1;
	sort(a, l, mid);
	sort(a, mid+1, r);
	
	if(cmp(a, l, mid + 1, mid - l + 1) > 0) {
		swap_fun(a, l, mid + 1, mid - l + 1);
	}
}

int main() {
	scanf("%s %s", a, b);
	int len = strlen(a);
	sort(a, 0, len - 1);
	sort(b, 0, len - 1);
	
	int flag = 1;
	for(int i = 0; i < len; i ++) {
		if(a[i] != b[i]) {
			flag = 0;
			break;
		}
	}
	
	puts(flag == 1 ? "YES" : "NO");
	
	return 0;
}