Advertisement
Korotkodul

ITMO N8

Dec 2nd, 2022 (edited)
713
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.16 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <queue>
  5. #include <algorithm>
  6. #include <string>
  7. #include <stack>
  8. #include <set>
  9. #include <map>
  10. #define pii pair <int, int>
  11. #define pb(x) push_back(x)
  12. using namespace std;
  13. using ll = long long;
  14. using ld = long double;
  15. using db = double;
  16. void cv(vector <int> &v) {
  17.     for (auto x : v) cout << x << ' ';
  18.     cout << "\n";
  19. }
  20.  
  21. void cvl(vector <ll> &v) {
  22.     for (auto x : v) cout << x << ' ';
  23.     cout << "\n";
  24. }
  25.  
  26.  
  27. void cvv(vector <vector <int> > &v) {
  28.     for (auto x : v) cv(x);
  29.     cout << "\n";
  30. }
  31.  
  32. void cvb(vector <bool> v) {
  33.     for (bool x : v) cout << x << ' ';
  34.     cout << "\n";
  35. }
  36.  
  37. void cvs(vector <string>  v) {
  38.     for (auto a : v) {
  39.         cout << a << "\n";
  40.     }
  41. }
  42.  
  43. void cvp(vector <pii> a) {
  44.     for (auto p : a) {
  45.         cout << p.first << ' ' << p.second << "\n";
  46.     }
  47.     cout << "\n";
  48. }
  49.  
  50. vector <vector <int> > m;
  51.  
  52. vector <int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
  53.  
  54. bool ok(int i, int j) {
  55.     return i >= 0 && j >= 0 && i < 8 && j < 8 && m[i][j] == 0;
  56. }
  57.  
  58. bool sh = 0;
  59.  
  60. void bld() {
  61.     m.assign(8, vector <int> (8, 0));
  62.     for (int i = 1; i <= 4; ++i) {
  63.         m[i][1] = 1;
  64.     }
  65.     for (int i = 3; i <= 6; ++i) {
  66.         m[i][6] = 1;
  67.     }
  68. }
  69. int cnt;
  70. void go(int i, int j) {
  71.     m[i][j] = 1;
  72.     cnt++;
  73.     if (sh) {
  74.         cout << i << ' ' << j << "\n";
  75.     }
  76.     for (int k = 0; k < 4; ++k) {
  77.         int x = i + dx[k];
  78.         int y = j + dy[k];
  79.         if (ok(x, y)) {
  80.             go(x, y);
  81.             break;
  82.         }
  83.     }
  84. }
  85.  
  86. int main() {
  87.     ios::sync_with_stdio(0);
  88.     cin.tie(0);
  89.     cout.tie(0);
  90.     int ans = 0;
  91.     //sh = 1;
  92.     for (int i = 0; i < 8; ++i) {
  93.         for (int j = 0; j < 8; ++j) {
  94.             bld();
  95.             cnt = 0;
  96.             if (!ok(i, j)) {
  97.                 continue;
  98.             }
  99.             if (sh) {
  100.                 cout << "GO i j = " << i << ' ' << j << "\n";
  101.             }
  102.             go(i, j);
  103.             if (cnt == 56) {
  104.                 cout << i << ' ' << j << "\n";
  105.                 ans++;
  106.             }
  107.         }
  108.     }
  109.     cout << "ans =  " << ans << "\n";
  110. }
  111.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement