제출 #931352

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
931352		vjudge1	Fruits (NOI22_fruits)	C++17	6 / 100	1064 ms	14420 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) x.begin(), x.end()

const int N = 5e5+5, M = 5e3+3, inf = LLONG_MAX;

int n, a[N], c[N], ans[N];
bitset<N> vis;

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

  cin >> n;
  memset(ans, 0, sizeof(ans));
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] != -1) {
      a[i]--;
      vis[a[i]] = 1;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }

  vector<int> v(n);
  for (int i = 0; i < n; i++) v[i] = i;

  do {
    int x = 0;
    int mx = -1;
    for (int i = 0; i < n; i++) {
      if ((vis[v[i]] || a[i] != -1) && a[i] != v[i]) break;
      if (mx < v[i]) {
        x += c[v[i]];
        mx = v[i];
      }
      ans[i] = max(ans[i], x);
    }
  }
  while (next_permutation(all(v)));

  for (int i = 0; i < n; i++) {
    cout << ans[i] << " "; 
  }
  cout << "\n";
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 13
• Subtask 5: 0 / 23
• Subtask 6: 0 / 42