結果
問題 | No.8064 う し た ぷ に き あ く ん 笑 |
ユーザー |
![]() |
提出日時 | 2020-08-10 12:03:10 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 2,774 bytes |
コンパイル時間 | 1,130 ms |
コンパイル使用メモリ | 120,940 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-06 22:30:48 |
合計ジャッジ時間 | 3,290 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 47 |
ソースコード
#line 2 "library/other/template.hpp"#define _CRT_SECURE_NO_WARNINGS#pragma target("avx2")#pragma optimize("O3")#pragma optimize("unroll-loops")#include <algorithm>#include <bitset>#include <cassert>#include <cfloat>#include <climits>#include <cmath>#include <complex>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <list>#include <map>#include <memory>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <string.h>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define rep(i,n) for(int i=0;i<(n);i++)#define REP(i,n) for(int i=1;i<=(n);i++)#define all(V) V.begin(),V.end()typedef long long lint;typedef unsigned long long ulint;typedef std::pair<int, int> P;typedef std::pair<lint, lint> LP;constexpr int INF = INT_MAX/2;constexpr lint LINF = LLONG_MAX/2;constexpr double eps = DBL_EPSILON;constexpr double PI=3.141592653589793238462643383279;template<class T>class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};template <class T, class U>inline bool chmax(T& lhs, const U& rhs) {if (lhs < rhs) {lhs = rhs;return 1;}return 0;}template <class T, class U>inline bool chmin(T& lhs, const U& rhs) {if (lhs > rhs) {lhs = rhs;return 1;}return 0;}inline lint gcd(lint a, lint b) {while (b) {lint c = a;a = b; b = c % b;}return a;}inline lint lcm(lint a, lint b) {return a / gcd(a, b) * b;}bool isprime(lint n) {if (n == 1)return false;for (int i = 2; i * i <= n; i++) {if (n % i == 0)return false;}return true;}template<typename T>T mypow(T a, lint b) {T res(1);while(b){if(b&1)res*=a;a*=a;b>>=1;}return res;}lint modpow(lint a, lint b, lint m) {lint res(1);while(b){if(b&1){res*=a;res/=m;}a*=a;a/=m;b>>=1;}return res;}template<typename T>void printArray(std::vector<T>& vec) {rep(i, vec.size()){std::cout << vec[i];std::cout<<(i==(int)vec.size()-1?"\n":" ");}}template<typename T>void printArray(T l, T r) {T rprev = std::prev(r);for (T i = l; i != rprev; i++) {std::cout << *i << " ";}std::cout << *rprev << std::endl;}#line 2 "main.cpp"int main(){std::string s;std::string t[]={"う し","う あ","ん 笑","た ぷ","く ん","ぷ に","し き","あ く","う く","あ 笑","う ん","し ぷ","う き","く 笑","う 笑","に き","ぷ 笑","た き","た ん","し あ","し ん","う う","う た","き 笑","に く","笑 笑"};std::cin>>s;for(const char& i:s){std::cout<<t[i-'a']<<" ";}std::cout<<std::endl;return 0;}