oj.uz

Submission #228378

# Submission time Handle Problem Language Result Execution time Memory
228378 2020-04-30T20:13:29 Z caoash Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 277 ms 124148 KB 
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 3005;
const ld PI = 4*atan((ld)1);
char grid[MX][MX]; int pre[MX][MX][3];
void precomp(){
   pre[0][0][0] = (grid[0][0] == 'J');
   pre[0][0][1] = (grid[0][0] == 'O');
   pre[0][0][2] = (grid[0][0] == 'I');
   f0x(i,1,MX){
    pre[i][0][0] = pre[i-1][0][0] + (grid[i][0] == 'J'); 
    pre[0][i][0] = pre[0][i-1][0] + (grid[0][i] == 'J'); 
    pre[i][0][1] = pre[i-1][0][1] + (grid[i][0] == 'O');
    pre[0][i][1] = pre[0][i-1][1] + (grid[0][i] == 'O');
    pre[i][0][2] = pre[i-1][0][2] + (grid[i][0] == 'I');
    pre[0][i][2] = pre[0][i-1][2] + (grid[0][i] == 'I');
   }
   f0x(i,1,MX){
      f0x(j,1,MX){
         pre[i][j][0] = pre[i-1][j][0] + pre[i][j-1][0] - pre[i-1][j-1][0] + (grid[i][j] == 'J');
         pre[i][j][1] = pre[i-1][j][1] + pre[i][j-1][1] - pre[i-1][j-1][1] + (grid[i][j] == 'O');
         pre[i][j][2] = pre[i-1][j][2] + pre[i][j-1][2] - pre[i-1][j-1][2] + (grid[i][j] == 'I');
      }
   }
   return;
}
int query(int x1, int y1, int x2, int y2, int v){
   if(x1 == 0 && y1 == 0){
      return pre[x2][y2][v];
   }
   else if(x1 == 0){
      return pre[x2][y2][v] - pre[x2][y1-1][v];
   }
   else if(y1 == 0){
      return pre[x2][y2][v] - pre[x1-1][y2][v];
   }
   else{
      return pre[x2][y2][v] - pre[x2][y1-1][v] - pre[x1-1][y2][v] + pre[x1-1][y1-1][v];
   }
}


int main() {
   setIO(); 
   int H,W; re(H,W);   
   fax(i,H){
      fax(j,W){
         re(grid[i][j]);
      }
   }
   precomp();
   ll ans = 0;
   fax(i,H-1){
      fax(j,W-1){
         if(grid[i][j] == 'J'){
            //dbg(i,j, query(i,j,H-1,j,2), query(i,j,i,W-1,1));
            ans += (query(i,j,H-1,j,2) * query(i,j,i,W-1,1));
         }
      }
   }
   pr(ans, "\n");
}

Compilation message

joi2019_ho_t1.cpp: In function 'void io::setIn(std::__cxx11::string)':
joi2019_ho_t1.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp: In function 'void io::setOut(std::__cxx11::string)':
joi2019_ho_t1.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 106360 KB Output is correct
2 Correct 84 ms 106424 KB Output is correct
3 Correct 83 ms 106368 KB Output is correct
4 Correct 83 ms 106360 KB Output is correct
5 Correct 84 ms 106744 KB Output is correct
6 Correct 83 ms 106616 KB Output is correct
7 Correct 84 ms 106616 KB Output is correct
8 Correct 85 ms 106616 KB Output is correct
9 Correct 86 ms 106616 KB Output is correct
10 Correct 87 ms 106616 KB Output is correct
11 Correct 83 ms 106616 KB Output is correct
12 Correct 82 ms 106616 KB Output is correct
13 Correct 83 ms 106616 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 106360 KB Output is correct
2 Correct 84 ms 106424 KB Output is correct
3 Correct 83 ms 106368 KB Output is correct
4 Correct 83 ms 106360 KB Output is correct
5 Correct 84 ms 106744 KB Output is correct
6 Correct 83 ms 106616 KB Output is correct
7 Correct 84 ms 106616 KB Output is correct
8 Correct 85 ms 106616 KB Output is correct
9 Correct 86 ms 106616 KB Output is correct
10 Correct 87 ms 106616 KB Output is correct
11 Correct 83 ms 106616 KB Output is correct
12 Correct 82 ms 106616 KB Output is correct
13 Correct 83 ms 106616 KB Output is correct
14 Correct 85 ms 107972 KB Output is correct
15 Correct 82 ms 107640 KB Output is correct
16 Correct 88 ms 107256 KB Output is correct
17 Correct 82 ms 106360 KB Output is correct
18 Correct 88 ms 108152 KB Output is correct
19 Correct 90 ms 108024 KB Output is correct
20 Correct 87 ms 108280 KB Output is correct
21 Correct 89 ms 108024 KB Output is correct
22 Correct 86 ms 108024 KB Output is correct
23 Correct 87 ms 108024 KB Output is correct
24 Correct 87 ms 108152 KB Output is correct
25 Correct 86 ms 108024 KB Output is correct
26 Correct 87 ms 108024 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 106360 KB Output is correct
2 Correct 84 ms 106424 KB Output is correct
3 Correct 83 ms 106368 KB Output is correct
4 Correct 83 ms 106360 KB Output is correct
5 Correct 84 ms 106744 KB Output is correct
6 Correct 83 ms 106616 KB Output is correct
7 Correct 84 ms 106616 KB Output is correct
8 Correct 85 ms 106616 KB Output is correct
9 Correct 86 ms 106616 KB Output is correct
10 Correct 87 ms 106616 KB Output is correct
11 Correct 83 ms 106616 KB Output is correct
12 Correct 82 ms 106616 KB Output is correct
13 Correct 83 ms 106616 KB Output is correct
14 Correct 85 ms 107972 KB Output is correct
15 Correct 82 ms 107640 KB Output is correct
16 Correct 88 ms 107256 KB Output is correct
17 Correct 82 ms 106360 KB Output is correct
18 Correct 88 ms 108152 KB Output is correct
19 Correct 90 ms 108024 KB Output is correct
20 Correct 87 ms 108280 KB Output is correct
21 Correct 89 ms 108024 KB Output is correct
22 Correct 86 ms 108024 KB Output is correct
23 Correct 87 ms 108024 KB Output is correct
24 Correct 87 ms 108152 KB Output is correct
25 Correct 86 ms 108024 KB Output is correct
26 Correct 87 ms 108024 KB Output is correct
27 Correct 259 ms 123512 KB Output is correct
28 Correct 84 ms 113272 KB Output is correct
29 Correct 92 ms 107768 KB Output is correct
30 Correct 82 ms 106488 KB Output is correct
31 Correct 209 ms 119800 KB Output is correct
32 Correct 216 ms 123924 KB Output is correct
33 Correct 234 ms 123896 KB Output is correct
34 Correct 227 ms 121976 KB Output is correct
35 Correct 231 ms 123896 KB Output is correct
36 Correct 229 ms 124148 KB Output is correct
37 Correct 277 ms 124024 KB Output is correct
38 Correct 177 ms 119800 KB Output is correct
39 Correct 187 ms 119900 KB Output is correct