QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#652920 | #7755. Game on a Forest | anlanyi | WA | 0ms | 5960kb | C++20 | 661b | 2024-10-18 19:18:51 | 2024-10-18 19:18:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
using ll=long long ;
long long f[N];
pair<char,array<ll ,4>>w[N];
int vis[N];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
vector<vector<int >>h(n+1);
vector<int >vis(n+1);
for(int i=1;i<=m;i++){
int a,b;
cin >> a >> b;
h[a].push_back(b);
h[b].push_back(a);
vis[a]++;
vis[b]++;
}
int cnt=0;
int a=0;
for(int i=1;i<=n;i++){
if(vis[i]==0)a++;
cnt+=vis[i]==1;
}
cout<<min(cnt,m)+1+a/2<<'\n';
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3540kb
input:
3 1 1 2
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
4 3 1 2 2 3 3 4
output:
3
result:
ok 1 number(s): "3"
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 5960kb
input:
100000 1 4647 17816
output:
50001
result:
wrong answer 1st numbers differ - expected: '1', found: '50001'