Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) A B C D 水 模拟 并查集 优先队列

A. Broken Clock

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a broken clock. You know, that it is supposed to show time in 12- or 24-hours HH:MM format. In 12-hours format hours change from 1 to 12, while in 24-hours it changes from 0 to 23. In both formats minutes change from 0 to 59.

You are given a time in format HH:MM that is currently displayed on the broken clock. Your goal is to change minimum number of digits in order to make clocks display the correct time in the given format.

For example, if 00:99 is displayed, it is enough to replace the second 9 with 3 in order to get 00:39 that is a correct time in 24-hours format. However, to make 00:99 correct in 12-hours format, one has to change at least two digits. Additionally to the first change one can replace the second 0 with 1 and obtain 01:39.

Input

The first line of the input contains one integer 12 or 24, that denote 12-hours or 24-hours format respectively.

The second line contains the time in format HH:MM, that is currently displayed on the clock. First two characters stand for the hours, while next two show the minutes.

Output

The only line of the output should contain the time in format HH:MM that is a correct time in the given format. It should differ from the original in as few positions as possible. If there are many optimal solutions you can print any of them.

Examples

Input

24
17:30

Output

17:30

Input

12
17:30

Output

07:30

Input

24
99:99

Output

09:09
题意：12/24计时方法下 对于非法的时间 更改最少的位数 使得合法并输出
题解：水
注意数据
12
30:00

 /******************************
 code by drizzle
 blog: www.cnblogs.com/hsd-/
 ^ ^    ^ ^
  O      O
 ******************************/
 #include<bits/stdc++.h>
 #include<map>
 #include<set>
 #include<cmath>
 #include<queue>
 #include<bitset>
 #include<math.h>
 #include<vector>
 #include<string>
 #include<stdio.h>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #pragma comment(linker, "/STACK:102400000,102400000")
 using namespace std;
 #define  A first
 #define B second
 const int mod=;
 const int MOD1=;
 const int MOD2=;
 const double EPS=0.00000001;
 //typedef long long ll;
 typedef __int64 ll;
 const ll MOD=;
 const int INF=;
 const ll MAX=1ll<<;
 const double eps=1e-;
 const double inf=~0u>>;
 const double pi=acos(-1.0);
 typedef double db;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 int what;
 char a[];
 int main()
 {
     scanf("%d",&what);
     getchar();
     scanf("%s",a);
     if(what==)
     {
         int s,t;
         s=(a[]-'')*+(a[]-'');
         t=(a[]-'')*+(a[]-'');
         //cout<<s<<" "<<t<<endl;
         if(s>)
             a[]='';
         if(t>)
             a[]='';
     }
     else
     {
         int s,t;
         s=(a[]-'')*+a[]-'';
         t=(a[]-'')*+a[]-'';
         if(s==)
             a[]='';
         if(s>)
           {
                if(a[]=='')
                 a[]='';
                else
                 a[]='';
           }
         if(t>)
             a[]='';
     }
     cout<<a<<endl;
     return ;
 }

B. Verse Pattern

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a text consisting of n lines. Each line contains some space-separated words, consisting of lowercase English letters.

We define a syllable as a string that contains exactly one vowel and any arbitrary number (possibly none) of consonants. In English alphabet following letters are considered to be vowels: 'a', 'e', 'i', 'o', 'u' and 'y'.

Each word of the text that contains at least one vowel can be divided into syllables. Each character should be a part of exactly one syllable. For example, the word "mamma" can be divided into syllables as "ma" and "mma", "mam" and "ma", and "mamm" and "a". Words that consist of only consonants should be ignored.

The verse patterns for the given text is a sequence of n integers p₁, p₂, ..., p_n. Text matches the given verse pattern if for each i from 1 to n one can divide words of the i-th line in syllables in such a way that the total number of syllables is equal to p_i.

You are given the text and the verse pattern. Check, if the given text matches the given verse pattern.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of lines in the text.

The second line contains integers p₁, ..., p_n (0 ≤ p_i ≤ 100) — the verse pattern.

Next n lines contain the text itself. Text consists of lowercase English letters and spaces. It's guaranteed that all lines are non-empty, each line starts and ends with a letter and words are separated by exactly one space. The length of each line doesn't exceed 100 characters.

Output

If the given text matches the given verse pattern, then print "YES" (without quotes) in the only line of the output. Otherwise, print "NO" (without quotes).

Examples

Input

3
2 2 3
intel
code
ch allenge

Output

YES

Input

4
1 2 3 1
a
bcdefghi
jklmnopqrstu
vwxyz

Output

NO

Input

4
13 11 15 15
to be or not to be that is the question
whether tis nobler in the mind to suffer
the slings and arrows of outrageous fortune
or to take arms against a sea of troubles

