Submission #1099929


Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

int a[MAX_N];

int main()
{
	int n;
	string alpha;
	string s;
	alpha = "abcdefghijklmnopqrstuvwxyz";
	cin >> s;
	rep(i,s.length()){
		rep(j,26){
			if(s[i] == alpha[j]){
				a[i] = j;
			}
		}
	}
	int K;
	cin >> K;
	rep(i,s.length()-1){
		if(K >= (26 - a[i])%26){
			K -= 26-a[i];
			a[i] = 0;
		}
	}
	a[s.length()-1] = (a[s.length()-1]+K)%26;
	rep(i,s.length()){
		cout << alpha[a[i]];
	}
}

Submission Info

Submission Time
Task C - Next Letter
User kopricky
Language C++14 (GCC 5.4.1)
Score 0
Code Size 635 Byte
Status WA
Exec Time 16 ms
Memory 896 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
WA × 1
AC × 18
WA × 9
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 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
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt WA 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 3 ms 256 KB
1_04.txt AC 3 ms 256 KB
1_05.txt AC 3 ms 256 KB
1_06.txt AC 15 ms 896 KB
1_07.txt AC 15 ms 896 KB
1_08.txt WA 16 ms 896 KB
1_09.txt WA 15 ms 896 KB
1_10.txt WA 16 ms 896 KB
1_11.txt WA 15 ms 896 KB
1_12.txt WA 15 ms 896 KB
1_13.txt WA 15 ms 896 KB
1_14.txt WA 15 ms 896 KB
1_15.txt WA 16 ms 896 KB
1_16.txt AC 16 ms 896 KB
1_17.txt AC 16 ms 896 KB
1_18.txt AC 16 ms 896 KB
1_19.txt AC 16 ms 896 KB
1_20.txt AC 15 ms 896 KB
1_21.txt AC 16 ms 896 KB
1_22.txt AC 15 ms 896 KB
1_23.txt AC 16 ms 896 KB