# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365663 | sean617 | Painting Walls (APIO20_paint) | C++17 | 1098 ms | 22144 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "paint.h"
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#define N 100005
using namespace std;
vector<int> co[N], a[300000], a1, a2;
int v[N], s[N];
bool po[N];
int minimumInstructions(int n, int m, int l, vector<int> c, vector<int> sz, vector<std::vector<int>> b) {
int i, ii, ans, j, t, t2, z;
for (i = 0; i < m; i++) {
for (j = 0; j < sz[i]; j++) {
co[b[i][j]].push_back(i);
// v[b[i][j]].insert(i);
}
}
memset(v, -1, sizeof(v));
for (i = 0; i < co[c[0]].size(); i++) {
v[co[c[0]][i]] = 0;
s[co[c[0]][i]] = 1;
if (m == 1) po[0] = 1;
}
for (i = 1; i < n; i++) {
t = c[i];
a1.clear();
a2.clear();
for (j = 0; j < co[t].size(); j++) {
Compilation message (stderr)
# | 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... |