Karuselli

#include<bits/stdc++.h>
using namespace std;

int x[14][(int)1e5];
int e[(int)1e5];
int n, m;
long long d = 0;

void r(int a, int s) {

	if (a >= n) {
		if (d < s) d = s;
		return;
	}

	for (int i = 0; i < m; ++i) {
		if (e[i]) continue;
		e[i] = 1;
		r(a + 1, s + x[a][i]);
		e[i] = 0;
	}
}

int main() {

	cin >> n >> m;

	for (int i = 0; i < n; ++i) {
		for (int ii = 0; ii < m; ++ii) {
			cin >> x[i][ii];
		}
	}

	memset(e, 0, sizeof(int) * m);
	r(0, 0);
	cout << d << "\n";
	
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED