oj.uz

답안 #925581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925581 2024-02-12T05:34:52 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
컴파일 오류
 0 ms 0 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

int n, m, d, k;

void solve () {
	cin >> n >> m >> d >> k;
	char a[n + 1][m + 1];
	int p[n + 1][m + 1];
	p[0][0] = p[0][1] = p[1][0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) cin >> a[i][j], p[i][j] = p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1] + (a[i][j] == 'S');
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] == 'M') {
				int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
				if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
			}
		}
	}
	cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {

	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Compilation message

mushrooms.cpp: In function 'void solve()':
mushrooms.cpp:52:26: error: no matching function for call to 'max(int, long long int)'
   52 |     int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
      |                          ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from mushrooms.cpp:4:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
mushrooms.cpp:52:26: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   52 |     int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
      |                          ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from mushrooms.cpp:4:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
mushrooms.cpp:52:26: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   52 |     int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
      |                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from mushrooms.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
mushrooms.cpp:52:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   52 |     int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
      |                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from mushrooms.cpp:4:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
mushrooms.cpp:52:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   52 |     int x1 = max(1, i - d), y1 = max(1, j - d), x2 = min(n, i + d), y2 = min(m, j + d);
      |                          ^
mushrooms.cpp:53:11: error: 'x2' was not declared in this scope; did you mean 'x1'?
   53 |     if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
      |           ^~
      |           x1
mushrooms.cpp:53:15: error: 'y2' was not declared in this scope; did you mean 'yn'?
   53 |     if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
      |               ^~
      |               yn
mushrooms.cpp:53:30: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   53 |     if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
      |                           ~~~^~~
mushrooms.cpp:53:66: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   53 |     if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
      |                                                               ~~~^~~
mushrooms.cpp:53:62: error: invalid types 'long long int [(m + 1)][double (*)(double) noexcept]' for array subscript
   53 |     if (p[x2][y2] - p[x2][y1 - 1] - p[x1 - 1][y2] + p[x1 - 1][y1 - 1] >= k) ans++;
      |                                                              ^