oj.uz

답안 #98973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98973 2019-02-27T19:48:06 Z Benq Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 140 ms 82780 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

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

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
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 vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#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 beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 3005;
const ld PI = 4*atan((ld)1);

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); }

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 Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    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) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    template<class Arg> void ps(const Arg& first) { pr(first,"\n"); } // print w/ spaces
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); 
    }
}

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;

namespace modOp {
    int ad(int a, int b, int mod = MOD) { return (a+b)%mod; }
    int sub(int a, int b, int mod = MOD) { return (a-b+mod)%mod; }
    int mul(int a, int b, int mod = MOD) { return (ll)a*b%mod; }
    
    int AD(int& a, int b, int mod = MOD) { return a = ad(a,b,mod); }
    int SUB(int& a, int b, int mod = MOD) { return a = sub(a,b,mod); }
    int MUL(int& a, int b, int mod = MOD) { return a = mul(a,b,mod); }
    
    int po (int b, int p, int mod = MOD) { return !p?1:mul(po(mul(b,b,mod),p/2,mod),p&1?b:1,mod); }
    int inv (int b, int mod = MOD) { return po(b,mod-2,mod); }
    
    int invGeneral(int a, int b) { // 0 < a < b, gcd(a,b) = 1
        if (a == 0) return b == 1 ? 0 : -1;
        int x = invGeneral(b%a,a); 
        return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
    }
}

using namespace modOp;

int H,W;
ll ans;
string s[MX];
int O[MX][MX], I[MX][MX];

int main() {
    // you should actually read the stuff at the bottom
    setIO(); re(H,W); F0R(i,H) re(s[i]);
    F0Rd(i,H) F0Rd(j,W) {
        O[i][j] = O[i][j+1]; 
        I[i][j] = I[i+1][j];
        if (s[i][j] == 'O') O[i][j] ++;
        if (s[i][j] == 'I') I[i][j] ++;
        if (s[i][j] == 'J') ans += O[i][j]*I[i][j];
    }
    pr(ans);
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

joi2019_ho_t1.cpp: In function 'void io::setIn(std::__cxx11::string)':
joi2019_ho_t1.cpp:112: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:113: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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 4 ms 1280 KB Output is correct
8 Correct 3 ms 1280 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 4 ms 1280 KB Output is correct
11 Correct 3 ms 1380 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 4 ms 1280 KB Output is correct
8 Correct 3 ms 1280 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 4 ms 1280 KB Output is correct
11 Correct 3 ms 1380 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct
14 Correct 11 ms 6272 KB Output is correct
15 Correct 6 ms 3840 KB Output is correct
16 Correct 5 ms 3840 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 9 ms 6912 KB Output is correct
19 Correct 9 ms 6784 KB Output is correct
20 Correct 9 ms 6784 KB Output is correct
21 Correct 11 ms 6912 KB Output is correct
22 Correct 9 ms 6784 KB Output is correct
23 Correct 8 ms 6784 KB Output is correct
24 Correct 11 ms 6912 KB Output is correct
25 Correct 8 ms 6784 KB Output is correct
26 Correct 8 ms 6756 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 3 ms 1280 KB Output is correct
7 Correct 4 ms 1280 KB Output is correct
8 Correct 3 ms 1280 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 4 ms 1280 KB Output is correct
11 Correct 3 ms 1380 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct
14 Correct 11 ms 6272 KB Output is correct
15 Correct 6 ms 3840 KB Output is correct
16 Correct 5 ms 3840 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 9 ms 6912 KB Output is correct
19 Correct 9 ms 6784 KB Output is correct
20 Correct 9 ms 6784 KB Output is correct
21 Correct 11 ms 6912 KB Output is correct
22 Correct 9 ms 6784 KB Output is correct
23 Correct 8 ms 6784 KB Output is correct
24 Correct 11 ms 6912 KB Output is correct
25 Correct 8 ms 6784 KB Output is correct
26 Correct 8 ms 6756 KB Output is correct
27 Correct 140 ms 82300 KB Output is correct
28 Correct 18 ms 19376 KB Output is correct
29 Correct 13 ms 7800 KB Output is correct
30 Correct 3 ms 768 KB Output is correct
31 Correct 114 ms 68088 KB Output is correct
32 Correct 102 ms 82680 KB Output is correct
33 Correct 102 ms 82552 KB Output is correct
34 Correct 125 ms 78456 KB Output is correct
35 Correct 94 ms 82652 KB Output is correct
36 Correct 99 ms 82604 KB Output is correct
37 Correct 139 ms 82780 KB Output is correct
38 Correct 79 ms 67960 KB Output is correct
39 Correct 96 ms 67832 KB Output is correct