제출 #1324648

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324648		riafhasan2010	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	5276 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
  int n = w.size();
  vector<pair<int, int>> a(n);
  for (int i = 0; i < n; i++) {
    a[i] = {w[i], i};
  }
  sort(a.begin(), a.end());
  vector<ll> psum(n + 1, 0);
  for (int i = 0; i < n; i++) {
    psum[i + 1] = psum[i] + a[i].first;
  }
  if (psum[n] < l or a[0].first > u) return vector<int>();
  for (int i = 1; i <= n; i++) {
    int left = 1, right = i;
    int best_start = -1;
    while (left <= right) {
      int m = (left + right) / 2;
      ll sum = psum[i] - psum[m - 1]; 
      if (sum >= l and sum <= u) {
        best_start = m;
        break;
      }
      else if (sum > u) left = m + 1; 
      else right = m - 1; 
    }
    if (best_start != -1) {
      vector<int> ans;
      for (int j = best_start; j <= i; j++) {
        ans.push_back(a[j - 1].second);
      }
      return ans;
    }
  }
  return vector<int>();
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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