oj.uz

답안 #125478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125478 2019-07-05T12:30:34 Z eriksuenderhauf Ice Hockey World Championship (CEOI15_bobek) C++11
100 / 100
 378 ms 16816 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 42;
const double eps = 1e-9;
ll a[MAXN];
ll l[1 << 21], r[1 << 21];

int main() {
	srand(time(0));
	int n; ll m;
	scanf("%d %lld", &n, &m);
	nal(a, n);
	random_shuffle(a, a + n);
	int x = n / 2, y = (n+1) / 2;
	for (int i = 0; i < (1 << x); i++) {
		ll cur = 0;
		for (int j = 0; j < x; j++)
			if ((i >> j) & 1)
				cur += a[j];
		l[i] = cur;
	}
	sort(l, l+(1<<x));
	for (int i = 0; i < (1 << y); i++) {
		ll cur = 0;
		for (int j = 0; j < y; j++)
			if ((i >> j) & 1)
				cur += a[j+x];
		r[i] = cur;
	}
	sort(r, r+(1<<y));
	ll j = (1<<y)-1, ans = 1;
	for (int i = 0; i < (1<<x); i++) {
		while (j > 0 && l[i] + r[j] > m) j--;
		if (j >= 0 && l[i] + r[j] <= m) ans += j + (i>0 ? 1 : 0);
		//for (j = 0; j < (1 << y); j++)
		//	if (l[i] + r[j] <= m)
		//		ans++;
	}
	prl(ans);
    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %lld", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
bobek.cpp:10:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define nl(n) scanf("%lld", &(n))
               ~~~~~^~~~~~~~~~~~~~
bobek.cpp:12:49: note: in expansion of macro 'nl'
 #define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
                                                 ^~
bobek.cpp:44:2: note: in expansion of macro 'nal'
  nal(a, n);
  ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 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 2 ms 256 KB Output is correct

Subtask #3
10.0 / 10.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 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.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 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

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1912 KB Output is correct
2 Correct 87 ms 4468 KB Output is correct
3 Correct 359 ms 16788 KB Output is correct
4 Correct 91 ms 4472 KB Output is correct
5 Correct 17 ms 1400 KB Output is correct
6 Correct 12 ms 888 KB Output is correct
7 Correct 21 ms 1400 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 2424 KB Output is correct
2 Correct 31 ms 1912 KB Output is correct
3 Correct 160 ms 8572 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 20 ms 1400 KB Output is correct
7 Correct 22 ms 1528 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 3488 KB Output is correct
2 Correct 145 ms 6536 KB Output is correct
3 Correct 129 ms 6444 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 85 ms 6648 KB Output is correct
6 Correct 309 ms 16752 KB Output is correct
7 Correct 126 ms 6520 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 12664 KB Output is correct
2 Correct 31 ms 2040 KB Output is correct
3 Correct 11 ms 888 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 10 ms 888 KB Output is correct
6 Correct 260 ms 12664 KB Output is correct
7 Correct 21 ms 1528 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 1912 KB Output is correct
2 Correct 85 ms 4480 KB Output is correct
3 Correct 11 ms 888 KB Output is correct
4 Correct 11 ms 888 KB Output is correct
5 Correct 91 ms 6520 KB Output is correct
6 Correct 32 ms 1912 KB Output is correct
7 Correct 352 ms 16760 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 16816 KB Output is correct
2 Correct 32 ms 1912 KB Output is correct
3 Correct 11 ms 888 KB Output is correct
4 Correct 378 ms 16800 KB Output is correct
5 Correct 120 ms 8540 KB Output is correct
6 Correct 21 ms 1400 KB Output is correct
7 Correct 42 ms 2396 KB Output is correct