Submission #1104067

#TimeUsernameProblemLanguageResultExecution timeMemory
1104067asdfghjkDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms336 KiB
#include <bits/stdc++.h> #define ll long long #define pb push_back #define all(x) x.begin(), x.end() #define F first #define ld long double #define S second using namespace std; const ll N = 4e5 + 5; const ll NN = 4e5 + 5; const ll INF = 1e18; const ll inf = 1e9; const ll MOD = 1e9 + 7; vector <int> find_subset(int l,int r,vector <int> a){ vector <int> ans; ans.clear(); bool sub1 = 1; int n = a.size(); for(int i = 1;i < n;i++){ if(a[i] != a[i- 1]){ sub1 = 0; break; } } if(sub1 == 1 && n <= 1000 && max(l,r) <= 100 && a[0] <= 100){ int sum = 0; for(int i = 0;i < n;i++){ sum += a[i]; ans.pb(a[i]); if(sum >= l && sum <= r)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...