제출 #701205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701205		Alihan_8	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	130 ms	159824 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
const int N = 3e3+1;
int orb[N][N], ignot[N][N];
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <string> p(n);
    for ( auto &i: p ) cin >> i;
    for ( int i = 1; i <= n; i++ ){
        for ( int j = 1; j <= m; j++ ){
            orb[i][j] = orb[i][j-1]+(p[i-1][j-1] == 'O');
            ignot[i][j] = ignot[i-1][j]+(p[i-1][j-1] == 'I');
        }
    }
    int cnt = 0;
    for ( int i = 1; i <= n; i++ ){
        for ( int j = 1; j <= m; j++ ){
            if ( p[i-1][j-1] != 'J' ) continue;
            int l = ignot[n][j]-ignot[i][j];
            int r = orb[i][m]-orb[i][j];
            cnt += l*r;
        }
    }
    cout << cnt;

    cout << '\n';
}

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

joi2019_ho_t1.cpp: In function 'void IO(std::string)':
joi2019_ho_t1.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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