# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138803 | PedroBigMan | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 376 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 "molecules.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<int> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
ll we=w[0]; ll n = w.size();
ll lo = (ll) ceil((ld) (l)/(ld) (we));
ll hi = (ll) floor((ld) (u)/(ld) (we));
vector<int> ans;
if(lo<=hi && lo<=n) {REP(i,0,lo) {ans.pb((int) we);} return ans;}
return vector<int>(0);
}
/*int main()
{
ll n,l,u; cin>>n>>l>>u; vector<int> q; In(q,n);
Out(find_subset(l,u,q));
return 0;
}*/
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... |