oj.uz

답안 #261451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261451 2020-08-11T18:06:15 Z rqi 가로등 (APIO19_street_lamps) C++14
100 / 100
 3924 ms 102748 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<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}; 
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) {
    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() { ios_base::sync_with_stdio(0); cin.tie(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: point add and rectangle sum with offline 2D BIT. $x\in (0,SZ)$.
 * Time: O(N\log^2 N)
 * Memory: O(N\log N)
 * Source: Own
 * Verification: 
     * https://dmoj.ca/problem/occ19g4
     * http://www.usaco.org/index.php?page=viewproblem2&cpid=722 (753 ms)
     * http://www.usaco.org/index.php?page=viewproblem2&cpid=601 (679 ms)
 */
 
template<class T, int SZ> struct OffBIT2D { 
    bool mode = 0; // mode = 1 -> initialized
    vpi todo;
    int cnt[SZ], st[SZ];
    vi val;
    vector<T> bit;
    void init() {
        assert(!mode); mode = 1;
        int lst[SZ]; F0R(i,SZ) lst[i] = cnt[i] = 0;
        sort(all(todo),[](const pi& a, const pi& b) { 
            return a.s < b.s; });
        trav(t,todo) for (int x = t.f; x < SZ; x += x&-x) 
            if (lst[x] != t.s) lst[x] = t.s, cnt[x] ++;
        T sum = 0;
        F0R(i,SZ) { lst[i] = 0; st[i] = sum; sum += cnt[i]; }
        val.rsz(sum); bit.rsz(sum); // store BITs in single vector
        trav(t,todo) for (int x = t.f; x < SZ; x += x&-x) 
            if (lst[x] != t.s) lst[x] = t.s, val[st[x]++] = t.s;
    }
    int rank(int y, int l, int r) {
        return ub(begin(val)+l,begin(val)+r,y)-begin(val)-l; }
    void UPD(int x, int y, T t) {
        int z = st[x]-cnt[x]; // x-BIT = range from z to st[x]-1
        for (y = rank(y,z,st[x]); y <= cnt[x]; y += y&-y) 
            bit[z+y-1] += t;
    }
    void upd(int x, int y, T t) { 
        if (!mode) todo.pb({x,y});
        else for (;x<SZ;x+=x&-x) UPD(x,y,t); 
    }
    T QUERY(int x, int y) {
        int z = st[x]-cnt[x];
        T res = 0;
        for (y = rank(y,z,st[x]); y; y -= y&-y) res += bit[z+y-1];
        return res;
    }
    T query(int x, int y) { 
        assert(mode);
        T res = 0; for (; x; x -= x&-x) res += QUERY(x,y);
        return res;
    }
    T query(int xl, int xr, int yl, int yr) { 
        return query(xr,yr)-query(xl-1,yr)
            -query(xr,yl-1)+query(xl-1,yl-1); }
};
 
 
 
const int mx = 300005;
 
int n, q;
set<pi> rang;
int typ[mx];
int tog[mx];
pi query[mx];
OffBIT2D<int, mx> bt;
 
void ERASE(pi x, int tim){
    //dbg("ERASE", x, tim);
    rang.erase(x);
    bt.upd(x.f, x.s, tim);
}
 
void INSERT(pi x, int tim){
    //dbg("INSERT", x, tim);
    rang.ins(x);
    bt.upd(x.f, x.s, -tim);
}
 
 
void toggle(int i, int tim){
    auto it = prev(rang.lb(mp(i+1, 0)));
    pi x = *it;
    if(x.s == i){
        //toggle on
        pi y = *(next(it));
        ERASE(x, tim);
        ERASE(y, tim);
        INSERT(mp(x.f, y.s), tim);
    }
    else{
        assert(x.s > i);
        //toggle off
        ERASE(x, tim);
        INSERT(mp(x.f, i), tim);
        INSERT(mp(i+1, x.s), tim);
    }
}

int getLin(int a, int b){
    auto it = prev(rang.lb(mp(a+1, 0)));
    pi x = *it;
    if(b <= x.s){
        return 1;
    }
    return 0;
}
 
ll QUERY(int a, int b, int tim){
    // dbg(a, b, tim);
    // dbg(lin.query(1, a, b, n+1));
    // dbg(bt.query(1, a, b, n+1));
    return getLin(a, b)*tim+bt.query(1, a, b, n+1);
}
 
int main() {
    setIO();
    cin >> n >> q;
    string s;
    cin >> s;
    for(int i = 1; i <= n+1; i++){
        INSERT(mp(i, i), 0);
    }
    for(int i = 0; i < n; i++){
        if(s[i] == '1') toggle(i+1, 0);
    }
    for(int i = 1; i <= q; i++){
        string x;
        cin >> x;
        if(x == "toggle"){
            typ[i] = 1;
        }
        else if(x == "query"){
            typ[i] = 2;
        }
        else assert(0==1);
 
        if(typ[i] == 1){
            cin >> tog[i];
        }
        else{
            cin >> query[i].f >> query[i].s; 
        }
    }
    for(int i = 1; i <= q; i++){
        if(typ[i] == 1){
            toggle(tog[i], i);
        }
    }
    bt.init();
    rang.clear();
    //dbg("START");
    for(int i = 1; i <= n+1; i++){
        INSERT(mp(i, i), 0);
    }
    for(int i = 0; i < n; i++){
        if(s[i] == '1') toggle(i+1, 0);
    }
    for(int i = 1; i <= q; i++){
        if(typ[i] == 1){
            toggle(tog[i], i);
        }
        else{
            ps(QUERY(query[i].f, query[i].s, i));
        }
        //dbg(i, rang);
    }
    // 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

street_lamps.cpp: In function 'void setIn(str)':
street_lamps.cpp:165:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(str s) { freopen(s.c_str(),"r",stdin); }
                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'void setOut(str)':
street_lamps.cpp:166:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(str s) { freopen(s.c_str(),"w",stdout); }
                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3840 KB Output is correct
2 Correct 4 ms 3840 KB Output is correct
3 Correct 3 ms 3840 KB Output is correct
4 Correct 4 ms 3868 KB Output is correct
5 Correct 4 ms 3840 KB Output is correct
6 Correct 4 ms 3840 KB Output is correct
7 Correct 4 ms 3840 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 563 ms 13432 KB Output is correct
2 Correct 679 ms 13392 KB Output is correct
3 Correct 993 ms 14412 KB Output is correct
4 Correct 3343 ms 58688 KB Output is correct
5 Correct 2871 ms 65824 KB Output is correct
6 Correct 3246 ms 62912 KB Output is correct
7 Correct 1296 ms 53752 KB Output is correct
8 Correct 2560 ms 102572 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4096 KB Output is correct
2 Correct 8 ms 4096 KB Output is correct
3 Correct 9 ms 4224 KB Output is correct
4 Correct 8 ms 4224 KB Output is correct
5 Correct 3229 ms 59308 KB Output is correct
6 Correct 3125 ms 64016 KB Output is correct
7 Correct 2948 ms 65412 KB Output is correct
8 Correct 2543 ms 102748 KB Output is correct
9 Correct 143 ms 10616 KB Output is correct
10 Correct 163 ms 11256 KB Output is correct
11 Correct 163 ms 11384 KB Output is correct
12 Correct 1237 ms 53880 KB Output is correct
13 Correct 2568 ms 102616 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4096 KB Output is correct
2 Correct 8 ms 4096 KB Output is correct
3 Correct 9 ms 4120 KB Output is correct
4 Correct 10 ms 4224 KB Output is correct
5 Correct 1865 ms 53100 KB Output is correct
6 Correct 2517 ms 55128 KB Output is correct
7 Correct 3109 ms 57196 KB Output is correct
8 Correct 3924 ms 64404 KB Output is correct
9 Correct 829 ms 15452 KB Output is correct
10 Correct 797 ms 16268 KB Output is correct
11 Correct 804 ms 15532 KB Output is correct
12 Correct 768 ms 16528 KB Output is correct
13 Correct 847 ms 15564 KB Output is correct
14 Correct 770 ms 16344 KB Output is correct
15 Correct 1213 ms 53748 KB Output is correct
16 Correct 2525 ms 102648 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3840 KB Output is correct
2 Correct 4 ms 3840 KB Output is correct
3 Correct 3 ms 3840 KB Output is correct
4 Correct 4 ms 3868 KB Output is correct
5 Correct 4 ms 3840 KB Output is correct
6 Correct 4 ms 3840 KB Output is correct
7 Correct 4 ms 3840 KB Output is correct
8 Correct 563 ms 13432 KB Output is correct
9 Correct 679 ms 13392 KB Output is correct
10 Correct 993 ms 14412 KB Output is correct
11 Correct 3343 ms 58688 KB Output is correct
12 Correct 2871 ms 65824 KB Output is correct
13 Correct 3246 ms 62912 KB Output is correct
14 Correct 1296 ms 53752 KB Output is correct
15 Correct 2560 ms 102572 KB Output is correct
16 Correct 8 ms 4096 KB Output is correct
17 Correct 8 ms 4096 KB Output is correct
18 Correct 9 ms 4224 KB Output is correct
19 Correct 8 ms 4224 KB Output is correct
20 Correct 3229 ms 59308 KB Output is correct
21 Correct 3125 ms 64016 KB Output is correct
22 Correct 2948 ms 65412 KB Output is correct
23 Correct 2543 ms 102748 KB Output is correct
24 Correct 143 ms 10616 KB Output is correct
25 Correct 163 ms 11256 KB Output is correct
26 Correct 163 ms 11384 KB Output is correct
27 Correct 1237 ms 53880 KB Output is correct
28 Correct 2568 ms 102616 KB Output is correct
29 Correct 7 ms 4096 KB Output is correct
30 Correct 8 ms 4096 KB Output is correct
31 Correct 9 ms 4120 KB Output is correct
32 Correct 10 ms 4224 KB Output is correct
33 Correct 1865 ms 53100 KB Output is correct
34 Correct 2517 ms 55128 KB Output is correct
35 Correct 3109 ms 57196 KB Output is correct
36 Correct 3924 ms 64404 KB Output is correct
37 Correct 829 ms 15452 KB Output is correct
38 Correct 797 ms 16268 KB Output is correct
39 Correct 804 ms 15532 KB Output is correct
40 Correct 768 ms 16528 KB Output is correct
41 Correct 847 ms 15564 KB Output is correct
42 Correct 770 ms 16344 KB Output is correct
43 Correct 1213 ms 53748 KB Output is correct
44 Correct 2525 ms 102648 KB Output is correct
45 Correct 247 ms 12004 KB Output is correct
46 Correct 349 ms 11876 KB Output is correct
47 Correct 1512 ms 29196 KB Output is correct
48 Correct 3254 ms 63368 KB Output is correct
49 Correct 180 ms 11768 KB Output is correct
50 Correct 168 ms 11852 KB Output is correct
51 Correct 185 ms 11944 KB Output is correct
52 Correct 212 ms 12024 KB Output is correct
53 Correct 185 ms 12024 KB Output is correct
54 Correct 187 ms 12104 KB Output is correct