oj.uz

Submission #428647

# Submission time Handle Problem Language Result Execution time Memory
428647 2021-06-15T13:29:19 Z Return_0 Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 467 ms 16956 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 20;

ll a [N], b [N], sum [1 << N], n, m, C, ans;
vector <ll> costs;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> C;
	m = n / 2;
	n -= m;

	input(0, n, a);
	input(0, m, b);

	costs.push_back(0);
	for (ll msk = 1; msk < 1LL << m; msk++) {
		sum[msk] = sum[msk - (msk & -msk)] + b[__builtin_ctzll(msk)];
		costs.push_back(sum[msk]);
	}

	sort(All(costs));
	ans += upper_bound(All(costs), C) - costs.begin();
	for (ll msk = 1; msk < 1LL << n; msk++) {
		sum[msk] = sum[msk - (msk & -msk)] + a[__builtin_ctzll(msk)];
		ans += upper_bound(All(costs), C - sum[msk]) - costs.begin();
	}

	kill(ans);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 1000
100 1500 500 500 1000

*/

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 324 KB Output is correct

Subtask #3
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 332 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 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 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 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1940 KB Output is correct
2 Correct 88 ms 4548 KB Output is correct
3 Correct 466 ms 16888 KB Output is correct
4 Correct 74 ms 4576 KB Output is correct
5 Correct 8 ms 1460 KB Output is correct
6 Correct 4 ms 976 KB Output is correct
7 Correct 8 ms 1484 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2504 KB Output is correct
2 Correct 23 ms 2124 KB Output is correct
3 Correct 143 ms 8656 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 3 ms 976 KB Output is correct
6 Correct 8 ms 1476 KB Output is correct
7 Correct 8 ms 1484 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 3412 KB Output is correct
2 Correct 119 ms 6600 KB Output is correct
3 Correct 135 ms 6544 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 39 ms 6712 KB Output is correct
6 Correct 134 ms 16860 KB Output is correct
7 Correct 49 ms 6492 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 12652 KB Output is correct
2 Correct 20 ms 1876 KB Output is correct
3 Correct 7 ms 968 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 944 KB Output is correct
6 Correct 97 ms 12644 KB Output is correct
7 Correct 10 ms 1484 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1948 KB Output is correct
2 Correct 69 ms 4676 KB Output is correct
3 Correct 7 ms 988 KB Output is correct
4 Correct 7 ms 976 KB Output is correct
5 Correct 48 ms 6480 KB Output is correct
6 Correct 10 ms 1996 KB Output is correct
7 Correct 163 ms 16956 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 16872 KB Output is correct
2 Correct 24 ms 1996 KB Output is correct
3 Correct 7 ms 980 KB Output is correct
4 Correct 467 ms 16864 KB Output is correct
5 Correct 57 ms 8652 KB Output is correct
6 Correct 8 ms 1484 KB Output is correct
7 Correct 17 ms 2504 KB Output is correct