Lmao

Wow Code wrting style perfect

LMFAO! He solved all problems, and previously skipped for 5 problems on a past div3. I think he is one of those indians who sell round solutions on telegram. (I saw that on a blog he was complaining all his friends got selected because of these groups and him not)

Where tf is the code

I randomly found a cheater.

Look at these 2 accounts.

230200955 and 230246960.

Pls ban.

Seems like this. Can't submit it to check though, lol.

#include <bits/stdc++.h>
#define ll long long 
#include <iostream>
using namespace std;
#include <algorithm>
const int MX = 1e5 + 10;
string P;
vector<int> C[MX];
vector<int> dp1(MX),dp2(MX);
void dfs(int r = 0){dp1[r] = 0;dp2[r] = 0;for(auto i : C[r]){{dfs(i);dp1[r] += min(dp2[i]+1, dp1[i]);dp2[r] += min(dp1[i]+1, dp2[i]);}}if(P[r] == 'S'){dp1[r] = 1e6;
}else if(P[r] == 'P'){dp2[r] = 1e6;}}void solve(){int n;cin>>n;int te;for(int i = 0;i<n;i++){C[i].clear();if(i != 0){cin>>te;C[te-1].push_back(i);}}cin>>P;dfs();cout<<min(dp1[0],dp2[0])<<"\n";}
signed main(){ll t;cin>>t;while(t--){solve();cout<<endl;}}

Why he is using the name of IIT delhi

I am guotutu, and I love Feli so much.

There are codes on geeksforgeeks.org, I just saw them, people could literally copy and paste the code and it would've been accepted.

In the view of Karl Marx[1], human beings are intrinsically, necessarily and by definition social beings who, beyond being "gregarious creatures", cannot survive and meet their needs other than through social co-operation and association.

Cheaters expressing themselves in code xd.

Two very suspicious accounts on leader board : LiMiTlEsS_ and Kowshik.Emmadisetty. Have previous cheating history and extremely sussy solutions and codes.

I'm surprised Codeforces doesn't have the actual feature to report a suspicious user by now...

he gained +444 positive delta with no consequence?? why this allowed?

He hard-worked so much

Cheating on codeforces is the biggest issue I think there should be report option so we can report such users.

#include <bits/stdc++.h>
#define ll long long
#include <iostream>
using namespace std;
#include <algorithm>
const int MX = 1e5 + 10;
string P;
vector<int> C[MX];
vector<int> dp1(MX),dp2(MX);
(i < n ? a[i] : b[a[i - n]]);}sort(a.begin(), a.end());
void dfs(int r = 0){dp1[r] = 0;dp2[r] = 0;for(auto i : C[r]){{dfs(i);dp1[r] += min(dp2[i]+1, dp1[i]);dp2[r] += min(dp1[i]+1, dp2[i]);}}if(P[r] == 'S'){dp1[r] = 1e6;
}else if(P[r] == 'P'){dp2[r] = 1e6;}}void solve(){int n;cin>>n;int te;for(int i = 0;i<n;i++){C[i].clear();if(i != 0){cin>>te;C[te-1].push_back(i);}}cin>>P;dfs();cout<<min(dp1[0],dp2[0])<<"\n";}
signed main(){ll t;cin>>t;while(t--){solve();cout<<endl;}}

The Real Code.

Add h_a_m_z_a too

https://mirror.codeforces.com/contest/1822/submission/203340758

TonyStark_000 is not plagiarized yet!! +**444** HOW????!!!