Submission #1069474

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1069474	2024-08-22T01:54:19 Z	Requiem	Secret (JOI14_secret)	C++17	Compilation error	0 ms	0 KB

secret

#include "secret.h"

#include<bits/stdc++.h>
#define ll long long
#define FOR(i, a, b) for(int i = a; i <= b;i++)
#define FORD(i, a, b) for(int i = a; i >= b; i--)
#define TASKNAME "secret"
using namespace std;

const int MAX_VALUE = 1e9;
int Secret(int X, int Y) {
  if (!(0 <= X && X <= MAX_VALUE)) {
    fprintf(stderr, "Wrong Answer [1]\n");
    exit(0);
  }
  if (!(0 <= Y && Y <= MAX_VALUE)) {
    fprintf(stderr, "Wrong Answer [1]\n");
    exit(0);
  }
  return (X + 2 * (Y / 2) < MAX_VALUE) ? (X + 2 * (Y / 2)) : MAX_VALUE;
}

const int MAXN = 1004;
int P[20][MAXN], mask[MAXN], a[MAXN];
int n, q;

void DnC(int l, int r, int lev){
    if (l == r){
        return;
    }
    int mid = (l + r) >> 1;
    P[lev][mid] = a[mid];
    P[lev][mid + 1] = a[mid + 1];
//    printf("RANGE %lld %lld\n", l, r);
    FORD(i, mid - 1, l){
         P[lev][i] = Secret(a[i], P[lev][i + 1]);
    }
//    FORD(i, mid, l){
//         printf("%lld ", P[lev][i]);
//    }
//    printf("\n");

    FOR(i, mid + 2, r){
         P[lev][i] = Secret(P[lev][i - 1], a[i]);
    }
//    FOR(i, mid + 1, r){
//        printf("%lld ", P[lev][i]);
//    }
//    printf("\n");

    FOR(i, mid + 1, r) mask[i] ^= (1LL << lev);
    DnC(l, mid, lev + 1);
    DnC(mid + 1, r, lev + 1);
}
void Init(int N, int A[]) {
    FOR(i, 0, N - 1){
        a[i] = A[i];
    }
    DnC(0, N - 1, 0);
}

int Query(int L, int R) {

  if (L == R) return a[L];
  else{
     int bit = __builtin_ctz(mask[L] ^ mask[R]);
//     printf("%lld %lld %lld\n", bit, P[bit][L], P[bit][R]);
     return Secret(P[bit][L], P[bit][R]);
  }
  return 0;
}

Compilation message

/usr/bin/ld: /tmp/ccMURdzR.o: in function `Secret(int, int)':
secret.cpp:(.text+0x0): multiple definition of `Secret(int, int)'; /tmp/ccP9QlhR.o:grader.cpp:(.text+0x2d0): first defined here
collect2: error: ld returned 1 exit status