Submission #39479782

Source Code Expand

#include<iostream>
#include<vector>
#include<cstring>
using namespace std;

int n, m;
vector<int> v[2010];
bool visited[2010];

int dfs(int cur)
{
    int ret = 1;
    int i;
    
    visited[cur] = true;
    for(i = 0; i < v[cur].size(); i++)
    {
        if(visited[v[cur][i]]) continue;
        
        ret += dfs(v[cur][i]);
    }
    
    return ret;
}

int main()
{
    int i;
    int a, b;
    int ans;
    
    cin >> n >> m;
    for(i = 0; i < m; i++)
    {
        cin >> a >> b;
        
        v[a].push_back(b);
    }
    
    ans = 0;
    for(i = 1; i <= n; i++)
    {
        memset(visited, false, sizeof(visited));
        
        ans += dfs(i) - v[i].size() - 1;
    }
    
    cout << ans;
}

Submission Info

Submission Time
Task E - Transitivity
User gojib2002
Language C++ (Clang 10.0.0)
Score 500
Code Size 764 Byte
Status AC
Exec Time 64 ms
Memory 3248 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 51
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_srnd_00.txt, 01_srnd_01.txt, 01_srnd_02.txt, 01_srnd_03.txt, 01_srnd_04.txt, 01_srnd_05.txt, 01_srnd_06.txt, 01_srnd_07.txt, 02_rnd_00.txt, 02_rnd_01.txt, 02_rnd_02.txt, 02_rnd_03.txt, 02_rnd_04.txt, 02_rnd_05.txt, 02_rnd_06.txt, 02_rnd_07.txt, 03_smallM_00.txt, 03_smallM_01.txt, 03_smallM_02.txt, 03_smallM_03.txt, 03_smallM_04.txt, 04_largeM_00.txt, 04_largeM_01.txt, 04_largeM_02.txt, 04_largeM_03.txt, 04_largeM_04.txt, 05_zero_00.txt, 06_dag_00.txt, 06_dag_01.txt, 06_dag_02.txt, 06_dag_03.txt, 06_dag_04.txt, 06_dag_05.txt, 06_dag_06.txt, 06_dag_07.txt, 06_dag_08.txt, 06_dag_09.txt, 07_path_00.txt, 07_path_01.txt, 07_path_02.txt, 07_path_03.txt, 08_perfect_00.txt, 08_perfect_01.txt, 08_perfect_02.txt, 08_perfect_03.txt, 08_perfect_04.txt, 08_perfect_05.txt, 08_perfect_06.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 9 ms 3228 KiB
00_sample_01.txt AC 2 ms 3128 KiB
00_sample_02.txt AC 3 ms 3052 KiB
01_srnd_00.txt AC 2 ms 3200 KiB
01_srnd_01.txt AC 1 ms 3064 KiB
01_srnd_02.txt AC 1 ms 3188 KiB
01_srnd_03.txt AC 2 ms 3192 KiB
01_srnd_04.txt AC 2 ms 3180 KiB
01_srnd_05.txt AC 2 ms 3084 KiB
01_srnd_06.txt AC 2 ms 3184 KiB
01_srnd_07.txt AC 2 ms 3180 KiB
02_rnd_00.txt AC 7 ms 3160 KiB
02_rnd_01.txt AC 9 ms 3196 KiB
02_rnd_02.txt AC 7 ms 3084 KiB
02_rnd_03.txt AC 6 ms 3204 KiB
02_rnd_04.txt AC 6 ms 3084 KiB
02_rnd_05.txt AC 8 ms 3084 KiB
02_rnd_06.txt AC 6 ms 3088 KiB
02_rnd_07.txt AC 8 ms 3204 KiB
03_smallM_00.txt AC 2 ms 3080 KiB
03_smallM_01.txt AC 1 ms 3080 KiB
03_smallM_02.txt AC 1 ms 3140 KiB
03_smallM_03.txt AC 2 ms 3076 KiB
03_smallM_04.txt AC 2 ms 3104 KiB
04_largeM_00.txt AC 6 ms 3160 KiB
04_largeM_01.txt AC 4 ms 3212 KiB
04_largeM_02.txt AC 6 ms 3100 KiB
04_largeM_03.txt AC 4 ms 3104 KiB
04_largeM_04.txt AC 6 ms 3176 KiB
05_zero_00.txt AC 2 ms 3196 KiB
06_dag_00.txt AC 7 ms 3236 KiB
06_dag_01.txt AC 6 ms 3100 KiB
06_dag_02.txt AC 5 ms 3088 KiB
06_dag_03.txt AC 7 ms 3180 KiB
06_dag_04.txt AC 6 ms 3112 KiB
06_dag_05.txt AC 9 ms 3140 KiB
06_dag_06.txt AC 9 ms 3132 KiB
06_dag_07.txt AC 7 ms 3224 KiB
06_dag_08.txt AC 9 ms 3108 KiB
06_dag_09.txt AC 7 ms 3180 KiB
07_path_00.txt AC 35 ms 3248 KiB
07_path_01.txt AC 50 ms 3248 KiB
07_path_02.txt AC 39 ms 3224 KiB
07_path_03.txt AC 64 ms 3220 KiB
08_perfect_00.txt AC 2 ms 3188 KiB
08_perfect_01.txt AC 2 ms 3188 KiB
08_perfect_02.txt AC 6 ms 3084 KiB
08_perfect_03.txt AC 2 ms 3200 KiB
08_perfect_04.txt AC 4 ms 3184 KiB
08_perfect_05.txt AC 2 ms 3084 KiB
08_perfect_06.txt AC 6 ms 3196 KiB