Submission #411308

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

molecules

/// molecules.h ///

//#pragma once

#include <vector>

std::vector<int> find_subset(int l, int u, std::vector<int> w);

/// grader.cpp ///

#include <cstdio>
//#include <vector>
#include <cassert>

//#include "molecules.h"

int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == 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]);
}

/// molecules.cpp ///

//#include "molecules.h"
#include <algorithm>
using ll = long long;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    sort(w.begin(), w.end());
    int n = w.size();
    ll sum = 0, mn = 1e15;
    for (ll x : w){ sum += x; mn = std::min(mn, x); }
    if (u < mn || sum < l){ return std::vector<int>(); }
    int st = 0, ed = 0; sum = w[0];
    while (1){
		if (l <= sum && sum <= u){
			std::vector<int> res;
			for (int i = st; i <= ed; i++){ res.push_back(i); }
			return res;
		}
		if (sum < l){
			if (ed+1 == n){ break; }
			ed += 1;
			sum += w[ed];
		}
		else{
			if (st+1 > ed){ break; }
			sum -= w[st];
			st += 1;
		}
    }
    return std::vector<int>();
}

Compilation message (stderr)

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