CSES - Datatähti 2017 loppu

CSES - Datatähti 2017 loppu - Results

Submission details
Task:	Ruudukko
Sender:	JesseNiininen
Submission time:	2017-01-19 16:03:29 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	WRONG ANSWER	0.07 s	1	details
#4	WRONG ANSWER	0.05 s	1	details
#5	TIME LIMIT EXCEEDED	--	1	details
#6	TIME LIMIT EXCEEDED	--	1	details
#7	TIME LIMIT EXCEEDED	--	1	details
#8	TIME LIMIT EXCEEDED	--	1	details
#9	TIME LIMIT EXCEEDED	--	1	details
#10	ACCEPTED	0.03 s	2	details
#11	WRONG ANSWER	0.07 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	WRONG ANSWER	0.07 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

// g++ testi.cpp -o testi
// g++ -std=c++11 testi.cpp -o testi -O2
// g++ -std=c++11 ruudukko.cpp -o ruudukko -O2
 
 
#include <bits/stdc++.h>
typedef long long ll;
 
using namespace std;
 
int n;
vector<int> v;
 
bool check(){
	unordered_set<ll> used;
	for(int i = 0; i < n; i++){
		ll s = 0;
		for(int j = 0; j < n; j++){
			s += v[n * i + j];
		}
		if(used.find(s) != used.end())
			return false;
		used.insert(s);
	}
	for(int i = 0; i < n; i++){
		ll s = 0;
		for(int j = 0; j < n; j++){
			s += v[n * j + i];
		}
		if(used.find(s) != used.end())
			return false;
		used.insert(s);
	}
	return true;
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
 
	cin >> n;
	ll n2 = n * n;
	v.resize(n2);
	for(int i = 0; i < n2; i++)
		v[i] = (i / n) + 1;
 
	
	
	while(next_permutation(v.begin(), v.end())){
		if(check()){
			int lvl = 0;
			for(int i = 0; i < n2; i++){
				if(i / n > lvl){
					cout << "\n";
					lvl++;
				}
				cout << v[i];
			}
			return 0;
		}
	}
	cout << "QAQ";
 
}

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: WRONG ANSWER

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
`1112 1223 2344 3443` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

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
`11111 22222 33345 33445 45554` view save

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

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

Test 6

Group: 1

Verdict: TIME LIMIT EXCEEDED

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

Test 7

Group: 1

Verdict: TIME LIMIT EXCEEDED

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

Test 8

Group: 1

Verdict: TIME LIMIT EXCEEDED

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

Test 9

Group: 1

Verdict: TIME LIMIT EXCEEDED

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

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: WRONG ANSWER

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
`1112 1223 2344 3443` 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: WRONG ANSWER

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
`1112 1223 2344 3443` 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 2017 loppu

Ruudukko

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