Submission #265576

#TimeUsernameProblemLanguageResultExecution timeMemory
265576cjoaDetecting Molecules (IOI16_molecules)C++11
0 / 100
88 ms65540 KiB
#include "molecules.h" #include <vector> #include <algorithm> #include <utility> #include <numeric> #include <cassert> #include <cstdio> using namespace std; typedef pair<int,int> II; std::vector<int> find_subset(int l, int u, std::vector<int> w) { const int N = w.size(); long long sum = 0; for (int i = 0; i < N; ++i) { sum += w[i]; if (l <= sum && sum <= u) { vector<int> res; for (int j = 0; j <= i; ++i) res.push_back(j+1); return res; } } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...