Submission #3997170


Source Code Expand

#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <math.h>
using namespace std;
typedef long long ll;
int sw[2005],sb[2005],uw[2005],ub[2005];
int sw2[2005],sb2[2005],uw2[2005],ub2[2005];
int w[2005][2005],b[2005][2005];
int n,k,ans=0;
int main(void){
    cin>>n>>k;
    for(int i=0;i<n;i++){
        int x,y;
        char c;
        cin>>x>>y>>c;
        x=(((x/k)%2+(y/k)%2)%2)*k+x%k;
        y=y%k;
        if(c=='W')w[y][x]++;
        else b[y][x]++;
    }
    
    for(int i=0;i<k;i++){
        for(int j=0;j<k;j++){
            ub[j]+=b[i][j];
            uw[j]+=w[i][j];
        }
        for(int j=k;j<2*k;j++){
            ub2[j]+=b[i][j];
            uw2[j]+=w[i][j];

        }
    }
    for(int i=0;i<=k;i++){
        int p=0;
        for(int j=0;j<k;j++){
            p+=sw[j]+ub[j];
        }
        for(int j=k;j<2*k;j++){
            p+=uw2[j]+sb2[j];
        }
        ans=max(p,ans);
        for(int j=0;j<k;j++){
            p=p-ub[j]-sw[j]+uw[j]+sb[j];
            p=p-uw2[j+k]-sb2[j+k]+ub2[j+k]+sw2[j+k];
            ans=max(ans,p);
        }
        for(int j=0;j<k;j++){
            p=p+ub[j]+sw[j]-uw[j]-sb[j];
            p=p+uw2[j+k]+sb2[j+k]-ub2[j+k]-sw2[j+k];
            ans=max(ans,p);
        }
        for(int j=0;j<k;j++){
            ub[j]-=b[i][j];
            sw[j]+=w[i][j];
            uw[j]-=w[i][j];
            sb[j]+=b[i][j];
        }
        for(int j=k;j<2*k;j++){
            uw2[j]-=w[i][j];
            sb2[j]+=b[i][j];
            ub2[j]-=b[i][j];
            sw2[j]+=w[i][j];
        }
    }
    cout<<ans<<endl;
}

Submission Info

Submission Time
Task D - Checker
User Fu_L
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1721 Byte
Status AC
Exec Time 137 ms
Memory 18688 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 31
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 15 ms 2304 KB
0_002.txt AC 2 ms 2304 KB
1_003.txt AC 15 ms 256 KB
1_004.txt AC 2 ms 2304 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 2 ms 256 KB
1_008.txt AC 16 ms 2304 KB
1_009.txt AC 3 ms 2304 KB
1_010.txt AC 3 ms 2304 KB
1_011.txt AC 3 ms 2304 KB
1_012.txt AC 4 ms 4864 KB
1_013.txt AC 21 ms 17152 KB
1_014.txt AC 113 ms 2304 KB
1_015.txt AC 116 ms 2304 KB
1_016.txt AC 114 ms 2304 KB
1_017.txt AC 117 ms 4864 KB
1_018.txt AC 137 ms 18688 KB
1_019.txt AC 7 ms 768 KB
1_020.txt AC 7 ms 768 KB
1_021.txt AC 8 ms 4352 KB
1_022.txt AC 8 ms 4352 KB
1_023.txt AC 8 ms 4864 KB
1_024.txt AC 8 ms 4864 KB
1_025.txt AC 80 ms 2432 KB
1_026.txt AC 111 ms 4352 KB
1_027.txt AC 81 ms 2304 KB
1_028.txt AC 99 ms 18688 KB
1_029.txt AC 80 ms 2304 KB
1_030.txt AC 97 ms 2304 KB