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 <bits/stdc++.h>
#include "paint.h"
//#include "grader.cpp"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) x.begin(),x.end()
#define pb push_back
#define umap unordered_map
int ceil(int a,int b){
int ans=b/a;
if(a%b)ans++;
return ans;
}
int minimumInstructions(int N, int M, int K, vi C,vi A, vvi B) {
int ix=-1;
for(int i=0; i<M;i++)
sort(all(B[i]));
for(int i=0; i<M; i++)
if(binary_search(all(B[i]),C[0]))
ix=i;
if(ix==-1)return -1;
for(int i=0; i<N; i++)
if(!binary_search(all(B[(i+ix)%M]),C[i]))
return -1;
return ceil(N,M);
}
# | 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... |