結果
問題 | No.1455 拡張ROTN |
ユーザー | hirono999 |
提出日時 | 2021-03-31 21:17:42 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,176 bytes |
コンパイル時間 | 3,628 ms |
コンパイル使用メモリ | 220,000 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-09 04:36:27 |
合計ジャッジ時間 | 4,420 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 2 ms
5,376 KB |
testcase_23 | AC | 2 ms
5,376 KB |
ソースコード
#line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/template.hpp" #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> constexpr long long INF = 1LL << 60; constexpr long double PI = 3.141592653589; #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= (n); ++i) #define rrep(i, n) for (ll i = (n - 1); i >= 0; --i) #define ALL(obj) (obj).begin(), (obj).end() #define RALL(obj) (obj).rbegin(), (obj).rend() #define pb push_back #define to_s to_string #define len(v) (ll) v.size() #define debug(x) cout << #x << ": " << (x) << '\n' using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> tpl; template <typename T = ll> using vec = vector<T>; template <typename T = ll> using vec2 = vector<vector<T>>; template <typename T = ll> using vec3 = vector<vector<vector<T>>>; template < typename T > inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template < typename T > inline bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } #line 4 "/home/snow/competitive-programming/competitive-programming-library/snow/io/setup.hpp" namespace snow{ struct IoSetup { IoSetup() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(10); } } iosetup; } #line 5 "/home/snow/competitive-programming/competitive-programming-library/snow/io/helper.hpp" template< typename T1, typename T2 > std::ostream &operator << (std::ostream &os, const std::pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > std::istream &operator >> (std::istream &is, std::pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T1, typename T2, typename T3 > std::ostream &operator << (std::ostream &os, const std::tuple< T1, T2, T3 > &t) { auto &[a, b, c] = t; os << a << " " << b << " " << c; return os; } template< typename T1, typename T2, typename T3 > std::istream &operator >> (std::istream &is, std::tuple< T1, T2, T3 > &t) { auto &[a, b, c] = t; is >> a >> b >> c; return is; } template< typename T > std::ostream &operator << (std::ostream &os, const std::vector< T > &v){ for (int i = 0; i < (int)v.size(); ++i) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > std::istream &operator >> (std::istream &is, std::vector< T > &v){ for(T &in : v) is >> in; return is; } template< typename T > std::ostream &operator << (std::ostream &os, const std::set< T > &st){ int ct = 0; for(auto& s : st) os << s << (++ct != st.size() ? " " : ""); return os; } template<class... T> void input(T&... a){ (std::cin >> ... >> a); } void print() { std::cout << '\n'; } template<class T, class... Ts> void print(const T& a, const Ts&... b){ std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n'; } int drop() { std::cout << '\n'; exit(0); } template<class T, class... Ts> int drop(const T& a, const Ts&... b){ std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout << '\n'; exit(0); } #line 4 "main.cpp" using namespace snow; // #include "snow/algorithm/binary-search.hpp" // #include "atcoder/modint" // using namespace atcoder; // using mint = modint1000000007; string trans(string S){ string ret = ""; for(auto s : S){ if(s == '9') ret += "CpCzNkSuTbEoA"; else if(s == 'Z') ret += 'A'; else if(s == 'z') ret += 'a'; else ret += char(s + 1); } return ret; } int main() { string S; cin >> S; ll N; cin >> N; while(N--){ S = trans(S); bool exists = true; for(auto s : S) if(isdigit(s)) exists = false; if(exists) break; } N %= 'Z' - 'A' + 1; rep(i, N) S = trans(S); print(S); return 0; }