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

Compiler report

input/code.cpp: In function 'll scan(ll, bool)':
input/code.cpp:54:17: error: 'min' was not declared in this scope
   54 |             p = min(s, p);
      |                 ^~~
input/code.cpp:101:13: error: 'min' was not declared in this scope
  101 |         p = min(s, p);
      |             ^~~
input/code.cpp:113:13: error: 'min' was not declared in this scope
  113 |         p = min(s,p);
      |             ^~~
input/code.cpp: In function 'int main()':
input/code.cpp:125:5: error: 'cin' was not declared in this scope
  125 |     cin >> n >> m >> k;
      |     ^~~
input/code.cpp:1:1: note: 'std::cin' is defined in header '<iostream>'; did you forget to '#include <iostream>'?
  +++ |+#include <iostream>
    1 | using namespace std;
input/code.cpp:195:9: error: 'min' was not declared in this scope; did you mean 'main'?
  195 |     p = min(scan(p, fix), p);
      |         ^~~
      |         main
input/code.cpp:198:5: error: 'assert' was not declared in this scope
  198 |     asser...

Code

using namespace std;
typedef long long ll;
struct Hex {
public:
ll l = 0;
ll r = 0;
};
const ll SIZE = 555;
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 - ((l-add)/2 + (l-add)%2)].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 + (l+add)/2].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++;
// if(s == 0){
// cout << "HEI" << endl;
// }
// if(s == 1){
// cout << "I" << endl;
// }
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 && ms < (s - count_r_colum(i, j1, l))){
l++;
s += count_l_colum(i, (j1+l-1), l);
continue;
}
//else
if(ms > (s - count_r_colum(i, j1, l)) && 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 + 1){
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;
}
}
// if(s == 0){
// cout << "MOI" << endl;
// }
// if(s == 1){
// cout << "J" << endl;
// }
p = min(s, p);
}
ll s = 0;
for (int j = 1; j <= m; j++)
{
s = d[1][j].l;
p = min(s,p);
}
return p;
}
int main() {
// freopen("input.txt", "r", stdin);
cin >> n >> m >> k;
ll a, b;
char c;
ll os = 0;
for (ll i = 0; i < k; i++) {
cin >> a >> b >> c;
if(c == 'H'){
v[a][b] = 1;
os += 1;
}else{
v[a][b] = -10;
os -= 10;
}
}
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 = 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 = 1e9;
p = scan(p,false);
// cout << p << endl;
// cout << os << endl;
// assert(p >= os);
// cout << "\n\n";
bool fix = (n%2 == 0);
n = n + fix;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
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));
assert(p != 1e9);
cout << os - p;
}