제출 #621292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
621292		IWTIM	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	340 KiB

molecules

#include "molecules.h"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define f first
#define s second
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int n,l,r;
vector <int> fnd_subset(int l, int r, vector <int> w) {
    n = w.size(); 
    vector <pii> v;
    for (int i = 0; i < (int)w.size(); i++) {
        v.pb({w[i], i});
    }
    sort(all(v));
    vector <int> ans;
    if (v[0].f > r) return ans;
    long long sum = 0;
    for (int i = 0; i < (int)v.size(); i++) {
        sum += v[i].f;
        ans.pb(v[i].s);
        if (sum >= l && sum <= r) {
            return ans;
        }
    }
    ans.clear();
    if (sum < l) {
        return ans;
    }
    sum = 0;
    int idx = 0;
    //deque < pii > curans;
    for (int i = 0; i < (int)v.size(); i++) {
        if (sum + v[i].f >= l) break;
        sum += v[i].f;
        idx = i;
        //curans.pb({v[i].f, v[i].s});
    }
    int st = -1;
    for (int i = idx + 1; i < (int)v.size(); i++) {
        sum += v[i].f;
        sum -= v[i - idx - 1].f;
        if (sum >= l) {
            st = i - idx;
            break;
        }
    }
    if (st == -1) return ans;
    for (int i = st; i <= st + idx; i++) {
        ans.pb(v[i].s);
    }
    return ans;
} 
std::vector<int> find_subset(int ll, int rr, std::vector<int> w)  {
    n = w.size();
    l = ll;
    r = rr;
    vector < int > v;
    for (int i = 0; i < n; i++) {
        v[i] = w[i];
    }
    v = fnd_subset(l,r,v);
    sort(v.begin(),v.end());
    return v;
}

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