oj.uz

Submission #519850

# Submission time Handle Problem Language Result Execution time Memory
519850 2022-01-27T12:30:15 Z Hacv16 Emacs (COCI20_emacs) C++17
0 / 50
 3 ms 716 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAX = 615;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int VAR[4] = {-1, 1, 0, 0};

#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cout << #x << ": " << "[ " << x << " ]\n"

int n, m, ans;
char t[MAX][MAX];

void setIO(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 

    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin); 
        freopen("output.txt", "w", stdout);
    #endif
}

void dfs(int x, int y){
    t[x][y] = '.';

    for(int i = 0, j = 3; i < 4; i++, j--){
        int nx = x + VAR[i], ny = y + VAR[j];

        if(t[nx][ny] == '*'){
            dfs(nx, ny);
        }
    }
}

int main(){
    setIO();

    memset(t, '.', sizeof(t));

    cin >> n >> m;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> t[i][j];
        }
    }        

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(t[i][j] == '*'){
                ans++, dfs(i, j);
            }
        }
    }

    cout << ans << '\n';

    return 0;
}

Compilation message

emacs.cpp: In function 'void setIO()':
emacs.cpp:28:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
emacs.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 716 KB Output isn't correct
2 Incorrect 2 ms 716 KB Output isn't correct
3 Incorrect 2 ms 716 KB Output isn't correct
4 Incorrect 2 ms 716 KB Output isn't correct
5 Incorrect 3 ms 716 KB Output isn't correct
6 Incorrect 2 ms 716 KB Output isn't correct
7 Incorrect 2 ms 716 KB Output isn't correct
8 Incorrect 3 ms 716 KB Output isn't correct
9 Incorrect 2 ms 716 KB Output isn't correct
10 Incorrect 2 ms 716 KB Output isn't correct