Submission #246820

#TimeUsernameProblemLanguageResultExecution timeMemory
246820LittleFlowers__Detecting Molecules (IOI16_molecules)C++17
100 / 100
70 ms6384 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;}) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int l,int r){return l+rng()%(r-l+1);} #define fasty ios_base::sync_with_stdio(0),cin.tie(0); #define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a) #define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a) #define forv(a,b) for(auto&a:b) #define fi first #define se second #define pb push_back #define ii pair<int,int> #define mt make_tuple #define all(a) a.begin(),a.end() #define reset(f, x) memset(f, x, sizeof(f)) #define gg exit(0); vector<int> find_subset(int l,int r,vector<int> w){ vector<ii> a; forinc(i,0,w.size()-1) a.pb({w[i],i}); sort(all(a)); vector<int> ans; deque<int> d; long long tot=0; forv(i,a){ tot+=i.fi; d.push_back(i.se); while(tot>r){ tot-=w[d.front()]; d.pop_front(); } if(tot>=l){ while(d.size()){ ans.push_back(d.back()); d.pop_back(); } 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...