oj.uz

Submission #966419

# Submission time Handle Problem Language Result Execution time Memory
966419 2024-04-19T20:29:17 Z shadow_sami Magic Tree (CEOI19_magictree) C++17
6 / 100
 2000 ms 31068 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi adj[mx];
ll d[mx];
ll w[mx];
ll sr;
ll st[mx];
ll en[mx];
ll timer = 0;

ll check(ll u,ll v){
	return (st[u] < st[v] && en[u] > en[v]);
}

void dfs(ll u,ll par){
	st[u] = timer;
	timer++;
	fx(adj[u])
		dfs(x,u);
	en[u] = timer;
	timer++;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m>>tp;
        fip(0,n+2){
        	adj[i].clear();
        	d[i] = -1;
        }
        fip(2,n+1){
        	cin>>sr;
        	adj[sr].push_back(i);
        }
        dfs(1,-1);
        ans = 0;
        fip(0,m){
        	cin>>res>>tp2>>tptp;
        	d[res] = tp2;
        	w[res] = tptp;
        	// debug(res);
        	// debug(d[res])
        	// debug(w[res]);
        }        
        // debug(n);
        fip(0,(1<<n)){
        	f = 0;        	
        	fjp(0,n){
        		if((i&(1<<j)) && d[j+1]<0)
        			f = 1;
        	}        	
        	if(f)
        		continue;
        	// debug(i);
        	fjp(0,n){
        		fp(k,0,n){
        			if((i&(1<<j)) && (i&(1<<k))){
        				if(check(k+1,j+1) && d[j+1] > d[k+1]){
        					// debug(k);
        					// debug(j);
        					f = 1;
        				}
        			}        				
        		}
        	}
        	if(f)
        		continue;
        	// debug(i);
        	// ans = max(ans,(ll)totalOne(i));
        	res = 0;
        	fjp(0,n){
        		if(i&(1<<j))
        			res += w[j+1];
        	}   
        	ans = max(ans,res);
        }
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19292 KB Output is correct
2 Correct 636 ms 19444 KB Output is correct
3 Correct 80 ms 19452 KB Output is correct
4 Correct 654 ms 19444 KB Output is correct
5 Correct 632 ms 19452 KB Output is correct
6 Correct 628 ms 19448 KB Output is correct
7 Correct 658 ms 19456 KB Output is correct
8 Correct 106 ms 19540 KB Output is correct
9 Correct 107 ms 19292 KB Output is correct

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 29532 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2065 ms 29532 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19292 KB Output is correct
2 Correct 636 ms 19444 KB Output is correct
3 Correct 80 ms 19452 KB Output is correct
4 Correct 654 ms 19444 KB Output is correct
5 Correct 632 ms 19452 KB Output is correct
6 Correct 628 ms 19448 KB Output is correct
7 Correct 658 ms 19456 KB Output is correct
8 Correct 106 ms 19540 KB Output is correct
9 Correct 107 ms 19292 KB Output is correct
10 Execution timed out 2033 ms 31068 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19292 KB Output is correct
2 Correct 636 ms 19444 KB Output is correct
3 Correct 80 ms 19452 KB Output is correct
4 Correct 654 ms 19444 KB Output is correct
5 Correct 632 ms 19452 KB Output is correct
6 Correct 628 ms 19448 KB Output is correct
7 Correct 658 ms 19456 KB Output is correct
8 Correct 106 ms 19540 KB Output is correct
9 Correct 107 ms 19292 KB Output is correct
10 Incorrect 5 ms 19292 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19292 KB Output is correct
2 Correct 636 ms 19444 KB Output is correct
3 Correct 80 ms 19452 KB Output is correct
4 Correct 654 ms 19444 KB Output is correct
5 Correct 632 ms 19452 KB Output is correct
6 Correct 628 ms 19448 KB Output is correct
7 Correct 658 ms 19456 KB Output is correct
8 Correct 106 ms 19540 KB Output is correct
9 Correct 107 ms 19292 KB Output is correct
10 Execution timed out 2061 ms 29532 KB Time limit exceeded
11 Halted 0 ms 0 KB -