oj.uz

답안 #925630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925630 2024-02-12T06:31:29 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
79 / 100
 2000 ms 7260 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

	int n, m, d, k;
	cin >> n >> m >> d >> k;

	char c[n+1][m+1];
	vector<vector<int>> cnt(n+1, vector<int>(m+1, 0));
	vector<int> _left(n+1, 0);
	for( int i = 1; i <= n; i++ ) {
		for( int j = 1; j <= m; j++ ) {
			cin >> c[i][j];
			if( c[i][j] == 'S') {
				int col = max(j - d, 1);
				for( int row = max(1, i-d); row <= min(i+d,n); row++ ) {
					cnt[row][col]++;
				}
				
				bool k = 0;
				if( j + d + 1 > m ) k = 1;
				col = min(j + d + 1, m);

				for( int row = max(1, i-d); row <= min(i+d, n); row++ ) {
					if( k ) _left[row]++;
					else cnt[row][col]--;
				}
			}
		}
	}

	int spr = 0;
	int ans = 0;
	for( int i = 1; i <= n; i++ ) {
		for( int j = 1; j <= m; j++ ) {
			spr += cnt[i][j];
			if( c[i][j] == 'M') {
				if( spr >= k ) ans++;
			}
		}
		spr -= _left[i];
	}
	cout << ans;

return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1372 KB Output is correct
2 Correct 3 ms 1372 KB Output is correct
3 Correct 3 ms 1628 KB Output is correct
4 Correct 3 ms 1480 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7256 KB Output is correct
2 Correct 8 ms 7260 KB Output is correct
3 Correct 8 ms 7068 KB Output is correct
4 Correct 11 ms 7260 KB Output is correct
5 Correct 9 ms 7260 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 3 ms 1628 KB Output is correct
19 Correct 3 ms 1480 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 9 ms 7256 KB Output is correct
22 Correct 8 ms 7260 KB Output is correct
23 Correct 8 ms 7068 KB Output is correct
24 Correct 11 ms 7260 KB Output is correct
25 Correct 9 ms 7260 KB Output is correct
26 Execution timed out 2048 ms 3676 KB Time limit exceeded
27 Halted 0 ms 0 KB -