QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#149625 | #6136. Airdrop | pooty# | TL | 0ms | 3468kb | C++20 | 2.3kb | 2023-08-24 23:45:18 | 2023-08-24 23:45:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPL(i,j, n) for (int i = (j); i < (n); i++)
#define int long long
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int MAXX = 1e6;
void solve() {
int n,y0;cin>>n>>y0;
vii arr(n);
map<int, vi> events;
// parity here...
set<int> tocheck;
REP(i, n) {
int x,y;cin>>x>>y;
tocheck.insert(x);
tocheck.insert(x+1);
y -= y0;
arr[i] = {x,y};
events[x].push_back(y);
}
tocheck.insert(0);
vi checkarr;
for (auto x: tocheck) {
checkarr.push_back(x);
}
int gg = checkarr.size();
vi arrL(gg,0);
vi arrR(gg,0);
map<int, int> curman;
int curval = 0;
REPL(i, 1, gg) {
int x = checkarr[i -1];
map<int, int> mantoadd;
for (auto y: events[x]) {
mantoadd[MAXX-x+abs(y)]++;
}
for (auto [man, ct]: mantoadd) {
curval -= curman[man];
if (ct == 2) {
curman[man] = 0;
} else {
curman[man] = 1 - curman[man];
}
curval += curman[man];
}
arrL[i] = curval;
}
curval = 0;
for (int idx = gg-1; idx >=0; idx--) {
int x = checkarr[idx+1];
map<int, int> mantoadd;
for (auto y: events[x]) {
mantoadd[x+abs(y)]++;
}
for (auto [man, ct]: mantoadd) {
curval -= curman[man];
if (ct == 2) {
curman[man] = 0;
} else {
curman[man] = 1 - curman[man];
}
curval += curman[man];
}
arrR[idx] = curval;
}
// for (auto x: checkarr) {
// cout<<x<<" ";
// }cout<<"\n";
// for (auto x: arrR) {
// cout<<x<<" ";
// }cout<<"\n";
int mn = n;
int mx = 0;
REP(i, gg) {
int c = arrL[i] + arrR[i] + (int)((events[checkarr[i]]).size());
mn = min(mn, c);
mx = max(mx, c);
}
cout<<mn<<" "<<mx<<"\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t; cin >> t;
while (t--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3468kb
input:
3 3 2 1 2 2 1 3 5 3 3 2 1 2 5 4 3 2 3 1 3 4 3
output:
1 3 0 3 2 2
result:
ok 6 numbers
Test #2:
score: -100
Time Limit Exceeded
input:
3508 6 1 7 1 1 1 9 1 10 1 3 1 4 1 3 8 8 9 8 7 1 8 9 5 10 1 10 8 10 2 5 1 9 9 5 9 10 9 6 4 4 7 6 7 10 5 3 8 9 5 9 9 7 5 4 7 10 5 6 9 9 5 6 6 9 3 3 2 5 1 3 8 6 4 5 9 10 2 2 9 10 10 10 8 4 1 7 1 6 1 3 1 5 1 2 4 9 3 3 3 4 5 3 8 9 6 9 9 6 3 9 5 9 3 2 9 9 1 9 2 4 1 5 4 5 6 6 5 9 8 4 1 2 1 5 1 7 1 3 1 9 10...
output:
6 6 1 3 1 5 1 5 2 5 0 2 3 5 2 2 4 4 4 7 4 4 9 9 3 7 0 3 2 7 2 2 2 6 9 11 8 10 1 3 2 4 0 2 2 4 4 7 6 6 8 10 2 2 2 2 3 5 1 4 2 2 1 1 3 5 4 7 3 6 1 1 5 7 5 5 1 3 2 2 1 7 1 1 4 6 2 4 2 6 2 4 1 7 2 4 8 10 0 3 1 1 3 8 2 2 2 2 8 10 3 7 4 4 4 6 2 5 0 2 2 5 3 3 0 4 3 5 2 4 2 2 4 6 6 6 5 7 0 2 2 6 2 4 2 6 2 5...