# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
279697 | patrikpavic2 | Pairs (IOI07_pairs) | C++17 | 50 ms | 2156 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair < int, int > pii;
const int N = 3e5 + 500;
const int OFF = 1e5 + 500;
const int M = 80;
int loga[N], B, n, m, D;
inline int trans(int x){
return max(min(x + OFF, N - 1), 0);
}
void add(int x, int y){
x = trans(x);
for(; x < N ; x += x & -x)
loga[x] += y;
}
int query(int x){
int ret = 0;
x = trans(x);
for(; x ; x -= x & -x)
ret += loga[x];
return ret;
}
int main(){
scanf("%d%d%d%d", &B, &n, &D, &m);
if(B == 1){
vector < int > v;
for(int i = 0;i < n;i++){
int x; scanf("%d", &x);
v.PB(x);
}
sort(v.begin(), v.end());
int l = 0, r = 0, cur = 0;
ll sol = 0;
for(int i = 0;i < n;i++){
while(v[i] - v[l] > D)
cur--, l++;
while(r < n && v[r] - v[i] <= D)
cur++, r++;
sol += cur;
}
printf("%lld\n", (sol - n) / 2);
}
if(B == 2){
vector < pii > v;
for(int i = 0;i < n;i++){
int x, y; scanf("%d%d", &x, &y);
v.PB({x + y, x - y});
}
sort(v.begin(), v.end());
int l = 0, r = 0;
ll sol = 0;
for(int i = 0;i < n;i++){
while(v[i].X - v[l].X > D)
add(v[l++].Y, -1);
while(r < n && v[r].X - v[i].X <= D)
add(v[r++].Y, 1);
sol += query(v[i].Y + D) - query(v[i].Y - D - 1);
}
printf("%lld\n", (sol - n) / 2);
}
return 0;
}
컴파일 시 표준 에러 (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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |