| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350503 | aaaaaaaa | Painting Walls (APIO20_paint) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
vector<int> x(K, -1);
for(int i = 0; i < M; ++i){
for(int j = 0; j < A[i]; ++j){
x[B[i][j]] = i;
}
}
vector<int> ord(N, -1);
for(int i = 0; i < N; ++i){
if(x[C[i]] == -1){
return 0;
}else{
ord[i] = x[C[i]];
}
}
for(int i = 0; i < N; ++i){
if(i && ord[i] < ord[i - 1]){
for(int j = i + 1; j < N; ++j){
if(ord[j] < ord[j - 1]){
return 0;
}
}
return 2;
}
}
return 1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
