CSES - Datatähti 2023 loppu

Submission details
Task:	Ruudukko
Sender:	stpn129
Submission time:	2023-01-21 15:47:48 +0200
Language:	C++ (C++20)
Status:	READY
Result:	11

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.00 s	1, 2, 3	details
#5	ACCEPTED	0.00 s	1, 2, 3	details
#6	ACCEPTED	0.00 s	1, 2, 3	details
#7	ACCEPTED	0.00 s	1, 2, 3	details
#8	ACCEPTED	0.00 s	1, 2, 3	details
#9	ACCEPTED	0.00 s	1, 2, 3	details
#10	ACCEPTED	0.00 s	1, 2, 3	details
#11	ACCEPTED	0.00 s	1, 2, 3	details
#12	ACCEPTED	0.00 s	1, 2, 3	details
#13	ACCEPTED	0.00 s	1, 2, 3	details
#14	ACCEPTED	0.00 s	1, 2, 3	details
#15	ACCEPTED	0.00 s	1, 2, 3	details
#16	ACCEPTED	0.00 s	1, 2, 3	details
#17	ACCEPTED	0.00 s	2, 3	details
#18	TIME LIMIT EXCEEDED	--	2, 3	details
#19	TIME LIMIT EXCEEDED	--	2, 3	details
#20	TIME LIMIT EXCEEDED	--	2, 3	details
#21	ACCEPTED	0.00 s	2, 3	details
#22	TIME LIMIT EXCEEDED	--	2, 3	details
#23	TIME LIMIT EXCEEDED	--	2, 3	details
#24	WRONG ANSWER	0.00 s	2, 3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	WRONG ANSWER	0.46 s	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details
#31	TIME LIMIT EXCEEDED	--	3	details
#32	WRONG ANSWER	0.12 s	3	details
#33	TIME LIMIT EXCEEDED	--	3	details
#34	TIME LIMIT EXCEEDED	--	3	details
#35	TIME LIMIT EXCEEDED	--	3	details
#36	WRONG ANSWER	0.12 s	3	details

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) {
   //cout << v.first << ' ' << v.second << ' ' << used[v.first][v.second]  <<'\n';
   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;
            }
         }
      }

      //cout << sx << ' ' << sy << '\n';
      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) {
               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: ACCEPTED

input
`1 1` view save

correct output
`.` view save

user output
`.` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2` view save

correct output
`..` view save

user output
`..` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3` view save

correct output
`...` view save

user output
`...` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 4` view save

correct output
`....` view save

user output
`....` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1` view save

correct output
`. .` view save

user output
`. .` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 2` view save

correct output
`.# ..` view save

user output
`#. ..` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 3` view save

correct output
`.#. ...` view save

user output
`.#. ...` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 4` view save

correct output
`.#.# ....` view save

user output
`#.#. ....` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1` view save

correct output
`. . .` view save

user output
`. . .` view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 2` view save

correct output
`.# .. .#` view save

user output
`.. #. ..` view save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 3` view save

correct output
`.#. ... .#.` view save

user output
`#.. .#. ...` view save

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 4` view save

correct output
`.#.# .... .#.#` view save

user output
`...# #.#. ....` view save

Test 13

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 1` view save

correct output
`. . . .` view save

user output
`. . . .` view save

Test 14

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 2` view save

correct output
`.. .# .. #.` view save

user output
`#. .. #. ..` view save

Test 15

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 3` view save

correct output
`... .#. ..# #..` view save

user output
`..# #.. .#. ...` view save

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

input
`4 4` view save

correct output
`.... .#.# ..#. #...` view save

user output
`...# .#.. #.#. ....` view save

Test 17

Group: 2, 3

Verdict: ACCEPTED

input
`999 1` view save

correct output
`. . . . . ...` view save

user output
`. . . . . ...` Truncated

Test 18

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`999 2` view save

correct output
`.# .. .# .. #. ...` view save

user output
(empty)

Test 19

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`999 3` view save

correct output
`.#. ... .#. ..# #.. ...` view save

user output
(empty)

Test 20

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`999 4` view save

correct output
`.#.# .... .#.# ..#. #... ...` view save

user output
(empty)

Test 21

Group: 2, 3

Verdict: ACCEPTED

input
`1000 1` view save

correct output
`. . . . . ...` view save

user output
`. . . . . ...` Truncated

Test 22

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 2` view save

correct output
`.. .# .. #. .. ...` view save

user output
(empty)

Test 23

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 3` view save

correct output
`... .#. ..# #.. ..# ...` view save

user output
(empty)

Test 24

Group: 2, 3

Verdict: WRONG ANSWER

input
`1000 4` view save

correct output
`.... .#.# ..#. #... ..#. ...` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`999 995` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`999 996` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`999 997` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`999 998` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`999 999` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`999 1000` view save

correct output
`.#.#.#.#.#.#.#.#.#.#.#.#.#.#.#...` view save

user output
(empty)

Test 31

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 995` view save

correct output
`.................................` view save

user output
(empty)

Test 32

Group: 3

Verdict: WRONG ANSWER

input
`1000 996` view save

correct output
`.................................` view save

user output
(empty)

Test 33

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 997` view save

correct output
`.................................` view save

user output
(empty)

Test 34

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 998` view save

correct output
`.................................` view save

user output
(empty)

Test 35

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 999` view save

correct output
`.................................` view save

user output
(empty)

Test 36

Group: 3

Verdict: WRONG ANSWER

input
`1000 1000` view save

correct output
`.................................` view save

user output
(empty)

Datatähti 2023 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

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Tasks

Submissions (stpn129)