Submission #2983262
Source Code Expand
#include <bits/stdc++.h> #define MAX_N 100000 #define MAX_K 1000 using namespace std; struct coord { int x, y, c; }; coord v[MAX_N + 1]; int rest[MAX_K + 1][2][2]; int n, k; int main() { cin >> n >> k; char ch; for(int i = 1; i <= n; i ++) { cin >> v[i].x >> v[i].y >> ch; v[i].c = (ch == 'W'); } int i, j; int rez = 0; for(i = 0; i < k; i ++) { for(j = 0; j <= k; j ++) rest[j][0][0] = rest[j][1][0] = rest[j][1][1] = rest[j][0][1] = 0; int cr = 0; int culcr; for(j = 1; j <= n; j ++) { if(v[j].y % (k << 1) >= i && v[j].y % (k << 1) <= i + k - 1) culcr = ((v[j].x / k) & 1); else culcr = 1 - ((v[j].x / k) & 1); rest[v[j].x % k][culcr][v[j].c] ++; if(v[j].c == culcr) cr ++; } // if(cr == 3 || n - cr == 3) // cout << "AVEM " << i << " " << cr << "\n"; // cout << rest[0][0][0] << " " << rest[0][0][1] << "\n"; // cout << rest[0][1][0] << " " << rest[0][1][1] << "\n\n"; rez = max(rez, cr); rez = max(rez, n - cr); for(j = 0; j < k - 1; j ++) { cr -= rest[j][0][0]; cr += rest[j][1][0]; cr -= rest[j][1][1]; cr += rest[j][0][1]; //if(cr == 3 || n - cr == 3) // cout << "AVEM " << i << " " << j << " " << cr << "\n"; rez = max(rez, cr); rez = max(rez, n - cr); } } cout << rez << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Checker |
User | Coroian_David |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1681 Byte |
Status | AC |
Exec Time | 1744 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
0_001.txt | AC | 4 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 4 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 4 ms | 256 KB |
1_009.txt | AC | 2 ms | 256 KB |
1_010.txt | AC | 2 ms | 256 KB |
1_011.txt | AC | 2 ms | 256 KB |
1_012.txt | AC | 4 ms | 256 KB |
1_013.txt | AC | 15 ms | 256 KB |
1_014.txt | AC | 113 ms | 1408 KB |
1_015.txt | AC | 118 ms | 1408 KB |
1_016.txt | AC | 120 ms | 1408 KB |
1_017.txt | AC | 280 ms | 1408 KB |
1_018.txt | AC | 1744 ms | 1408 KB |
1_019.txt | AC | 15 ms | 384 KB |
1_020.txt | AC | 15 ms | 384 KB |
1_021.txt | AC | 15 ms | 384 KB |
1_022.txt | AC | 16 ms | 384 KB |
1_023.txt | AC | 15 ms | 384 KB |
1_024.txt | AC | 15 ms | 384 KB |
1_025.txt | AC | 93 ms | 1408 KB |
1_026.txt | AC | 1674 ms | 1408 KB |
1_027.txt | AC | 95 ms | 1408 KB |
1_028.txt | AC | 1701 ms | 1408 KB |
1_029.txt | AC | 87 ms | 1408 KB |
1_030.txt | AC | 993 ms | 1408 KB |