oj.uz

답안 #925704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925704 2024-02-12T07:40:52 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
79 / 100
 2000 ms 27048 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];
	set<pii> evs;
	vector<vector<int>> cnt(n+1, vector<int>(m+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 col1 = max(j - d, 1);
				bool k = 0;
				if( j + d + 1 > m ) k = 1;
				int col2 = j + d + 1;
				for( int row = max(1, i-d); row <= min(i+d,n); row++ ) {
					cnt[row][col1]++;
					if( k ) {
						if( row+1 <= n ) {
							cnt[row+1][1]--;
							evs.insert({row+1,1});
						}
					}
					else {
						cnt[row][col2]--;
						evs.insert({row,col2});
					}
					evs.insert({row,col1});
				}
			} else if( c[i][j] == 'M') {
				evs.insert({i,j});
			}
		}
	}

	int spr = 0;
	int ans = 0;
	for( auto [i,j]: evs ) {
		spr += cnt[i][j];
		if( c[i][j] == 'M') {
			if( spr >= k ) ans++;
		}
	}
	cout << ans;

return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1628 KB Output is correct
2 Correct 39 ms 6624 KB Output is correct
3 Correct 19 ms 4700 KB Output is correct
4 Correct 36 ms 5200 KB Output is correct
5 Correct 5 ms 2140 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 16040 KB Output is correct
2 Correct 79 ms 27048 KB Output is correct
3 Correct 65 ms 21676 KB Output is correct
4 Correct 85 ms 24744 KB Output is correct
5 Correct 76 ms 24944 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 14 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 28 ms 348 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 6 ms 1628 KB Output is correct
17 Correct 39 ms 6624 KB Output is correct
18 Correct 19 ms 4700 KB Output is correct
19 Correct 36 ms 5200 KB Output is correct
20 Correct 5 ms 2140 KB Output is correct
21 Correct 42 ms 16040 KB Output is correct
22 Correct 79 ms 27048 KB Output is correct
23 Correct 65 ms 21676 KB Output is correct
24 Correct 85 ms 24744 KB Output is correct
25 Correct 76 ms 24944 KB Output is correct
26 Execution timed out 2037 ms 4764 KB Time limit exceeded
27 Halted 0 ms 0 KB -