# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293394 | daniel920712 | Painting Walls (APIO20_paint) | C++14 | 353 ms | 14456 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 <vector>
#include <stdio.h>
#include <queue>
#include <unordered_map>
using namespace std;
pair < int , int > r[5][100005];
int rr[100005];
int DP[100005];
int cha[100005];
vector < int > all;
vector < int > how[100005];
int N,M;
queue < pair < int , int > > now;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A,vector< vector<int> > B)
{
int i,j,ok;
::N=N;
::M=M;
for(i=0;i<M;i++) for(j=0;j<A[i];j++) how[B[i][j]].push_back(i);
for(i=0;i<M;i++)
{
r[0][i]=make_pair(0,N+1);
r[1][i]=make_pair(0,N+1);
}
for(i=N-1;i>=0;i--)
{
rr[i]=-1e9;
for(auto j:how[C[i]])
{
r[i%2][j]=make_pair(i,i);
if(i!=N-1&&r[1-i%2][(j+1)%M].second==i+1) r[i%2][j].first=max(i,r[1-i%2][(j+1)%M].first);
rr[i]=max(rr[i],r[i%2][j].first);
}
}
now.push(make_pair(0,N));
for(i=N-1;i>=0;i--)
{
ok=0;
DP[i]=1e9;
while(!now.empty()&&now.front().second-i>M) now.pop();
if(i+M>N) continue;
else
{
if(rr[i]>=i+M-1)
{
if(now.empty()) DP[i]=1e9;
else
{
DP[i]=now.front().first+1;
now.push(make_pair(DP[i],i));
}
}
}
}
int t=DP[0];
if(t>=1000000000) return -1;
return t;
}
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... |