# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156517 | a_player | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
using namespace std;
//typedef long long ll;
pair<int,int> dp[1001][1001];
int v[1001];
int N,uu,ll;
vector<int> find_subset(int l,int u,vector<int> w){
vector<int> sol;
if(w[0]*w.size()<l)return sol;
if(w[0]>u)return sol;
int h=l/w[0];
int s=h*w[0];
if(s==l){
for(int i=0;i<h;i++)sol.push_back(i);
return sol;
}if(s+w[0]>u)return sol;
if(s+w[0]>=l&&s+w[0]<=u){
for(int i=0;i<h+1;i++)sol.push_back(i);
return sol;
}
return sol;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |