oj.uz

Submission #502792

# Submission time Handle Problem Language Result Execution time Memory
502792 2022-01-06T15:21:13 Z Victor Painting Walls (APIO20_paint) C++17
28 / 100
 1500 ms 20656 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include "paint.h"

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int n,m,k,jmp_back[100005];
vvi people;
uset<int> colors[100005];
vi wall;
vector<bool>possible;

int minimumInstructions(int N, int M, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
    possible.assign(N,0);
    people.swap(B);
    wall.swap(C);
    n=N,m=M,k=K;

    rep(i,0,m) trav(color,people[i]) colors[color].insert(i);
    for(int pos=m-1;pos<n;pos+=m) {
        int cur_color=wall[pos];

        assert(sz(colors[cur_color])<700);
        trav(person,colors[cur_color]) {
            int first_person=(person+1)%m,num_match=0;
            int start_pos=pos-m+1;
            rep(i,0,m-1) num_match+=colors[wall[start_pos+i]].count((first_person+i)%m);

            rep(i,m-1,m-1+(n-pos)){
                num_match+=colors[wall[start_pos+m-1]].count((first_person-1+m)%m);
                if(num_match==m) possible[start_pos]=1;
                
                num_match-=colors[wall[start_pos]].count(first_person);
                first_person=(first_person+1)%m;
                ++start_pos;
            }
        }
    }

    int val=-INF;
    rep(i,0,n) {
        if(possible[i])val=i;
        jmp_back[i]=val;
    }
    //cout<<sz(possible)<<endl;
    int pos=0,ans=0;
    while(pos<n) {
        int nxt_pos=jmp_back[pos];
        if(nxt_pos+m>pos) {
            pos=nxt_pos+m;
            ++ans;

        } else return -1;
    }
    return ans;
}

