Submission #1181594

#TimeUsernameProblemLanguageResultExecution timeMemory
1181594agussMarshmallow Molecules (CCO19_day2problem2)C++20
0 / 25
21 ms5260 KiB
#include <bits/stdc++.h> #define dbg(x) cerr << #x << ": " << x << '\n'; #define dbgv(v) cerr << #v << ": "; for(auto &el : v) cerr << el << " "; cerr << '\n'; using namespace std; using ll = long long; bool test_cases = 0; void solve(){ ll n, m, ans = 0; cin >> n >> m; vector<vector<int>> arr; arr.assign(n, vector<int>()); for(int i = 0; i < m; i++){ int a, b; cin >> a >> b; a--, b--; if(a < b){ arr[a].push_back(b); continue; } arr[b].push_back(a); } for(int i = 0; i < n; i++){ ans += arr[i].size(); for(int j = 1; j < arr[i].size(); j++){ arr[arr[i][0]].push_back(arr[i][j]); } } cout << ans; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); if(test_cases){ int t; cin >> t; for(int i = 0; i < t; i++){ solve(); } return 0; } solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...