oj.uz

Submission #983643

# Submission time Handle Problem Language Result Execution time Memory
983643 2024-05-15T20:01:02 Z shadow_sami Highway Tolls (IOI18_highway) C++17
51 / 100
 146 ms 48076 KB 
#include<bits/stdc++.h>
#include "highway.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;
int N,M,A,B,S,T;
vector<pi> adj[mx];
vector<int>w;
ll dis[mx];
ll timer = 0;
ll st[mx];
ll en[mx];
ll s[mx];
ll e[mx];
ll id[mx];
ll to[mx];
ll l,r,mid,pt;
ll up[mx];
bool mark[mx];

// void answer(ll a,ll b){
// 	cout<<a<<" "<<b<<nli;
// }

// void dfss(ll u,ll par){		
// 	debug(u);
// 	debug(dis[u]);
// 	fx(adj[u])
// 		if(x.ff!=par){	
// 			debug(u);
// 			debug(x.ff);
// 			debug(x.ss);
// 			dis[x.ff] = dis[u] + (w[x.ss]?B:A);
// 			cerr<<nli;
// 			dfss(x.ff,u);
// 		}

// 	return;
// }

// ll ask(vector<int> W){
// 	fip(0,n-1)
// 		w[i] = W[i];
// 	dis[S] = 0;
// 	dfss(S,-1);	
// 	return dis[T];
// }

void dfs(ll u,ll par){	
	to[u] = par;
	s[u] = timer;
	fx(adj[u])
		if(x.ff!=par){	
			id[timer] = x.ss;
			st[timer] = u;
			en[timer] = x.ff;
			up[x.ff] = timer;
			timer++;
			dfs(x.ff,u);
		}	
	e[u] = timer-(adj[u].size()!=1);
	return;
}

ll gt_f(ll u,ll v){
	l = u;
	r = v;
	pt = 1;
	while(l<=r){
		mid = l + (r-l) / 2;
		fip(0,mid)
			w[id[i]] = 1;
		fip(mid,n-1)
			w[id[i]] = 0;			
		if(ask(w)!=res){
			if(mid)
				pt = st[mid-1];
			r = mid - 1;
		}else
		 	l = mid + 1;		
	}
	return pt;
}

ll gt_l(ll u,ll v){
	l = u;
	r = v;
	pt = tp;
	while(l<=r){
		mid = l + (r-l) / 2;
		fip(0,mid)
			w[id[i]] = 0;
		fip(mid,n-1)
			w[id[i]] = (mark[id[i]]?0:1);				
		if(ask(w)!=res){
			pt = en[mid];
			l = mid + 1;			
		}else
			r = mid - 1;		 			
	}
	return pt;
}


void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
	n = N;
	w.resize(n-1);
	fip(0,n-1){
		U[i]++;
		V[i]++;
		adj[U[i]].push_back({V[i],i});
		adj[V[i]].push_back({U[i],i});
	}
	vector<int> w(n-1,0);
	// debug(w);
	res = ask(w);	
	// debug(res);
	dfs(1,1);	
	tp = gt_f(0,n-1);
	// debug(tp);	
	tp2 = gt_l(0,n-1);
	// debug(tp2);
	tptp = tp2;	
	while(tp2!=tp){
		mark[id[up[tp2]]] = 1;
		tp2 = to[tp2];
	}	
	tp = gt_l(0,n-1);	
	// debug(tp);
	answer(tp-1, tptp-1);
	return;
}

// 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>>A>>B>>S>>T;
//         S++;
//         T++;
//         vector<int> U(N-1);
//         vector<int> V(N-1);
//         fip(0,N-1)
//         	cin>>U[i]>>V[i];
//         find_pair(N,U,V,A,B);
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27376 KB Output is correct
2 Correct 5 ms 27376 KB Output is correct
3 Correct 5 ms 27376 KB Output is correct
4 Correct 5 ms 27380 KB Output is correct
5 Correct 5 ms 27372 KB Output is correct
6 Correct 5 ms 27380 KB Output is correct
7 Correct 5 ms 27376 KB Output is correct
8 Correct 5 ms 27372 KB Output is correct
9 Correct 5 ms 27400 KB Output is correct
10 Correct 5 ms 27372 KB Output is correct
11 Correct 5 ms 27380 KB Output is correct
12 Correct 5 ms 27380 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27696 KB Output is correct
2 Correct 13 ms 30244 KB Output is correct
3 Correct 110 ms 42628 KB Output is correct
4 Correct 108 ms 42408 KB Output is correct
5 Correct 93 ms 42388 KB Output is correct
6 Correct 90 ms 42412 KB Output is correct
7 Correct 117 ms 42636 KB Output is correct
8 Correct 101 ms 42376 KB Output is correct
9 Correct 109 ms 42812 KB Output is correct
10 Correct 100 ms 42400 KB Output is correct
11 Correct 113 ms 44100 KB Output is correct
12 Correct 143 ms 44684 KB Output is correct
13 Correct 129 ms 44468 KB Output is correct
14 Correct 146 ms 43424 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 30636 KB Output is correct
2 Correct 29 ms 32108 KB Output is correct
3 Correct 36 ms 33580 KB Output is correct
4 Correct 87 ms 47592 KB Output is correct
5 Correct 82 ms 48056 KB Output is correct
6 Correct 79 ms 47828 KB Output is correct
7 Correct 102 ms 47572 KB Output is correct
8 Correct 112 ms 47612 KB Output is correct
9 Correct 74 ms 48076 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27444 KB Output is correct
2 Correct 21 ms 30204 KB Output is correct
3 Correct 86 ms 38892 KB Output is correct
4 Correct 128 ms 42596 KB Output is correct
5 Correct 105 ms 42676 KB Output is correct
6 Correct 111 ms 42836 KB Output is correct
7 Correct 122 ms 42584 KB Output is correct
8 Correct 121 ms 43280 KB Output is correct
9 Correct 111 ms 42800 KB Output is correct
10 Correct 117 ms 43088 KB Output is correct
11 Correct 131 ms 43688 KB Output is correct
12 Correct 134 ms 44992 KB Output is correct
13 Correct 110 ms 44880 KB Output is correct
14 Correct 141 ms 44716 KB Output is correct
15 Correct 115 ms 42840 KB Output is correct
16 Correct 118 ms 42588 KB Output is correct
17 Correct 118 ms 44364 KB Output is correct
18 Correct 134 ms 43820 KB Output is correct
19 Correct 110 ms 43232 KB Output is correct
20 Correct 113 ms 45420 KB Output is correct
21 Correct 109 ms 42204 KB Output is correct
22 Correct 101 ms 41964 KB Output is correct
23 Correct 101 ms 42728 KB Output is correct
24 Correct 93 ms 42576 KB Output is correct
25 Correct 106 ms 47312 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 13620 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 13656 KB Incorrect
2 Halted 0 ms 0 KB -