Submission #967036

#TimeUsernameProblemLanguageResultExecution timeMemory
967036steveonalexPainting Walls (APIO20_paint)C++17
100 / 100
601 ms262356 KiB
#include <bits/stdc++.h> #include "paint.h" using namespace std; typedef long long ll; typedef unsigned long long ull; #define ALL(v) (v).begin(), (v).end() #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) // mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rng(1); ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;} ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll LASTBIT(ll mask){return mask & (-mask);} ll pop_cnt(ll mask){return __builtin_popcountll(mask);} ll ctz(ll mask){return __builtin_ctzll(mask);} ll clz(ll mask){return __builtin_clzll(mask);} ll logOf(ll mask){return 63 - clz(mask);} template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b){a = b; return true;} return false; } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b){a = b; return true;} return false; } template <class T> void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){ for(auto i: a) out << i << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } const int N = 1e5 + 69; int n, m, k; int minimumInstructions(int _n, int _m, int _k, vector<int> C, vector<int> A, vector<vector<int>> B) { n = _n, m = _m, k = _k; vector<vector<int>> color(k); for(int i = 0; i<m; ++i){ for(int j: B[i]){ color[j].push_back(i); } } vector<vector<int>> constrictor(m); for(int i = 0; i<n; ++i) { int sigma = m - i % m; for(int j: color[C[i]]){ constrictor[(j + sigma) % m].push_back(i); } } vector<int> check(n); for(vector<int> a: constrictor){ for(int i = 0; i+m <= a.size(); ++i){ if (a[i] + m - 1 == a[i + m - 1]) { check[a[i]] = 1; } } } vector<int> edging; for(int i = 0; i<n; ++i) if (check[i]) edging.push_back(i); if (edging.empty() || edging[0] != 0 || edging.back() < n - m) return -1; int x = 0; int ans = 0; while(x < n-m){ ans++; int y = upper_bound(ALL(edging), x + m) - edging.begin() - 1; y = edging[y]; if (x == y) return -1; x = y; } ans++; return ans; } // int main(void){ // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // int n, m, k; cin >> n >> m >> k; // vector<int> C(n); // for(int i = 0; i<n; ++i) cin >> C[i]; // vector<int> A(m); // vector<vector<int>> B(m); // for(int i = 0; i<m; ++i){ // cin >> A[i]; // B[i].resize(A[i]); // for(int j = 0; j < A[i]; ++j) // cin >> B[i][j]; // } // cout << minimumInstructions(n, m, k, C, A, B) << "\n"; // return 0; // } /* 8 3 5 3 3 1 3 4 4 2 2 3 0 1 2 2 2 3 2 3 4 */

Compilation message (stderr)

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:69:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i = 0; i+m <= a.size(); ++i){
      |                        ~~~~^~~~~~~~~~~
#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...