QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#292556 | #7118. Closing Time | training4usaco | 0 | 319ms | 170128kb | C++20 | 5.5kb | 2023-12-28 08:13:26 | 2023-12-28 08:13:26 |
Judging History
你现在查看的是测评时间为 2023-12-28 08:13:26 的历史记录
- [2024-04-28 08:11:26]
- 管理员手动重测本题所有提交记录
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2023-12-28 08:13:26]
- 提交
answer
#include <iostream>
#include <vector>
#include <assert.h>
using namespace std;
//#define int long long
typedef long long ll;
#define pii pair<ll, ll>
#define all(v) v.begin(), v.end()
#define ff first
#define ss second
const int MAXN = 2e5 + 5;
const int MAXM = 4e6 + 5; // implicit segtree
const ll INF = 1e18 + 7;
const ll MAX = 1e12 + 5;
ll dist[MAXN][2];
ll a[MAXN], b[MAXN]; // 2 costs
int ord[MAXN];
ll ans, ans2; // no overlap, overlap
vector<pii> adj[MAXN];
vector<int> vals;
ll have;
ll tot = 1;
ll val[MAXM], cnt[MAXM];
ll lc[MAXM], rc[MAXM];
vector<ll> costa, costb;
bool comp(int i, int j) {
if(costb[i] == costb[j]) return costa[i] < costa[j];
return costb[i] < costb[j];
}
void check() {
if(tot >= MAXM) while(true) cout << "oof";
}
void pull(ll u) {
val[u] = val[lc[u]] + val[rc[u]];
cnt[u] = cnt[lc[u]] + cnt[rc[u]];
}
void ins(ll u, ll l, ll r, ll pos, ll freq) { // segtree indexed by val so pos = val
check();
if(l == r) {
// cout << "updating with " << pos << " " << freq << endl;
val[u] += pos * freq;
cnt[u] += freq;
return;
}
ll mid = (l + r) / 2;
if(pos <= mid) {
if(lc[u] == 0) lc[u] = ++tot;
ins(lc[u], l, mid, pos, freq);
}
else {
if(rc[u] == 0) rc[u] = ++tot;
ins(rc[u], mid + 1, r, pos, freq);
}
pull(u);
}
int walk(ll u, ll l, ll r) {
if(u == 0) return 0;
// cout << u << " " << l << " " << r << " " << val[u] << " " << cnt[u] << endl;
if(l == r) {
// cout << l << " " << cnt[u] << " " << have << " " << l << endl;
ll sub = min(cnt[u], have / l);
have -= l * sub;
// cout << "returning " << sub << endl;
return sub;
}
ll mid = (l + r) / 2;
if(val[lc[u]] > have) return walk(lc[u], l, mid);
// cout << "left val: " << val[lc[u]] << " node, lc: " << u << " " << lc[u] << endl;
have -= val[lc[u]];
if(have) return cnt[lc[u]] + walk(rc[u], mid + 1, r);
return cnt[lc[u]];
}
void dfs(int u, int p, int type) {
for(auto [v, w] : adj[u]) {
if(v == p) continue;
dist[v][type] = dist[u][type] + w;
dfs(v, u, type);
}
}
int max_score(int n, int x, int y, ll k, vector<int> u, vector<int> v, vector<int> w) {
for(int i = 0; i < n - 1; ++i) {
adj[u[i]].push_back({v[i], w[i]});
adj[v[i]].push_back({u[i], w[i]});
}
dfs(x, -1, 0); dfs(y, -1, 1);
for(int i = 0; i < n; ++i) {
a[i] = min(dist[i][0], dist[i][1]);
b[i] = max(dist[i][0], dist[i][1]);
}
// seperate
vector<ll> sortedDists;
for(int i = 0; i < n; ++i) {
sortedDists.push_back(dist[i][0]); sortedDists.push_back(dist[i][1]);
}
sort(all(sortedDists));
ll tot = k;
for(auto val : sortedDists) {
if(tot >= val) {
++ans; tot -= val;
}
else break;
}
// overlap
bool flag = false;
ll distXY = dist[y][0]; // dist between x,y
// cout << "dist between x,y: " << distXY << endl;
int forced = 0;
for(int i = 0; i < n; ++i) {
ord[i] = i;
if(dist[i][0] + dist[i][1] == distXY) { // on the path
// cout << "node " << i << " is on path" << endl;
k -= a[i]; ++forced; // forced
// cout << "i: " << i << endl;
costa.push_back(b[i] - a[i]);
costb.push_back(INF);
// cout << b[i] - a[i] << endl;
ins(1, 0, MAX, b[i] - a[i], 1);
if(k < 0) flag = true;
// cout << "need " << b[i] - a[i] << " to turn to 2" << endl;
}
else {
costa.push_back(a[i]);
costb.push_back(b[i]);
ins(1, 0, MAX, a[i], 1);
}
// cout << "need " << a[i] << " for extra" << endl;
}
sort(ord, ord + n, comp);
// cout << "ord: ";
// for(int i = 0; i < n; ++i) cout << ord[i] << " "; cout << endl;
// cout << "costa: ";
// for(int i = 0; i < n; ++i) cout << costa[ord[i]] << " "; cout << endl;
// cout << "costb: ";
// for(int i = 0; i < n; ++i) cout << costb[ord[i]] << " "; cout << endl;
// cout << endl;
ll sum = 0;
have = k;
ans2 = forced + walk(1, 0, MAX);
// cout << "allmax: " << walk(1, 0, MAX) << endl;
// cout << "k: " << k << endl;
for(int i = 0; i < n; ++i) {
// cout << "before tot: " << t[1].cnt << endl;
ins(1, 0, MAX, costa[ord[i]], -1); ins(1, 0, MAX, costb[ord[i]] - costa[ord[i]], 1);
sum += costa[ord[i]];
have = k - sum;
// cout << "have: " << have << endl;
if(have < 0) break;
ll maxv = walk(1, 0, MAX) + i + 1;
// cout << "maxv, forced: " << maxv << " " << forced << endl;
ans2 = max(ans2, forced + maxv);
// cout << "ans2: " << ans2 << endl;
}
// cout << "total val of tree: " << val[1] << endl;
//
// cout << "forced overlap: " << forced << endl;
// cout << "total overlap ans: " << ans2 << endl;
if(flag) ans2 = 0;
// cout << "have: " << have << endl;
// cout << ans << " " << ans2 << endl;
return max(ans, ans2);
}
//signed main() {
// int n, x, y, k; cin >> n >> x >> y >> k;
//
// vector<int> u(n - 1), v(n - 1), w(n - 1);
//
// for(int i = 0; i < n - 1; ++i) cin >> u[i];
// for(int i = 0; i < n - 1; ++i) cin >> v[i];
// for(int i = 0; i < n - 1; ++i) cin >> w[i];
//
// cout << max_score(n, x, y, k, u, v, w) << endl;
//}
詳細信息
Subtask #1:
score: 0
Runtime Error
Test #1:
score: 8
Accepted
time: 299ms
memory: 141804kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 200000 31011 61157 8517583098 31011 129396 964383 1655 129396 331139 1655 191487 566483 110385 191487 865248 43212 110385 542661 43212 81682 13766 81682 91774 546589 91774 124706 780638 124706 175650 118706 10421 175650 615314 10421 151953 436270 140430 151...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 451
result:
ok
Test #2:
score: 0
Accepted
time: 319ms
memory: 170128kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 200000 97133 170892 35489415917 114511 170892 730058 34783 114511 435023 34783 47301 562314 47301 162600 457629 44856 162600 365133 44856 133801 83016 117539 133801 124222 117539 128719 199821 77871 128719 703141 77871 133155 624331 7211 133155 138691 7211 ...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 650
result:
ok
Test #3:
score: -8
Runtime Error
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 200 1000 611 992 5736784 504 611 954658 504 936 219278 502 936 632439 393 502 177662 267 393 570266 267 291 941365 291 310 168052 310 765 253098 635 765 724932 274 635 842125 274 799 848645 39 799 433118 39 940 705598 553 940 564063 553 960 69665 917 960 6904...
output:
result:
Subtask #2:
score: 0
Runtime Error
Test #4:
score: 9
Accepted
time: 3ms
memory: 8436kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 50 23 25 382806473 0 1 375710 1 2 898637 2 3 10402 3 4 536577 4 5 385023 5 6 71075 6 7 543368 7 8 301497 8 9 174394 9 10 711312 10 11 923006 11 12 675532 12 13 838667 13 14 565729 14 15 979816 15 16 862618 16 17 576015 17 18 177751 18 19 306989 19 20 881492...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 96
result:
ok
Test #5:
score: 0
Accepted
time: 3ms
memory: 8480kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 47 20 22 25669694 0 1 291237 1 2 851987 2 3 421247 3 4 962919 4 5 643085 5 6 224951 6 7 756890 7 8 147295 8 9 625823 9 10 736374 10 11 290526 11 12 335466 12 13 539086 13 14 957449 14 15 423408 15 16 932444 16 17 356032 17 18 307118 18 19 94279 19 20 989546...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 26
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 8476kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 46 6 34 355277954 0 1 574359 1 2 58362 2 3 778155 3 4 538832 4 5 128903 5 6 79774 6 7 715282 7 8 259924 8 9 640303 9 10 361135 10 11 506866 11 12 527045 12 13 946672 13 14 620381 14 15 701743 15 16 766266 16 17 524732 17 18 340089 18 19 630172 19 20 357712 ...
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 74
result:
ok
Test #7:
score: -9
Runtime Error
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 45 14 44 70669 0 1 266130 1 2 372315 2 3 965349 3 4 119493 4 5 190522 5 6 506822 6 7 45330 7 8 423189 8 9 748532 9 10 653554 10 11 102552 11 12 90431 12 13 843259 13 14 422626 14 15 35334 15 16 1 16 17 1 17 18 1 18 19 1 19 20 1 20 21 1 21 22 1 22 23 1 23 24...
output:
result:
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Wrong Answer
Test #36:
score: 9
Accepted
time: 3ms
memory: 8388kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 4 0 1 9 0 2 2 1 2 3 2 3 3
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 6
result:
ok
Test #37:
score: 0
Accepted
time: 3ms
memory: 8460kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 4 0 1 8 0 2 2 1 2 3 2 3 100
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 5
result:
ok
Test #38:
score: 0
Accepted
time: 0ms
memory: 8372kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 8 0 4 84 0 1 1 1 2 29 2 3 29 3 4 1 4 5 20 2 6 20 3 7 1
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 9
result:
ok
Test #39:
score: 0
Accepted
time: 0ms
memory: 8392kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 18 14 15 221112 8 10 15984 3 8 2664 6 10 5328 9 10 13320 5 10 23976 1 10 13320 3 4 5328 3 7 26640 3 11 23976 4 15 23976 6 17 18648 12 17 5328 11 13 13320 0 11 7992 15 16 5328 2 16 5328 13 14 2664
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 14
result:
ok
Test #40:
score: 0
Accepted
time: 0ms
memory: 8412kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 19 3 9 11232111 13 14 174955 0 13 69982 10 14 209946 14 15 209946 12 14 104973 0 11 314919 0 3 314919 0 7 139964 5 10 209946 10 16 69982 4 10 104973 9 11 279928 9 17 349910 1 4 104973 3 18 209946 6 18 174955 7 8 314919 2 7 104973
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 28
result:
ok
Test #41:
score: 0
Accepted
time: 0ms
memory: 8408kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 15 5 7 155966 1 4 964448 5 11 996819 9 10 330180 5 6 987448 11 12 704605 0 5 155967 8 14 596631 10 11 923917 0 14 560902 4 13 49411 1 7 856694 1 12 755799 2 14 488208 3 13 990480
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 2
result:
ok
Test #42:
score: 0
Accepted
time: 0ms
memory: 8464kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 20 4 7 40726445 15 18 841797 9 16 909512 0 7 39919 8 19 78725 6 17 661904 7 14 426400 17 18 664669 7 13 917960 4 14 821652 4 11 274656 1 12 937782 10 19 129031 12 13 504353 5 11 502915 3 8 264525 2 19 358409 12 18 578659 16 19 696491 3 17 175157
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 30
result:
ok
Test #43:
score: -9
Wrong Answer
time: 3ms
memory: 8472kb
input:
cc61ad56a4797fb3f5c9529f73ce6fcedd85669b 1 19 1 8 758761123780644886 3 18 947982 12 13 415218 3 15 890432 11 17 808801 2 8 726510 7 12 752493 8 17 328133 6 7 465830 8 14 126540 9 18 443041 1 7 605214 4 11 243452 9 10 106626 3 7 498126 1 4 39081 0 2 861168 5 15 69635 3 16 223395
output:
081ce3c351cbf526b37954b9ad30f2b531a7585c OK 43
result:
wrong answer 1st lines differ - on the 1st token, expected: '38', found: '43'
Subtask #6:
score: 0
Skipped
Dependency #2:
0%
Subtask #7:
score: 0
Skipped
Dependency #3:
0%
Subtask #8:
score: 0
Skipped
Dependency #4:
0%
Subtask #9:
score: 0
Skipped
Dependency #1:
0%