제출 #239417

#제출 시각아이디문제언어결과실행 시간메모리
239417lycDetecting Molecules (IOI16_molecules)C++14
69 / 100
1092 ms13200 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define TRACE(x) cout << #x << " :: " << x << endl; #define _ << " " << #define FOR(i,a,b) for(int i=(a);i<=(b);++i) #define RFOR(i,a,b) for(int i=(a);i>=(b);--i) #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(),(x).end() vector<int> find_subset(int l, int u, vector<int> w) { int N = SZ(w); int ind[N]; FOR(i,0,N-1){ ind[i] = i; } sort(ind,ind+N,[=](int a, int b){ return (w[a] != w[b] ? w[a] < w[b] : a < b); }); long long sum = 0; int x = 0, y; for (y = 0; y < N; ++y) { sum += w[ind[y]]; while (sum > u) sum -= w[ind[x++]]; if (sum >= l) break; } if (sum < l) return vector<int>(); else { vector<int> ans(y-x+1); FOR(i,x,y) ans[i-x] = ind[i]; 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...