# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
880126 |
2023-11-28T19:31:03 Z |
OAleksa |
Sails (IOI07_sails) |
C++14 |
|
385 ms |
19284 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int maxn = 1e6 + 69;
int n, a[maxn], b[maxn], st[4 * maxn], lzy[4 * maxn];
void push(int v) {
if (lzy[v] > 0) {
lzy[v * 2] += lzy[v];
lzy[v * 2 + 1] += lzy[v];
st[v * 2] += lzy[v];
st[v * 2 + 1] += lzy[v];
lzy[v] = 0;
}
}
void upd(int v, int tl, int tr, int l, int r, int val) {
if (tl > r || tr < l)
return;
else if (tl >= l && tr <= r) {
lzy[v] += val;
st[v] += val;
}
else {
push(v);
int mid = (tl + tr) / 2;
upd(v * 2, tl, mid, l, r, val);
upd(v * 2 + 1, mid + 1, tr, l, r, val);
st[v] = max(st[v * 2], st[v * 2 + 1]);
}
}
int qry(int v, int tl, int tr, int pos) {
if (tl == tr)
return st[v];
else {
int mid = (tl + tr) / 2;
push(v);
if (pos <= mid)
return qry(v * 2, tl, mid, pos);
else
return qry(v * 2 + 1, mid + 1, tr, pos);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n;
for (int i = 1;i <= n;i++)
cin >> a[i] >> b[i];
sort(a + 1, a + n + 1);
const int m = 1e6;
for (int i = 1;i <= n;i++) {
//range od [1, a[i]]
//popunjavam [a[i] - b[i] + 1, a[i]]
int l = a[i] - b[i] + 1, r = a[i];
int x = qry(1, 1, m, l), y = -1;
if (b[i] != a[i])
y = qry(1, 1, m, l - 1);
if (x == y) {
//ovde neko sranje tolko ne radi lol
int l1 = 1, r1 = r, id1 = 0;
while (l1 <= r1) {
int mid = (l1 + r1) / 2;
if (qry(1, 1, m, mid) > x) {
id1 = mid;
l1 = mid + 1;
}
else
r1 = mid - 1;
}
id1++;
l1 = 1, r1 = r;
int id2 = r;
while (l1 <= r1) {
int mid = (l1 + r1) / 2;
if (qry(1, 1, m, mid) > x - 1) {
id2 = mid;
l1 = mid + 1;
}
else
r1 = mid - 1;
}
int d = id2 - x + 1;
upd(1, 1, m, id1, id1 + d - 1, 1);
upd(1, 1, m, id2 + 1, r, 1);
}
else
upd(1, 1, m, l, r, 1);
}
int ans = 0;
for (int i = 1;i <= m;i++) {
int x = qry(1, 1, m, i);
ans += x * (x - 1) / 2;
}
cout << ans;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
79 ms |
12632 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
73 ms |
12808 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
72 ms |
12784 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
72 ms |
12824 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
77 ms |
10880 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
99 ms |
17744 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
142 ms |
17740 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
216 ms |
18124 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
345 ms |
16436 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
349 ms |
19284 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
385 ms |
17980 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |