Submission #1696805
Source Code Expand
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;
const double eps = 1e-10;
template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}
class RMQ{
private:
int n;
vector<ll> node, lazy;
vector<bool> lazyFlag;
public:
RMQ(vector<ll> v){
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, INF_LL);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1, false);
REP(i, sz) node[i+n-1] = v[i];
for(int i = n-2;i >= 0;i--) node[i] = min(node[2*i+1], node[2*i+2]);
}
void eval(int k, int l, int r){
if(lazyFlag[k]){
node[k] = lazy[k];
if(r-l > 1){
lazy[2*k+1] = lazy[k];
lazy[2*k+2] = lazy[k];
lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
}
lazy[k] = 0;
lazyFlag[k] = false;
}
}
void update(int a, int b, ll x, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] = x;
lazyFlag[k] = true;
eval(k, l, r);
}else{
update(a, b, x, k*2+1, l, (l+r)/2);
update(a, b, x, k*2+2, (l+r)/2, r);
node[k] = min(node[k*2+1], node[k*2+2]);
}
}
ll query(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return INF_LL;
if(a <= l && r <= b) return node[k];
return min(query(a, b, k*2+1, l, (l+r)/2), query(a, b, k*2+2, (l+r)/2, r));
}
};
class RMQ_MAX{
private:
int n;
vector<ll> node, lazy;
vector<bool> lazyFlag;
public:
RMQ_MAX(vector<ll> v){
int sz = v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1, INF_LL);
lazy.resize(2*n-1, 0);
lazyFlag.resize(2*n-1, false);
REP(i, sz) node[i+n-1] = v[i];
for(int i = n-2;i >= 0;i--) node[i] = max(node[2*i+1], node[2*i+2]);
}
void eval(int k, int l, int r){
if(lazyFlag[k]){
node[k] = lazy[k];
if(r-l > 1){
lazy[2*k+1] = lazy[k];
lazy[2*k+2] = lazy[k];
lazyFlag[2*k+1] = lazyFlag[2*k+2] = true;
}
lazy[k] = 0;
lazyFlag[k] = false;
}
}
void update(int a, int b, ll x, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return;
if(a <= l && r <= b){
lazy[k] = x;
lazyFlag[k] = true;
eval(k, l, r);
}else{
update(a, b, x, k*2+1, l, (l+r)/2);
update(a, b, x, k*2+2, (l+r)/2, r);
node[k] = max(node[k*2+1], node[k*2+2]);
}
}
ll query(int a, int b, int k=0, int l=0, int r=-1){
if(r < 0) r = n;
eval(k, l, r);
if(b <= l || r <= a) return -1;
if(a <= l && r <= b) return node[k];
return max(query(a, b, k*2+1, l, (l+r)/2), query(a, b, k*2+2, (l+r)/2, r));
}
};
int main(void){
string s;
int K;
cin >> s >> K;
REP(i, s.size()){
if(s[i] == 'a') continue;
if('z'-s[i]+1 <= K){
K -= 'z'-s[i]+1;
s[i] = 'a';
}
}
s[s.size()-1] = (char)(((int)s[s.size()-1]-'a'+K)%26+'a');
cout << s << endl;
}
Submission Info
Submission Time |
|
Task |
C - Next Letter |
User |
maze1230 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3482 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
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 |
4 ms |
512 KB |
1_07.txt |
AC |
5 ms |
512 KB |
1_08.txt |
AC |
5 ms |
512 KB |
1_09.txt |
AC |
4 ms |
512 KB |
1_10.txt |
AC |
5 ms |
512 KB |
1_11.txt |
AC |
4 ms |
512 KB |
1_12.txt |
AC |
4 ms |
512 KB |
1_13.txt |
AC |
4 ms |
512 KB |
1_14.txt |
AC |
4 ms |
512 KB |
1_15.txt |
AC |
5 ms |
512 KB |
1_16.txt |
AC |
5 ms |
512 KB |
1_17.txt |
AC |
5 ms |
512 KB |
1_18.txt |
AC |
5 ms |
512 KB |
1_19.txt |
AC |
5 ms |
512 KB |
1_20.txt |
AC |
4 ms |
512 KB |
1_21.txt |
AC |
5 ms |
512 KB |
1_22.txt |
AC |
4 ms |
512 KB |
1_23.txt |
AC |
4 ms |
512 KB |