zoukankan      html  css  js  c++  java
  • Codeforces 946 C.String Transformation

    C. String Transformation
     
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given a string s consisting of |s| small english letters.

    In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter.

    Your target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible.

    Input

    The only one line of the input consisting of the string s consisting of |s| (1 ≤ |s| ≤ 105) small english letters.

    Output

    If you can get a string that can be obtained from the given string and will contain english alphabet as a subsequence, print it. Otherwise print «-1» (without quotes).

    Examples
    input
    Copy
    aacceeggiikkmmooqqssuuwwyy
    output
    abcdefghijklmnopqrstuvwxyz
    input
    Copy
    thereisnoanswer
    output
    -1

    代码:
     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 #include<cmath>
     5 #include<algorithm>
     6 #include<cstdlib>
     7 using namespace std;
     8 typedef long long ll;
     9 const int maxn=1e5+10;
    10 #define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    11 int main(){
    12     string s;
    13     ios;
    14     cin>>s;
    15     int len=s.length();
    16     int tmp=0;
    17     for(int i=0;i<len;i++){
    18         if(s[i]-'a'<=tmp){
    19             tmp++;s[i]='a'+tmp-1;
    20         }
    21         if(tmp==26)break;
    22     }
    23     if(tmp==26)cout<<s<<endl;
    24     else cout<<"-1"<<endl;
    25 }

    溜了,滚去写D的题解。

  • 相关阅读:
    创建型模式
    创建、修改、删除表总结
    分页式存储管理及地址转换(网易笔试题)
    二进制、十进制、十六进制相互转换
    转 String,StringBuffer与StringBuilder的区别??
    IDEA 修改某个Module名称
    IDEA Git 修改后的文件无法Commit
    git git push某一次的commit记录
    git merge 结果是 git merge Already up-to-date. 该怎么解决?
    火币网API文档——REST 行情、交易API简介
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9711411.html
Copyright © 2011-2022 走看看