| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 731950 |
2023-04-28T07:34:10 Z |
GrindMachine |
Pairs (IOI07_pairs) |
C++17 |
|
4000 ms |
14916 KB |
// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
template<typename T>
struct fenwick {
int siz;
vector<T> tree;
fenwick(int n) {
siz = n;
tree = vector<T>(n + 1);
}
int lsb(int x) {
return x & -x;
}
void build(vector<T> &a, int n) {
for (int i = 1; i <= n; ++i) {
int par = i + lsb(i);
tree[i] += a[i];
if (par <= siz) {
tree[par] += tree[i];
}
}
}
void pupd(int i, T v) {
while (i <= siz) {
tree[i] += v;
i += lsb(i);
}
}
T sum(int i) {
T res = 0;
while (i) {
res += tree[i];
i -= lsb(i);
}
return res;
}
T query(int l, int r) {
if (l > r) return 0;
T res = sum(r) - sum(l - 1);
return res;
}
};
void solve(int test_case)
{
ll b, n, d, m; cin >> b >> n >> d >> m;
if (b == 1) {
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
ll ans = 0;
ll ptr = 0;
rep(i, n) {
while (a[i] - a[ptr] > d) {
ptr++;
}
ans += i - ptr;
}
cout << ans << endl;
}
else if (b == 2) {
vector<pll> a(n);
rep(i, n) cin >> a[i].ff >> a[i].ss;
rep(i, n) {
ll x = a[i].ff + a[i].ss;
ll y = a[i].ff - a[i].ss;
a[i] = {x, y + m};
}
vector<ll> here[2 * m + 5];
vector<pll> queries[2 * m + 5];
fenwick<ll> fenw(2 * m + 5);
rep(i, n) {
auto [x, y] = a[i];
here[x].pb(y);
ll x2 = x - d - 1;
if (x2 >= 0) {
queries[x2].pb({y, -1});
}
}
ll ans = 0;
rep(x, 2 * m + 5) {
trav(y, here[x]) {
ll l = max(y - d, 1ll), r = min(y + d, 2 * m);
ans += fenw.query(l, r);
fenw.pupd(y, 1);
}
for (auto [y, c] : queries[x]) {
ll lx = max(y - d, 1ll), rx = min(y + d, 2 * m);
ans += fenw.query(lx, rx) * c;
}
}
cout << ans << endl;
}
else {
vector<vector<ll>> a(n, vector<ll>(b));
rep(i, n) rep(j, b) cin >> a[i][j];
ll ans = 0;
rep(i, n) {
for (int j = i + 1; j < n; ++j) {
ll dis = 0;
rep(k, b) {
dis += abs(a[i][k] - a[j][k]);
}
ans += (dis <= d);
}
}
cout << ans << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
13 ms |
1108 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
17 ms |
980 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
1108 KB |
Output is correct |
| 2 |
Correct |
18 ms |
1108 KB |
Output is correct |
| 3 |
Correct |
19 ms |
1108 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8532 KB |
Output is correct |
| 2 |
Correct |
6 ms |
8532 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
5276 KB |
Output is correct |
| 2 |
Correct |
23 ms |
3912 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
5892 KB |
Output is correct |
| 2 |
Correct |
25 ms |
6028 KB |
Output is correct |
| 3 |
Correct |
25 ms |
6504 KB |
Output is correct |
| 4 |
Correct |
26 ms |
5844 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
81 ms |
14352 KB |
Output is correct |
| 2 |
Correct |
68 ms |
14916 KB |
Output is correct |
| 3 |
Correct |
49 ms |
13768 KB |
Output is correct |
| 4 |
Correct |
39 ms |
14152 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4062 ms |
5716 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4067 ms |
5716 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4043 ms |
5716 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
