## Submission #957160

# Submission time Handle Problem Language Result Execution time Memory
957160 2024-04-03T05:50:20 Z duckindog Aliens (IOI16_aliens) C++17
4 / 100
1 ms 600 KB
```#include <bits/stdc++.h>

using namespace std;

#ifndef LOCAL
#include "aliens.h"
#endif

long long take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
using pii = pair<int, int>;
vector<pii> p(n);
vector<vector<long long>> f(k + 1, vector<long long>(n + 1, 1e15));

for (int i = 0; i < n; ++i) p[i] = {r[i], c[i]};

if (n <= 50 && m <= 100 && k == n) {
vector<vector<bool>> mk(m, vector<bool>(m));
for (int i = 0; i < n; ++i) {
auto [x, y] = p[i];
if (x > y) swap(x, y);
for (int i = x; i <= y; ++i) {
for (int j = x; j <= y; ++j) mk[i][j] = true;
}
}

for (int i = 0; i < m; ++i)
for (int j = 0; j < m; ++j) answer += mk[i][j];
}

auto dis = [&](pii a) { return abs(a.first - a.second) + 1; };

sort(p.begin(), p.end(), [&](const auto& a, const auto& b) {
return make_pair(a.first, dis(a)) < make_pair(b.first, dis(b));
});

return 0;
}

#ifdef LOCAL
int32_t main() {
cin.tie(0)->sync_with_stdio(0);

int n, m, k; cin >> n >> m >> k;
vector<int> r(n), c(n);
for (int i = 0; i < n; ++i) cin >> r[i] >> c[i];

cout << take_photos(n, m, k, r, c) << "\n";
}
#endif
```

#### Subtask #1 4.0 / 4.0

# Verdict Execution time Memory Grader output

#### Subtask #2 0 / 12.0

# Verdict Execution time Memory Grader output
2 Incorrect 0 ms 348 KB Wrong answer: output = 0, expected = 4
3 Halted 0 ms 0 KB -

#### Subtask #3 0 / 9.0

# Verdict Execution time Memory Grader output
22 Incorrect 0 ms 348 KB Wrong answer: output = 0, expected = 4
23 Halted 0 ms 0 KB -

#### Subtask #4 0 / 16.0

# Verdict Execution time Memory Grader output
22 Incorrect 0 ms 348 KB Wrong answer: output = 0, expected = 4
23 Halted 0 ms 0 KB -

#### Subtask #5 0 / 19.0

# Verdict Execution time Memory Grader output
22 Incorrect 0 ms 348 KB Wrong answer: output = 0, expected = 4
23 Halted 0 ms 0 KB -

#### Subtask #6 0 / 40.0

# Verdict Execution time Memory Grader output