提出 #44278991

---

ソースコード 拡げる

#include <bits/stdc++.h> // Include every standard library
using namespace std;

typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dx[8] = { -1, 0, 0, 1, -1, -1, 1, 1 };
int dy[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };

// testing and debugging section : 

#ifdef TESTING
#define DEBUG fprintf(stderr, "====TESTING====\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define DEBUG
#define VALUE(x)
#define debug(...)
#endif

#define rep(i,n) for(int i = 0;i<n;++i)
#define sqr(x) ((LL)(x) * (x))
#define reset(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define sort(v) sort(all(v))
#define reverse(v) reverse(ALL(v))
#define PERMUTE next_permutation
#define TC(t) while (t--)

int n,m;
vector<int> ad[55];
bool vis[55];

vector<int>g[60];
LL visited[60];
void dfs(LL cur)
{
    visited[cur] = true;
    for (auto child : g[cur])
    {
        if (visited[child])
            continue;
        dfs(child);
    }
}
void testCase()
{
    LL node, edge;
    cin >> node >> edge;
    rep(i, edge)
    {
        LL u, v;
        cin >> u >> v;
        g[u].pb(v);
    }
    for (LL i = 1; i <= node; i++)
    {
        LL c = 0;
        dfs(i);
        c++;
        for (LL j = 1; j <= node; j++)
        {
            if (visited[j]) continue;
            dfs(j);
            c++;
        }
        rep(i, 60) visited[i] = 0;
        if(c==1){
            cout<<i<<"\n";
            return;
        }
        // dp_x(c);
    }
    cout<<-1<<"\n";
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    // cin>>T;
    TC(T) testCase();
    return 0;
}

提出情報

ジャッジ結果