oj.uz

Submission #876746

# Submission time Handle Problem Language Result Execution time Memory
876746 2023-11-22T09:23:39 Z cpptowin Bitaro the Brave (JOI19_ho_t1) C++17
50 / 100
 210 ms 274432 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 5010
#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];
int 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 += (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);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 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 4700 KB Output is correct
5 Correct 3 ms 18268 KB Output is correct
6 Correct 3 ms 16476 KB Output is correct
7 Correct 3 ms 18012 KB Output is correct
8 Correct 3 ms 18268 KB Output is correct
9 Correct 3 ms 16476 KB Output is correct
10 Correct 3 ms 18264 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 16340 KB Output is correct
13 Correct 3 ms 18012 KB Output is correct

Subtask #2
30.0 / 30.0

# 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 4700 KB Output is correct
5 Correct 3 ms 18268 KB Output is correct
6 Correct 3 ms 16476 KB Output is correct
7 Correct 3 ms 18012 KB Output is correct
8 Correct 3 ms 18268 KB Output is correct
9 Correct 3 ms 16476 KB Output is correct
10 Correct 3 ms 18264 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 16340 KB Output is correct
13 Correct 3 ms 18012 KB Output is correct
14 Correct 18 ms 76636 KB Output is correct
15 Correct 8 ms 59224 KB Output is correct
16 Correct 9 ms 43612 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 21 ms 79708 KB Output is correct
19 Correct 17 ms 79556 KB Output is correct
20 Correct 17 ms 79460 KB Output is correct
21 Correct 21 ms 79572 KB Output is correct
22 Correct 17 ms 79448 KB Output is correct
23 Correct 17 ms 79480 KB Output is correct
24 Correct 20 ms 79700 KB Output is correct
25 Correct 16 ms 79452 KB Output is correct
26 Correct 18 ms 79516 KB Output is correct

Subtask #3
0 / 50.0

# 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 4700 KB Output is correct
5 Correct 3 ms 18268 KB Output is correct
6 Correct 3 ms 16476 KB Output is correct
7 Correct 3 ms 18012 KB Output is correct
8 Correct 3 ms 18268 KB Output is correct
9 Correct 3 ms 16476 KB Output is correct
10 Correct 3 ms 18264 KB Output is correct
11 Correct 3 ms 18268 KB Output is correct
12 Correct 3 ms 16340 KB Output is correct
13 Correct 3 ms 18012 KB Output is correct
14 Correct 18 ms 76636 KB Output is correct
15 Correct 8 ms 59224 KB Output is correct
16 Correct 9 ms 43612 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 21 ms 79708 KB Output is correct
19 Correct 17 ms 79556 KB Output is correct
20 Correct 17 ms 79460 KB Output is correct
21 Correct 21 ms 79572 KB Output is correct
22 Correct 17 ms 79448 KB Output is correct
23 Correct 17 ms 79480 KB Output is correct
24 Correct 20 ms 79700 KB Output is correct
25 Correct 16 ms 79452 KB Output is correct
26 Correct 18 ms 79516 KB Output is correct
27 Runtime error 210 ms 274432 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -