oj.uz

Submission #448460

# Submission time Handle Problem Language Result Execution time Memory
448460 2021-07-30T08:33:39 Z BT21tata Ice Hockey World Championship (CEOI15_bobek) C++17
40 / 100
 72 ms 312 KB 
#include<bits/stdc++.h>
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
using namespace std;
const ll MOD=1e9+7;
// mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
 
ll n, m, a[45];
ll ans;
int main()
{
    SPEED;
    cin>>n>>m;
    for(int i=0; i<n; i++)
        cin>>a[i];
    for(ll i=0; i<(1<<n); i++)
    {
        ll sum=0;
        for(ll j=0; j<n; j++)
        {
            if(i&(1<<j)) sum+=a[j];
        }
        ans+=1ll*(sum<=m);
    }
    cout<<ans<<endl;
    return 0;
}

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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 220 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 204 KB Output is correct
2 Correct 4 ms 308 KB Output is correct
3 Correct 9 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 4 ms 204 KB Output is correct
6 Correct 71 ms 288 KB Output is correct
7 Correct 9 ms 304 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 288 KB Output is correct
2 Correct 17 ms 304 KB Output is correct
3 Correct 5 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 72 ms 304 KB Output is correct
6 Correct 9 ms 312 KB Output is correct
7 Correct 8 ms 304 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
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 #7
0 / 10.0

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

Subtask #8
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 #9
0 / 10.0

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

Subtask #10
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 -