Hey, have you figured out what's wrong with your code? Mine's pretty similar, but I'm calculating the the number of invited people directly(by decrementing a variable from n by 1, everytime we come across a guest who can't be invited. But I'm getting 6 WAs :(

Could you help me out with this please?

#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
 
int main() {
    ifstream fin("partyin.txt");
    ofstream fout("partyout.txt");
 
	int n,m,a,b;
	fin>>n>>m>>a>>b;
	b= n-b-1;
	vector<int> arr[n+1];

Hey! Could you please explain the second hint -

I don't understand why it's not allowed

Could anyone give any hints for this problem please?

Hey, could you explain this part please -

else if (ed[n][i] != p)
        {
            tree = 0;
        }

Here's my code, the test case passes, but IARCS's website still isn't allowing C++ code to pass for some reason, so I'm not sure if it's correct:

#include <iostream>
#include <vector> 
#include <algorithm>
using namespace std;
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int m;
	cin>>m;
	vector<int> v1;
	vector<int> v2;
	for(int i=0;i<m;i++){
	    int x;
	    int y;

Question 6's images can't be seen

edit: None of the images can be seen :(

This still hasn't been fixed, right?