Output

YES

Note

In the first sample, one can split words into syllables in the following way:

in-tel
co-de
ch al-len-ge

Since the word "ch" in the third line doesn't contain vowels, we can ignore it. As the result we get 2 syllabels in first two lines and 3 syllables in the third one.

题意:统计aeiouy的个数 一 一对应则输出YES 否则输出NO

题解:模拟

 /******************************
 code by drizzle
 blog: www.cnblogs.com/hsd-/
 ^ ^    ^ ^
  O      O
 ******************************/
 #include<bits/stdc++.h>
 #include<map>
 #include<set>
 #include<cmath>
 #include<queue>
 #include<bitset>
 #include<math.h>
 #include<vector>
 #include<string>
 #include<stdio.h>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #pragma comment(linker, "/STACK:102400000,102400000")
 using namespace std;
 #define  A first
 #define B second
 const int mod=;
 const int MOD1=;
 const int MOD2=;
 const double EPS=0.00000001;
 //typedef long long ll;
 typedef __int64 ll;
 const ll MOD=;
 const int INF=;
 const ll MAX=1ll<<;
 const double eps=1e-;
 const double inf=~0u>>;
 const double pi=acos(-1.0);
 typedef double db;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 int n;
 int  a[];
 char b[][];
 map<char,int>mp;
 int main()
 {
     mp['a']=;
     mp['e']=;
     mp['i']=;
     mp['o']=;
     mp['u']=;
     mp['y']=;
     scanf("%d",&n);
     int flag=;
     memset(b,,sizeof(b));
     for(int i=;i<=n;i++)
         scanf("%d",&a[i]);
     getchar();
     for(int i=;i<=n;i++)
     {
         gets(b[i]);
         int ans=;
         int len=strlen(b[i]);
         for(int j=;j<len;j++)
         {
             if(mp[b[i][j]])
                 ans++;
         }
         if(ans!=a[i])
             flag=;
     }
     if(flag)
         cout<<"NO"<<endl;
     else
         cout<<"YES"<<endl;
     return ;
 }

C. Destroying Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array consisting of n non-negative integers a₁, a₂, ..., a_n.

You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from 1 to n defining the order elements of the array are destroyed.

After each element is destroyed you have to find out the segment of the array, such that it contains no destroyed elements and the sum of its elements is maximum possible. The sum of elements in the empty segment is considered to be 0.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the length of the array.

The second line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹).

The third line contains a permutation of integers from 1 to n — the order used to destroy elements.

Output

Print n lines. The i-th line should contain a single integer — the maximum possible sum of elements on the segment containing no destroyed elements, after first i operations are performed.

Examples

Input

4
1 3 2 5
3 4 1 2

Output

5
4
3
0

Input

5
1 2 3 4 5
4 2 3 5 1

Output

6
5
5
1
0

Input

8
5 5 4 4 6 6 5 5
5 2 8 7 1 3 4 6

Output

18
16
11
8
8
6
6
0

Note

Consider the first sample:

1. Third element is destroyed. Array is now 1 3  *  5. Segment with maximum sum 5 consists of one integer 5.
2. Fourth element is destroyed. Array is now 1 3  *   * . Segment with maximum sum 4 consists of two integers 1 3.
3. First element is destroyed. Array is now  *  3  *   * . Segment with maximum sum 3 consists of one integer 3.
4. Last element is destroyed. At this moment there are no valid nonempty segments left in this array, so the answer is equal to 0.

题意：给你n个数 并给出删除这n个数的次序 对于每次删除 输出连续区间(不包括删除的位置的数)的和的最大值

