oj.uz

Submission #349130

# Submission time Handle Problem Language Result Execution time Memory
349130 2021-01-16T18:30:17 Z ignaciocanta Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 297 ms 94444 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;

#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert

#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const int mod = 998244353;
const int MX = 2e5+5; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}

vpi adj[MX];

int main(){
	NACHO();
	// fix J, then count O is in same row and I in same column
	int n, m; cin >> n >> m;
	vector<string> a (n);
	F0R(i, n) cin >> a[i];
	vvi O (n, vi (m, 0)), I (n, vi (m, 0));
	F0R(i, n){
		int cur = 0;
		R0F(j, m){
			if(a[i][j] == 'O') ++cur;
			O[i][j] = cur;
		}
	}
	F0R(j, m){
		int cur = 0;
		R0F(i, n){
			if(a[i][j] == 'I') ++cur;
			I[i][j] = cur;
		}
	}
	tint ret = 0;
	F0R(i, n){
		F0R(j, m){
			if(a[i][j] == 'J'){
				ret += O[i][j] * I[i][j];
			}
		}
	}
	cout << ret << "\n";
}

Compilation message

joi2019_ho_t1.cpp: In function 'void NACHO(std::string)':
joi2019_ho_t1.cpp:61:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   61 |   freopen((name+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:62:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   62 |   freopen((name+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 4 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 6 ms 7020 KB Output is correct
15 Correct 3 ms 5120 KB Output is correct
16 Correct 5 ms 6380 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 8 ms 7532 KB Output is correct
19 Correct 7 ms 7404 KB Output is correct
20 Correct 7 ms 7532 KB Output is correct
21 Correct 8 ms 7532 KB Output is correct
22 Correct 7 ms 7404 KB Output is correct
23 Correct 7 ms 7532 KB Output is correct
24 Correct 8 ms 7532 KB Output is correct
25 Correct 7 ms 7404 KB Output is correct
26 Correct 7 ms 7532 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 4 ms 4972 KB Output is correct
3 Correct 4 ms 4972 KB Output is correct
4 Correct 4 ms 4972 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5100 KB Output is correct
7 Correct 4 ms 5100 KB Output is correct
8 Correct 4 ms 5100 KB Output is correct
9 Correct 4 ms 5100 KB Output is correct
10 Correct 4 ms 5100 KB Output is correct
11 Correct 4 ms 5100 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5100 KB Output is correct
14 Correct 6 ms 7020 KB Output is correct
15 Correct 3 ms 5120 KB Output is correct
16 Correct 5 ms 6380 KB Output is correct
17 Correct 4 ms 5100 KB Output is correct
18 Correct 8 ms 7532 KB Output is correct
19 Correct 7 ms 7404 KB Output is correct
20 Correct 7 ms 7532 KB Output is correct
21 Correct 8 ms 7532 KB Output is correct
22 Correct 7 ms 7404 KB Output is correct
23 Correct 7 ms 7532 KB Output is correct
24 Correct 8 ms 7532 KB Output is correct
25 Correct 7 ms 7404 KB Output is correct
26 Correct 7 ms 7532 KB Output is correct
27 Correct 277 ms 89452 KB Output is correct
28 Correct 5 ms 5484 KB Output is correct
29 Correct 12 ms 11500 KB Output is correct
30 Correct 4 ms 5228 KB Output is correct
31 Correct 199 ms 67052 KB Output is correct
32 Correct 261 ms 93808 KB Output is correct
33 Correct 263 ms 94060 KB Output is correct
34 Correct 225 ms 77036 KB Output is correct
35 Correct 267 ms 93804 KB Output is correct
36 Correct 257 ms 94060 KB Output is correct
37 Correct 297 ms 94444 KB Output is correct
38 Correct 167 ms 66596 KB Output is correct
39 Correct 164 ms 66796 KB Output is correct