Codeforces Round #438 (Div. 1 + Div. 2 combined) ABCDF

A. Bark to Unlock

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new phone, Arkady's pet dog Mu-mu has to bark the password once. The phone represents a password as a string of two lowercase English letters.

Mu-mu's enemy Kashtanka wants to unlock Mu-mu's phone to steal some sensible information, but it can only bark n distinct words, each of which can be represented as a string of two lowercase English letters. Kashtanka wants to bark several words (not necessarily distinct) one after another to pronounce a string containing the password as a substring. Tell if it's possible to unlock the phone in this way, or not.

Input

The first line contains two lowercase English letters — the password on the phone.

The second line contains single integer n (1 ≤ n ≤ 100) — the number of words Kashtanka knows.

The next n lines contain two lowercase English letters each, representing the words Kashtanka knows. The words are guaranteed to be distinct.

Output

Print "YES" if Kashtanka can bark several words in a line forming a string containing the password, and "NO" otherwise.

You can print each letter in arbitrary case (upper or lower).

Examples

input

ya
4
ah
oy
to
ha

output

YES

input

hp
2
ht
tp

output

NO

input

ah
1
ha

output

YES

Note

In the first example the password is "ya", and Kashtanka can bark "oy" and then "ah", and then "ha" to form the string "oyahha" which contains the password. So, the answer is "YES".

In the second example Kashtanka can't produce a string containing password as a substring. Note that it can bark "ht" and then "tp" producing "http", but it doesn't contain the password "hp" as a substring.

In the third example the string "hahahaha" contains "ah" as a substring.

水。

if语句练习

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
char a[105][5],s[5];

int main() {
	int n,k,b,c,d;
	cin >> n;
	b=c=d=0;
	scanf("%s",s);
	scanf("%d",&n);
	for (int i=1;i<=n;i++) {
		scanf("%s",a[i]);
		if (a[i][1]==s[0]) b=1;
		if (a[i][0]==s[1]) c=1;
		if (a[i][1]==s[1]&&a[i][0]==s[0]) d=1;
		if (a[i][1]==s[0]&&a[i][0]==s[1]) d=1;
	}
	if (d) cout << "YES"; else if (b&&c) cout << "YES"; else cout << "NO";
	return 0;
}

B. Race Against Time

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Have you ever tried to explain to the coordinator, why it is eight hours to the contest and not a single problem has been prepared yet? Misha had. And this time he has a really strong excuse: he faced a space-time paradox! Space and time replaced each other.

The entire universe turned into an enormous clock face with three hands — hour, minute, and second. Time froze, and clocks now show the time h hours, m minutes, s seconds.

Last time Misha talked with the coordinator at t1 o'clock, so now he stands on the number t1 on the clock face. The contest should be ready by t2 o'clock. In the terms of paradox it means that Misha has to go to number t2 somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction.

Clock hands are very long, and Misha cannot get round them. He also cannot step over as it leads to the collapse of space-time. That is, if hour clock points 12 and Misha stands at 11 then he cannot move to 1 along the top arc. He has to follow all the way round the clock center (of course, if there are no other hands on his way).

Given the hands' positions, t1, and t2, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from t1 to t2 by the clock face.

Input

Five integers h, m, s, t1, t2 (1 ≤ h ≤ 12, 0 ≤ m, s ≤ 59, 1 ≤ t1, t2 ≤ 12, t1 ≠ t2).

Misha's position and the target time do not coincide with the position of any hand.

Output

Print "YES" (quotes for clarity), if Misha can prepare the contest on time, and "NO" otherwise.

You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").

Examples

input

12 30 45 3 11

output

NO

input

12 0 1 12 1

output

YES

input

3 47 0 4 9

output

YES

Note

The three examples are shown on the pictures below from left to right. The starting position of Misha is shown with green, the ending position is shown with pink. Note that the positions of the hands on the pictures are not exact, but are close to the exact and the answer is the same.

两个人站在钟表表盘的整数处，问在不跨越钟表时分秒针的前提之下，他们能否相遇。

对于走的慢的针，要考虑走的快的针对他的影响！

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
db a[3];

int main() {
	db h,m,s,c,b;
	cin >> h >> m >> s >> b >> c;
	h*=5;c*=5;b*=5;
	if (h==60) h=0;
	if (b==60) b=0;
	if (c==60) c=0;
	h+=s/720.0+m/12.0;
	m+=s/60.0;
	a[0]=h;a[1]=m;a[2]=s;
	sort(a,a+3); 
	if (a[0]<=b&&b<=a[1]&&a[0]<=c&&c<=a[1]) cout << "YES"; else
	if (a[1]<=b&&b<=a[2]&&a[1]<=c&&c<=a[2]) cout << "YES"; else
	if ((b>=a[2]||b<=a[0])&&((c>=a[2]||c<=a[0]))) cout << "YES"; else 
	cout << "NO";
	return 0;
}

