oj.uz

답안 #931206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931206 2024-02-21T11:26:31 Z parlimoos 비밀 (JOI14_secret) C++14
6 / 100
 6611 ms 4504 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
 
int n;
vector<int> a;
 
void Init(int N , int A[]){
  n = N;
  for(int i = 0 ; i < n ; i++) a.push_back(A[i]);
}
int Query(int L , int R){
  int res = a[L];
  for(int i = L + 1 ; i <= R ; i++) res = Secret(res , a[i]);
  return res;
}

Subtask #1
6.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1280 ms 3064 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 506
2 Partially correct 1238 ms 2816 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 508
3 Partially correct 1282 ms 2812 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 505
4 Partially correct 2631 ms 4504 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 997
5 Partially correct 2685 ms 4496 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 992
6 Partially correct 382 ms 4504 KB Output is partially correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 10
7 Partially correct 6611 ms 4492 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
8 Partially correct 6440 ms 4492 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999
9 Partially correct 6515 ms 4492 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 998
10 Partially correct 6463 ms 4492 KB Output isn't correct - number of calls to Secret by Init = 0, maximum number of calls to Secret by Query = 999