Submission #568041

# Submission time Handle Problem Language Result Execution time Memory
568041 2022-05-24T14:26:16 Z LittleCube Making Friends on Joitter is Fun (JOI20_joitter2) C++14
0 / 100
2 ms 468 KB
#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);
	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] = 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)
							assert(false);
		
		for(int x = 1; x <= N; x++)
			for(int y = 1; y <= N; y++)
				ans += adj[x][y];
		cout << ans << '\n';
	}
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Runtime error 2 ms 468 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Runtime error 2 ms 468 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Runtime error 2 ms 468 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -