Use this for anything related to plagiarism - Reporting cheating, appeals, etc

Carryminati kabse krna lga programming :rofl:

3 Likes

Ky hi milega aise 5 star baan ke

2 Likes

Godzilla had a stroke trying to read this and fricking died.

1 Like

Waah! itne tejaswi log hai hamare paas.

3 Likes

Bhai tumhara code ekdam same hae leaked code se. And tumne code obfuscate karne k liye isme CodeChef: Practical coding for everyone faaltu k variable use kiye hae.

1 Like

Bro i never saw any genuine coder using dummy variable names like you . This code CodeChef: Practical coding for everyone and many others matches with your code. All are same as leaked code.

2 Likes
#include <bits/stdc++.h>
using namespace std;

#define fastio                        \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define INF 1000000000000000000
#define inf 1000000000
typedef long long ll;
typedef vector<vector<int>> vvi;
typedef vector<int> vi;
int sid=0,rasa=0;
void solve()
{
    ll n, m, k;
    cin >> n >> m >> k;
    ll x[n * m + 1], y[n * m + 1];
    rep(i, n * m) cin >> x[i + 1] >> y[i + 1];
    ll left = 1, right = n * m;
    ll steps = INF;
    ll mul = (n + 2) * (m + 2);
    while (left <= right)
    {
        ll mid = (left + right) / 2;
        vector<vector<int>> status(n + 5, vector<int>(m + 5, 0));
        for (int i = 1; i <= mid; i++)
        {
            if (i & 1)
                status[x[i]][y[i]] = 1;
            else
                status[x[i]][y[i]] = 2;
        }
        ll fn = 0;
        vvi col(n + 2, vi(m + 2, 0));
        for (int i = n; i >= 1; i--)
        {
            for (int j = 1; j <= m; j++)
            {
                if (status[i][j] == 1)
                    col[i][j] = col[i + 1][j] + 1;
                else
                    col[i][j] = 0;
            }
        }
        for (int i = n; i >= 1; i--)
        {
            for (int j = m; j >= 1; j--)
            {
                if (col[i][j] >= k)
                    col[i][j] = col[i][j + 1] + 1;
                else
                    col[i][j] = 0;
                if (col[i][j] >= k)
                    fn = 1;
            }
        }
        col.clear();
        col.resize(n + 2, vi(m + 2, 0));
        for (int i = n; i >= 1; i--)
        {
            for (int j = 1; j <= m; j++)
            {
                if (status[i][j] == 2)
                    col[i][j] = col[i + 1][j] + 1;
                else
                    col[i][j] = 0;
            }
        }
        for (int i = n; i >= 1; i--)
        {
            for (int j = m; j >= 1; j--)
            {
                if (col[i][j] >= k)
                    col[i][j] = col[i][j + 1] + 1;
                else
                    col[i][j] = 0;
                if (col[i][j] >= k)
                    fn = 2;
            }
        }
        if (fn == 0)
        {
            left = mid + 1;
        }
        else
        {
            if (mid < steps)
            {
                steps = mid;
                if (fn == 1)
                    ans = "Alice";
                else
                    ans = "Bob";
            }
            right = mid - 1;
        }
    }
    cout << ans << "\n";
}

signed main()
{

    fastio
        ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}

your solution after clear obfuscation.

check this : (CodeChef: Practical coding for everyone)

your whole things are common like status , i&1 and many things .

2 Likes

https://www.codechef.com/viewsolution/48181454

And to add you have a history of cheating in codeforces too and then bragging on linkedin.
Personal submissions - Codeforces

Your solutions are skipped

2 Likes

:rofl:

1 Like

@sid_rasa galti kiye :joy: :joy:

2 Likes

@sid_rasa
Here’s the thing this is your 1st attempt(CodeChef: Practical coding for everyone) for solving which quite stands unique but your final solution to this problem is CodeChef: Practical coding for everyone
Here you have unnecasirly declared increments/decrement operations between col.clear() and col.resize() and kept the entire code almost same with little change in variables. I havent checked ur other solutions but i can tell that u copied atleast Problem4

ab jaane dijiye :rofl:

I don’t think any action would be taken. It happens in almost every contest and codechef does nothing. They are busy promoting unacademy courses

2 Likes

image

for example
https://www.codechef.com/viewsolution/48188155
https://www.codechef.com/viewsolution/48224779
https://www.codechef.com/viewsolution/48191239

they will copy but still write BIG THINGS in their profile, I don’t know what is the origin but I have seen this solution many places, please do something

2 Likes

Actually this one we cant judge because the way its coded that’s the idea itself. But if you want to really talk about cheating just look at the solutions for problem 4. Its copied variable by variable.

1 Like

But it’s copied code line by line , and if you go to their profile even no. 4 is copied

Now he has changed his college name in his codechef profile. Made Netaji Subhas University of Technology Dwarka, Delhi, India from Netaji Subhash Engineering College. :joy: :joy:

I have gone through some of the accounts and some of them just joined the competing CodeChef contest this June only and they have solved 4 questions in Div 2 with 100% accuracy (especially where 3 was easy but observation in avg should take 2-3 trails if you first try to solve mathematically ) and no.4 which was a good problem.

#GoodLuck cheaters have a nice sleep with all those cheated points