Submission #75017743


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

mt19937_64    rng(chrono::steady_clock::now().time_since_epoch().count());

#define       nline                     "\n"
#define       pb                        push_back
#define       ppb                       pop_back
#define       mp                        make_pair
#define       ff                        first
#define       ss                        second
#define       fall(x, n)                for(int x=0; x<n; x++)
#define       rall(x, n)                for(int x=n-1; x>=0; x--)
#define       frange(x, start, end)     for(int x=start; x<=end; x++)
#define       rrange(x, start, end)     for(int x=start; x>=end; x--)
#define       in(i, v)                  for(auto &i: v) cin >> i;
#define       vi                        vector<int>
#define       ii                        pair<int, int>
#define       sz(x)                     ((int)(x).size())
#define       all(x)                    (x).begin(), (x).end()
#define       mod                       1000000007
#define       INF                       0x1fffffffffffffffLL

typedef       long long                 ll;
typedef       unsigned long long        ull;
typedef       long double               lld;

#ifdef        LOCAL
#include      "debug.h"
#else
#define       debug(x)
#endif

#define       int                       long long

void solve()
{
    int n, m; cin >> n >> m;
    vector<vector<char>> v(n, vector<char>(m));
    fall(i, n) in(j, v[i]);
    fall(i, n) {
        fall(j, m) {
            if (v[i][j] == '.') continue;
            int cnt = 0;
            cnt += (i + 1 < n) ? v[i + 1][j] == '#' : 0;
            cnt += (i - 1 >= 0) ? v[i - 1][j] == '#' : 0;
            cnt += (j + 1 < m) ? v[i][j + 1] == '#' : 0;
            cnt += (j - 1 >= 0) ? v[i][j - 1] == '#' : 0;
            if (cnt != 2 && cnt != 4) {
                cout << "No\n";
                return;
            }
        }
    }
    cout << "Yes\n";
}

signed main()
{
#ifdef LOCAL
    freopen("i.txt", "r", stdin); freopen("o.txt", "w", stdout); freopen("e.txt", "w", stderr);
#endif
    auto begin = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
    while (t--) solve();
    auto end = chrono::high_resolution_clock::now();
    auto elapsed = chrono::duration_cast<chrono::nanoseconds>(end - begin);
    cerr << fixed << "Time measured <= *_* => " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

Submission Info

Submission Time
Task D - Looped Rope
User kumaresh_rk
Language C++23 (GCC 15.2.0)
Score 200
Code Size 2552 Byte
Status AC
Exec Time 1 ms
Memory 3924 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 25
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 02_handmade_14.txt, 02_handmade_15.txt, 02_handmade_16.txt, 02_handmade_17.txt, 02_handmade_18.txt, 02_handmade_19.txt, 02_handmade_20.txt, 02_handmade_21.txt, 02_handmade_22.txt, 02_handmade_23.txt, 02_handmade_24.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3908 KiB
00_sample_01.txt AC 1 ms 3812 KiB
00_sample_02.txt AC 1 ms 3816 KiB
00_sample_03.txt AC 1 ms 3876 KiB
01_random_04.txt AC 1 ms 3784 KiB
01_random_05.txt AC 1 ms 3816 KiB
01_random_06.txt AC 1 ms 3772 KiB
01_random_07.txt AC 1 ms 3816 KiB
01_random_08.txt AC 1 ms 3812 KiB
01_random_09.txt AC 1 ms 3808 KiB
01_random_10.txt AC 1 ms 3808 KiB
01_random_11.txt AC 1 ms 3808 KiB
01_random_12.txt AC 1 ms 3808 KiB
01_random_13.txt AC 1 ms 3848 KiB
02_handmade_14.txt AC 1 ms 3848 KiB
02_handmade_15.txt AC 1 ms 3816 KiB
02_handmade_16.txt AC 1 ms 3812 KiB
02_handmade_17.txt AC 1 ms 3924 KiB
02_handmade_18.txt AC 1 ms 3840 KiB
02_handmade_19.txt AC 1 ms 3816 KiB
02_handmade_20.txt AC 1 ms 3808 KiB
02_handmade_21.txt AC 1 ms 3812 KiB
02_handmade_22.txt AC 1 ms 3812 KiB
02_handmade_23.txt AC 1 ms 3848 KiB
02_handmade_24.txt AC 1 ms 3812 KiB