Submission #34171


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <sstream>

using namespace std;

void erase(vector<vector<int> > &a, int i, int j) {
    int di[8] = {-1,0,1,-1,1,-1,0,1}, dj[8]={-1,-1,-1,0,0,1,1,1};
    if (i<0 || a.size() <= i || j<0 || a[0].size() <= j)return;
    if (a[i][j] == 0)return;
    a[i][j] = 0;
    for (int c=0; c<8; c++) {
        erase(a, i+di[c], j+dj[c]);
    }
}

int main() {
    int h,w;
    cin >> h >> w;
    vector<string> mat(h);
    vector<vector<int> > sumi(h+1, vector<int>(w+1)),sumj(h+1, vector<int>(w+1));
    for (int i=0; i<h; i++) {
        cin >> mat[i];
    }

    for (int i=1; i<h; i++) {
        for (int j=1; j<w; j++) {
            if (mat[i][j] == 'o') {
                sumi[i][j] = sumi[i-1][j] + 1;
                sumj[i][j] = sumj[i][j-1] + 1;
            } else {
                sumi[i][j] = 0;
                sumj[i][j] = 0;
            }
        }
    }    
    int a = 0,b = 0,c = 0;
    for (int k=142; k>0; k--) {
        for (int i=0; i<h; i++) {
            for (int j=0; j<w; j++) {
                if (sumi[i][j] == k * 5 && sumj[i][j] == k * 2 && sumi[i+1][j] == 0 || sumi[i][j] == k * 2 && sumj[i][j] == k * 5 && sumj[i][j+1] == 0) {
                    a++;
                    erase(sumi, i, j);
                    erase(sumj, i, j);
                }
            }
        }
        for (int i=0; i<h; i++) {
            for (int j=0; j<w; j++) {
                if (sumi[i][j] == k * 4 && sumj[i][j] == k * 1 && sumi[i+1][j] == 0 || sumi[i][j] == k * 1 && sumj[i][j] == k * 4 && sumj[i][j+1] == 0){
                    b++;
                    erase(sumi, i, j);
                    erase(sumj, i, j);
                }
            }
        }
        for (int i=0; i<h; i++) {
            for (int j=0; j<w; j++) {
                if ((sumi[i][j] == k * 3 && sumj[i][j] == k * 1 || sumi[i][j] == k * 1 && sumj[i][j] == k * 3) && (sumi[i+1][j] == 0 && sumj[i][j+1] == 0)) {
                    c++;
                    erase(sumi, i, j);
                    erase(sumj, i, j);
                }
            }
        }
    }
    cout << a << " " << b << " " << c << endl;
}

Submission Info

