oj.uz

답안 #94830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
94830 2019-01-24T10:44:57 Z easrui 비밀 (JOI14_secret) C++14
6 / 100
 972 ms 8572 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;

int D[1001][1001];

void Init(int N, int A[]) {
    for(int i=0; i<N; i++) D[i][i] = A[i];
    for(int i=0; i<N; i++){
        for(int j=i+1; j<N; j++){
            D[i][j] = Secret(D[i][j-1],D[j][j]);
        }
    }
}

int Query(int L, int R) {
    return D[L][R];
}

Subtask #1
6.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 256 ms 4448 KB Output isn't correct - number of calls to Secret by Init = 130305, maximum number of calls to Secret by Query = 0
2 Incorrect 263 ms 4472 KB Output isn't correct - number of calls to Secret by Init = 130816, maximum number of calls to Secret by Query = 0
3 Incorrect 256 ms 4596 KB Output isn't correct - number of calls to Secret by Init = 131328, maximum number of calls to Secret by Query = 0
4 Incorrect 955 ms 8572 KB Output isn't correct - number of calls to Secret by Init = 498501, maximum number of calls to Secret by Query = 0
5 Incorrect 954 ms 8444 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
6 Incorrect 962 ms 8396 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
7 Incorrect 972 ms 8440 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
8 Incorrect 963 ms 8372 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
9 Incorrect 968 ms 8440 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
10 Incorrect 972 ms 8440 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0