Submission #1161784

#TimeUsernameProblemLanguageResultExecution timeMemory
1161784The_SamuraiPainting Walls (APIO20_paint)C++20
0 / 100
0 ms328 KiB
#include "paint.h" #include "bits/stdc++.h" using namespace std; int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> ln, vector<vector<int>> g) { vector<int> owner(k, -1); for (int i = 0; i < m; i++) { for (int x: g[i]) owner[x] = i; } vector<int> does(n); for (int i = 0; i < n; i++) { if (owner[c[i]] == -1) return -1; does[i] = owner[c[i]]; } set<int> st; for (int i = 0; i < m; i++) st.insert(owner[i]); for (int i = m; i < n; i++) { if (owner[i] != owner[i - m]) return -1; } if (st.size() != m) return -1; return (n + m - 1) / 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...