oj.uz

Submission #1041459

# Submission time Handle Problem Language Result Execution time Memory
1041459 2024-08-02T04:09:34 Z hotboy2703 Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 9 ms 604 KB 
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
const ll INF = 1e18;
const ll MAXN = 51;
bool edge[MAXN][MAXN];
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);
    ll n,m;
    cin>>n>>m;
    ll ans = 0;
    for (ll j = 1;j <= m;j ++){
        ll x,y;
        cin>>x>>y;
        if (edge[x][y] == 0){
            edge[x][y] = 1;
            ans++;
            while (1){
                ll pre_ans = ans;
                for (ll x = 1;x <= n;x ++){
                    for (ll y = 1;y <= n;y ++){
                        if (edge[x][y]){
                            for (ll z = 1;z <= n;z ++){
                                if (edge[y][z] && edge[z][y] && z != x){
                                    if (!edge[x][z]){
                                        edge[x][z] = 1;
                                        ans++;
                                    }
                                }
                            }
                        }
                    }
                }
                if (ans==pre_ans)break;
            }
        }  
        cout<<ans<<'\n'; 
    }
    // dnc(0,n,all);
    // for (ll i = 1;i <= cnt;i ++)cout<<ans[i].fi<<' '<<ans[i].se<<'\n';
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 464 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 476 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 8 ms 460 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 5 ms 460 KB Output is correct
33 Correct 6 ms 348 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 464 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 476 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 8 ms 460 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 5 ms 460 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Runtime error 2 ms 604 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 464 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 3 ms 476 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 6 ms 348 KB Output is correct
15 Correct 7 ms 460 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 4 ms 344 KB Output is correct
19 Correct 6 ms 364 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 8 ms 460 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 3 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 5 ms 460 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Runtime error 2 ms 604 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -