Submission #288112

#TimeUsernameProblemLanguageResultExecution timeMemory
288112erd1Ideal city (IOI12_city)C++14
0 / 100
650 ms4584 KiB
#include<bits/stdc++.h> using namespace std; /* #include<bits/extc++.h> using namespace __gnu_pbds; template<typename T> using order_statistics_tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; */ #define int lld #define ff first #define ss second #define all(x) (x).begin(), (x).end() #define pb push_back typedef int64_t lld; typedef pair<int, int> pii; typedef long double ld; template<typename T1, typename T2> ostream& operator<<(ostream& out, pair<T1, T2> p){ return out << "(" << p.ff << ", " << p.ss << ")"; } template<typename Iter> ostream& outIt(ostream& out, Iter b, Iter e){ for(Iter i = b; i != e; i++) out << (i==b?"":" ") << *i; return out; } template<typename T> ostream& operator<<(ostream& out, vector<T> v){ return outIt(out << '[', all(v)) << ']'; } template<typename T1, typename T2> ostream& operator<<(ostream& out, map<T1, T2> m){ return outIt(out << '{', all(m)) << '}'; } template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>; template<typename T1, typename T2> pair<T1, T2>& operator+=(pair<T1, T2>& a, pair<T1, T2> p){ return a.ff += p.ff, a.ss += p.ss, a; } typedef vector<pii>::iterator it; const int mod = 1000000000; vector<vector<int>> G; min_heap<pair<int, pii>> q; vector<bool> gone; void toX(it begs, it ends, int targ, map<int, pii>& ans){ // points should be sorted; //outIt(cout << "toX", begs, ends) << " " << targ << endl; int n = ends-begs; for(int i = 0; i < n; i++)G[i].resize(0); for(int i = 0; i < n; i++){ auto pi = begs[i]; auto it1 = lower_bound(begs, ends, (pii){pi.ff+1, pi.ss}), it2 = lower_bound(begs, ends, (pii){pi.ff, pi.ss+1}); if(it1 != ends && *it1 == (pii){pi.ff+1, pi.ss}) G[i].pb(it1-begs), G[it1-begs].pb(i); if(it2 != ends && *it2 == (pii){pi.ff, pi.ss+1}) G[i].pb(it2-begs), G[it2-begs].pb(i); if(pi.ff == targ)q.push({0, {i, pi.ss}}); } //cout << G << endl; ans.clear(); for(int i = 0; i < n; i++)gone[i] = 0; while(q.size()){ auto a = q.top(); q.pop(); if(gone[a.ss.ff])continue; gone[a.ss.ff] = true; ans[a.ss.ss] += {a.ff, 1}; ans[a.ss.ss].ff%=mod; //cout << a << endl; for(auto i: G[a.ss.ff]) if(!gone[i])q.push({a.ff+1, {i, a.ss.ss}}); } //cout << ans << endl; //return ans; } map<int, pii> mpa, mpb; //int ccc = 0; int calcSum(it begs, it ends, int xl, int xr, int yl, int yr, int ccc = 0){ assert(ccc++ < 100); //outIt(cout << "calc sum", begs, ends) << " " << make_pair(make_pair(xl, xr), make_pair(yl, yr)) << endl; //for(auto i = begs; i != ends; i++)assert(i->ff >= xl && i->ff < xr && i->ss >= yl && i->ss < yr); if(begs == ends)return 0; if(next(begs) == ends) return 0; if(next(begs) == prev(ends))return 1; int n = ends - begs; sort(begs, ends); int midx = (xl+xr)/2; it mid = lower_bound(begs, ends, (pii){midx, INT_MIN});//, mid2 = lower_bound(begs, ends, (pii){midx+1, INT_MIN}); //cout << midx << " " << ends-mid << endl; //it mid = max(mid1-begs, ends-mid1) > max(mid2-begs, ends-mid2)?mid2:mid1; lld ans = 0; if(mid != begs && mid != ends){ //midx = mid->ff; toX(begs, mid, midx-1, mpa); toX(mid, ends, midx, mpb); lld acnt = 0, bcnt = 0, asum = 0, bsum = 0, ldis = -1; for(auto ita = mpa.begin(), itb = mpb.begin(); ita != mpa.end() || itb != mpb.end();){ if(ita == mpa.end() || itb != mpb.end() && *itb < *ita){ //cout << "inb" << *itb << acnt << endl; (asum += acnt*(itb->ff-ldis))%=mod, (bsum += bcnt*(itb->ff-ldis))%=mod; (ans += asum*itb->ss.ss%mod + itb->ss.ff*acnt%mod + itb->ss.ss*acnt%mod)%=mod; (bsum += itb->ss.ff)%=mod, (bcnt += itb->ss.ss)%=mod; ldis = itb->ff; ++itb; }else { (asum += acnt*(ita->ff-ldis))%=mod, (bsum += bcnt*(ita->ff-ldis))%=mod; (ans += bsum*ita->ss.ss + ita->ss.ff*bcnt + ita->ss.ss*bcnt)%=mod; (asum += ita->ss.ff)%=mod, (acnt += ita->ss.ss)%=mod; ldis = ita->ff; ++ita; } //cout << acnt << " " << bcnt << " " << ans << endl; } } /* { int ansx = 0; for(auto ax: mpa) for(auto bx: mpb) ansx += (abs(ax.ff-bx.ff)+1)*ax.ss.ss*bx.ss.ss + ax.ss.ff*bx.ss.ss + ax.ss.ss*bx.ss.ff; assert(ansx == ans); } */ //outIt(cout << "calc sum", begs, ends) << " " << ans << endl; for(auto i = begs; i != ends; i++)swap(i->ff, i->ss); return (ans + calcSum(begs, mid, yl, yr, xl, midx, ccc) + calcSum(mid, ends, yl, yr, midx, xr, ccc))%mod; } vector<pii> v; signed DistanceSum(signed N, signed *X, signed *Y) { G.resize(N), gone.resize(N); for(int i = 0; i < N; i++)v.pb({X[i], Y[i]}); int ans = 0; for(int i = 0; i < N; i++) for(int j = i; j < N; j++) ans += abs(X[i]-X[j]) + abs(Y[i]-Y[j]); //cout << ans << endl; //*/ int ans2 = calcSum(all(v), 0, INT_MAX, 0, INT_MAX); assert(ans == ans2); return ans%mod; }

Compilation message (stderr)

city.cpp: In function 'lld calcSum(it, it, lld, lld, lld, lld, lld)':
city.cpp:107:47: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  107 |       if(ita == mpa.end() || itb != mpb.end() && *itb < *ita){
      |                              ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
city.cpp:95:7: warning: unused variable 'n' [-Wunused-variable]
   95 |   int n = ends - begs;
      |       ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...