Submission #3979091


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, K, Sum[2][2005][2005], alph[30], result;

int main()
{
    alph['B' - 'A'] = 0;
    alph['W' - 'A'] = 1;
    scanf("%d %d", &N, &K);
    for(int i = 0; i < N; i++)
    {
        int x, y;
        char c;
        scanf("%d %d %c", &x, &y, &c);
        x = x % (2 * K) + 1;
        y = y % (2 * K) + 1;
        Sum[alph[c - 'A']][y][x]++;
    }
    for(int i = 1; i <= 2 * K; i++)
    {
        for(int j = 1; j <= 2 * K; j++)
        {
            for(int k = 0; k < 2; k++)
            {
                Sum[k][i][j] += Sum[k][i - 1][j] + Sum[k][i][j - 1] - Sum[k][i - 1][j - 1];
            }
        }
    }
    for(int i = 0; i < K; i++)
    {
        for(int j = 0; j < K; j++)
        {
            int blackHap = 0, whiteHap = 0, blackHap2 = 0, whiteHap2 = 0;
            blackHap = Sum[0][2 * K - i][2 * K - j] + Sum[0][K - i][K - j] * 2;
            blackHap = blackHap - Sum[0][K - i][2 * K - j] - Sum[0][2 * K - i][K - j];
            blackHap += Sum[0][K - i][2 * K] - Sum[0][K - i][2 * K - j];
            blackHap += Sum[0][2 * K][K - j] - Sum[0][2 * K - i][K - j];
            whiteHap = Sum[1][K - i][2 * K - j] + Sum[1][2 * K - i][K - j];
            whiteHap = whiteHap - Sum[1][K - i][K - j] * 2;
            whiteHap += Sum[1][2 * K - i][2 * K] - Sum[1][K - i][2 * K] - Sum[1][2 * K - i][2 * K - j] + Sum[1][K - i][2 * K - j];
            whiteHap += Sum[1][2 * K][2 * K - j] - Sum[1][2 * K][K - j] - Sum[1][2 * K - i][2 * K - j] + Sum[1][2 * K - i][K - j];
            if(i == j)
            {
                blackHap = blackHap + Sum[0][2 * K][2 * K] - Sum[0][2 * K - i][2 * K] - Sum[0][2 * K][2 * K - j] + Sum[0][2 * K - i][2 * K - j];
            }

            whiteHap2 = Sum[1][2 * K - i][2 * K - j] + Sum[1][K - i][K - j] * 2;
            whiteHap2 = whiteHap2 - Sum[1][K - i][2 * K - j] - Sum[1][2 * K - i][K - j];
            whiteHap2 += Sum[1][K - i][2 * K] - Sum[1][K - i][2 * K - j];
            whiteHap2 += Sum[1][2 * K][K - j] - Sum[1][2 * K - i][K - j];
            blackHap2 = Sum[0][K - i][2 * K - j] + Sum[0][2 * K - i][K - j];
            blackHap2 = blackHap2 - Sum[0][K - i][K - j] * 2;
            blackHap2 += Sum[0][2 * K - i][2 * K] - Sum[0][K - i][2 * K] - Sum[0][2 * K - i][2 * K - j] + Sum[0][K - i][2 * K - j];
            blackHap2 += Sum[0][2 * K][2 * K - j] - Sum[0][2 * K][K - j] - Sum[0][2 * K - i][2 * K - j] + Sum[0][2 * K - i][K - j];
            if(i == j)
            {
                whiteHap2 = whiteHap2 + Sum[1][2 * K][2 * K] - Sum[1][2 * K - i][2 * K] - Sum[1][2 * K][2 * K - j] + Sum[1][2 * K - i][2 * K - j];
            }
            result = max(result, max(blackHap + whiteHap, blackHap2 + whiteHap2));
        }
    }
    printf("%d", result);
}

Submission Info

Submission Time
Task D - Checker
User ljk0411jg
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2870 Byte
Status WA
Exec Time 61 ms
Memory 31616 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &K);
                           ^
./Main.cpp:16:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %c", &x, &y, &c);
                                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 26
WA × 5
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt
Case Name Status Exec Time Memory
0_000.txt AC 2 ms 2304 KB
0_001.txt AC 31 ms 31616 KB
0_002.txt AC 2 ms 2304 KB
1_003.txt AC 31 ms 31616 KB
1_004.txt AC 2 ms 2304 KB
1_005.txt AC 2 ms 2304 KB
1_006.txt AC 2 ms 2304 KB
1_007.txt AC 3 ms 5248 KB
1_008.txt AC 31 ms 31616 KB
1_009.txt AC 2 ms 2304 KB
1_010.txt AC 2 ms 2304 KB
1_011.txt AC 2 ms 2304 KB
1_012.txt WA 3 ms 5376 KB
1_013.txt WA 31 ms 31616 KB
1_014.txt AC 27 ms 2304 KB
1_015.txt AC 27 ms 2304 KB
1_016.txt WA 27 ms 2304 KB
1_017.txt WA 29 ms 5376 KB
1_018.txt WA 61 ms 31616 KB
1_019.txt AC 5 ms 5376 KB
1_020.txt AC 5 ms 5376 KB
1_021.txt AC 5 ms 5248 KB
1_022.txt AC 5 ms 5248 KB
1_023.txt AC 5 ms 5248 KB
1_024.txt AC 5 ms 5248 KB
1_025.txt AC 23 ms 2432 KB
1_026.txt AC 54 ms 31616 KB
1_027.txt AC 23 ms 2432 KB
1_028.txt AC 53 ms 31616 KB
1_029.txt AC 23 ms 2432 KB
1_030.txt AC 52 ms 31616 KB