Submission #976558

#	Time	Username	Problem	Language	Result	Execution time	Memory
976558		thegamercoder19	Bitaro the Brave (JOI19_ho_t1)	C++14	50 / 100	1099 ms	78160 KiB

joi2019_ho_t1

/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
V<string> g;
map<ll, V<ll>> ih, oh;
ll n, m, ans;
void solve()
{
    cin >> n >> m;
    g.resize(n);
    FOR(ll, i, 0, n, 1)
    {
        cin >> g[i];
        FOR(ll, j, 0, m, 1)
        {
            if (g[i][j] == 'I') ih[j].push_back(i);
            if (g[i][j] == 'O')oh[i].push_back(j);
        }
    }
    FORAE(ih, x)sort(all(x.second));
    FORAE(oh, x)sort(all(x.second));
    FOR(ll, i, 0, n, 1)
        FOR(ll, j, 0, m, 1) 
        if (g[i][j] == 'J')
        {
            auto it1 = oh[i].end() - upper_bound(all(oh[i]), j), it2 = ih[j].end() - upper_bound(all(ih[j]), i);
            ans += it1 * it2;
                //ans += ih[j].size() * oh[i].size();
        }
    cout << ans << endl;
}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

Compilation message (stderr)

joi2019_ho_t1.cpp: In function 'void init()':
joi2019_ho_t1.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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