oj.uz

답안 #568040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
568040 2022-05-24T14:25:30 Z LittleCube 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++14
0 / 100
 1 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] = 1;
		for(int x = 1; x <= N; x++)
			for(int y = 1; y <= N; y++)
				ans += adj[x][y];
		cout << ans << '\n';
	}
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -