Submission #336647

#TimeUsernameProblemLanguageResultExecution timeMemory
336647shrek12357Detecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms384 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <set> #include <climits> #include <cmath> #include <fstream> #include <queue> #include <stack> #include <bitset> #include "molecules.h" using namespace std; #define ll long long //cin.tie(0);ios_base::sync_with_stdio(0); vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<int> ans; for (int i = 0; i < n + 1; i++) { ans.push_back(i); if (i == n) { ans.clear(); } if (w[0] * (i + 1) >= l && w[0] * (i + 1) <= u) { break; } } return ans; }
#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...