제출 #1280307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280307		nhmktu	비밀 (JOI14_secret)	C++17	0 / 100	334 ms	4408 KiB

secret

#include <bits/stdc++.h>
#include "secret.h"
#define ll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define pi pair<int,int>
#define pii pair<int,pi>
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) (int) a.size()
#define endl '\n'
#define data "secret"

using namespace std;
const ll linf = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7, MX = 1e5;

void add(int &a, int b)
{
    a += b;
    if(a>=MOD)
        a-=MOD;
    if(a<0)
        a += MOD;
}

int modulo(int x)
{
    if(x<=1)
        return 1;
    return (MOD - MOD/x) * modulo(MOD/x) % MOD;
}

int mul(int a, int b)
{
    return (1ll *a%MOD * b%MOD) % MOD;
}

int N;
int A[MX+3];

void Init(int N, int A[])
{
    cin >> N;
    FOR(i, 0, N - 1) cin >> A[i];
}

int Query(int L, int R)
{
//    int k = __builtin_ctz( mask[L] ^ mask[R] );
//    return calc(acc[L][k], acc[R][k]);
    int ans = A[L];
    FOR(i, L + 1, R) ans = Secret(ans, A[i]);
    return ans;
}

• Subtask 1: 0 / 100