Submission #438534

#TimeUsernameProblemLanguageResultExecution timeMemory
438534adamjinweiDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms292 KiB
#include <bits/stdc++.h> #include "molecules.h" #define inf 1000000007 #define mod 1000000007 #define rnd() rand_num() #define bigrnd() dis(rand_num) //#pragma GCC optimize("Ofast","inline","-ffast-math") //#pragma GCC target("avx,sse2,sse3,sse4,mmx") //#define int long long using namespace std; unsigned sed=std::chrono::system_clock::now().time_since_epoch().count(); mt19937 rand_num(sed); uniform_int_distribution<long long> dis(0,inf); template <typename T> void read(T &x){ x=0;char ch=getchar();int fh=1; while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();} while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar(); x*=fh; } template <typename T> void write(T x) { if (x<0) x=-x,putchar('-'); if (x>9) write(x/10); putchar(x%10+'0'); } template <typename T> void writeln(T x) { write(x); puts(""); } int n; pair<int,int> p[200005]; vector<int> find_subset(int L,int R,vector<int> W) { n=W.size(); for(int i=1;i<=n;++i) { p[i].first=W[i-1]; p[i].second=i-1; } sort(p+1,p+n+1); for(int i=1;i<=n;++i) if(L<=p[i].first&&p[i].first<=R) { vector<int> ans; ans.push_back(p[i].second); return ans; } int sum=0; for(int i=1;i<=n-1;++i) { sum+=p[i].first; if(sum<L) { sum-=p[1].first; sum+=p[n].first; if(sum>=L&&sum<=R) { vector<int> ans; for(int j=2;j<=i;++j) ans.push_back(p[j].second); ans.push_back(p[n].second); return ans; } sum+=p[1].first; sum-=p[n].first; } else if(sum>=L&&sum<=R) { vector<int> ans; for(int j=1;j<=i;++j) ans.push_back(p[j].second); return ans; } } sum+=p[n].first; if(sum>=L&&sum<=R) { vector<int> ans; for(int j=1;j<=n;++j) ans.push_back(p[j].second); return ans; } sum=0; for(int i=n;i>=2;--i) { sum+=p[i].first; if(sum>R) { sum-=p[n].first; sum+=p[1].first; if(sum>=L&&sum<=R) { vector<int> ans; for(int j=i;j<=n-1;++j) ans.push_back(p[j].second); ans.push_back(p[1].second); return ans; } sum+=p[n].first; sum-=p[1].first; } else if(sum>=L&&sum<=R) { vector<int> ans; for(int j=1;j<=i;++j) ans.push_back(p[j].second); return ans; } } vector<int> ans; 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...