oj.uz

답안 #1053901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053901 2024-08-11T20:51:38 Z mindiyak Team Coding (EGOI24_teamcoding) C++14
0 / 100
 388 ms 1048576 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;
vvi paths(1e5+10,vi());
vi type(1e5+10),level(1e5+10);
vvi colors(1e5+10,vi());
vvi children(1e5+10,vi(1e5+10,0));
vector<set<int>> same_children(1e5+10,set<int>());


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

void dfs(int pos,int head){
    if(type[pos] == type[head]){
        same_children[head].insert(pos);
    }else{
        children[head][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,n)cout << level[i] << " ";
    cout << endl;

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

    //     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

# 결과 실행 시간 메모리 Grader output
1 Runtime error 362 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 352 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 342 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 388 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 362 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -