Submission #410352

#TimeUsernameProblemLanguageResultExecution timeMemory
410352Carmel_Ab1Painting Walls (APIO20_paint)C++17
0 / 100
1 ms204 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...