Submission #36068596

Source Code Expand

#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
typedef unsigned long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll EMOD = 998244353;
const ll LINF = 1e18;
using namespace std;
int dist(int x1, int y1, int x2, int y2) {
	int ans = ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
	return ans;
}
int main() {
	vector<string> S(9);
	for (int i = 0; i < 9; i++) {
		cin >> S[i];
	}
	int cnt = 0;
	int ans = 0;
	for (int i1 = 0; i1 < 9; i1++) {
		for (int i2 = 0; i2 < 9; i2++) {

			for (int j1 = i1; j1 < 9; j1++) {

				for (int j2 = 0; j2 < 9; j2++) {

					for (int k1 = 0; k1 < 9; k1++) {

						for (int k2 = max(i2,j2); k2 < 9; k2++) {

							for (int s1 = k1; s1 < 9; s1++) {

								for (int s2 = max(i2,j2); s2 < 9; s2++) {
									if (dist(i1, i2, j1, j2) > 0 && dist(j1, j2, s1, s2)>0 && dist(k1, k2, s1, s2 > 0) && dist(k1, k2, i1, i2) > 0&&dist(i1,i2,s1,s2)>0&&dist(j1,j2,k1,k2)>0) {
										if (dist(i1, i2, j1, j2) == dist(j1, j2, s1, s2) && dist(k1, k2, s1, s2) == dist(j1, j2, s1, s2) && dist(k1, k2, s1, s2) == dist(k1, k2, i1, i2) && dist(k1, k2, i1, i2) == dist(i1, i2, j1, j2)) {
											if (S[i1][i2] == '#' && S[j1][j2] == '#' && S[k1][k2] == '#' && S[s1][s2] == '#') {
												ans++;
												if (i2 == s2 && k1 == j1 || i1 == s1 && k2 == j2) {
													cnt++;
												}
											}
										}
									}
								}
							}
						}
					}
				}
			}
		}
	}

		cout << ans-cnt/2<< endl;
		return 0;
	}

Submission Info

Submission Time
Task C - Counting Squares
User amaoto
Language C++ (GCC 9.2.1)
Score 0
Code Size 1534 Byte
Status WA
Exec Time 20 ms
Memory 3544 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:26: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
   38 |             if (i2 == s2 && k1 == j1 || i1 == s1 && k2 == j2) {
      |                 ~~~~~~~~~^~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 4
WA × 11
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 14 ms 3392 KiB
00_sample_02.txt AC 14 ms 3500 KiB
01_test_01.txt AC 16 ms 3452 KiB
01_test_02.txt WA 17 ms 3408 KiB
01_test_03.txt WA 20 ms 3420 KiB
01_test_04.txt WA 15 ms 3412 KiB
01_test_05.txt AC 15 ms 3396 KiB
01_test_06.txt WA 14 ms 3544 KiB
01_test_07.txt WA 15 ms 3532 KiB
01_test_08.txt WA 15 ms 3348 KiB
01_test_09.txt WA 15 ms 3452 KiB
01_test_10.txt WA 15 ms 3408 KiB
01_test_11.txt WA 15 ms 3408 KiB
01_test_12.txt WA 15 ms 3424 KiB
01_test_13.txt WA 14 ms 3408 KiB