Submission #686748

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
686748	2023-01-25T22:06:51 Z	YENGOYAN	Dijamant (COCI22_dijamant)	C++17	0 / 70	1 ms	596 KB

Main

/*
	//\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
	\\                                    //
	//  271828___182845__904523__53602__  \\
	\\  87___47____13______52____66__24_  //
	//  97___75____72______47____09___36  \\
	\\  999595_____74______96____69___67  //
	//  62___77____24______07____66__30_  \\
	\\  35___35____47______59____45713__  //
	//                                    \\
	\\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
												*/

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 3e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;

void solve() {
	int n, m; cin >> n >> m;
	vector<string> v(n);
	for (int i = 0; i < n; ++i) cin >> v[i];
	vector<vector<int>> van(n);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (v[i][j] == '#') van[i].push_back(j);
		}
	}
	vector<vector<bool>> uxix_dzax(n, vector<bool>(m)), uxix_aj(n, vector<bool> (m));
	for (int i = 1; i < n; ++i) {
		for (int j = 0; j + 1 < van[i].size(); ++j) {
			int l = van[i][j], r = van[i][j + 1];
			if (l % 2 != r % 2) continue;
			if (r - l == 2) {
				if (v[i - 1][l + 1] == '#') {
					uxix_dzax[i][l] = uxix_aj[i][r] = 1;
				}
			}
			else {
				if (uxix_dzax[i - 1][l + 1] && uxix_aj[i - 1][r - 1]) {
					uxix_aj[i][r] = uxix_dzax[i][l] = 1;
				}
			}
		}
	}
	vector<vector<bool>> tars_dzax(n, vector<bool>(m)), tars_aj(n, vector<bool>(m));
	for (int i = n - 2; i >= 0; --i) {
		for (int j = 0; j + 1 < van[i].size(); ++j) {
			int l = van[i][j], r = van[i][j + 1];
			if (l % 2 != r % 2) continue;
			if (r - l == 2) {
				if (v[i - 1][l + 1] == '#') {
					tars_dzax[i][l] = tars_aj[i][r] = 1;
				}
			}
			else {
				if (tars_dzax[i + 1][l + 1] && tars_aj[i + 1][r - 1]) {
					tars_dzax[i][l] = tars_aj[i][r] = 1;
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j + 1 < van[i].size(); ++j) {
			int l = van[i][j], r = van[i][j + 1];
			if (!uxix_dzax[i][l] || !uxix_aj[i][r]) continue;
			if (!tars_dzax[i][l] || !tars_aj[i][r]) continue;
			++ans;
		}
	}
	cout << ans;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	//int t; cin >> t;
	//while (t--)	
	solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:53:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for (int j = 0; j + 1 < van[i].size(); ++j) {
      |                   ~~~~~~^~~~~~~~~~~~~~~
Main.cpp:70:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for (int j = 0; j + 1 < van[i].size(); ++j) {
      |                   ~~~~~~^~~~~~~~~~~~~~~
Main.cpp:87:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |   for (int j = 0; j + 1 < van[i].size(); ++j) {
      |                   ~~~~~~^~~~~~~~~~~~~~~

Subtask #1

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Runtime error	1 ms	596 KB	Execution killed with signal 11
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Runtime error	1 ms	596 KB	Execution killed with signal 11
4	Halted	0 ms	0 KB	-