/*
int main() {
    int N, M, K;
    assert(3 == scanf("%d %d %d", &N, &M, &K));

    std::vector<int> C(N);
    for (int i = 0; i < N; ++i) {
        assert(1 == scanf("%d", &C[i]));
    }

    std::vector<int> A(M);
    std::vector<std::vector<int>> B(M);
    for (int i = 0; i < M; ++i) {
        assert(1 == scanf("%d", &A[i]));
        B[i].resize(A[i]);
        for (int j = 0; j < A[i]; ++j) {
            assert(1 == scanf("%d", &B[i][j]));
        }
    }

    int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
    printf("%d\n", minimum_instructions);

    return 0;
}*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5708 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 3 ms 5708 KB Output is correct
7 Correct 5 ms 5708 KB Output is correct
8 Correct 5 ms 5708 KB Output is correct
9 Correct 4 ms 5708 KB Output is correct
10 Correct 4 ms 5688 KB Output is correct
11 Correct 3 ms 5708 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 4 ms 5836 KB Output is correct
15 Correct 4 ms 5836 KB Output is correct
16 Correct 3 ms 5836 KB Output is correct
17 Correct 4 ms 5836 KB Output is correct
18 Correct 3 ms 5836 KB Output is correct
19 Correct 3 ms 5836 KB Output is correct
20 Correct 4 ms 5836 KB Output is correct
21 Correct 3 ms 5836 KB Output is correct
22 Correct 55 ms 20656 KB Output is correct
23 Correct 57 ms 20588 KB Output is correct
24 Correct 55 ms 20544 KB Output is correct
25 Execution timed out 1592 ms 5836 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5708 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 3 ms 5708 KB Output is correct
7 Correct 5 ms 5708 KB Output is correct
8 Correct 5 ms 5708 KB Output is correct
9 Correct 4 ms 5708 KB Output is correct
10 Correct 4 ms 5688 KB Output is correct
11 Correct 3 ms 5708 KB Output is correct
12 Correct 4 ms 5708 KB Output is correct
13 Correct 3 ms 5836 KB Output is correct
14 Correct 4 ms 5836 KB Output is correct
15 Correct 4 ms 5836 KB Output is correct
16 Correct 3 ms 5836 KB Output is correct
17 Correct 4 ms 5836 KB Output is correct
18 Correct 3 ms 5836 KB Output is correct
19 Correct 3 ms 5836 KB Output is correct
20 Correct 4 ms 5836 KB Output is correct
21 Correct 3 ms 5836 KB Output is correct
22 Correct 3 ms 5708 KB Output is correct
23 Correct 3 ms 5708 KB Output is correct
24 Correct 3 ms 5708 KB Output is correct
25 Correct 3 ms 5708 KB Output is correct
26 Correct 3 ms 5708 KB Output is correct
27 Correct 4 ms 5708 KB Output is correct
28 Correct 5 ms 5708 KB Output is correct
29 Correct 4 ms 5708 KB Output is correct
30 Correct 4 ms 5708 KB Output is correct
31 Correct 6 ms 5708 KB Output is correct
32 Correct 4 ms 5708 KB Output is correct
33 Correct 4 ms 5836 KB Output is correct
34 Correct 3 ms 5836 KB Output is correct
35 Correct 3 ms 5708 KB Output is correct
36 Correct 4 ms 5836 KB Output is correct
37 Correct 3 ms 5836 KB Output is correct
38 Correct 4 ms 5836 KB Output is correct
39 Correct 4 ms 5708 KB Output is correct
40 Correct 3 ms 5836 KB Output is correct
41 Correct 3 ms 5708 KB Output is correct
42 Correct 3 ms 5836 KB Output is correct
43 Correct 3 ms 5768 KB Output is correct
44 Correct 6 ms 5708 KB Output is correct
45 Correct 6 ms 5708 KB Output is correct
46 Correct 5 ms 5708 KB Output is correct
47 Correct 5 ms 5708 KB Output is correct
48 Correct 5 ms 5708 KB Output is correct
49 Correct 7 ms 5788 KB Output is correct
50 Correct 3 ms 5836 KB Output is correct
51 Correct 3 ms 5836 KB Output is correct
52 Correct 5 ms 5836 KB Output is correct
53 Correct 5 ms 5800 KB Output is correct
54 Correct 3 ms 5836 KB Output is correct
55 Correct 5 ms 5836 KB Output is correct
56 Correct 4 ms 5836 KB Output is correct
57 Correct 3 ms 5836 KB Output is correct
58 Correct 3 ms 5836 KB Output is correct
59 Correct 3 ms 5836 KB Output is correct
60 Correct 4 ms 5836 KB Output is correct
61 Correct 3 ms 5836 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5708 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 3 ms 5708 KB Output is correct
7 Correct 3 ms 5708 KB Output is correct
8 Correct 3 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 5 ms 5708 KB Output is correct
11 Correct 4 ms 5708 KB Output is correct
12 Correct 4 ms 5688 KB Output is correct
13 Correct 3 ms 5708 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct
15 Correct 3 ms 5836 KB Output is correct
16 Correct 4 ms 5836 KB Output is correct
17 Correct 4 ms 5836 KB Output is correct
18 Correct 3 ms 5836 KB Output is correct
19 Correct 4 ms 5836 KB Output is correct
20 Correct 3 ms 5836 KB Output is correct
21 Correct 3 ms 5836 KB Output is correct
22 Correct 4 ms 5836 KB Output is correct
23 Correct 3 ms 5836 KB Output is correct
24 Correct 55 ms 20656 KB Output is correct
25 Correct 57 ms 20588 KB Output is correct
26 Correct 55 ms 20544 KB Output is correct
27 Correct 3 ms 5708 KB Output is correct
28 Correct 3 ms 5708 KB Output is correct
29 Correct 3 ms 5708 KB Output is correct
30 Correct 4 ms 5708 KB Output is correct
31 Correct 5 ms 5708 KB Output is correct
32 Correct 4 ms 5708 KB Output is correct
33 Correct 4 ms 5708 KB Output is correct
34 Correct 6 ms 5708 KB Output is correct
35 Correct 4 ms 5708 KB Output is correct
36 Correct 4 ms 5836 KB Output is correct
37 Correct 3 ms 5836 KB Output is correct
38 Correct 3 ms 5708 KB Output is correct
39 Correct 4 ms 5836 KB Output is correct
40 Correct 3 ms 5836 KB Output is correct
41 Correct 4 ms 5836 KB Output is correct
42 Correct 4 ms 5708 KB Output is correct
43 Correct 3 ms 5836 KB Output is correct
44 Correct 3 ms 5708 KB Output is correct
45 Correct 3 ms 5836 KB Output is correct
46 Correct 3 ms 5768 KB Output is correct
47 Correct 6 ms 5708 KB Output is correct
48 Correct 6 ms 5708 KB Output is correct
49 Correct 5 ms 5708 KB Output is correct
50 Correct 5 ms 5708 KB Output is correct
51 Correct 5 ms 5708 KB Output is correct
52 Correct 7 ms 5788 KB Output is correct
53 Correct 3 ms 5836 KB Output is correct
54 Correct 3 ms 5836 KB Output is correct
55 Correct 5 ms 5836 KB Output is correct
56 Correct 5 ms 5800 KB Output is correct
57 Correct 3 ms 5836 KB Output is correct
58 Correct 5 ms 5836 KB Output is correct
59 Correct 4 ms 5836 KB Output is correct
60 Correct 3 ms 5836 KB Output is correct
61 Correct 3 ms 5836 KB Output is correct
62 Correct 3 ms 5836 KB Output is correct
63 Correct 4 ms 5836 KB Output is correct
64 Correct 3 ms 5836 KB Output is correct
65 Correct 4 ms 5708 KB Output is correct
66 Correct 6 ms 5780 KB Output is correct
67 Correct 6 ms 5812 KB Output is correct
68 Correct 7 ms 5708 KB Output is correct
69 Correct 7 ms 5812 KB Output is correct
70 Correct 6 ms 6220 KB Output is correct
71 Correct 6 ms 6332 KB Output is correct
72 Correct 6 ms 6220 KB Output is correct
73 Correct 6 ms 6092 KB Output is correct
74 Correct 6 ms 6348 KB Output is correct
75 Correct 4 ms 6220 KB Output is correct
76 Correct 46 ms 16196 KB Output is correct
77 Correct 35 ms 17884 KB Output is correct
78 Correct 69 ms 19524 KB Output is correct
79 Correct 6 ms 5772 KB Output is correct
80 Correct 6 ms 5708 KB Output is correct
81 Correct 7 ms 5832 KB Output is correct
82 Correct 7 ms 5732 KB Output is correct
83 Correct 7 ms 5852 KB Output is correct
84 Correct 7 ms 6348 KB Output is correct
85 Correct 7 ms 6348 KB Output is correct
86 Correct 7 ms 6476 KB Output is correct
87 Correct 8 ms 6408 KB Output is correct
88 Correct 9 ms 6556 KB Output is correct
89 Correct 7 ms 6424 KB Output is correct
90 Correct 69 ms 20516 KB Output is correct
91 Correct 69 ms 20516 KB Output is correct
92 Correct 69 ms 20484 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5708 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 3 ms 5708 KB Output is correct
7 Correct 3 ms 5708 KB Output is correct
8 Correct 3 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 5 ms 5708 KB Output is correct
11 Correct 4 ms 5708 KB Output is correct
12 Correct 4 ms 5688 KB Output is correct
13 Correct 3 ms 5708 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct
15 Correct 3 ms 5836 KB Output is correct
16 Correct 4 ms 5836 KB Output is correct
17 Correct 4 ms 5836 KB Output is correct
18 Correct 3 ms 5836 KB Output is correct
19 Correct 4 ms 5836 KB Output is correct
20 Correct 3 ms 5836 KB Output is correct
21 Correct 3 ms 5836 KB Output is correct
22 Correct 4 ms 5836 KB Output is correct
23 Correct 3 ms 5836 KB Output is correct
24 Correct 55 ms 20656 KB Output is correct
25 Correct 57 ms 20588 KB Output is correct
26 Correct 55 ms 20544 KB Output is correct
27 Execution timed out 1592 ms 5836 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5708 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5708 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 3 ms 5708 KB Output is correct
7 Correct 3 ms 5708 KB Output is correct
8 Correct 3 ms 5708 KB Output is correct
9 Correct 5 ms 5708 KB Output is correct
10 Correct 5 ms 5708 KB Output is correct
11 Correct 4 ms 5708 KB Output is correct
12 Correct 4 ms 5688 KB Output is correct
13 Correct 3 ms 5708 KB Output is correct
14 Correct 4 ms 5708 KB Output is correct
15 Correct 3 ms 5836 KB Output is correct
16 Correct 4 ms 5836 KB Output is correct
17 Correct 4 ms 5836 KB Output is correct
18 Correct 3 ms 5836 KB Output is correct
19 Correct 4 ms 5836 KB Output is correct
20 Correct 3 ms 5836 KB Output is correct
21 Correct 3 ms 5836 KB Output is correct
22 Correct 4 ms 5836 KB Output is correct
23 Correct 3 ms 5836 KB Output is correct
24 Correct 55 ms 20656 KB Output is correct
25 Correct 57 ms 20588 KB Output is correct
26 Correct 55 ms 20544 KB Output is correct
27 Execution timed out 1592 ms 5836 KB Time limit exceeded
28 Halted 0 ms 0 KB -