Submission #671738

#	Time	Username	Problem	Language	Result	Execution time	Memory
671738		birthdaycake	Bitaro the Brave (JOI19_ho_t1)	C++17	50 / 100	354 ms	274432 KiB

joi2019_ho_t1

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
 
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define endl '\n'
#define int long long
using namespace std;
 
string m[4001];
int cnt1[4001][4001][3],cnt[4001][4001][3];
signed main() {
    int h,w, ans = 0; cin >> h >> w;
    for(int i = 0; i < h; i++){
        cin >> m[i];
    }
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(j != 0) {
                cnt1[i][j][1] += cnt1[i][j - 1][1];
                cnt1[i][j][2] += cnt1[i][j - 1][2];
            }
            if(m[i][j] == 'I') cnt1[i][j][1]++;
            else if(m[i][j] == 'O')cnt1[i][j][2]++;
        }
    }
    for(int i = 0; i < w; i++){
        for(int j = 0; j < h; j++){
            if(j != 0) {
                cnt[j][i][1] += cnt[j - 1][i][1];
                cnt[j][i][2] += cnt[j - 1][i][2];
            }
            if(m[j][i] == 'I') cnt[j][i][1]++;
            else if(m[j][i] == 'O') cnt[j][i][2]++;
        }
    }
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(m[i][j] == 'J'){
                int x = cnt1[i][w - 1][2] - cnt1[i][j][2], y = cnt[h - 1][j][1] - cnt[i][j][1];
                ans += (x * y);
            }
        }
    }
    cout << ans;
    
    
}

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