QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #558400 | #852. Jellyfish | rotcar07 | WA | 244ms | 3824kb | C++20 | 692b | 2024-09-11 15:54:47 | 2024-09-11 15:54:49 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int maxn=1e5+5;
int n;
vector<int> e[maxn];
int deg[maxn];
inline void solve(){
cin>>n;
for(int i=1;i<=n;i++) e[i].clear(),deg[i]=0;
for(int i=1,u,v;i<=n;i++) cin>>u>>v,e[u].push_back(v),e[v].push_back(u),deg[u]++,deg[v]++;
int ans=0;
queue<int> q;
for(int i=1;i<=n;i++) if(deg[i]==1) q.push(i),ans++;
while(!q.empty()){
int p=q.front();q.pop();
for(auto x:e[p]) if(--deg[x]==1) q.push(x);
}
int cnt=0;
for(int i=1;i<=n;i++) if(deg[i]>1&&e[i].size()==2) cnt++;
cout<<max(3,ans+min(cnt,2))<<'\n';
}
int main(){
int t;cin>>t;
while(t--) solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3768kb
input:
2 6 1 2 2 3 3 4 4 1 2 5 2 6 4 1 2 2 3 3 4 4 1
output:
4 3
result:
ok 2 number(s): "4 3"
Test #2:
score: -100
Wrong Answer
time: 244ms
memory: 3824kb
input:
85665 6 3 2 4 1 4 6 2 1 2 6 5 1 7 6 2 6 3 5 1 1 2 2 4 4 7 3 7 7 6 1 6 7 1 4 1 3 7 5 5 3 4 2 7 6 2 7 4 7 5 3 1 3 4 2 5 1 4 7 7 2 2 6 5 4 5 6 5 1 3 1 4 6 7 3 5 3 1 3 7 3 2 5 1 5 4 4 6 7 4 5 4 1 3 6 3 7 6 7 6 1 2 1 7 5 3 7 3 1 4 6 2 6 3 2 3 4 3 7 2 3 2 6 2 4 7 5 3 5 5 1 1 4 7 3 4 3 7 5 6 2 7 4 6 6 7 6 ...
output:
4 3 3 3 3 4 4 5 4 5 4 4 3 4 4 3 4 4 4 4 4 5 3 4 3 4 3 9 4 4 3 4 8 3 98 5 4 3 6 4 4 4 4 3 4 4 4 4 5 3 5 4 3 4 95 4 4 4 5 4 3 4 3 5 4 3 4 3 3 4 4 4 4 4 3 4 4 4 3 3 3 4 4 4 4 4 4 5 4 4 3 3 5 5 4 5 4 3 4 4 3 3 3 5 4 4 4 6 4 5 5 5 4 3 5 4 4 3 4 10 4 3 3 4 4 4 5 4 4 3 5 3 4 4 3 3 3 4 5 98 5 105 4 4 4 3 4 ...
result:
wrong answer 84th numbers differ - expected: '3', found: '4'