oj.uz

Submission #125473

# Submission time Handle Problem Language Result Execution time Memory
125473 2019-07-05T12:20:10 Z eriksuenderhauf Ice Hockey World Championship (CEOI15_bobek) C++11
20 / 100
 355 ms 16772 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("%I64d", &(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("%I64d\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 << (MAXN/2)], r[1 << (MAXN/2)];

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 = 0;
	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+1;
	}
	prl(ans);
    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:10:34: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
 #define nl(n) scanf("%I64d", &(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);
  ^~~
bobek.cpp:14:37: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
 #define prl(n) printf("%I64d\n", (n))
                                     ^
bobek.cpp:68:2: note: in expansion of macro 'prl'
  prl(ans);
  ^~~
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("%I64d", &(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

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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