oj.uz

답안 #394406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394406 2021-04-26T13:56:16 Z ignaciocanta Collecting Mushrooms (NOI18_collectmushrooms) C++14
100 / 100
 20 ms 23824 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 vpl = vector<pl>;
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 tint mod = 998244353;
const int MX = 5e5+5;
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
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));
}
 
template<class T> bool ckmin(T& a, const T& b) {
	return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
	return a < b ? a = b, 1 : 0; 
}
 
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); } //redondea 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);
	}
}

string a[MX];
vvi b;
int d;
int n, m;

void activate(int x, int y){
	int xUp = max(1, x-d);
	int yUp = max(1, y-d);
	int xDw = min(n, x+d);
	int yDw = min(m, y+d);
	++b[xUp][yUp]; 
	++b[xDw+1][yDw+1];
	--b[xUp][yDw+1];
	--b[xDw+1][yUp];
}

int main(){
	NACHO();
	int k; cin >> n >> m >> d >> k;
	b.rsz(n+2, vi(m+2, 0));
	F0R(i, n) cin >> a[i];
	F0R(i, n){
		F0R(j, m){
			if(a[i][j] == 'S') activate(i+1, j+1);
		}
	}
	FOR(i, 1, n+1){
		FOR(j, 1, m+1){
			b[i][j] += b[i-1][j]+b[i][j-1]-b[i-1][j-1];
		}
	}
	int ret = 0;
	FOR(i, 1, n+1){
		FOR(j, 1, m+1){
			if(a[i-1][j-1] == 'M' && b[i][j] >= k) ++ret;
		}
	}
	cout << ret << "\n";
}
/*
5 5 1 1
....M
.M...
..S..
.S...
...M.
*/

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 10 ms 16008 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15920 KB Output is correct
5 Correct 10 ms 15940 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 10 ms 16008 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15920 KB Output is correct
5 Correct 10 ms 15940 KB Output is correct
6 Correct 9 ms 15972 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Correct 9 ms 16076 KB Output is correct
9 Correct 9 ms 15948 KB Output is correct
10 Correct 9 ms 15972 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15948 KB Output is correct
2 Correct 8 ms 15948 KB Output is correct
3 Correct 9 ms 15980 KB Output is correct
4 Correct 9 ms 15948 KB Output is correct
5 Correct 8 ms 16000 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 17100 KB Output is correct
2 Correct 11 ms 17108 KB Output is correct
3 Correct 12 ms 17356 KB Output is correct
4 Correct 11 ms 17184 KB Output is correct
5 Correct 12 ms 17228 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 23824 KB Output is correct
2 Correct 16 ms 23792 KB Output is correct
3 Correct 19 ms 23816 KB Output is correct
4 Correct 20 ms 23756 KB Output is correct
5 Correct 18 ms 23756 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 10 ms 16008 KB Output is correct
3 Correct 9 ms 15948 KB Output is correct
4 Correct 9 ms 15920 KB Output is correct
5 Correct 10 ms 15940 KB Output is correct
6 Correct 9 ms 15972 KB Output is correct
7 Correct 9 ms 15956 KB Output is correct
8 Correct 9 ms 16076 KB Output is correct
9 Correct 9 ms 15948 KB Output is correct
10 Correct 9 ms 15972 KB Output is correct
11 Correct 8 ms 15948 KB Output is correct
12 Correct 8 ms 15948 KB Output is correct
13 Correct 9 ms 15980 KB Output is correct
14 Correct 9 ms 15948 KB Output is correct
15 Correct 8 ms 16000 KB Output is correct
16 Correct 11 ms 17100 KB Output is correct
17 Correct 11 ms 17108 KB Output is correct
18 Correct 12 ms 17356 KB Output is correct
19 Correct 11 ms 17184 KB Output is correct
20 Correct 12 ms 17228 KB Output is correct
21 Correct 18 ms 23824 KB Output is correct
22 Correct 16 ms 23792 KB Output is correct
23 Correct 19 ms 23816 KB Output is correct
24 Correct 20 ms 23756 KB Output is correct
25 Correct 18 ms 23756 KB Output is correct
26 Correct 20 ms 20044 KB Output is correct
27 Correct 15 ms 18624 KB Output is correct
28 Correct 17 ms 18676 KB Output is correct
29 Correct 16 ms 18768 KB Output is correct
30 Correct 18 ms 19440 KB Output is correct