CSES - Datatähti 2023 loppu - Results
Submission details
Task:Ruudukko
Sender:stpn129
Submission time:2023-01-21 15:42:07 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.00 s1, 2, 3details
#20.00 s1, 2, 3details
#30.00 s1, 2, 3details
#40.00 s1, 2, 3details
#50.01 s1, 2, 3details
#60.00 s1, 2, 3details
#70.00 s1, 2, 3details
#80.00 s1, 2, 3details
#90.00 s1, 2, 3details
#100.00 s1, 2, 3details
#110.00 s1, 2, 3details
#120.00 s1, 2, 3details
#130.00 s1, 2, 3details
#140.00 s1, 2, 3details
#150.00 s1, 2, 3details
#160.00 s1, 2, 3details
#170.01 s2, 3details
#180.00 s2, 3details
#190.00 s2, 3details
#200.00 s2, 3details
#210.02 s2, 3details
#220.00 s2, 3details
#230.00 s2, 3details
#240.01 s2, 3details
#250.19 s3details
#260.19 s3details
#270.19 s3details
#280.19 s3details
#290.19 s3details
#300.19 s3details
#310.19 s3details
#320.20 s3details
#330.19 s3details
#340.19 s3details
#350.19 s3details
#360.20 s3details

Code

#include<bits/stdc++.h>
using namespace std;
void init_code(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
bool cmp (pair<int, int> a, pair<int, int> b) {
return a.second < b.second;
}
const int mod = 1e9 + 7;
vector<pair<int, int>> moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int cycle = 0;
void dfs(pair<int, int> v, pair<int, int> p, vector<vector<int>>& res, vector<vector<int>>& used, int n, int m) {
if (used[v.first][v.second] == 1) {
cycle = 1;
return;
}
used[v.first][v.second] = 1;
for (auto mv : moves) {
int x = v.first + mv.first, y = v.second + mv.second;
if (x >= 0 && x < n && y >= 0 && y < m && res[x][y] == 0 && !(x == p.first && y == p.second)) {
dfs({x, y}, v, res, used, n, m);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> res (n, vector<int> (m));
vector<vector<int>> used (n, vector<int> (m));
int mn = 1 << (n * m);
for (int i = 0; i < mn; ++i) {
cycle = 0;
fill(res.begin(), res.end(), vector<int> (m, 0));
fill(used.begin(), used.end(), vector<int> (m, 0));
int x = i, cnt = 0;
while (x > 0) {
int t = x % 2;
if (t) {
int xcoord = cnt / m;
int ycoord = cnt % m;
res[xcoord][ycoord] = 1;
}
x >>= 1;
cnt++;
}
int sx = 0, sy = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (res[i][j] == 0) {
sx = i;
sy = j;
break;
}
}
}
if (res[sx][sy] == 1) {
continue;
} else {
dfs({sx, sy}, {-1, -1}, res, used, n, m);
//cout << cycle;
int check = cycle;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cout << used[i][j];
if (res[i][j] == 0 && used[i][j] == 0) {
check = 0;
}
if (res[i][j] == 1) {
for (auto mv : moves) {
int x = i + mv.first, y = j + mv.second;
if (x >= 0 && x < n && y >= 0 && y < m && res[x][y] == 1) {
check = 0;
}
}
}
if (check == 0) {
break;
}
}
}
if (check == 1) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (res[i][j] == 0) cout << '.';
else cout << '#';
}
cout << '\n';
}
cout << '\n';
return;
}
}
}
}
signed main() {
init_code();
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
/*
cubbli-guest@dx5-cs-b221-09:~$ cd Code
cubbli-guest@dx5-cs-b221-09:~/Code$ ls
code code.cpp input.txt output.txt
cubbli-guest@dx5-cs-b221-09:~/Code$ g++ code.cpp -o code
cubbli-guest@dx5-cs-b221-09:~/Code$ ./code
Segmentation fault (core dumped)
cubbli-guest@dx5-cs-b221-09:~/Code$
*/

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
1 1

correct output
.

user output
1

Test 2

Group: 1, 2, 3

Verdict:

input
1 2

correct output
..

user output
101

Test 3

Group: 1, 2, 3

Verdict:

input
1 3

correct output
...

user output
1010101

Test 4

Group: 1, 2, 3

Verdict:

input
1 4

correct output
....

user output
101010101010101

Test 5

Group: 1, 2, 3

Verdict:

input
2 1

correct output
.
.

user output
110110

Test 6

Group: 1, 2, 3

Verdict:

input
2 2

correct output
.#
..

user output
1111..
..

Test 7

Group: 1, 2, 3

Verdict:

input
2 3

correct output
.#.
...

user output
111111...
...

Test 8

Group: 1, 2, 3

Verdict:

input
2 4

correct output
.#.#
....

user output
11111111....
....

Test 9

Group: 1, 2, 3

Verdict:

input
3 1

correct output
.
.
.

user output
111011001001110010100

Test 10

Group: 1, 2, 3

Verdict:

input
3 2

correct output
.#
..
.#

user output
111111..
..
..

Test 11

Group: 1, 2, 3

Verdict:

input
3 3

correct output
.#.
...
.#.

user output
111111111...
...
...

Test 12

Group: 1, 2, 3

Verdict:

input
3 4

correct output
.#.#
....
.#.#

user output
111111111111....
....
....

Test 13

Group: 1, 2, 3

Verdict:

input
4 1

correct output
.
.
.
.

user output
111101110011001100010001000100...

Test 14

Group: 1, 2, 3

Verdict:

input
4 2

correct output
..
.#
..
#.

user output
11111111..
..
..
..

Test 15

Group: 1, 2, 3

Verdict:

input
4 3

correct output
...
.#.
..#
#..

user output
111111111111...
...
...
...

Test 16

Group: 1, 2, 3

Verdict:

input
4 4

correct output
....
.#.#
..#.
#...

user output
1111111111111111....
....
....
....

Test 17

Group: 2, 3

Verdict:

input
999 1

correct output
.
.
.
.
.
...

user output
111111111111111111111111111111...
Truncated

Test 18

Group: 2, 3

Verdict:

input
999 2

correct output
.#
..
.#
..
#.
...

user output
111111111111111111111111111111...
Truncated

Test 19

Group: 2, 3

Verdict:

input
999 3

correct output
.#.
...
.#.
..#
#..
...

user output
111111111111111111111111111111...
Truncated

Test 20

Group: 2, 3

Verdict:

input
999 4

correct output
.#.#
....
.#.#
..#.
#...
...

user output
111111111111111111111111111111...
Truncated

Test 21

Group: 2, 3

Verdict:

input
1000 1

correct output
.
.
.
.
.
...

user output
111111111111111111111111111111...
Truncated

Test 22

Group: 2, 3

Verdict:

input
1000 2

correct output
..
.#
..
#.
..
...

user output
111111111111111111111111111111...
Truncated

Test 23

Group: 2, 3

Verdict:

input
1000 3

correct output
...
.#.
..#
#..
..#
...

user output
111111111111111111111111111111...
Truncated

Test 24

Group: 2, 3

Verdict:

input
1000 4

correct output
....
.#.#
..#.
#...
..#.
...

user output
111111111111111111111111111111...
Truncated

Test 25

Group: 3

Verdict:

input
999 995

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 26

Group: 3

Verdict:

input
999 996

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 27

Group: 3

Verdict:

input
999 997

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 28

Group: 3

Verdict:

input
999 998

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 29

Group: 3

Verdict:

input
999 999

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 30

Group: 3

Verdict:

input
999 1000

correct output
.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...

user output
111111111111111111111111111111...
Truncated

Test 31

Group: 3

Verdict:

input
1000 995

correct output
.................................

user output
111111111111111111111111111111...
Truncated

Test 32

Group: 3

Verdict:

input
1000 996

correct output
.................................

user output
111111111111111111111111111111...
Truncated

Test 33

Group: 3

Verdict:

input
1000 997

correct output
.................................

user output
111111111111111111111111111111...
Truncated

Test 34

Group: 3

Verdict:

input
1000 998

correct output
.................................

user output
111111111111111111111111111111...
Truncated

Test 35

Group: 3

Verdict:

input
1000 999

correct output
.................................

user output
111111111111111111111111111111...
Truncated

Test 36

Group: 3

Verdict:

input
1000 1000

correct output
.................................

user output
111111111111111111111111111111...
Truncated