oj.uz

Submission #735403

# Submission time Handle Problem Language Result Execution time Memory
735403 2023-05-04T05:20:24 Z Nahian9696 Painting Walls (APIO20_paint) C++17
28 / 100
 1500 ms 2416 KB 
#include "paint.h"

#include <iostream>
#include <iomanip>
#include <chrono>

#include <cmath>
#include <cstring>
#include <algorithm>


#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <string>
#include <vector>
#include <bitset>



using std::min;
using std::max;
using std::sort;
using std::swap;
using std::fixed;
using std::to_string;
using std::make_pair;
using std::upper_bound;
using std::lower_bound;
using std::setprecision;

using std::cin;
using std::cout;

using std::set;
using std::map;
using std::list;
using std::pair;
using std::less;
using std::tuple;
using std::stack;
using std::queue;
using std::deque;
using std::string;
using std::vector;
using std::bitset;
using std::greater;
using std::priority_queue;





typedef long double                         ld;
typedef unsigned                            ui;
typedef long long                           lli;
typedef unsigned long long                  ulli;
typedef vector<int32_t>                     vi;
typedef vector<ld>                          vld;
typedef vector<ui>                          vui;
typedef vector<lli>                         vlli;
typedef vector<ulli>                        vulli;
typedef list<int32_t>                       lsi;
typedef list<ld>                            lsld;
typedef list<ui>                            lsui;
typedef list<lli>                           lslli;
typedef list<ulli>                          lsulli;
typedef set<int32_t>                        si;
typedef set<ld>                             sld;
typedef set<ui>                             sui;
typedef set<lli>                            slli;
typedef set<ulli>                           sulli;

typedef pair<int32_t, int32_t>              pii;
typedef pair<lli, lli>                      pll;



// #define int                                 int64_t

#define endl                                "\n"
#define inp(n)                              int n; cin >> n
#define Inp(n)                              lli n; cin >> n
#define inpstr(s)                           string s; cin >> s
#define inp2(a,b)                           int a,b; cin >> a >> b
#define Inp2(a,b)                           lli a,b; cin >> a >> b
#define inparr(arr,n)                       int arr[n]; f0(t_ind, n) cin >> arr[t_ind]
#define Inparr(arr,n)                       lli arr[n]; f0(t_ind, n) cin >> arr[t_ind]

#define f0(i,n)                             for(int32_t i = 0; i <  (n); i++)
#define f1(i,n)                             for(int32_t i = 1; i <= (n); i++)
#define rep0(i,l,r)                         for(int32_t i=(l); i <  (r); i++)
#define rep1(i,l,r)                         for(int32_t i=(l); i <= (r); i++)

#define testIn                              cin >> test
#define tests                               for(int32_t testNo=1; testNo <= (test); testNo++)

#define all(x)                              (x).begin(), (x).end()
#define rall(x)                             (x).rbegin(), (x).rend()
#define asrt(v)                             sort(all(v))
#define dsrt(v)                             sort(rall(v))
#define revStr(str)                         string(rall(str))
#define len(a)                              ((int64_t)(a).size())
#define front_zero(n)                       __builtin_clzll(n)
#define back_zero(n)                        __builtin_ctzll(n)
#define total_one(n)                        __builtin_popcountll(n)
#define lcm(a, b)                           (((a)*(b))/gcd(a,b))
#define mem(a, b)                           memset(a, b, sizeof(a))

#define pb                                  push_back
#define pf                                  push_front
#define mp                                  make_pair
#define ff                                  first
#define ss                                  second

#define yes                                 cout << "yes" << endl
#define no                                  cout << "no" << endl
#define Yes                                 cout << "Yes" << endl
#define No                                  cout << "No" << endl
#define YES                                 cout << "YES" << endl
#define NO                                  cout << "NO" << endl
#define finish                              return 0
#define clean                               fflush(stdout)

#define Inf                                 (int32_t)(1e9)
#define INF                                 (lli)(1e18)
#define Eps                                 (ld)(1e-9)
#define EPS                                 (ld)(1e-18)
#define PI                                  (ld)(3.141592653589793238462643383279502884197169L)
#define MOD                                 (int32_t)(1e9+7)
#define MXN                                 (int32_t)(1e5+7)