Submission Time
Task D - アルファベット探し
User y3eadgbe
Language C++ (G++ 4.6.4)
Score 0
Code Size 2265 Byte
Status WA
Exec Time 1036 ms
Memory 19712 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 33
WA × 21
RE × 4
Set Name Test Cases
All 00_min.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rndsmall_00.txt, 01_rndsmall_01.txt, 01_rndsmall_02.txt, 01_rndsmall_03.txt, 01_rndsmall_04.txt, 01_rndsmall_05.txt, 01_rndsmall_06.txt, 01_rndsmall_07.txt, 01_rndsmall_08.txt, 01_rndsmall_09.txt, 01_rndsmall_10.txt, 01_rndsmall_11.txt, 01_rndsmall_12.txt, 01_rndsmall_13.txt, 01_rndsmall_14.txt, 01_rndsmall_15.txt, 01_rndsmall_16.txt, 01_rndsmall_17.txt, 01_rndsmall_18.txt, 01_rndsmall_19.txt, 02_rndmax_00.txt, 02_rndmax_01.txt, 02_rndmax_02.txt, 02_rndmax_03.txt, 02_rndmax_04.txt, 02_rndmax_05.txt, 02_rndmax_06.txt, 02_rndmax_07.txt, 02_rndmax_08.txt, 02_rndmax_09.txt, 02_rndmax_10.txt, 02_rndmax_11.txt, 02_rndmax_12.txt, 02_rndmax_13.txt, 02_rndmax_14.txt, 02_rndmax_15.txt, 02_rndmax_16.txt, 02_rndmax_17.txt, 02_rndmax_18.txt, 02_rndmax_19.txt, 03_rnd_00.txt, 03_rnd_01.txt, 03_rnd_02.txt, 03_rnd_03.txt, 03_rnd_04.txt, 03_rnd_05.txt, 03_rnd_06.txt, 03_rnd_07.txt, 03_rnd_08.txt, 03_rnd_09.txt, 04_empty_00.txt, 05_maxret_00.txt
Case Name Status Exec Time Memory
00_min.txt AC 22 ms 800 KB
00_sample_01.txt AC 21 ms 780 KB
00_sample_02.txt AC 21 ms 780 KB
00_sample_03.txt AC 22 ms 792 KB
00_sample_04.txt AC 22 ms 788 KB
00_sample_05.txt AC 23 ms 736 KB
01_rndsmall_00.txt AC 30 ms 912 KB
01_rndsmall_01.txt AC 32 ms 1012 KB
01_rndsmall_02.txt AC 32 ms 944 KB
01_rndsmall_03.txt AC 31 ms 908 KB
01_rndsmall_04.txt AC 31 ms 900 KB
01_rndsmall_05.txt AC 30 ms 912 KB
01_rndsmall_06.txt AC 32 ms 924 KB
01_rndsmall_07.txt AC 31 ms 920 KB
01_rndsmall_08.txt AC 32 ms 896 KB
01_rndsmall_09.txt AC 33 ms 892 KB
01_rndsmall_10.txt AC 30 ms 916 KB
01_rndsmall_11.txt AC 31 ms 892 KB
01_rndsmall_12.txt AC 31 ms 916 KB
01_rndsmall_13.txt AC 33 ms 780 KB
01_rndsmall_14.txt AC 31 ms 912 KB
01_rndsmall_15.txt AC 32 ms 892 KB
01_rndsmall_16.txt AC 32 ms 884 KB
01_rndsmall_17.txt AC 31 ms 924 KB
01_rndsmall_18.txt AC 31 ms 912 KB
01_rndsmall_19.txt AC 33 ms 896 KB
02_rndmax_00.txt WA 1012 ms 11012 KB
02_rndmax_01.txt WA 1001 ms 10744 KB
02_rndmax_02.txt WA 1026 ms 9844 KB
02_rndmax_03.txt WA 997 ms 10488 KB
02_rndmax_04.txt WA 1008 ms 10112 KB
02_rndmax_05.txt WA 1007 ms 11132 KB
02_rndmax_06.txt RE 340 ms 19708 KB
02_rndmax_07.txt RE 617 ms 19708 KB
02_rndmax_08.txt WA 1002 ms 10872 KB
02_rndmax_09.txt WA 997 ms 10612 KB
02_rndmax_10.txt WA 1000 ms 10996 KB
02_rndmax_11.txt WA 1003 ms 12164 KB
02_rndmax_12.txt WA 1001 ms 10760 KB
02_rndmax_13.txt RE 631 ms 19700 KB
02_rndmax_14.txt RE 347 ms 19712 KB
02_rndmax_15.txt WA 1001 ms 10104 KB
02_rndmax_16.txt WA 1012 ms 14068 KB
02_rndmax_17.txt WA 994 ms 13044 KB
02_rndmax_18.txt WA 1000 ms 11644 KB
02_rndmax_19.txt WA 1003 ms 10736 KB
03_rnd_00.txt AC 46 ms 992 KB
03_rnd_01.txt WA 228 ms 3320 KB
03_rnd_02.txt AC 222 ms 2680 KB
03_rnd_03.txt WA 256 ms 3964 KB
03_rnd_04.txt WA 295 ms 4088 KB
03_rnd_05.txt AC 75 ms 1528 KB
03_rnd_06.txt AC 375 ms 4320 KB
03_rnd_07.txt AC 137 ms 2044 KB
03_rnd_08.txt WA 535 ms 11764 KB
03_rnd_09.txt WA 439 ms 5112 KB
04_empty_00.txt AC 971 ms 9716 KB
05_maxret_00.txt AC 1036 ms 9724 KB