oj.uz

Submission #945915

# Submission time Handle Problem Language Result Execution time Memory
945915 2024-03-14T08:42:18 Z evenvalue Just Long Neckties (JOI20_ho_t1) C++17
9 / 100
 1000 ms 6252 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef evenvalue
  #include "debug.h"
#else
  #define debug(...)
#endif

using int64 = long long;
using ld = long double;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

namespace Read {
int Int() {
  int x;
  cin >> x;
  return x;
}
int64 Int64() {
  int64 x;
  cin >> x;
  return x;
}
char Char() {
  char c;
  cin >> c;
  return c;
}
string String() {
  string s;
  cin >> s;
  return s;
}
double Double() {
  return stod(String());
}
ld LongDouble() {
  return stold(String());
}
template<typename T1, typename T2>
pair<T1, T2> Pair() {
  pair<T1, T2> p;
  cin >> p.first >> p.second;
  return p;
}
template<typename T>
vector<T> Vec(const int n) {
  vector<T> v(n);
  for (T &x : v) {
    cin >> x;
  }
  return v;
}
template<typename T>
vector<vector<T>> VecVec(const int n, const int m) {
  vector<vector<T>> v(n);
  for (vector<T> &vec : v) {
    vec = Vec<T>(m);
  }
  return v;
}
}//namespace Read

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kMaxN = 2e5 + 10;

inline void solution() {
  const int n = Read::Int();
  auto a = Read::Vec<int>(n + 1);
  auto b = Read::Vec<int>(n);
  sort(b.begin(), b.end());

  auto check = [&](const int rem) {
    vector<int> c(n);
    for (int i = 0; i <= n; i++) {
      if (i == rem) continue;
      c[i - (i > rem)] = a[i];
    }
    sort(c.begin(), c.end());
    int ans = 0;
    for (int i = 0; i < n; i++) {
      ans = max(ans, c[i] - b[i]);
    }
    return ans;
  };

  for (int i = 0; i <= n; i++) {
    cout << check(i) << ' ';
  }
  cout << '\n';
}

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

  //freopen(".in", "r", stdin);
  //freopen(".out", "w", stdout);

  cout << fixed << setprecision(10);

  int testcases = 1;
  //cin >> testcases;
  while (testcases--) {
    solution();
  }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 20 ms 484 KB Output is correct
15 Correct 74 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 127 ms 744 KB Output is correct
18 Correct 87 ms 344 KB Output is correct
19 Correct 89 ms 504 KB Output is correct
20 Correct 87 ms 344 KB Output is correct
21 Correct 90 ms 348 KB Output is correct
22 Correct 92 ms 348 KB Output is correct
23 Correct 86 ms 488 KB Output is correct
24 Correct 94 ms 492 KB Output is correct
25 Correct 139 ms 520 KB Output is correct
26 Correct 128 ms 488 KB Output is correct
27 Correct 119 ms 492 KB Output is correct
28 Correct 131 ms 348 KB Output is correct
29 Correct 100 ms 484 KB Output is correct
30 Correct 119 ms 484 KB Output is correct
31 Correct 138 ms 736 KB Output is correct
32 Correct 162 ms 500 KB Output is correct

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 20 ms 484 KB Output is correct
15 Correct 74 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 127 ms 744 KB Output is correct
18 Correct 87 ms 344 KB Output is correct
19 Correct 89 ms 504 KB Output is correct
20 Correct 87 ms 344 KB Output is correct
21 Correct 90 ms 348 KB Output is correct
22 Correct 92 ms 348 KB Output is correct
23 Correct 86 ms 488 KB Output is correct
24 Correct 94 ms 492 KB Output is correct
25 Correct 139 ms 520 KB Output is correct
26 Correct 128 ms 488 KB Output is correct
27 Correct 119 ms 492 KB Output is correct
28 Correct 131 ms 348 KB Output is correct
29 Correct 100 ms 484 KB Output is correct
30 Correct 119 ms 484 KB Output is correct
31 Correct 138 ms 736 KB Output is correct
32 Correct 162 ms 500 KB Output is correct
33 Execution timed out 1058 ms 6252 KB Time limit exceeded
34 Halted 0 ms 0 KB -