제출 #546879

#제출 시각아이디문제언어결과실행 시간메모리
546879fvogel499Detecting Molecules (IOI16_molecules)C++17
컴파일 에러
0 ms0 KiB
/* * File created on 04/07/2022 at 22:12:14. * Link to problem: * Description: * Time complexity: O() * Space complexity: O() * Status: --- * Copyright: Ⓒ 2022 Francois Vogel */ #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <functional> using namespace std; using namespace __gnu_pbds; #define pii pair<int, int> #define f first #define s second #define vi vector<int> #define all(x) x.begin(), x.end() #define size(x) (int)((x).size()) #define pb push_back #define ins insert #define cls clear // #define int ll #define ll long long #define ld long double typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; const int siz = 5e5+40; vi find_subset(int start, int end, vi b) { bitset<siz> knapsack; knapsack.reset(); knapsack.flip(0); int ori [siz]; for (int i = 0; i < siz; i++) ori[i] = -1; bitset<siz> pre, loc; for (int i = 0; i < size(b); i++) { pre = knapsack<<b[i]; loc = (pre^knapsack)&pre; knapsack |= pre; while (loc.any()) { int pos = loc._Find_first(); assert(ori[pos] == -1); ori[pos] = i; loc.flip(pos); } } vi res; for (int i = start; i <= end; i++) if (ori[i] != -1) { int x = i; while (x > 0) { res.pb(ori[x]); x -= b[ori[x]]; } break; } return res; } signed main() { cin.tie(0); ios_base::sync_with_stdio(0); int n, l, u; cin >> n >> l >> u; vi b(n); for (int i = 0; i < n; i++) cin >> b[i]; vi res = find_subset(l, u, b); for (int i : res) cout << i << ' '; cout.flush(); int d = 0; d++; }

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

/usr/bin/ld: /tmp/ccJv94Nr.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccaeFI6s.o:molecules.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status