Submission #1502794
Source Code Expand
// need #include <iostream> #include <algorithm> // data structure #include <bitset> //#include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <utility> #include <vector> //#include <array> //#include <tuple> //#include <unordered_map> #include <unordered_set> #include <complex> //#include <deque> #include<valarray> // stream //#include <istream> //#include <sstream> //#include <ostream> #include <fstream> // etc #include <cmath> #include <cassert> #include <functional> #include <iomanip> //#include <typeinfo> #include <chrono> #include <random> #include <numeric> #include <regex> #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; } template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);} template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define OUT(d) std::cout<<d; #define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d; #define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d; #define SP std::cout<<" "; #define TAB std::cout<<"\t"; #define BR std::cout<<"\n"; #define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' '); #define ENDL std::cout<<std::endl; #define FLUSH std::cout<<std::flush; #define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<int(n);++i) #define RREP(i, n) for(int i=(n)-1;i>=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i) #define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i) #define REPLL(i, n) for(ll i=0;i<ll(n);++i) #define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i) #define IN(a, x, b) (a<=x && x<b) #define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";} #define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";} #define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}} #define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";} template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } template<typename S, typename T> std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define int ll using ll = long long; using ull = unsigned long long; using PAIR = std::pair<int, int>; using PAIRLL = std::pair<ll, ll>; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; signed main() { INIT; VAR(std::string, s); OUT(std::regex_replace(s, std::regex("HAGIYA"), "HAGIXILE"))BR; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - HAGIXILE |
User | satanic0258 |
Language | C++14 (GCC 5.4.1) |
Score | 20 |
Code Size | 4729 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 20 / 20 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_manual1.txt, 00_manual2.txt, 00_sample.txt, 00_small00.txt, 00_small01.txt, 00_small02.txt, 00_small03.txt, 00_small04.txt, 00_small05.txt, 00_small06.txt, 00_small07.txt, 00_small08.txt, 00_small09.txt, 00_small10.txt, 00_small11.txt, 00_small12.txt, 00_small13.txt, 00_small14.txt, 00_small15.txt, 00_small16.txt, 00_small17.txt, 00_small18.txt, 00_small19.txt, 00_small20.txt, 00_small21.txt, 00_small22.txt, 00_small23.txt, 00_small24.txt, 00_small25.txt, 00_small26.txt, 00_small27.txt, 00_small28.txt, 00_small29.txt, 01_large00.txt, 01_large01.txt, 01_large02.txt, 01_large03.txt, 01_large04.txt, 01_large05.txt, 01_large06.txt, 01_large07.txt, 01_large08.txt, 01_large09.txt, 01_large10.txt, 01_large11.txt, 01_large12.txt, 01_large13.txt, 01_large14.txt, 01_large15.txt, 01_large16.txt, 01_large17.txt, 01_large18.txt, 01_large19.txt, 01_large20.txt, 01_large21.txt, 01_large22.txt, 01_large23.txt, 01_large24.txt, 01_large25.txt, 01_large26.txt, 01_large27.txt, 01_large28.txt, 01_large29.txt, 03_manual00.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_manual1.txt | AC | 1 ms | 256 KB |
00_manual2.txt | AC | 1 ms | 256 KB |
00_sample.txt | AC | 1 ms | 256 KB |
00_small00.txt | AC | 1 ms | 256 KB |
00_small01.txt | AC | 1 ms | 256 KB |
00_small02.txt | AC | 1 ms | 256 KB |
00_small03.txt | AC | 1 ms | 256 KB |
00_small04.txt | AC | 1 ms | 256 KB |
00_small05.txt | AC | 1 ms | 256 KB |
00_small06.txt | AC | 1 ms | 256 KB |
00_small07.txt | AC | 1 ms | 256 KB |
00_small08.txt | AC | 1 ms | 256 KB |
00_small09.txt | AC | 1 ms | 256 KB |
00_small10.txt | AC | 1 ms | 256 KB |
00_small11.txt | AC | 1 ms | 256 KB |
00_small12.txt | AC | 1 ms | 256 KB |
00_small13.txt | AC | 1 ms | 256 KB |
00_small14.txt | AC | 1 ms | 256 KB |
00_small15.txt | AC | 1 ms | 256 KB |
00_small16.txt | AC | 1 ms | 256 KB |
00_small17.txt | AC | 1 ms | 256 KB |
00_small18.txt | AC | 1 ms | 256 KB |
00_small19.txt | AC | 1 ms | 256 KB |
00_small20.txt | AC | 1 ms | 256 KB |
00_small21.txt | AC | 1 ms | 256 KB |
00_small22.txt | AC | 1 ms | 256 KB |
00_small23.txt | AC | 1 ms | 256 KB |
00_small24.txt | AC | 1 ms | 256 KB |
00_small25.txt | AC | 1 ms | 256 KB |
00_small26.txt | AC | 1 ms | 256 KB |
00_small27.txt | AC | 1 ms | 256 KB |
00_small28.txt | AC | 1 ms | 256 KB |
00_small29.txt | AC | 1 ms | 256 KB |
01_large00.txt | AC | 1 ms | 256 KB |
01_large01.txt | AC | 1 ms | 256 KB |
01_large02.txt | AC | 1 ms | 256 KB |
01_large03.txt | AC | 1 ms | 256 KB |
01_large04.txt | AC | 1 ms | 256 KB |
01_large05.txt | AC | 1 ms | 256 KB |
01_large06.txt | AC | 1 ms | 256 KB |
01_large07.txt | AC | 1 ms | 256 KB |
01_large08.txt | AC | 1 ms | 256 KB |
01_large09.txt | AC | 1 ms | 256 KB |
01_large10.txt | AC | 1 ms | 256 KB |
01_large11.txt | AC | 1 ms | 256 KB |
01_large12.txt | AC | 1 ms | 256 KB |
01_large13.txt | AC | 1 ms | 256 KB |
01_large14.txt | AC | 1 ms | 256 KB |
01_large15.txt | AC | 1 ms | 256 KB |
01_large16.txt | AC | 1 ms | 256 KB |
01_large17.txt | AC | 1 ms | 256 KB |
01_large18.txt | AC | 1 ms | 256 KB |
01_large19.txt | AC | 1 ms | 256 KB |
01_large20.txt | AC | 1 ms | 256 KB |
01_large21.txt | AC | 1 ms | 256 KB |
01_large22.txt | AC | 1 ms | 256 KB |
01_large23.txt | AC | 1 ms | 256 KB |
01_large24.txt | AC | 1 ms | 256 KB |
01_large25.txt | AC | 1 ms | 256 KB |
01_large26.txt | AC | 1 ms | 256 KB |
01_large27.txt | AC | 1 ms | 256 KB |
01_large28.txt | AC | 1 ms | 256 KB |
01_large29.txt | AC | 1 ms | 256 KB |
03_manual00.txt | AC | 1 ms | 256 KB |