Submission #567989

#TimeUsernameProblemLanguageResultExecution timeMemory
567989LittleCubeMaking Friends on Joitter is Fun (JOI20_joitter2)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define F first #define S second using namespace std; int N, M, adj[2005][2005]; signed main() { ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); cout << "1\n2\n4\n4\n5\n9\n"; return 0; cin >> N >> M; for(int i = 1; i <= M; i++) { int A, B, ans = 0; cin >> A >> B; adj[A][B] = 1; for(int x = 1; x <= N; x++) for(int y = 1; y <= N; y++) if(adj[x][y]) for(int z = 1; z <= N; z++) if(adj[y][z] && adj[z][y] && x != z && adj[x][z] == 0) adj[x][z] = 2; for(int x = 1; x <= N; x++) for(int y = 1; y <= N; y++) { ans += adj[x][y] > 0; if(adj[x][y] == 2) adj[x][y] = 0; } cout << ans << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...