Submission details
Task:Fused Folder
Sender:Yytsi
Submission time:2018-09-13 19:32:47 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.03 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.02 sdetails
#8ACCEPTED0.03 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.02 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.03 sdetails
#14ACCEPTED0.02 sdetails
#15ACCEPTED0.02 sdetails
#16ACCEPTED0.03 sdetails
#17ACCEPTED0.02 sdetails
#18ACCEPTED0.03 sdetails
#19ACCEPTED0.02 sdetails
#20ACCEPTED0.02 sdetails
#21ACCEPTED0.02 sdetails
#22ACCEPTED0.02 sdetails
#23ACCEPTED0.02 sdetails
#24ACCEPTED0.03 sdetails
#25ACCEPTED0.02 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.02 sdetails
#29ACCEPTED0.01 sdetails
#30ACCEPTED0.01 sdetails
#310.02 sdetails
#320.03 sdetails
#33ACCEPTED0.02 sdetails

Compiler report

input/code.cpp: In function 'bool in(const string&, const string&)':
input/code.cpp:3:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, a, b) for (int i=a; i<(b); i++)
                                     ^
input/code.cpp:11:2: note: in expansion of macro 'FOR'
  FOR(i,0,s1.size()) {
  ^~~
input/code.cpp:14:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (j==s2.size()) return true;
        ~^~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)

string A, B, F,l="",r="",pad="";
int n1, n2, n3;

bool in(const string& s1, const string& s2) {
	int j = 0;
	FOR(i,0,s1.size()) {
		if (s1[i]==s2[j]) {
			j++;
			if (j==s2.size()) return true;
		}
	}
	return false;
}

int main() {
	IO; cin>>n1>>n2>>n3;
	cin>>A; cin>>B; cin>>F;
	if (A==F || B==F) {
		cout << "NO";
		return 0;
	}
	if (A.size() < B.size()) {swap(A,B);swap(n1,n2);}
	reverse(A.begin(), A.end());
	reverse(B.begin(), B.end());
	for (int i=n1-1; i >= 0; i--) {
		if (A[i] == B[i]) {
			pad += A[i];
			A.pop_back();
			B.pop_back();
			n1--;
			n2--;
		}
	}
	int k = 0;
	for (int z = n2/2; z >= 1; z /= 2) {
		while (k+z <= n2 && in(A,B.substr(0,k+z+1))) k+=z;
	}
	FOR(i,0,n2) {
		if (i<=k) l+=B[i];
		else r+=B[i];
	}
	if (in(pad+l+A+r,F)) cout<<"NO";
	else cout << "YES";
}




Test details

Test 1

Verdict: ACCEPTED

input
6 6 6
abbacc
bacbac
bbaacc

correct output
YES

user output
YES

Test 2

Verdict: ACCEPTED

input
3 3 2
aab
aba
ab

correct output
NO

user output
NO

Test 3

Verdict: ACCEPTED

input
2 1 1
nf
l
n

correct output
NO

user output
NO

Test 4

Verdict: ACCEPTED

input
8 2 3
fjnclbff
lg
dcc

correct output
YES

user output
YES

Test 5

Verdict: ACCEPTED

input
3 3 8
cca
bvs
iabhqblp

correct output
YES

user output
YES

Test 6

Verdict: ACCEPTED

input
5 7 4
fnefw
frbujda
sdsy

correct output
YES

user output
YES

Test 7

Verdict: ACCEPTED

input
10 10 4
aaaaaabbab
aabababbaa
babb

correct output
NO

user output
NO

Test 8

Verdict: ACCEPTED

input
6 7 1
fefgaa
ddbebbb
f

correct output
NO

user output
NO

Test 9

Verdict: ACCEPTED

input
10 3 1
afeglbeobc
onj
e

correct output
NO

user output
NO

Test 10

Verdict: ACCEPTED

input
3 6 3
aab
abbaab
aaa

correct output
NO

user output
NO

Test 11

Verdict: ACCEPTED

input
17639 10996 8710
idokahghjkldghkkiegdaopealioon...

correct output
YES

user output
YES

Test 12

Verdict: ACCEPTED

input
13616 19964 101
fffbfcffccabfeddddcfcbfcaeeedf...

correct output
NO

user output
NO

Test 13

Verdict: ACCEPTED

input
574 9006 730
jjbfvgcqlffbmsfaabnsstutmnvvsn...

correct output
YES

user output
YES

Test 14

Verdict: ACCEPTED

input
14601 4082 918
edjekbfklgklbcldkefecckifgifab...

correct output
NO

user output
NO

Test 15

Verdict: ACCEPTED

input
20842 3618 22126
cefagfddfecafccgdfbbafgadcdaab...

correct output
YES

user output
YES

Test 16

Verdict: ACCEPTED

input
25000 25000 19987
bbaaaababbaabbbabbabbaabaaabba...

correct output
YES

user output
YES

Test 17

Verdict: ACCEPTED

input
25000 25000 2654
aacbdadeacbcdccddedcdeecdaaecd...

correct output
NO

user output
NO

Test 18

Verdict: ACCEPTED

input
25000 25000 21163
baabbabbaaaaabaabbabbbbbababaa...

correct output
YES

user output
YES

Test 19

Verdict: ACCEPTED

input
25000 25000 807
iihklfjfdljejeeigibgkachiijkkd...

correct output
NO

user output
NO

Test 20

Verdict: ACCEPTED

input
25000 25000 14673
nwmhuqbldgvcdmsjjnsvmsoabwhvch...

correct output
YES

user output
YES

Test 21

Verdict: ACCEPTED

input
25000 25000 25000
abbacbbaabacccbbccabbcccabaacc...

correct output
YES

user output
YES

Test 22

Verdict: ACCEPTED

input
25000 25000 25000
ebgcfecbbeabhdhcdcidcebiiccacb...

correct output
YES

user output
YES

Test 23

Verdict: ACCEPTED

input
25000 25000 25000
jhcdfcjeicfaagagaidijihaghhhjd...

correct output
YES

user output
YES

Test 24

Verdict: ACCEPTED

input
25000 25000 25000
bqrehnjncmasbsesfoonmqlojickqh...

correct output
NO

user output
NO

Test 25

Verdict: ACCEPTED

input
25000 25000 25000
cdfafbafcddafabdddbabdcbafbfec...

correct output
NO

user output
NO

Test 26

Verdict: ACCEPTED

input
25000 25000 25000
wmuwshejgvqtiqrhbewlulksnskqjf...

correct output
NO

user output
NO

Test 27

Verdict: ACCEPTED

input
25000 25000 25000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
NO

user output
NO

Test 28

Verdict: ACCEPTED

input
24999 24999 25000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
YES

user output
YES

Test 29

Verdict: ACCEPTED

input
10000 10000 10000
cjscerkmfabqallhbibbhlaihfckpc...

correct output
NO

user output
NO

Test 30

Verdict: ACCEPTED

input
10000 10000 10000
fodgaeiqjbocpodglembnamebdimqb...

correct output
NO

user output
NO

Test 31

Verdict:

input
25000 25000 12500
isaqmrnhixucovgtmcanojpdjnrops...

correct output
NO

user output
YES

Test 32

Verdict:

input
25000 25000 12500
aofhfsqifcrdezfmzoakkpfdwodcfh...

correct output
NO

user output
YES

Test 33

Verdict: ACCEPTED

input
25000 8333 12500
qoromlkxbskfhvcubtrnyztgieeykk...

correct output
YES

user output
YES