Submission #1078583

#	Time	Username	Problem	Language	Result	Execution time	Memory
1078583		avighna	Arcade (NOI20_arcade)	C++17	65 / 100	1035 ms	5716 KiB

Arcade

#include <bits/stdc++.h>

typedef long long ll;

struct Point {
  ll x, y;

  void transform() {
    ll u = y + x, v = y - x;
    x = u, y = v;
  }
};

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  ll n, m;
  std::cin >> n >> m;
  std::vector<Point> pts(m + 1);
  std::vector<ll> t(m + 1), a(m + 1);
  for (ll i = 1; i <= m; ++i) {
    std::cin >> t[i];
    pts[i].x = t[i];
  }
  for (ll i = 1; i <= m; ++i) {
    std::cin >> a[i];
    pts[i].y = a[i];
  }
  for (auto &i : pts) {
    i.transform();
  }

  std::sort(pts.begin(), pts.end(), [](Point a, Point b) {
    if (a.x != b.x) {
      return a.x < b.x;
    }
    return a.y > b.y;
  });

  std::vector<ll> dp(m + 1, 1);
  for (ll i = m; i >= 1; --i) {
    for (ll j = i + 1; j <= m; ++j) {
      if (pts[j].y > pts[i].y) {
        dp[i] = std::max(dp[i], dp[j] + 1);
      }
    }
  }
  std::cout << *std::max_element(dp.begin(), dp.end()) << '\n';
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 14 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15