Task: | Rhyming Slang |
Sender: | Game of Nolife |
Submission time: | 2016-11-12 12:47:14 +0200 |
Language: | C++ |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.06 s | details |
#2 | ACCEPTED | 0.05 s | details |
#3 | ACCEPTED | 0.05 s | details |
#4 | ACCEPTED | 0.07 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.06 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.05 s | details |
#9 | ACCEPTED | 0.07 s | details |
#10 | ACCEPTED | 0.05 s | details |
#11 | ACCEPTED | 0.06 s | details |
#12 | ACCEPTED | 0.06 s | details |
#13 | ACCEPTED | 0.06 s | details |
Code
#include <bits/stdc++.h> #define F first #define S second #define X real() #define Y imag() using namespace std; typedef long long ll; typedef long double ld; int issuffix(string& a, string& sf){ if (sf.size()>a.size()) return 0; for (int i=0;i<(int)sf.size();i++){ if (sf[(int)sf.size()-1-i]!=a[(int)a.size()-1-i]) return 0; } return 1; } string lol; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); string s; cin>>s; int e; cin>>e; vector<vector<string> > gg; getline(cin, lol); for (int i=0;i<e;i++){ vector<string> te; getline(cin, lol); stringstream ss; ss<<lol; int f=0; while (ss>>lol){ te.push_back(lol); if (issuffix(s, lol)) f=1; } if (f){ gg.push_back(te); } } int n; cin>>n; getline(cin, lol); for (int i=0;i<n;i++){ getline(cin, lol); int f=0; for (auto& g:gg){ for (string& t:g){ if (issuffix(lol, t)){ f=1; } } } if (f){ cout<<"YES\n"; } else{ cout<<"NO\n"; } } }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
doubt 2 aught ought aut acht oubt out ought outte oute 5 ... |
correct output |
---|
YES YES NO YES NO |
user output |
---|
YES YES NO YES NO |
Test 2
Verdict: ACCEPTED
input |
---|
qgrqe 10 a blne bp bt cu cy e eqdetn gl... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 3
Verdict: ACCEPTED
input |
---|
hi 10 ahn b c ccf csbwgvhsyx e fqv g... |
correct output |
---|
NO NO NO YES NO ... |
user output |
---|
NO NO NO YES NO ... |
Test 4
Verdict: ACCEPTED
input |
---|
joo 10 ck e ephxruuiv hwvne iyl j lrk... |
correct output |
---|
YES NO NO NO YES ... |
user output |
---|
YES NO NO NO YES ... |
Test 5
Verdict: ACCEPTED
input |
---|
jsd 10 ahtj b cfu h i ip k kcntfmo kz... |
correct output |
---|
YES NO NO YES YES ... |
user output |
---|
YES NO NO YES YES ... |
Test 6
Verdict: ACCEPTED
input |
---|
dg 10 a aauj d dxf elt f h j k km l ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 7
Verdict: ACCEPTED
input |
---|
ez 10 a alth b c cf d flzia iam juc ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 8
Verdict: ACCEPTED
input |
---|
irxe 10 a dvf guwnzdez hi hsjf ibpcm j... |
correct output |
---|
YES YES YES NO YES ... |
user output |
---|
YES YES YES NO YES ... |
Test 9
Verdict: ACCEPTED
input |
---|
baa 3 aa bb cc dd aa ee ff gg aa hh ii jj ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 10
Verdict: ACCEPTED
input |
---|
bad 1 bad mad sad 5 madbadsadwrong ... |
correct output |
---|
NO NO NO NO NO |
user output |
---|
NO NO NO NO NO |
Test 11
Verdict: ACCEPTED
input |
---|
baa 10 aa ba ca da ea fa ga ha ia ja ... |
correct output |
---|
YES YES YES YES YES ... |
user output |
---|
YES YES YES YES YES ... |
Test 12
Verdict: ACCEPTED
input |
---|
asdasdasdasdasdasda 1 asdasdasdasdasdasda fdgdfgdfgd... |
correct output |
---|
YES YES YES |
user output |
---|
YES YES YES |
Test 13
Verdict: ACCEPTED
input |
---|
b 1 a 1 a |
correct output |
---|
NO |
user output |
---|
NO |