oj.uz

답안 #654736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654736 2022-11-01T12:12:40 Z veiga Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 1 ms 428 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define F first
#define S second
#define endl "\n"
const int INF = 1e9+10;
const int MOD = 1e9+7;

int n, m;
string s[3030];
int sumi[3030][3030], sumo[3030][3030];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        cin >> s[i];
    }
    for(int i = 0; i < n; i++) {
        int at = 0;
        for(int j = 0; j < m; j++) {
            if(s[i][j] == 'O') at++;
            sumo[i][j] = at;
        }
    }
    for(int i = 0; i < m; i++) {
        int at = 0;
        for(int j = 0; j < n; j++) {
            if(s[j][i] == 'I') at++;
            sumi[j][i] = at;
        }
    }

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cout << sumo[i][j] << " ";
        } cout << endl;
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cout << sumi[i][j] << " ";
        } cout << endl;
    }

    int resp = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(s[i][j] == 'J') {
                int ci = sumi[n-1][j] - sumi[i][j];
                int co = sumo[i][m-1] - sumo[i][j];
                cout << ci << " " << co << endl;
                resp += ci * co; 
            }
        }
    }
    cout << resp << endl;

    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 428 KB Output isn't correct
2 Halted 0 ms 0 KB -