oj.uz

Submission #462012

# Submission time Handle Problem Language Result Execution time Memory
462012 2021-08-10T07:06:42 Z kingfran1907 Ice Hockey World Championship (CEOI15_bobek) C++14
10 / 100
 484 ms 8636 KB 
#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;

const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 18;
const int off = 1 << logo;
const int treesiz = off << 1;

int n;
llint m;
llint niz[maxn];
vector< llint > v;

int main() {
	scanf("%d%lld", &n, &m);
	for (int i = 0; i < n; i++)
		scanf("%lld", niz+i);
		
	int hf = n / 2;
	int lim = (1 << hf);
	for (int mask = 0; mask < lim; mask++) {
		llint sum = 0;
		for (int i = 0; i < hf; i++)
			if (mask & (1 << i)) sum += niz[i];	
		v.push_back(sum);
	}
	sort(v.begin(), v.end());
	
	llint sol = 0;
	lim = (1 << (n - hf));
	for (int mask = 0; mask < lim; mask++) {
		llint sum = 0;
		for (int i = 0; i < n - hf; i++) {
			if (mask & (1 << i)) sum += niz[i];
		}
		
		int ind = upper_bound(v.begin(), v.end(), m - sum) - v.begin();
		sol += ind;
	}
	printf("%lld\n", sol);
	return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%d%lld", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
bobek.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf("%lld", niz+i);
      |   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
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 #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 35 ms 840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 1348 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 1460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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