Submission #311997

#TimeUsernameProblemLanguageResultExecution timeMemory
311997anakib1Detecting Molecules (IOI16_molecules)C++17
Compilation error
0 ms0 KiB
//나는 가상 소녀들에게 큰 호감이 있습니다. #include <iostream> #include <cmath> #include <algorithm> #include <stdio.h> #include <cstring> #include <string> #include <cstdlib> #include <vector> #include <bitset> #include <map> #include <chrono> #include <functional> #include <unordered_set> #include <unordered_map> #include <numeric> #include <queue> #include <ctime> #include <stack> #include <set> #include <list> #include <deque> #include <iomanip> #include <sstream> #include <fstream> #include <stdarg.h> #include <utility> using namespace std; #define pb push_back #define mp make_pair #define ll long long #define ull unisgned long long #define ld long double #define all(a) a.begin(), a.end() #define SORT(a) sort(all(a)) #define pii pair<int, int> #define tii triple<int, int, int> #define e 1e-7 #define PI acos(-1) #define sz(a) (int)(a.size()) #define inf 1e17 #define vi vector<int> #define F first #define S second #define rng(x) for(int _ = 0; _ < (x); _++) #define rngi(i, x) for(int i = 0; i < (x); i++) #define rngsi(s, i, x) for(int i = (s); i <(x); i++) #define problem "a" template<typename A, typename B, typename C> struct triple { A X; B Y; C Z; triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {} }; template<typename A, typename B, typename C> triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) { return triple<A, B, C>(a, b, c); } template<typename A, typename B, typename C> bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) { if (a.X != b.X) return a.X < b.X; if (a.Y != b.Y) return a.Y < b.Y; return a.Z < b.Z; } template<typename T, typename SS> ostream& operator<<(ostream& ofs, const pair<T, SS>& p) { ofs << "( " << p.F << " , " << p.S << " )"; return ofs; } template<typename T> void print(T a) { for (auto i : a) cout << i << ' '; cout << '\n'; } template<typename T> T max(T a, T b, T c) { return max(a, max(b, c)); } template<typename T> T min(T a, T b, T c) { return min(a, min(b, c)); } template<typename T, typename D> D min(T a) { return *min_element(all(a)); } template<typename T, typename D> D max(T a) { return *max_element(all(a)); } struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; std::vector<int> find_subset(int l, int u, std::vector<int> w) { int n = sz(w); vector<bitset<10001> > buf(n + 1), p(n + 1); buf[0][0] = 1; rngi(i, n) { buf[i + 1] = buf[i]; for (int j = 0; j + w[i] <= u; j++) if (buf[i][j]){ buf[i + 1][j + w[i]] = 1; p[i + 1][j + w[i]] = 1; } } for (int i = l; i <= u; i++) if (buf[n][i]) { vi ans; int x = i, j = n; while (x) { if (p[j][x]) { ans.push_back(j - 1); x -= w[j - 1]; } j--; } reverse(all(ans)); return ans; } return vi(); } int main() { int n, l, u; scanf("%d %d %d", &n, &l, &u); std::vector<int> w(n); for (int i = 0; i < n; i++) scanf("%d", &w[i]); std::vector<int> result = find_subset(l, u, w); printf("%d\n", (int)result.size()); for (int i = 0; i < (int)result.size(); i++) printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]); }

Compilation message (stderr)

molecules.cpp: In function 'int main()':
molecules.cpp:145:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  145 |     scanf("%d %d %d", &n, &l, &u);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:148:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  148 |         scanf("%d", &w[i]);
      |         ~~~~~^~~~~~~~~~~~~
/tmp/ccMJgKoz.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cc303mIG.o:molecules.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status