oj.uz

답안 #292439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292439 2020-09-07T01:37:31 Z jbroeksteeg Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 12 ms 8064 KB 
#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
	if (c.size() == 0) {os << "{}"; return os;}
	os << "{" << c[0];
	for (int i = 1; i < (int)c.size(); i++) {os <<", "<<c[i];}
	os << "}";
	return os;
}

using namespace std;
#define MAXN 3001

char grid[MAXN][MAXN];
int ingotsBelow[MAXN][MAXN];
int orbsRight[MAXN][MAXN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int rows, cols; cin >> rows >> cols;
	
	for (int r = 0; r < rows; r++) {
		for (int c = 0; c < cols; c++) {
			cin >> grid[r][c];
		}
	}
	for (int c = 0; c < cols; c++) {
		for (int r = rows-1; r >= 0; r--) {
			ingotsBelow[r][c] += ingotsBelow[r+1][c];
			ingotsBelow[r][c] += (grid[r][c]=='I');
		}
	}
	for (int r = 0; r < rows; r++) {
		for (int c = cols-1; c >= 0; c--) {
			orbsRight[r][c] += orbsRight[r][c+1];
			orbsRight[r][c] += (grid[r][c]=='O');
		}
	}
	int ans=0;
	for (int r = 0; r < rows; r++) {
		for (int c = 0 ; c < cols ;c++) {
			if (grid[r][c]=='J') {
				ans += ingotsBelow[r][c]*orbsRight[r][c];
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 2 ms 1408 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 10 ms 7552 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 6 ms 4352 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 12 ms 8064 KB Output is correct
19 Correct 11 ms 7936 KB Output is correct
20 Incorrect 11 ms 7808 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 1 ms 1536 KB Output is correct
7 Correct 2 ms 1408 KB Output is correct
8 Correct 2 ms 1536 KB Output is correct
9 Correct 2 ms 1536 KB Output is correct
10 Correct 1 ms 1408 KB Output is correct
11 Correct 2 ms 1536 KB Output is correct
12 Correct 2 ms 1536 KB Output is correct
13 Correct 1 ms 1408 KB Output is correct
14 Correct 10 ms 7552 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 6 ms 4352 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 12 ms 8064 KB Output is correct
19 Correct 11 ms 7936 KB Output is correct
20 Incorrect 11 ms 7808 KB Output isn't correct
21 Halted 0 ms 0 KB -