제출 #744856

#제출 시각아이디문제언어결과실행 시간메모리
744856arush_agu벽 칠하기 (APIO20_paint)C++17
컴파일 에러
0 ms0 KiB
#include <algorithm> #include <cctype> #include <cmath> #include <cstdio> #include <cstring> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> #ifdef DEBUG #include <time.h> #endif #define all(a) (a).begin(), (a).end() #define rev(a) (a).rbegin(), (a).rend() #define F first #define S second int recur_depth = 0; #ifdef DEBUG #define dbg(x) \ { \ ++recur_depth; \ auto x_ = x; \ --recur_depth; \ cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \ << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \ } #else #define dbg(x) #endif using namespace std; using namespace __gnu_pbds; typedef pair<int, int> ii; typedef long long ll; typedef long double ld; typedef pair<ll, ll> llll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pair<int, int>> vii; typedef vector<vii> vvii; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<pair<ll, ll>> vll; typedef vector<vll> vvll; typedef vector<bool> vb; template <class type1> using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag, tree_order_statistics_node_update>; template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; } template <typename T_container, typename T = typename enable_if< !is_same<T_container, string>::value, typename T_container::value_type>::type> ostream &operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; } const ll MOD = 1e9 + 7; // const ll MOD = 998244353; const ll INF = 1e9; const ld EPS = 1e-9; int minimumInstructions(int n, int m, int k, vi c, vi a, vvi b) { for (int i=0; i<m; i++) sort(all(b[i])); vb poss(n); vector<vb> bb(m, vb(k)); for (int i=0; i<m; i++) { for (int co : b[i]) bb[i][co] = 1; } vvi col(k); for (int i=0; i<m; i++) for (int &c : b[i]) col[c].push_back(i); // cerr << col << "\n"; for (int i=0; i + m<=n; i++) { for (int con_id : col[c[i]]) { int cid = con_id; bool flag = 0; for (int j=i; j<i+m; j++) { if (!bb[cid][c[j]]) { flag = 1; break; } if (++cid == m) cid = 0; } if (!flag) { poss[i] = 1; break; } } } // cerr << poss << "\n"; vi painted(n); for (int i=0; i<n; i++) if (poss[i]) { for (int j=i; j<i+m; j++) painted[j] = 1; } // cerr << painted << "\n"; int cnt = accumulate(all(painted), 0); if (cnt < n) return -1; assert(1 == 2); int ans = 0; int idx = 0; while (idx < n) { while (!poss[idx]) idx--; idx += m; ans++; } return ans; } void solve() { int n, m, k; cin >> n >> m >> k; vi c(n); for (int &x : c) cin >> x; vi a(m); vvi b(m); for (int i=0; i<m; i++) { cin >> a[i]; for (int j=0; j<a[i]; j++) { int x; cin >> x; b[i].push_back(x); } } cerr << n << " " << m << " " << k << "\n"; cerr << c << "\n"; cerr << a << "\n"; cerr << b << "\n"; cout << minimumInstructions(n, m, k, c, a, b) << "\n"; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); clock_t start = clock(); int test_cases = 1; /* cin >> test_cases; */ while (test_cases--) solve(); #ifdef DEBUG cerr << fixed << setprecision(10) << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC << "s\n"; #endif return 0; }

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

paint.cpp: In function 'int main()':
paint.cpp:172:11: warning: unused variable 'start' [-Wunused-variable]
  172 |   clock_t start = clock();
      |           ^~~~~
/usr/bin/ld: /tmp/ccqzy4bl.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccjyk1Wl.o:paint.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status