Submission #102160

#	Time	Username	Problem	Language	Result	Execution time	Memory
102160		royyaha	Detecting Molecules (IOI16_molecules)	C++11	0 / 100	3 ms	384 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
#define rep(i, a, n) for(int i = a; i < n; ++i)
#define rep0(i, n) rep(i, 0, n)
#define rep1(i, n) rep(i, 1, n+1)
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define IOS cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define _ << " " << 
#define endl '\n'
#define wer(x) cout << (#x) << "->" << (x) << endl;
#define we(x) (#x) << ":(" << x << ") "
//////////////////////////////////////////////////////////////////
 
const int maxn = 2e5+50;
vector<ii> item;
 
vector<int> find_subset(int l, int r, vector<int> w) {
	int n = (int) w.size();
	rep0(i, n) item.eb(w[i], i + 1);
	sort(item.begin(), item.end());
	vector<int> ans;
	queue<ii> q;
	int sum = 0;
	for(auto i : item) {
		while(!q.empty() && i.fs - q.front().fs > r - l) sum -= q.front().fs, q.pop();
		q.push(i); sum += i.fs;
		while(!q.empty() && sum > r) {
			sum -= q.front().fs, q.pop();
		}
		if(sum >= l) {
			while(!q.empty()) {
				ans.pb(q.front().sc);
				q.pop();
			}
		}
	}
	sort(ans.begin(), ans.end());
	return ans;
 
 
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31