Submission #1990349
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <vector> #include <string> #include <algorithm> #include <stack> #include <queue> #include <set> #include <map> using namespace std; #define MOD @ #define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD) typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec; int N; vector<pair<int, int> > ch[202020]; void augment(vector<pair<int, int> > &ls, int a) { for (auto &e : ls) { e.first += a; e.second += a; } } vector<pair<int, int> > canonize(vector<pair<int, int> > &seq) { sort(seq.begin(), seq.end()); vector<pair<int, int> > ret; int upp = 1001001001; for (auto e : seq) { if (e.second < upp) { ret.push_back(e); upp = e.second; } } return ret; } vector<pair<int, int> > solve(int p, int thr) { if (ch[p].size() == 0) { return{ {0, 0} }; } vector<pair<int, int> > left = solve(ch[p][0].first, thr); augment(left, ch[p][0].second); vector<pair<int, int> > right = solve(ch[p][1].first, thr); augment(right, ch[p][1].second); vector<pair<int, int> > ret; for (int i = 0; i < left.size(); ++i) { int inl = left[i].first, outl = left[i].second; int idx = lower_bound(right.begin(), right.end(), make_pair(thr - outl, 1001001001)) - right.begin() - 1; if (idx < 0) continue; int outr = right[idx].second; ret.push_back({ inl, outr }); ret.push_back({ outr, inl }); } return canonize(ret); } bool isok(int thr) { return solve(0, thr).size() > 0; } int main() { scanf("%d", &N); for (int i = 1; i < N; ++i) { int a, b; scanf("%d%d", &a, &b); --a; ch[a].push_back({ i, b }); } i64 left = 0, right = 1000000007; while (left < right) { i64 mid = (left + right) / 2; if (isok(mid)) { right = mid; } else { left = mid + 1; } } printf("%lld\n", left); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Shik and Travel |
User | semiexp |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1933 Byte |
Status | WA |
Exec Time | 809 ms |
Memory | 20352 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:75:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:78:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &a, &b); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt, example2.txt, example3.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt, example2.txt, example3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 11 ms | 4992 KB |
001.txt | AC | 11 ms | 4992 KB |
002.txt | AC | 11 ms | 4992 KB |
003.txt | AC | 11 ms | 4992 KB |
004.txt | AC | 11 ms | 4992 KB |
005.txt | AC | 11 ms | 4992 KB |
006.txt | AC | 11 ms | 4992 KB |
007.txt | AC | 11 ms | 4992 KB |
008.txt | AC | 11 ms | 4992 KB |
009.txt | AC | 11 ms | 4992 KB |
010.txt | AC | 522 ms | 7040 KB |
011.txt | AC | 522 ms | 7040 KB |
012.txt | AC | 536 ms | 7040 KB |
013.txt | AC | 542 ms | 7040 KB |
014.txt | AC | 533 ms | 7040 KB |
015.txt | AC | 536 ms | 7040 KB |
016.txt | AC | 529 ms | 7040 KB |
017.txt | AC | 528 ms | 7040 KB |
018.txt | AC | 526 ms | 7040 KB |
019.txt | AC | 533 ms | 7040 KB |
020.txt | AC | 538 ms | 7040 KB |
021.txt | AC | 540 ms | 7040 KB |
022.txt | AC | 541 ms | 7040 KB |
023.txt | AC | 551 ms | 7040 KB |
024.txt | AC | 539 ms | 7040 KB |
025.txt | AC | 540 ms | 7040 KB |
026.txt | AC | 468 ms | 7040 KB |
027.txt | AC | 533 ms | 7040 KB |
028.txt | AC | 464 ms | 7040 KB |
029.txt | AC | 462 ms | 7040 KB |
030.txt | AC | 502 ms | 7040 KB |
031.txt | AC | 533 ms | 7040 KB |
032.txt | AC | 514 ms | 7040 KB |
033.txt | AC | 503 ms | 7040 KB |
034.txt | AC | 495 ms | 7040 KB |
035.txt | AC | 521 ms | 7040 KB |
036.txt | AC | 476 ms | 7040 KB |
037.txt | AC | 483 ms | 7040 KB |
038.txt | AC | 490 ms | 7040 KB |
039.txt | AC | 402 ms | 7040 KB |
040.txt | AC | 737 ms | 9596 KB |
041.txt | AC | 789 ms | 9596 KB |
042.txt | AC | 785 ms | 9596 KB |
043.txt | AC | 809 ms | 9596 KB |
044.txt | WA | 384 ms | 20352 KB |
045.txt | AC | 385 ms | 13696 KB |
046.txt | WA | 414 ms | 15616 KB |
047.txt | WA | 387 ms | 14208 KB |
048.txt | WA | 390 ms | 18176 KB |
049.txt | AC | 3 ms | 4992 KB |
example0.txt | AC | 3 ms | 4992 KB |
example1.txt | AC | 3 ms | 4992 KB |
example2.txt | AC | 3 ms | 4992 KB |
example3.txt | AC | 3 ms | 4992 KB |