CSES - Datatähti Open 2017

CSES - Datatähti Open 2017 - Results

Submission details
Task:	Grid
Sender:	FredrikEkholm
Submission time:	2017-01-22 19:28:00 +0200
Language:	C++
Status:	READY
Result:	35

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.03 s	1	details
#2	ACCEPTED	0.06 s	1	details
#3	ACCEPTED	0.04 s	1	details
#4	ACCEPTED	0.04 s	1	details
#5	ACCEPTED	0.04 s	1	details
#6	ACCEPTED	0.06 s	1	details
#7	ACCEPTED	0.04 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.06 s	1	details
#10	ACCEPTED	0.04 s	2	details
#11	ACCEPTED	0.04 s	2	details
#12	WRONG ANSWER	0.17 s	2	details
#13	WRONG ANSWER	0.33 s	2	details
#14	WRONG ANSWER	0.76 s	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	ACCEPTED	0.04 s	3	details
#17	ACCEPTED	0.04 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	RUNTIME ERROR	0.18 s	3	details
#20	RUNTIME ERROR	0.19 s	3	details
#21	RUNTIME ERROR	0.25 s	3	details

Code

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < int(b); ++i)
#define trav(a, v) for(auto& a : v)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define D(x) cerr << #x << " = " << x << endl

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	int n;
	cin>>n;
	int nums[101];
	vector<int> rowSums(n);
	vector<int> colSums(n);
	int grid[101][101];
	srand (time(NULL));
	rep(x,0,5000){
		rep(i,0,101)
			nums[i] = 0;
		rowSums.resize(0);
		colSums.resize(0);
		rowSums.resize(n);
		colSums.resize(n);
		rep(i,0,n){
			int rowSum = 0;
			rep(j,0,n){
				int number = (rand()%n) + 1;
				while(nums[number]==n){
					number = (rand()%n) + 1;
				}
				++nums[number];
				grid[i][j] = number;
				rowSum += number;
				colSums[j] += number;
			}
			rowSums[i] = rowSum;
		}
		vector<int> allSums = rowSums;
		allSums.insert( allSums.end(), colSums.begin(), colSums.end() );
		sort( allSums.begin(), allSums.end());
		//rep(i,0,allSums.size())
		//	cout<<allSums[i]<<" ";
		//cout<<endl;
		if (adjacent_find (allSums.begin(), allSums.end())==allSums.end()){
			rep(i,0,n){
				rep(j,0,n){
					cout << grid[i][j] << " ";
				}
				cout<<endl;
			}
			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: 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
`2 2 1 3 2 1 1 1 4 3 2 4 4 4 3 3` 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
`2 1 2 3 5 2 1 1 3 4 5 2 3 4 1 5 2 5 5 3 4 1 3 4 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 3 1 3 1 6 4 6 6 1 3 4 4 5 1 1 2 3 4 6 4 5 4 2 5 6 2 3 2 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
`5 5 7 5 4 6 4 3 5 5 1 5 3 5 1 4 2 2 1 7 1 4 7 6 1 3 3 1 4 7 3 6 6 7 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
`8 1 1 8 2 5 3 5 3 1 6 8 4 7 4 5 2 3 7 6 4 7 5 5 6 2 5 1 1 3 5 8 3 6 8 4 2 2 1 4 ...` 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 9 8 2 1 8 3 3 4 5 5 5 2 3 2 5 9 9 7 8 7 6 2 1 7 6 7 7 3 4 7 3 1 3 2 8 2 2 8 3 5 4 5 6 ...` 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
`9 6 8 2 8 7 3 6 8 6 6 10 5 3 1 7 9 7 8 9 7 7 4 8 3 4 8 2 2 6 5 1 1 2 4 10 1 6 5 8 1 2 9 5 7 1 1 5 7 10 ...` 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 3 1 1 2 1 3 1 2 2 4 2 4 4` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`29` view save

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

user output
`QAQ` view save

Test 13

Group: 2

Verdict: WRONG ANSWER

input
`48` view save

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

user output
`QAQ` view save

Test 14

Group: 2

Verdict: WRONG ANSWER

input
`80` view save

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

user output
`QAQ` view save

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
`3 4 4 3 2 4 3 3 1 4 2 1 1 1 2 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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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