답안 #515123

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
515123 2022-01-19T03:41:19 Z triplem5ds 비밀 (JOI14_secret) C++14
컴파일 오류
0 ms 0 KB
/// Zengy MANGA
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))

using ll = long long;
using ii = pair<int,int>;
using ull = unsigned long long;
using db = long double;

const int N = 1e3+5, LG = 18, MOD = 998244353;
const long double PI = acos(-1);
int tb[11][N];
int n, a[N];
int S[N];
void Init(int N, int A[]) {
    n = N;
    f(i,2,N)S[i] = S[i >> 1] + 1;
    f(i,0,n)    a[i] = A[i], tb[0][i] = a[i];
    for(int j = 1; j < 10; j++)
    for(int i = 0; i + (1 << j) <= n; i++)
        tb[j][i] = Secret(tb[j-1][i], tb[j-1][i+(1 << (j-1))]);
}
int Query(int l, int r) {
    if(l==r)
        return tb[0][l];
    int k = S[r-l+1];
    return Secret(tb[k][l], tb[k][r-(1 << k)+1]);
}
//void doWork() {
//
//
//
//
//}
//
//int32_t main() {
//#ifdef ONLINE_JUDGE
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//#endif
//
//    int t = 1;
////    cin >> t;
//    while(t--) {
//        doWork();
//    }
//
//    return 0;
//}

Compilation message

secret.cpp: In function 'void Init(int, int*)':
secret.cpp:36:20: error: 'Secret' was not declared in this scope
   36 |         tb[j][i] = Secret(tb[j-1][i], tb[j-1][i+(1 << (j-1))]);
      |                    ^~~~~~
secret.cpp: In function 'int Query(int, int)':
secret.cpp:42:12: error: 'Secret' was not declared in this scope
   42 |     return Secret(tb[k][l], tb[k][r-(1 << k)+1]);
      |            ^~~~~~