Submission #1162634

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1162634	2025-03-06 11:53:32	Lucpp	Team Coding (EGOI24_teamcoding)	C++20	100 / 100	414 ms	28940 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)size(x)
#define all(x) (x).begin(), (x).end()
vector<int> color;
vector<map<int, int>> colByD;
vector<vector<int>> g;
vector<vector<int>> layerSz;
vector<int> cntAbove, cntTotal;
int maxCnt = 0, minSwaps = 0;
void dfs(int u, int par, int d){
  cntAbove[color[u]]++;
  int cntAlready = -cntTotal[color[u]];
  cntTotal[color[u]]++;
  for(int v : g[u]){
    if(v == par) continue;
    dfs(v, u, d+1);
    if(sz(layerSz[v]) > sz(layerSz[u])) swap(layerSz[u], layerSz[v]);
    for(int i = 0; i < sz(layerSz[v]); i++) layerSz[u][sz(layerSz[u])-sz(layerSz[v])+i] += layerSz[v][i];
  }
  layerSz[u].push_back(1);
  cntAbove[color[u]]--;
  cntAlready += cntTotal[color[u]];
  if(cntAbove[color[u]] == 0){
    auto it = colByD[color[u]].lower_bound(d);
    int cnt = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 19 / 19
• Subtask 3: 27 / 27
• Subtask 4: 23 / 23
• Subtask 5: 19 / 19