A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: "fced", "xyz", "r" and "dabcef". The following string are not diverse: "az", "aa", "bad" and "babc". Note that the letters 'a' and 'z' are not adjacent.

Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps. And all letters in the string should be distinct (duplicates are not allowed).

You are given a sequence of strings. For each string, if it is diverse, print "Yes". Otherwise, print "No".

Input

The first line contains integer

Output

Example

input

Copy

8
fced
xyz
r
dabcef
az
aa
bad
babc

output

Copy

Yes
Yes
Yes
Yes
No
No
No
No

代码：

#include <bits/stdc++.h>
using namespace std;

int N;
map<char, int> mp;

int main() {
    scanf("%d", &N);
    getchar();
    for(int i = 0; i < N; i ++) {
        mp.clear();
        string s;
        cin >> s;
        bool flag = true;
        int len = s.length();
        int minn = 89;
        for(int j = 0; j < len; j ++) {
            mp[s[j]] ++;
            minn = min(minn, s[j] - 'a');
            if(mp[s[j]] > 1) flag = false;
        }
        //printf("!!!%d\n", minn);
        for(int j = minn; j < minn + len; j ++) {
            if(mp[j + 'a'] == 0) {
                flag = false;
                break;
            }
        }
        if(flag) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}

View Code

B. Parity Alternated Deletions

Polycarp has an array

He wants to play a game with this array. The game consists of several moves. On the first move he chooses any element and deletes it (after the first move the array contains

Formally:

If it is the first move, he chooses any element and deletes it;
If it is the second or any next move:
- if the last deleted element was odd, Polycarp chooses any even element and deletes it;
- if the last deleted element was even, Polycarp chooses any odd element and deletes it.
If after some move Polycarp cannot make a move, the game ends.

Polycarp's goal is to minimize the sum of non-deleted elements of the array after end of the game. If Polycarp can delete the whole array, then the sum of non-deleted elements is zero.

Help Polycarp find this value.

Input

The first line of the input contains one integer

The second line of the input contains

Output

Print one integer — the minimum possible sum of non-deleted elements of the array after end of the game.

Examples

input

Copy

5
1 5 7 8 2

output

Copy

input

Copy

6
5 1 2 4 6 3

output

Copy

input

Copy

2
1000000 1000000

output

Copy

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 10;
int N;
int num[maxn];
vector<int> odd, even;

int main() {
    scanf("%d", &N);
    for(int i = 0; i < N; i ++) {
        scanf("%d", &num[i]);
        if(num[i] % 2) odd.push_back(num[i]);
        else even.push_back(num[i]);
    }
    int ans = 0;
    sort(odd.rbegin(), odd.rend());
    sort(even.rbegin(), even.rend());
    int osz = odd.size(), esz = even.size();
    if(osz > esz + 1) {
        for(int i = esz + 1; i < osz; i ++)
            ans += odd[i];
    }
    else if(osz == esz + 1) ans = 0;
    else {
        for(int i = osz + 1; i < esz; i ++)
            ans += even[i];
    }
    printf("%d\n", ans);
    return 0;
}

View Code

C.Two Shuffled Sequences

Two integer sequences existed initially — one of them was strictly increasing, and the other one — strictly decreasing.

Strictly increasing sequence is a sequence of integers

They were merged into one sequence

This shuffled sequence

Your task is to find any two suitable initial sequences. One of them should be strictly increasing and the other one — strictly decreasing. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

If there is a contradiction in the input and it is impossible to split the given sequence

Input

The first line of the input contains one integer

The second line of the input contains

Output

If there is a contradiction in the input and it is impossible to split the given sequence

Otherwise print "YES" in the first line and any two suitable sequences. Note that the empty sequence and the sequence consisting of one element can be considered as increasing or decreasing.

In the second line print

In the third line print

In the fourth line print

In the fifth line print

Examples

input

Copy

7
7 2 7 3 3 1 4

output

Copy

input

Copy

5
4 3 1 5 3

output

Copy

input

Copy

5
1 1 2 1 2

output

Copy

NO

input

Copy

5
0 1 2 3 4

output

Copy

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 10;
int N;
int a[maxn];
int vis[maxn];

int main() {
    scanf("%d", &N);
    bool flag = true;
    for(int i = 0; i < N; i ++) {
        scanf("%d", &a[i]);
        vis[a[i]] ++;
        if(vis[a[i]] > 2) flag = false;
    }
    if(!flag) {
        printf("NO\n");
        return 0;
    }
    sort(a, a + N);
    vector<int> up, down;
    memset(vis, 0, sizeof(vis));
    for(int i = 0; i < N; i ++) {
        if(!vis[a[i]]) {
            up.push_back(a[i]);
            vis[a[i]] = 1;
        } else down.push_back(a[i]);
    }
    printf("YES\n");
    printf("%d\n", down.size());
    if(down.size() == 0) printf("\n");
    else {
        sort(down.begin(), down.end());
        for(int i = 0; i < down.size(); i ++)
            printf("%d%s", down[i], i != down.size() - 1 ? " " : "\n");
    }
    printf("%d\n", up.size());
    if(up.size() == 0) printf("\n");
    else {
        sort(up.rbegin(), up.rend());
        for(int i = 0; i < up.size(); i ++)
            printf("%d%s", up[i], i != up.size() - 1 ? " " : "\n");
    }
    return 0;
}

View Code

D. Equalize Them All

You are given an array

Choose a pair of indices
Choose a pair of indices

The value

Your task is to find the minimum number of operations required to obtain the array of equal elements and print the order of operations to do it.

It is guaranteed that you always can obtain the array of equal elements using such operations.

Note that after each operation each element of the current array should not exceed

Input

The first line of the input contains one integer

The second line of the input contains

Output

In the first line print one integer

In the next

Note that after each operation each element of the current array should not exceed

If there are many possible answers, you can print any.

Examples

input

Copy

5
2 4 6 6 6

output

Copy

2
1 2 3 
1 1 2

input

Copy

3
2 8 10

output

Copy

2
2 2 1 
2 3 2

input

Copy

4
1 1 1 1

output

Copy

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 10;
int N;
int a[maxn], vis[maxn];
int st, en, maxx, cnt = 0;

int main() {
    scanf("%d", &N);
    for(int i = 1; i <= N; i ++) {
        scanf("%d", &a[i]);
        vis[a[i]] ++;
        if(vis[a[i]] > cnt) {
            cnt = vis[a[i]];
            maxx = a[i];
        }
    }

    for(int i = 0; i < N; i ++) {
        if(a[i] == maxx) {
            st = i;
            break;
        }
    }


    printf("%d\n", N - cnt);
    if(N - cnt == 0) return 0;
    for(int i = st; i >= 1; i --) {
        if(a[i] == maxx) continue;
        else if(a[i] > maxx)
            printf("2 %d %d\n", i, i + 1);
        else printf("1 %d %d\n", i, i + 1);
    }
    for(int i = st; i <= N; i ++) {
        if(a[i] == maxx) continue;
        else if(a[i] < maxx)
            printf("1 %d %d\n", i, i - 1);
        else printf("2 %d %d\n", i, i - 1);
    }

    return 0;
}

View Code

E. Median String

You are given two strings

Let's consider list of all strings consisting of exactly

Your task is to print the median (the middle element) of this list. For the example above this will be "bc".

It is guaranteed that there is an odd number of strings lexicographically not less than

Input

The first line of the input contains one integer

The second line of the input contains one string

The third line of the input contains one string

It is guaranteed that

It is guaranteed that there is an odd number of strings lexicographically not less than

Output

Print one string consisting exactly of

Examples

input

Copy

2
az
bf

output

Copy

bc

input

Copy

5
afogk
asdji

output

Copy

alvuw

input

Copy

6
nijfvj
tvqhwp

output

Copy

qoztvz

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 10;
int N;
string s, t;
int ans[maxn];

/*string add(string a, string b) {
    int len = a.length();
    int upup = 0;
    string sum = "";
    for(int i = len - 1; i >= 0; i --) {
        int na = a[i] - 'a';
        int nb = b[i] - 'a';
        int num = (na + nb) + upup;
        if(num > 25) {
            upup = 1;
            num -= 26;
        } else upup = 0;
        sum += num + 'a';
    }
    if(upup) sum = "a" + sum;
    return sum;
}*/

int main() {
    scanf("%d", &N);
    cin >> s >> t;
    for(int i = N - 1; i >= 0; i --) {
        int numa = s[i] - 'a';
        int numb = t[i] - 'a';
        ans[i] = numa + numb;
        if(ans[i] % 2) {
            ans[i + 1] += 13;
            ans[i] = (ans[i] - 1) / 2;
            ans[i] += ans[i + 1] / 26;
            ans[i + 1] %= 26;
        }
        else ans[i] = ans[i] / 2;
    }

    for(int i = 0; i < N; i ++)
        printf("%c", 'a' + ans[i]);
    printf("\n");

    return 0;
}

View Code

模拟 26 进制加法

F. Graph Without Long Directed Paths

You are given a connected undirected graph consisting of

You have to direct its edges in such a way that the obtained directed graph does not contain any paths of length two or greater (where the length of path is denoted as the number of traversed edges).

Input

The first line contains two integer numbers

The following

Output

If it is impossible to direct edges of the given graph in such a way that the obtained directed graph does not contain paths of length at least two, print "NO" in the first line.

Otherwise print "YES" in the first line, and then print any suitable orientation of edges: a binary string (the string consisting only of '0' and '1') of length

Example

input

Copy

output

Copy

YES
10100

Note

The picture corresponding to the first example: $\text{[math]}$

And one of possible answers: $\text{[math]}$

代码：

#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 10;
int N, M;
int col[maxn], st[maxn], en[maxn];
vector<int> v[maxn];
bool flag = true;

void dfs(int st, int fa, int color) {
    col[st] = color;
    if(v[st].size() == 0) return;
    for(int i = 0; i < v[st].size(); i ++) {
        if(v[st][i] == fa) continue;
        if(col[v[st][i]] == -1)
            dfs(v[st][i], st, 1 - color);
        else if(col[v[st][i]] == col[st])
            flag = false;
    }
}

int main() {
    scanf("%d%d", &N, &M);
    memset(col, -1, sizeof(col));
    for(int i = 0; i < M; i ++) {
        scanf("%d%d", &st[i], &en[i]);
        v[st[i]].push_back(en[i]);
        v[en[i]].push_back(st[i]);
    }
    flag = true;
    dfs(1, -1, 0);
    if(!flag) printf("NO\n");
    else {
        printf("YES\n");
        for(int i = 0; i < M; i ++) {
            if(col[st[i]])
                printf("0");
            else printf("1");
        }
    }

    return 0;
}

View Code

posted @ 2019-04-12 11:46 丧心病狂工科女阅读(183) 评论(0) 编辑收藏举报

刷新页面返回顶部

丧心病狂工科女

CodeForces Round #550 Div.3

公告