oj.uz

답안 #39416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39416 2018-01-14T18:38:07 Z farmersrice Ice Hockey World Championship (CEOI15_bobek) C++14
60 / 100
 1000 ms 395436 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC target ("avx,tune=native")
//Use above if bruteforcing with lots of small operations. Or just use it anytime, there's no downside. AVX is better slightly
/*
TASK: hidden
LANG: C++11
*/
using namespace std;
typedef long long ll;
typedef pair<int, int> pair2;
typedef pair<int, pair<int, int> > pair3;
typedef pair<int, pair<int, pair<int, int> > > pair4;
#define MAXN 43
#define INF 1000000000000000000LL
#define mp make_pair
#define add push_back
#define remove pop

int n;
ll values[MAXN];
ll set1[MAXN];
ll set2[MAXN];
int size1, size2;

ll m;
vector<ll> one;
vector<ll> two;

void dfs1(int depth, ll sum) {
	if (depth == size1) {
		one.add(sum);
		return;
	}
	dfs1(depth + 1, sum + set1[depth]);
	dfs1(depth + 1, sum);
}

void dfs2(int depth, ll sum) {
	if (depth == size2) {
		two.add(sum);
		return;
	}
	dfs2(depth + 1, sum + set2[depth]);
	dfs2(depth + 1, sum);
}

int main() {
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL);

	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		cin >> values[i];
	}
	sort(values, values + n);

	for (int i = 0; i < n; i++) {
		if (values[i] % 2 == 0) {
			set1[size1++] = values[i];
		} else {
			set2[size2++] = values[i];
		}
	}	

	dfs1(0, 0);
	dfs2(0, 0);

	sort(one.begin(), one.end());
	sort(two.begin(), two.end());

	//assert(one.size() + two.size() < 5000000);

	ll answer = 0;
	int twopointer = two.size() - 1;
	for (int i = 0; i < (int) (one.size()); i++) {
		if (one[i] > m) break;
		while (twopointer >= 0 && two[twopointer] > m - one[i]) {
			twopointer--;
		}
		answer += twopointer + 1;
	}

	cout << answer << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2988 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 8364 KB Output is correct
2 Correct 229 ms 26796 KB Output is correct
3 Execution timed out 1000 ms 199344 KB Execution timed out
4 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 396 ms 51372 KB Output is correct
2 Correct 19 ms 4272 KB Output is correct
3 Correct 769 ms 100784 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 46 ms 14524 KB Output is correct
6 Correct 9 ms 3756 KB Output is correct
7 Correct 13 ms 3756 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 14768 KB Output is correct
2 Correct 129 ms 15536 KB Output is correct
3 Correct 96 ms 10408 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 116 ms 27312 KB Output is correct
6 Correct 406 ms 51372 KB Output is correct
7 Correct 543 ms 51632 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 198828 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 5552 KB Output is correct
2 Correct 56 ms 8364 KB Output is correct
3 Correct 13 ms 3756 KB Output is correct
4 Correct 9 ms 3884 KB Output is correct
5 Correct 66 ms 15536 KB Output is correct
6 Correct 59 ms 8364 KB Output is correct
7 Execution timed out 1000 ms 395436 KB Execution timed out

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 30896 KB Output is correct
2 Correct 16 ms 4264 KB Output is correct
3 Correct 6 ms 2988 KB Output is correct
4 Execution timed out 1000 ms 101552 KB Execution timed out
5 Halted 0 ms 0 KB -