oj.uz

Submission #51803

# Submission time Handle Problem Language Result Execution time Memory
51803 2018-06-21T08:43:06 Z gs14004 씽크스몰 (kriii3_TT) C++17
20 / 30
 1857 ms 66296 KB 
#include <bits/stdc++.h>
#define dbgv(v) {for(auto x:v)cout<<x<<' ';cout<<'\n';}
#define entire(v) v.begin(),v.end()
typedef long long ll;
using namespace std;
void OJize(){
    cin.tie(NULL); ios_base::sync_with_stdio(false);
    #ifdef jh
    freopen("input.txt", "r", stdin);
    #endif
}
 
int SZ = 1, N = 1<<SZ;
 
int Rev(int x){
    int r = 0;
    for(int i=0; i<SZ; i++) r = r<<1 | (x&1), x>>= 1;
    return r;
}
const long double PI = 3.14159265358979323846264338;
typedef complex<long double> CD;
typedef vector<CD> VCD;
void FFT(VCD& A, int f){
    CD x, y, z;
    for(int i=0; i<N; i++){
        int j = Rev(i);
        if(i < j) swap(A[i], A[j]);
    }
    for(int i=1; i<N; i<<= 1){
        long double w = PI / i;
        if(f) w = -w;
        CD x(cos(w), sin(w));
        for(int j=0; j<N; j+= i<<1){
            CD y(1);
            for(int k=0; k<i; k++){
                CD z = A[i+j+k] * y;
                A[i+j+k] = A[j+k] - z, A[j+k]+= z;
                y*= x;
            }
        }
    }
    if(f) for(int i=0; i<N; i++) A[i]/= N;
}
 
int main(){OJize();
    int n, m, x; cin>>n>>m;
    while(n+m+2 > N) SZ++, N<<=1;
    VCD A(N), B(N), AR(N), BR(N);
    
    for(int i=0; i<n+1; i++) cin>>x, A[i] = CD(x>>15, x&0x7fff);
    for(int i=0; i<m+1; i++) cin>>x, B[i] = CD(x>>15, x&0x7fff);
    FFT(A, 0); FFT(B, 0);
    for(int i=0; i<N; i++){
        int j = i? N-i : i;
        CD f1 = (A[i] + conj(A[j])) / CD(2, 0), f2 = (A[i] - conj(A[j])) / CD(0, 2),
           f3 = (B[i] + conj(B[j])) / CD(2, 0), f4 = (B[i] - conj(B[j])) / CD(0, 2);
        AR[i] = f1 * (f3 + f4 * CD(0, 1)), BR[i] = f2 * (f3 + f4 * CD(0, 1));
    }
    FFT(AR, 1); FFT(BR, 1);
    ll ans = 0;
    for(int i=0; i<n+m+2; i++){
        ll ar = roundl(real(AR[i])), ai = roundl(imag(AR[i])),
           br = roundl(real(BR[i])), bi = roundl(imag(BR[i]));
        ll res = bi + ((ai + br) << 16) + (ar << 32);
        ans^= res;
    }
    cout << ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 428 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 6 ms 852 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 6 ms 852 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 4704 KB Output is correct
2 Correct 363 ms 17124 KB Output is correct
3 Correct 358 ms 17124 KB Output is correct
4 Correct 753 ms 33512 KB Output is correct
5 Correct 786 ms 33512 KB Output is correct
6 Correct 750 ms 33512 KB Output is correct
7 Correct 775 ms 33512 KB Output is correct
8 Correct 750 ms 33512 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1857 ms 66296 KB Output isn't correct
2 Halted 0 ms 0 KB -