"复仇者联盟"处罚公告

userId_undefined

复仇者_澜

秩序白银

2024-11-04 13:35:19

发布于：广东

1214阅读
0回复
0点赞

在“10月排位赛#6”中，我们发现用户复仇者小ZUZU_童瑞琪专属奴隶，ID：937283，在比赛T3，T4，T6中涉嫌使用AI生成代码进行不正当竞争，对此做出惩罚，将其踢出团队，此后不得再加入团队。
以下是我们找到的证据

@复仇者小ZUZU_童瑞琪专属奴隶 T3的代码

#include <iostream>
#include <algorithm>

using namespace std;

bool can_reach(long long a, long long b, long long x) {
    if (a == x || b == x) return true;
    if (a < b) swap(a, b);
    if (a == 0 || b == 0) return false;
    if (a == b) return a == x;
    if (x > a) return false;
    if (x % b == a % b) return true;
    return can_reach(a % b, b, x);
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        long long a, b, x;
        cin >> a >> b >> x;
        if (can_reach(a, b, x)) {
            cout << "YES" << endl;
        } else {
            cout << "NO" << endl;
        }
    }
    return 0;
}

而这是@复仇者_零提供的由canvas写出的代码

#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;

bool canReach(ll a, ll b, ll x) {
    while (a != 0 && b != 0) {
        if (a < b) swap(a, b); // Ensure a >= b
        if (a == x || b == x) return true;
        if (b == 0) return false;
        // Check if x can be reached directly or by subtracting multiples of b from a
        if ((a - x) % b == 0 && a >= x) return true;
        a %= b;
    }
    return false;
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        ll a, b, x;
        cin >> a >> b >> x;
        if (canReach(a, b, x)) {
            cout << "YES" << endl;
        } else {
            cout << "NO" << endl;
        }
    }
    return 0;
}

经过AI比对，发现

@复仇者小ZUZU_童瑞琪专属奴隶 T6的代码

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class UnionFind {
public:
    vector<int> parent;
    vector<int> size;
    vector<int> max_node;

    UnionFind(int n) {
        parent.resize(n + 1);
        size.resize(n + 1, 1);
        max_node.resize(n + 1);
        for (int i = 1; i <= n; ++i) {
            parent[i] = i;
            max_node[i] = i;
        }
    }

    int find(int x) {
        if (parent[x] != x) {
            parent[x] = find(parent[x]);
        }
        return parent[x];
    }

    void unionSets(int x, int y) {
        int rootX = find(x);
        int rootY = find(y);
        if (rootX != rootY) {
            if (size[rootX] < size[rootY]) {
                swap(rootX, rootY);
            }
            parent[rootY] = rootX;
            size[rootX] += size[rootY];
            max_node[rootX] = max(max_node[rootX], max_node[rootY]);
        }
    }

    int getMaxNode(int x) {
        return max_node[find(x)];
    }
};

int main() {
    int N, M;
    cin >> N >> M;

    UnionFind uf(N);

    for (int i = 0; i < M; ++i) {
        int A, B;
        cin >> A >> B;
        uf.unionSets(A, B);
    }

    for (int i = 1; i <= N; ++i) {
        cout << uf.getMaxNode(i) << " ";
    }
    cout << endl;

    return 0;
}

而这是@复仇者_零提供的由GPT-4写出的代码

#include <iostream>
#include <vector>

using namespace std;

class UnionFind {
    vector<int> parent, rank, maxInComponent;

public:
    UnionFind(int size) : parent(size + 1), rank(size + 1, 0), maxInComponent(size + 1) {
        for (int i = 1; i <= size; ++i) {
            parent[i] = i;
            maxInComponent[i] = i; // Initially, the max island in each component is itself
        }
    }

    int find(int u) {
        if (parent[u] != u) {
            parent[u] = find(parent[u]); // Path compression
        }
        return parent[u];
    }

    void unionSets(int u, int v) {
        int rootU = find(u);
        int rootV = find(v);

        if (rootU != rootV) {
            if (rank[rootU] > rank[rootV]) {
                parent[rootV] = rootU;
                maxInComponent[rootU] = max(maxInComponent[rootU], maxInComponent[rootV]);
            } else if (rank[rootU] < rank[rootV]) {
                parent[rootU] = rootV;
                maxInComponent[rootV] = max(maxInComponent[rootV], maxInComponent[rootU]);
            } else {
                parent[rootV] = rootU;
                rank[rootU]++;
                maxInComponent[rootU] = max(maxInComponent[rootU], maxInComponent[rootV]);
            }
        }
    }

    int getMaxInComponent(int u) {
        int root = find(u);
        return maxInComponent[root];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;
    
    UnionFind uf(N);

    for (int i = 0; i < M; ++i) {
        int Ai, Bi;
        cin >> Ai >> Bi;
        uf.unionSets(Ai, Bi);
    }

    for (int i = 1; i <= N; ++i) {
        cout << uf.getMaxInComponent(i) << " ";
    }

    cout << endl;

    return 0;
}

几乎一模一样......

我们有足够好的检测方式，可以检测出每个作弊的人！！！

希望这种事情不要再发生，希望大家公平竞争。我们不会惋惜任何一位成员！！！

userId_undefined
去预览
0/2000

全部评论 114

热门讨论