Submission #951151

#	Time	Username	Problem	Language	Result	Execution time	Memory
951151		thieunguyenhuy	Detecting Molecules (IOI16_molecules)	C++17	Compilation error	0 ms	0 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) __builtin_popcountll((n))
#define clz(n) __builtin_clzll((n))
#define ctz(n) __builtin_ctzll((n))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

int find_subset(int lo, int hi, int w[], int n, int result[]) {
	vector<int> id(n); iota(id.begin(), id.end(), 0);
	sort (id.begin(), id.end(), [&](int x, int y) {
		return w[x] < w[y];
	});
	// for (int i = 0; i < n; ++i)
	// 	cout << id[i] << ' ';
	// cout << '\n';
	int j = 0, sum = 0;
	for (int i = 0; i < n; ++i) {
		while (j < n && sum < lo) sum += w[id[j++]];
		// cout << i << ' ' << j << ' ' << sum << '\n';
		if (lo <= sum && sum <= hi) {
			for (int x = i; x < j; ++x)
				result[x - i] = id[x];
			return j - i;
		}
		sum -= w[id[i]];
	}
	return 0;
}

#ifdef hwe
int w[N], result[N];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int lo, hi, n;
    cin >> n >> lo >> hi;
    for (int i = 0; i < n; ++i)
    	cin >> w[i];
    int ret = find_subset(lo, hi, w, n, result);
    cout << ret << '\n';
    for (int i = 0; i < ret; ++i)
    	cout << result[i] << ' ';
    cout << '\n';

    cerr << '\n'; return 0;
}
#endif

Compilation message (stderr)

/usr/bin/ld: /tmp/cck2SRXG.o: in function `main':
grader.cpp:(.text.startup+0x18d): undefined reference to `find_subset(int, int, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status