#include <bits/stdc++.h>
using namespace std;
#define V vector<int>
int minimumInstructions(int N, int M, int K, V C, V A, vector<V> B) {
V g[K], x(M), y(M), dp(N+1);
int ans = 0, i, j;
for(i = 0; i < M; i++)
for(int &s : B[i]) g[s].push_back(i);
for(i = N; --i >= 0; x.swap(y)) {
if(i+2 < N)
for(int s : g[C[i+2]]) x[s] = 0;
for(int s : g[C[i]])
if((x[s] = 1 + y[(s + 1) % M]) >= M) dp[i] = 1;
}
for(dp[N] = dp[i=0]; i < N; i = j, ans++)
for(j = min(N, i+M); j >= i && !dp[j]; --j)
if(i == j) return -1;
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Execution timed out |
1578 ms |
204 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Execution timed out |
1578 ms |
204 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Execution timed out |
1578 ms |
204 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Execution timed out |
1578 ms |
204 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Execution timed out |
1578 ms |
204 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |