oj.uz

Submission #292162

# Submission time Handle Problem Language Result Execution time Memory
292162 2020-09-06T13:10:14 Z Kastanda Pairs (IOI07_pairs) C++11
60 / 100
 2675 ms 100160 KB 
// M
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
template < typename T >
using ordered_set = tree < T , null_type , less < T > , rb_tree_tag, tree_order_statistics_node_update >;
const int N = 100005, MX2D = 75005, MX3D = 77;
int n, m, d, Mxd, ts, B[N], F[MX3D][MX3D][MX3D * 3];
vector < int > A[N];
ordered_set < ll > S2D[MX2D];
inline void Add2D(int a, int val)
{
        ll vl = val * (ll)(1e6) + ts; ts ++;
        for (a ++; a < MX2D; a += a & - a)
                S2D[a].insert(vl);
}
inline int Count2D(int a, int val)
{
        int rt = 0;
        ll vl = val * (ll)(1e6) - 1;
        for (; a; a -= a & - a)
                rt += (int)S2D[a].size() - S2D[a].order_of_key(vl);
        return rt;
}
inline void Add3D(int a, int b, int val)
{
        val = MX3D * 3 - val - 3;
        for (a ++; a < MX3D; a += a & - a)
                for (int d = b + 1; d < MX3D; d += d & - d)
                        for (int i = val; i < MX3D * 3; i += i & - i)
                                F[a][d][i] ++;
}
inline int Count3D(int a, int b, int val)
{
        int rt = 0;
        val = MX3D * 3 - val - 3;
        for (; a; a -= a & - a)
                for (int d = b; d; d -= d & - d)
                        for (int i = val; i; i -= i & - i)
                                rt += F[a][d][i];
        return rt;
}
int main()
{
        scanf("%d%d%d%d", &d, &n, &Mxd, &m);
        if (d == 1)
        {
                ll tot = 0;
                for (int i = 1; i <= n; i ++)
                        scanf("%d", &B[i]);
                sort(B + 1, B + n + 1);
                for (int i = 1; i <= n; i ++)
                        tot += (int)(upper_bound(B + 1, B + n + 1, B[i] + Mxd) - B) - i - 1;
                return !printf("%lld\n", tot);
        }
        for (int i = 1; i <= n; i ++)
        {
                A[i] = vector < int > (d, 0);
                for (int j = 0; j < d; j ++)
                        scanf("%d", &A[i][j]);
        }
        sort(A + 1, A + n + 1);
        if (d == 2)
        {
                ll tot = 0;
                for (int wy = 0; wy < 2; wy ++)
                {
                        for (int i = 1; i <= n; i ++)
                        {
                                int vl = A[i][0] + A[i][1];
                                tot += Count2D(A[i][1] + wy, vl - Mxd);
                                Add2D(A[i][1], vl);
                        }
                        for (int i = 1; i <= n; i ++)
                                A[i][1] = MX2D - A[i][1] - 1;
                        for (int i = 0; i < MX2D; i ++)
                                S2D[i].clear();
                }
                return !printf("%lld\n", tot);
        }
        ll tot = 0;
        for (int wy = 0; wy < 2; wy ++)
        {
                for (int wz = 0; wz < 2; wz ++)
                {
                        for (int i = 1; i <= n; i ++)
                        {
                                int vl = A[i][0] + A[i][1] + A[i][2];
                                tot += Count3D(A[i][1] + wy, A[i][2] + wz, vl - Mxd);
                                Add3D(A[i][1], A[i][2], vl);
                        }
                        for (int i = 1; i <= n; i ++)
                                A[i][2] = MX3D - A[i][2] - 1;
                        memset(F, 0, sizeof(F));
                }
                for (int i = 1; i <= n; i ++)
                        A[i][1] = MX3D - A[i][1] - 1;
        }
        return !printf("%lld\n", tot);
}

Compilation message

pairs.cpp: In function 'int main()':
pairs.cpp:48:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |         scanf("%d%d%d%d", &d, &n, &Mxd, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pairs.cpp:53:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |                         scanf("%d", &B[i]);
      |                         ~~~~~^~~~~~~~~~~~~
pairs.cpp:63:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |                         scanf("%d", &A[i][j]);
      |                         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 10496 KB Output is correct
2 Correct 30 ms 10488 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 10872 KB Output is correct
2 Correct 39 ms 10880 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 10872 KB Output is correct
2 Correct 39 ms 10872 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 10240 KB Output is correct
2 Correct 15 ms 10368 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1266 ms 100160 KB Output is correct
2 Correct 1203 ms 100024 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2191 ms 89336 KB Output is correct
2 Correct 2301 ms 89264 KB Output is correct
3 Correct 1758 ms 90876 KB Output is correct
4 Correct 1907 ms 89464 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2675 ms 69640 KB Output is correct
2 Correct 2550 ms 69752 KB Output is correct
3 Correct 1275 ms 71928 KB Output is correct
4 Correct 1801 ms 77432 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15104 KB Output is correct
2 Incorrect 16 ms 15104 KB Output isn't correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 18936 KB Output is correct
2 Incorrect 151 ms 18808 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 18808 KB Output is correct
2 Incorrect 218 ms 19064 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 18808 KB Output is correct
2 Incorrect 231 ms 19228 KB Output isn't correct
3 Halted 0 ms 0 KB -