oj.uz

Submission #436171

# Submission time Handle Problem Language Result Execution time Memory
436171 2021-06-24T09:53:06 Z cpp219 Ice Hockey World Championship (CEOI15_bobek) C++14
20 / 100
 86 ms 10564 KB 
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 40 + 9;
const ll inf = 1e9 + 7;
vector<ll> v1,v2;
ll n,k,now,ans,a[N];

void f1(ll i){
    if (i > n/2){
        if (now <= k) v1.push_back(now);
        return;
    }
    f1(i + 1); now += a[i]; f1(i + 1); now -= a[i];
}

void f2(ll i){
    if (i > n){
        if (now <= k) v2.push_back(now);
        return;
    }
    f2(i + 1); now += a[i]; f2(i + 1); now -= a[i];
}

int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "test"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    cin>>n>>k;
    for (ll i = 1;i <= n;i++) cin>>a[i];
    f1(1); now = 0; f2(n/2 + 1);
    //for (auto i : v2) cout<<i<<" "; return 0;
    sort(v2.begin(),v2.end());
    for (auto i : v1){
        ll inc = prev(upper_bound(v2.begin(),v2.end(),k - i)) - v2.begin() + 1;
        //cout<<inc<<"x\n";
        ans += inc;
    }
    cout<<ans;
}

Compilation message

bobek.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
bobek.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
bobek.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
bobek.cpp: In function 'int main()':
bobek.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 1612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 1920 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 6600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 10564 KB Output isn't correct
2 Halted 0 ms 0 KB -