제출 #572627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572627		MohammadAghil	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	45 ms	4792 KiB

molecules

   #include "molecules.h"
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 5e5 + 5, lg = 22, lng = 26, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

vector<int> find_subset(int l, int r, vector<int> w){
     int n = sz(w);
     vector<int> id(n); iota(all(id), 0);
     sort(all(id), [&](int i, int j){ return w[i] < w[j]; });
     ll cr = 0; int ptr = 0;
     vector<int> ans;
     rep(i,0,n){
          if(ptr < i) ptr = i, cr = 0;
          while(ptr < n && cr + w[id[ptr]] <= r) cr += w[id[ptr++]];
          if(cr >= l){
               rep(j,i,ptr) ans.pb(id[j]);
               break;
          }
          if(ptr > i) cr -= w[id[i]];
     }
     return ans;
}

// int main(){
//      cin.tie(0) -> sync_with_stdio(0);
     
//      return 0; 
// }

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