제출 #711659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
711659		JANCARAPAN	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	41 ms	6448 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long   
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) (long long) a.size()
#define endl '\n'

#define dbg(a) cerr << #a << " = " << a << endl;
#define print(a) for (auto x : a) cerr << x << " "; cerr << endl;

const int INF = 1e18, MOD = 1e9+7;

vector<int> find_subset(int l, int r, vector<int> tmp) {
  int n = sz(tmp);
  vector<pair<int,int>> a(n);
  for (int i = 0; i < n; i++) {
    a[i] = {tmp[i], i};
  }
  sort(all(a));
  
  vector<int> pref(n), suff(n);
  for (int i = 0; i < n; i++) {
    pref[i] = a[i].fi + (i ? pref[i - 1] : 0);
    suff[n - i - 1] = a[n - i - 1].fi + (i ? suff[n - i] : 0);
  }
  
  vector<int> ans;
  
  for (int size = 0; size < n; size++) {
    if (pref[size] > r || suff[n - size - 1] < l) continue;
    int cur = pref[size];
    int j = 0;
    while (cur < l) {
      cur += a[n - j - 1].fi - a[j].fi;
      j += 1;
    }
    if (cur >= l) {
      for (int it = j; it <= size; it++) {
        ans.pb(a[it].se);
      }
      for (int it = n - 1; it >= n - j; it--) {
        ans.pb(a[it].se);
      }
      break;
    }
  }
  
 return ans; 
}

//signed main() {
  //ios_base::sync_with_stdio(0);
  //cin.tie(0);
  //vector<int> a = find_subset(15, 17, {6, 6, 8, 7});
  //vector<int> a = find_subset(14, 15, {5, 5, 6, 6});
  //vector<int> a = find_subset(10, 20, {15, 17, 16, 18});
  //for (auto x : a) cerr << x << " ";
//}
//signed main() {
  //ios_base::sync_with_stdio(0);
  //cin.tie(0);
  //int tt = 1;
  //cin >> tt;
  //while (tt--) {
    //solve();
  //}
  //return 0;
//}

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

molecules.cpp:15:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   15 | const int INF = 1e18, MOD = 1e9+7;
      |                 ^~~~

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