oj.uz

Submission #567988

# Submission time Handle Problem Language Result Execution time Memory
567988 2022-05-24T13:21:26 Z LittleCube Making Friends on Joitter is Fun (JOI20_joitter2) C++14
0 / 100
 0 ms 340 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] = 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';
	}
}

Subtask #1
0 / 1.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 83.0

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