CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Grid
Sender:	Lumibons
Submission time:	2017-01-22 21:16:45 +0200
Language:	C++
Status:	READY
Result:	35

Feedback
group	verdict	score
#1	ACCEPTED	35
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.04 s	1	details
#2	ACCEPTED	0.03 s	1	details
#3	ACCEPTED	0.03 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.04 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.06 s	1	details
#8	ACCEPTED	0.13 s	1	details
#9	ACCEPTED	0.55 s	1	details
#10	ACCEPTED	0.04 s	2	details
#11	ACCEPTED	0.04 s	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	ACCEPTED	0.05 s	3	details
#17	ACCEPTED	0.04 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	TIME LIMIT EXCEEDED	--	3	details

Compiler report

input/code.cpp: In function 'void dis(int, int)':
input/code.cpp:40:13: warning: statement has no effect [-Wunused-value]
   for (pos[y]; pos[y] < s + i; pos[y]++)
             ^
input/code.cpp:50:13: warning: statement has no effect [-Wunused-value]
   for (pos[y]; pos[y] >= s; pos[y]--)
             ^

Code

#include <iostream>

using namespace std;

int n, grid[1000][1000], sum[2][1000], amount[1001], pos[1000];
bool found, sums[1000001];

int min(int a, int b) {
	return a < b ? a : b;
}

void dis(int z, int y) {
	if (amount[z] == 0)
	{
		if (z == n)
		{
			found = true;
			for (int i = n; i <= n * n; i++)
				sums[i] = false;
			for (int i = 0; i < 2 && found; i++)
			{
				for (int j = 0; j < n && found; j++)
				{
					if (sums[sum[i][j]])
						found = false;
					else
						sums[sum[i][j]] = true;
				}
			}
		}
		else
			dis(z + 1, 0);
		return;
	}
	if (y == n)
		return;
	for (int i = min(amount[z], n - pos[y]); i >= 0 && !found; i--)
	{
		int s = pos[y];
		for (pos[y]; pos[y] < s + i; pos[y]++)
		{
			grid[pos[y]][y] = z;
			sum[0][pos[y]] += z;
			sum[1][y] += z;
		}
		amount[z] -= i;
		dis(z, y + 1);
		amount[z] += i;
		pos[y]--;
		for (pos[y]; pos[y] >= s; pos[y]--)
		{
			sum[0][pos[y]] -= z;
			sum[1][y] -= z;
		}
		pos[y]++;
	}
}

int main() {
	cin >> n;

	for (int i = 0; i <= n; i++)
		amount[i] = n;

	dis(1, 0);

	if (found)
	{
		for (int y = 0; y < n; y++)
		{
			cout << grid[0][y];
			for (int x = 1; x < n; x++)
				cout << " " << grid[x][y];
			cout << endl;
		}
	}
	else
		cout << "QAQ" << endl;

	/*cout << endl << "Press enter to continue...";
	cin.ignore(numeric_limits<streamsize>::max(), '\n');
	cin.get();*/

	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 1 2 1 2 3 4 2 2 4 4 3 3 3 4` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`2 3 4 1 1 3 4 2 1 2 4 2 3 1 3 4 3 2 1 4 5 5 5 5 5` view save

user output
`1 1 1 1 1 2 2 2 2 2 3 3 4 4 5 3 3 4 5 5 3 4 4 5 5` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`2 3 4 5 1 1 3 4 5 2 1 2 4 5 2 3 1 3 5 2 3 4 1 4 5 4 3 2 1 5 ...` view save

user output
`1 1 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3 4 3 4 5 5 5 6 4 4 5 5 6 6 ...` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`2 3 4 5 6 1 1 3 4 5 6 2 1 2 4 5 6 2 3 1 3 5 6 2 3 4 1 4 6 2 3 4 5 1 5 ...` view save

user output
`1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 4 7 4 5 5 5 6 6 6 ...` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`2 3 4 5 6 7 1 1 3 4 5 6 7 2 1 2 4 5 6 7 2 3 1 3 5 6 7 2 3 4 1 4 6 7 2 3 4 5 1 5 ...` view save

user output
`1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 6 6 ...` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`2 3 4 5 6 7 8 1 1 3 4 5 6 7 8 2 1 2 4 5 6 7 8 2 3 1 3 5 6 7 8 2 3 4 1 4 6 7 8 2 3 4 5 1 5 ...` view save

user output
`1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 ...` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`2 3 4 5 6 7 8 9 1 1 3 4 5 6 7 8 9 2 1 2 4 5 6 7 8 9 2 3 1 3 5 6 7 8 9 2 3 4 1 4 6 7 8 9 2 3 4 5 1 5 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 ...` view save

Test 10

Group: 2

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 1 2 1 2 3 4 2 2 4 4 3 3 3 4` view save

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`29` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`48` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`80` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`97` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 16

Group: 3

Verdict: ACCEPTED

input
`3` view save

correct output
`QAQ` view save

user output
`QAQ` view save

Test 17

Group: 3

Verdict: ACCEPTED

input
`4` view save

correct output
`3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1` view save

user output
`1 1 1 2 1 2 3 4 2 2 4 4 3 3 3 4` view save

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`111` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`506` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`844` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`991` view save

correct output
`2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
(empty)

Datatähti Open 2017

Grid

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Tasks

Submissions (Lumibons)