Submission #399337

#TimeUsernameProblemLanguageResultExecution timeMemory
399337CollypsoPainting Walls (APIO20_paint)C++17
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define vt vector #define pb push_back #define all(x) (x).begin(), (x).end() #define sz(x) (int) (x).size() #define print(x) cout << x << endl #pragma GCC optimize ("O3") #pragma GCC optimize ("O2") //#define endl '\n' //#define int long long using namespace std; int minimumInstructions(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B) { vt<int> dp(N); int i = 0; while(i <= N - M) { if (i > 0 && !dp[i - 1]) continue; int mx_j = -1; for(int master = 0; master < M; master++) { int m = master; int j = i; while(j < N) { int tmp = lower_bound(all(B[m]), C[j]) - B[m].begin(); if (B[m][tmp] != C[j]) break; m = (m + 1) % M; j++; } if (j - i + 1 < M) continue; mx_j = max(mx_j, j); //int tmp = i > 0 ? dp[i - 1] : 0; //dp[mx_j] = !dp[mx_j] ? (mx_j - i + M) / M + tmp : min(dp[j], (mx_j - i + M) / M + tmp); } if (mx_j == -1) return -1; int tmp = i > 0 ? dp[i - 1] : 0; dp[mx_j] = !dp[mx_j] ? (mx_j - i + M) / M + tmp : min(dp[mx_j], (mx_j - i + M) / M + tmp); i = mx_j + 1; } if (dp[N - 1]) return dp[N - 1]; return -1; } /** main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int ans = minimumInstructions(6, 4, 4, {2, 1, 0, 3, 2, 1}, {3}, {{2}, {1}, {0}, {3}}); print(ans); } /**/

Compilation message (stderr)

paint.cpp:60:1: warning: "/*" within comment [-Wcomment]
   60 | /**/
      |
#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...