제출 #1321051

#제출 시각아이디문제언어결과실행 시간메모리
1321051Hercule_Poirot9월 (APIO24_september)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
//change this back
typedef int ll;
//const ll MOD=1e9+7;
int solve(int N,int M,vector<int> F,vector<vector<int>> S){
	vector<vector<ll>> adj(N);
	for(ll i=1;i<=(N-1);i++){
		adj[i].push_back(F[i]);
		adj[F[i]].push_back(i);
	}
	return N-1;
}
/*
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	//dra	
}
*/
#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...