| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 575462 | keta_tsimakuridze | Sails (IOI07_sails) | C++17 | 118 ms | 2288 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
using namespace std;
const int N = 2e5 + 5;
int n, c[N], tree[N], H;
void upd(int id, int t) {
for(id; id <= H; id += id & (-id)) tree[id] += t;
}
int get(int id) {
int ans =0;
for(id; id >= 1; id -= id & (-id)) ans += tree[id];
return ans;
}
int main() {
cin >> n;
vector<pair<int,int> > v;
for(int i = 1; i <= n; i++) {
int h, k; cin >> h >> k;
v.push_back({h, k});
H = max(H, h);
}
sort(v.begin(), v.end());
for(int i = 0; i < v.size(); i++) {
int k = v[i].s, h = v[i].f;
// h - k + 1
int cn = get(h - k + 1);
int l = 1, r = h - k + 1, L = 0;
while(l <= r) {
int mid = (l + r) / 2;
if(get(mid) == cn) L = mid, r = mid - 1;
else l = mid + 1;
}
l = h - k + 1, r = h;
int R = 0;
while(l <= r) {
int mid = (l + r) / 2;
if(get(mid) == cn) R = mid, l = mid + 1;
else r = mid - 1;
}
// cout << "++" << get(3) << " " << get(2) << endl;
//cout << k << " " << h << " " << R + 1 << " " << h << endl;
upd(R + 1, 1); upd(h + 1, -1);
k -= h - R;
// cout << L << " " << L + k << endl;
upd(L, 1); upd(L + k, -1);
}
ll ans = 0;
for(int i = 1; i <= H; i++) {
int cn = get(i);
ans += (ll)cn * (cn - 1)/ 2;
}
cout << ans;
}
컴파일 시 표준 에러 (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... | ||||
