Submission #380913

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
380913	2021-03-23T14:40:47 Z	SolarSystem	Painting Walls (APIO20_paint)	C++17	0 / 100	1500 ms	10732 KB

paint

#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <numeric>
#include <iomanip>
#include <unordered_set>

using namespace std;

vector<unordered_set<int>> t;

bool check(vector<int> s) {
    s.push_back(-1);
    vector<int> pi(s.size() + t.size());
    pi[0] = 0;

    for (int i = 1; i < (int) pi.size(); i++) {
        int j = pi[i - 1];

        while (j > 0) {
            if (i < (int) s.size() && s[j] != s[i]) {
                j = pi[j - 1];
            } else if (i >= (int) s.size() && t[i - (int) s.size()].find(s[j]) == t[i - (int) s.size()].end()) {
                j = pi[j - 1];
            } else {
                break;
            }
        }

        if (i < (int) s.size() && s[j] == s[i]) {
            j++;
        } else if (i >= (int) s.size() && t[i - (int) s.size()].find(s[j]) != t[i - (int) s.size()].end()) {
            j++;
        }

        pi[i] = j;
    }

    for (int u: pi) {
        if (u == (int) s.size() - 1) {
            return true;
        }
    }

    return false;
}

int minimumInstructions(int n, int m, int k1, vector<int> c, vector<int> a, vector<vector<int>> b) {
    t.resize(m);
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < a[i]; j++) {
            t[i].insert(b[i][j]);
        }
    }

    for (int i = 0; i < m; i++) {
        t.push_back(t[i]);
    }

    int ans = 0;

    int j = -1, k = -1;

    for (int i = 0; ; i++) {
        vector<int> e;

        if (i + m - 1 < n) {
            for (int j = i; j <= i + m - 1; j++) {
                e.push_back(c[j]);
            }

            if (check(e)) {
                j = i;
            }
        }

        if (i > k) {
            if (j + m - 1 < i) {
                return -1;
            } else {
                ans++;
                k = j + m - 1;
            }
        }

        if (k == n - 1) {
            return ans;
        }
    }
}

Subtask #1

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	4 ms	364 KB	Output is correct
14	Correct	4 ms	492 KB	Output is correct
15	Correct	4 ms	364 KB	Output is correct
16	Correct	5 ms	364 KB	Output is correct
17	Correct	5 ms	364 KB	Output is correct
18	Correct	4 ms	364 KB	Output is correct
19	Correct	4 ms	492 KB	Output is correct
20	Correct	3 ms	640 KB	Output is correct
21	Correct	3 ms	492 KB	Output is correct
22	Correct	38 ms	10604 KB	Output is correct
23	Correct	44 ms	10732 KB	Output is correct
24	Correct	38 ms	10604 KB	Output is correct
25	Correct	6 ms	492 KB	Output is correct
26	Correct	6 ms	492 KB	Output is correct
27	Correct	4 ms	492 KB	Output is correct
28	Correct	3 ms	492 KB	Output is correct
29	Correct	4 ms	492 KB	Output is correct
30	Correct	2 ms	492 KB	Output is correct
31	Execution timed out	1580 ms	2924 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	4 ms	364 KB	Output is correct
14	Correct	4 ms	492 KB	Output is correct
15	Correct	4 ms	364 KB	Output is correct
16	Correct	5 ms	364 KB	Output is correct
17	Correct	5 ms	364 KB	Output is correct
18	Correct	4 ms	364 KB	Output is correct
19	Correct	4 ms	492 KB	Output is correct
20	Correct	3 ms	640 KB	Output is correct
21	Correct	3 ms	492 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	3 ms	364 KB	Output is correct
34	Correct	4 ms	364 KB	Output is correct
35	Correct	3 ms	364 KB	Output is correct
36	Correct	3 ms	364 KB	Output is correct
37	Correct	2 ms	364 KB	Output is correct
38	Correct	1 ms	396 KB	Output is correct
39	Incorrect	1 ms	364 KB	Output isn't correct
40	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	4 ms	364 KB	Output is correct
16	Correct	4 ms	492 KB	Output is correct
17	Correct	4 ms	364 KB	Output is correct
18	Correct	5 ms	364 KB	Output is correct
19	Correct	5 ms	364 KB	Output is correct
20	Correct	4 ms	364 KB	Output is correct
21	Correct	4 ms	492 KB	Output is correct
22	Correct	3 ms	640 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	38 ms	10604 KB	Output is correct
25	Correct	44 ms	10732 KB	Output is correct
26	Correct	38 ms	10604 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	3 ms	364 KB	Output is correct
37	Correct	4 ms	364 KB	Output is correct
38	Correct	3 ms	364 KB	Output is correct
39	Correct	3 ms	364 KB	Output is correct
40	Correct	2 ms	364 KB	Output is correct
41	Correct	1 ms	396 KB	Output is correct
42	Incorrect	1 ms	364 KB	Output isn't correct
43	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	4 ms	364 KB	Output is correct
16	Correct	4 ms	492 KB	Output is correct
17	Correct	4 ms	364 KB	Output is correct
18	Correct	5 ms	364 KB	Output is correct
19	Correct	5 ms	364 KB	Output is correct
20	Correct	4 ms	364 KB	Output is correct
21	Correct	4 ms	492 KB	Output is correct
22	Correct	3 ms	640 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	38 ms	10604 KB	Output is correct
25	Correct	44 ms	10732 KB	Output is correct
26	Correct	38 ms	10604 KB	Output is correct
27	Correct	6 ms	492 KB	Output is correct
28	Correct	6 ms	492 KB	Output is correct
29	Correct	4 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	4 ms	492 KB	Output is correct
32	Correct	2 ms	492 KB	Output is correct
33	Execution timed out	1580 ms	2924 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #5

0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	4 ms	364 KB	Output is correct
16	Correct	4 ms	492 KB	Output is correct
17	Correct	4 ms	364 KB	Output is correct
18	Correct	5 ms	364 KB	Output is correct
19	Correct	5 ms	364 KB	Output is correct
20	Correct	4 ms	364 KB	Output is correct
21	Correct	4 ms	492 KB	Output is correct
22	Correct	3 ms	640 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	38 ms	10604 KB	Output is correct
25	Correct	44 ms	10732 KB	Output is correct
26	Correct	38 ms	10604 KB	Output is correct
27	Correct	6 ms	492 KB	Output is correct
28	Correct	6 ms	492 KB	Output is correct
29	Correct	4 ms	492 KB	Output is correct
30	Correct	3 ms	492 KB	Output is correct
31	Correct	4 ms	492 KB	Output is correct
32	Correct	2 ms	492 KB	Output is correct
33	Execution timed out	1580 ms	2924 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-