Submission #1070741

#TimeUsernameProblemLanguageResultExecution timeMemory
1070741dostsDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms348 KiB
//Dost SEFEROĞLU #include "molecules.h" #include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define ff first #define ss second #define sp << " " << #define all(cont) cont.begin(),cont.end() #define vi vector<int> const int MOD = 1e9+7,inf = 2e18; const int N = 1e5+50; vector<int32_t> find_subset(int32_t l, int32_t u, vector<int32_t> w) { int n = w.size(); vector<pii> ps; for (int i=0;i<n;i++) ps.push_back({w[i],i}); sort(all(ps)); int sm = 0; vector<int32_t> v; for (int i=0;i<n;i++) { if (sm >= l && sm <= u) { sort(all(v)); return v; } sm+=ps[i].ff; v.push_back(ps[i].ss); if (sm >= l && sm <= u) { sort(all(v)); return v; } if (sm-ps[0].ff >= l && sm-ps[0].ff <= u) { v.erase(find(all(v),ps[0].ss)); sort(all(v)); return v; } } return vector<int32_t>{}; }
#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...