oj.uz

답안 #257876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257876 2020-08-04T23:25:09 Z daniel920712 가로등 (APIO19_street_lamps) C++14
100 / 100
 971 ms 225020 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <set>
#include <utility>

using namespace std;
set < pair < int , int > > how;
struct A
{
    int l,r;
    int nxl,nxr,nxt;
    int con;
}Node[80000005];
int now=1;
char temp[15];
char all[300005];
int N;
int Find(int x,int y,int here)
{
    if(here<0) return 0;
    int t;
    if(Node[here].nxt==-2)
    {
        t=Node[here].con;
        if(Node[here].l==y&&Node[here].r==y) return t;
        else if(y<=(Node[here].l+Node[here].r)/2) t+=Find(x,y,Node[here].nxl);
        else t+=Find(x,y,Node[here].nxr);
    }
    else
    {
        t=Node[here].con;
        t+=Find(x,y,Node[here].nxt);
        if(Node[here].l==x&&Node[here].r==x) return t;
        else if(x<=(Node[here].l+Node[here].r)/2) t+=Find(x,y,Node[here].nxl);
        else t+=Find(x,y,Node[here].nxr);
    }
    return t;
}
void build(int l,int r,int con,int here)
{
    Node[here].l=l;
    Node[here].r=r;
    Node[here].nxt=con;
    Node[here].nxl=-1;
    Node[here].nxr=-1;
    Node[here].con=0;
}
void cha(int l1,int r1,int l2,int r2,int con,int here)
{
    int t;
    if(Node[here].nxt==-2)
    {
        if(Node[here].l==l2&&Node[here].r==r2)
        {
            Node[here].con+=con;
            return ;
        }
        if(r2<=(Node[here].l+Node[here].r)/2)
        {
            if(Node[here].nxl==-1)
            {
                Node[here].nxl=now++;
                build(Node[here].l,(Node[here].l+Node[here].r)/2,-2,Node[here].nxl);
            }
            cha(l1,r1,l2,r2,con,Node[here].nxl);
        }
        else if(l2>(Node[here].l+Node[here].r)/2)
        {
            if(Node[here].nxr==-1)
            {
                Node[here].nxr=now++;
                build((Node[here].l+Node[here].r)/2+1,Node[here].r,-2,Node[here].nxr);
            }
            cha(l1,r1,l2,r2,con,Node[here].nxr);
        }
        else
        {
            if(Node[here].nxl==-1)
            {
                Node[here].nxl=now++;
                build(Node[here].l,(Node[here].l+Node[here].r)/2,-2,Node[here].nxl);
            }
            if(Node[here].nxr==-1)
            {
                Node[here].nxr=now++;
                build((Node[here].l+Node[here].r)/2+1,Node[here].r,-2,Node[here].nxr);
            }
            cha(l1,r1,l2,(Node[here].l+Node[here].r)/2,con,Node[here].nxl);
            cha(l1,r1,(Node[here].l+Node[here].r)/2+1,r2,con,Node[here].nxr);
        }
    }
    else
    {
        if(Node[here].l==l1&&Node[here].r==r1)
        {
            if(Node[here].nxt==-1)
            {
                Node[here].nxt=now++;
                build(0,300001,-2,Node[here].nxt);
            }
            cha(l1,r1,l2,r2,con,Node[here].nxt);
            return;
        }
        if(r1<=(Node[here].l+Node[here].r)/2)
        {
            if(Node[here].nxl==-1)
            {
                Node[here].nxl=now++;
                build(Node[here].l,(Node[here].l+Node[here].r)/2,-1,Node[here].nxl);
            }
            cha(l1,r1,l2,r2,con,Node[here].nxl);
        }
        else if(l1>(Node[here].l+Node[here].r)/2)
        {
            if(Node[here].nxr==-1)
            {
                Node[here].nxr=now++;
                build((Node[here].l+Node[here].r)/2+1,Node[here].r,-1,Node[here].nxr);
            }
            cha(l1,r1,l2,r2,con,Node[here].nxr);
        }
        else
        {
            if(Node[here].nxl==-1)
            {
                Node[here].nxl=now++;
                build(Node[here].l,(Node[here].l+Node[here].r)/2,-1,Node[here].nxl);
            }
            if(Node[here].nxr==-1)
            {
                Node[here].nxr=now++;
                build((Node[here].l+Node[here].r)/2+1,Node[here].r,-1,Node[here].nxr);
            }
            cha(l1,(Node[here].l+Node[here].r)/2,l2,r2,con,Node[here].nxl);
            cha((Node[here].l+Node[here].r)/2+1,r1,l2,r2,con,Node[here].nxr);
        }
    }
}
int main()
{
    //freopen("17","rt",stdin);
    int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
    scanf("%d %d",&N,&M);
    scanf("%s",all+1);
    build(0,300001,-1,0);
    l=1;
    r=0;
    for(i=1;i<=N;i++)
    {
        if(all[i]=='1') r=i;
        else
        {
            if(r>=l)
            {
                how.insert(make_pair(l,r));
                cha(l,r+1,l,r+1,M,0);
            }
            l=i+1;
            r=i;
        }
    }
    if(r>=l)
    {
        how.insert(make_pair(l,r));
        cha(l,r+1,l,r+1,M,0);
    }

    for(i=1;i<=M;i++)
    {
        scanf("%s",temp);
        if(temp[0]=='t')
        {
            scanf("%d",&where);
            if(all[where]=='0')
            {
                if(how.empty())
                {
                    cha(where,where,where+1,where+1,M-i,0);
                    how.insert(make_pair(where,where));
                    all[where]=(1-(all[where]-'0'))+'0';
                    continue;
                }
                auto a=how.lower_bound(make_pair(where+1,where));
                auto b=prev(a);
                //printf("aa\n");
                r1=where;
                l2=where+1;
                if(a==how.end()||all[where+1]=='0') r2=where+1;
                else r2=a->second+1;
                if(a==how.begin()||all[where-1]=='0') l1=where;
                else l1=b->first;
                if(r2!=where+1) how.erase(a);
                if(l1!=where) how.erase(b);
                if(r2-1>=l1) how.insert(make_pair(l1,r2-1));
                //printf("%d %d %d %d\n",l1,r1,l2,r2);
                cha(l1,r1,l2,r2,M-i,0);
            }
            else
            {
                auto a=prev(how.lower_bound(make_pair(where+1,where)));
                l1=a->first;
                r1=where;
                l2=where+1;
                r2=a->second+1;
                how.erase(a);
                if(r1-1>=l1) how.insert(make_pair(l1,r1-1));
                if(r2-1>=l2) how.insert(make_pair(l2,r2-1));
                cha(l1,r1,l2,r2,i-M,0);
            }
            all[where]=(1-(all[where]-'0'))+'0';
        }
        else
        {
            scanf("%d %d",&l,&r);
            ok=1;
            if(how.lower_bound(make_pair(l+1,r))!=how.begin()&&prev(how.lower_bound(make_pair(l+1,r)))->first<=l&&prev(how.lower_bound(make_pair(l+1,r)))->second>=r-1) ok=1;
            else ok=0;
            printf("%d\n",max(Find(l,r,0)-(M-i)*ok,0));
        }

    }
    return 0;
}

