oj.uz

답안 #893507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893507 2023-12-27T06:00:42 Z Malix Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 11 ms 920 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair

const int m=1e9+7;

int main(){
 //ios::sync_with_stdio(0);
// cin.tie(0);
//freopen("test_input.txt", "r", stdin);
//freopen("test_output.txt", "w", stdout);
    int a,b;cin>>a>>b;
    vector<vector<char>> grid(a,vector<char>(b));
    REP(i,0,a)REP(j,0,b)cin>>grid[i][j];
    vi ic(b,0),oc(a,0);
    REP(i,0,a)REP(j,0,b){
        if(grid[i][j]=='I')ic[j]++;
        else if(grid[i][j]=='O')oc[i]++;
    }
    int ans=0;
    REP(i,0,a)REP(j,0,b){
         if(grid[i][j]=='I')ic[j]--;
         else if(grid[i][j]=='O')oc[i]--;
         else ans+=oc[i]*ic[j];
    }
    cout<<ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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