C. Qualification Rounds

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they want to select any non-empty subset of it as a problemset.

k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.

Determine if Snark and Philip can make an interesting problemset!

Input

The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 4) — the number of problems and the number of experienced teams.

Each of the next n lines contains k integers, each equal to 0 or 1. The j-th number in the i-th line is 1 if j-th team knows i-th problem and 0 otherwise.

Output

Print "YES" (quotes for clarity), if it is possible to make an interesting problemset, and "NO" otherwise.

You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").

Examples

input

5 3
1 0 1
1 1 0
1 0 0
1 0 0
1 0 0

output

NO

input

3 2
1 0
1 1
0 1

output

YES

Note

In the first example you can't make any interesting problemset, because the first team knows all problems.

In the second example you can choose the first and the third problems.

有n个题目，k个队。给出每个队是否知道题目内容的01矩阵，问可不可以选择一些题，使得没有题目知道超过一半的题。

选择两个题的时候一定最优。

那么，最多4个队，最多16种状态，一个个枚举就好。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=100005,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
int a[maxn][5],b[5],c[20];

int main() {
	int n,k,i,j,sum=0;
	scanf("%d%d",&n,&k);
	mem0(b);mem0(c);
	for (i=1;i<=n;i++) {
		int x=0;
		for (j=1;j<=k;j++) {
			scanf("%d",&a[i][j]);
			if (a[i][j]) {
				b[j]++,sum++;
				x+=(1<<j-1);
			}
		}
		c[x]++;
	}
	if (k==1) {
		if (b[1]!=n) cout << "YES"; else cout << "NO";
	} else {
		if (c[0]!=0) {
			cout << "YES";return 0;
		}
		for (i=0;i<16;i++) {
			for (j=0;j<16;j++) {
				if (i==j) continue;
				if (((i&j)==0)&&c[i]&&c[j]) {
					cout << "YES";return 0;
				}
			}
		}
		cout << "NO";
	}
	return 0;
}

D. Huge Strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given n strings s1, s2, ..., sn consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings into a new one. On the i-th operation the concatenation saisbi is saved into a new string sn + i (the operations are numbered starting from 1). After each operation you need to find the maximum positive integer k such that all possible strings consisting of 0 and 1 of length k (there are 2k such strings) are substrings of the new string. If there is no such k, print 0.

Input

The first line contains single integer n (1 ≤ n ≤ 100) — the number of strings. The next n lines contain strings s1, s2, ..., sn (1 ≤ |si| ≤ 100), one per line. The total length of strings is not greater than 100.

The next line contains single integer m (1 ≤ m ≤ 100) — the number of operations. m lines follow, each of them contains two integers ai abd bi (1 ≤ ai, bi ≤ n + i - 1) — the number of strings that are concatenated to form sn + i.

Output

Print m lines, each should contain one integer — the answer to the question after the corresponding operation.

Example

input

5
01
10
101
11111
0
3
1 2
6 5
4 4

output

1
2
0

Note

On the first operation, a new string "0110" is created. For k = 1 the two possible binary strings of length kare "0" and "1", they are substrings of the new string. For k = 2 and greater there exist strings of length kthat do not appear in this string (for k = 2 such string is "00"). So the answer is 1.

On the second operation the string "01100" is created. Now all strings of length k = 2 are present.

On the third operation the string "1111111111" is created. There is no zero, so the answer is 0.

分治+哈希。

详情请戳 这里

F. Yet Another Minimization Problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array of n integers a1... an. The cost of a subsegment is the number of unordered pairs of distinct indices within the subsegment that contain equal elements. Split the given array into k non-intersecting non-empty subsegments so that the sum of their costs is minimum possible. Each element should be present in exactly one subsegment.

Input

The first line contains two integers n and k (2 ≤ n ≤ 105, 2 ≤ k ≤ min (n, 20))  — the length of the array and the number of segments you need to split the array into.

The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n) — the elements of the array.

Output

Print single integer: the minimum possible total cost of resulting subsegments.

Examples

input

7 3
1 1 3 3 3 2 1

output

1

input

10 2
1 2 1 2 1 2 1 2 1 2

output

8

input

13 3
1 2 2 2 1 2 1 1 1 2 2 1 1

output

9

Note

In the first example it's optimal to split the sequence into the following three subsegments: [1], [1, 3], [3, 3, 2, 1]. The costs are 0, 0 and 1, thus the answer is 1.

In the second example it's optimal to split the sequence in two equal halves. The cost for each half is 4.

In the third example it's optimal to split the sequence in the following way: [1, 2, 2, 2, 1], [2, 1, 1, 1, 2], [2, 1, 1]. The costs are 4, 4, 1.

单调性优化DP。

详情 戳这里