Compilation message

street_lamps.cpp: In function 'void cha(int, int, int, int, int, int)':
street_lamps.cpp:51:9: warning: unused variable 't' [-Wunused-variable]
     int t;
         ^
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:143:11: warning: unused variable 't' [-Wunused-variable]
     int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
           ^
street_lamps.cpp:143:31: warning: unused variable 'j' [-Wunused-variable]
     int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
                               ^
street_lamps.cpp:143:33: warning: unused variable 'k' [-Wunused-variable]
     int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
                                 ^
street_lamps.cpp:143:41: warning: unused variable 'ok1' [-Wunused-variable]
     int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
                                         ^~~
street_lamps.cpp:143:47: warning: unused variable 'ok2' [-Wunused-variable]
     int M,t,l,r,l1,r1,l2,r2,i,j,k,where,ok1=0,ok2=0,ok;
                                               ^~~
street_lamps.cpp:144:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&M);
     ~~~~~^~~~~~~~~~~~~~~
street_lamps.cpp:145:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",all+1);
     ~~~~~^~~~~~~~~~~~
street_lamps.cpp:171:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",temp);
         ~~~~~^~~~~~~~~~~
street_lamps.cpp:174:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&where);
             ~~~~~^~~~~~~~~~~~~
street_lamps.cpp:215:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d",&l,&r);
             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 286 ms 1528 KB Output is correct
