oj.uz

Submission #185439

# Submission time Handle Problem Language Result Execution time Memory
185439 2020-01-11T17:59:38 Z Nucleist Bali Sculptures (APIO15_sculpture) C++14
25 / 100
 1000 ms 11768 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 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 glob=INF;
map<pair<ll,pair<ll,ll>>,ll>dp;
ll solve(ll index,ll far,ll now)
{
  if(index>=x)
  {
    if(far>=y && far<=z)
    {
      return 0;
    }
    return INF;
  }
  if(dp.find({index,{far,now}})!=dp.end())return dp[{index,{far,now}}];
  ll ans=INF;
  ll ans1=INF;
  for (ll i = 1; i <= x-index; ++i)
  {
    ll yol = pref[index+i-1]-pref[index-1];
    if(index==0)yol=pref[index+i-1];
    ll k = (yol|solve(index+i,far+1,yol|now));
    if((k|now)<ans)
    {
      ans=(k|now);
      ans1=k;
    }
  }
  return dp[{index,{far,now}}]=ans1;
}
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,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
9.0 / 9.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 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 256 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 256 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 380 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 8 ms 888 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 8 ms 504 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 380 KB Output is correct
27 Correct 4 ms 376 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 21 ms 1016 KB Output is correct
30 Correct 27 ms 1400 KB Output is correct
31 Correct 102 ms 2520 KB Output is correct
32 Correct 45 ms 1528 KB Output is correct
33 Correct 44 ms 1528 KB Output is correct
34 Correct 57 ms 1912 KB Output is correct
35 Correct 56 ms 1880 KB Output is correct
36 Correct 82 ms 2136 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 128 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 5 ms 492 KB Output is correct
16 Correct 20 ms 1016 KB Output is correct
17 Correct 33 ms 1400 KB Output is correct
18 Correct 100 ms 2552 KB Output is correct
19 Correct 45 ms 1528 KB Output is correct
20 Correct 45 ms 1528 KB Output is correct
21 Correct 58 ms 1808 KB Output is correct
22 Correct 56 ms 1784 KB Output is correct
23 Correct 76 ms 2008 KB Output is correct
24 Correct 98 ms 2752 KB Output is correct
25 Correct 335 ms 5716 KB Output is correct
26 Correct 780 ms 9816 KB Output is correct
27 Execution timed out 1080 ms 11768 KB Time limit exceeded
28 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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 408 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 0 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 460 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 9 ms 864 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 4 ms 504 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 21 ms 1016 KB Output is correct
40 Correct 28 ms 1276 KB Output is correct
41 Correct 99 ms 2552 KB Output is correct
42 Correct 41 ms 1528 KB Output is correct
43 Correct 45 ms 1528 KB Output is correct
44 Correct 58 ms 1840 KB Output is correct
45 Correct 57 ms 1860 KB Output is correct
46 Correct 73 ms 2168 KB Output is correct
47 Correct 97 ms 2780 KB Output is correct
48 Correct 340 ms 5752 KB Output is correct
49 Correct 770 ms 9848 KB Output is correct
50 Execution timed out 1034 ms 11256 KB Time limit exceeded
51 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 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 8 ms 888 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 6 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 25 ms 972 KB Output is correct
27 Correct 28 ms 1272 KB Output is correct
28 Correct 103 ms 2640 KB Output is correct
29 Correct 45 ms 1528 KB Output is correct
30 Correct 46 ms 1520 KB Output is correct
31 Correct 58 ms 1912 KB Output is correct
32 Correct 56 ms 1784 KB Output is correct
33 Correct 73 ms 2040 KB Output is correct
34 Correct 99 ms 2732 KB Output is correct
35 Correct 344 ms 5724 KB Output is correct
36 Correct 850 ms 9616 KB Output is correct
37 Execution timed out 1053 ms 11256 KB Time limit exceeded
38 Halted 0 ms 0 KB -