| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 22798 | Jongwon Party (#40) | Window Xor (KRIII5_WX) | C++14 | 1000 ms | 199520 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef vector<int> V;
int n;
V pro(const V &a, const V &b)
{
    V r, t;
    for(const int &x: a)
        for(const int &y: b)
            r.push_back((0LL+x+y) % n);
    sort(r.begin(), r.end());
    if(r.size() == 1)
        return r;
    bool c = 0;
    for(int i = 0; i<r.size(); i++)
    {
        if(i != 0 && r[i-1] != r[i])
        {
            if(c)
                t.push_back(r[i-1]);
            c = 1;
        }
        else
            c = !c;
    }
    if(c)
        t.push_back(r[r.size()-1]);
    return t;
}
V exp(const V &a, long long t)
{
    if(t == 1)
        return a;
    if(t%2)
        return pro(exp(a, t-1), a);
    V h = exp(a, t/2);
    return pro(h, h);
}
int arr[100000];
int res[100000];
int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int k, i, j;
    long long t;
    scanf("%d%d%lld", &n, &k, &t);
    for(i = 0; i<n; i++)
        scanf("%d", &arr[i]);
    V a;
    for(i = 0; i<k; i++)
        a.push_back(i);
    a = exp(a, t);
    //for(int &x: a)
    //    res[0] ^= arr[x];
    for(i = 0; i<n; i++)
    {
        for(const int &x: a)
            res[i] ^= arr[(x+i)%n];
    }
    for(i = 0; i<n; i++)
        printf("%d ", res[i]);
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
