CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:Tipu
Submission time:2023-11-12 20:43:56 +0200
Language:C++ (C++11)
Status:COMPILE ERROR

Compiler report

input/code.cpp:3:9: error: 'll' does not name a type
    3 | typedef ll ll ll;
      |         ^~
input/code.cpp:8:5: error: 'll' does not name a type
    8 |     ll l = 0;
      |     ^~
input/code.cpp:9:5: error: 'll' does not name a type
    9 |     ll r = 0;
      |     ^~
input/code.cpp:12:7: error: 'll' does not name a type
   12 | const ll SIZE = 600;
      |       ^~
input/code.cpp:14:1: error: 'll' does not name a type
   14 | ll n, m, k;
      | ^~
input/code.cpp:15:1: error: 'll' does not name a type
   15 | ll v[SIZE][SIZE];
      | ^~
input/code.cpp:16:1: error: 'll' does not name a type
   16 | ll v2[SIZE][SIZE];
      | ^~
input/code.cpp:17:7: error: 'SIZE' was not declared in this scope
   17 | Hex d[SIZE][SIZE];
      |       ^~~~
input/code.cpp:17:13: error: 'SIZE' was not declared in this scope
   17 | Hex d[SIZE][SIZE];
      |             ^~~~
input/code.cpp:19:1: error: 'll' does not name a type
   19 | ll count_l_colum(ll i, ll j, ll l){
      | ^~
input/code.cpp...

Code

#include<bits/stdc++.h>
using namespace std;
typedef ll ll ll;
struct Hex {
public:
ll l = 0;
ll r = 0;
};
const ll SIZE = 600;
ll n, m, k;
ll v[SIZE][SIZE];
ll v2[SIZE][SIZE];
Hex d[SIZE][SIZE];
ll count_l_colum(ll i, ll j, ll l){
bool add = (i % 2 == 0);
return (d[i][j].l - d[i-l][j - ll(ceil((l-add)/2.0))].l);
}
ll count_r_colum(ll i, ll j, ll l){
bool add = (i % 2 == 0);
return (d[i][j].r - d[i-l][j + ll((l+add)/2.0)].r);
}
ll scan(ll p, bool skip1){
for (ll i = n; i >= 1; i--) {
if(skip1 && i == 1){
break;
}
ll h = i-skip1;
ll j2 = 1;
ll j1 = 1;
ll l = 1;
ll ms = d[i][1].l - d[i-1][(i % 2 == 0)].l;
ll s = ms;
ll safety = 0;
while (j1 < m)
{
safety++;
p = min(s, p);
if(j2 < j1+h - 1 && j2 < m){
j2++;
ms += count_l_colum(i, j2, (j2-j1 + 1));
continue;
}
//else
if((ms - s) < 0){
l++;
s += count_l_colum(i, (j1+l-1), l);
continue;
}
//else
if((ms - s) >= 0 && j1 < j2 && l > 1){
s -= count_r_colum(i, j1, l);
ms -= count_r_colum(i, j1, (j2-j1 + 1));
j1++;
l--;
continue;
}
else if (j2 >= m){
break;
}
else
{
s -= count_r_colum(i, j1, l);
ms -= count_r_colum(i, j1, (j2-j1 + 1));
j1++;
j2++;
s += count_l_colum(i, (j1+l-1), l);
ms += count_l_colum(i, j2, (j2-j1 + 1));
continue;
}
}
p = min(s, p);
}
return p;
}
int main() {
// freopen("input.txt", "r", stdin);
cin >> n >> m >> k;
ll a, b;
char c;
for (ll i = 0; i < k; i++) {
cin >> a >> b >> c;
if(c == 'H'){
v[a][b] = 1;
}else{
v[a][b] = -10;
}
}
ll os = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
bool add = 0;
if(i % 2 == 0){
add = 1;
}
os += v[i][j];
d[i][j].l = v[i][j] + d[i-1][j-1+add].l;
d[i][j].r = v[i][j] + d[i-1][j+add].r;
}
}
// for (ll i = 1; i <= n; i++) {
// for (ll j = 1; j <= m; j++) {
// cout << "(" << d[i][j].l << " ; " << d[i][j].r << ") " ;
// }
// cout << "\n";
// }
ll p = 1e6;
p = scan(p,false);
// cout << p << endl;
// cout << os << endl;
// assert(p >= os);
// cout << "\n\n";
bool fix = (n%2 == 0);
n += fix;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
if(v[i][j] != 0){
v2[n+1-i][j] = v[i][j];
}
}
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
bool add = 0;
if(i % 2 == 0){
add = 1;
}
d[i][j].l = v2[i][j] + d[i-1][j-1+add].l;
d[i][j].r = v2[i][j] + d[i-1][j+add].r;
}
}
// for (ll i = 1; i <= n; i++) {
// for (ll j = 1; j <= m; j++) {
// cout << "(" << d[i][j].l << " ; " << d[i][j].r << ") " ;
// }
// cout << "\n";
// }
p = min(scan(p, fix), p);
// assert((n <= 5 && m <= 5));
cout << os - p;
}