oj.uz

Submission #502500

# Submission time Handle Problem Language Result Execution time Memory
502500 2022-01-06T06:55:07 Z cs142857 Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 708 ms 267792 KB 
// JOI 2018, Bitaro’s Party

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

#ifdef DBG
  #define dbg 1
  #define dpf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
  #define Dps(...) Dbgs(__VA_ARGS__)
#else
  #define dbg 0
  #define dpf(...) 42
  #define Dps(...) 42
#endif
 
#define SIZE(c) int((c).size())
#define FOR(i,l,r) for(int i = (l); i < (r); ++i)
#define REP(i,c) for(auto &i : (c))
#define ALL(c) (c).begin(),(c).end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
typedef long long i64;
typedef unsigned long long u64;
const double EPS = 1e-12;
const int INF = 1e9 + 10;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PI;

template <typename T> inline bool UpdateMax(T& x, T v) {
  if(v > x) {x=v; return 1;} else return 0;
}
template <typename T> inline bool UpdateMin(T& x, T v) {
  if(v < x) {x=v; return 1;} else return 0;
}

template <typename T>
using MinPQ = priority_queue<T, vector<T>, greater<T>>;

inline namespace output {
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& v) {
  return os << "{" << v.first << " " << v.second << "}";
}

template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  os << "{";
  bool first = 1;
  REP(x, v) {
    if(first) first=0; else os << " ";
    os << x;
  }
  return os << "}";
}
}  // namespace output

inline namespace output {  // Only for debug now.
template <class T>
void PrSep(std::ostream& os, string, const T& t) { os << t; }
template <class T, class... U>
void PrSep(std::ostream& os, string sep, const T& t, const U&... u) {
  PrSep(os, sep, t); os << sep; PrSep(os, sep, u...);
}

// Print w/ spaces, end with newline
void Ps() { cout << "\n"; }
template<class ...T> void Ps(const T&... t) { PrSep(cout," ",t...); Ps(); } 
template<class ...T> void Dbgs(const T&... t) { PrSep(cerr," ",t...); cerr << endl; } 
}  // namespace output

const int S = 320;

int n;
vector<VI> g, rg;

vector<vector<PI>> max_dis_u;

void Com() {
  int counter = 0;
  VI u_counter(n, 0);
  vector<PI> tmp;

  auto Merge = [&](const vector<PI>& prev, vector<PI>& target) {
    ++counter;
    auto p1 = prev.begin();
    auto p2 = target.begin();
    tmp.clear();
    tmp.reserve(S);
    while (SIZE(tmp) < S) {
      if (p1 == prev.end() && p2 == target.end()) break;
      int u, w;
      if (p2 == target.end() || (p1 != prev.end() && p1->fi + 1 > p2->fi)) {
        u = p1->se, w = p1->fi + 1;
        ++p1;
      } else {
        u = p2->se, w = p2->fi;
        ++p2;
      }
      if (u_counter[u] != counter) {
        u_counter[u] = counter;
        tmp.eb(w, u);
      }
    }
    target.swap(tmp);
  };

  max_dis_u.resize(n);
  FOR(i, 0, n) {
    max_dis_u[i] = {{0, i}};
    REP(prev, rg[i]) {
      Merge(max_dis_u[prev], max_dis_u[i]);
    }
    Dps("node", i);
    Dps(max_dis_u[i]);
  }
}

void Solve() {
  int m, nq;
  scanf("%d%d%d",&n,&m,&nq);
  g.assign(n, {});
  rg.assign(n, {});
  while(m--) {
    int u,v;
    scanf("%d%d",&u,&v);
    --u,--v;
    g[u].pb(v);
    rg[v].pb(u);
  }

  Com();

  VI mark(n, -1), mark2(n, -1);
  VI f(n);
  while (nq--) {
    int t, y;
    scanf("%d%d",&t,&y);
    --t;
    FOR(i, 0, y) {
      int x;
      scanf("%d", &x);
      --x;
      mark[x] = nq;
    }
    if(y < S) {
      int ans = -1;
      REP(p, max_dis_u[t]) if(mark[p.se]!=nq) {
        ans = p.fi;
        break;
      }
      printf("%d\n",ans);
    } else {
      int ans = -1;
      f[t] = 0, mark2[t] = nq;
      if (mark[t] != nq) UpdateMax(ans, f[t]);
      for (int i = t - 1; i >= 0; --i) {
        f[i] = -1, mark2[i] = nq;
        REP(v, g[i]) if(mark2[v]==nq && f[v]!=-1) {
          UpdateMax(f[i], f[v] + 1);
        }
        if (mark[i] != nq) UpdateMax(ans, f[i]);
      }
      printf("%d\n", ans);
    }
  }
}

int main() {
  int t = 1;
  // scanf("%d", &t);
  for (int i = 1; i <= t; ++i) {
    // printf("Case #%d: ", i);
    Solve();
  }

  return 0;
}

Compilation message

