#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define sz(v) (int)v.size()
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
const int MAXN = 1e5+7;
int n, m, k;
int color[MAXN], can[MAXN], L[MAXN];
pii last[2][MAXN];
vector <int> isLikedBy[MAXN];
int g(int i) {
if (i >= n) return 0;
else if (i - L[i] >= m) return 1e9;
return 1+g(L[i]+m);
}
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
n = N; m = M; k = K;
for (int i = 0; i < n; i++) color[i] = C[i];
for (int i = 0; i < m; i++) {
for (auto to : B[i]) {
isLikedBy[to].pb(i);
}
}
for (int i = n-1; i >= 0; i--) {
int type = (i & 1 ? 1 : 0);
for (int j = 0; j < sz(isLikedBy[color[i]]); j++) {
auto to = isLikedBy[color[i]][j];
if (i == n-1) {
last[type][to] = mp(i, i);
}
else {
if (last[type^1][(to+1 >= m ? to+1-m : to+1)].first != i+1) {
last[type][to] = mp(i, i);
}
else {
if (last[type^1][(to+1 >= m ? to+1-m : to+1)].second-i >= m-1) {
can[i] = 1;
}
last[type][to] = mp(i, last[type^1][(to+1 >= m ? to+1-m : to+1)].second);
}
}
}
}
int prev = -1e9;
for (int i = 0; i < n; i++) {
if (can[i]) prev = i;
L[i] = prev;
}
auto ans = g(0);
return (ans >= 1e8 ? -1 : ans);
}
/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |