Submission #387128

#TimeUsernameProblemLanguageResultExecution timeMemory
387128talant117408Painting Walls (APIO20_paint)C++17
0 / 100
3 ms2668 KiB
#include "paint.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <ll, ll> pll; #define sz(v) (int)v.size() #define pb push_back #define mp make_pair #define all(v) v.begin(), v.end() const int MAXN = 1e5+7; int n, m, k; int color[MAXN]; vector <int> isLiked[MAXN]; int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) { n = N; m = M; k = K; for (int i = 0; i < n; i++) color[i] = C[i]; for (int i = 0; i < m; i++) { for (auto to : B[i]) { isLiked[to].pb(i); } } int fk = 0; for (int i = 0; i < k; i++) { fk = max(fk, sz(isLiked[i])); } if (fk < 2) { int flag = 1; for (int i = 0; i+m < n; i++) { if (color[i] != color[i+m]) flag = 0; } if (flag) return (n+m-1)/m; else return -1; } return 0; }
#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...