int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B) {

    // vector<si> B(M);
    // f0(i, M) {
    //     for(int c: bbb[i]) B[i].insert(c);
    // }
    
    bool valid[N] = {0};

    f0(st, M) {
        int lstbreak = -1;
        f0(i, N) {
            // int color = C[i];
            auto it = lower_bound(B[(st+i)%M].begin(), B[(st+i)%M].end(), C[i]);
            if (it == B[(st+i)%M].end()) {
                lstbreak = i;
            } else if ((*it) != C[i]) {
                lstbreak = i;
            }
            if(i - lstbreak >= M) {
                valid[i - M + 1] = true;
            }
        }
    }

    int lstvalid[N];
    int cur = -1, ans = 0;

    f0(i, N) {
        if(valid[i]) {
            cur = i;
        }
        lstvalid[i] = cur;
    }

    cur = 0;
    while(cur < N) {
        if(lstvalid[cur] == -1) return -1;
        if(lstvalid[cur] < cur - M + 1) return -1;
        ans++;
        cur = lstvalid[cur] + M;
    }

    return ans;

    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 3 ms 304 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 3 ms 308 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 16 ms 1636 KB Output is correct
23 Correct 18 ms 1644 KB Output is correct
24 Correct 18 ms 1644 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 3 ms 564 KB Output is correct
30 Correct 4 ms 468 KB Output is correct
31 Correct 1053 ms 984 KB Output is correct
32 Correct 1057 ms 996 KB Output is correct
33 Correct 1042 ms 984 KB Output is correct
34 Correct 1080 ms 980 KB Output is correct
35 Correct 1100 ms 980 KB Output is correct
36 Correct 1091 ms 988 KB Output is correct
37 Execution timed out 1548 ms 2004 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 304 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 3 ms 308 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 16 ms 1636 KB Output is correct
25 Correct 18 ms 1644 KB Output is correct
26 Correct 18 ms 1644 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 296 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 2 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 2 ms 212 KB Output is correct
40 Correct 2 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 300 KB Output is correct
44 Correct 2 ms 300 KB Output is correct
45 Correct 2 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 296 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 2 ms 212 KB Output is correct
54 Correct 3 ms 336 KB Output is correct
55 Correct 3 ms 328 KB Output is correct
56 Correct 3 ms 212 KB Output is correct
57 Correct 3 ms 212 KB Output is correct
58 Correct 2 ms 212 KB Output is correct
59 Correct 3 ms 212 KB Output is correct
60 Correct 3 ms 212 KB Output is correct
61 Correct 4 ms 212 KB Output is correct
62 Correct 3 ms 212 KB Output is correct
63 Correct 4 ms 212 KB Output is correct
64 Correct 3 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 5 ms 460 KB Output is correct
71 Correct 4 ms 468 KB Output is correct
72 Correct 3 ms 456 KB Output is correct
73 Correct 2 ms 312 KB Output is correct
74 Correct 3 ms 340 KB Output is correct
75 Correct 4 ms 340 KB Output is correct
76 Correct 13 ms 1816 KB Output is correct
77 Correct 11 ms 1876 KB Output is correct
78 Correct 15 ms 2160 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 2 ms 300 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 2 ms 212 KB Output is correct
83 Correct 2 ms 212 KB Output is correct
84 Correct 8 ms 468 KB Output is correct
85 Correct 9 ms 436 KB Output is correct
86 Correct 7 ms 468 KB Output is correct
87 Correct 7 ms 512 KB Output is correct
88 Correct 7 ms 468 KB Output is correct
89 Correct 6 ms 440 KB Output is correct
90 Correct 21 ms 2348 KB Output is correct
91 Correct 22 ms 2416 KB Output is correct
92 Correct 24 ms 2388 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 304 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 3 ms 308 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 16 ms 1636 KB Output is correct
25 Correct 18 ms 1644 KB Output is correct
26 Correct 18 ms 1644 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 3 ms 564 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 1053 ms 984 KB Output is correct
34 Correct 1057 ms 996 KB Output is correct
35 Correct 1042 ms 984 KB Output is correct
36 Correct 1080 ms 980 KB Output is correct
37 Correct 1100 ms 980 KB Output is correct
38 Correct 1091 ms 988 KB Output is correct
39 Execution timed out 1548 ms 2004 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 304 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 3 ms 308 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 16 ms 1636 KB Output is correct
25 Correct 18 ms 1644 KB Output is correct
26 Correct 18 ms 1644 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 3 ms 564 KB Output is correct
32 Correct 4 ms 468 KB Output is correct
33 Correct 1053 ms 984 KB Output is correct
34 Correct 1057 ms 996 KB Output is correct
35 Correct 1042 ms 984 KB Output is correct
36 Correct 1080 ms 980 KB Output is correct
37 Correct 1100 ms 980 KB Output is correct
38 Correct 1091 ms 988 KB Output is correct
39 Execution timed out 1548 ms 2004 KB Time limit exceeded
40 Halted 0 ms 0 KB -