oj.uz

답안 #735425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735425 2023-05-04T05:48:15 Z Nahian9696 벽 칠하기 (APIO20_paint) C++17
12 / 100
 37 ms 8684 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 likedby[100005];
// int likedby2[100005];


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

    bool valid[N] = {0};    
    int lstvalid[N];
    int cur = -1, ans = 0;


    f0(i, 100005) likedby[i] = -1;
    f0(i, M) {
        f0(j, A[i]) {
            likedby[B[i][j]] = i;
        }
    }


    f0(i, N) {
        if(likedby[C[i]] == -1) return -1;
        if(i % M != 0) {
            int df = likedby[C[i]] - likedby[C[i-1]];
            df %= M;
            df += M;
            df %= M;
            if(df != 1) {
                return -1;
            }
        }
    }

    // cur = 0;
    // while(cur < N) {
    //     if(lstvalid[cur] == -1) return -1;
    //     if(lstvalid[cur] < cur - M + 1) return -1;
    //     ans++;
    //     cur = lstvalid[cur] + M;
    // }
    if(N % M == 0) {
        return N/M;
    }
    int i = N/M;
    i *= M;
    int df = likedby[C[i]] - likedby[C[i-1]];
    df %= M;
    df += M;
    df %= M;
    if(df != 1) {
        return -1;
    }

    return (int)((N+M-1)/M);



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

    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;
            }
        }
    }


    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
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 10 ms 1492 KB Output is correct
23 Correct 15 ms 1488 KB Output is correct
24 Correct 15 ms 1444 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 2 ms 852 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 5 ms 1108 KB Output is correct
32 Correct 4 ms 1108 KB Output is correct
33 Correct 5 ms 1108 KB Output is correct
34 Correct 5 ms 1108 KB Output is correct
35 Correct 6 ms 1164 KB Output is correct
36 Correct 4 ms 1108 KB Output is correct
37 Correct 12 ms 1748 KB Output is correct
38 Correct 14 ms 2372 KB Output is correct
39 Correct 11 ms 2412 KB Output is correct
40 Correct 11 ms 1600 KB Output is correct
41 Correct 5 ms 1236 KB Output is correct
42 Correct 8 ms 1728 KB Output is correct
43 Correct 5 ms 1348 KB Output is correct
44 Correct 5 ms 1236 KB Output is correct
45 Correct 8 ms 1716 KB Output is correct
46 Correct 28 ms 8188 KB Output is correct
47 Correct 26 ms 4684 KB Output is correct
48 Correct 25 ms 7204 KB Output is correct
49 Correct 36 ms 6604 KB Output is correct
50 Correct 23 ms 6220 KB Output is correct
51 Correct 17 ms 4428 KB Output is correct
52 Correct 9 ms 1728 KB Output is correct
53 Correct 8 ms 1760 KB Output is correct
54 Correct 8 ms 1748 KB Output is correct
55 Correct 9 ms 1724 KB Output is correct
56 Correct 8 ms 1672 KB Output is correct
57 Correct 8 ms 1668 KB Output is correct
58 Correct 33 ms 8620 KB Output is correct
59 Correct 37 ms 8652 KB Output is correct
60 Correct 30 ms 8620 KB Output is correct
61 Correct 29 ms 8620 KB Output is correct
62 Correct 31 ms 8684 KB Output is correct
63 Correct 33 ms 8616 KB Output is correct
64 Correct 31 ms 7796 KB Output is correct
65 Correct 33 ms 7840 KB Output is correct
66 Correct 33 ms 7848 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Incorrect 1 ms 596 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -