| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1260711 | tminh | Bitaro the Brave (JOI19_ho_t1) | C++20 | 470 ms | 54168 KiB | 
#include "bits/stdc++.h"
using namespace std;
#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ep emplace_back
#define pb push_back
#define pf push_front
const ll mod = 1e9 + 7;
const int N = 3005;
const ll oo = 1e18;
bool START;
int n, m;
char a[N][N];
vector<int> r[N], c[N];
inline void solve() {
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (a[i][j] == 'I') c[j].pb(i);
			if (a[i][j] == 'O') r[i].pb(j);
		}
	}
	
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (a[i][j] == 'J') {
				int val1 = sze(r[i]) - (lower_bound(vall(r[i]), j) - r[i].begin());
				int val2 = sze(c[j]) - (lower_bound(vall(c[j]), i) - c[j].begin());
				ans += val1 * val2;
			}
		}
	}
	cout << ans;
	
}
inline void input() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
    	for (int j = 1; j <= m; ++j) cin >> a[i][j];
    }
    return solve();
}
bool END;
int main() {
    if(fopen(task ".inp", "r")) {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    input();
    
    
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
    cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
    return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
