QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#544513 | #435. Painting Walls | makrav | 100 ✓ | 8ms | 9488kb | C++20 | 1.0kb | 2024-09-02 17:58:25 | 2024-09-02 17:58:25 |
Judging History
answer
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions(
int N, int M, int K, std::vector<int> C,
std::vector<int> A, std::vector<std::vector<int>> B) {
vector<vector<int>> by_color(K);
for (int i = 0; i < M; i++) {
for (int j = 0; j < A[i]; j++) by_color[B[i][j]].push_back((M - i) % M);
}
vector<int> cnt(M), ans(N), used(M);
int cur = -1;
for (int i = 0; i < N; i++) {
cur++;
cur %= M;
for (int lol : by_color[C[i]]) {
int x = lol + cur;
if (x >= M) x -= M;
if (used[x] == i) cnt[x]++;
else cnt[x] = 1;
used[x] = i + 1;
if (cnt[x] >= M) ans[i - M + 1] = 1;
}
}
int gr = 0;
int answ = 0;
for (int i = 0; i < N && gr < N; i++) {
int mx = -1e9;
for (int j = i; j <= gr; j++) {
if (ans[j]) mx = j;
}
if (mx + M <= gr) return -1;
gr = mx + M;
answ++;
i = mx;
}
return answ;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Accepted
Test #1:
score: 0
Accepted
time: 0ms
memory: 4072kb
input:
1 1 1 0 1 0
output:
1
result:
ok single line: '1'
Subtask #2:
score: 0
Accepted
Test #22:
score: 0
Accepted
time: 8ms
memory: 9488kb
input:
500 200 100000 43773 40354 2348 52596 62314 89070 43591 1761 54688 6485 17304 56821 36 36327 32247 51209 74080 85034 19128 45821 41096 74616 95383 41097 42368 1703 71263 45273 86316 3332 86662 41554 26490 26341 48653 30964 66532 75488 33898 97982 27906 26546 14311 22085 6620 80880 55703 13418 59470 ...
output:
-1
result:
ok single line: '-1'
Subtask #3:
score: 0
Accepted
Test #25:
score: 0
Accepted
time: 0ms
memory: 4292kb
input:
20000 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
20000
result:
ok single line: '20000'
Subtask #4:
score: 0
Accepted
Test #40:
score: 0
Accepted
time: 5ms
memory: 4512kb
input:
90737 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
90737
result:
ok single line: '90737'
Subtask #5:
score: 0
Accepted
Test #67:
score: 0
Accepted
time: 0ms
memory: 4076kb
input:
2 2 1 0 0 1 0 1 0
output:
1
result:
ok single line: '1'
Subtask #6:
score: 0
Accepted
Test #105:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
253 186 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
2
result:
ok single line: '2'
Subtask #7:
score: 0
Accepted
Test #133:
score: 0
Accepted
time: 1ms
memory: 3956kb
input:
19884 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
9942
result:
ok single line: '9942'
Subtask #8:
score: 0
Accepted
Test #177:
score: 0
Accepted
time: 4ms
memory: 4356kb
input:
61996 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
output:
30998
result:
ok single line: '30998'
Subtask #9:
score: 12
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Dependency #4:
100%
Accepted
Subtask #10:
score: 15
Accepted
Dependency #1:
100%
Accepted
Dependency #5:
100%
Accepted
Subtask #11:
score: 13
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #5:
100%
Accepted
Dependency #6:
100%
Accepted
Subtask #12:
score: 23
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Dependency #5:
100%
Accepted
Dependency #6:
100%
Accepted
Dependency #7:
100%
Accepted
Subtask #13:
score: 37
Accepted
Dependency #1:
100%
Accepted
Dependency #2:
100%
Accepted
Dependency #3:
100%
Accepted
Dependency #4:
100%
Accepted
Dependency #5:
100%
Accepted
Dependency #6:
100%
Accepted
Dependency #7:
100%
Accepted
Dependency #8:
100%
Accepted
Dependency #9:
100%
Accepted
Dependency #10:
100%
Accepted
Dependency #11:
100%
Accepted
Dependency #12:
100%
Accepted
Extra Test:
score: 0
Extra Test Passed