CSES - Datatähti Open 2017

Submission details
Task:	Grid
Sender:	zscoder
Submission time:	2017-01-21 08:46:06 +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.05 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	ACCEPTED	0.03 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.03 s	1	details
#6	ACCEPTED	0.03 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.03 s	1	details
#9	ACCEPTED	0.04 s	1	details
#10	ACCEPTED	0.03 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.03 s	3	details
#17	ACCEPTED	0.03 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

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

int a[1001][1001];
int n; 
int cnt[1001];

bool check()
{
	memset(cnt,0,sizeof(cnt));
	set<int> s;
	for(int i = 0; i < n; i++)
	{
		int sum = 0;
		for(int j = 0; j < n; j++)
		{
			if(!(a[i][j]>=1&&a[i][j]<=n)) return 0;
			cnt[a[i][j]]++;
			sum+=a[i][j];
		}
		s.insert(sum);
	}
	for(int j = 0; j < n; j++)
	{
		int sum = 0;
		for(int i = 0; i < n; i++)
		{
			sum+=a[i][j];
		}
		s.insert(sum);
	}
	//cerr<<s.size()<<endl;
	if(!(int(s.size()) == 2*n)) return 0;
	for(int i = 1; i <= n; i++) if(!(cnt[i]==n)){return 0;}
	return 1;
}

void out()
{
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			cout<<a[i][j]<<' ';
		}
		cout<<'\n';
	}
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	srand(1931);
	cin>>n;
	if(n<=3)
	{
		cout<<"QAQ"; return 0;
	}
	vi vec(n*n);
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			vec[i*n+j] = j+1;
		}
	}
	while(1)
	{
		random_shuffle(vec.begin(),vec.end());
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				a[i][j] = vec[i*n+j];
			}
		}
		if(check())
		{
			out();
			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
`4 3 3 2 2 4 1 1 2 3 1 1 3 4 4 2` 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 5 3 1 3 1 4 5 3 2 4 3 4 5 4 2 3 2 2 2 1 5 5 4` 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 4 6 3 3 1 5 4 3 3 2 2 2 3 5 6 3 5 1 6 5 6 1 6 1 2 4 4 4 2 ...` 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
`7 2 5 7 1 3 5 6 6 5 2 4 5 1 6 3 3 6 2 1 6 5 3 3 1 6 3 4 4 7 7 2 7 4 2 ...` 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
`7 3 8 7 3 5 5 4 5 4 6 5 8 4 5 4 7 1 3 8 4 1 2 3 3 5 6 8 7 4 8 2 2 5 2 2 4 6 1 1 ...` 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
`3 6 3 7 6 3 2 3 7 6 8 1 8 2 4 3 5 6 8 5 5 7 1 9 9 2 7 2 3 4 2 3 4 1 8 4 6 8 1 7 6 2 5 8 7 ...` 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
`4 6 6 9 9 10 9 10 7 10 3 6 1 3 8 2 6 7 7 10 3 3 8 9 4 8 2 7 2 9 3 9 4 4 6 9 7 8 10 1 1 3 8 1 7 5 1 4 2 8 ...` 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
`4 3 3 2 2 4 1 1 2 3 1 1 3 4 4 2` 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
`4 3 3 2 2 4 1 1 2 3 1 1 3 4 4 2` 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

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 (zscoder)