oj.uz

답안 #1092776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092776 2024-09-25T03:42:30 Z vjudge1 Team Coding (EGOI24_teamcoding) C++17
27 / 100
 53 ms 27048 KB 
#include <iostream>
#include <vector>
#include <queue>

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

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

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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7528 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7512 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 36 ms 26688 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Incorrect 5 ms 7772 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# 결과 실행 시간 메모리 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 Incorrect 5 ms 7876 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 3 ms 7512 KB Output is correct
3 Correct 3 ms 7508 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 34 ms 26740 KB Output is correct
9 Correct 3 ms 7512 KB Output is correct
10 Correct 3 ms 7772 KB Output is correct
11 Correct 36 ms 27048 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 3 ms 7520 KB Output is correct
15 Correct 3 ms 7556 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 5 ms 7772 KB Output is correct
18 Correct 43 ms 15052 KB Output is correct
19 Correct 48 ms 14932 KB Output is correct
20 Correct 53 ms 16684 KB Output is correct
21 Correct 53 ms 14164 KB Output is correct
22 Correct 40 ms 15440 KB Output is correct
23 Correct 41 ms 21072 KB Output is correct
24 Correct 41 ms 18764 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 7520 KB Output is correct
28 Correct 3 ms 7608 KB Output is correct
29 Correct 7 ms 8284 KB Output is correct
30 Correct 52 ms 14644 KB Output is correct
31 Correct 49 ms 15188 KB Output is correct
32 Correct 45 ms 17748 KB Output is correct
33 Correct 46 ms 15188 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
0.0 / 23.0

# 결과 실행 시간 메모리 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 3 ms 7468 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 3 ms 7768 KB Output is correct
9 Correct 3 ms 7360 KB Output is correct
10 Incorrect 5 ms 7772 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7528 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 3 ms 7512 KB Output is correct
8 Correct 4 ms 7772 KB Output is correct
9 Correct 36 ms 26688 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Incorrect 5 ms 7772 KB Output isn't correct
12 Halted 0 ms 0 KB -