oj.uz

답안 #310529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310529 2020-10-07T08:56:47 Z rrrr10000 가로등 (APIO19_street_lamps) C++14
20 / 100
 2023 ms 524292 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
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 int 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;}
vvp id;
vector<vector<int>> L,R,casc;
vector<int> x,y,s;
ll N;
vvi seg;
vi NN;
void initseg(){
    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;
}
bool cx(int a,int b){if(a>=x.size())return false;if(b>=x.size())return true;return x[a]<x[b];}
bool cy(int a,int b){if(a>=y.size())return false;if(b>=y.size())return true;return y[a]<y[b];}
void init_fractional_cascading(){
    N=1;
    while(N<x.size())N<<=1;
    s=x;rep(i,s.size())s[i]=i;
    sort(all(s),cx);
    casc=vector<vector<int>>(2*N-1);L=casc;R=casc;id=vvp(N);
    rep(i,N){
        if(i<s.size())casc[i+N-1].pb(s[i]);
        else casc[i+N-1].pb(i);
    }
    for(int i=N-2;i>=0;i--){
        ll a=0,b=0;
        while(true){
            L[i].pb(a);R[i].pb(b);
            bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
            if(A&&B)break;
            if(A||(!B&&cy(casc[i*2+2][b],casc[i*2+1][a])))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]].pb(i,j);
}
ll answer_query(int i){
    ll res=0;
    for(auto t:id[i])res+=getsum(t.fi,0,t.se+1,0,0,NN[t.fi]);
    return res;
}
void add_all(int x1,int x2,int y1,int y2,int k,int l,int r,ll X){
    if(x2<=l||r<=x1)return;
    if(x1<=l&&r<=x2){
        if(y1!=casc[k].size())add(k,y1,X);
        if(y2!=casc[k].size())add(k,y2,-X);
        return;
    }
    add_all(x1,x2,L[k][y1],L[k][y2],k*2+1,l,(l+r)/2,X);
    add_all(x1,x2,R[k][y1],R[k][y2],k*2+2,(l+r)/2,r,X);
}
ll LB(vector<int>&v,ll k,vector<int>&x){
    ll ok=v.size(),ng=-1;
    while(ok-ng>1){
        ll md=(ok+ng)/2;
        if(x[v[md]]>=k)ok=md;else ng=md;
    }
    return ok;
}
void add_all(ll x1,ll x2,ll y1,ll y2,ll X){
    x1=LB(s,x1,x);
    x2=LB(s,x2+1,x);
    y1=LB(casc[0],y1,y);
    y2=LB(casc[0],y2+1,y);
    add_all(x1,x2,y1,y2,0,0,N,X);
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,q;cin>>n>>q;
    string str;cin>>str;
    vp query(q);
    x=vector<int>(q);y=vector<int>(q);
    rep(i,q){
        string t;cin>>t;
        if(t=="query"){
            ll a,b;cin>>a>>b;
            query[i]=P(a-1,b-2);
            x[i]=a-1;y[i]=b-2;
        }
        else{
            ll a;cin>>a;
            query[i]=P(-1,a-1);
            x[i]=0;y[i]=0;
        }
    }
    init_fractional_cascading();
    initseg();
    set<ll> S;rep(i,n)if(str[i]=='0')S.insert(i);
    rep(i,q){
        if(query[i].fi==-1){
            ll ID=query[i].se;
            if(str[ID]=='0')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(str[ID]=='0')add_all(a,ID,ID,b,-(i+1));
            else add_all(a,ID,ID,b,i+1);
            if(str[ID]=='1')S.insert(ID);
            str[ID]='1'+'0'-str[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:34:14: warning: overflow in conversion from 'long int' to 'll' {aka 'int'} changes value from '1001001001001001001' to '1551474729' [-Woverflow]
   34 | const ll inf=1001001001001001001;
      |              ^~~~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'void initseg()':
street_lamps.cpp:65:20: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         while(NN[t]<casc[t].size())NN[t]<<=1;
street_lamps.cpp: In function 'bool cx(int, int)':
street_lamps.cpp:84:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 | bool cx(int a,int b){if(a>=x.size())return false;if(b>=x.size())return true;return x[a]<x[b];}
      |                         ~^~~~~~~~~~
street_lamps.cpp:84:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 | bool cx(int a,int b){if(a>=x.size())return false;if(b>=x.size())return true;return x[a]<x[b];}
      |                                                     ~^~~~~~~~~~
street_lamps.cpp: In function 'bool cy(int, int)':
street_lamps.cpp:85:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 | bool cy(int a,int b){if(a>=y.size())return false;if(b>=y.size())return true;return y[a]<y[b];}
      |                         ~^~~~~~~~~~
street_lamps.cpp:85:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 | bool cy(int a,int b){if(a>=y.size())return false;if(b>=y.size())return true;return y[a]<y[b];}
      |                                                     ~^~~~~~~~~~
street_lamps.cpp: In function 'void init_fractional_cascading()':
street_lamps.cpp:88:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     while(N<x.size())N<<=1;
      |           ~^~~~~~~~~
street_lamps.cpp:93:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         if(i<s.size())casc[i+N-1].pb(s[i]);
      |            ~^~~~~~~~~
street_lamps.cpp:100:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             bool A=(a==casc[i*2+1].size()),B=(b==casc[i*2+2].size());
      |                     ~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:100:48: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             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:116:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         if(y1!=casc[k].size())add(k,y1,X);
      |            ~~^~~~~~~~~~~~~~~~
street_lamps.cpp:117:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         if(y2!=casc[k].size())add(k,y2,-X);
      |            ~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1547 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 4 ms 1152 KB Output is correct
4 Correct 4 ms 1280 KB Output is correct
5 Runtime error 1261 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1152 KB Output is correct
2 Correct 4 ms 1152 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 3 ms 1152 KB Output is correct
5 Runtime error 2023 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Runtime error 1547 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -