oj.uz

Submission #925612

# Submission time Handle Problem Language Result Execution time Memory
925612 2024-02-12T06:16:53 Z vjudge1 Collecting Mushrooms (NOI18_collectmushrooms) C++17
0 / 100
 2000 ms 348 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);
      #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.out", "w", stdout);
      #endif

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

	if( n == 1 ) {
		int msh = 0;
		int spr = 0;

		vector<int> cnt(m+1, 0);
		char c[m+1];
		for( int i = 1; i <= m; i++ ) {
			cin >> c[i];
			if( c[i] == 'S') {
				cnt[max(i-d,1)]++;
				if( i+d+1 <= m ) cnt[i+d+1]--;
			}
		}
		int ans = 0;
		for( int i = 1; i <= m; i++ ) {
			spr += cnt[i];
			if( c[i] == 'M') {
				if( spr >= k ) ans++;
			}
		}
		cout << ans;

		return 0;
	} else {
		vector<pii> msh;
		vector<pii> spr;
		for( int i = 1; i <= n; i++ ) {
			for( int j = 1; j <= m; j++ ) {
				char c; cin >> c;
				if( c == 'M') msh.emb(i,j);
				if( c == 'S') spr.emb(i,j);
			}
		}
		sort(spr.begin(), spr.end());

		int ans = 0;
		for( int i = 0; i < msh.size(); i++ ) {
			int cnt = 0;
			if( spr.size() > 0 ) {
				int pos = lower_bound(spr.begin(), spr.end(), make_pair(msh[i].F-d, msh[i].S-d)) - spr.begin();
				if( pos >= 0 && pos < spr.size() ) {
					if( (spr[pos].F - msh[i].F) > d ) pos++;
					for( int j = pos; j < spr.size(); j++ ) {
						if( abs(msh[i].F - spr[j].F) > d ) break;
						if( abs(msh[i].S - spr[j].S) <= d ) cnt++;
						if( cnt >= k ) break;
					}
					if( cnt >= k ) {
						ans++;
					}
				}
			}
		}
		cout << ans;
	}

return 0;
}

Compilation message

mushrooms.cpp: In function 'int main()':
mushrooms.cpp:35:7: warning: unused variable 'msh' [-Wunused-variable]
   35 |   int msh = 0;
      |       ^~~
mushrooms.cpp:70:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for( int i = 0; i < msh.size(); i++ ) {
      |                   ~~^~~~~~~~~~~~
mushrooms.cpp:74:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     if( pos >= 0 && pos < spr.size() ) {
      |                     ~~~~^~~~~~~~~~~~
mushrooms.cpp:76:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |      for( int j = pos; j < spr.size(); j++ ) {
      |                        ~~^~~~~~~~~~~~
mushrooms.cpp:27:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:28:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 | freopen("output.out", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2066 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2031 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2041 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -