# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1248744 | al_reem_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
// اَللَهُمَ صَلِ عَلَىَ مُحَمَدٍ وَ آلِ مُحَمَدٍ
//#include "bits/stdc++.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <thread>
#include <fstream>
#include <stack>
using namespace std ;
//#define int long long
#define pb push_back
#define si size()
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define applejuice ios::sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
const int inf=1e18 ;
const int mod=1e9+7 ;
const int maxn=1e5+7 ;
int tt=1 ;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<int> result, mnv, mxv;
int mn=*min_element(all(w)) , mx=*max_element(all(w)) ;
for(int i=0 ; i<w.si ; i++) {if(w[i]==mn) {mnv.pb(i) ;} else {mxv.pb(i) ;}}
int a1=0 , a2=0 ;
if(mn==mx)
{
int a=0 ;
for(int i=1 ; i<=w.si ; i++) {a=(l<=w[0]*i && w[0]*i<=u ? i : a) ;}
for(int i=0 ; i<a ; i++) {result.pb(i) ;}
return result ;
}
for(int i=0 ; i<=mnv.si ; i++)
{
for(int j=0 ; j<=mxv.si ; j++)
{
if(l<=(mn*i)+(mx*j) && (mn*i)+(mx*j)<=u) {a1=i ; a2=j ;}
}
}
for(int i=0 ; i<a1 ; i++) {result.pb(mnv[i]) ;}
for(int i=0 ; i<a2 ; i++) {result.pb(mxv[i]) ;}
return result ;
}
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... |