제출 #137857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
137857		Osama_Alkhodairy	원 고르기 (APIO18_circle_selection)	C++17	0 / 100	8 ms	5368 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;

int n, m;
vector <int> v[N];
ll ans;

int dfs(int node, int pnode){
    int ret = 1;
    for(auto &i : v[node]){
        if(i == pnode) continue;
        int cur = dfs(i, node);
        ret += cur;
        cout << cur << endl;
        ans += 1LL * cur * (n - cur);
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 0 ; i < m ; i++){
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1, 0);
    ans *= 2;
    ans -= 2LL * n * (n - 1) / 2;
    cout << ans << endl;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13