| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 159782 | karma | Sails (IOI07_sails) | C++14 | 105 ms | 3192 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define FileName "test"
#define ll long long
#define pb emplace_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair<ll, ll> pii;
const int N = int(1e5) + 5;
int n, x, low, pos, high, mid;
pii a[N];
int t[N];
void Update(int x, int val) {for(; x < N; x += (x & -x)) t[x] += val;}
int Get(int x) {int res = 0; for(; x > 0; x -= (x & -x)) res += t[x]; return res;}
void Update(int l, int r, int val) {
if(l > r) return;
//cout << l << ' ' << r << '\n';
Update(l, val); Update(r + 1, -val);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen(FileName".inp", "r")) {
freopen(FileName".inp", "r", stdin);
freopen(FileName".out", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; ++i) cin >> a[i].fi >> a[i].se;
sort(a + 1, a + n + 1);
/// t1 >= t2 >= t3 >= ... >= tn
for(int i = 1; i <= n; ++i) {
x = Get(a[i].fi - a[i].se + 1);
low = 1, high = a[i].fi - a[i].se + 1;
while(low <= high) {
mid = (low + high) >> 1;
if(Get(mid) > x) low = mid + 1;
else high = mid - 1;
}
pos = low, low = a[i].fi - a[i].se + 1, high = a[i].fi;
while(low <= high) {
mid = (low + high) >> 1;
if(Get(mid) == x) low = mid + 1;
else high = mid - 1;
}
Update(low, a[i].fi, 1);
/// a[i].fi - a[i].se + 1 -> a[i].fi
/// a[i].fi - a[i].se + 1 -> low - 1, low -> a[i].fi
Update(pos, pos + low - (a[i].fi - a[i].se + 1) - 1, 1);
}
ll res = 0;
for(int i = N - 1; i >= 1; --i) {
x = Get(i);
res += 1ll * x * (x - 1) / 2;
}
cout << res;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
