oj.uz

답안 #984785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984785 2024-05-17T05:30:23 Z hashim Detecting Molecules (IOI16_molecules) C++17
0 / 100
 1 ms 348 KB 
// #include "molecules.h"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #define pb push_back
// #define pf push_front
// #define ep emplace_back
// #define ef emplace_front
//#define int long long
// #define ld long double
// #define stoi stoll
// #define all(ls) ls.begin(),ls.end()
// #define allr(ls) ls.rbegin(),ls.rend()
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
 
using namespace std; 
// using namespace __gnu_pbds;
 
// template<typename type>using ordered_set=tree<type,null_type,less<type>,rb_tree_tag,tree_order_statistics_node_update>;
// template<typename type>using ordered_multiset=tree<type,null_type,less_equal<type>,rb_tree_tag,tree_order_statistics_node_update>;
 
// int sum(int ls[],int n){int sum=0;for(int i=0;i<n;i++)sum+=ls[i];return sum;}
 
// int count(string str,string word){regex regex_word(word);sregex_iterator it(all(str),regex_word);sregex_iterator end;int count=0;while(it!=end){count++;it++;}return count;}

vector<int>find_subset(int l,int u,vector<int>w){
  int n=w.size();
  int prefix[n];
  prefix[0]=w[0];
  vector<int>ans;
  for(int i=1;i<n;i++)
    prefix[i]=prefix[i-1]+w[i];
  cout<<endl;
  for(int i=0;i<n;i++){
    int low=i+1,high=n-1;
    while(low<=high){
      int mid=(low+high)/2;
      if((prefix[mid]-prefix[i])>=l and (prefix[mid]-prefix[i])<=u){
        if(i+1==mid) ans.push_back(i+1);
        else{ans.push_back(i+1);ans.push_back(mid);}
        break;
      }
      else if((prefix[mid]-prefix[i])<l) low=mid+1;
      else high=mid-1;
    }
  }
  return ans;
}

// void solve(){
//   for(auto i:find_subset(15, 17, {6, 8, 8, 7})) cout<<i<<" ";
//   cout<<endl;
// }

// signed main(){
//   ios_base::sync_with_stdio(0);
//   cin.tie(nullptr); 
//   cout.tie(nullptr);
//   int t=1;
//   //cin>>t;
//   while(t--)
//     solve();
// }

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Secret is incorrect!
2 Halted 0 ms 0 KB -