Submission #212415

#TimeUsernameProblemLanguageResultExecution timeMemory
212415BenqHarvest (JOI20_harvest)C++14
100 / 100
752 ms120252 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef string str; typedef pair<int,int> pi; typedef pair<ll,ll> pl; typedef pair<db,db> pd; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<db> vd; typedef vector<str> vs; typedef vector<pi> vpi; typedef vector<pl> vpl; typedef vector<pd> vpd; #define mp make_pair #define f first #define s second #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) (x).rbegin(), (x).rend() #define rsz resize #define ins insert #define ft front() #define bk back() #define pf push_front #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const int MX = 2e5+5; const ll INF = 1e18; const ld PI = acos((ld)-1); const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } int pct(int x) { return __builtin_popcount(x); } int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 // INPUT template<class A> void re(complex<A>& c); template<class A, class B> void re(pair<A,B>& p); template<class A> void re(vector<A>& v); template<class A, size_t SZ> void re(array<A,SZ>& a); template<class T> void re(T& x) { cin >> x; } void re(db& d) { str t; re(t); d = stod(t); } void re(ld& d) { str t; re(t); d = stold(t); } template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); } template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; } template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); } template<class A> void re(vector<A>& x) { trav(a,x) re(a); } template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); } // TO_STRING #define ts to_string template<class A, class B> str ts(pair<A,B> p); template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); } str ts(bool b) { return b ? "true" : "false"; } str ts(char c) { str s = ""; s += c; return s; } str ts(str s) { return s; } str ts(const char* s) { return (str)s; } str ts(vector<bool> v) { bool fst = 1; str res = "{"; F0R(i,sz(v)) { if (!fst) res += ", "; fst = 0; res += ts(v[i]); } res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } template<class T> str ts(T v) { bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; } template<class A, class B> str ts(pair<A,B> p) { return "("+ts(p.f)+", "+ts(p.s)+")"; } // OUTPUT template<class A> void pr(A x) { cout << ts(x); } template<class H, class... T> void pr(const H& h, const T&... t) { pr(h); pr(t...); } void ps() { pr("\n"); } // print w/ spaces template<class H, class... T> void ps(const H& h, const T&... t) { pr(h); if (sizeof...(t)) pr(" "); ps(t...); } // DEBUG void DBG() { cerr << "]" << endl; } template<class H, class... T> void DBG(H h, T... t) { cerr << to_string(h); if (sizeof...(t)) cerr << ", "; DBG(t...); } #ifdef LOCAL // compile with -DLOCAL #define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #else #define dbg(...) 42 #endif // FILE I/O void setIn(string s) { freopen(s.c_str(),"r",stdin); } void setOut(string s) { freopen(s.c_str(),"w",stdout); } void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); } void setIO(string s = "") { unsyncIO(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO } mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); /** * Description: A set (not multiset!) with support for finding the $n$'th * element, and finding the index of an element. Change \texttt{null\_type} for map. * Time: O(\log N) * Source: KACTL * Verification: many */ #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define ook order_of_key #define fbo find_by_order void treeExample() { Tree<int> t, t2; t.insert(8); auto it = t.insert(10).f; assert(it == t.lb(9)); assert(t.ook(10) == 1 && t.ook(11) == 2 && *t.fbo(0) == 8); t.join(t2); // assuming T < T2 or T > T2, merge t2 into t } int N,M,L,C,A[MX],B[MX],par[MX], dis[MX]; vector<pair<ll,int>> query[MX]; ll ans[MX]; vi child[MX]; // int cyc[MX]; int dist(int a, int b) { int dif = C-(A[a]-A[b]); if (dif < 0) return A[a]-A[b]; int need = cdiv(dif,L); return A[a]-A[b]+L*need; // A[a]-A[b]+L*? >= C } int cyclic(int a, int b) { if (a > b) a -= L; return b-a; } typedef pair<ll,Tree<pair<ll,int>>*> T; int root,dumb; T stor[MX]; bool vis[MX]; void ins(T& a, ll b) { a.s->insert({b-a.f,dumb++}); } void merge(T& a, T& b) { if (a.s->size() < b.s->size()) swap(a,b); trav(t,*b.s) ins(a,t.f+b.f); } ll getAns(T& a, ll b) { return a.s->ook({b-a.f,MOD}); } void dealCyc(int a) { vis[a] = 1; trav(t,child[a]) { if (t == root) continue; dealCyc(t); stor[t].f += dis[t]; merge(stor[a],stor[t]); } if (a != root) trav(t,query[a]) { ans[t.s] += getAns(stor[a],t.f); } } ll quo(ll a, ll b) { if (a > 0 || a%b == 0) return a/b; return a/b-1; } ll rem(ll a, ll b) { ll r = a-quo(a,b)*b; assert(0 <= r && r < b); return r; } void finCyc() { ll d = dis[root]; vi todo = {root}; while (par[todo.bk] != root) { todo.pb(par[todo.bk]); d += dis[todo.bk]; } dbg("FINCYC",root,stor[root].f,*stor[root].s); vector<pair<ll,int>> huh; F0R(i,sz(todo)) { int z = todo[i]; trav(t,query[z]) huh.pb({t.f-stor[root].f,t.s}); stor[root].f += dis[z]; // dbg(root,d,todo); } sort(all(huh)); dbg(huh); vector<pair<ll,int>> toIns; trav(t,*stor[root].s) toIns.pb(t); dbg(toIns); Tree<pair<ll,int>> cur; ll cnum = 0, csum = 0; int ind = 0; trav(t,huh) { while (ind < sz(toIns) && toIns[ind].f <= t.f) { cnum ++; csum += quo(toIns[ind].f,d); cur.insert({rem(toIns[ind].f,d),toIns[ind].s}); ind ++; } ans[t.s] += cnum*quo(t.f,d)-csum; ans[t.s] += cur.ook({rem(t.f,d),MOD}); } } int main() { setIO(); re(N,M,L,C); // assert(N <= 100000 && M <= 100000); FOR(i,1,N+1) stor[i].s = new Tree<pair<ll,int>>(); FOR(i,1,N+1) re(A[i]); FOR(i,1,M+1) { re(B[i]); auto ind = lb(A+1,A+N+1,B[i])-A; if (ind == 1) ind = N+1; ind --; int d = cyclic(A[ind],B[i]); dbg(i,ind,d); ins(stor[ind],d); } int Q; re(Q); F0R(i,Q) { int V; ll T; re(V,T); query[V].pb({T,i}); } FOR(i,1,N+1) { ll nex = (A[i]-C)%L; if (nex <= 0) nex += L; while (1) { int ind = ub(A+1,A+N+1,(int)nex)-A-1; if (ind == 0) { nex += L; continue; } par[i] = ind; child[ind].pb(i); dis[i] = dist(i,ind); break; } dbg(i,par[i],dis[i]); } FOR(i,1,N+1) if (!vis[i]) { int a = i, b = par[i]; while (a != b) a = par[a], b = par[par[b]]; root = a; dealCyc(a); // if (N >= 10000) continue; finCyc(); } F0R(i,Q) ps(ans[i]); // you should actually read the stuff at the bottom } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN */

Compilation message (stderr)

harvest.cpp: In function 'void finCyc()':
harvest.cpp:227:47: warning: statement has no effect [-Wunused-value]
  dbg("FINCYC",root,stor[root].f,*stor[root].s);
                                               ^
harvest.cpp:235:10: warning: statement has no effect [-Wunused-value]
  dbg(huh);
          ^
harvest.cpp:238:12: warning: statement has no effect [-Wunused-value]
  dbg(toIns);
            ^
harvest.cpp: In function 'int main()':
harvest.cpp:262:15: warning: statement has no effect [-Wunused-value]
   dbg(i,ind,d);
               ^
harvest.cpp:278:23: warning: statement has no effect [-Wunused-value]
   dbg(i,par[i],dis[i]);
                       ^
harvest.cpp: In function 'void setIn(std::__cxx11::string)':
harvest.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
harvest.cpp: In function 'void setOut(std::__cxx11::string)':
harvest.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...