제출 #1182721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182721		mertbbm	조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2)	C++20	0 / 100	5095 ms	440 KiB

joitter2

#include <bits/stdc++.h>
using namespace std;

//#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n,k;
	cin >> n >> k;
	
	bool mat[n+5][n+5];
	memset(mat,0,sizeof(mat));
	
	int a,b;
	for(int x=0;x<k;x++){
		cin >> a >> b;
		mat[a][b]=true;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				for(int k=1;k<=n;k++){
					for(int l=1;l<=n;l++){
						if(mat[j][k]&&mat[k][l]&&mat[l][k]) mat[j][l]=true;
					}
				}
			}
		}
		int counter=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(i==j) continue;
				counter+=mat[i][j];
				//cout << mat[i][j];
			}
			//cout << "\n";
		}
		cout << counter << "\n";
	}
}
																   
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 16
• Subtask 3: 0 / 83