oj.uz

답안 #857714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857714 2023-10-06T16:20:26 Z yusufhocaoglu Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 7 ms 2752 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define ll long long
#define pri pair<int,int>
#define prl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pair<int,int>>
#define vpl vector<pair<ll,ll>>
#define re return 0
#define sqrt sqrtl

int32_t main() {
    int h,w;cin>>h>>w;
    vector<vector<int>> no(h,vector<int>(w));
    vector<vector<int>> ni(w,vector<int>(h));

    vector<string> grid(h);
    for (int i = 0;i<h;i++) {
        string s;cin>>s;
        for (int j = 0;j<w;j++) {
            if (j==0) no[i][j] = (s[j]=='O');
            else no[i][j] = no[i][j-1] + (s[j]=='O');

            if (i==0) ni[j][i] = (s[j]=='I');
            else ni[j][i] = ni[j][i-1]+(s[j]=='I');
        }
        grid[i] = s;
    }
    int s = 0;
    for (int i = 0;i<h;i++) {
        for (int j = 0;j<w;j++) {
            if (grid[i][j]!='J') continue;
            s+= (no[i][w-1] - no[i][j]) * (ni[j][h-1] - ni[j][i]);
            //cout<<no[i][j]<<" ";
        }//cout<<endl;
    }
    cout<<s<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 2140 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 1628 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 7 ms 2752 KB Output is correct
19 Correct 5 ms 2652 KB Output is correct
20 Incorrect 7 ms 2648 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 2140 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 1628 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 7 ms 2752 KB Output is correct
19 Correct 5 ms 2652 KB Output is correct
20 Incorrect 7 ms 2648 KB Output isn't correct
21 Halted 0 ms 0 KB -