oj.uz

Submission #1058404

# Submission time Handle Problem Language Result Execution time Memory
1058404 2024-08-14T09:51:09 Z TheQuantiX Beech Tree (IOI23_beechtree) C++17
5 / 100
 51 ms 16728 KB 
#include <bits/stdc++.h>
#include "beechtree.h"

using namespace std;
using ll = long long;

ll n, m, q, k, x, y, a, b, l;
vector<ll> G[200000];
vector<int> p, c;

bool check(vector<int> &v) {
    map<ll, ll> mp;
    vector<ll> v1(n);
    for (int i = 1; i < v.size(); i++) {
        v1[i] = mp[c[v[i]]];
        mp[c[v[i]]]++;
        // cout << p[v[i]] << ' ' << v1[i] << ' ' << v[v1[i]] << '\n';
        if (p[v[i]] != v[v1[i]]) {
            return 0;
        }
    }
    return 1;
}

bool comp(vector<int> &v, vector<int> &u) {
    return v.size() < u.size();
}

bool check2vec(vector<int> &v, vector<int> &u) {
    // for (auto i : v) {
    //     cout << i << ' ';
    // }
    // cout << '\n';
    // for (auto i : u) {
    //     cout << i << ' ';
    // }
    // cout << '\n';
    multiset<ll> st;
    for (int i : u) {
        st.insert(i);
    }
    for (int i : v) {
        if (!st.count(i)) {
            return 0;
        }
        st.erase(st.find(i));
    }
    return 1;
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    n = N;
    m = M;
    p = P;
    c = C;
    bool testcase2 = 1;
    bool testcase3 = 1;
    for (int i = 1; i < n; i++) {
        G[P[i]].push_back(i);
        if (P[i] != i - 1) {
            testcase2 = 0;
        }
        if (i != 0 && P[i] != 0 && P[P[i]] != 0) {
            testcase3 = 0;
        }
    }
    if (n <= 0) {
        vector<int> ans(n);
        vector< vector<int> > has(n);
        for (int i = n - 1; i >= 0; i--) {
            // cout << i << '\n';
            has[i].push_back(i);
            for (int j : G[i]) {
                for (int k : has[j]) {
                    has[i].push_back(k);
                }
            }
            sort(has[i].begin(), has[i].end());
            bool fl = 0;
            do {
                // cout << has[i].size() << endl;
                if (has[i][0] != i) {
                    break;
                }
                fl |= check(has[i]);
                if (fl) {
                    break;
                }
            } while (next_permutation(has[i].begin(), has[i].end()));
            ans[i] = fl;
        }
        return ans;
    }
    if (testcase2) {
        vector<int> ans(n);
        ans[n - 1] = 1;
        ans[n - 2] = 1;
        for (int i = n - 3; i >= 0; i--) {
            ans[i] = (ans[i + 1] & (c[i + 1] == c[i + 2]));
        }
        return ans;
    }
    if (testcase3) {
        vector<int> ans(n);
        for (int i = n - 1; i >= 0; i--) {
            ans[i] = 1;
            set<ll> st;
            for (auto j : G[i]) {
                ans[i] &= ans[j];
                st.insert(c[j]);
            }
            if (st.size() != G[i].size()) {
                ans[i] = 0;
                continue;
            }
            if (i == 0) {
                vector< vector<int> > vec(1);
                for (int j : G[i]) {
                    vec[0].push_back(c[j]);
                }
                for (int j : G[i]) {
                    vec.resize(vec.size() + 1);
                    for (int k : G[j]) {
                        vec[vec.size() - 1].push_back(c[k]);
                    }
                }
                // for (auto &j : vec) {
                //     sort(j.begin(), j.end());
                // }
                sort(vec.begin(), vec.end(), comp);
                for (int j = 0; j < vec.size() - 1; j++) {
                    ans[i] &= check2vec(vec[j], vec[j + 1]);
                }
            }
        }
        return ans;
    }
}

Compilation message

beechtree.cpp: In function 'bool check(std::vector<int>&)':
beechtree.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i = 1; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~
beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:131:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |                 for (int j = 0; j < vec.size() - 1; j++) {
      |                                 ~~^~~~~~~~~~~~~~~~
beechtree.cpp:138:1: warning: control reaches end of non-void function [-Wreturn-type]
  138 | }
      | ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
10 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 47 ms 16696 KB Output is correct
8 Correct 51 ms 16672 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4952 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 5212 KB Output is correct
14 Correct 1 ms 5212 KB Output is correct
15 Correct 1 ms 5212 KB Output is correct
16 Correct 1 ms 5208 KB Output is correct
17 Correct 44 ms 16728 KB Output is correct
18 Correct 46 ms 16696 KB Output is correct
19 Correct 44 ms 16676 KB Output is correct
20 Correct 48 ms 16692 KB Output is correct

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 5128 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 47 ms 16696 KB Output is correct
6 Correct 51 ms 16672 KB Output is correct
7 Incorrect 1 ms 4956 KB 2nd lines differ - on the 32nd token, expected: '0', found: '1'
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
6 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
6 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Incorrect 1 ms 4956 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
3 Halted 0 ms 0 KB -