oj.uz

답안 #779532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779532 2023-07-11T13:54:41 Z sofija6 Examination (JOI19_examination) C++14
43 / 100
 3000 ms 27288 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
pair<ll,ll> a[MAXN],b[MAXN];
vector<ll> sums;
unordered_map<ll,ll> comp;
ll n,q,x[MAXN],y[MAXN],z[MAXN],len,cntind[MAXN],ans[MAXN],sumab[MAXN];
bool Cmp(pair<ll,ll> p1,pair<ll,ll> p2)
{
    return p1.first>p2.first;
}
ll Find_Pos(ll x,pair<ll,ll> *p)
{
    ll l=1,r=n,mid,ans=0;
    while (l<=r)
    {
        mid=(l+r)/2;
        if (p[mid].first>=x)
        {
            ans=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    return ans;
}
struct bit
{
    vector<ll> sum;
    void Init()
    {
        sum.resize(2*MAXN);
    }
    void Add(ll pos,ll val)
    {
        for (ll i=pos;i<2*MAXN;i+=i&(-i))
            sum[i]+=val;
    }
    ll Calc(ll pos)
    {
        ll ans=0;
        for (ll i=pos;i>0;i-=i&(-i))
            ans+=sum[i];
        return ans;
    }
    ll Query(ll l,ll r)
    {
        return Calc(r)-Calc(l-1);
    }
};
bit B;
struct query
{
    ll l,r,ind;
};
query qq[MAXN];
bool Cmp_Query(query q1,query q2)
{
    if (q1.l/len!=q2.l/len)
        return q1.l/len<q2.l/len;
    return q1.r<q2.r;
}
void Add(ll pos,pair<ll,ll> *p)
{
    ll i=p[pos].second;
    cntind[i]++;
    if (cntind[i]==2)
        B.Add(comp[sumab[i]],1);
}
void Remove(ll pos,pair<ll,ll> *p)
{
    ll i=p[pos].second;
    cntind[i]--;
    if (cntind[i]==1)
        B.Add(comp[sumab[i]],-1);
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> q;
    len=sqrt(n);
    for (ll i=1;i<=n;i++)
    {
        cin >> a[i].first >> b[i].first;
        a[i].second=b[i].second=i;
        sumab[i]=a[i].first+b[i].first;
        sums.push_back(sumab[i]);
    }
    sort(a+1,a+1+n,Cmp);
    sort(b+1,b+1+n,Cmp);
    for (ll i=1;i<=q;i++)
    {
        cin >> x[i] >> y[i] >> z[i];
        sums.push_back(z[i]);
    }
    sort(sums.begin(),sums.end());
    ll cnt=1;
    for (auto i : sums)
        comp[i]=cnt++;
    for (ll i=1;i<=q;i++)
    {
        qq[i].l=Find_Pos(x[i],a);
        qq[i].r=Find_Pos(y[i],b);
        qq[i].ind=i;
    }
    sort(qq+1,qq+1+q,Cmp_Query);
    ll curl=0,curr=0;
    B.Init();
    for (ll i=1;i<=q;i++)
    {
        while (curl<qq[i].l)
        {
            curl++;
            Add(curl,a);
        }
        while (curr<qq[i].r)
        {
            curr++;
            Add(curr,b);
        }
        while (curl>qq[i].l)
        {
            Remove(curl,a);
            curl--;
        }
        while (curr>qq[i].r)
        {
            Remove(curr,b);
            curr--;
        }
        ans[qq[i].ind]=B.Query(comp[z[qq[i].ind]],2*MAXN-1);
    }
    for (ll i=1;i<=q;i++)
        cout << ans[i] << "\n";
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 15 ms 2732 KB Output is correct
8 Correct 15 ms 2644 KB Output is correct
9 Correct 18 ms 2732 KB Output is correct
10 Correct 14 ms 2684 KB Output is correct
11 Correct 6 ms 2644 KB Output is correct
12 Correct 4 ms 2288 KB Output is correct
13 Correct 18 ms 2564 KB Output is correct
14 Correct 18 ms 2544 KB Output is correct
15 Correct 16 ms 2532 KB Output is correct
16 Correct 5 ms 2408 KB Output is correct
17 Correct 14 ms 2644 KB Output is correct
18 Correct 4 ms 2276 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2741 ms 18896 KB Output is correct
2 Correct 2709 ms 19604 KB Output is correct
3 Correct 2755 ms 19604 KB Output is correct
4 Correct 2103 ms 18536 KB Output is correct
5 Correct 158 ms 18480 KB Output is correct
6 Correct 112 ms 15324 KB Output is correct
7 Correct 804 ms 19512 KB Output is correct
8 Correct 759 ms 19520 KB Output is correct
9 Correct 465 ms 19432 KB Output is correct
10 Correct 107 ms 18352 KB Output is correct
11 Correct 1981 ms 18404 KB Output is correct
12 Correct 57 ms 14912 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2741 ms 18896 KB Output is correct
2 Correct 2709 ms 19604 KB Output is correct
3 Correct 2755 ms 19604 KB Output is correct
4 Correct 2103 ms 18536 KB Output is correct
5 Correct 158 ms 18480 KB Output is correct
6 Correct 112 ms 15324 KB Output is correct
7 Correct 804 ms 19512 KB Output is correct
8 Correct 759 ms 19520 KB Output is correct
9 Correct 465 ms 19432 KB Output is correct
10 Correct 107 ms 18352 KB Output is correct
11 Correct 1981 ms 18404 KB Output is correct
12 Correct 57 ms 14912 KB Output is correct
13 Correct 2902 ms 22284 KB Output is correct
14 Correct 2652 ms 21932 KB Output is correct
15 Correct 2577 ms 19612 KB Output is correct
16 Correct 2197 ms 20964 KB Output is correct
17 Correct 172 ms 20900 KB Output is correct
18 Correct 122 ms 15300 KB Output is correct
19 Correct 2713 ms 22340 KB Output is correct
20 Correct 2642 ms 22032 KB Output is correct
21 Correct 1422 ms 22280 KB Output is correct
22 Correct 108 ms 18348 KB Output is correct
23 Correct 2136 ms 18392 KB Output is correct
24 Correct 56 ms 14936 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 15 ms 2732 KB Output is correct
8 Correct 15 ms 2644 KB Output is correct
9 Correct 18 ms 2732 KB Output is correct
10 Correct 14 ms 2684 KB Output is correct
11 Correct 6 ms 2644 KB Output is correct
12 Correct 4 ms 2288 KB Output is correct
13 Correct 18 ms 2564 KB Output is correct
14 Correct 18 ms 2544 KB Output is correct
15 Correct 16 ms 2532 KB Output is correct
16 Correct 5 ms 2408 KB Output is correct
17 Correct 14 ms 2644 KB Output is correct
18 Correct 4 ms 2276 KB Output is correct
19 Correct 2741 ms 18896 KB Output is correct
20 Correct 2709 ms 19604 KB Output is correct
21 Correct 2755 ms 19604 KB Output is correct
22 Correct 2103 ms 18536 KB Output is correct
23 Correct 158 ms 18480 KB Output is correct
24 Correct 112 ms 15324 KB Output is correct
25 Correct 804 ms 19512 KB Output is correct
26 Correct 759 ms 19520 KB Output is correct
27 Correct 465 ms 19432 KB Output is correct
28 Correct 107 ms 18352 KB Output is correct
29 Correct 1981 ms 18404 KB Output is correct
30 Correct 57 ms 14912 KB Output is correct
31 Correct 2902 ms 22284 KB Output is correct
32 Correct 2652 ms 21932 KB Output is correct
33 Correct 2577 ms 19612 KB Output is correct
34 Correct 2197 ms 20964 KB Output is correct
35 Correct 172 ms 20900 KB Output is correct
36 Correct 122 ms 15300 KB Output is correct
37 Correct 2713 ms 22340 KB Output is correct
38 Correct 2642 ms 22032 KB Output is correct
39 Correct 1422 ms 22280 KB Output is correct
40 Correct 108 ms 18348 KB Output is correct
41 Correct 2136 ms 18392 KB Output is correct
42 Correct 56 ms 14936 KB Output is correct
43 Execution timed out 3064 ms 27288 KB Time limit exceeded
44 Halted 0 ms 0 KB -