QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#84532 | #5651. Parmigiana With Seafood | a_z_c | WA | 35ms | 10740kb | C++23 | 1.3kb | 2023-03-06 15:41:46 | 2023-03-06 15:42:24 |
Judging History
answer
// Problem: Parmigiana With Seafood
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/CF1776M
// Memory Limit: 250 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
vector<int> G[maxn];
int col[maxn];
int f[maxn];
int vis[maxn];
int n;
void dfs(int u, int fa) {
col[u] = col[fa] ^ 1;
f[u] = fa;
for (int v : G[u]) {
if (v == fa)
continue;
dfs(v, u);
}
}
int m0, m1;
int ans;
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d %d", &u, &v);
G[u].emplace_back(v);
G[v].emplace_back(u);
}
if (!(n & 1)) {
printf("%d", n);
return 0;
}
dfs(n, 0);
for (int i = n; i > 0; i--) {
if (col[i] && !m1) {
m1 = i;
}
if (!col[i] && !m0) {
m0 = i;
}
if (G[i].size() <= 1 || col[i] != col[n]) {
ans = max(ans, i);
}
int u = i;
while (!vis[u]) {
vis[u]++;
u = f[u];
}
if (vis[u] > 2 || (vis[u] == 2 && u < i)) {
ans = max(ans, i);
}
}
ans = max(ans, min(m0, m1));
printf("%d", ans);
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 5820kb
input:
4 1 2 1 3 1 4
output:
4
result:
ok single line: '4'
Test #2:
score: 0
Accepted
time: 3ms
memory: 6296kb
input:
5 1 5 5 3 3 4 4 2
output:
3
result:
ok single line: '3'
Test #3:
score: 0
Accepted
time: 21ms
memory: 10488kb
input:
99999 81856 39633 81856 94012 99999 43062 99946 220 81856 46131 99933 36505 99939 35662 99952 70971 99999 3275 99938 58416 99976 66658 99991 87922 81856 80992 99933 6392 99951 41047 99970 54115 81856 38150 99934 73554 81856 64578 81856 18576 99951 67996 99938 84479 81856 39617 99999 18664 99946 2505...
output:
99925
result:
ok single line: '99925'
Test #4:
score: 0
Accepted
time: 35ms
memory: 10740kb
input:
99997 90325 59106 22545 8765 88871 37709 14739 95233 8778 29659 48110 57549 91258 76066 15724 65144 48244 87291 12076 94378 41946 96707 93645 12812 53817 34343 72097 94062 81212 263 78713 78150 6754 94906 20957 97539 59293 5018 77961 78090 57262 95225 79349 47902 99024 7869 10613 13728 61757 41090 4...
output:
85398
result:
ok single line: '85398'
Test #5:
score: -100
Wrong Answer
time: 20ms
memory: 10600kb
input:
97687 5206 6282 79497 65247 26426 93558 88096 86680 12934 32573 14514 39078 1619 40141 52678 92737 31478 91858 85427 62603 83477 53003 38500 72325 62910 10306 97005 13325 38472 67023 39728 18368 78232 5993 20560 1752 22173 38357 97114 10935 4680 13734 45188 13484 58025 44787 70778 20 11932 28511 416...
output:
96848
result:
wrong answer 1st lines differ - expected: '96849', found: '96848'