Submission # 103529
提出されたコード
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
#include <regex>
using namespace std;
#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif
namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y){ return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y){ return x = max(x, y); }
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
template <class Con>
string concat(const Con &c, const string &spr){
stringstream ss;
typename Con::const_iterator it = c.begin(), en = c.end();
bool fst = true;
for(; it != en; ++it){
if(!fst){ ss << spr; }
fst = false;
ss << *it;
}
return ss.str();
}
template <class Con, class Fun>
vector<typename Con::value_type> cfilter(const Con &c, Fun f) {
vector<typename Con::value_type> ret;
typename Con::const_iterator it = c.begin(), en = c.end();
for(; it != en; ++it){
if(f(*it)){
ret.emplace_back(*it);
}
}
return ret;
}
#if __cplusplus >= 201103L
template <class Con, class Fun>
auto cmap(const Con &c, Fun f) -> vector<decltype(f(*c.begin()))> {
vector<decltype(f(*c.begin()))> ret;
ret.reserve(c.size());
for(const auto &x: c){
ret.emplace_back(f(x));
}
return ret;
}
#endif
#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()
#define tget(t,i) get<i>(t)
#define MOD 1000000007LL
#define EPS 1e-8
void mainmain(){
regex r("^シ(ィ|ィー|イー|ー|イ)ク(ア|ァ|ワ|ヮ)ー?(サ|シャ)ー|ヒラミレモン|平実檸檬|ひらみれもん|Citrus depressa|酸桔仔|sng-kiat-a|Ŝikuvaso|Shikwasa|لیموی پوستنازک|Chanh lõm|臺灣香檬$");
string s;
getline(cin, s);
smatch m;
if(regex_search(s, m, r)){
cout << "はい\n";
}
else{
cout << "いいえ\n";
}
}
}
int main() try{
// ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
}
catch(const exception &e){
cerr << "exception: " << e.what() << endl;
abort();
}
catch(...){
cerr << "exception" << endl;
abort();
}
詳細情報
| 問題 |
O : 沖縄 |
| ユーザ名 |
climpet |
| 投稿日時 |
2020/09/22 08:17:51 |
| 言語 |
C++17 |
| 状態 |
Wrong Answer
|
| 得点 |
0 |
| ソースコード長 |
3154 Byte |
| 実行時間 |
- |
| メモリ使用量 |
- |
コンパイラメッセージ
ジャッジ結果
| セット名 |
得点 / 配点 |
テストケース |
| all |
0 / 100 |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
|
| 01.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 02.txt |
Accepted |
0.01 sec |
1644 KB |
|
| 03.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 04.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 05.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 06.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 07.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 08.txt |
Wrong Answer |
0.00 sec |
1644 KB |
|
| 09.txt |
Wrong Answer |
0.01 sec |
1644 KB |
|
| 10.txt |
Wrong Answer |
0.00 sec |
1640 KB |
|
| 11.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 12.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 13.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 14.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 15.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 16.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 17.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 18.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 19.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 20.txt |
Wrong Answer |
0.00 sec |
1644 KB |
|
| 21.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 22.txt |
Wrong Answer |
0.00 sec |
1640 KB |
|
| 23.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 24.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 25.txt |
Accepted |
0.00 sec |
1644 KB |
|
| 26.txt |
Accepted |
0.00 sec |
1640 KB |
|
| 27.txt |
Accepted |
0.01 sec |
1644 KB |
|
| 28.txt |
Wrong Answer |
0.00 sec |
1640 KB |
|