oj.uz

답안 #100949

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100949 2019-03-15T11:45:54 Z shafinalam Growing Trees (BOI11_grow) C++14
0 / 100
 1000 ms 3364 KB 
#include <bits/stdc++.h>

using namespace std;

const int mx = 1e5+5;
typedef long long ll;

#define  sf scanf
#define  pf printf

int tree[mx<<2];
int lazy[mx<<2];
int arr[mx];
int n, m;

void push(int node, int b,int e)
{
    if(lazy[node])
    {
        int left = node<<1;
        int right = left|1;
        tree[node]+=((e-b+1)*lazy[node]);
        if(b!=e)
        {
            lazy[left]+=lazy[node];
            lazy[right]+=lazy[node];
        }
        lazy[node] = 0;
    }
    return;
}
void update(int node, int b, int e, int l, int r)
{
    push(node, b, e);
    if(b>r || e<l) return;
    if(b>=l && e<=r)
    {
        lazy[node]++;
        push(node, b, e);
        return;
    }
    int mid = (b+e)>>1;
    int left = node<<1;
    int right = left|1;
    update(left, b, mid, l, r);
    update(right, mid+1, e, l, r);
    tree[node] = tree[left]+tree[right];
}
int query(int node, int b, int e, int pos)
{
    push(node, b, e);
    if(b>pos || e<pos) return 0;
    if(b>=pos && e<=pos) return tree[node];
    int mid = (b+e)>>1;
    int left = node<<1;
    int right = left|1;
    return query(left, b, mid, pos)+query(right, mid+1, e, pos);
}
int get(int pos)
{
    return query(1, 1, n, pos);
}
int main()
{
    sf("%d%d", &n, &m);

    for(int i = 1; i <= n; i++) sf("%d", &arr[i]);
    sort(arr+1, arr+n+1);

    while(m--)
    {
        char type;
        cin >> type;

        if(type=='F')
        {
            int h, c;
            sf("%d%d", &c, &h);

            int lo = 1, hi = n, pos = -1;
            while(lo<=hi)
            {
                int mid = (lo+hi)>>1;
                if(arr[mid]+get(mid)>=h)
                {
                    pos = mid;
                    hi = mid-1;
                }
                else
                    lo = mid+1;
            }
            if(pos==-1) continue;
            int last = pos+c-1;
            last = min(last, n);
            if(last==n || arr[last]+get(last)!=arr[last+1]+get(last+1)) update(1, 1, n, pos, last);
            else
            {
                int l = 0, r = n+1, val = arr[last]+get(last);
                lo = 1, hi = n;
                while(lo<=hi)
                {
                    int mid = (lo+hi)>>1;
                    if(arr[mid]+get(mid)<val)
                    {
                        lo = mid+1;
                        l = mid;
                    }
                    else hi = mid-1;
                }
                lo = 1, hi = n;
                while(lo<=hi)
                {
                    int mid = (lo+hi)>>1;
                    if(arr[mid]+get(mid)>val)
                    {
                        r = mid;
                        hi = mid-1;
                    }
                    else lo = mid+1;
                }
                l++;
                r--;
                int len = last-l+1;
                update(1, 1, n, pos, l-1);
                update(1, 1, n, r-len+1, r);

            }
            //for(int i = 1; i <= n; i++) pf("%lld ", arr[i]+get(i));
            //cout << '\n';
        }
        else
        {
            int a, b;
            sf("%d%d", &a, &b);

            int l = -1, r = -1, lo = 1, hi = n;

            while(lo<=hi)
            {
                int mid = (lo+hi)>>1;
                if(arr[mid]+get(mid)>=a)
                {
                    l = mid;
                    hi = mid-1;
                }
                else lo = mid+1;
            }
            if(l==-1)
            {
                pf("0\n");
                continue;
            }
            lo = 1, hi = n;
            while(lo<=hi)
            {
                int mid = (lo+hi)>>1;
                if(arr[mid]+get(mid)<=b)
                {
                    r = mid;
                    lo = mid+1;
                }
                else hi = mid-1;
            }
            pf("%d\n", r-l+1);
        }
    }
    return 0;
}

Compilation message

grow.cpp: In function 'int main()':
grow.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     sf("%d%d", &n, &m);
       ^
grow.cpp:67:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) sf("%d", &arr[i]);
                                   ^
grow.cpp:78:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             sf("%d%d", &c, &h);
               ^
grow.cpp:134:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             sf("%d%d", &a, &b);
               ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 842 ms 3064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 512 KB Output is correct
2 Incorrect 25 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 697 ms 1036 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 539 ms 1028 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 780 ms 1964 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1044 ms 2896 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 821 ms 3080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1000 ms 3100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1032 ms 3232 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1041 ms 3364 KB Time limit exceeded