QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#653856 | #8333. Gift | Eliauk | RE | 122ms | 20368kb | C++20 | 2.4kb | 2024-10-18 20:45:37 | 2024-10-18 20:45:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
const ll INF = 1ll << 60;
typedef pair<int, int> PI;
const int N = 1e5 + 10;
int t;
int n;
vector<int> a[N];
map<int, int> mp;
bool judge[N];
int cnt[6];
vector<int> h;
bool dfs(int g, int fa)
{
for (int i = 0; i < a[g].size(); i++)
{
if (a[g][i] == fa)
continue;
if (judge[a[g][i]])
{
h.push_back(g);
return true;
}
else
{
judge[a[g][i]] = 1;
bool vis = dfs(a[g][i], g);
if (vis)
{
h.push_back(g);
return true;
}
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; i++)
{
int x, y;
cin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
mp[x]++;
mp[y]++;
}
judge[1] = 1;
dfs(1, -1);
for (auto it : mp)
{
cnt[it.second]++;
}
if (cnt[5] == 2)
{
cout << n - cnt[5] - cnt[4] << endl;
}
else if (cnt[5] == 1)
{
cout << 2 * (n - cnt[5] - cnt[4]) << endl;
}
else
{
ll ans = 0;
for (int i = 1; i <= h.size(); i++)
{
if (i == h.size())
{
if (mp[h[0]] < 4)
{
ans += (n - cnt[4]);
if (mp[h[h.size() - 1]] == 4)
{
ans++;
}
}
else
{
ans += (n - cnt[4] + 1);
if (mp[h[h.size() - 1]] == 4)
{
ans++;
}
}
break;
}
if (mp[h[i]] < 4)
{
ans += (n - cnt[4]);
if (mp[h[i - 1]] == 4)
{
ans++;
}
}
else
{
ans += (n - cnt[4] + 1);
if (mp[h[i - 1]] == 4)
{
ans++;
}
}
}
cout << ans << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3676kb
input:
6 1 2 1 3 1 4 1 5 1 6 2 3
output:
10
result:
ok 1 number(s): "10"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
3 1 3 3 2 2 1
output:
9
result:
ok 1 number(s): "9"
Test #3:
score: 0
Accepted
time: 0ms
memory: 4096kb
input:
2332 1648 909 1676 2122 1644 1981 1106 1131 1785 239 223 618 335 1662 424 1775 889 1684 1589 52 1406 1747 1600 302 790 2056 1742 464 1706 541 1145 779 2316 833 1645 1439 859 438 1337 136 746 1565 436 1730 2079 2145 1583 1940 917 1549 1863 507 1266 367 1890 2230 13 2113 492 2109 120 1122 815 1111 134...
output:
5438224
result:
ok 1 number(s): "5438224"
Test #4:
score: 0
Accepted
time: 122ms
memory: 20368kb
input:
100000 46198 33056 80285 88339 88963 925 43203 66233 13618 35880 19864 76475 90021 73072 3202 63653 41571 83067 22067 98768 10753 16653 32856 85797 3483 2064 46659 9486 23290 82179 97966 23617 81566 7334 81774 76138 10959 75816 93471 12058 97260 66262 85541 78476 67864 87220 8607 52245 38957 67603 7...
output:
10000000000
result:
ok 1 number(s): "10000000000"
Test #5:
score: 0
Accepted
time: 92ms
memory: 17232kb
input:
100000 54772 14057 70680 93042 84913 63248 79360 97774 84190 60881 31137 29439 99037 81117 38579 32074 31206 19912 70774 23067 60717 79586 83847 43306 55351 50174 32566 70092 22736 92279 55916 20029 41571 63309 33143 65579 35033 3869 50038 4275 59533 25348 53092 32698 27604 14678 6802 18226 23173 96...
output:
5017400000
result:
ok 1 number(s): "5017400000"
Test #6:
score: -100
Runtime Error
input:
50000 26768 20197 5956 49805 44024 45008 29783 4843 7173 42904 36329 3666 1258 35410 1245 42591 41226 20145 41177 25916 38397 36431 3822 43842 414 31694 28969 33316 47036 42639 5433 1631 26813 16959 17557 18806 45146 10231 26867 24805 4416 45505 44772 32136 26263 17264 43426 20507 26630 4199 9781 89...