oj.uz

Submission #395920

# Submission time Handle Problem Language Result Execution time Memory
395920 2021-04-29T08:03:46 Z ankhbayar06 Painting Walls (APIO20_paint) C++14
0 / 100
 6 ms 9676 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

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

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<m ; i++){
		for(l=0 ; l<B[i].size() ; l++){
			a[i].pb(B[i][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;
		}
	}
	for(i=0 ; i<n ; i++){
		cout<<b[i]<<" ";
	}
	cout<<endl;
	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;
	}
}

/*int main(){
	ll q;
	cin>>n>>m>>k;
	for(i=0 ; i<n ; i++){
		cin>>q;
		A.push_back(q);
	}
	for(i=0 ; i<m ; i++){
		cin>>q;
		C.push_back(q);
	}
	for(i=0 ; i<m ; i++){
		for(l=0 ; l<C[i] ; l++){
			cin>>q;
			w[i].push_back(q);
		}
		B.push_back(w[i]);
	}
	cout<<minimumInstructions(n,m,k,A,C,B); 
}
*/

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:21:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   for(l=0 ; l<B[i].size() ; l++){
      |             ~^~~~~~~~~~~~

Subtask #1
0 / 12.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 37.0

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