제출 #164794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
164794		cbertram	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	67 ms	5112 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)

vi find_subset(int l, int u, vi wi) {
  int N = (int)wi.size();
  vpii w(N);
  rep(n,0,N) w[n] = make_pair(wi[n], n);
  sort(all(w));
  long bot = 0;
  long top = 0;
  int K = 0;
  for(int k = 0; k <= N; k++) {
    K = k;
    if(l <= bot && bot <= u) {
      vi ans(0);
      rep(i,0,k) ans.push_back(w[i].second);
      return ans;
    }
    if(l <= top && top <= u) {
      vi ans(0);
      rep(i,0,k) ans.push_back(w[N-1-i].second);
      return ans;
    }
    if(bot < l && u < top)
      break;
    if(k == N) return vi(0);
    bot += w[k].first;
    top += w[N-1-k].first;
  }
  int k2 = 0;
  rep(k,0,K) {
    k2++;
    bot -= w[K-1-k].first;
    bot += w[N-1-k].first;
    if(bot >= l) break;
  }
  vi ans(0);
  rep(i,0,K-k2) ans.push_back(w[i].second);
  rep(i,N-k2,N) ans.push_back(w[i].second);
  return ans;
}

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