oj.uz

Submission #395532

# Submission time Handle Problem Language Result Execution time Memory
395532 2021-04-28T12:55:36 Z ankhbayar06 Painting Walls (APIO20_paint) C++14
0 / 100
 4 ms 4940 KB 
#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define mk make_pair

ll l,i,j,n,m,k,x,o[2000000],b[2000000],c[2000000],s,ans;
vector<int> a[200000];

int minimumInstructions (int N, int M, int K, std::vector< int> C, std::vector<int> A, std::vector< std::vector<int >> B){
	n=N;
	m=M;
	k=K;
	l=0;
	int sz=B.size();
	for(i=0 ; i<sz ; i++){
		if(A[l]>0){
			a[l].pb(b[i]);
			A[l]--;
		}
		else{
			l++;
		}
	}
	for(i=0 ; i<n ; i++){
		b[i]=1;
		for(l=0 ; l<m ; l++){
			k=1;
			sz=a[l].size();
			for(j=0 ; j<sz ; j++){
				if(a[l][j]==C[(i+l)%n])k=0;
			}
			if(k==1)b[i]=0;
		}
	}
	l=0;
	for(i=0 ; i<n ; i++){
		if(b[i]==0)l++;
		else{
			s=max(s,l);
			l=0;
		}
	}
	s=max(s,l);
	if(s>=m){
		return -1;
	}
	else{
		ans=0;
		l=0;
		while(i<n){
			if(b[i]==1)l=i;
			o[i]=l;
		}
		for(i=0 ; i<n ; i++){
			ans++;
			x=o[i];
			if(x+M-1<=i)return -1;
			i=x+m-1;
		}
		return ans;
	}
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Output isn't correct
2 Halted 0 ms 0 KB -