CODE FESTIVAL 2016 qual A

Submission #1746083

Source codeソースコード

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
using ll = long long;
//#define int ll
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
char alph[]={"abcdefghijklmnopqrstuvwxyz"};
signed main(){
    string s; cin>>s;
    int n=(int)s.length();
    int k; cin>>k;
    map<char,int>mp;
    rep(i,26)mp[alph[i]]=26-i;
    string ans;
    rep(i,n){
        if(mp[s[i]]<=k){
            ans.push_back('a');
            k-=mp[s[i]];
        }
        else
            ans.push_back(s[i]);
            
    }
    k%=26;
    ans[n-1]=alph[(abs(mp[ans[n-1]]-26)+k)%26];
    cout<<ans<<endl;
    return 0;
}

Submission

Task問題 C - 次のアルファベット / Next Letter
User nameユーザ名 yebityon
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1404 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt
All 0 / 400 0_00.txt,0_01.txt,0_02.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt,1_10.txt,1_11.txt,1_12.txt,1_13.txt,1_14.txt,1_15.txt,1_16.txt,1_17.txt,1_18.txt,1_19.txt,1_20.txt,1_21.txt,1_22.txt,1_23.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 6 ms 768 KB
1_07.txt AC 7 ms 768 KB
1_08.txt WA
1_09.txt WA
1_10.txt WA
1_11.txt WA
1_12.txt WA
1_13.txt WA
1_14.txt WA
1_15.txt WA
1_16.txt AC 9 ms 768 KB
1_17.txt AC 9 ms 768 KB
1_18.txt AC 9 ms 768 KB
1_19.txt AC 9 ms 768 KB
1_20.txt AC 8 ms 768 KB
1_21.txt AC 9 ms 768 KB
1_22.txt AC 9 ms 768 KB
1_23.txt AC 9 ms 768 KB