제출 #397565

#제출 시각아이디문제언어결과실행 시간메모리
397565Collypso벽 칠하기 (APIO20_paint)C++17
0 / 100
1 ms272 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 FOR(i, a, b) for(int i = a; i <= b; i++) #define EACH(x, a) for (auto& x : a) #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 subtask1(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B) { map<int, int> MP; FOR(i, 0, M - 1) { MP[B[i][0]] = i + 1; } int ans = 0; FOR(i, 0, N - 1) { //print(i); //print(ans); if (i > N - M) return -1; int j = MP[C[i]] - 1; if (j == -1) return -1; int k = j; FOR(l, 1, N - i - 1) { if (B[(j + l) % M][0] != C[i + l]) { k = i + l - 1; break; } else if (l == N - i - 1) { k = i + l; } } ans += (k - i + 1 + (K - 1)) / K; i = k; } return ans; } int minimumInstructions(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B) { bool sub1 = 1; FOR(i, 0, M - 1) { if (A[i] != 1) { sub1 = 0; break; } } if (sub1) return subtask1(N, M, K, C, A, B); } /** main() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); int ans = minimumInstructions(10, 4, 4, {1, 0, 3, 2, 1, 0, 2, 1, 0, 3}, {1, 1, 1, 1}, {{2}, {1}, {0}, {3}}); print(ans); } /**/

컴파일 시 표준 에러 (stderr) 메시지

paint.cpp:73:1: warning: "/*" within comment [-Wcomment]
   73 | /**/
      |  
paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^
#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...