oj.uz

답안 #779479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779479 2023-07-11T13:17:08 Z sofija6 Examination (JOI19_examination) C++14
43 / 100
 3000 ms 35276 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
pair<ll,ll> a[MAXN],b[MAXN];
set<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.insert(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.insert(z[i]);
    }
    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 2772 KB Output is correct
8 Correct 15 ms 2772 KB Output is correct
9 Correct 16 ms 2720 KB Output is correct
10 Correct 14 ms 2812 KB Output is correct
11 Correct 7 ms 2772 KB Output is correct
12 Correct 4 ms 2260 KB Output is correct
13 Correct 14 ms 2532 KB Output is correct
14 Correct 14 ms 2536 KB Output is correct
15 Correct 14 ms 2516 KB Output is correct
16 Correct 5 ms 2516 KB Output is correct
17 Correct 14 ms 2812 KB Output is correct
18 Correct 2 ms 2132 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2956 ms 19976 KB Output is correct
2 Correct 2779 ms 21512 KB Output is correct
3 Correct 2783 ms 21504 KB Output is correct
4 Correct 2271 ms 19940 KB Output is correct
5 Correct 173 ms 19948 KB Output is correct
6 Correct 118 ms 13764 KB Output is correct
7 Correct 752 ms 21400 KB Output is correct
8 Correct 732 ms 21396 KB Output is correct
9 Correct 526 ms 21320 KB Output is correct
10 Correct 124 ms 19752 KB Output is correct
11 Correct 2156 ms 19880 KB Output is correct
12 Correct 65 ms 13208 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2956 ms 19976 KB Output is correct
2 Correct 2779 ms 21512 KB Output is correct
3 Correct 2783 ms 21504 KB Output is correct
4 Correct 2271 ms 19940 KB Output is correct
5 Correct 173 ms 19948 KB Output is correct
6 Correct 118 ms 13764 KB Output is correct
7 Correct 752 ms 21400 KB Output is correct
8 Correct 732 ms 21396 KB Output is correct
9 Correct 526 ms 21320 KB Output is correct
10 Correct 124 ms 19752 KB Output is correct
11 Correct 2156 ms 19880 KB Output is correct
12 Correct 65 ms 13208 KB Output is correct
13 Correct 2922 ms 26504 KB Output is correct
14 Correct 2569 ms 25672 KB Output is correct
15 Correct 2907 ms 21484 KB Output is correct
16 Correct 2296 ms 22832 KB Output is correct
17 Correct 203 ms 22848 KB Output is correct
18 Correct 121 ms 13600 KB Output is correct
19 Correct 2769 ms 26504 KB Output is correct
20 Correct 2696 ms 25912 KB Output is correct
21 Correct 1360 ms 26500 KB Output is correct
22 Correct 159 ms 19800 KB Output is correct
23 Correct 2308 ms 19788 KB Output is correct
24 Correct 66 ms 13232 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 2772 KB Output is correct
8 Correct 15 ms 2772 KB Output is correct
9 Correct 16 ms 2720 KB Output is correct
10 Correct 14 ms 2812 KB Output is correct
11 Correct 7 ms 2772 KB Output is correct
12 Correct 4 ms 2260 KB Output is correct
13 Correct 14 ms 2532 KB Output is correct
14 Correct 14 ms 2536 KB Output is correct
15 Correct 14 ms 2516 KB Output is correct
16 Correct 5 ms 2516 KB Output is correct
17 Correct 14 ms 2812 KB Output is correct
18 Correct 2 ms 2132 KB Output is correct
19 Correct 2956 ms 19976 KB Output is correct
20 Correct 2779 ms 21512 KB Output is correct
21 Correct 2783 ms 21504 KB Output is correct
22 Correct 2271 ms 19940 KB Output is correct
23 Correct 173 ms 19948 KB Output is correct
24 Correct 118 ms 13764 KB Output is correct
25 Correct 752 ms 21400 KB Output is correct
26 Correct 732 ms 21396 KB Output is correct
27 Correct 526 ms 21320 KB Output is correct
28 Correct 124 ms 19752 KB Output is correct
29 Correct 2156 ms 19880 KB Output is correct
30 Correct 65 ms 13208 KB Output is correct
31 Correct 2922 ms 26504 KB Output is correct
32 Correct 2569 ms 25672 KB Output is correct
33 Correct 2907 ms 21484 KB Output is correct
34 Correct 2296 ms 22832 KB Output is correct
35 Correct 203 ms 22848 KB Output is correct
36 Correct 121 ms 13600 KB Output is correct
37 Correct 2769 ms 26504 KB Output is correct
38 Correct 2696 ms 25912 KB Output is correct
39 Correct 1360 ms 26500 KB Output is correct
40 Correct 159 ms 19800 KB Output is correct
41 Correct 2308 ms 19788 KB Output is correct
42 Correct 66 ms 13232 KB Output is correct
43 Execution timed out 3071 ms 35276 KB Time limit exceeded
44 Halted 0 ms 0 KB -