CSES - Datatähti 2019 alku - Results
Submission details
Task:Kolikot
Sender:rainman
Submission time:2018-10-03 10:26:21 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.03 s1details
#30.02 s1details
#40.02 s1details
#50.02 s1details
#60.02 s1details
#70.03 s1details
#80.01 s1details
#90.03 s1details
#100.02 s1details
#110.02 s2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.02 s2details
#160.02 s2details
#170.01 s2details
#180.03 s2details
#190.02 s2details
#200.01 s2details
#210.02 s3details
#220.02 s3details
#230.03 s3details
#240.01 s3details
#250.01 s3details
#260.01 s3details
#270.03 s3details
#280.02 s3details
#290.01 s3details
#300.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:14:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int a = 0; a < s.length(); a++) t += "?";
                    ~~^~~~~~~~~~~~
input/code.cpp:21:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(s[i] != m[j] && j < m.length()) {
                               ~~^~~~~~~~~~~~
input/code.cpp:24:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(j == m.length()) break;
            ~~^~~~~~~~~~~~~
input/code.cpp:27:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(e > s.length() - m.length()) {
            ~~^~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(e > s.length() - m.length()) e = s.length() - m.length();...

Code

#include <bits/stdc++.h>

using namespace std;

string s;
string m;
vector<int> v;
set<string> k;

int main()
{
    cin >> s >> m;
    string t;
    for(int a = 0; a < s.length(); a++) t += "?";
    int i = 0;
    int j = 0;
    while(t != s)   {
        while(t[i] == s[i]) {
            i++;
        }
        while(s[i] != m[j] && j < m.length()) {
            j++;
        }
        if(j == m.length()) break;
        int e = i - j;
        if(j > i) e = 0;
        if(e > s.length() - m.length()) {
            int c = m.length() - 1;
            while(m[c] != s[i] && c > 0) c--;
            e = i - c;
            if(e > s.length() - m.length()) e = s.length() - m.length();

        }
        t.replace(e, m.length(), m);
        if(k.find(t) != k.end()) break;
        if(find(v.begin(), v.end(), e + 1) == v.end()) {
            v.push_back(e + 1);
        }
        else    {
            v.erase(find(v.begin(), v.end(), e + 1));
            v.push_back(e+1);
        }
        k.insert(t);
        i = 0;
        j = 0;
    }
    if(t != s) cout << "-1";
    else {
        cout << v.size() << '\n';
        for(int b = 0; b < v.size(); b++)   {
            cout << v[b] << ' ';
        }
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
-1

Test 2

Group: 1

Verdict:

input
2

correct output
1

user output
-1

Test 3

Group: 1

Verdict:

input
3

correct output
2
1 2 

user output
-1

Test 4

Group: 1

Verdict:

input
4

correct output
2
1 3 

user output
-1

Test 5

Group: 1

Verdict:

input
5

correct output
2
1 4 

user output
-1

Test 6

Group: 1

Verdict:

input
6

correct output
3
1 2 3 

user output
-1

Test 7

Group: 1

Verdict:

input
7

correct output
3
1 2 4 

user output
-1

Test 8

Group: 1

Verdict:

input
8

correct output
3
1 2 5 

user output
-1

Test 9

Group: 1

Verdict:

input
9

correct output
3
1 2 6 

user output
-1

Test 10

Group: 1

Verdict:

input
10

correct output
4
1 2 3 4 

user output
-1

Test 11

Group: 2

Verdict:

input
11

correct output
4
1 2 3 5 

user output
-1

Test 12

Group: 2

Verdict:

input
54

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

user output
-1

Test 13

Group: 2

Verdict:

input
55

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

user output
-1

Test 14

Group: 2

Verdict:

input
56

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

user output
-1

Test 15

Group: 2

Verdict:

input
123

correct output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 16

Group: 2

Verdict:

input
819

correct output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 17

Group: 2

Verdict:

input
820

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 18

Group: 2

Verdict:

input
821

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 19

Group: 2

Verdict:

input
999

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 20

Group: 2

Verdict:

input
1000

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 21

Group: 3

Verdict:

input
1274

correct output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 22

Group: 3

Verdict:

input
1275

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 23

Group: 3

Verdict:

input
1276

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 24

Group: 3

Verdict:

input
12345

correct output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 25

Group: 3

Verdict:

input
123456

correct output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 26

Group: 3

Verdict:

input
10000000

correct output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 27

Group: 3

Verdict:

input
100000000

correct output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 28

Group: 3

Verdict:

input
500000000

correct output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 29

Group: 3

Verdict:

input
999999999

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1

Test 30

Group: 3

Verdict:

input
1000000000

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1