Submission #7087530
Source Code Expand
#include <iostream> #include <string> #include <map> #include <queue> #include <algorithm> #include <vector> #include <math.h> #include <bitset> #include <cmath> #include <set> #define rep(i,s,n)for(int i = s;i<n;i++) #define repe(i,s,n)for(int i = s;i<=n;i++) #define rep_r(i,s,n)for(int i = n-1;i>=s;i--) #define rep_re(i,s,n)for(int i = n;i>=s;i--) using namespace std; typedef long long ll; static const ll MOD = 1e9 + 7; static const ll INF = 1e25; static const ll MAX_N = 100001; static const ll MAX_M = 100001; ll c[100001]; int main() { string s; cin >> s; string t = s; ll k; cin >> k; rep(i, 0, s.size()) { c[i] = ('z' - 'a') - (s[i] - 'a') + 1; } rep(i, 0, s.size()) { if (k - c[i] >= 0) { k -= c[i]; c[i] = 0; t[i] = 'a'; } } if (k > 0) { rep_r(i, 0, s.size()) { if (k - c[i] > 0) { k -= c[i]; c[i] = 0; t[i] = 'z'; } else { t[i] = s[i] + k; k = 0; } if (k == 0)break; } } cout << t << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Next Letter |
User | butanokakuni_c1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1037 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 1408 KB |
Compile Error
./Main.cpp:19:23: warning: overflow in implicit constant conversion [-Woverflow] static const ll INF = 1e25; ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
1_05.txt | WA | 1 ms | 256 KB |
1_06.txt | WA | 5 ms | 1408 KB |
1_07.txt | WA | 5 ms | 1408 KB |
1_08.txt | WA | 5 ms | 1280 KB |
1_09.txt | WA | 5 ms | 1280 KB |
1_10.txt | WA | 5 ms | 1280 KB |
1_11.txt | WA | 5 ms | 1280 KB |
1_12.txt | WA | 5 ms | 1280 KB |
1_13.txt | WA | 5 ms | 1280 KB |
1_14.txt | WA | 5 ms | 1280 KB |
1_15.txt | WA | 5 ms | 1280 KB |
1_16.txt | WA | 5 ms | 1280 KB |
1_17.txt | WA | 5 ms | 1280 KB |
1_18.txt | WA | 5 ms | 1280 KB |
1_19.txt | WA | 5 ms | 1408 KB |
1_20.txt | WA | 5 ms | 1280 KB |
1_21.txt | WA | 5 ms | 1280 KB |
1_22.txt | WA | 5 ms | 1280 KB |
1_23.txt | WA | 5 ms | 1280 KB |