oj.uz

Submission #965658

# Submission time Handle Problem Language Result Execution time Memory
965658 2024-04-19T04:07:09 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
 
struct Line { 
  long long a, b;
  double x(const auto& rhs) { return 1.0 * (rhs.b - b) / (a - rhs.a); };
};
 
long long take_photos(int n, int m, int k, vector<int> row, vector<int> column) { 
  using pii = pair<int, int>;
  vector<pii> p(n);
 
  for (int i = 0; i < n; ++i) {
    if (row[i] > column[i]) swap(row[i], column[i]);
    p[i] = {row[i], column[i]};
  }
 
  auto dis = [&](pii a) { return abs(a.first - a.second) + 1; };
  
  { //sort_the_points
    sort(p.begin(), p.end(), [&](const auto& a, const auto& b) { 
      return make_pair(a.first, -dis(a)) < make_pair(b.first, -dis(b)); 
    });
    vector<bool> mk(n, true);
    pii point = {-1, -1};
    for (int i = 0; i < n; ++i) { 
      if (point.first <= p[i].first && p[i].second <= point.second) mk[i] = false;
      else point = p[i];
    }
    
    int cnt = 0;
    for (int i = 0; i < n; ++i) { 
      cnt += mk[i];
      if (mk[i]) p.push_back(p[i]);
    }
    p.erase(p.begin(), p.begin() + n);
    
    p.push_back({-1, -1});
    k = min(k, n = cnt);
    vector<vector<long long>> f(k + 1, vector<long long>(n + 1, 1e15));
    sort(p.begin(), p.end(), [&](const auto& a, const auto& b) { return a.first < b.first; });
  }

  auto cal = [&](int l, int r) { 
    long long val = abs(p[l].first - p[r].second) + 1; val *= val;
    long long pre = max(0, p[l - 1].second - p[l].first + 1); pre *= pre;
    return val - pre;
  };

  auto cost = [&](const auto& c) { 
    vector<long long> f(n + 1, 1'000'000'000'000'000), g(n + 1);
    f[0] = 0;
    for (int i = 1; i <= n; ++i) { 
      for (int j = 1; j <= i; ++j) {
        long long val = f[j - 1] + cal(j, i) + c;
        f[i] = min(f[i], val);
        if (f[i] == val && g[j] + 1 < g[i]) g[i] = g[j] + 1;
      }
    }
    return make_pair(f[n], g[n]);
  };

  long long l = 0, r = 1'000'000'000'000'000'000;
  long long answer = 1'000'000'000'000'000'000;
  while (l <= r) { 
    long long mid = l + r >> 1;
    
    auto [val, cnt] = cost(mid);
    if (cnt <= k) {
      r = mid - 1;
      answer = val - cnt * mid;
    } else l = mid + 1;
  }

  return answer;
}
 
#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

Compilation message

aliens.cpp:11:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   11 |   double x(const auto& rhs) { return 1.0 * (rhs.b - b) / (a - rhs.a); };
      |                  ^~~~
aliens.cpp: In function 'long long int take_photos(int, int, int, std::vector<int>, std::vector<int>)':
aliens.cpp:71:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |     long long mid = l + r >> 1;
      |                     ~~^~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 1 ms 344 KB Correct answer: answer = 210
7 Correct 1 ms 600 KB Correct answer: answer = 88
8 Correct 0 ms 348 KB Correct answer: answer = 7696
9 Correct 1 ms 348 KB Correct answer: answer = 1
10 Correct 0 ms 432 KB Correct answer: answer = 2374
11 Correct 1 ms 344 KB Correct answer: answer = 9502
12 Correct 0 ms 348 KB Correct answer: answer = 49
13 Correct 1 ms 348 KB Correct answer: answer = 151
14 Correct 1 ms 348 KB Correct answer: answer = 7550
15 Correct 1 ms 348 KB Correct answer: answer = 7220
16 Correct 1 ms 348 KB Correct answer: answer = 7550
17 Correct 0 ms 348 KB Correct answer: answer = 10000
18 Correct 0 ms 432 KB Correct answer: answer = 10000
19 Correct 0 ms 348 KB Correct answer: answer = 624
20 Correct 1 ms 348 KB Correct answer: answer = 10000

Subtask #2
0 / 12.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 1 ms 344 KB Correct answer: answer = 210
7 Correct 1 ms 600 KB Correct answer: answer = 88
8 Correct 0 ms 348 KB Correct answer: answer = 7696
9 Correct 1 ms 348 KB Correct answer: answer = 1
10 Correct 0 ms 432 KB Correct answer: answer = 2374
11 Correct 1 ms 344 KB Correct answer: answer = 9502
12 Correct 0 ms 348 KB Correct answer: answer = 49
13 Correct 1 ms 348 KB Correct answer: answer = 151
14 Correct 1 ms 348 KB Correct answer: answer = 7550
15 Correct 1 ms 348 KB Correct answer: answer = 7220
16 Correct 1 ms 348 KB Correct answer: answer = 7550
17 Correct 0 ms 348 KB Correct answer: answer = 10000
18 Correct 0 ms 432 KB Correct answer: answer = 10000
19 Correct 0 ms 348 KB Correct answer: answer = 624
20 Correct 1 ms 348 KB Correct answer: answer = 10000
21 Correct 1 ms 348 KB Correct answer: answer = 1
22 Incorrect 1 ms 432 KB Wrong answer: output = 2, expected = 4
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 1 ms 344 KB Correct answer: answer = 210
7 Correct 1 ms 600 KB Correct answer: answer = 88
8 Correct 0 ms 348 KB Correct answer: answer = 7696
9 Correct 1 ms 348 KB Correct answer: answer = 1
10 Correct 0 ms 432 KB Correct answer: answer = 2374
11 Correct 1 ms 344 KB Correct answer: answer = 9502
12 Correct 0 ms 348 KB Correct answer: answer = 49
13 Correct 1 ms 348 KB Correct answer: answer = 151
14 Correct 1 ms 348 KB Correct answer: answer = 7550
15 Correct 1 ms 348 KB Correct answer: answer = 7220
16 Correct 1 ms 348 KB Correct answer: answer = 7550
17 Correct 0 ms 348 KB Correct answer: answer = 10000
18 Correct 0 ms 432 KB Correct answer: answer = 10000
19 Correct 0 ms 348 KB Correct answer: answer = 624
20 Correct 1 ms 348 KB Correct answer: answer = 10000
21 Correct 1 ms 348 KB Correct answer: answer = 1
22 Incorrect 1 ms 432 KB Wrong answer: output = 2, expected = 4
23 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 1 ms 344 KB Correct answer: answer = 210
7 Correct 1 ms 600 KB Correct answer: answer = 88
8 Correct 0 ms 348 KB Correct answer: answer = 7696
9 Correct 1 ms 348 KB Correct answer: answer = 1
10 Correct 0 ms 432 KB Correct answer: answer = 2374
11 Correct 1 ms 344 KB Correct answer: answer = 9502
12 Correct 0 ms 348 KB Correct answer: answer = 49
13 Correct 1 ms 348 KB Correct answer: answer = 151
14 Correct 1 ms 348 KB Correct answer: answer = 7550
15 Correct 1 ms 348 KB Correct answer: answer = 7220
16 Correct 1 ms 348 KB Correct answer: answer = 7550
17 Correct 0 ms 348 KB Correct answer: answer = 10000
18 Correct 0 ms 432 KB Correct answer: answer = 10000
19 Correct 0 ms 348 KB Correct answer: answer = 624
20 Correct 1 ms 348 KB Correct answer: answer = 10000
21 Correct 1 ms 348 KB Correct answer: answer = 1
22 Incorrect 1 ms 432 KB Wrong answer: output = 2, expected = 4
23 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 1 ms 348 KB Correct answer: answer = 4
4 Correct 0 ms 348 KB Correct answer: answer = 12
5 Correct 1 ms 344 KB Correct answer: answer = 52
6 Correct 1 ms 344 KB Correct answer: answer = 210
7 Correct 1 ms 600 KB Correct answer: answer = 88
8 Correct 0 ms 348 KB Correct answer: answer = 7696
9 Correct 1 ms 348 KB Correct answer: answer = 1
10 Correct 0 ms 432 KB Correct answer: answer = 2374
11 Correct 1 ms 344 KB Correct answer: answer = 9502
12 Correct 0 ms 348 KB Correct answer: answer = 49
13 Correct 1 ms 348 KB Correct answer: answer = 151
14 Correct 1 ms 348 KB Correct answer: answer = 7550
15 Correct 1 ms 348 KB Correct answer: answer = 7220
16 Correct 1 ms 348 KB Correct answer: answer = 7550
17 Correct 0 ms 348 KB Correct answer: answer = 10000
18 Correct 0 ms 432 KB Correct answer: answer = 10000
19 Correct 0 ms 348 KB Correct answer: answer = 624
20 Correct 1 ms 348 KB Correct answer: answer = 10000
21 Correct 1 ms 348 KB Correct answer: answer = 1
22 Incorrect 1 ms 432 KB Wrong answer: output = 2, expected = 4
23 Halted 0 ms 0 KB -