제출 #1199289

#제출 시각아이디문제언어결과실행 시간메모리
1199289al_reem_2010September (APIO24_september)C++20
11 / 100
2 ms2632 KiB
// اَللَهُمَ صَلِ عَلَىَ مُحَمَدٍ وَ آلِ مُحَمَدٍ #include "bits/stdc++.h" #include <iostream> #include <vector> #include <string> #include <algorithm> #include <cmath> #include <map> #include <set> #include <queue> #include <thread> #include <fstream> using namespace std ; //#define int long long #define pb push_back #define si size() #define fi first #define se second #define all(a) a.begin(),a.end() #define applejuice ios::sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ; //const int inf=1e18 ; //const int mod=1e9+7 ; int tt=1 , ans=0 ; int vis[100007] ; vector<int> ch[100007] ; void dfs(int k) { if(vis[k]!=0) {return ;} vis[k]=ans ; for(int i=0 ; i<ch[k].si ; i++) {dfs(ch[k][i]) ;} } int solve(int n , int m , vector<int> f , vector<vector<int>> s) { ans=0 ; for(int i=0 ; i<n ; i++) {ch[f[i]].pb(i) ; vis[i]=0 ;} for(int j=0 ; j<n-1 ; j++) { if(vis[s[0][j]]!=0) {ans=vis[f[s[0][j]]] ; continue ;} ans+=1 ; dfs(s[0][j]) ; //cout << ans << " " << j << " " << s[0][j] << "\n" ; } for(int i=0 ; i<n ; i++) {ch[i].clear() ;} return ans ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...