Submission #5569928


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1000000007;

int GCD(int a, int b){return b == 0 ? a : GCD(b, a % b);}

int main(){

    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);

    freopen("input.txt", "r", stdin);

    int n, m, k = 0;
    cin >> n >> m;

    string cur;

    for(int i = 0; i < n; ++i){
        cin >> cur;

        /*

        // Forgot to account the case where you go down but go back up again

        if(i > 0){
            for(int j = 1; j < m; ++j){
                if(prev[j] == '#' && cur[j] == '#' && cur[j - 1] == '#'){
                    cout << "Impossible";
                    return 0;
                }
            }
        }*/

        for(auto j : cur){
            if(j == '#')
                ++k;
        }

        //prev = cur;
    }

    if(k == n + m - 1)
        cout << "Possible";
    else
        cout << "Impossible";

    return 0;
}

Submission Info

Submission Time
Task A - Shik and Stone
User Zeyu
Language C++14 (GCC 5.4.1)
Score 0
Code Size 969 Byte
Status RE
Exec Time 101 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     freopen("input.txt", "r", stdin);
                                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
RE × 3
RE × 22
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt RE 97 ms 256 KB
001.txt RE 97 ms 256 KB
002.txt RE 97 ms 256 KB
003.txt RE 97 ms 256 KB
004.txt RE 97 ms 256 KB
005.txt RE 97 ms 256 KB
006.txt RE 97 ms 256 KB
007.txt RE 97 ms 256 KB
008.txt RE 97 ms 256 KB
009.txt RE 96 ms 256 KB
010.txt RE 97 ms 256 KB
011.txt RE 97 ms 256 KB
012.txt RE 96 ms 256 KB
013.txt RE 100 ms 256 KB
014.txt RE 100 ms 256 KB
015.txt RE 100 ms 256 KB
016.txt RE 100 ms 256 KB
017.txt RE 98 ms 256 KB
018.txt RE 97 ms 256 KB
example0.txt RE 101 ms 256 KB
example1.txt RE 99 ms 256 KB
example2.txt RE 98 ms 256 KB