oj.uz

답안 #925683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925683 2024-02-12T07:26:04 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
79 / 100
 2000 ms 26160 KB 
#include<bits/stdc++.h>
using namespace  std;
#define ll long long
#define lld long long double
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define IShowSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int N=5e5+100;
const int mod=1e9+7;
const int K=500;
const ll inf=1e18+1337;
const int dx[]={-1, 0, 0, 1};
const int dy[]={0, -1, 1, 0};
vector<ll>h[N];
vector< pair<ll,ll> >v;

int main()
{
	IShowSpeed
	ll n,m,d,k,ans=0;
	cin>>n>>m>>d>>k;

	for(int i=1;i<=n;++i)
		for(int j=0;j<=m;++j)
			h[i].pb(0);

	for(int i=1;i<=n;++i)
	{
		ll sum=0;
		for(int j=1;j<=m;++j)
		{
			char c;
			cin>>c;
			if(c=='S') sum++;
			if(c=='M') v.pb({i,j});
			h[i][j]=sum;
		}
	}

	for(auto p: v)
	{
		ll x=p.F,y=p.S,sum=0;
		ll x1=max(1ll,x-d),x2=min(n,x+d);
		ll y1=min(m,y+d),y2=max(0ll,y-d-1);
		for(int i=x1;i<=x2;i+=3)
		{
			sum+=h[i][y1]-h[i][y2];
			if(i+1<=x2) sum+=h[i+1][y1]-h[i+1][y2];
			if(i+2<=x2) sum+=h[i+2][y1]-h[i+2][y2];
			if(sum>=k)
			{
				ans++;
				break;
			}
		}
	}
	cout<<ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12120 KB Output is correct
2 Correct 5 ms 12404 KB Output is correct
3 Correct 3 ms 12376 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 3 ms 12120 KB Output is correct
5 Correct 3 ms 12380 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14164 KB Output is correct
2 Correct 7 ms 14000 KB Output is correct
3 Correct 11 ms 14172 KB Output is correct
4 Correct 8 ms 13656 KB Output is correct
5 Correct 7 ms 13916 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23504 KB Output is correct
2 Correct 19 ms 26160 KB Output is correct
3 Correct 18 ms 25684 KB Output is correct
4 Correct 17 ms 23460 KB Output is correct
5 Correct 20 ms 25684 KB Output is correct

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12120 KB Output is correct
2 Correct 5 ms 12404 KB Output is correct
3 Correct 3 ms 12376 KB Output is correct
4 Correct 3 ms 12124 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 3 ms 12124 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 3 ms 12124 KB Output is correct
10 Correct 3 ms 12124 KB Output is correct
11 Correct 3 ms 12124 KB Output is correct
12 Correct 3 ms 12124 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 3 ms 12120 KB Output is correct
15 Correct 3 ms 12380 KB Output is correct
16 Correct 7 ms 14164 KB Output is correct
17 Correct 7 ms 14000 KB Output is correct
18 Correct 11 ms 14172 KB Output is correct
19 Correct 8 ms 13656 KB Output is correct
20 Correct 7 ms 13916 KB Output is correct
21 Correct 17 ms 23504 KB Output is correct
22 Correct 19 ms 26160 KB Output is correct
23 Correct 18 ms 25684 KB Output is correct
24 Correct 17 ms 23460 KB Output is correct
25 Correct 20 ms 25684 KB Output is correct
26 Execution timed out 2081 ms 20692 KB Time limit exceeded
27 Halted 0 ms 0 KB -