Submission #876749

# Submission time Handle Problem Language Result Execution time Memory
876749 2023-11-22T09:24:48 Z cpptowin Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
376 ms 230232 KB
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 3010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
//#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,m;
char a[N][N];
long long ans;
int row1[N][N],row2[N][N],row3[N][N];
int col1[N][N],col2[N][N],col3[N][N];
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> m;
    fo(i,1,n) fo(j,1,m)
    {
        cin >> a[i][j];
        row1[i][j] = row1[i][j - 1];
        row2[i][j] = row2[i][j - 1];
        row3[i][j] = row3[i][j - 1];
        if(a[i][j] == 'J') row1[i][j]++;
        if(a[i][j] == 'O') row2[i][j]++;
        if(a[i][j] == 'I') row3[i][j]++;
    }
    fo(j,1,m)
    {
        fo(i,1,n)
        {
            col1[i][j] = col1[i - 1][j];
            col2[i][j] = col2[i - 1][j];
            col3[i][j] = col3[i - 1][j];
            if(a[i][j] == 'J') col1[i][j]++;
            if(a[i][j] == 'O') col2[i][j]++;
            if(a[i][j] == 'I') col3[i][j]++;
        }
    }
    fo(i,1,n) fo(j,1,m)
    {
        if(a[i][j] == 'J')
        {
//            cout << i << ' ' << j << "\n";
            ans += 1LL * (row2[i][m] - row2[i][j - 1]) * (col3[n][j] - col3[i - 1][j]);
        }
    }
    cout << ans;
}

Compilation message

joi2019_ho_t1.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main()
      | ^~~~
joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:32:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:33:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 14 ms 32604 KB Output is correct
15 Correct 5 ms 25072 KB Output is correct
16 Correct 6 ms 16728 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 18 ms 33332 KB Output is correct
19 Correct 11 ms 33112 KB Output is correct
20 Correct 12 ms 33116 KB Output is correct
21 Correct 15 ms 33624 KB Output is correct
22 Correct 12 ms 33112 KB Output is correct
23 Correct 12 ms 33232 KB Output is correct
24 Correct 15 ms 33372 KB Output is correct
25 Correct 12 ms 33112 KB Output is correct
26 Correct 11 ms 33116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 6488 KB Output is correct
11 Correct 2 ms 8796 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 14 ms 32604 KB Output is correct
15 Correct 5 ms 25072 KB Output is correct
16 Correct 6 ms 16728 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 18 ms 33332 KB Output is correct
19 Correct 11 ms 33112 KB Output is correct
20 Correct 12 ms 33116 KB Output is correct
21 Correct 15 ms 33624 KB Output is correct
22 Correct 12 ms 33112 KB Output is correct
23 Correct 12 ms 33232 KB Output is correct
24 Correct 15 ms 33372 KB Output is correct
25 Correct 12 ms 33112 KB Output is correct
26 Correct 11 ms 33116 KB Output is correct
27 Correct 376 ms 229748 KB Output is correct
28 Correct 23 ms 119900 KB Output is correct
29 Correct 16 ms 26200 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 294 ms 198364 KB Output is correct
32 Correct 289 ms 230040 KB Output is correct
33 Correct 299 ms 229768 KB Output is correct
34 Correct 290 ms 223316 KB Output is correct
35 Correct 263 ms 230232 KB Output is correct
36 Correct 256 ms 229624 KB Output is correct
37 Correct 335 ms 230232 KB Output is correct
38 Correct 153 ms 198224 KB Output is correct
39 Correct 183 ms 198116 KB Output is correct