# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075267 | 2024-08-25T22:50:45 Z | quangminh412 | Bitaro the Brave (JOI19_ho_t1) | C++14 | 1000 ms | 1884 KB |
#include <bits/stdc++.h> using namespace std; /* John Watson https://codeforces.com/profile/quangminh98 Mua Code nhu mua Florentino !! */ #define faster() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long const int maxn = 3009; char a[maxn][maxn]; int H, W; signed main() { if (fopen("test.inp", "r")) { freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout); } faster(); cin >> H >> W; for (int i = 1; i <= H; i++) for (int j = 1; j <= W; j++) cin >> a[i][j]; int res = 0; for (int i = 1; i <= H; i++) for (int j = 1; j <= W; j++) for (int k = i + 1; k <= H; k++) for (int l = j + 1; l <= W; l++) res += (a[i][j] == 'J' && a[i][l] == 'O' && a[k][j] == 'I'); cout << res << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 600 KB | Output is correct |
6 | Correct | 10 ms | 768 KB | Output is correct |
7 | Correct | 14 ms | 604 KB | Output is correct |
8 | Correct | 15 ms | 600 KB | Output is correct |
9 | Correct | 10 ms | 600 KB | Output is correct |
10 | Correct | 18 ms | 600 KB | Output is correct |
11 | Correct | 16 ms | 600 KB | Output is correct |
12 | Correct | 11 ms | 604 KB | Output is correct |
13 | Correct | 14 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 600 KB | Output is correct |
6 | Correct | 10 ms | 768 KB | Output is correct |
7 | Correct | 14 ms | 604 KB | Output is correct |
8 | Correct | 15 ms | 600 KB | Output is correct |
9 | Correct | 10 ms | 600 KB | Output is correct |
10 | Correct | 18 ms | 600 KB | Output is correct |
11 | Correct | 16 ms | 600 KB | Output is correct |
12 | Correct | 11 ms | 604 KB | Output is correct |
13 | Correct | 14 ms | 604 KB | Output is correct |
14 | Execution timed out | 1071 ms | 1884 KB | Time limit exceeded |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 15 ms | 600 KB | Output is correct |
6 | Correct | 10 ms | 768 KB | Output is correct |
7 | Correct | 14 ms | 604 KB | Output is correct |
8 | Correct | 15 ms | 600 KB | Output is correct |
9 | Correct | 10 ms | 600 KB | Output is correct |
10 | Correct | 18 ms | 600 KB | Output is correct |
11 | Correct | 16 ms | 600 KB | Output is correct |
12 | Correct | 11 ms | 604 KB | Output is correct |
13 | Correct | 14 ms | 604 KB | Output is correct |
14 | Execution timed out | 1071 ms | 1884 KB | Time limit exceeded |
15 | Halted | 0 ms | 0 KB | - |