제출 #730179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730179		ktkerem	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	2 ms	304 KiB

molecules

/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef __int128 vll;
typedef long long ftyp;
typedef std::complex<ftyp> vec;
#define llll std::pair<ll , ll>
#define pb push_back
#define fi first
#define sec second
#define cx real
#define cy imag
#define all(a) a.begin() , a.end()
#define debug std::cout << "!!ALERT ALERT!!" << std::endl;  
const ll limit = 1e12+7;
const ll sus = 1e5+5;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::vector<int> find_subset(int l , int u , std::vector<int> w){
  ll n = w.size();
  std::vector<int> ans;
  ll ps = 0 , ss = 0;
  ll lf = n - 1;
  std::sort(all(w));
  while(l > ss && lf >= 0){
    ss += w[lf];
    lf--;
  }
  lf++;
  ll rg = 0;
  if(lf == 0 && l > ss){
    return ans;
  }
  if(ss <= u && ss >= l){
    for(ll i = n-1;lf <= i;i--){
      ans.pb(i);
    }
    return ans;
  }
  for(ll i = 1;n>=i;i++){
    if(i != 0){
      ps += w[i-1];
    }
    while(lf < i && n > lf){
      ss -= w[lf];
      lf++;
    }
    while(ps + ss > u && lf < n){
      ss -= w[lf];
      lf++;
    }
    if(ps + ss >= l && ps + ss <= u){
      for(ll j = n-1;lf <= j;j--){
        ans.pb(j);
      }
      for(ll j = 0;i>j;j++){
        ans.pb(j);
      }
      return ans;
    }
  }
  return ans;
}

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

molecules.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:34:6: warning: unused variable 'rg' [-Wunused-variable]
   34 |   ll rg = 0;
      |      ^~

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