oj.uz

Submission #542823

# Submission time Handle Problem Language Result Execution time Memory
542823 2022-03-28T06:51:01 Z Fysty Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 188 ms 159992 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
//#define int ll
#define MottoHayaku ios::sync_with_stdio(0);cin.tie(0);
#define F first
#define S second
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end());uni(c);

string s[3005];
ll co[3005][3005],ci[3005][3005];

signed main()
{
    MottoHayaku
    ll n,m;
    cin>>n>>m;
    rep(i,n) cin>>s[i];
    rep(i,n)
    {
        rep(j,m)
        {
            if(s[i][j]=='O') co[i][j]=1;
            else if(s[i][j]=='I') ci[i][j]=1;
        }
    }
    for(int i=n-1;i>=0;i--)
    {
        for(int j=m-1;j>=0;j--)
        {
            co[i][j]+=co[i][j+1];
            ci[i][j]+=ci[i+1][j];
        }
    }
    ll ans=0;
    rep(i,n)
    {
        rep(j,m)
        {
            if(s[i][j]!='J') continue;
            ans+=co[i][j]*ci[i][j];
        }
    }
    cout<<ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1324 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1200 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1196 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1324 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1200 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1196 KB Output is correct
14 Correct 6 ms 7728 KB Output is correct
15 Correct 2 ms 3880 KB Output is correct
16 Correct 3 ms 4788 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 8 ms 8752 KB Output is correct
19 Correct 6 ms 8660 KB Output is correct
20 Correct 5 ms 8660 KB Output is correct
21 Correct 9 ms 8864 KB Output is correct
22 Correct 5 ms 8572 KB Output is correct
23 Correct 5 ms 8660 KB Output is correct
24 Correct 8 ms 8844 KB Output is correct
25 Correct 5 ms 8660 KB Output is correct
26 Correct 5 ms 8660 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 1324 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 1 ms 1364 KB Output is correct
10 Correct 1 ms 1200 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1196 KB Output is correct
14 Correct 6 ms 7728 KB Output is correct
15 Correct 2 ms 3880 KB Output is correct
16 Correct 3 ms 4788 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 8 ms 8752 KB Output is correct
19 Correct 6 ms 8660 KB Output is correct
20 Correct 5 ms 8660 KB Output is correct
21 Correct 9 ms 8864 KB Output is correct
22 Correct 5 ms 8572 KB Output is correct
23 Correct 5 ms 8660 KB Output is correct
24 Correct 8 ms 8844 KB Output is correct
25 Correct 5 ms 8660 KB Output is correct
26 Correct 5 ms 8660 KB Output is correct
27 Correct 176 ms 158960 KB Output is correct
28 Correct 8 ms 19540 KB Output is correct
29 Correct 10 ms 13908 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 139 ms 130688 KB Output is correct
32 Correct 116 ms 159820 KB Output is correct
33 Correct 107 ms 159420 KB Output is correct
34 Correct 162 ms 151628 KB Output is correct
35 Correct 120 ms 159860 KB Output is correct
36 Correct 108 ms 159532 KB Output is correct
37 Correct 188 ms 159992 KB Output is correct
38 Correct 89 ms 130104 KB Output is correct
39 Correct 83 ms 130296 KB Output is correct