oj.uz

답안 #1029739

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029739 2024-07-21T08:44:30 Z 7again Collecting Mushrooms (NOI18_collectmushrooms) C++17
100 / 100
 21 ms 13176 KB 
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define f first
#define s second
#define pb push_back
#define in insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define FAST ios::sync_with_stdio(0);cout.tie(0);cin.tie(0)

using namespace std ;

void setIO(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}

const int N = 300000 , MOD = 1e9+7 ;

//bool inside(int x,int y){return(x<n&&y<m&&x>-1&&y>-1&&a[x][y]!='#');}

//int dx[4]{1 , -1 , 0 , 0} , dy[4]{0 , 0 , 1 , -1} ;


void slv()
{
    int n , m , d , k ;
    cin >> n >> m >> d >> k ;

    char a[n][m] ;
    int pfx[n + 2][m + 2] ;
    fill_n(&pfx[0][0] , (n + 2) * (m + 2) , 0) ;

    for(int i = 0 ; i < n ; i++)
    {
        for(int j = 0 ; j < m ; j++)
        {
            cin >> a[i][j] ;
            if(a[i][j] == 'S')
            {
                int x1 = max((int)0 , i - d) ;
                int x2 = min((int)n , i + d + 1) ;
                int y1 = max((int)0 , j - d) ;
                int y2 = min((int)m , j + d + 1) ;

                pfx[x1][y1]++ ;
                pfx[x1][y2]-- ;
                pfx[x2][y1]-- ;
                pfx[x2][y2]++ ;
            }
        }
    }

    for(int i = 0 ; i < n ; i++)
    {
        for(int j = 0 ; j < m ; j++)
        {
            if(i > 0)
                pfx[i][j] += pfx[i - 1][j] ;
            if(j > 0)
                pfx[i][j] += pfx[i][j - 1] ;
            if(i > 0 && j > 0)
                pfx[i][j] -= pfx[i - 1][j - 1] ;
        }
    }

    int ans = 0 ;
    for(int i = 0 ; i < n ; i++)
    {
        for(int j = 0 ; j < m ; j++)
        {
            if(a[i][j] == 'M' && pfx[i][j] >= k)
                ans++ ;
        }
    }

    cout << ans ;

}
main()
{
    //setIO("lasers") ;

    FAST ;

    int t = 1 ;
    //cin >> t ;

    while(t--)
        slv() ;
}

Compilation message

mushrooms.cpp:80:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 | main()
      | ^~~~
mushrooms.cpp: In function 'void setIO(std::string)':
mushrooms.cpp:16:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 | void setIO(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mushrooms.cpp:16:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 | void setIO(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

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

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2140 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2768 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 12636 KB Output is correct
2 Correct 13 ms 12632 KB Output is correct
3 Correct 12 ms 13176 KB Output is correct
4 Correct 14 ms 13148 KB Output is correct
5 Correct 15 ms 13052 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2140 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 4 ms 2768 KB Output is correct
19 Correct 5 ms 2396 KB Output is correct
20 Correct 3 ms 2396 KB Output is correct
21 Correct 21 ms 12636 KB Output is correct
22 Correct 13 ms 12632 KB Output is correct
23 Correct 12 ms 13176 KB Output is correct
24 Correct 14 ms 13148 KB Output is correct
25 Correct 15 ms 13052 KB Output is correct
26 Correct 9 ms 5464 KB Output is correct
27 Correct 9 ms 5212 KB Output is correct
28 Correct 12 ms 5360 KB Output is correct
29 Correct 11 ms 5364 KB Output is correct
30 Correct 10 ms 5372 KB Output is correct