bitaro.cpp: In function 'void Com()':
bitaro.cpp:37:20: warning: statement has no effect [-Wunused-value]
   37 |   #define Dps(...) 42
      |                    ^~
bitaro.cpp:140:5: note: in expansion of macro 'Dps'
  140 |     Dps("node", i);
      |     ^~~
bitaro.cpp:37:20: warning: statement has no effect [-Wunused-value]
   37 |   #define Dps(...) 42
      |                    ^~
bitaro.cpp:141:5: note: in expansion of macro 'Dps'
  141 |     Dps(max_dis_u[i]);
      |     ^~~
bitaro.cpp: In function 'void Solve()':
bitaro.cpp:147:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  147 |   scanf("%d%d%d",&n,&m,&nq);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~
bitaro.cpp:152:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  152 |     scanf("%d%d",&u,&v);
      |     ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:164:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  164 |     scanf("%d%d",&t,&y);
      |     ~~~~~^~~~~~~~~~~~~~
bitaro.cpp:168:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  168 |       scanf("%d", &x);
      |       ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 2508 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 2 ms 2508 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 4 ms 2892 KB Output is correct
10 Correct 4 ms 2892 KB Output is correct
11 Correct 4 ms 2944 KB Output is correct
12 Correct 3 ms 2892 KB Output is correct
13 Correct 5 ms 2892 KB Output is correct
14 Correct 5 ms 2380 KB Output is correct
15 Correct 3 ms 2380 KB Output is correct
16 Correct 4 ms 2508 KB Output is correct
17 Correct 3 ms 2636 KB Output is correct
18 Correct 3 ms 2508 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 2508 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 2 ms 2508 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 4 ms 2892 KB Output is correct
10 Correct 4 ms 2892 KB Output is correct
11 Correct 4 ms 2944 KB Output is correct
12 Correct 3 ms 2892 KB Output is correct
13 Correct 5 ms 2892 KB Output is correct
14 Correct 5 ms 2380 KB Output is correct
15 Correct 3 ms 2380 KB Output is correct
16 Correct 4 ms 2508 KB Output is correct
17 Correct 3 ms 2636 KB Output is correct
18 Correct 3 ms 2508 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 348 ms 5396 KB Output is correct
21 Correct 314 ms 5520 KB Output is correct
22 Correct 330 ms 5408 KB Output is correct
23 Correct 352 ms 5392 KB Output is correct
24 Correct 428 ms 232128 KB Output is correct
25 Correct 455 ms 232004 KB Output is correct
26 Correct 437 ms 231904 KB Output is correct
27 Correct 450 ms 267176 KB Output is correct
28 Correct 442 ms 267092 KB Output is correct
29 Correct 434 ms 267304 KB Output is correct
30 Correct 427 ms 266484 KB Output is correct
31 Correct 458 ms 266532 KB Output is correct
32 Correct 430 ms 266452 KB Output is correct
33 Correct 382 ms 222532 KB Output is correct
34 Correct 356 ms 219800 KB Output is correct
35 Correct 368 ms 222780 KB Output is correct
36 Correct 397 ms 234684 KB Output is correct
37 Correct 410 ms 232380 KB Output is correct
38 Correct 414 ms 234760 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 2508 KB Output is correct
6 Correct 3 ms 2508 KB Output is correct
7 Correct 2 ms 2508 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 4 ms 2892 KB Output is correct
10 Correct 4 ms 2892 KB Output is correct
11 Correct 4 ms 2944 KB Output is correct
12 Correct 3 ms 2892 KB Output is correct
13 Correct 5 ms 2892 KB Output is correct
14 Correct 5 ms 2380 KB Output is correct
15 Correct 3 ms 2380 KB Output is correct
16 Correct 4 ms 2508 KB Output is correct
17 Correct 3 ms 2636 KB Output is correct
18 Correct 3 ms 2508 KB Output is correct
19 Correct 3 ms 2636 KB Output is correct
20 Correct 348 ms 5396 KB Output is correct
21 Correct 314 ms 5520 KB Output is correct
22 Correct 330 ms 5408 KB Output is correct
23 Correct 352 ms 5392 KB Output is correct
24 Correct 428 ms 232128 KB Output is correct
25 Correct 455 ms 232004 KB Output is correct
26 Correct 437 ms 231904 KB Output is correct
27 Correct 450 ms 267176 KB Output is correct
28 Correct 442 ms 267092 KB Output is correct
29 Correct 434 ms 267304 KB Output is correct
30 Correct 427 ms 266484 KB Output is correct
31 Correct 458 ms 266532 KB Output is correct
32 Correct 430 ms 266452 KB Output is correct
33 Correct 382 ms 222532 KB Output is correct
34 Correct 356 ms 219800 KB Output is correct
35 Correct 368 ms 222780 KB Output is correct
36 Correct 397 ms 234684 KB Output is correct
37 Correct 410 ms 232380 KB Output is correct
38 Correct 414 ms 234760 KB Output is correct
39 Correct 480 ms 232236 KB Output is correct
40 Correct 479 ms 232420 KB Output is correct
41 Correct 445 ms 231612 KB Output is correct
42 Correct 608 ms 232176 KB Output is correct
43 Correct 473 ms 231808 KB Output is correct
44 Correct 369 ms 5736 KB Output is correct
45 Correct 354 ms 5400 KB Output is correct
46 Correct 343 ms 5420 KB Output is correct
47 Correct 385 ms 5292 KB Output is correct
48 Correct 343 ms 5492 KB Output is correct
49 Correct 481 ms 267728 KB Output is correct
50 Correct 435 ms 267292 KB Output is correct
51 Correct 342 ms 5680 KB Output is correct
52 Correct 320 ms 5392 KB Output is correct
53 Correct 446 ms 234752 KB Output is correct
54 Correct 453 ms 233368 KB Output is correct
55 Correct 410 ms 234044 KB Output is correct
56 Correct 403 ms 232936 KB Output is correct
57 Correct 361 ms 5800 KB Output is correct
58 Correct 381 ms 5796 KB Output is correct
59 Correct 333 ms 5316 KB Output is correct
60 Correct 354 ms 5492 KB Output is correct
61 Correct 544 ms 267196 KB Output is correct
62 Correct 547 ms 234644 KB Output is correct
63 Correct 530 ms 232544 KB Output is correct
64 Correct 708 ms 267196 KB Output is correct
65 Correct 669 ms 234396 KB Output is correct
66 Correct 674 ms 232748 KB Output is correct
67 Correct 439 ms 267324 KB Output is correct
68 Correct 401 ms 234516 KB Output is correct
69 Correct 404 ms 232436 KB Output is correct
70 Correct 447 ms 267104 KB Output is correct
71 Correct 424 ms 234804 KB Output is correct
72 Correct 414 ms 232448 KB Output is correct
73 Correct 477 ms 267276 KB Output is correct
74 Correct 440 ms 234668 KB Output is correct
75 Correct 469 ms 232720 KB Output is correct
76 Correct 505 ms 267792 KB Output is correct
77 Correct 434 ms 267100 KB Output is correct
78 Correct 448 ms 267196 KB Output is correct
79 Correct 342 ms 5716 KB Output is correct
80 Correct 316 ms 5340 KB Output is correct
81 Correct 315 ms 5316 KB Output is correct
82 Correct 477 ms 266924 KB Output is correct
83 Correct 480 ms 266784 KB Output is correct
84 Correct 436 ms 266428 KB Output is correct
85 Correct 434 ms 266392 KB Output is correct
86 Correct 453 ms 266384 KB Output is correct
87 Correct 458 ms 266448 KB Output is correct
88 Correct 371 ms 5884 KB Output is correct
89 Correct 379 ms 5720 KB Output is correct
90 Correct 356 ms 5340 KB Output is correct
91 Correct 352 ms 5316 KB Output is correct
92 Correct 352 ms 5400 KB Output is correct
93 Correct 346 ms 5444 KB Output is correct
94 Correct 426 ms 223820 KB Output is correct
95 Correct 402 ms 220084 KB Output is correct
96 Correct 372 ms 223252 KB Output is correct
97 Correct 385 ms 219968 KB Output is correct
98 Correct 381 ms 222916 KB Output is correct
99 Correct 369 ms 219964 KB Output is correct
100 Correct 393 ms 5724 KB Output is correct
101 Correct 369 ms 5744 KB Output is correct
102 Correct 361 ms 5316 KB Output is correct
103 Correct 364 ms 5384 KB Output is correct
104 Correct 349 ms 5360 KB Output is correct
105 Correct 373 ms 5380 KB Output is correct
106 Correct 446 ms 234768 KB Output is correct
107 Correct 447 ms 233132 KB Output is correct
108 Correct 403 ms 234708 KB Output is correct
109 Correct 395 ms 232548 KB Output is correct
110 Correct 422 ms 234768 KB Output is correct
111 Correct 418 ms 232540 KB Output is correct
112 Correct 360 ms 5840 KB Output is correct
113 Correct 374 ms 5700 KB Output is correct
114 Correct 327 ms 5332 KB Output is correct
115 Correct 347 ms 5316 KB Output is correct
116 Correct 326 ms 5316 KB Output is correct
117 Correct 341 ms 5316 KB Output is correct
118 Correct 436 ms 267232 KB Output is correct
119 Correct 418 ms 234856 KB Output is correct
120 Correct 396 ms 232340 KB Output is correct
121 Correct 438 ms 267208 KB Output is correct
122 Correct 405 ms 234428 KB Output is correct
123 Correct 426 ms 232752 KB Output is correct
124 Correct 432 ms 267148 KB Output is correct
125 Correct 399 ms 235248 KB Output is correct
126 Correct 394 ms 232584 KB Output is correct