CSES - Leirikisa 6.3.2017 - Results
Submission details
Task:Aitaus
Sender:Kuha
Submission time:2017-03-06 15:50:28 +0200
Language:C++
Status:READY
Result:21
Feedback
groupverdictscore
#1ACCEPTED21
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1details
#2ACCEPTED0.04 s1details
#3ACCEPTED0.04 s1details
#4ACCEPTED0.03 s1details
#5ACCEPTED0.04 s1details
#60.04 s2details
#70.04 s2details
#80.04 s2details
#90.05 s2details
#100.04 s2details
#110.09 s3details
#120.11 s3details
#130.13 s3details
#140.10 s3details
#150.11 s3details

Code

#include <bits/stdc++.h>

#define ll long long 
#define pii pair<int, int>
#define pllk pair<long long, long long>
#define M 1000000007
#define INF 0x5ADFACE5
#define LINF 0x51DEEFFEC7C0DECALL
#define N (1<<18)

using namespace std;

ll dp[1<<10];

int main () {
	int n;
	cin>>n;
	vector<ll> v(n);
	for (int i = 0; i < n; i++) {
		cin>>v[i];
	}
	for (int i = 1; i < (1<<n); i++) {
		ll s = 0;
		ll b = 0;
		for (int j = 0; j < n; j++) {
			if (i & (1<<j)) s += v[j], b++;
		}
		if (b > 1) dp[i] = LINF;
		for (int j = (i - 1) & i; j; j = (j - 1) & i) {
			dp[i] = min(dp[i], s + dp[j] + dp[j ^ i]);
		}
		//cout<<dp[i]<<" ";
	}
	cout<<dp[(1<<n) - 1]<<endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10
1 1 1 1 1 1 1 1 1 1

correct output
34

user output
34

Test 2

Group: 1

Verdict: ACCEPTED

input
10
1000 1000 1000 1000 1000 1000 ...

correct output
34000

user output
34000

Test 3

Group: 1

Verdict: ACCEPTED

input
10
713 590 643 971 889 796 972 3 ...

correct output
18501

user output
18501

Test 4

Group: 1

Verdict: ACCEPTED

input
10
991 740 433 558 522 338 240 27...

correct output
15614

user output
15614

Test 5

Group: 1

Verdict: ACCEPTED

input
10
397 775 568 796 632 898 214 84...

correct output
20791

user output
20791

Test 6

Group: 2

Verdict:

input
1000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
9976

user output
-8144900705496925872

Test 7

Group: 2

Verdict:

input
1000
1000000000 1000000000 10000000...

correct output
9976000000000

user output
-8144899937496926640

Test 8

Group: 2

Verdict:

input
1000
377480143 777745434 296992200 ...

correct output
4829974948360

user output
-8144900333951077140

Test 9

Group: 2

Verdict:

input
1000
599885439 985529375 118284730 ...

correct output
4880180545408

user output
-8144900314763149206

Test 10

Group: 2

Verdict:

input
1000
695015028 950574688 862418845 ...

correct output
5089402448969

user output
-8144900303618027217

Test 11

Group: 3

Verdict:

input
100000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1668928

user output
0

Test 12

Group: 3

Verdict:

input
100000
1000000000 1000000000 10000000...

correct output
1668928000000000

user output
0

Test 13

Group: 3

Verdict:

input
100000
391395666 905124111 713186504 ...

correct output
818091245007558

user output
0

Test 14

Group: 3

Verdict:

input
100000
535008265 825579494 118746814 ...

correct output
819167891088786

user output
0

Test 15

Group: 3

Verdict:

input
100000
386356481 309596857 386341601 ...

correct output
816647450882063

user output
0