# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569787 | aryan12 | Painting Walls (APIO20_paint) | C++17 | 1 ms | 212 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 <bits/stdc++.h>
using namespace std;
int minimumInstructions(int N, int M, int K, vector<int> colors, vector<int> num, vector<vector<int> > likes)
{
vector<vector<int> > dp(N, vector<int> (M, -1e9));
set<int> likings[M];
for(int contractor = 0; contractor < M; contractor++)
{
for(int j = 0; j < num[contractor]; j++)
{
likings[contractor].insert(likes[contractor][j]);
}
}
for(int i = N - 1; i >= 0; i--)
{
for(int j = 0; j < M; j++)
{
if(likings[j].count(colors[i]))
{
if(i == N - 1 || dp[i + 1][(j + 1) % M] == -1e9)
{
dp[i][j] = 1;
}
else
{
dp[i][j] = dp[i + 1][(j + 1) % M] + 1;
dp[i][j] %= M;
}
}
else
{
continue;
}
}
}
vector<int> start_pos;
for(int i = N - M; i >= 0; i--)
{
for(int j = 0; j < M; j++)
{
if(dp[i][j] == 0)
{
start_pos.push_back(i);
break;
}
}
}
int ans = 0;
int min_x = N - 1;
for(int i = 0; i < start_pos.size(); i++)
{
if(i == start_pos.size() - 1 || start_pos[i + 1] + M - 1 < min_x)
{
min_x = start_pos[i];
ans++;
}
}
return ans + 1;
}
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... |