题解：逆向来思考 正向的删除 当作逆向的增加 每增加一个数 判断是否与已知的集合相邻 或者作为新的集合 取max输出 并查集处理

 /******************************
 code by drizzle
 blog: www.cnblogs.com/hsd-/
 ^ ^    ^ ^
  O      O
 ******************************/
 #include<bits/stdc++.h>
 #include<map>
 #include<set>
 #include<cmath>
 #include<queue>
 #include<bitset>
 #include<math.h>
 #include<vector>
 #include<string>
 #include<stdio.h>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #pragma comment(linker, "/STACK:102400000,102400000")
 using namespace std;
 #define  A first
 #define B second
 const int mod=;
 const int MOD1=;
 const int MOD2=;
 const double EPS=0.00000001;
 //typedef long long ll;
 typedef __int64 ll;
 const ll MOD=;
 const int INF=;
 const ll MAX=1ll<<;
 const double eps=1e-;
 const double inf=~0u>>;
 const double pi=acos(-1.0);
 typedef double db;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 int n;
 ll a[];
 ll s[];
 int used[];
 int pos[];
 int fa[];
 ll re[];
 int find(int root)
 {
     if(fa[root]!=root)
         fa[root]=find(fa[root]);
     return fa[root];
 }
 void uni(int a,int b)
 {
     int aa=find(a);
     int bb=find(b);
     if(aa!=bb)
     {
         fa[aa]=bb;
         s[bb]+=s[aa];
     }
 }
 int main()
 {
     scanf("%d",&n);
     for(int i=; i<=n; i++)
     {
         scanf("%I64d",&a[i]);
         fa[i]=i;
     }
     for(int i=; i<=n; i++)
         scanf("%d",&pos[i]);
     ll ans=;
     for(int i=n; i>=; i--)
     {
         s[pos[i]]=a[pos[i]];
         used[pos[i]]=;
         if(pos[i]<n&&used[pos[i]+])
             uni(pos[i],pos[i]+);
         if(pos[i]>&&used[pos[i]-])
             uni(pos[i],pos[i]-);
         re[i]=ans;
         ans=max(ans,s[find(pos[i])]);
     }
     for(int i=; i<=n; i++)
         printf("%I64d\n",re[i]);
     return ;
 }

D. Generating Sets

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a set Y of n distinct positive integers y₁, y₂, ..., y_n.

Set X of n distinct positive integers x₁, x₂, ..., x_n is said to generate set Y if one can transform X to Y by applying some number of the following two operation to integers in X:

1. Take any integer x_i and multiply it by two, i.e. replace x_i with 2·x_i.
2. Take any integer x_i, multiply it by two and add one, i.e. replace x_i with 2·x_i + 1.

Note that integers in X are not required to be distinct after each operation.

Two sets of distinct integers X and Y are equal if they are equal as sets. In other words, if we write elements of the sets in the array in the increasing order, these arrays would be equal.

Note, that any set of integers (or its permutation) generates itself.

You are given a set Y and have to find a set X that generates Y and the maximum element of X is mininum possible.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 50 000) — the number of elements in Y.

The second line contains n integers y₁, ..., y_n (1 ≤ y_i ≤ 10⁹), that are guaranteed to be distinct.

Output

Print n integers — set of distinct integers that generate Y and the maximum element of which is minimum possible. If there are several such sets, print any of them.

Examples

Input

5
1 2 3 4 5

Output

4 5 2 3 1 

Input

6
15 14 3 13 1 12

Output

12 13 14 7 3 1 

Input

6
9 7 13 17 5 11

Output

4 5 2 6 3 1 

题意：给你集合y 要求集合x  x,y中的元素的都是不同的  集合x可以通过集合内的元素xi不断更新为2*xi或2*xi+1 同一个x只能变为y中的一个数 从而获得集合y
输出满足条件的集合x 要求x的最大值尽量小
题解：优先队列处理

 /******************************
 code by drizzle
 blog: www.cnblogs.com/hsd-/
 ^ ^    ^ ^
  O      O
 ******************************/
 #include<bits/stdc++.h>
 #include<map>
 #include<set>
 #include<cmath>
 #include<queue>
 #include<bitset>
 #include<math.h>
 #include<vector>
 #include<string>
 #include<stdio.h>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #pragma comment(linker, "/STACK:102400000,102400000")
 using namespace std;
 #define  A first
 #define B second
 const int mod=;
 const int MOD1=;
 const int MOD2=;
 const double EPS=0.00000001;
 //typedef long long ll;
 typedef __int64 ll;
 const ll MOD=;
 const int INF=;
 const ll MAX=1ll<<;
 const double eps=1e-;
 const double inf=~0u>>;
 const double pi=acos(-1.0);
 typedef double db;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 int n;
 ll a[];
 map<ll,int> mp;
 ll ans[];
 ll exm;
 struct node
 {
     ll we;
     friend bool  operator < (struct node aa, struct node bb)
     {
         return aa.we < bb.we;
     }
 } now;
 priority_queue<node> pq;
 int main()
 {
     scanf("%d",&n);
     for(int i=; i<=n; i++)
     {
         scanf("%I64d",&a[i]);
         mp[a[i]]=;
         now.we=a[i];
         pq.push(now);
     }
     int jishu=;
     while(!pq.empty())
     {
         now=pq.top();
         pq.pop();
         ll num=now.we;
         while(num)
         {
             if(mp[num]==)
                 break;
             num=num>>;
         }
         if(num&&mp[num]==)
         {
             node gg;
             gg.we=num;
             pq.push(gg);
             mp[now.we]=;
             mp[num]=;
         }
         else
             ans[jishu++]=now.we;
     }
     for(int i=; i<n; i++)
         printf("%I64d ",ans[i]);
     printf("\n");
     return ;
 }