oj.uz

Submission #898920

# Submission time Handle Problem Language Result Execution time Memory
898920 2024-01-05T09:08:09 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
14 / 100
 37 ms 11972 KB 
//In His Name
#include <bits/stdc++.h>
//#pragma GCC optimization("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
using namespace std;
#define ll long long
#define int ll
typedef pair<int, int> pii;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
const int maxn = 1e5 + 10, MOD = 1e9 + 7 ;
const ll INF = 1e18 + 100;

struct hoom{
    int v , d , w;
};

int n , m , k  , maxi = -INF , ar[maxn] , javab;
vector<int> adj[maxn] , nums;
vector<hoom> mive;
bool isok = true;

bool cmp(hoom x , hoom y){
    return (x.v < y.v);
}

void Dfs(int v , int p , int mask){
    for(int u : adj[v]){
        if(u == p) continue;
        Dfs(u , v , mask);
    }
    if(ar[v] != -1){
        if((mask & (1 << ar[v]))) {
            if (maxi <= mive[ar[v]].d) {
                javab += 1;
                maxi = max(maxi, mive[ar[v]].d);
            }
        }
    }
}

void Sub1(){
    int res = 0;
    for(int i = 1 ; i < (1 << m) ; i++){
        maxi = -INF , javab = 0 , isok = true;
        Dfs(1 , 0 , i);
       res = max(res , javab);
    }
    cout << res;
}

void Sub3(){
    for(auto i : mive) nums.pb(i.d);
    reverse(all(nums));
    vector<int> ans;
    int N = nums.size();
    for (int i = 0; i < N; i++) {
        auto it = upper_bound(ans.begin(), ans.end(), nums[i]);
        if (it == ans.end()) {
            ans.push_back(nums[i]);
        }
        else {
            *it = nums[i];
        }
    }
    cout << ans.size();
}


int32_t main(){    
    ios_base::sync_with_stdio(false);
    cin.tie(0) , cout.tie(0);

    cin >> n >> m >> k;
    memset(ar , -1 , sizeof ar);
    int is3 = true;
    for(int i = 2 ; i <= n ; i++){
        int p;
        cin >> p;
        adj[p].pb(i);
        if(p != i-1) is3 = false;
    }
    int sum = 0;
    for(int i = 0 ; i < m ; i++){
        int a , b , c;
        cin >> a >> b >> c;
        sum += c;
        if(c != 1) is3 = false;
        mive.pb({a , b , c});
        ar[a] = i;
    }
    if(is3){
        sort(all(mive)  ,cmp);
        Sub3();
        return 0;
    }
    if(n <= 20){
        Sub1();
        return 0;
    }
    cout << sum;

}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6236 KB Output is correct
2 Correct 14 ms 7004 KB Output is correct
3 Correct 29 ms 8580 KB Output is correct
4 Correct 23 ms 8148 KB Output is correct
5 Correct 27 ms 9680 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 33 ms 10868 KB Output is correct
5 Correct 35 ms 11972 KB Output is correct
6 Correct 37 ms 10756 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 9308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3928 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 3420 KB Output isn't correct
2 Halted 0 ms 0 KB -