oj.uz

답안 #979060

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979060 2024-05-10T07:22:19 Z Kenjikrab 가로등 (APIO19_street_lamps) C++14
80 / 100
 5000 ms 43376 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
using namespace std;
typedef array<int,4> arr4;
int const n_max=3e5+15;

set<int> zero;
char s[n_max];
arr4 arr[3*n_max];
int ans[n_max];
int cnt=0;
int fen[n_max];
inline void upd(int idx,int val)
{
    for(;idx<n_max;idx+=idx&-idx)fen[idx]+=val;
}
inline int qr(int idx)
{
    int ret=0;
    for(idx;idx;idx-=idx&-idx)ret+=fen[idx];
    return ret;
}
void sol(int l,int r)
{
    if(l>=r)return;
    int mid=(l+r)>>1,p=l;
    sol(l,mid);sol(mid+1,r);
    for(int i=mid+1;i<=r;i++)
    {
        if(arr[i][2])continue;
        while(p<=mid&&arr[p][1]>=arr[i][1]){upd(arr[p][3],arr[p][2]),p++;}
        ans[arr[i][3]]+=qr(arr[i][3]);
    }
    for(int i=l;i<p;i++)
    {
        upd(arr[i][3],-arr[i][2]);
    }
    inplace_merge(arr+l,arr+mid+1,arr+r+1,[&](const arr4 &a,const arr4 &b)
    {return a[1]>b[1];});
}
signed main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    memset(ans,-1,sizeof(ans));
    int n,q;
    scanf("%d%d%s",&n,&q,s);
    zero.insert(0);
    for(int i=0;i<n;i++)
    { 
        if(!(s[i]-='0'))zero.insert(i+1);
    }
    zero.insert(n+1);
    char com[10];
    for(int i=1;i<=q;i++)
    {
        scanf("%s",com);
        if(com[0]=='q')
        {
            int a,b;
            scanf("%d%d",&a,&b);
            b--;
            arr[cnt++]={a,b,0,i};
            ans[i]=*zero.lower_bound(a)<=b? 0:i;
        }
        else
        {
            int a;
            scanf("%d",&a);
            if(s[a-1])
            {
                auto it=zero.insert(a).first;
                int l=*prev(it),m=a,r=*next(it);
                arr[cnt++]={l+1,r-1,i,i};
                arr[cnt++]={l+1,m-1,-i,i};
                arr[cnt++]={m+1,r-1,-i,i};
            }
            else
            {
                auto it=zero.find(a);
                int l=*prev(it),m=a,r=*next(it);
                arr[cnt++]={l+1,r-1,-i,i};
                arr[cnt++]={l+1,m-1,i,i};
                arr[cnt++]={m+1,r-1,i,i};
                zero.erase(it);
            }
            s[a-1]^=1;
        }
    }
    sort(arr, arr+cnt, [&](const arr4 &a, const arr4 &b)
    {return a[0]^b[0] ? a[0]<b[0] : ((a[1]!=b[1])? a[1]>b[1]:(b[2]==0)); });
    sol(0,cnt-1);
    for(int i=1;i<=q;i++)
    {
        if(ans[i]==-1)continue;
        else printf("%d\n",ans[i]);
    }
    return 0;
}

Compilation message

street_lamps.cpp: In function 'int qr(int)':
street_lamps.cpp:22:9: warning: statement has no effect [-Wunused-value]
   22 |     for(idx;idx;idx-=idx&-idx)ret+=fen[idx];
      |         ^~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d%d%s",&n,&q,s);
      |     ~~~~~^~~~~~~~~~~~~~~~~~
street_lamps.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%s",com);
      |         ~~~~~^~~~~~~~~~
street_lamps.cpp:62:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |             scanf("%d%d",&a,&b);
      |             ~~~~~^~~~~~~~~~~~~~
street_lamps.cpp:70:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |             scanf("%d",&a);
      |             ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 385 ms 23440 KB Output is correct
2 Correct 309 ms 23612 KB Output is correct
3 Correct 260 ms 22668 KB Output is correct
4 Correct 320 ms 29232 KB Output is correct
5 Correct 294 ms 28292 KB Output is correct
6 Correct 308 ms 32904 KB Output is correct
7 Correct 326 ms 29764 KB Output is correct
8 Correct 167 ms 15284 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 345 ms 43376 KB Output is correct
6 Correct 351 ms 38396 KB Output is correct
7 Correct 361 ms 28196 KB Output is correct
8 Correct 305 ms 14888 KB Output is correct
9 Correct 230 ms 11564 KB Output is correct
10 Correct 258 ms 14984 KB Output is correct
11 Correct 247 ms 15420 KB Output is correct
12 Correct 449 ms 28612 KB Output is correct
13 Correct 309 ms 14908 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 403 ms 22228 KB Output is correct
6 Correct 431 ms 25804 KB Output is correct
7 Correct 333 ms 33568 KB Output is correct
8 Correct 315 ms 35236 KB Output is correct
9 Correct 253 ms 26504 KB Output is correct
10 Correct 257 ms 28684 KB Output is correct
11 Correct 265 ms 28244 KB Output is correct
12 Correct 248 ms 30036 KB Output is correct
13 Correct 265 ms 28716 KB Output is correct
14 Correct 242 ms 29936 KB Output is correct
15 Correct 467 ms 33968 KB Output is correct
16 Correct 313 ms 19376 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 385 ms 23440 KB Output is correct
9 Correct 309 ms 23612 KB Output is correct
10 Correct 260 ms 22668 KB Output is correct
11 Correct 320 ms 29232 KB Output is correct
12 Correct 294 ms 28292 KB Output is correct
13 Correct 308 ms 32904 KB Output is correct
14 Correct 326 ms 29764 KB Output is correct
15 Correct 167 ms 15284 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 345 ms 43376 KB Output is correct
21 Correct 351 ms 38396 KB Output is correct
22 Correct 361 ms 28196 KB Output is correct
23 Correct 305 ms 14888 KB Output is correct
24 Correct 230 ms 11564 KB Output is correct
25 Correct 258 ms 14984 KB Output is correct
26 Correct 247 ms 15420 KB Output is correct
27 Correct 449 ms 28612 KB Output is correct
28 Correct 309 ms 14908 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 403 ms 22228 KB Output is correct
34 Correct 431 ms 25804 KB Output is correct
35 Correct 333 ms 33568 KB Output is correct
36 Correct 315 ms 35236 KB Output is correct
37 Correct 253 ms 26504 KB Output is correct
38 Correct 257 ms 28684 KB Output is correct
39 Correct 265 ms 28244 KB Output is correct
40 Correct 248 ms 30036 KB Output is correct
41 Correct 265 ms 28716 KB Output is correct
42 Correct 242 ms 29936 KB Output is correct
43 Correct 467 ms 33968 KB Output is correct
44 Correct 313 ms 19376 KB Output is correct
45 Correct 253 ms 20024 KB Output is correct
46 Correct 192 ms 19296 KB Output is correct
47 Correct 223 ms 22716 KB Output is correct
48 Correct 381 ms 33604 KB Output is correct
49 Execution timed out 5037 ms 18944 KB Time limit exceeded
50 Halted 0 ms 0 KB -