제출 #618900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
618900		errorgorn	조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2)	C++17	1 / 100	5005 ms	340 KiB

joitter2

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

#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (int x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e))?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
bool has[55][55];

signed main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>m;
	
	int a,b;
	int ans=0;
	
	while (m--){
		cin>>a>>b;
		
		if (!has[a][b]){
			has[a][b]=true;
			ans++;
			
			while (true){
				bool done=true;
				
				rep(x,1,n+1) rep(y,1,n+1) rep(z,1,n+1) if (x!=z){
					if (has[x][y] && has[y][z] && has[z][y] && !has[x][z]){
						has[x][z]=true;
						ans++;
						done=false;
					}
				}
				
				if (done) break;
			}
		}
		
		cout<<ans<<endl;
	}
	
}

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