[contest:1992]↵
↵
I would like to thank the entire **Cheat Patrol** team for exposing cheaters.↵
Special thanks to [user:Vladosiya,2024-07-12] for actively helping us in the server and taking actions on convicted cheaters↵
↵
If you are interested in volunteering us in exposing cheaters.↵
You can join our **Cheat Patrol** server : [Cheat Patrol Discord Server](https://discord.com/invite/kKZhfAWKfE)↵
↵
### Leaked Solution of D:↵
`almost all D submissions using BFS are copied.`↵
↵
<spoiler summary="D Leak 1 ">↵
↵
~~~~~↵
#include <iostream>↵
#include <queue>↵
#include <vector>↵
#include <string>↵
↵
using namespace std;↵
↵
struct State {↵
int pos;↵
int swim;↵
};↵
↵
int main() {↵
int t;↵
cin >> t;↵
while (t--) {↵
int n, m, k;↵
cin >> n >> m >> k;↵
string river;↵
cin >> river;↵
↵
vector<bool> visited(n + 2, false);↵
queue<State> q;↵
↵
// Starting point at position 0↵
q.push({0, 0});↵
visited[0] = true;↵
↵
bool canReach = false;↵
↵
while (!canReach && !q.empty()) {↵
State current = q.front();↵
q.pop();↵
↵
int pos = current.pos;↵
int swim = current.swim;↵
↵
// Try jumping from the current position↵
if (pos == 0 || river[pos - 1] == 'L') {↵
for (int jump = 1; jump <= m; ++jump) {↵
int newPos = pos + jump;↵
if (newPos == n + 1) {↵
canReach = true;↵
break;↵
}↵
if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {↵
visited[newPos] = true;↵
q.push({newPos, swim});↵
}↵
}↵
}↵
↵
// Try swimming to the next position if currently in water↵
if (pos > 0 && pos <= n && river[pos - 1] == 'W' && swim < k) {↵
int newPos = pos + 1;↵
if (newPos == n + 1) {↵
canReach = true;↵
break;↵
}↵
if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {↵
visited[newPos] = true;↵
q.push({newPos, swim + 1});↵
}↵
}↵
}↵
↵
cout << (canReach ? "YES" : "NO") << endl;↵
}↵
return 0;↵
}↵
~~~~~↵
↵
</spoiler>↵
↵
<spoiler summary="D Leak 2">↵
↵
~~~~~↵
#include <iostream>↵
using namespace std;↵
#include<bits/stdc++.h>↵
↵
int main() ↵
{↵
int numberOfTestCases;↵
cin >> numberOfTestCases;↵
while(numberOfTestCases--){↵
↵
int casseroleLength, initialPieces, finalPieces;↵
cin >> casseroleLength >> initialPieces >> finalPieces;↵
string monkActions;↵
cin >> monkActions;↵
int currentPieceIndex = initialPieces - 1, wastedPieces = 0, failedOperations = 0;↵
for(auto actionIndex = 0; actionIndex < monkActions.size(); actionIndex++){↵
char action = monkActions[actionIndex];↵
if(action == 'L'){↵
currentPieceIndex = initialPieces;↵
}↵
else if(action == 'W'){↵
if(currentPieceIndex <= 0) wastedPieces++;↵
}↵
else{↵
if(currentPieceIndex <= 0) failedOperations++;↵
}↵
currentPieceIndex--;↵
}↵
↵
if(wastedPieces > finalPieces) failedOperations++;↵
↵
cout << (failedOperations!= 0? "NO" : "YES") << endl;↵
↵
}↵
return 0;↵
}↵
~~~~~↵
↵
↵
</spoiler>↵
↵
↵
### List of Cheater for D:↵
↵
<spoiler summary="D Cheaters">↵
[user:DylanT,2024-07-12]↵
[user:bharath_kumar2005,2024-07-12]↵
[user:Sumit2023102,2024-07-12]↵
[user:Emil_Hajiyev,2024-07-12]↵
[user:xinglili,2024-07-12]↵
[user:adxtya02,2024-07-12]↵
[user:noname_000,2024-07-12]↵
[user:ayush201,2024-07-12]↵
[user:u_kidding_me,2024-07-12]↵
[user:govinthan_ks,2024-07-12]↵
[user:Immortal_22,2024-07-12]↵
[user:thelonewolfclub,2024-07-12]↵
[user:torquise,2024-07-12]↵
[user:VarunGolcha,2024-07-12]↵
[user:shree_swami_samarth,2024-07-12]↵
[user:slayerr_1818,2024-07-12]↵
</spoiler>↵
↵
### Leaked Solution of E:↵
↵
<spoiler summary="E">↵
↵
~~~~~↵
#include <bits/stdc++.h>↵
using namespace std;↵
↵
void run() {↵
int n; cin >> n;↵
↵
vector ans(0, pair(0, 0));↵
↵
string s;↵
for (int a = 1; a <= 10000; a++) {↵
s += to_string(n);↵
for (int b = max(1, int(s.size())-6); b <= min(10000, a100) and b < int(s.size()); b++) {↵
if (to_string(na-b) == s.substr(0, s.size()-b)) {↵
ans.emplace_back(a, b);↵
}↵
}↵
}↵
↵
cout << ans.size() << '\n';↵
for (auto [a, b] : ans) {↵
cout << a << ' ' << b << '\n';↵
}↵
}↵
↵
int main() {↵
cin.tie(0)->sync_with_stdio(0);↵
↵
int t; cin >> t; while (t--) run();↵
} ↵
~~~~~↵
↵
↵
</spoiler>↵
↵
### List of Cheater for E:↵
↵
<spoiler summary="E Cheaters">↵
[user:BugBlue,2024-07-12]↵
[user:hasan1485,2024-07-12]↵
[user:KALiIi24,2024-07-12]↵
[user:thegreat_gordini14,2024-07-12]↵
[user:divyanshubissa88,2024-07-12]↵
[user:muditlodha3,2024-07-12]↵
[user:YuAn.HR,2024-07-12]↵
[user:whu_yx,2024-07-12]↵
[user:akshatchaudhary,2024-07-12]↵
[user:aakash_kalra,2024-07-12]↵
[user:ByteBard16,2024-07-12]↵
[user:wzxaurora,2024-07-12]↵
[user:aloolelopls,2024-07-12]↵
[user:dinskid,2024-07-12]↵
[user:HyperNovaVY,2024-07-12]↵
[user:TLE_lord,2024-07-12]↵
[user:_tanush_,2024-07-12]↵
[user:_rbr__iiita,2024-07-12]↵
[user:Dr.rabi3,2024-07-12]↵
[user:Nitish_Bharat,2024-07-12]↵
</spoiler>↵
↵
### Expert in Cheating:↵
These cheaters deserve special mention as they converted the language of the copied code to save themselves from plagiarism detection.↵
Someone of them even Changed language 3-4 times in a single contest. Hopefully we found them cheated by their codes.↵
↵
<spoiler summary="Pro Cheaters">↵
[user:Kartikey_21534,2024-07-12]↵
[user:jainam_shah,2024-07-12]↵
[user:mmmm5,2024-07-12]↵
[user:Pratham_2021347,2024-07-12]↵
[user:Pulkit1501,2024-07-12]↵
[user:sree_27,2024-07-12]↵
[user:vikram_iitm,2024-07-12]↵
[user:phir_bhi_aas_lagi_hai,2024-07-12]↵
[user:sabbirsajids45,2024-07-12]↵
[user:bawal,2024-07-12]↵
[user:Shivam_Yqdqv,2024-07-12]↵
[user:Phoenix750,2024-07-12]↵
[user:ganesh_2004,2024-07-12]↵
[user:madhuhasitha,2024-07-12]↵
↵
</spoiler>↵
↵
Since there are a lot of cheaters this time, our team is still processing and will update this list accordingly.↵
↵
I would like to request [user:MikeMirzayanov,2024-07-12], [user:Vladosiya,2024-07-12] and [user:Gornak40,2024-07-12] to take actions on the cheaters as well people who are leaking the solutions.↵
↵
I would also request to take strict action on [user:kyakaregajanke,2024-07-12] who leaked the solutions on Youtube and provided the solutions in a drive link and telegram too.↵
↵
<spoiler summary="Leaked on Youtube">↵
<a href="https://ibb.co/S7Y4P2c"><img src="https://i.ibb.co/zH9Tr1F/pic.png" alt="pic" border="0"></a>↵
[Screenshot link](https://ibb.co/S7Y4P2c)↵
</spoiler>↵
↵
↵
↵
Here is the drive link : [Leaked Solution Drive](https://drive.google.com/drive/folders/1NZDh9PsqOB3tUE2TZECbjbN_Kf2VJ6SO)↵
Anyone with this code has just copied from here .↵
↵
Disclaimer: The IDs mentioned here are potential cheaters. There's a very low yet non zero chance that some innocent account gets mentioned here. In that case no need to complain in the comments/dm. You won't get skipped if u have not cheated.↵
↵
↵
↵
↵
I would like to thank the entire **Cheat Patrol** team for exposing cheaters.↵
Special thanks to [user:Vladosiya,2024-07-12] for actively helping us in the server and taking actions on convicted cheaters↵
↵
If you are interested in volunteering us in exposing cheaters.↵
You can join our **Cheat Patrol** server : [Cheat Patrol Discord Server](https://discord.com/invite/kKZhfAWKfE)↵
↵
### Leaked Solution of D:↵
`almost all D submissions using BFS are copied.`↵
↵
<spoiler summary="D Leak 1 ">↵
↵
~~~~~↵
#include <iostream>↵
#include <queue>↵
#include <vector>↵
#include <string>↵
↵
using namespace std;↵
↵
struct State {↵
int pos;↵
int swim;↵
};↵
↵
int main() {↵
int t;↵
cin >> t;↵
while (t--) {↵
int n, m, k;↵
cin >> n >> m >> k;↵
string river;↵
cin >> river;↵
↵
vector<bool> visited(n + 2, false);↵
queue<State> q;↵
↵
// Starting point at position 0↵
q.push({0, 0});↵
visited[0] = true;↵
↵
bool canReach = false;↵
↵
while (!canReach && !q.empty()) {↵
State current = q.front();↵
q.pop();↵
↵
int pos = current.pos;↵
int swim = current.swim;↵
↵
// Try jumping from the current position↵
if (pos == 0 || river[pos - 1] == 'L') {↵
for (int jump = 1; jump <= m; ++jump) {↵
int newPos = pos + jump;↵
if (newPos == n + 1) {↵
canReach = true;↵
break;↵
}↵
if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {↵
visited[newPos] = true;↵
q.push({newPos, swim});↵
}↵
}↵
}↵
↵
// Try swimming to the next position if currently in water↵
if (pos > 0 && pos <= n && river[pos - 1] == 'W' && swim < k) {↵
int newPos = pos + 1;↵
if (newPos == n + 1) {↵
canReach = true;↵
break;↵
}↵
if (newPos <= n && river[newPos - 1] != 'C' && !visited[newPos]) {↵
visited[newPos] = true;↵
q.push({newPos, swim + 1});↵
}↵
}↵
}↵
↵
cout << (canReach ? "YES" : "NO") << endl;↵
}↵
return 0;↵
}↵
~~~~~↵
↵
</spoiler>↵
↵
<spoiler summary="D Leak 2">↵
↵
~~~~~↵
#include <iostream>↵
using namespace std;↵
#include<bits/stdc++.h>↵
↵
int main() ↵
{↵
int numberOfTestCases;↵
cin >> numberOfTestCases;↵
while(numberOfTestCases--){↵
↵
int casseroleLength, initialPieces, finalPieces;↵
cin >> casseroleLength >> initialPieces >> finalPieces;↵
string monkActions;↵
cin >> monkActions;↵
int currentPieceIndex = initialPieces - 1, wastedPieces = 0, failedOperations = 0;↵
for(auto actionIndex = 0; actionIndex < monkActions.size(); actionIndex++){↵
char action = monkActions[actionIndex];↵
if(action == 'L'){↵
currentPieceIndex = initialPieces;↵
}↵
else if(action == 'W'){↵
if(currentPieceIndex <= 0) wastedPieces++;↵
}↵
else{↵
if(currentPieceIndex <= 0) failedOperations++;↵
}↵
currentPieceIndex--;↵
}↵
↵
if(wastedPieces > finalPieces) failedOperations++;↵
↵
cout << (failedOperations!= 0? "NO" : "YES") << endl;↵
↵
}↵
return 0;↵
}↵
~~~~~↵
↵
↵
</spoiler>↵
↵
↵
### List of Cheater for D:↵
↵
<spoiler summary="D Cheaters">↵
[user:DylanT,2024-07-12]↵
[user:bharath_kumar2005,2024-07-12]↵
[user:Sumit2023102,2024-07-12]↵
[user:Emil_Hajiyev,2024-07-12]↵
[user:xinglili,2024-07-12]↵
[user:adxtya02,2024-07-12]↵
[user:noname_000,2024-07-12]↵
[user:ayush201,2024-07-12]↵
[user:u_kidding_me,2024-07-12]↵
[user:govinthan_ks,2024-07-12]↵
[user:Immortal_22,2024-07-12]↵
[user:thelonewolfclub,2024-07-12]↵
[user:torquise,2024-07-12]↵
[user:VarunGolcha,2024-07-12]↵
[user:shree_swami_samarth,2024-07-12]↵
[user:slayerr_1818,2024-07-12]↵
</spoiler>↵
↵
### Leaked Solution of E:↵
↵
<spoiler summary="E">↵
↵
~~~~~↵
#include <bits/stdc++.h>↵
using namespace std;↵
↵
void run() {↵
int n; cin >> n;↵
↵
vector ans(0, pair(0, 0));↵
↵
string s;↵
for (int a = 1; a <= 10000; a++) {↵
s += to_string(n);↵
for (int b = max(1, int(s.size())-6); b <= min(10000, a100) and b < int(s.size()); b++) {↵
if (to_string(na-b) == s.substr(0, s.size()-b)) {↵
ans.emplace_back(a, b);↵
}↵
}↵
}↵
↵
cout << ans.size() << '\n';↵
for (auto [a, b] : ans) {↵
cout << a << ' ' << b << '\n';↵
}↵
}↵
↵
int main() {↵
cin.tie(0)->sync_with_stdio(0);↵
↵
int t; cin >> t; while (t--) run();↵
} ↵
~~~~~↵
↵
↵
</spoiler>↵
↵
### List of Cheater for E:↵
↵
<spoiler summary="E Cheaters">↵
[user:BugBlue,2024-07-12]↵
[user:hasan1485,2024-07-12]↵
[user:KALiIi24,2024-07-12]↵
[user:thegreat_gordini14,2024-07-12]↵
[user:divyanshubissa88,2024-07-12]↵
[user:muditlodha3,2024-07-12]↵
[user:YuAn.HR,2024-07-12]↵
[user:whu_yx,2024-07-12]↵
[user:akshatchaudhary,2024-07-12]↵
[user:aakash_kalra,2024-07-12]↵
[user:ByteBard16,2024-07-12]↵
[user:wzxaurora,2024-07-12]↵
[user:aloolelopls,2024-07-12]↵
[user:dinskid,2024-07-12]↵
[user:HyperNovaVY,2024-07-12]↵
[user:TLE_lord,2024-07-12]↵
[user:_tanush_,2024-07-12]↵
[user:_rbr__iiita,2024-07-12]↵
[user:Dr.rabi3,2024-07-12]↵
[user:Nitish_Bharat,2024-07-12]↵
</spoiler>↵
↵
### Expert in Cheating:↵
These cheaters deserve special mention as they converted the language of the copied code to save themselves from plagiarism detection.↵
Someone of them even Changed language 3-4 times in a single contest. Hopefully we found them cheated by their codes.↵
↵
<spoiler summary="Pro Cheaters">↵
[user:Kartikey_21534,2024-07-12]↵
[user:jainam_shah,2024-07-12]↵
[user:mmmm5,2024-07-12]↵
[user:Pratham_2021347,2024-07-12]↵
[user:Pulkit1501,2024-07-12]↵
[user:sree_27,2024-07-12]↵
[user:vikram_iitm,2024-07-12]↵
[user:phir_bhi_aas_lagi_hai,2024-07-12]↵
[user:sabbirsajids45,2024-07-12]↵
[user:bawal,2024-07-12]↵
[user:Shivam_Yqdqv,2024-07-12]↵
[user:Phoenix750,2024-07-12]↵
[user:ganesh_2004,2024-07-12]↵
[user:madhuhasitha,2024-07-12]↵
↵
</spoiler>↵
↵
Since there are a lot of cheaters this time, our team is still processing and will update this list accordingly.↵
↵
I would like to request [user:MikeMirzayanov,2024-07-12], [user:Vladosiya,2024-07-12] and [user:Gornak40,2024-07-12] to take actions on the cheaters as well people who are leaking the solutions.↵
↵
I would also request to take strict action on [user:kyakaregajanke,2024-07-12] who leaked the solutions on Youtube and provided the solutions in a drive link and telegram too.↵
↵
<spoiler summary="Leaked on Youtube">↵
<a href="https://ibb.co/S7Y4P2c"><img src="https://i.ibb.co/zH9Tr1F/pic.png" alt="pic" border="0"></a>↵
[Screenshot link](https://ibb.co/S7Y4P2c)↵
</spoiler>↵
↵
↵
↵
Here is the drive link : [Leaked Solution Drive](https://drive.google.com/drive/folders/1NZDh9PsqOB3tUE2TZECbjbN_Kf2VJ6SO)↵
Anyone with this code has just copied from here .↵
↵
Disclaimer: The IDs mentioned here are potential cheaters. There's a very low yet non zero chance that some innocent account gets mentioned here. In that case no need to complain in the comments/dm. You won't get skipped if u have not cheated.↵
↵
↵
↵
