oj.uz

Submission #863019

# Submission time Handle Problem Language Result Execution time Memory
863019 2023-10-19T13:17:47 Z HuyQuang_re_Zero Pairs (IOI07_pairs) C++14
100 / 100
 2144 ms 282696 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define db long double
#define N 1005
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define rand(l,r) (l+rng()%(r-l+1))
using namespace std;
using namespace __gnu_pbds;
struct _1D_Problem
{
    ll n,d,x[100005],i,j,res,m;
    void Work()
    {
        cin>>n>>d>>m;
        for(i=1;i<=n;i++) cin>>x[i];
        sort(x+1,x+n+1);
        j=1;
        for(i=1;i<=n;i++)
        {
            while(x[i]-x[j]>d) j++;
            res+=i-j;
        }
        cout<<res;
    }
} Line;

struct _2D_Problem
{
    typedef tree <II,null_type,less <II>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
    struct Fenwick_Tree
    {
        ordered_set bit[75005];
        map <int,int> cnt;
        void update(int i,int k)
        {
            II x={ k,++cnt[k] };
            while(i<=75000) bit[i].insert(x),i+=(i & -i);
        }
        int get(int i,int k)
        {
            int res=0;
            while(i>=1) res+=bit[i].size()-bit[i].order_of_key({ k,0 }),i-=(i & -i);
            return res;
        }
    } SUM,SUB;

    II a[100005];
    ll n,d,m,i,res;
    void Work()
    {
        cin>>n>>d>>m;
        for(i=1;i<=n;i++) cin>>a[i].fst>>a[i].snd;
        sort(a+1,a+n+1);
        ll res=0;
        for(i=1;i<=n;i++)
        {
            res+=SUM.get(a[i].snd,a[i].fst+a[i].snd-d);
            res+=SUB.get(m,a[i].fst-a[i].snd-d)-SUB.get(a[i].snd,a[i].fst-a[i].snd-d);
            SUM.update(a[i].snd,a[i].fst+a[i].snd);
            SUB.update(a[i].snd,a[i].fst-a[i].snd);
        }
        cout<<res;
    }
} Grid;



struct _3D_Problem
{
    struct pt { int x,y,z; } a[100005];
    ll res,c[76][76][76];
    int f[76][76][76][2*75+2],x,y,z,z1,z2,i,n,m,d,step,sum;
    void Work()
    {
        cin>>n>>d>>m;
        for(i=1;i<=n;i++) cin>>a[i].x>>a[i].y>>a[i].z;
        for(step=1;step<=4;step++)
        {
            memset(f,0,sizeof(f));
            memset(c,0,sizeof(c));
            for(i=1;i<=n;i++)
            {
                f[a[i].z][a[i].x][a[i].y][a[i].x+a[i].y]++;
                c[a[i].x][a[i].y][a[i].z]++;
            }
            for(z=1;z<=m;z++)
                for(x=1;x<=m;x++)
                    for(y=1;y<=m;y++)
                        for(sum=2*m;sum>=1;sum--)
                        {
                            f[z][x][y][sum]+=f[z][x-1][y][sum];
                            f[z][x][y][sum]+=f[z][x][y-1][sum];
                            f[z][x][y][sum]+=f[z][x][y][sum+1];
                            f[z][x][y][sum]-=f[z][x-1][y-1][sum];
                            f[z][x][y][sum]-=f[z][x][y-1][sum+1];
                            f[z][x][y][sum]-=f[z][x-1][y][sum+1];
                            f[z][x][y][sum]+=f[z][x-1][y-1][sum+1];
                        }
            for(z1=1;z1<=m;z1++)
                for(z2=1;z2<=z1;z2++)
                    for(x=1;x<=m;x++)
                        for(y=1;y<=m;y++)
                        {
                            if((z1!=z2 || step<=2) &&  x+y+z1-z2-d<=2*m)
                                res+=c[x][y][z1]*f[z2][x-1][y][max(1,x+y+z1-z2-d)];
                        }

            for(i=1;i<=n;i++) swap(a[i].x,a[i].y),a[i].y=m-a[i].y+1;
        }
        for(z1=1;z1<=m;z1++)
        {
            for(x=1;x<=m;x++)
                for(y=1;y<=m;y++)
                {
                    for(z2=max(1,z1-d);z2<z1;z2++)
                        res+=c[x][y][z1]*c[x][y][z2];

                    res+=c[x][y][z1]*(c[x][y][z1]-1)/2;
                }
        }
        cout<<res<<'\n';
    }
} Cube;
int main()
{
   // freopen("pairs.inp","r",stdin);
   // freopen("pairs.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int type; cin>>type;
    if(type==1) Line.Work();
    if(type==2) Grid.Work();
    if(type==3) Cube.Work();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16988 KB Output is correct
2 Correct 8 ms 16988 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16988 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 18012 KB Output is correct
2 Correct 18 ms 18008 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 18524 KB Output is correct
2 Correct 25 ms 18556 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 18664 KB Output is correct
2 Correct 22 ms 18524 KB Output is correct
3 Correct 21 ms 18524 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18012 KB Output is correct
2 Correct 11 ms 18008 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1004 ms 190972 KB Output is correct
2 Correct 927 ms 191020 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1749 ms 168976 KB Output is correct
2 Correct 1847 ms 168560 KB Output is correct
3 Correct 1198 ms 171448 KB Output is correct
4 Correct 1396 ms 169068 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2033 ms 135012 KB Output is correct
2 Correct 2144 ms 135416 KB Output is correct
3 Correct 729 ms 133808 KB Output is correct
4 Correct 881 ms 144916 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2013 ms 280692 KB Output is correct
2 Correct 1809 ms 280912 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 281728 KB Output is correct
2 Correct 134 ms 282448 KB Output is correct
3 Correct 132 ms 282324 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 857 ms 281856 KB Output is correct
2 Correct 852 ms 282684 KB Output is correct
3 Correct 808 ms 282688 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1928 ms 281856 KB Output is correct
2 Correct 2012 ms 282672 KB Output is correct
3 Correct 1790 ms 282696 KB Output is correct