| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 284668 |
2020-08-27T21:29:04 Z |
Benq |
Ruka (COI15_ruka) |
C++14 |
|
918 ms |
19832 KB |
#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<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
template<class T> using V = vector<T>;
template<class T, size_t SZ> using AR = array<T,SZ>;
#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 sor(x) sort(all(x))
#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 = 3e5+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};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
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; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }
template<class T, class U> T fstTrue(T lo, T hi, U f) {
// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi);
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
lo --; assert(lo <= hi); // assuming f is decreasing
while (lo < hi) { // find first index such that f is true
T mid = half(lo+hi+1);
f(mid) ? lo = mid : hi = mid-1;
}
return lo;
}
template<class T> void remDup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)),end(v)); }
// 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
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+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 A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
template<class A, class B> str ts(pair<A,B> p) {
#ifdef LOCAL
return "("+ts(p.f)+", "+ts(p.s)+")";
#else
return ts(p.f)+" "+ts(p.s);
#endif
}
// 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 << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str 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
}
/**
* 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
* https://codeforces.com/blog/entry/11080
* 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 atMost(Tree<pi>& T, int r) {
return T.ook({r,MOD}); }
int getSum(Tree<pi>& T, int l, int r) {
return atMost(T,r)-atMost(T,l-1); }
*/
int N,M;
vpi v, upd;
char typ[MX];
vi ans;
int cnt;
void INS(Tree<pi>& a, int x) {
a.insert({x,cnt++});
}
void DEL(Tree<pi>& a, int x) {
auto it = a.lb({x,0}); assert(it != end(a));
a.erase(it);
}
struct con {
Tree<pi> pos, neg;
int offset = 0;
void ins(int l, int r) {
dbg("INS",l,r);
if (l > r) swap(l,r);
l -= offset, r -= offset;
INS(pos,l), INS(neg,r);
}
void del(int l, int r) {
dbg("DEL",l,r);
if (l > r) swap(l,r);
l -= offset, r -= offset;
DEL(pos,l), DEL(neg,r);
}
int query(int x) {
// [l+offset,r+offset] contains x
// x-offset
x -= offset;
return pos.ook({x,0})-neg.ook({x,0});
}
};
bool ok(int l, int r) {
if (l > r) swap(l,r);
return l < 0 && r > 0;
}
con bef, aft;
void solve() {
bef = aft = con();
int pos = 0;
FOR(i,1,N) {
aft.ins(pos,pos+v[i].f);
pos += v[i].f;
}
// dbg(aft);
int ind = 0; pos = 0;
F0R(i,M) {
dbg("DOING",i,typ[i]);
if (typ[i] == 'B') {
if (ind == 0) continue;
aft.offset += v[ind].f; aft.ins(0,v[ind].f);
ind --; pos -= v[ind].f; bef.del(pos,pos+v[ind].f);
} else if (typ[i] == 'F') {
if (ind == N-1) continue;
bef.ins(pos,pos+v[ind].f);
pos += v[ind].f; ind ++;
aft.del(0,v[ind].f); aft.offset -= v[ind].f;
} else if (typ[i] == 'C') {
v[ind].f = upd[i].f;
} else {
ans[i] += bef.query(-1);
ans[i] += ok(1+pos,1+pos+v[ind].f);
ans[i] += aft.query(-1-(pos+v[ind].f));
dbg("OOPS",i,ans[i]);
}
}
}
int main() {
setIO(); re(N);
v.rsz(N); re(v);
re(M); upd.rsz(M); ans.rsz(M);
F0R(i,M) {
re(typ[i]);
if (typ[i] == 'C') re(upd[i]);
}
solve();
trav(t,v) swap(t.f,t.s);
trav(t,upd) swap(t.f,t.s);
solve();
F0R(i,M) if (typ[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
* DON'T GET STUCK ON ONE APPROACH
*/
Compilation message
ruka.cpp: In member function 'void con::insert(int, int)':
ruka.cpp:165:19: warning: statement has no effect [-Wunused-value]
165 | #define dbg(...) 0
| ^
ruka.cpp:232:3: note: in expansion of macro 'dbg'
232 | dbg("INS",l,r);
| ^~~
ruka.cpp: In member function 'void con::del(int, int)':
ruka.cpp:165:19: warning: statement has no effect [-Wunused-value]
165 | #define dbg(...) 0
| ^
ruka.cpp:238:3: note: in expansion of macro 'dbg'
238 | dbg("DEL",l,r);
| ^~~
ruka.cpp: In function 'void solve()':
ruka.cpp:165:19: warning: statement has no effect [-Wunused-value]
165 | #define dbg(...) 0
| ^
ruka.cpp:268:3: note: in expansion of macro 'dbg'
268 | dbg("DOING",i,typ[i]);
| ^~~
ruka.cpp:165:19: warning: statement has no effect [-Wunused-value]
165 | #define dbg(...) 0
| ^
ruka.cpp:284:4: note: in expansion of macro 'dbg'
284 | dbg("OOPS",i,ans[i]);
| ^~~
ruka.cpp: In function 'void setIn(str)':
ruka.cpp:170:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
170 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ruka.cpp: In function 'void setOut(str)':
ruka.cpp:171:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
171 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
512 KB |
Output is correct |
| 3 |
Correct |
2 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
512 KB |
Output is correct |
| 3 |
Correct |
2 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
244 ms |
9080 KB |
Output is correct |
| 6 |
Correct |
130 ms |
5112 KB |
Output is correct |
| 7 |
Correct |
190 ms |
9464 KB |
Output is correct |
| 8 |
Correct |
209 ms |
9464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
512 KB |
Output is correct |
| 3 |
Correct |
2 ms |
512 KB |
Output is correct |
| 4 |
Correct |
2 ms |
512 KB |
Output is correct |
| 5 |
Correct |
244 ms |
9080 KB |
Output is correct |
| 6 |
Correct |
130 ms |
5112 KB |
Output is correct |
| 7 |
Correct |
190 ms |
9464 KB |
Output is correct |
| 8 |
Correct |
209 ms |
9464 KB |
Output is correct |
| 9 |
Correct |
563 ms |
13048 KB |
Output is correct |
| 10 |
Correct |
918 ms |
19832 KB |
Output is correct |
| 11 |
Correct |
797 ms |
19064 KB |
Output is correct |
| 12 |
Correct |
869 ms |
19064 KB |
Output is correct |
