Many Cycles

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 1010
vector<int> v[N];
int t[N], h[N], p[N];
bool f = 0;

void haku(int s, int hh){
    h[s] = hh;
    for(int i : v[s]){
        if(h[i] == 0){
            p[i] = s;
            haku(i, hh+1);
            t[s] += t[i];
        }else if(h[i] < hh-1) {
            --t[p[i]];
            ++t[s];
        }
    }
    if(t[s] > 1) f = 1;
}

int main() {
    int T; cin >> T;
    while(T--){
        int n, m; cin >> n >> m;
        for(int i=1; i<=n; ++i) {
            v[i].clear();
            h[i] = t[i] = p[i] = 0;
        }
        for(int i=0; i<m; ++i){
            int a, b; cin >> a >> b;
            v[a].push_back(b);
            v[b].push_back(a);
        }
        f=0;
        for(int i=1; i<=n; ++i) if(!h[i]) haku(i, 1);
        if(f) cout << "YES\n";
        else cout << "NO\n";
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED