oj.uz

Submission #310027

# Submission time Handle Problem Language Result Execution time Memory
310027 2020-10-05T10:42:50 Z rrrr10000 Street Lamps (APIO19_street_lamps) C++14
100 / 100
 4970 ms 523496 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

const int mx=524288;
vp casc[mx*2-1],id[mx];
vvi seg;
vi NN;
ll N;
void init(){
    NN=vi(N*2-1,1);
    rep(t,N*2-1){
        while(NN[t]<casc[t].size())NN[t]<<=1;
        seg.pb(vi(NN[t]*2-1));
    }
}
void add(ll t,ll i,ll x){
    i=NN[t]+i-1;
    seg[t][i]+=x;
    while(i>0){
        i=(i-1)/2;
        seg[t][i]=seg[t][i*2+1]+seg[t][i*2+2];
    }
}
ll getsum(ll t,ll a,ll b,ll k,ll l,ll r){
    if(r<=a||b<=l)return 0;
    if(a<=l&&r<=b)return seg[t][k];
    ll c1=getsum(t,a,b,k*2+1,l,(l+r)/2);
    ll c2=getsum(t,a,b,k*2+2,(l+r)/2,r);
    return c1+c2;
}
vector<PP> d;
void init_fractional_cascading(){  //(x座標,y座標,id)
    N=1;
    while(N<d.size())N<<=1;
    while(d.size()<N)d.pb(0,0,d.size());sort(all(d));
    rep(i,N)casc[i+N-1].pb(get<1>(d[i]),get<2>(d[i]));
    for(int i=N-2;i>=0;i--){
        ll a=0,b=0;
        while(true){
            bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
            if(A&&B)break;
            if(A)casc[i].pb(casc[i*2+2][b++]);
            else if(B)casc[i].pb(casc[i*2+1][a++]);
            else if(casc[i*2+1][a]>casc[i*2+2][b])casc[i].pb(casc[i*2+2][b++]);
            else casc[i].pb(casc[i*2+1][a++]);
        }
    }
    rep(i,2*N-1)rep(j,casc[i].size())id[casc[i][j].se].pb(i,j);
    init();
}
ll answer_query(int i){
    ll res=0;
    for(auto x:id[i])res+=getsum(x.fi,0,x.se+1,0,0,NN[x.fi]);
    return res;
}
void add_all(int x1,int x2,int y1,int y2,int k,int l,int r,ll x){//[x1,x2],[y1,y2],[l,r)
// cout<<k<<' '<<l<<' '<<r<<'!'<<endl;
    if(x2<get<0>(d[l])||get<0>(d[r-1])<x1)return;
    if(x1<=get<0>(d[l])&&get<0>(d[r-1])<=x2){
        ll a=lb(casc[k],P(y1,-INF)),b=lb(casc[k],P(y2,INF));  //[a,b)+=x
        if(a!=casc[k].size())add(k,a,x);
        if(b!=casc[k].size())add(k,b,-x);
        return;
    }
    add_all(x1,x2,y1,y2,k*2+1,l,(l+r)/2,x);
    add_all(x1,x2,y1,y2,k*2+2,(l+r)/2,r,x);
}
int main(){
    ll n,q;cin>>n>>q;
    string s;cin>>s;
    vi v(n);
    rep(i,n)v[i]='1'-s[i];
    vp query(q);
    rep(i,q){
        string t;cin>>t;
        if(t=="query"){
            ll a,b;cin>>a>>b;
            query[i]=P(a-1,b-2);
            d.pb(a-1,b-2,i);
        }
        else{
            ll a;cin>>a;
            query[i]=P(-1,a-1);
            d.pb(0,0,i);
        }
    }
    init_fractional_cascading();
    set<ll> S;
    rep(i,n)if(v[i])S.insert(i);
    rep(i,q){
        if(query[i].fi==-1){
            ll ID=query[i].se;
            if(v[ID]==1)S.erase(ID);
            auto itr=S.lower_bound(ID);
            ll a=0,b=n-1;
            if(itr!=S.begin()){
                itr--;a=(*itr)+1;itr++;
            }
            if(itr!=S.end())b=(*itr)-1;
            if(v[ID])add_all(a,ID,ID,b,0,0,N,-(i+1));
            else add_all(a,ID,ID,b,0,0,N,i+1);
            if(!v[ID])S.insert(ID);
            v[ID]=1-v[ID];
        }
        else{
            ll res=answer_query(i);
            auto itr=S.lower_bound(query[i].fi);
            if(itr==S.end()||*itr>query[i].se)res+=i+1;
            out(res);
        }
    }
}

Compilation message

street_lamps.cpp: In function 'void init()':
street_lamps.cpp:62:20: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         while(NN[t]<casc[t].size())NN[t]<<=1;
street_lamps.cpp: In function 'void init_fractional_cascading()':
street_lamps.cpp:84:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     while(N<d.size())N<<=1;
      |           ~^~~~~~~~~
street_lamps.cpp:85:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   85 |     while(d.size()<N)d.pb(0,0,d.size());sort(all(d));
      |           ~~~~~~~~^~
street_lamps.cpp:85:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   85 |     while(d.size()<N)d.pb(0,0,d.size());sort(all(d));
      |     ^~~~~
street_lamps.cpp:85:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   85 |     while(d.size()<N)d.pb(0,0,d.size());sort(all(d));
      |                                         ^~~~
street_lamps.cpp:90:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
      |                     ~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:90:48: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
      |                                               ~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'void add_all(int, int, int, int, int, int, int, ll)':
street_lamps.cpp:111:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         if(a!=casc[k].size())add(k,a,x);
      |            ~^~~~~~~~~~~~~~~~
street_lamps.cpp:112:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         if(b!=casc[k].size())add(k,b,-x);
      |            ~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 37248 KB Output is correct
2 Correct 26 ms 37248 KB Output is correct
3 Correct 26 ms 37240 KB Output is correct
4 Correct 26 ms 37248 KB Output is correct
5 Correct 27 ms 37248 KB Output is correct
6 Correct 27 ms 37248 KB Output is correct
7 Correct 26 ms 37248 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2776 ms 504428 KB Output is correct
2 Correct 3235 ms 504444 KB Output is correct
3 Correct 3313 ms 504584 KB Output is correct
4 Correct 3344 ms 513872 KB Output is correct
5 Correct 3577 ms 512792 KB Output is correct
6 Correct 2779 ms 513780 KB Output is correct
7 Correct 4761 ms 523496 KB Output is correct
8 Correct 4360 ms 508064 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 37864 KB Output is correct
2 Correct 29 ms 37888 KB Output is correct
3 Correct 29 ms 37888 KB Output is correct
4 Correct 30 ms 37752 KB Output is correct
5 Correct 1811 ms 520488 KB Output is correct
6 Correct 2800 ms 515924 KB Output is correct
7 Correct 3725 ms 511512 KB Output is correct
8 Correct 4639 ms 507396 KB Output is correct
9 Correct 2021 ms 265348 KB Output is correct
10 Correct 2780 ms 503352 KB Output is correct
11 Correct 2650 ms 503348 KB Output is correct
12 Correct 4970 ms 521972 KB Output is correct
13 Correct 4618 ms 507344 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 37888 KB Output is correct
2 Correct 29 ms 37880 KB Output is correct
3 Correct 30 ms 37888 KB Output is correct
4 Correct 28 ms 37888 KB Output is correct
5 Correct 4896 ms 513168 KB Output is correct
6 Correct 3856 ms 513108 KB Output is correct
7 Correct 2862 ms 513104 KB Output is correct
8 Correct 1677 ms 513244 KB Output is correct
9 Correct 2404 ms 503400 KB Output is correct
10 Correct 1505 ms 503484 KB Output is correct
11 Correct 2392 ms 503488 KB Output is correct
12 Correct 1509 ms 503560 KB Output is correct
13 Correct 2406 ms 503556 KB Output is correct
14 Correct 1511 ms 503604 KB Output is correct
15 Correct 4958 ms 521620 KB Output is correct
16 Correct 4774 ms 513120 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 37248 KB Output is correct
2 Correct 26 ms 37248 KB Output is correct
3 Correct 26 ms 37240 KB Output is correct
4 Correct 26 ms 37248 KB Output is correct
5 Correct 27 ms 37248 KB Output is correct
6 Correct 27 ms 37248 KB Output is correct
7 Correct 26 ms 37248 KB Output is correct
8 Correct 2776 ms 504428 KB Output is correct
9 Correct 3235 ms 504444 KB Output is correct
10 Correct 3313 ms 504584 KB Output is correct
11 Correct 3344 ms 513872 KB Output is correct
12 Correct 3577 ms 512792 KB Output is correct
13 Correct 2779 ms 513780 KB Output is correct
14 Correct 4761 ms 523496 KB Output is correct
15 Correct 4360 ms 508064 KB Output is correct
16 Correct 28 ms 37864 KB Output is correct
17 Correct 29 ms 37888 KB Output is correct
18 Correct 29 ms 37888 KB Output is correct
19 Correct 30 ms 37752 KB Output is correct
20 Correct 1811 ms 520488 KB Output is correct
21 Correct 2800 ms 515924 KB Output is correct
22 Correct 3725 ms 511512 KB Output is correct
23 Correct 4639 ms 507396 KB Output is correct
24 Correct 2021 ms 265348 KB Output is correct
25 Correct 2780 ms 503352 KB Output is correct
26 Correct 2650 ms 503348 KB Output is correct
27 Correct 4970 ms 521972 KB Output is correct
28 Correct 4618 ms 507344 KB Output is correct
29 Correct 30 ms 37888 KB Output is correct
30 Correct 29 ms 37880 KB Output is correct
31 Correct 30 ms 37888 KB Output is correct
32 Correct 28 ms 37888 KB Output is correct
33 Correct 4896 ms 513168 KB Output is correct
34 Correct 3856 ms 513108 KB Output is correct
35 Correct 2862 ms 513104 KB Output is correct
36 Correct 1677 ms 513244 KB Output is correct
37 Correct 2404 ms 503400 KB Output is correct
38 Correct 1505 ms 503484 KB Output is correct
39 Correct 2392 ms 503488 KB Output is correct
40 Correct 1509 ms 503560 KB Output is correct
41 Correct 2406 ms 503556 KB Output is correct
42 Correct 1511 ms 503604 KB Output is correct
43 Correct 4958 ms 521620 KB Output is correct
44 Correct 4774 ms 513120 KB Output is correct
45 Correct 1477 ms 266864 KB Output is correct
46 Correct 1908 ms 266904 KB Output is correct
47 Correct 1882 ms 270736 KB Output is correct
48 Correct 3596 ms 518144 KB Output is correct
49 Correct 3062 ms 506712 KB Output is correct
50 Correct 3127 ms 506928 KB Output is correct
51 Correct 3076 ms 506904 KB Output is correct
52 Correct 2655 ms 507168 KB Output is correct
53 Correct 2591 ms 507296 KB Output is correct
54 Correct 2609 ms 506980 KB Output is correct