oj.uz

Submission #954812

# Submission time Handle Problem Language Result Execution time Memory
954812 2024-03-28T15:29:03 Z evenvalue Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 114452 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;
constexpr int kSqrtN = 125;

inline void solution() {
  const int n = Read::Int();
  const int m = Read::Int();
  const int q = Read::Int();

  vector<vector<int>> in(n);
  for (int i = 0; i < m; i++) {
    const int x = Read::Int() - 1;
    const int y = Read::Int() - 1;
    in[y].push_back(x);
  }

  auto calc_dp = [&](const int size, const vector<bool> &busy) {
    vector<vector<pair<int, int>>> dp(n);
    for (int x = 0; x < n; x++) {
      vector<pair<int, int>> best;
      if (not busy[x]) best.emplace_back(-1, x);
      for (const int y : in[x]) {
        best.insert(best.end(), dp[y].begin(), dp[y].end());
      }
      sort(best.rbegin(), best.rend());
      while (best.size() > size) best.pop_back();
      for (auto &[dist, y] : best) dist++;
      dp[x] = best;
    }
    return dp;
  };

  vector<bool> busy(n);
  const auto best_paths = calc_dp(kSqrtN, busy);

  for (int qry = 0; qry < q; qry++) {
    const int x = Read::Int() - 1;
    const vector<int> nerds = Read::Vec<int>(Read::Int());

    for (const int nerd : nerds) {
      busy[nerd - 1] = true;
    }

    if (nerds.size() >= kSqrtN) {
      const auto &dp = calc_dp(1, busy);
      cout << (dp[x].empty() ? -1 : dp[x][0].first) << '\n';
    } else {
      bool found = false;
      for (const auto [dist, y] : best_paths[x]) {
        if (busy[y]) continue;
        found = true;
        cout << dist << '\n';
        break;
      }
      if (not found) cout << -1 << '\n';
    }

    for (const int nerd : nerds) {
      busy[nerd - 1] = false;
    }
  }
}

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();
  }
}

Compilation message

bitaro.cpp: In lambda function:
bitaro.cpp:96:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   96 |       while (best.size() > size) best.pop_back();
      |              ~~~~~~~~~~~~^~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 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 7 ms 1236 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 9 ms 1436 KB Output is correct
9 Correct 8 ms 1372 KB Output is correct
10 Correct 10 ms 1372 KB Output is correct
11 Correct 10 ms 1372 KB Output is correct
12 Correct 8 ms 1356 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 8 ms 980 KB Output is correct
15 Correct 5 ms 856 KB Output is correct
16 Correct 8 ms 1116 KB Output is correct
17 Correct 8 ms 1372 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 8 ms 1368 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 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 7 ms 1236 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 9 ms 1436 KB Output is correct
9 Correct 8 ms 1372 KB Output is correct
10 Correct 10 ms 1372 KB Output is correct
11 Correct 10 ms 1372 KB Output is correct
12 Correct 8 ms 1356 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 8 ms 980 KB Output is correct
15 Correct 5 ms 856 KB Output is correct
16 Correct 8 ms 1116 KB Output is correct
17 Correct 8 ms 1372 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 8 ms 1368 KB Output is correct
20 Correct 559 ms 4416 KB Output is correct
21 Correct 573 ms 4460 KB Output is correct
22 Correct 551 ms 4728 KB Output is correct
23 Correct 579 ms 5384 KB Output is correct
24 Correct 807 ms 93804 KB Output is correct
25 Correct 759 ms 93268 KB Output is correct
26 Correct 793 ms 93340 KB Output is correct
27 Correct 719 ms 114404 KB Output is correct
28 Correct 784 ms 114452 KB Output is correct
29 Correct 818 ms 112648 KB Output is correct
30 Correct 834 ms 114324 KB Output is correct
31 Correct 1180 ms 112564 KB Output is correct
32 Correct 709 ms 112984 KB Output is correct
33 Correct 802 ms 76340 KB Output is correct
34 Correct 737 ms 68284 KB Output is correct
35 Correct 772 ms 76256 KB Output is correct
36 Correct 560 ms 95568 KB Output is correct
37 Correct 916 ms 90656 KB Output is correct
38 Correct 705 ms 95748 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 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 7 ms 1236 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 9 ms 1436 KB Output is correct
9 Correct 8 ms 1372 KB Output is correct
10 Correct 10 ms 1372 KB Output is correct
11 Correct 10 ms 1372 KB Output is correct
12 Correct 8 ms 1356 KB Output is correct
13 Correct 10 ms 1624 KB Output is correct
14 Correct 8 ms 980 KB Output is correct
15 Correct 5 ms 856 KB Output is correct
16 Correct 8 ms 1116 KB Output is correct
17 Correct 8 ms 1372 KB Output is correct
18 Correct 6 ms 1116 KB Output is correct
19 Correct 8 ms 1368 KB Output is correct
20 Correct 559 ms 4416 KB Output is correct
21 Correct 573 ms 4460 KB Output is correct
22 Correct 551 ms 4728 KB Output is correct
23 Correct 579 ms 5384 KB Output is correct
24 Correct 807 ms 93804 KB Output is correct
25 Correct 759 ms 93268 KB Output is correct
26 Correct 793 ms 93340 KB Output is correct
27 Correct 719 ms 114404 KB Output is correct
28 Correct 784 ms 114452 KB Output is correct
29 Correct 818 ms 112648 KB Output is correct
30 Correct 834 ms 114324 KB Output is correct
31 Correct 1180 ms 112564 KB Output is correct
32 Correct 709 ms 112984 KB Output is correct
33 Correct 802 ms 76340 KB Output is correct
34 Correct 737 ms 68284 KB Output is correct
35 Correct 772 ms 76256 KB Output is correct
36 Correct 560 ms 95568 KB Output is correct
37 Correct 916 ms 90656 KB Output is correct
38 Correct 705 ms 95748 KB Output is correct
39 Correct 861 ms 90308 KB Output is correct
40 Correct 779 ms 90484 KB Output is correct
41 Correct 1048 ms 93496 KB Output is correct
42 Execution timed out 2041 ms 93888 KB Time limit exceeded
43 Halted 0 ms 0 KB -