# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
576439 | pooyashams | Painting Walls (APIO20_paint) | C++14 | 355 ms | 13388 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 <vector>
using namespace std;
const int maxn = 1e5+10;
vector<int> wrks[maxn];
int dp[2][maxn];
bool cann[maxn];
int lcnn[maxn];
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B)
{
for(int i = 0; i < M; i++)
for(int c: B[i])
wrks[c].push_back(i);
bool f = !(N&1);
for(int j: wrks[C[N-1]])
{
dp[f][j] = 1;
if(dp[f][j] == M)
cann[N-1] = true;
}
for(int i = N-2; i >= 0; i--)
{
f = !f;
int p = 0;
# | 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... |