oj.uz

답안 #223037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223037 2020-04-14T14:34:05 Z aggu_01000101 비밀 (JOI14_secret) C++14
30 / 100
 598 ms 8440 KB 
#include "secret.h"
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
using namespace std;
int DP[1000][1000];
int segtree[4000];
int n;
int build(int l, int u, int i, int a[]){
    if(l==u) return DP[l][u] = segtree[i] = a[l];
    return DP[l][u] = segtree[i] = Secret(build(l, mid(l, u), lchild(i), a), build(mid(l, u)+1, u, rchild(i), a));
}
int query(int l, int u, int i, int ll, int uu){
    //if(DP[ll][uu]>-1) return DP[ll][uu];
    if(l>=ll && u<=uu) return segtree[i];
    if(ll>mid(l, u)) return query(mid(l, u)+1, u, rchild(i), ll, uu);
    if(uu<=mid(l, u)) return query(l, mid(l, u), lchild(i), ll, uu);
    return DP[ll][uu] = Secret(query(l, mid(l, u), lchild(i), ll, mid(l, u)), query(mid(l, u)+1, u, rchild(i), mid(l, u)+1, uu));
}
void Init(int N, int A[]){
    n = N;
    /*for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++) DP[i][j] = -1;
    }
    for(int i = 0;i<n;i++){
        for(int j = i+1;j<n;j++){
            query(0, n-1, 0, i, j);
        }
    }*/
    build(0, n-1, 0, A);
}
int Query(int L, int R){
    return query(0, n-1, 0, L, R);
}

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 197 ms 4472 KB Output is partially correct - number of calls to Secret by Init = 510, maximum number of calls to Secret by Query = 13
2 Partially correct 197 ms 4472 KB Output is partially correct - number of calls to Secret by Init = 511, maximum number of calls to Secret by Query = 14
3 Partially correct 195 ms 4476 KB Output is partially correct - number of calls to Secret by Init = 512, maximum number of calls to Secret by Query = 15
4 Partially correct 563 ms 8440 KB Output is partially correct - number of calls to Secret by Init = 998, maximum number of calls to Secret by Query = 15
5 Partially correct 564 ms 8312 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 15
6 Partially correct 512 ms 8312 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 4
7 Partially correct 595 ms 8440 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
8 Partially correct 588 ms 8312 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
9 Partially correct 595 ms 8312 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16
10 Partially correct 598 ms 8312 KB Output is partially correct - number of calls to Secret by Init = 999, maximum number of calls to Secret by Query = 16