2 Correct 319 ms 1784 KB Output is correct
3 Correct 432 ms 7416 KB Output is correct
4 Correct 868 ms 131960 KB Output is correct
5 Correct 971 ms 179704 KB Output is correct
6 Correct 873 ms 139768 KB Output is correct
7 Correct 154 ms 1272 KB Output is correct
8 Correct 183 ms 2680 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1024 KB Output is correct
2 Correct 2 ms 1024 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 872 ms 225020 KB Output is correct
6 Correct 943 ms 212880 KB Output is correct
7 Correct 902 ms 179168 KB Output is correct
8 Correct 176 ms 2680 KB Output is correct
9 Correct 169 ms 1272 KB Output is correct
10 Correct 183 ms 1400 KB Output is correct
11 Correct 180 ms 1528 KB Output is correct
12 Correct 154 ms 1272 KB Output is correct
13 Correct 173 ms 2680 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 675 ms 87444 KB Output is correct
6 Correct 776 ms 114424 KB Output is correct
7 Correct 818 ms 139128 KB Output is correct
8 Correct 898 ms 165928 KB Output is correct
9 Correct 266 ms 1144 KB Output is correct
10 Correct 236 ms 632 KB Output is correct
11 Correct 266 ms 1176 KB Output is correct
12 Correct 226 ms 512 KB Output is correct
13 Correct 264 ms 1148 KB Output is correct
14 Correct 227 ms 640 KB Output is correct
15 Correct 146 ms 1272 KB Output is correct
16 Correct 173 ms 2680 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 286 ms 1528 KB Output is correct
9 Correct 319 ms 1784 KB Output is correct
10 Correct 432 ms 7416 KB Output is correct
11 Correct 868 ms 131960 KB Output is correct
12 Correct 971 ms 179704 KB Output is correct
13 Correct 873 ms 139768 KB Output is correct
14 Correct 154 ms 1272 KB Output is correct
15 Correct 183 ms 2680 KB Output is correct
16 Correct 2 ms 1024 KB Output is correct
17 Correct 2 ms 1024 KB Output is correct
18 Correct 2 ms 896 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 872 ms 225020 KB Output is correct
21 Correct 943 ms 212880 KB Output is correct
22 Correct 902 ms 179168 KB Output is correct
23 Correct 176 ms 2680 KB Output is correct
24 Correct 169 ms 1272 KB Output is correct
25 Correct 183 ms 1400 KB Output is correct
26 Correct 180 ms 1528 KB Output is correct
27 Correct 154 ms 1272 KB Output is correct
28 Correct 173 ms 2680 KB Output is correct
29 Correct 2 ms 640 KB Output is correct
30 Correct 2 ms 640 KB Output is correct
31 Correct 2 ms 768 KB Output is correct
32 Correct 2 ms 896 KB Output is correct
33 Correct 675 ms 87444 KB Output is correct
34 Correct 776 ms 114424 KB Output is correct
35 Correct 818 ms 139128 KB Output is correct
36 Correct 898 ms 165928 KB Output is correct
37 Correct 266 ms 1144 KB Output is correct
38 Correct 236 ms 632 KB Output is correct
39 Correct 266 ms 1176 KB Output is correct
40 Correct 226 ms 512 KB Output is correct
41 Correct 264 ms 1148 KB Output is correct
42 Correct 227 ms 640 KB Output is correct
43 Correct 146 ms 1272 KB Output is correct
44 Correct 173 ms 2680 KB Output is correct
45 Correct 146 ms 888 KB Output is correct
46 Correct 181 ms 760 KB Output is correct
47 Correct 464 ms 55928 KB Output is correct
48 Correct 801 ms 131448 KB Output is correct
49 Correct 185 ms 1068 KB Output is correct
50 Correct 180 ms 1016 KB Output is correct
51 Correct 190 ms 1060 KB Output is correct
52 Correct 186 ms 1016 KB Output is correct
53 Correct 177 ms 1016 KB Output is correct
54 Correct 195 ms 1072 KB Output is correct