CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:vuolen
Submission time:2016-10-14 20:38:39 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#20.05 s1details
#30.06 s1details
#40.06 s1details
#50.07 s1details
#60.06 s2details
#70.05 s2details
#80.05 s2details
#90.06 s2details
#100.05 s2details
#110.20 s3details
#120.20 s3details
#130.18 s3details
#140.20 s3details
#150.18 s3details
#160.18 s3details

Code

#include <bits/stdc++.h>

using namespace std;

#define u8 uint8_t
#define u32 uint32_t
#define u64 uint64_t

uint32_t n = 0;

#define INDEX(s, d) (s * n + d)

int main(int argc, char *argv[]) {
	vector<u64> in;
	u64 max_sum = 0;
	vector<bool> v;

	cin >> n;

	for (u32 i = 0; i < n; i++) {
		u64 t;
		cin >> t;
		in.push_back(t);
		max_sum += t;
		v.push_back(1);
	}

	v.resize(n * max_sum);

//	m[INDEX(in.front(), 0)];
// 	for (u64 i = 1; i <= max_sum + 2; i++) {
// 		bool all_zero = true;
// 		bool skip = false;
// 		for (u32 j = 1; j < n; j++) {
// 			u8 t;
// 			if (skip)
// 				t = 1;
// 			else
// 				t = get_bit(m, i, j - 1) || get_bit(m, i - in[j], j - 1);
//			if (t) {
//				all_zero = false;
//				m[INDEX(i, j)] = 1;
//				break;
//			}
// 		}
//
// 		if (all_zero) {
// 			cout << i << endl;
// 			break;
// 		}
// 	}

// 	for (u32 j = 0; j < n; j++) {
// 		for (u64 i = 0; i <= max_sum + 2; i++) {
// 			printf("%d ", HAS_KEY(m, INDEX(i, j)) == true ? 1 : 0);
// 		}
// 		printf("\n");
// 	}

	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
(empty)

Test 2

Group: 1

Verdict:

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
(empty)

Test 3

Group: 1

Verdict:

input
10
10 9 2 8 7 10 7 1 5 2

correct output
62

user output
(empty)

Test 4

Group: 1

Verdict:

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
(empty)

Test 5

Group: 1

Verdict:

input
10
8 2 1 7 9 7 5 2 4 5

correct output
51

user output
(empty)

Test 6

Group: 2

Verdict:

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
(empty)

Test 7

Group: 2

Verdict:

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
(empty)

Test 8

Group: 2

Verdict:

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
(empty)

Test 9

Group: 2

Verdict:

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
(empty)

Test 10

Group: 2

Verdict:

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
(empty)

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
(empty)

Test 12

Group: 3

Verdict:

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
(empty)

Test 13

Group: 3

Verdict:

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc