oj.uz

답안 #823789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823789 2023-08-13T06:38:16 Z Alihan_8 비밀 (JOI14_secret) C++17
0 / 100
 746 ms 8292 KB 
#include "secret.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
//#define int long long

template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag = false;
    if ( x > y ){
        x = y; flag |= true;
    }
    return flag;
}

template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}

const int N = 1e3 + 1;

int a[N][N];

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

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

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 205 ms 4384 KB Wrong Answer: Query(56, 56) - expected : 677274107, actual : 0.
2 Incorrect 200 ms 4416 KB Wrong Answer: Query(389, 389) - expected : 472506730, actual : 0.
3 Incorrect 205 ms 4432 KB Wrong Answer: Query(18, 18) - expected : 238214183, actual : 0.
4 Incorrect 738 ms 8188 KB Wrong Answer: Query(788, 788) - expected : 937598145, actual : 0.
5 Incorrect 739 ms 8248 KB Wrong Answer: Query(957, 957) - expected : 115761809, actual : 0.
6 Incorrect 746 ms 8292 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 0.
7 Partially correct 746 ms 8184 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
8 Partially correct 744 ms 8268 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
9 Partially correct 740 ms 8216 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0
10 Partially correct 745 ms 8256 KB Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0