oj.uz

Submission #1095311

# Submission time Handle Problem Language Result Execution time Memory
1095311 2024-10-01T20:57:37 Z raphaelp Team Coding (EGOI24_teamcoding) C++14
0 / 100
 4000 ms 58308 KB 
#include <bits/stdc++.h>
using namespace std;
void dfs(int x, vector<vector<int>> &AR, vector<int> &depth, int cur)
{
    depth[x] = cur;
    for (int i = 0; i < AR[x].size(); i++)
    {
        dfs(AR[x][i], AR, depth, cur + 1);
    }
}
void dfs2(int x, vector<vector<int>> &AR, vector<vector<pair<int, int>>> &colorpos, vector<int> &available, map<int, int> &M, vector<int> &C, vector<vector<int>> &colors, int cur, int &best, int &best2)
{
    available.push_back(1);
    vector<int> available2;
    map<int, int> M2;
    M[C[x]] += 1;
    for (int i = 0; i < AR[x].size(); i++)
    {
        available2.clear();
        M2.clear();
        dfs2(AR[x][i], AR, colorpos, available2, M2, C, colors, cur + 1, best, best2);
        available2.push_back(0);
        if (available2.size() > available.size())
            swap(available2, available);
        for (int j = 0; j < available2.size(); j++)
        {
            available[j + available.size() - available2.size()] += available2[j];
        }
        if (M2.size() > M.size())
            swap(M, M2);
        for (auto j : M2)
        {
            M[j.first] += j.second;
        }
    }
    if (true) //(colors[C[x]].size() < sqrt(AR.size()))
    {
        int ans1 = 0, ans2 = 0;
        for (int i = 0; i < colorpos[C[x]].size(); i++)
        {
            if (colorpos[C[x]][i].first >= cur)
                ans1 += min(colorpos[C[x]][i].second, available[available.size() - colorpos[C[x]][i].first - 1 + cur]);
        }
        ans2 = ans1 - M[C[x]];
        if (ans1 > best || (ans1 == best && ans2 < best2))
        {
            best = ans1, best2 = ans2;
        }
    }
}
int dfs3(int x, vector<vector<int>> &AR, vector<int> &C, int c, vector<int> &used, vector<int> &maxx, int cur, int &best, int &best2, int &bla)
{
    vector<int> used2;
    int tot = 0, tot2 = 0;
    if (C[x] == c)
        tot2++;
    used.push_back(0);
    if (maxx[cur] != 0)
    {
        used[0] = 1;
        tot++;
    }
    for (int i = 0; i < AR[x].size(); i++)
    {
        used2.clear();
        tot2 += dfs3(AR[x][i], AR, C, c, used2, maxx, cur + 1, best, best2, bla);
        used2.push_back(0);
        if (used2.size() > used.size())
        {
            swap(used2, used);
            swap(tot, bla);
        }
        for (int j = 0; j < used2.size(); j++)
        {
            tot -= used[j + used.size() - used2.size()];
            used[j + used.size() - used2.size()] = min(used[j + used.size() - used2.size()] + used2[j], maxx[cur + used2.size() - j - 1]);
            tot += used[j + used.size() - used2.size()];
        }
    }
    if (C[x] == c && (tot > best || (tot == best && tot2 < best2)))
    {
        best = tot, best2 = tot - tot2;
    }
    bla = tot;
    return tot2;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int N, K;
    cin >> N >> K;
    vector<int> C(N);
    vector<vector<int>> colors(K);
    for (int i = 0; i < N; i++)
    {
        cin >> C[i];
        colors[C[i]].push_back(i);
    }
    vector<int> p(N, 0);
    vector<vector<int>> AR(N);
    for (int i = 1; i < N; i++)
    {
        cin >> p[i];
        AR[p[i]].push_back(i);
    }
    vector<int> depth(N);
    vector<vector<pair<int, int>>> colorpos(K);
    dfs(0, AR, depth, 0);
    int best = 0, best2 = 0;
    for (int i = 0; i < K; i++)
    {
        for (int j = 0; j < colors[i].size(); j++)
        {
            colorpos[i].push_back({depth[colors[i][j]], 1});
        }
        sort(colorpos[i].begin(), colorpos[i].end());
        vector<pair<int, int>> temp;
        int cur = 0;
        for (int j = 0; j < colors[i].size(); j++)
        {
            if (j > 0 && colorpos[i][j].first != colorpos[i][j - 1].first)
            {
                temp.push_back({colorpos[i][j - 1].first, cur});
                cur = 0;
            }
            cur++;
        }
        if (colors[i].size() > 0)
            temp.push_back({colorpos[i].back().first, cur});
        swap(temp, colorpos[i]);
    }
    vector<int> available;
    map<int, int> M;
    dfs2(0, AR, colorpos, available, M, C, colors, 0, best, best2);
    /*for (int i = 0; i < K; i++)
    {
        if (colors[i].size() >= sqrt(N))
        {
            vector<int> used, maxx(N);
            for (int j = 0; j < colors[i].size(); j++)
                maxx[depth[colors[i][j]]]++;
            int bla = 0;
            int temp = dfs3(0, AR, C, i, used, maxx, 0, best, best2, bla);
        }
    }*/
    cout << best << ' ' << best2;
}

Compilation message

Main.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<int>&, int)':
Main.cpp:6:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp: In function 'void dfs2(int, std::vector<std::vector<int> >&, std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&, std::map<int, int>&, std::vector<int>&, std::vector<std::vector<int> >&, int, int&, int&)':
Main.cpp:17:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int j = 0; j < available2.size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~~
Main.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int i = 0; i < colorpos[C[x]].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'int dfs3(int, std::vector<std::vector<int> >&, std::vector<int>&, int, std::vector<int>&, std::vector<int>&, int, int&, int&, int&)':
Main.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp:73:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for (int j = 0; j < used2.size(); j++)
      |                         ~~^~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:114:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         for (int j = 0; j < colors[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~
Main.cpp:121:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |         for (int j = 0; j < colors[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 97 ms 55560 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct
12 Execution timed out 4101 ms 49564 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 1372 KB Output is correct
5 Execution timed out 4099 ms 49736 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 104 ms 55560 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 109 ms 58308 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Incorrect 115 ms 17124 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #4
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 97 ms 55560 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct
12 Execution timed out 4101 ms 49564 KB Time limit exceeded
13 Halted 0 ms 0 KB -