# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
823790 |
2023-08-13T06:39:18 Z |
Alihan_8 |
Secret (JOI14_secret) |
C++17 |
|
782 ms |
8180 KB |
#include <bits/stdc++.h>
#include "secret.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];
a[i][i] = t;
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];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
198 ms |
4272 KB |
Output isn't correct - number of calls to Secret by Init = 130305, maximum number of calls to Secret by Query = 0 |
2 |
Partially correct |
208 ms |
4348 KB |
Output isn't correct - number of calls to Secret by Init = 130816, maximum number of calls to Secret by Query = 0 |
3 |
Partially correct |
194 ms |
4288 KB |
Output isn't correct - number of calls to Secret by Init = 131328, maximum number of calls to Secret by Query = 0 |
4 |
Partially correct |
734 ms |
8180 KB |
Output isn't correct - number of calls to Secret by Init = 498501, maximum number of calls to Secret by Query = 0 |
5 |
Partially correct |
737 ms |
8136 KB |
Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0 |
6 |
Partially correct |
739 ms |
8104 KB |
Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0 |
7 |
Partially correct |
755 ms |
8164 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 |
737 ms |
8136 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 |
744 ms |
8180 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 |
782 ms |
8136 KB |
Output isn't correct - number of calls to Secret by Init = 499500, maximum number of calls to Secret by Query = 0 |