oj.uz

Submission #931352

# Submission time Handle Problem Language Result Execution time Memory
931352 2024-02-21T15:57:12 Z vjudge1 Fruits (NOI22_fruits) C++17
6 / 100
 1000 ms 14420 KB 
#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.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6608 KB Output is correct
4 Correct 2 ms 6740 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 6492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6608 KB Output is correct
4 Correct 2 ms 6740 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 1064 ms 6492 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6608 KB Output is correct
4 Correct 2 ms 6740 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 1064 ms 6492 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1016 ms 14420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6608 KB Output is correct
4 Correct 2 ms 6740 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Execution timed out 1062 ms 6492 KB Time limit exceeded
12 Halted 0 ms 0 KB -