CSES - Datatähti 2019 alku - Results
Submission details
Task:Kolikot
Sender:Nanohenry
Submission time:2018-10-04 00:03:45
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.01 s1details
#30.02 s1details
#40.01 s1details
#50.01 s1details
#60.02 s1details
#70.02 s1details
#80.01 s1details
#90.02 s1details
#100.01 s1details
#110.01 s2details
#120.03 s2details
#130.03 s2details
#140.01 s2details
#150.02 s2details
#160.02 s2details
#170.02 s2details
#180.01 s2details
#190.02 s2details
#200.03 s2details
#210.04 s3details
#220.01 s3details
#230.02 s3details
#240.43 s3details
#25--3details
#260.12 s3details
#270.83 s3details
#28--3details
#29--3details
#30--3details

Code

#include <iostream>
#include <algorithm>

using namespace std;

long n, k, r, b, e, s = 2, c;
bool d;
uint64_t lut[15625];
unsigned long t[500001];

inline void insert(unsigned long i) {
    //cout << "inserting " << i << '\n';
    lut[i / 64] |= 1 << (i % 64);
}

inline void remove(unsigned long i) {
    //cout << "removing " << i << '\n';
    lut[i / 64] &= ~(1 << (i % 64));
}

inline bool test(unsigned long i) {
    return lut[i / 64] & (1 << (i % 64));
}

/*void vs() {
    for (long i = 0; i < n; i++) {
        if (i >= b && i <= e) {
            cout << t[i] << ' ';
        } else {
            cout << "  ";
        }
    }
    cout << '\t';
    for (long i = 0; i < 10; i++) {
        cout << test(i) << ' ';
    }
    cout << "\t" << "count is now " << c << '\n';
}*/

int main() {
    cin >> n >> k;
    for (long i = 0; i < n; i++) {
        cin >> t[i];
    }
    r = n;
    if (n == 1) {
        cout << "1\n";
        //system("pause");
        return 0;
    }
    insert(t[0]);
    insert(t[1]);
    c = 1 + (t[0] != t[1]);
    while (1) {
        if (!d) {
            e++;
            if (!test(t[e])) {
                c++;
                insert(t[e]);
            }
            if (e - b >= s) {
                b++;
                if (find(&t[b], &t[e + 1], t[b - 1]) == &t[e + 1]) {
                    c--;
                    remove(t[b - 1]);
                }
            }
            if (e == n - 1) {
                d = 1;
                s++;
                if (s > n) {
                    //vs();
                    if (c <= k) {
                        r++;
                    }
                    break;
                }
            }
        } else {
            b--;
            if (!test(t[b])) {
                c++;
                insert(t[b]);
            }
            if (e - b >= s) {
                e--;
                if (find(&t[b], &t[e + 1], t[e + 1]) == &t[e + 1]) {
                    c--;
                    remove(t[e + 1]);
                }
            }
            if (b == 0) {
                d = 0;
                s++;
                if (s > n) {
                    //vs();
                    if (c <= k) {
                        r++;
                    }
                    break;
                }
            }
        }
        //vs();
        if (c <= k) {
            r++;
        }
    }
    cout << r << '\n';
    //system("pause");
}

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
2

Test 3

Group: 1

Verdict:

input
3

correct output
2
1 2 

user output
3

Test 4

Group: 1

Verdict:

input
4

correct output
2
1 3 

user output
4

Test 5

Group: 1

Verdict:

input
5

correct output
2
1 4 

user output
5

Test 6

Group: 1

Verdict:

input
6

correct output
3
1 2 3 

user output
6

Test 7

Group: 1

Verdict:

input
7

correct output
3
1 2 4 

user output
7

Test 8

Group: 1

Verdict:

input
8

correct output
3
1 2 5 

user output
8

Test 9

Group: 1

Verdict:

input
9

correct output
3
1 2 6 

user output
9

Test 10

Group: 1

Verdict:

input
10

correct output
4
1 2 3 4 

user output
10

Test 11

Group: 2

Verdict:

input
11

correct output
4
1 2 3 5 

user output
11

Test 12

Group: 2

Verdict:

input
54

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

user output
54

Test 13

Group: 2

Verdict:

input
55

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

user output
55

Test 14

Group: 2

Verdict:

input
56

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

user output
56

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
123

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
819

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
820

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
821

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
999

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
1000

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
1274

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
1275

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
1276

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
12345

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
(empty)

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
(empty)