oj.uz

Submission #954809

# Submission time Handle Problem Language Result Execution time Memory
954809 2024-03-28T15:24:04 Z evenvalue Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1829 ms 135592 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 = 150;

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, const int till) {
    vector<vector<pair<int, int>>> dp(n);
    for (int x = 0; x <= till; x++) {
      vector<pair<int, int>> best;
      best.emplace_back(-kInf, x);
      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, n - 1);

  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) {
      cout << max(calc_dp(1, busy, x)[x][0].first, -1) << '\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:97: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]
   97 |       while (best.size() > size) best.pop_back();
      |              ~~~~~~~~~~~~^~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 9 ms 1372 KB Output is correct
6 Correct 8 ms 1392 KB Output is correct
7 Correct 9 ms 1372 KB Output is correct
8 Correct 14 ms 1928 KB Output is correct
9 Correct 10 ms 1628 KB Output is correct
10 Correct 13 ms 1628 KB Output is correct
11 Correct 12 ms 1628 KB Output is correct
12 Correct 13 ms 1568 KB Output is correct
13 Correct 13 ms 1628 KB Output is correct
14 Correct 9 ms 1116 KB Output is correct
15 Correct 6 ms 1116 KB Output is correct
16 Correct 9 ms 1140 KB Output is correct
17 Correct 9 ms 1372 KB Output is correct
18 Correct 8 ms 1372 KB Output is correct
19 Correct 9 ms 1372 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 9 ms 1372 KB Output is correct
6 Correct 8 ms 1392 KB Output is correct
7 Correct 9 ms 1372 KB Output is correct
8 Correct 14 ms 1928 KB Output is correct
9 Correct 10 ms 1628 KB Output is correct
10 Correct 13 ms 1628 KB Output is correct
11 Correct 12 ms 1628 KB Output is correct
12 Correct 13 ms 1568 KB Output is correct
13 Correct 13 ms 1628 KB Output is correct
14 Correct 9 ms 1116 KB Output is correct
15 Correct 6 ms 1116 KB Output is correct
16 Correct 9 ms 1140 KB Output is correct
17 Correct 9 ms 1372 KB Output is correct
18 Correct 8 ms 1372 KB Output is correct
19 Correct 9 ms 1372 KB Output is correct
20 Correct 617 ms 3808 KB Output is correct
21 Correct 622 ms 4092 KB Output is correct
22 Correct 606 ms 4152 KB Output is correct
23 Correct 629 ms 5496 KB Output is correct
24 Correct 896 ms 107836 KB Output is correct
25 Correct 866 ms 109904 KB Output is correct
26 Correct 934 ms 109928 KB Output is correct
27 Correct 825 ms 134996 KB Output is correct
28 Correct 957 ms 134876 KB Output is correct
29 Correct 984 ms 135592 KB Output is correct
30 Correct 921 ms 133248 KB Output is correct
31 Correct 1372 ms 133504 KB Output is correct
32 Correct 772 ms 133784 KB Output is correct
33 Correct 929 ms 88832 KB Output is correct
34 Correct 902 ms 83756 KB Output is correct
35 Correct 902 ms 89560 KB Output is correct
36 Correct 602 ms 113232 KB Output is correct
37 Correct 1095 ms 106792 KB Output is correct
38 Correct 770 ms 111816 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 9 ms 1372 KB Output is correct
6 Correct 8 ms 1392 KB Output is correct
7 Correct 9 ms 1372 KB Output is correct
8 Correct 14 ms 1928 KB Output is correct
9 Correct 10 ms 1628 KB Output is correct
10 Correct 13 ms 1628 KB Output is correct
11 Correct 12 ms 1628 KB Output is correct
12 Correct 13 ms 1568 KB Output is correct
13 Correct 13 ms 1628 KB Output is correct
14 Correct 9 ms 1116 KB Output is correct
15 Correct 6 ms 1116 KB Output is correct
16 Correct 9 ms 1140 KB Output is correct
17 Correct 9 ms 1372 KB Output is correct
18 Correct 8 ms 1372 KB Output is correct
19 Correct 9 ms 1372 KB Output is correct
20 Correct 617 ms 3808 KB Output is correct
21 Correct 622 ms 4092 KB Output is correct
22 Correct 606 ms 4152 KB Output is correct
23 Correct 629 ms 5496 KB Output is correct
24 Correct 896 ms 107836 KB Output is correct
25 Correct 866 ms 109904 KB Output is correct
26 Correct 934 ms 109928 KB Output is correct
27 Correct 825 ms 134996 KB Output is correct
28 Correct 957 ms 134876 KB Output is correct
29 Correct 984 ms 135592 KB Output is correct
30 Correct 921 ms 133248 KB Output is correct
31 Correct 1372 ms 133504 KB Output is correct
32 Correct 772 ms 133784 KB Output is correct
33 Correct 929 ms 88832 KB Output is correct
34 Correct 902 ms 83756 KB Output is correct
35 Correct 902 ms 89560 KB Output is correct
36 Correct 602 ms 113232 KB Output is correct
37 Correct 1095 ms 106792 KB Output is correct
38 Correct 770 ms 111816 KB Output is correct
39 Correct 987 ms 107148 KB Output is correct
40 Correct 914 ms 105884 KB Output is correct
41 Correct 1004 ms 105832 KB Output is correct
42 Correct 1829 ms 112100 KB Output is correct
43 Correct 1032 ms 110880 KB Output is correct
44 Incorrect 632 ms 6448 KB Output isn't correct
45 Halted 0 ms 0 KB -