oj.uz

Submission #255834

# Submission time Handle Problem Language Result Execution time Memory
255834 2020-08-01T23:30:05 Z jainbot27 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 560 ms 114952 KB 
//Author: jainbot27
#pragma GCC optimize ("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;


#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ts to_string
#define ub upper_bound
#define lb lower_bound
#define ar array
#define FOR(x, y, z) for(int x = y; x < z; x++)
#define ROF(x, y, z) for(int x = y; x > z; x--)
#define all(x) x.begin(), x.end()


const char nl = '\n';
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
using vpii = vector<pii>;
using vpll = vector<pll>;


str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; for(int i = 0;i < (int)v.size(); i++) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; for(int i = 0; i < b.size(); i++) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { 
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }


#ifdef D 
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

const int N = 3001;
int n, m, a[N][N], o[N][N], in[N][N]; char x; 

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	for(int i =0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> x;
			if(x == 'J')
				a[i][j] = 0;
			else if(x == 'O')
				a[i][j] = 1;
			else
				a[i][j] = 2;	
		}
	}	
	for(int i =0;i < n; i++){
		for(int j =0; j <m; j++){
			if(j)
				o[i][j] = o[i][j-1];
			if(a[i][j] == 1)
				o[i][j]++;
		}
	}
	for(int j = 0; j < m; j++){
		for(int i = 0; i < n; i++){
			if(i)
				in[i][j] = in[i-1][j];
			if(a[i][j] == 2){
				in[i][j] ++;
			}
		}
	}
	ll ans = 0;
	for(int i = 0; i < n; i++){
		for(int j =0; j <m; j++){
			if(a[i][j] == 0){
				ans += (o[i][m-1]-o[i][j]) * (in[n-1][j] - in[i][j]);
				dbg(i, j);
			}
			dbg(o[i][j], in[i][j], i, j);
		}
	}
	cout << ans << nl;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:106:14: warning: statement has no effect [-Wunused-value]
     dbg(i, j);
              ^
joi2019_ho_t1.cpp:108:32: warning: statement has no effect [-Wunused-value]
    dbg(o[i][j], in[i][j], i, j);
                                ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 2 ms 1536 KB Output is correct
8 Correct 1 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 2 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 2 ms 1536 KB Output is correct
8 Correct 1 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 2 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 11 ms 8832 KB Output is correct
15 Correct 3 ms 5504 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 14 ms 9472 KB Output is correct
19 Correct 11 ms 9344 KB Output is correct
20 Correct 11 ms 9344 KB Output is correct
21 Correct 14 ms 9472 KB Output is correct
22 Correct 12 ms 9344 KB Output is correct
23 Correct 12 ms 9344 KB Output is correct
24 Correct 14 ms 9472 KB Output is correct
25 Correct 11 ms 9472 KB Output is correct
26 Correct 11 ms 9344 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 1 ms 1664 KB Output is correct
7 Correct 2 ms 1536 KB Output is correct
8 Correct 1 ms 1664 KB Output is correct
9 Correct 1 ms 1664 KB Output is correct
10 Correct 2 ms 1536 KB Output is correct
11 Correct 2 ms 1664 KB Output is correct
12 Correct 1 ms 1664 KB Output is correct
13 Correct 1 ms 1536 KB Output is correct
14 Correct 11 ms 8832 KB Output is correct
15 Correct 3 ms 5504 KB Output is correct
16 Correct 6 ms 5120 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 14 ms 9472 KB Output is correct
19 Correct 11 ms 9344 KB Output is correct
20 Correct 11 ms 9344 KB Output is correct
21 Correct 14 ms 9472 KB Output is correct
22 Correct 12 ms 9344 KB Output is correct
23 Correct 12 ms 9344 KB Output is correct
24 Correct 14 ms 9472 KB Output is correct
25 Correct 11 ms 9472 KB Output is correct
26 Correct 11 ms 9344 KB Output is correct
27 Correct 537 ms 114364 KB Output is correct
28 Correct 17 ms 28672 KB Output is correct
29 Correct 20 ms 10112 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 384 ms 94584 KB Output is correct
32 Correct 457 ms 114808 KB Output is correct
33 Correct 455 ms 114424 KB Output is correct
34 Correct 450 ms 109828 KB Output is correct
35 Correct 476 ms 114952 KB Output is correct
36 Correct 446 ms 114424 KB Output is correct
37 Correct 560 ms 114936 KB Output is correct
38 Correct 337 ms 94456 KB Output is correct
39 Correct 318 ms 94200 KB Output is correct