oj.uz

Submission #815811

# Submission time Handle Problem Language Result Execution time Memory
815811 2023-08-09T00:20:50 Z Ozy Duathlon (APIO18_duathlon) C++17
0 / 100
 33 ms 5696 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a <<  " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,lli> 

#define MAX 100000

lli n,m,a,b,tam,res;
vector<lli> hijos[MAX+2];
lli vis[MAX+2];

bool ciclo(lli pos, lli padre) {
    bool puedo = false;

    tam++;
    vis[pos]=1;
    for(auto h : hijos[pos]) {
        if (h == padre) continue;
        if (vis[h]) puedo = true;
        puedo |= ciclo(h,pos);
    }

    return puedo;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    rep(i,1,m) {
        cin >> a >> b;
        hijos[a].push_back(b);
    }

    rep(i,1,n) {
        if(vis[i]) continue;
        tam = 0;
        if (ciclo(i,0)) a = (tam*(tam-1)*(tam-2))/2;
        else a = (tam*(tam-1)*(tam-2))/3;
        res += a;
    }

    cout << res;

    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 5696 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 5588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 5676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -