제출 #1174930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174930		lopkus	Team Contest (JOI22_team)	C++20	0 / 100	0 ms	328 KiB

team

#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

#define int long long

void solve() {
  int N;
  std::cin >> N;
  std::vector<int> xx(N + 1), yy(N + 1), zz(N + 1);
  for(int i = 1; i <= N; i++) {
    std::cin >> xx[i] >> yy[i] >> zz[i];
  }
  int tr = 0;
  std::vector<int> to_pr[10];
  std::vector<int> w = {1, 2, 3};
  auto g = [] (int u, int v) {
    if(u == v) {
      return 1;
    }
    if(u > v) {
      return 2;
    }
    return 0;
  };
  do {
    for(int i = 0; i < 3; i++) {
      to_pr[tr].push_back(w[i]);
    }
    tr += 1;
  } while(next_permutation(w.begin(), w.end()));
  std::vector<int> x(N + 1), y(N + 1), z(N + 1);
  int ans = - 1;
  auto Do = [&] () {
    int dp[N + 1][3][3][3];
    for(int i = 0; i <= N; i++) {
      for(int a = 0; a < 3; a++) {
        for(int b = 0; b < 3; b++) {
          for(int c = 0; c < 3; c++) {
            dp[i][a][b][c] = 0;
          }
        }
      }
    }
    /**
    0 - smaller
    1 - equal
    2 - greater
    **/
    for(int i = 1; i <= N; i++) {
      for(int j = i - 1; j >= 1; j--) {
        if(x[i] > x[j] && y[i] < y[j] && z[i] <= z[j]) {
          ans = std::max(ans, dp[j][0][2][0] + x[i] + y[j]);
          ans = std::max(ans, dp[j][1][2][0] + x[i] + y[j]);
        }
      }
      for(int j = i - 1; j >= 1; j--) {
        dp[i][g(x[i], x[j])][g(y[i], y[j])][g(z[i], z[j])] = std::max(dp[i][g(x[i], x[j])][g(y[i], y[j])][g(z[i], z[j])], z[j]);

      }
    }
  };
  for(int i = 0; i < 6; i++) {
    if(to_pr[i][0] == 1) {
      for(int i = 1; i <= N; i++) {
        x[i] = xx[i];
      }
    }
    if(to_pr[i][0] == 2) {
      for(int i = 1; i <= N; i++) {
        x[i] = yy[i];
      }
    }
    if(to_pr[i][0] == 3) {
      for(int i = 1; i <= N; i++) {
        x[i] = zz[i];
      }
    }

    if(to_pr[i][1] == 1) {
      for(int i = 1; i <= N; i++) {
        y[i] = xx[i];
      }
    }
    if(to_pr[i][1] == 2) {
      for(int i = 1; i <= N; i++) {
        y[i] = yy[i];
      }
    }
    if(to_pr[i][1] == 3) {
      for(int i = 1; i <= N; i++) {
        y[i] = zz[i];
      }
    }

    if(to_pr[i][2] == 1) {
      for(int i = 1; i <= N; i++) {
        z[i] = xx[i];
      }
    }
    if(to_pr[i][2] == 2) {
      for(int i = 1; i <= N; i++) {
        z[i] = yy[i];
      }
    }
    if(to_pr[i][2] == 3) {
      for(int i = 1; i <= N; i++) {
        z[i] = zz[i];
      }
    }
    for(int C = 0; C < 2; C++, reverse(x.begin() + 1, x.end()), reverse(y.begin() + 1, y.end()), reverse(z.begin() + 1, z.end())) {
      Do();
    }
  }
  std::cout << ans;
}


signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27