CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:vuolen
Submission time:2016-10-09 20:10:26 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.13 s1details
#2ACCEPTED0.06 s1details
#30.15 s1details
#4ACCEPTED0.06 s1details
#50.14 s1details
#60.14 s2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.04 s2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.06 s2details
#110.16 s3details
#120.18 s3details
#130.17 s3details
#140.17 s3details
#150.16 s3details
#160.18 s3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:42:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%" SCNu32, &n);
                       ^
input/code.cpp:47:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%" SCNu32, in + i);
                            ^

Code

#include <stdio.h>
#include <stdint.h>
#include <string.h>
#define __STDC_FORMAT_MACROS
#include <inttypes.h>
#include <stdlib.h>

int cmpfunc (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}

uint8_t get(uint8_t *m, uint32_t n, uint64_t sum, uint32_t d) {
	return m[sum * n + d];
}

void print_matrix(uint8_t *m, uint32_t *in, uint64_t x, uint32_t n) {
	uint64_t i;
	uint32_t j;

	printf(" [");
	for (i = 0; i < x; i++) {
		printf(" %" PRIu64 " ", i);
	}
	printf("]\n");

	for (j = 0; j < n; j++) {
		printf("%" PRIu32 "[", in[j]);
		for (i = 0; i < x; i++) {
			printf(" %" PRIu8 " ", get(m, n, i, j));
		}
		printf("]\n");
	}
}

int main(int argc, char *argv[]) {
	uint32_t n;
	uint32_t *in;
	uint8_t *m;
	uint64_t maxSum = 0;

	scanf("%" SCNu32, &n);
	in = (uint32_t *) calloc(n, sizeof(uint32_t));

	uint32_t i;
	for (i = 0; i < n; i++) {
		scanf("%" SCNu32, in + i);
		maxSum += in[i];
	}

	qsort(in, n, sizeof(uint32_t), cmpfunc);

	m = (uint8_t *) calloc(maxSum * n, sizeof(uint8_t));
	m[in[0] * n] = 1;
	memset(m, 1, n);


	uint64_t j;
	for (j = 0; j < maxSum + 2; j++) {
		uint32_t k;
		uint8_t allzero = 1;
		for (k = 1; k < n; k++) {
			if (in[k] > j)
				m[j * n + k] = get(m, n, j, k - 1);
			else
				m[j * n + k] = get(m, n, j, k - 1) || get(m, n, j - in[k], k - 1);

			if (m[j * n + k] == 1)
				allzero = 0;
		}

		if (allzero) {
			printf("%" PRIu64 "\n", j);
			break;
		}
	}

	free(in);
	free(m);

	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
30

Error:
*** Error in `input/code': double free or corruption (!prev): 0x000000000188c040 ***

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
1

user output
1

Test 3

Group: 1

Verdict:

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

correct output
62

user output
62

Error:
*** Error in `input/code': double free or corruption (!prev): 0x0000000000a2d040 ***

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
1

user output
1

Test 5

Group: 1

Verdict:

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

correct output
51

user output
51

Error:
*** Error in `input/code': double free or corruption (!prev): 0x000000000187c040 ***

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: ACCEPTED

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

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
1

user output
1

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
30

user output
30

Test 10

Group: 2

Verdict: ACCEPTED

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

correct output
41765

user output
41765

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)

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)