oj.uz

답안 #568154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568154 2022-05-24T17:51:13 Z dxz05 Dijamant (COCI22_dijamant) C++14
70 / 70
 121 ms 73448 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 2222;

int a[M][M];
int d[M][M];
int up[M][M], down[M][M];

void solve(int TC) {
    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= n; i++){
        int last = 0;
        for (int j = 1; j <= m; j++){
            a[i][j] = -1e9;

            char c;
            cin >> c;

            if (c == '#'){
                a[i][j] = -1;
                if (last != 0 && j % 2 == last % 2){
                    a[i][(j + last) / 2] = j - last - 1;
                }
                last = j;
            }
        }
    }

    for (int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            d[i][j] = a[i][j] - a[i - 1][j];
        }
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            up[i][j] = (d[i][j] == 2 ? up[i - 1][j] + 1 : 0);
        }
    }

    for (int i = n; i >= 1; i--){
        for (int j = 1; j <= m; j++){
            down[i][j] = (d[i + 1][j] == -2 ? down[i + 1][j] + 1 : 0);
        }
    }

    int cnt = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            if (up[i][j] == down[i][j] && up[i][j] * 2 - 1 == a[i][j] && a[i][j] != -1) cnt++;
        }
    }

    cout << cnt << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 1 ms 2004 KB Output is correct
3 Correct 1 ms 2004 KB Output is correct
4 Correct 1 ms 2004 KB Output is correct
5 Correct 1 ms 2028 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 2004 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 2004 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2004 KB Output is correct
2 Correct 1 ms 2004 KB Output is correct
3 Correct 1 ms 2004 KB Output is correct
4 Correct 1 ms 2004 KB Output is correct
5 Correct 1 ms 2028 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 2 ms 2004 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 2004 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 1 ms 2004 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 78 ms 70320 KB Output is correct
15 Correct 82 ms 69416 KB Output is correct
16 Correct 121 ms 69348 KB Output is correct
17 Correct 88 ms 70092 KB Output is correct
18 Correct 102 ms 73448 KB Output is correct
19 Correct 77 ms 67700 KB Output is correct
20 Correct 84 ms 72908 KB Output is correct
21 Correct 74 ms 66632 KB Output is correct
22 Correct 99 ms 72360 KB Output is correct
23 Correct 88 ms 66288 KB Output is correct
24 Correct 97 ms 71812 KB Output is correct
25 Correct 71 ms 67356 KB Output is correct
26 Correct 76 ms 67276 KB Output is correct