Submission #1871952
Source Code Expand
#include <bits/stdc++.h>
typedef long long int ll;
#define FOR(i, a, b) for (ll i = (signed)(a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define MOD 1000000007
#define pb push_back
#define INF 93193111451418101
#define MIN -93193111451418101
#define EPS 1e-11
#define tp(a, b, c) make_tuple(a, b, c)
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))
using namespace std;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) {
for (auto &i : arr) {
fill_all(i, v);
}
}
//------------------変数-----------------------//
ll h, w, k;
char grid[501][501];
bool vis[501][501];
//-------------------関数----------------------//
bool in(ll y, ll x) {
if (x < 0 || y < 0 || x == w || y == h)
return 0;
return 1;
}
ll DFS(ll x, ll y, ll cnt) {
ll xy[] = {0, 1, 0, -1, 0};
vis[x][y] = 1;
if (cnt == 0) {
return 0;
}
REP(i, 4) {
if (in(x + xy[i], y + xy[i + 1]))
DFS(x + xy[i], y + xy[i + 1], cnt - 1); // put some stuff here
}
return 0; // or something
}
int main() {
cin >> h >> w >> k;
REP(i, h) {
REP(j, w) { cin >> grid[i][j]; }
}
REP(i, h) {
REP(j, w) {
if (grid[i][j] == 'x') {
DFS(i, j, k - 1);
}
}
}
ll cnt = 0;
FOR(i, k - 1, h - k + 1) {
FOR(j, k - 1, w - k + 1) {
if (!vis[i][j])
cnt++;
}
}
cout << cnt << endl;
}
Submission Info
Submission Time |
|
Task |
C - 菱型カウント |
User |
keidaroo |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1664 Byte |
Status |
TLE |
Exec Time |
2103 ms |
Memory |
768 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
1 ms |
256 KB |
subtask0-sample02.txt |
AC |
1 ms |
256 KB |
subtask0-sample03.txt |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
AC |
1 ms |
256 KB |
subtask1-03.txt |
AC |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
7 ms |
256 KB |
subtask1-06.txt |
AC |
1 ms |
256 KB |
subtask1-07.txt |
AC |
1 ms |
256 KB |
subtask1-08.txt |
AC |
1 ms |
256 KB |
subtask1-09.txt |
AC |
1 ms |
256 KB |
subtask1-10.txt |
AC |
3 ms |
256 KB |
subtask1-11.txt |
AC |
10 ms |
256 KB |
subtask1-12.txt |
AC |
550 ms |
256 KB |
subtask1-13.txt |
AC |
316 ms |
256 KB |
subtask1-14.txt |
TLE |
2103 ms |
256 KB |
subtask1-15.txt |
TLE |
2103 ms |
256 KB |
subtask1-16.txt |
TLE |
2103 ms |
256 KB |
subtask1-17.txt |
AC |
1 ms |
256 KB |
subtask1-18.txt |
AC |
1 ms |
256 KB |
subtask1-19.txt |
AC |
1 ms |
256 KB |
subtask1-20.txt |
AC |
16 ms |
256 KB |
subtask2-01.txt |
TLE |
2103 ms |
384 KB |
subtask2-02.txt |
TLE |
2103 ms |
384 KB |
subtask2-03.txt |
AC |
1 ms |
512 KB |
subtask2-04.txt |
TLE |
2103 ms |
384 KB |
subtask2-05.txt |
TLE |
2103 ms |
512 KB |
subtask2-06.txt |
TLE |
2103 ms |
512 KB |
subtask2-07.txt |
TLE |
2103 ms |
512 KB |
subtask2-08.txt |
TLE |
2103 ms |
640 KB |
subtask2-09.txt |
TLE |
2103 ms |
512 KB |
subtask2-10.txt |
AC |
16 ms |
768 KB |
subtask2-11.txt |
TLE |
2103 ms |
512 KB |
subtask2-12.txt |
AC |
792 ms |
768 KB |
subtask2-13.txt |
TLE |
2103 ms |
512 KB |
subtask2-14.txt |
AC |
15 ms |
768 KB |
subtask2-15.txt |
AC |
15 ms |
512 KB |
subtask2-16.txt |
TLE |
2103 ms |
512 KB |
subtask2-17.txt |
AC |
170 ms |
640 KB |
subtask2-18.txt |
TLE |
2103 ms |
512 KB |
subtask2-19.txt |
TLE |
2103 ms |
512 KB |
subtask2-20.txt |
TLE |
2103 ms |
512 KB |