# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935191 | MinaRagy06 | Painting Walls (APIO20_paint) | C++17 | 1262 ms | 84040 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 <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "paint.h"
using namespace std;
#define ll long long
const int M = 50'005;
vector<int> gud[2 * M + 5];
int minimumInstructions(int n, int m, int K, vector<int> a, vector<int> sz, vector<vector<int>> b) {
vector<int> col[K];
for (int i = 0; i < m; i++) {
for (auto j : b[i]) {
col[j].push_back(i);
}
}
vector<int> diff[n];
for (int i = 0; i < n; i++) {
for (auto j : col[a[i]]) {
gud[i - j + M].push_back(i);
// diff[i].push_back(i - j);
}
// sort(diff[i].begin(), diff[i].end());
}
int dp[n + 1]{};
dp[n] = 0;
for (int i = n - 1; i > n - m; i--) {
dp[i] = 1e9;
}
multiset<int> cur;
for (int i = n - m + 2; i <= n; i++) {
cur.insert(dp[i]);
}
for (int i = n - m; i >= 0; i--) {
cur.insert(dp[i + 1]);
if (i + m + 1 <= n) {
cur.erase(cur.find(dp[i + m + 1]));
}
dp[i] = 1e9;
bool ok = 0;
for (auto j : col[a[i]]) {
bool ok2 = 1;
int st = i + m - j;
int s = lower_bound(gud[i - j + M].begin(), gud[i - j + M].end(), i) - gud[i - j + M].begin();
int e = lower_bound(gud[i - j + M].begin(), gud[i - j + M].end(), st - 1) - gud[i - j + M].begin();
ok2 &= e - s + 1 == st - i;
ok2 &= e < gud[i - j + M].size() && gud[i - j + M][e] == st - 1 && gud[i - j + M][s] == i;
if (st <= i + m - 1) {
s = lower_bound(gud[st + M].begin(), gud[st + M].end(), st) - gud[st + M].begin();
e = lower_bound(gud[st + M].begin(), gud[st + M].end(), i + m - 1) - gud[st + M].begin();
ok2 &= e - s + 1 == i + m - st;
ok2 &= e < gud[st + M].size() && gud[st + M][e] == i + m - 1 && gud[st + M][s] == st;
}
ok |= ok2;
}
if (ok) {
dp[i] = *cur.begin() + 1;
}
}
if (dp[0] >= (int)1e9) return -1;
return dp[0];
}
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... |