oj.uz

Submission #1092777

# Submission time Handle Problem Language Result Execution time Memory
1092777 2024-09-25T03:43:07 Z vjudge1 Team Coding (EGOI24_teamcoding) C++17
50 / 100
 59 ms 26576 KB 
#include <iostream>
#include <vector>
#include <queue>

using namespace std;
using pii = pair<int, int>;

const int MAXN = 1e5 + 5, MAXL = 2000;

pii ans = {-1, MAXN};
vector<int> g[MAXN], a[MAXN], se[MAXN];
int n, k, tot, dfn[MAXN], b[MAXN], co[MAXN], dep[MAXN], cnt[MAXN];

void init(int u) {
  b[u] = dfn[u] = ++tot;
  for (auto v : g[u]) {
    dep[v] = dep[u] + 1;
    init(v), b[u] = b[v];
  }
}

void Max(int c, int k) {
  if (ans.first < c || (c == ans.first && ans.second > k)) {
    ans = {c, k};
  }
}

void dfs(int u) {
  for (auto v : g[u]) {
    dfs(v);
    if (a[u].size() < a[v].size()) {
      swap(a[u], a[v]);
    }
    for (int i = a[v].size() - 1, j = a[u].size() - 1; i >= 0; i--, j--) {
      a[u][j] += a[v][i];
    }
  }
  a[u].push_back(1);
  if (se[co[u]].size() <= MAXL) {
    int c = 0, k = 0;
    for (auto v : se[co[u]]) {
      int d = a[u].size() - 1 - (dep[v] - dep[u]);
      k += (dfn[v] >= dfn[u] && dfn[v] <= b[u]);
      if (d >= 0 && d < a[u].size() && cnt[d] < a[u][d]) {
        cnt[d]++, c++;
      }
    }
    Max(c, c - k);
    for (auto v : se[co[u]]) {
      int d = a[u].size() - 1 - (dep[v] - dep[u]);
      if (d >= 0 && d < a[u].size()) cnt[d] = 0;
    }
  }
}

void Dfs(int u, int co) {

}

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> co[i], se[co[i]].push_back(i);
  }
  for (int i = 1, fa; i < n; i++) {
    cin >> fa, g[fa].push_back(i);
  }
  init(0), dfs(0);
  for (int i = 1; i <= k; i++) {
    if (se[i].size() > MAXL) {

    }
  }
  cout << ans.first << ' ' << ans.second;
  return 0;
}

Compilation message

Main.cpp: In function 'void dfs(int)':
Main.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |       if (d >= 0 && d < a[u].size() && cnt[d] < a[u][d]) {
      |                     ~~^~~~~~~~~~~~~
Main.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |       if (d >= 0 && d < a[u].size()) cnt[d] = 0;
      |                     ~~^~~~~~~~~~~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7512 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7352 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 38 ms 26292 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 9 ms 7768 KB Output is correct
12 Incorrect 25 ms 24752 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 8 ms 7876 KB Output is correct
5 Incorrect 26 ms 24844 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7520 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7512 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 40 ms 26240 KB Output is correct
9 Correct 3 ms 7516 KB Output is correct
10 Correct 3 ms 7772 KB Output is correct
11 Correct 40 ms 26576 KB Output is correct
12 Correct 3 ms 7512 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 3 ms 7432 KB Output is correct
16 Correct 4 ms 7516 KB Output is correct
17 Correct 4 ms 7516 KB Output is correct
18 Correct 59 ms 14840 KB Output is correct
19 Correct 50 ms 13660 KB Output is correct
20 Correct 54 ms 15596 KB Output is correct
21 Correct 57 ms 13140 KB Output is correct
22 Correct 52 ms 14416 KB Output is correct
23 Correct 43 ms 19920 KB Output is correct
24 Correct 44 ms 17416 KB Output is correct
25 Correct 3 ms 7512 KB Output is correct
26 Correct 4 ms 7772 KB Output is correct
27 Correct 3 ms 7588 KB Output is correct
28 Correct 3 ms 7516 KB Output is correct
29 Correct 6 ms 8196 KB Output is correct
30 Correct 50 ms 13628 KB Output is correct
31 Correct 45 ms 14164 KB Output is correct
32 Correct 51 ms 16472 KB Output is correct
33 Correct 47 ms 14064 KB Output is correct
34 Correct 3 ms 7512 KB Output is correct
35 Correct 3 ms 7516 KB Output is correct
36 Correct 3 ms 7516 KB Output is correct
37 Correct 3 ms 7516 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 3 ms 7516 KB Output is correct
10 Correct 9 ms 7692 KB Output is correct
11 Correct 3 ms 7512 KB Output is correct
12 Correct 4 ms 7772 KB Output is correct
13 Correct 3 ms 7532 KB Output is correct
14 Correct 15 ms 7516 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 10 ms 7676 KB Output is correct
17 Correct 3 ms 7516 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 3 ms 7344 KB Output is correct
20 Correct 27 ms 7620 KB Output is correct
21 Correct 3 ms 7516 KB Output is correct
22 Correct 3 ms 7528 KB Output is correct
23 Correct 4 ms 7516 KB Output is correct
24 Correct 4 ms 7524 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 4 ms 7772 KB Output is correct
28 Correct 5 ms 7516 KB Output is correct
29 Correct 4 ms 7512 KB Output is correct
30 Correct 7 ms 7720 KB Output is correct
31 Correct 5 ms 7572 KB Output is correct
32 Correct 15 ms 7624 KB Output is correct
33 Correct 4 ms 7516 KB Output is correct
34 Correct 7 ms 7516 KB Output is correct
35 Correct 6 ms 7644 KB Output is correct
36 Correct 6 ms 7516 KB Output is correct
37 Correct 21 ms 7516 KB Output is correct
38 Correct 3 ms 7512 KB Output is correct
39 Correct 3 ms 7288 KB Output is correct
40 Correct 3 ms 7512 KB Output is correct
41 Correct 3 ms 7444 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7512 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7516 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7352 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 38 ms 26292 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 9 ms 7768 KB Output is correct
12 Incorrect 25 ms 24752 KB Output isn't correct
13 Halted 0 ms 0 KB -