結果
| 問題 | No.380 悪の台本 |
| コンテスト | |
| ユーザー |
 kongarishisyamo
|
| 提出日時 | 2016-06-22 20:07:29 |
| 言語 | C++11 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 2,854 bytes |
| 記録 | |
| コンパイル時間 | 733 ms |
| コンパイル使用メモリ | 78,136 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2026-05-07 05:24:04 |
| 合計ジャッジ時間 | 3,207 ms |
|
ジャッジサーバーID （参考情報） |
judge2_1 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 2 WA * 6 |
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:31:20: warning: ignoring return value of 'bool std::operator==(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*) [with _CharT = char; _Traits = char_traits<char>; _Alloc = allocator<char>]', declared with attribute 'nodiscard' [-Wunused-result]
31 | in2=="";
| ~~~^~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/string:56,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/locale_classes.h:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ios_base.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ios:46,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ostream.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/iostream:43,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/basic_string.h:4062:5: note: declared here
4062 | operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
| ^~~~~~~~
ソースコード
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
bool A_Z(char a){
return a>='A'&&a<='Z';
}
bool a_z(char a){
return a>='a'&&a<='z';
}
bool num(char a){
return a>='0'&&a<='9';
}
bool kigo(char a){
return (!A_Z(a))&&(!a_z(a))&&(!num(a));
}
char change(char a){
if(A_Z(a)){
return a-('A'-'a');
}
return a;
}
int main(){
string in1,in2;
while(cin>>in1){
in2=="";
char in3=getchar();
while(in3!='\n'){
in2+=in3;
in3=getchar();
}
int s=in2.size();
bool f=false;
if(in1=="digi"){
if(s>=3&&change(in2[s-1])=='o'&&change(in2[s-2])=='y'&&change(in2[s-3])=='n') f=true;
if(s>=4&&kigo(change(in2[s-1]))&&change(in2[s-2])=='o'&&change(in2[s-3])=='y'&&change(in2[s-4])=='n') f=true;
if(s>=5&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&change(in2[s-3])=='o'&&change(in2[s-4])=='y'&&change(in2[s-5])=='n') f=true;
if(s>=6&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&kigo(change(in2[s-3]))&&change(in2[s-4])=='o'&&change(in2[s-5])=='y'&&change(in2[s-6])=='n') f=true;
}
else if(in1=="petit"){
if(s>=3&&change(in2[s-1])=='u'&&change(in2[s-2])=='y'&&change(in2[s-3])=='n') f=true;
if(s>=4&&kigo(change(in2[s-1]))&&change(in2[s-2])=='u'&&change(in2[s-3])=='y'&&change(in2[s-4])=='n') f=true;
if(s>=5&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&change(in2[s-3])=='u'&&change(in2[s-4])=='y'&&change(in2[s-5])=='n') f=true;
if(s>=6&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&kigo(change(in2[s-3]))&&change(in2[s-4])=='u'&&change(in2[s-5])=='y'&&change(in2[s-6])=='n') f=true;
}
else if(in1=="gema"){
if(s>=4&&change(in2[s-1])=='a'&&change(in2[s-2])=='m'&&change(in2[s-3])=='e'&&change(in2[s-4])=='g') f=true;
if(s>=5&&kigo(change(in2[s-1]))&&change(in2[s-2])=='a'&&change(in2[s-3])=='m'&&change(in2[s-4])=='e'&&change(in2[s-5])=='g') f=true;
if(s>=6&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&change(in2[s-3])=='a'&&change(in2[s-4])=='m'&&change(in2[s-5])=='e'&&change(in2[s-6])=='g') f=true;
if(s>=7&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&kigo(change(in2[s-3]))&&change(in2[s-4])=='a'&&change(in2[s-5])=='m'&&change(in2[s-6])=='e'&&change(in2[s-7])=='g') f=true;
}
else if(in1=="petit"){
if(s>=3&&change(in2[s-1])=='o'&&change(in2[s-2])=='y'&&change(in2[s-3])=='p') f=true;
if(s>=4&&kigo(change(in2[s-1]))&&change(in2[s-2])=='o'&&change(in2[s-3])=='y'&&change(in2[s-4])=='p') f=true;
if(s>=5&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&change(in2[s-3])=='o'&&change(in2[s-4])=='y'&&change(in2[s-5])=='p') f=true;
if(s>=6&&kigo(change(in2[s-1]))&&kigo(change(in2[s-2]))&&kigo(change(in2[s-3]))&&change(in2[s-4])=='o'&&change(in2[s-5])=='y'&&change(in2[s-6])=='p') f=true;
}
else{
for(int i=0;i<s;i++) if(!kigo(in2[i])) f=true;
}
if(f) cout<<"CORRECT (maybe)"<<endl;
else cout<<"WRONG!"<<endl;
}
}