oj.uz

Submission #1053929

# Submission time Handle Problem Language Result Execution time Memory
1053929 2024-08-11T21:26:52 Z mindiyak Team Coding (EGOI24_teamcoding) C++14
23 / 100
 4000 ms 14100 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

int n,k;
vi paths[100010];
int type[100010];
int level[100010];
vi colors[100010];
int children[100010];
int children2[100010];
vi arr;

void dfs1(int pos,int height){
    level[pos] = height;
    for(int a:paths[pos]){
        dfs1(a,height+1);
    }
}

void dfs2(int pos,int color){
    if(type[pos] == color){
        arr.pb(pos);
        return;
    }
    for(int a:paths[pos]){
        dfs2(a,color);
    }
}

void dfs(int pos,int head){
    if(type[pos] == type[head]){
        children2[pos] = 1;
    }else{
        children[level[pos]] ++;
    }
    for(int a:paths[pos]){
        dfs(a,head);
    }
}

void solve()
{
    cin >> n >> k;
    FOR(i,0,n)cin >> type[i];
    FOR(i,0,n)colors[type[i]].pb(i);
    FOR(i,1,n){
        int a;cin >> a;
        paths[a].pb(i);
    }

    dfs1(0,0);

    FOR(i,0,k){
        dfs2(0,i);
    }

    int ans = 0,cnt = 0;
    for(int i:arr){
        FOR(j,0,n){
            children2[j] = 0;
            children[j] = 0;
        }
        dfs(i,i);
        int temp = 0,temp_cnt = 0;
        for(int a:colors[type[i]]){
            if(children2[a]){
                temp += 1;
            }else{
                if(children[level[a]] > 0){
                    children[level[a]]--;
                    temp_cnt ++;
                    temp += 1;
                }
            }
        }

        // cout << colors[type[i]].size() << " " << i << " " << temp << " " << temp_cnt << endl;

        if(ans < temp){
            ans = temp;
            cnt = temp_cnt;
        }else if(ans == temp){
            cnt = min(cnt,temp_cnt);
        }
    }

    cout << ans << " " << cnt << endl;
}   


int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void init(std::string)':
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6684 KB Output is correct
9 Execution timed out 4100 ms 14100 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 16 ms 12760 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 3 ms 6504 KB Output is correct
8 Correct 3706 ms 9908 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2528 ms 11160 KB Output is correct
12 Execution timed out 4045 ms 8420 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6472 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Execution timed out 4100 ms 14000 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6572 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6628 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 18 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 9 ms 6492 KB Output is correct
24 Correct 6 ms 6492 KB Output is correct
25 Correct 10 ms 6636 KB Output is correct
26 Correct 13 ms 6492 KB Output is correct
27 Correct 20 ms 6696 KB Output is correct
28 Correct 9 ms 6488 KB Output is correct
29 Correct 13 ms 6636 KB Output is correct
30 Correct 21 ms 6672 KB Output is correct
31 Correct 4 ms 6744 KB Output is correct
32 Correct 3 ms 6492 KB Output is correct
33 Correct 3 ms 6492 KB Output is correct
34 Correct 8 ms 6492 KB Output is correct
35 Correct 13 ms 6492 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 9 ms 6492 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 2 ms 6536 KB Output is correct

Subtask #5
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6684 KB Output is correct
9 Execution timed out 4100 ms 14100 KB Time limit exceeded
10 Halted 0 ms 0 KB -