oj.uz

Submission #377909

# Submission time Handle Problem Language Result Execution time Memory
377909 2021-03-15T13:46:11 Z ACmachine Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 269 ms 152620 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
 	int h, w;
 	cin >> h >> w;
 	vector<string> grid(h);
 	for(string& x : grid)
 	    cin >> x;
 	vector<vector<ll>> right(h, vector<ll>(w, 0));
 	vector<vector<ll>> down(h, vector<ll>(w, 0));
 	REP(i, h){
 	    REPD(j, w - 1){
 	        if(j != w - 1){
 	            right[i][j] += right[i][j + 1];
 	        }
 	        if(grid[i][j] == 'O')
 	            right[i][j]++;
 	    }
 	}
 	REPD(i, h - 1){
 	    REP(j, w){
 	        if(i != h - 1){
 	            down[i][j] += down[i + 1][j];
 	        }
 	        if(grid[i][j] == 'I')
 	            down[i][j]++;
 	    }
 	}
 	ll res = 0;
 	REP(i, h){
 	    REP(j, w){
 	        if(grid[i][j] == 'J')
 	            res += right[i][j] * down[i][j];
 	    }
 	}
 	cout << res << "\n";
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 8 ms 3820 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 9 ms 4844 KB Output is correct
19 Correct 6 ms 4588 KB Output is correct
20 Correct 6 ms 4716 KB Output is correct
21 Correct 9 ms 4844 KB Output is correct
22 Correct 6 ms 4588 KB Output is correct
23 Correct 6 ms 4716 KB Output is correct
24 Correct 9 ms 4844 KB Output is correct
25 Correct 6 ms 4588 KB Output is correct
26 Correct 6 ms 4716 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 8 ms 3820 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 4 ms 2668 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 9 ms 4844 KB Output is correct
19 Correct 6 ms 4588 KB Output is correct
20 Correct 6 ms 4716 KB Output is correct
21 Correct 9 ms 4844 KB Output is correct
22 Correct 6 ms 4588 KB Output is correct
23 Correct 6 ms 4716 KB Output is correct
24 Correct 9 ms 4844 KB Output is correct
25 Correct 6 ms 4588 KB Output is correct
26 Correct 6 ms 4716 KB Output is correct
27 Correct 262 ms 143724 KB Output is correct
28 Correct 2 ms 1004 KB Output is correct
29 Correct 15 ms 11884 KB Output is correct
30 Correct 1 ms 748 KB Output is correct
31 Correct 190 ms 106092 KB Output is correct
32 Correct 205 ms 151240 KB Output is correct
33 Correct 183 ms 151916 KB Output is correct
34 Correct 220 ms 122988 KB Output is correct
35 Correct 201 ms 151532 KB Output is correct
36 Correct 186 ms 152172 KB Output is correct
37 Correct 269 ms 152620 KB Output is correct
38 Correct 142 ms 105452 KB Output is correct
39 Correct 138 ms 105836 KB Output is correct