oj.uz

답안 #185438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
185438 2020-01-11T17:37:48 Z Nucleist Bali Sculptures (APIO15_sculpture) C++14
9 / 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 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;
void solve(ll index,ll far,ll now)
{
  if(index>=x)
  {
    if(far>=y && far<=z)
    {
      glob=min(glob,now);
      return;
    }
    return;
  }
  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];
    if(glob>(yol|now))
    solve(index+i,far+1,yol|now);
  }
  return;
}
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);
  }
  solve(0,0,0);
  cout<<glob;
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 0 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 9 ms 256 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 380 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 9 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 5 ms 380 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 9 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 7 ms 376 KB Output is correct
36 Correct 7 ms 376 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 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 8 ms 376 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 8 ms 256 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 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 4 ms 376 KB Output is correct
24 Correct 9 ms 376 KB Output is correct
25 Correct 1 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 8 ms 380 KB Output is correct
29 Execution timed out 1056 ms 376 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 9 ms 376 KB Output is correct
10 Correct 8 ms 380 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 376 KB Output is correct
16 Execution timed out 1080 ms 376 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 0 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 8 ms 376 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 8 ms 408 KB Output is correct
11 Correct 9 ms 256 KB Output is correct
12 Correct 9 ms 376 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 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 4 ms 376 KB Output is correct
24 Correct 8 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 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 2 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 3 ms 252 KB Output is correct
32 Correct 9 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 9 ms 376 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 8 ms 256 KB Output is correct
39 Execution timed out 1074 ms 256 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 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 3 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 420 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 10 ms 376 KB Output is correct
20 Correct 3 ms 256 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 9 ms 504 KB Output is correct
24 Correct 0 ms 248 KB Output is correct
25 Correct 10 ms 376 KB Output is correct
26 Execution timed out 1066 ms 380 KB Time limit exceeded
27 Halted 0 ms 0 KB -