Submission #1003343

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1003343	2024-06-20T09:04:53 Z	Nailuj_217	Dijamant (COCI22_dijamant)	C++17	0 / 70	1 ms	604 KB

Main

#include <bits/stdc++.h>
#define l long long
using namespace std;


const l INF = 1LL<<15;

array<vector<l>, 2005> rows;
array<l, 2005> positions;



int main() {

    l n, m;
    cin >> n >> m;
    string row;

    l sum = 0;

    for (int i = 1; i <= n; i++) {
        cin >> row;
        for (int j = 0; j < row.size(); j++) {
            if (row[j] == '#') rows[i].push_back(j+1);
        }
    }
    l dist_to_left;

    for (int i = 2; i < n; i++) {
        positions.fill(0);
        for (int j = 1; j < m; j++) {
            for (int k = 1; k <= n; k++) {
                if (positions[k] == INF) continue;
                if (rows[k].empty()) {
                    positions[k] = INF;
                    continue;
                }
                if (rows[k][positions[k]] < j) {
                    positions[k] = 0;
                    // if (rows[k].size() > positions[k]+1) positions[k]++;
                    // else positions[k] = INF;
                }
            }
            /*
            if (!positions[i]) continue;
            if (positions[i] == INF) continue;
            dist_to_left = j - rows[i][positions[i]-1];
            if (i - dist_to_left < 1 || i + dist_to_left > n || j + dist_to_left > m) continue;
            if (j + dist_to_left != rows[i][positions[i]]) continue;

            bool is_valid = true;

            for (int k = i-dist_to_left+1; k < i+dist_to_left; k++)
                if (!positions[k] || positions[k] == INF) 
                    is_valid = false;
            if (!is_valid) continue;
            l c = 0;
            for (int k = i - dist_to_left; k < i; k++) {
                assert(k > 0);
                if (positions[k] == INF) {
                    is_valid = false;
                    break;
                }
                if (c == 0) {
                    if (rows[k][positions[k]] != j) {
                        is_valid = false;
                        break;
                    }
                } else {
                    if (positions[k] == 0 || rows[k][positions[k]-1] != j-c) {
                        is_valid = false;
                        break;
                    } 
                    if (positions[k] == 0 || rows[k][positions[k]] != j+c) {
                        is_valid = false;
                        break;
                    } 
                }
                c++;
            }
            c = 0;
            for (int k = i + dist_to_left; k > i; k--) {
                assert(k <= n);
                if (positions[k] == INF) {
                    is_valid = false;
                    break;
                }
                if (c == 0) {
                    if (rows[k][positions[k]] != j) {
                        is_valid = false;
                        break;
                    }
                } else {
                    if (positions[k] == 0 || rows[k][positions[k]-1] != j-c) {
                        is_valid = false;
                        break;
                    } 
                    if (positions[k] == 0 || rows[k][positions[k]] != j+c) {
                        is_valid = false;
                        break;
                    } 
                }
                c++;
            }
            if (is_valid) {
                sum++;
             continue;}
            */

        }
    }



    cout << sum << endl;





    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int j = 0; j < row.size(); j++) {
      |                         ~~^~~~~~~~~~~~
Main.cpp:27:7: warning: unused variable 'dist_to_left' [-Wunused-variable]
   27 |     l dist_to_left;
      |       ^~~~~~~~~~~~

Subtask #1

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Incorrect	1 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Incorrect	1 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-