CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:tuomask
Submission time:2018-10-13 20:27:55 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.01 s1details
#30.03 s1details
#40.02 s1details
#50.01 s1details
#60.02 s1details
#70.03 s1details
#80.01 s1details
#90.02 s1details
#100.01 s1details
#11ACCEPTED0.02 s1details
#12ACCEPTED0.02 s1details
#130.01 s1details
#140.03 s1details
#150.01 s2details
#160.00 s2details
#170.00 s2details
#180.02 s2details
#190.03 s2details
#200.02 s2details
#210.01 s2details
#220.02 s2details
#230.02 s2details
#240.02 s2details
#25ACCEPTED0.02 s2details
#26ACCEPTED0.03 s2details
#270.03 s2details
#280.03 s2details
#290.02 s3details
#300.00 s3details
#31--3details
#320.01 s3details
#330.02 s3details
#340.02 s3details
#350.00 s3details
#360.00 s3details
#370.02 s3details
#380.02 s3details
#39ACCEPTED0.01 s3details
#40--3details
#410.02 s3details
#420.01 s3details

Code

#include<bits/stdc++.h>
using namespace std;

string s;
string stamp;

uint lastStampStart=0;
uint lastForwardPos=0;
vector<uint> stampPositions;

void haku(uint i, bool whileen) {
    if (i >= s.length()) {
        string nS = string(s);
        for (uint x=0; x<stampPositions.size(); x++) {
            for (uint y=0; y<stamp.length(); y++) {
                nS[stampPositions[x] + y] = stamp[y];
            }
        }
        cout << nS << "\n";
        if (nS == s) {
            cout << stampPositions.size() << "\n";
            for (uint j=0; j<stampPositions.size(); j++) {
              cout << (stampPositions[j]+1) << " ";
            }
            exit(0);
        }
        return;
    }

    //cout << "i: " << i << "   lastStampStart: " << lastStampStart << "   si: " << (i-lastStampStart) << "   " << whileen << "\n";
    // jos leimaa on vielä jäljellä, ja nykyisen kohdan merkki on oikein
    if (i-lastStampStart < stamp.length() && s[i] == stamp[i-lastStampStart]) {
        // uusi leima aloitettiin juuri tästä
        if (lastStampStart == i) {
            //System.out.println("   add B " + lastStampStart);
            //System.out.println("update lastForwardPos");
            lastForwardPos = stampPositions.size();
            stampPositions.push_back(lastStampStart);
            // uusimman leiman aloituskohta ei ole vielä listassa
        } else if (lastStampStart != stampPositions[lastForwardPos]) {
            //System.out.println("   add A " + lastStampStart);
            stampPositions.insert(stampPositions.begin() + lastForwardPos, lastStampStart);
        }
        haku(i+1, true);
    } else if (whileen) {
      uint oldLastStampStart = lastStampStart;
      uint oldLastForwardPos = lastForwardPos;
      // toistetaan kunnes leiman paikka on merkkijonon lopussa, tai leima alkaa täsmälleen nykyisestä kohdasta
      while (lastStampStart <= s.length() - stamp.length() && lastStampStart < i) {
          lastStampStart++;
          vector<uint> oldStampPositions = vector<uint>(stampPositions);
          haku(i, false);
          stampPositions = oldStampPositions;
          //System.out.println("   remove " + stampPositions.get(stampPositions.size()-1));
          //stampPositions.remove(stampPositions.size()-1);
      }
      lastStampStart = oldLastStampStart;
      lastForwardPos = oldLastForwardPos;
    }
}


int main() {
    cin >> s >> stamp;
    haku(0, true);
    cout << "-1\n";
}

Test details

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
BBBBBBBBBB
10
1 2 3 4 5 6 7 8 9 10 

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
AABBABABAB
6
1 3 2 5 7 9 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
AABAAABAAA
4
6 5 2 1 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
BAAAAAABBB
2
2 1 

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
AAABBABBAA
1

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
GGGGGGGGGG
10
1 2 3 4 5 6 7 8 9 10 

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
QUUQUUQUQU
6
2 1 5 4 7 9 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
DWXDWDWXHJ
3
1 4 6 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
FSOCRDGQBB
2
2 1 

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
OETMIMPUPD
1

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
ABABABABA
4
7 5 3 1 

Test 14

Group: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
AAAAAAAAAB
-1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...
Truncated

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

correct output
36
87 43 24 1 91 79 69 68 67 66 6...

user output
(empty)

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

correct output
22
51 50 43 41 31 28 26 24 21 20 ...

user output
(empty)

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
AABABAAAABBBBBABABBAABBABABBAB...
Truncated

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
AABABBBBBBAABBABABBBBBBAABBAAA...
Truncated

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...
Truncated

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

correct output
18
1 2 3 74 5 79 58 7 84 64 37 10...

user output
NNNININIMNIMKLMXCNIMKLMXCDEIMK...
Truncated

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...
Truncated

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
IISNROLHLOJIWPTVFHFLUQRIROVLYP...
Truncated

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
WPMEMERJXXADLKONUZPUUFTPSXDHIV...
Truncated

Test 25

Group: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

Test 26

Group: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Group: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

correct output
49
97 95 93 91 89 87 85 83 81 79 ...

user output
ABABABABABABABABABABABABABABAB...
Truncated

Test 28

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
Truncated

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...
Truncated

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

correct output
218
1 626 607 519 415 5 975 957 92...

user output
(empty)

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

correct output
55
569 639 403 761 663 437 172 90...

user output
(empty)

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
ABBAAABAAABAAAAABBABABBABBABBB...
Truncated

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
BAAABBABBBAAAABAAAABBBBABAABAA...
Truncated

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...
Truncated

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

correct output
178
723 731 1 935 857 820 760 735 ...

user output
(empty)

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

correct output
21
671 54 747 504 113 1 856 764 5...

user output
(empty)

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...
Truncated

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...
Truncated

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
(empty)

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

correct output
499
997 995 993 991 989 987 985 98...

user output
ABABABABABABABABABABABABABABAB...
Truncated

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
Truncated