oj.uz

Submission #185433

# Submission time Handle Problem Language Result Execution time Memory
185433 2020-01-11T17:04:42 Z Nucleist Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1000 ms 504 KB 
#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 1000000000
#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

Compilation message

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.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 8 ms 256 KB Output is correct
11 Correct 9 ms 256 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 392 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Incorrect 8 ms 376 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 8 ms 360 KB Output is correct
10 Correct 8 ms 256 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 9 ms 356 KB Output is correct
13 Correct 13 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 252 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Incorrect 8 ms 376 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 376 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 256 KB Output is correct
11 Correct 8 ms 256 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 14 ms 256 KB Output is correct
15 Correct 195 ms 356 KB Output is correct
16 Execution timed out 1091 ms 256 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 256 KB Output is correct
11 Correct 8 ms 252 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 3 ms 256 KB Output is correct
21 Incorrect 8 ms 256 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 8 ms 256 KB Output is correct
13 Correct 8 ms 256 KB Output is correct
14 Incorrect 2 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -