oj.uz

Submission #583075

# Submission time Handle Problem Language Result Execution time Memory
583075 2022-06-24T18:29:48 Z AlexLuchianov Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 616 ms 183316 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using ll = long long;

int const nmax = 100000;
int const threshold = 220;
std::vector<int> g[5 + nmax];

int cap[5 + nmax];
std::pair<int, int> dp[5 + nmax][5 + threshold];
std::pair<int,int> aux[5 + threshold * 2];

namespace lowmap{
  int frec[5 + nmax];
  int timestamp = 1;
  void reset() {
    ++timestamp;
  }
  bool find(int val) {
    return frec[val] == timestamp;
  }
  void insert(int val) {
    frec[val] = timestamp;
  }
};

int dpBrut[5 + nmax];

int brute(int target) {
  for(int i = 1;i <= target; i++) {
    if(lowmap::find(i) == 0)
      dpBrut[i] = 1;
    else
      dpBrut[i] = 0;
    for(int h = 0; h < g[i].size(); h++) {
      int to = g[i][h];
      if(0 < dpBrut[to])
        dpBrut[i] = std::max(dpBrut[i], dpBrut[to] + 1);
    }
  }
  return dpBrut[target] - 1;
}

int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);

  int n, m, q;
  std::cin >> n >> m >> q;
  for(int i = 1;i <= m; i++) {
    int x, y;
    std::cin >> x >> y;
    g[y].push_back(x);
  }
  for(int i = 1;i <= n; i++) {
    cap[i] = 1;
    dp[i][1] = {0, i};
    for(int h = 0; h < g[i].size(); h++) {
      int to = g[i][h];
      std::merge(dp[i] + 1, dp[i] + cap[i] + 1, 
                 dp[to] + 1, dp[to] + cap[to] + 1,
                 aux + 1, std::greater<std::pair<int,int>>() );
      lowmap::reset();
      int lim = cap[i] + cap[to];
      cap[i] = 0;
      for(int j = 1;j <= lim && cap[i] < threshold; j++) {
        if(lowmap::find(aux[j].second) == 0) {
          lowmap::insert(aux[j].second);
          dp[i][++cap[i]] = aux[j];
        }
      }
    }
    for(int j = 1;j <= cap[i]; j++)
      dp[i][j].first++;
  }

  for(int i = 1;i <= q; i++) {
    int x, k;
    std::cin >> x >> k;
    lowmap::reset();
    for(int j = 1;j <= k; j++) {
      int val;
      std::cin >> val;
      lowmap::insert(val);
    }
    if(k < threshold) {
      bool solved = false;
      for(int j = 1; j <= cap[x]; j++)
        if(lowmap::find(dp[x][j].second) == 0) {
          std::cout << dp[x][j].first -1 << '\n';
          solved = true;
          break;
        }
      if(solved == false)
        std::cout << -1 << '\n'; 
    } else {
      std::cout << brute(x) << '\n';
    }
  }
  return 0;
}

Compilation message

bitaro.cpp: In function 'int brute(int)':
bitaro.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int h = 0; h < g[i].size(); h++) {
      |                    ~~^~~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:60:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(int h = 0; h < g[i].size(); h++) {
      |                    ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 4 ms 4436 KB Output is correct
7 Correct 4 ms 4436 KB Output is correct
8 Correct 5 ms 4436 KB Output is correct
9 Correct 5 ms 4436 KB Output is correct
10 Correct 5 ms 4452 KB Output is correct
11 Correct 6 ms 4436 KB Output is correct
12 Correct 5 ms 4436 KB Output is correct
13 Correct 7 ms 4436 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 5 ms 4436 KB Output is correct
16 Correct 6 ms 4436 KB Output is correct
17 Correct 4 ms 4436 KB Output is correct
18 Correct 4 ms 4436 KB Output is correct
19 Correct 4 ms 4436 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 4 ms 4436 KB Output is correct
7 Correct 4 ms 4436 KB Output is correct
8 Correct 5 ms 4436 KB Output is correct
9 Correct 5 ms 4436 KB Output is correct
10 Correct 5 ms 4452 KB Output is correct
11 Correct 6 ms 4436 KB Output is correct
12 Correct 5 ms 4436 KB Output is correct
13 Correct 7 ms 4436 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 5 ms 4436 KB Output is correct
16 Correct 6 ms 4436 KB Output is correct
17 Correct 4 ms 4436 KB Output is correct
18 Correct 4 ms 4436 KB Output is correct
19 Correct 4 ms 4436 KB Output is correct
20 Correct 308 ms 5668 KB Output is correct
21 Correct 263 ms 5644 KB Output is correct
22 Correct 301 ms 5768 KB Output is correct
23 Correct 336 ms 5656 KB Output is correct
24 Correct 434 ms 182608 KB Output is correct
25 Correct 466 ms 182512 KB Output is correct
26 Correct 481 ms 182484 KB Output is correct
27 Correct 387 ms 182988 KB Output is correct
28 Correct 378 ms 182900 KB Output is correct
29 Correct 380 ms 182864 KB Output is correct
30 Correct 394 ms 182852 KB Output is correct
31 Correct 433 ms 182940 KB Output is correct
32 Correct 407 ms 182592 KB Output is correct
33 Correct 321 ms 182388 KB Output is correct
34 Correct 348 ms 182696 KB Output is correct
35 Correct 308 ms 182572 KB Output is correct
36 Correct 364 ms 182628 KB Output is correct
37 Correct 365 ms 182348 KB Output is correct
38 Correct 365 ms 182452 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 4 ms 4436 KB Output is correct
7 Correct 4 ms 4436 KB Output is correct
8 Correct 5 ms 4436 KB Output is correct
9 Correct 5 ms 4436 KB Output is correct
10 Correct 5 ms 4452 KB Output is correct
11 Correct 6 ms 4436 KB Output is correct
12 Correct 5 ms 4436 KB Output is correct
13 Correct 7 ms 4436 KB Output is correct
14 Correct 5 ms 4436 KB Output is correct
15 Correct 5 ms 4436 KB Output is correct
16 Correct 6 ms 4436 KB Output is correct
17 Correct 4 ms 4436 KB Output is correct
18 Correct 4 ms 4436 KB Output is correct
19 Correct 4 ms 4436 KB Output is correct
20 Correct 308 ms 5668 KB Output is correct
21 Correct 263 ms 5644 KB Output is correct
22 Correct 301 ms 5768 KB Output is correct
23 Correct 336 ms 5656 KB Output is correct
24 Correct 434 ms 182608 KB Output is correct
25 Correct 466 ms 182512 KB Output is correct
26 Correct 481 ms 182484 KB Output is correct
27 Correct 387 ms 182988 KB Output is correct
28 Correct 378 ms 182900 KB Output is correct
29 Correct 380 ms 182864 KB Output is correct
30 Correct 394 ms 182852 KB Output is correct
31 Correct 433 ms 182940 KB Output is correct
32 Correct 407 ms 182592 KB Output is correct
33 Correct 321 ms 182388 KB Output is correct
34 Correct 348 ms 182696 KB Output is correct
35 Correct 308 ms 182572 KB Output is correct
36 Correct 364 ms 182628 KB Output is correct
37 Correct 365 ms 182348 KB Output is correct
38 Correct 365 ms 182452 KB Output is correct
39 Correct 466 ms 182540 KB Output is correct
40 Correct 465 ms 182372 KB Output is correct
41 Correct 483 ms 182292 KB Output is correct
42 Correct 540 ms 182752 KB Output is correct
43 Correct 529 ms 182604 KB Output is correct
44 Correct 367 ms 6028 KB Output is correct
45 Correct 332 ms 5768 KB Output is correct
46 Correct 329 ms 5700 KB Output is correct
47 Correct 358 ms 5728 KB Output is correct
48 Correct 310 ms 5612 KB Output is correct
49 Correct 425 ms 182868 KB Output is correct
50 Correct 442 ms 182348 KB Output is correct
51 Correct 278 ms 5964 KB Output is correct
52 Correct 270 ms 5632 KB Output is correct
53 Correct 426 ms 182812 KB Output is correct
54 Correct 443 ms 182628 KB Output is correct
55 Correct 370 ms 182340 KB Output is correct
56 Correct 397 ms 182348 KB Output is correct
57 Correct 331 ms 6100 KB Output is correct
58 Correct 373 ms 6044 KB Output is correct
59 Correct 310 ms 5712 KB Output is correct
60 Correct 367 ms 5644 KB Output is correct
61 Correct 491 ms 182740 KB Output is correct
62 Correct 430 ms 182880 KB Output is correct
63 Correct 439 ms 182928 KB Output is correct
64 Correct 616 ms 182796 KB Output is correct
65 Correct 557 ms 182764 KB Output is correct
66 Correct 580 ms 182828 KB Output is correct
67 Correct 426 ms 182784 KB Output is correct
68 Correct 391 ms 182772 KB Output is correct
69 Correct 436 ms 182708 KB Output is correct
70 Correct 381 ms 182864 KB Output is correct
71 Correct 376 ms 182616 KB Output is correct
72 Correct 396 ms 182660 KB Output is correct
73 Correct 448 ms 182852 KB Output is correct
74 Correct 421 ms 182732 KB Output is correct
75 Correct 393 ms 182872 KB Output is correct
76 Correct 460 ms 183316 KB Output is correct
77 Correct 386 ms 182836 KB Output is correct
78 Correct 425 ms 183064 KB Output is correct
79 Correct 294 ms 5964 KB Output is correct
80 Correct 337 ms 5652 KB Output is correct
81 Correct 255 ms 5604 KB Output is correct
82 Correct 448 ms 183272 KB Output is correct
83 Correct 447 ms 183092 KB Output is correct
84 Correct 411 ms 182744 KB Output is correct
85 Correct 427 ms 183148 KB Output is correct
86 Correct 402 ms 183180 KB Output is correct
87 Correct 435 ms 183036 KB Output is correct
88 Correct 344 ms 6024 KB Output is correct
89 Correct 350 ms 6068 KB Output is correct
90 Correct 317 ms 5644 KB Output is correct
91 Correct 346 ms 5668 KB Output is correct
92 Correct 312 ms 5640 KB Output is correct
93 Correct 328 ms 5608 KB Output is correct
94 Correct 369 ms 182692 KB Output is correct
95 Correct 357 ms 182532 KB Output is correct
96 Correct 361 ms 182724 KB Output is correct
97 Correct 333 ms 182464 KB Output is correct
98 Correct 325 ms 182620 KB Output is correct
99 Correct 327 ms 182528 KB Output is correct
100 Correct 371 ms 6040 KB Output is correct
101 Correct 369 ms 6056 KB Output is correct
102 Correct 347 ms 5724 KB Output is correct
103 Correct 354 ms 5700 KB Output is correct
104 Correct 332 ms 5684 KB Output is correct
105 Correct 347 ms 5680 KB Output is correct
106 Correct 387 ms 182728 KB Output is correct
107 Correct 413 ms 182588 KB Output is correct
108 Correct 350 ms 182708 KB Output is correct
109 Correct 408 ms 182424 KB Output is correct
110 Correct 361 ms 182760 KB Output is correct
111 Correct 396 ms 182744 KB Output is correct
112 Correct 311 ms 6120 KB Output is correct
113 Correct 327 ms 6116 KB Output is correct
114 Correct 355 ms 5688 KB Output is correct
115 Correct 314 ms 5596 KB Output is correct
116 Correct 312 ms 5624 KB Output is correct
117 Correct 319 ms 5680 KB Output is correct
118 Correct 398 ms 182460 KB Output is correct
119 Correct 370 ms 182348 KB Output is correct
120 Correct 355 ms 182368 KB Output is correct
121 Correct 411 ms 182444 KB Output is correct
122 Correct 349 ms 182292 KB Output is correct
123 Correct 387 ms 182372 KB Output is correct
124 Correct 377 ms 182384 KB Output is correct
125 Correct 365 ms 182292 KB Output is correct
126 Correct 346 ms 182328 KB Output is correct