제출 #1232638

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232638		Bui_Quoc_Cuong	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	292 ms	176828 KiB

joi2019_ho_t1

# include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= (int)b; i++)
#define FORD(i, a, b) for (int i = a; i >= (int)b; i--)
const int MAXN = 3005;
int n, m;
int a[MAXN][MAXN];
int cntRow[MAXN][MAXN][2], cntCol[MAXN][MAXN][2];
signed main(){
    cin.tie(nullptr) -> sync_with_stdio(false);
    #define taskname "kieuoanh"
    if(fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin); 
        freopen(taskname".out", "w", stdout);
    }
    cin >> n >> m;
    FOR(i, 1, n) FOR(j, 1, m){
    	char x; cin >> x;
    	if(x == 'J') a[i][j] = 2;
    	if(x == 'O') a[i][j] = 0;
    	if(x == 'I') a[i][j] = 1;
    }
    FOR(t, 0, 1){
    	FOR(i, 1, n){
    		FOR(j, 1, m){
    			cntRow[i][j][t] = cntRow[i][j - 1][t] + (a[i][j] == t);
    			cntCol[i][j][t] = cntCol[i - 1][j][t] + (a[i][j] == t);
    		}
    	}
    }	
    long long ans = 0;
    FOR(i, 1, n) FOR(j, 1, m){
    	if(a[i][j] == 2){
    		int cnt2 = cntRow[i][m][0] - cntRow[i][j - 1][0];
    		int cnt3 = cntCol[n][j][1] - cntCol[i - 1][j][1];
    		ans+= 1LL * cnt2 * cnt3;
    	}
    }
    cout << ans;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50