oj.uz

답안 #1061382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061382 2024-08-16T08:29:39 Z dozer 참나무 (IOI23_beechtree) C++17
0 / 100
 3 ms 8328 KB 
#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define LL node * 2
#define RR node * 2 + 1
#define ll long long
#define MAXN 300005

vector<pii> adj[MAXN];
int sz[MAXN];

void dfs(int node){
    sz[node] = 1;
    for (auto i :adj[node]){
        dfs(i.st);
        sz[node] += sz[i.st];
    }
}

vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    for (int i = 0; i < N; i++) adj[i].clear();   
    for (int i = 1; i < N; i++){
        adj[P[i]].pb({i, C[i]});
    }

    dfs(0);
    for (int i = 0; i < N; i++){
        sort(adj[i].begin(), adj[i].end(), [&](pii a, pii b){
            return sz[a.st] > sz[b.st];
        });
    }
    int n = N;
    vector<int> ans(N, 1);
    for (int i = n - 1; i >= 0; i--){
        vector<int> curr, cnt(M + 2, 0);
        queue<int> q;
        q.push(i);
        while(!q.empty()){
            int top = q.front();
            q.pop();
            if (!curr.empty() && curr[cnt[C[top]]] != P[top]) ans[i] = 0;
            curr.pb(top);
            cnt[C[top]]++;
            for (auto i : adj[top]){
                q.push(i.st);
            }
        }
    }

    return ans;
}
/*
int main()
{
    fileio();
    int N, M;
    assert(2 == scanf("%d %d", &N, &M));
    std::vector<int> P(N);
    for (int i = 0; i < N; ++i)
        assert(1 == scanf("%d", &P[i]));
    std::vector<int> C(N);
    for (int i = 0; i < N; ++i)
        assert(1 == scanf("%d", &C[i]));

    fclose(stdin);

    std::vector<int> res = beechtree(N, M, P, C);

    int n = res.size();
    for (int i = 0; i < n; ++i)
    {
        if (i > 0)
            printf(" ");
        printf("%d", res[i]);
    }
    printf("\n");
    fclose(stdout);

    return 0;
}
*/

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8328 KB Output is correct
2 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8328 KB Output is correct
2 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8328 KB Output is correct
2 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8328 KB Output is correct
2 Incorrect 2 ms 8284 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -