oj.uz

Submission #954825

# Submission time Handle Problem Language Result Execution time Memory
954825 2024-03-28T16:18:08 Z evenvalue Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 343504 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<basic_string<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);
  }

  vector<vector<pair<int, int>>> dp(n);
  auto calc_dp = [&](const int size, vector<bool> &busy, const int till) {
    for (int x = 0; x <= till; 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());
      for (const auto [dist, y] : best) {
        if (busy[y]) continue;
        busy[y] = true;
        dp[x].emplace_back(dist + 1, y);
        if (dp[x].size() == size) break;
      }
      for (const auto [dist, y] : dp[x]) {
        busy[y] = false;
      }
    }
    return dp;
  };
  
  auto clear_dp = [&](const int till) {
    for (int x = 0; x <= till; x++) {
      dp[x].clear();
    }
  };

  vector<bool> busy(n);
  const auto best_paths = calc_dp(kSqrtN, busy, n - 1);
  clear_dp(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) {
      const auto &dp = calc_dp(1, busy, x);
      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:100: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]
  100 |         if (dp[x].size() == size) break;
      |             ~~~~~~~~~~~~~^~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 1116 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 12 ms 3416 KB Output is correct
9 Correct 12 ms 3416 KB Output is correct
10 Correct 12 ms 3420 KB Output is correct
11 Correct 14 ms 3248 KB Output is correct
12 Correct 7 ms 2140 KB Output is correct
13 Correct 13 ms 3216 KB Output is correct
14 Correct 10 ms 2284 KB Output is correct
15 Correct 7 ms 1368 KB Output is correct
16 Correct 10 ms 2136 KB Output is correct
17 Correct 10 ms 2652 KB Output is correct
18 Correct 7 ms 1880 KB Output is correct
19 Correct 11 ms 2536 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 1116 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 12 ms 3416 KB Output is correct
9 Correct 12 ms 3416 KB Output is correct
10 Correct 12 ms 3420 KB Output is correct
11 Correct 14 ms 3248 KB Output is correct
12 Correct 7 ms 2140 KB Output is correct
13 Correct 13 ms 3216 KB Output is correct
14 Correct 10 ms 2284 KB Output is correct
15 Correct 7 ms 1368 KB Output is correct
16 Correct 10 ms 2136 KB Output is correct
17 Correct 10 ms 2652 KB Output is correct
18 Correct 7 ms 1880 KB Output is correct
19 Correct 11 ms 2536 KB Output is correct
20 Correct 1662 ms 5080 KB Output is correct
21 Correct 1608 ms 4724 KB Output is correct
22 Correct 1640 ms 4856 KB Output is correct
23 Correct 1603 ms 6120 KB Output is correct
24 Correct 1177 ms 241492 KB Output is correct
25 Correct 1244 ms 248980 KB Output is correct
26 Correct 1227 ms 249464 KB Output is correct
27 Correct 1250 ms 340172 KB Output is correct
28 Correct 1198 ms 340512 KB Output is correct
29 Correct 1193 ms 340204 KB Output is correct
30 Correct 1366 ms 339812 KB Output is correct
31 Correct 1634 ms 331328 KB Output is correct
32 Correct 1377 ms 340100 KB Output is correct
33 Correct 1031 ms 210360 KB Output is correct
34 Correct 985 ms 183084 KB Output is correct
35 Correct 1047 ms 209232 KB Output is correct
36 Correct 1331 ms 276700 KB Output is correct
37 Correct 1304 ms 256364 KB Output is correct
38 Correct 1308 ms 277536 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 1116 KB Output is correct
6 Correct 4 ms 1116 KB Output is correct
7 Correct 3 ms 1116 KB Output is correct
8 Correct 12 ms 3416 KB Output is correct
9 Correct 12 ms 3416 KB Output is correct
10 Correct 12 ms 3420 KB Output is correct
11 Correct 14 ms 3248 KB Output is correct
12 Correct 7 ms 2140 KB Output is correct
13 Correct 13 ms 3216 KB Output is correct
14 Correct 10 ms 2284 KB Output is correct
15 Correct 7 ms 1368 KB Output is correct
16 Correct 10 ms 2136 KB Output is correct
17 Correct 10 ms 2652 KB Output is correct
18 Correct 7 ms 1880 KB Output is correct
19 Correct 11 ms 2536 KB Output is correct
20 Correct 1662 ms 5080 KB Output is correct
21 Correct 1608 ms 4724 KB Output is correct
22 Correct 1640 ms 4856 KB Output is correct
23 Correct 1603 ms 6120 KB Output is correct
24 Correct 1177 ms 241492 KB Output is correct
25 Correct 1244 ms 248980 KB Output is correct
26 Correct 1227 ms 249464 KB Output is correct
27 Correct 1250 ms 340172 KB Output is correct
28 Correct 1198 ms 340512 KB Output is correct
29 Correct 1193 ms 340204 KB Output is correct
30 Correct 1366 ms 339812 KB Output is correct
31 Correct 1634 ms 331328 KB Output is correct
32 Correct 1377 ms 340100 KB Output is correct
33 Correct 1031 ms 210360 KB Output is correct
34 Correct 985 ms 183084 KB Output is correct
35 Correct 1047 ms 209232 KB Output is correct
36 Correct 1331 ms 276700 KB Output is correct
37 Correct 1304 ms 256364 KB Output is correct
38 Correct 1308 ms 277536 KB Output is correct
39 Correct 1206 ms 241576 KB Output is correct
40 Correct 1221 ms 243916 KB Output is correct
41 Correct 1213 ms 244312 KB Output is correct
42 Execution timed out 2031 ms 343504 KB Time limit exceeded
43 Halted 0 ms 0 KB -