oj.uz

답안 #301698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
301698 2020-09-18T06:18:29 Z aloo123 비밀 (JOI14_secret) C++14
0 / 100
 506 ms 8568 KB 
        #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "secret.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
 
 
const ll INF = 1e12;
const int M =(1e3+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
int a[M];
int n;
int pref[M][M];
void divi(int l, int r) { // generate dat and mask
    if(l < 1 || r > n || l > r) return;
    if (l == r) {pref[l][l] = a[l];return;}

    int m = (l+r)/2; 
    pref[m][m] = a[m];
    for(int i = m-1;i>=l;i--){
        pref[i][m] = Secret(a[i],pref[i+1][m]); 
    }
    if(m + 1 <= n){
        pref[m+1][m+1] = a[m+1];
        for(int i = m+2;i<=r;i++){
            pref[m][i] = Secret(pref[m][i-1],a[i]);
        }
    }
    divi(l,m);
    divi(m+1,r);
}

 
 
void Init(int N,int A[]){
    n = N;
    for(int i = 0;i<n;i++){
        a[i+1] = A[i];
    }
    divi(1,n);
 
}
int Query(int L, int R){
    L++,R++;
    if(L == R){
        return a[L];
    }
    int m = (L+R)>>1ll;
    return Secret(pref[L][m],pref[m+1][R]);
}

 
 
// void solve(){
    
// }
// signed main(){
 
//     ios_base::sync_with_stdio(0);
//     cin.tie(NULL);
//      // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
//      ll tt=1;   
//      // cin >> tt;
//     while(tt--){    
//         solve();
//     }    
// }

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 135 ms 4472 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 843210361.
2 Incorrect 138 ms 4472 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0.
3 Incorrect 136 ms 4472 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912.
4 Incorrect 503 ms 8212 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912.
5 Incorrect 503 ms 8440 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912.
6 Incorrect 502 ms 8568 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 536870912.
7 Incorrect 502 ms 8184 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0.
8 Incorrect 506 ms 8316 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912.
9 Incorrect 497 ms 8184 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0.
10 Incorrect 497 ms 8184 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0.