제출 #185435

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
185435		Nucleist	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1051 ms	512 KiB

sculpture

#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 100000000000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
ll x,y,z;
ve hedi,pref;
ll solve(ll index,ll far)
{
  if(index>=x)
  {
    if(far>=y && far<=z)return 0;
    else return INF;
  }
  ll ans=INF;
  for (ll i = 1; i <= x-index; ++i)
  {
    if(index==0)ans=min(ans,(pref[index+i-1]) | solve(index+i,far+1));
    else ans=min(ans,(pref[index+i-1]-pref[index-1]) | solve(index+i,far+1));
  }
  return ans;
}
int main()
{
  //flash;
  cin>>x>>y>>z;
  ll cur=0;
  for (ll i = 0; i < x; ++i)
  {
    ll yo;cin>>yo;hedi.pb(yo);
    cur+=yo;
    pref.pb(cur);
  }
  cout<<solve(0,0);
  return 0;
}
//code the AC sol !
// BS/queue/map

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

sculpture.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
sculpture.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29