제출 #983639

#제출 시각아이디문제언어결과실행 시간메모리
983639shadow_sami통행료 (IOI18_highway)C++17
6 / 100
129 ms47856 KiB
#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){ // fx(adj[u]) // if(x.ff!=par){ // dis[x.ff] = dis[u] + (w[x.ss]?B:A); // 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[up[tp2]] = 1; tp2 = to[tp2]; } tp = gt_l(0,n-1); 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; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...