# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
881259 |
2023-12-01T02:18:00 Z |
smartmonky |
Secret (JOI14_secret) |
C++14 |
|
20000 ms |
4268 KB |
#include "secret.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
int b[10005];
int cnt = 0;
int Query(int l, int r){
vector <int> prev, cur;
for(int i = l; i <= r; i++)
cur.pb(b[i]);
while((int)cur.size() > 1){
if(cnt > 1e8)return 0;
for(int i = 0; i + 1 < r; i += 2){
prev.pb(Secret(cur[i], cur[i + 1]));
}
cnt++;
cur = prev;
prev.clear();
}
return cur[0];
}
void Init(int n, int a[])
{
for(int i=0;i<n;i++)b[i + 1]=a[i];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
20050 ms |
2652 KB |
Time limit exceeded |
2 |
Execution timed out |
20030 ms |
2728 KB |
Time limit exceeded |
3 |
Execution timed out |
20030 ms |
2696 KB |
Time limit exceeded |
4 |
Execution timed out |
20044 ms |
4176 KB |
Time limit exceeded |
5 |
Execution timed out |
20034 ms |
4260 KB |
Time limit exceeded |
6 |
Incorrect |
349 ms |
4180 KB |
Wrong Answer: Query(915, 915) - expected : 282904741, actual : 579799611. |
7 |
Execution timed out |
20070 ms |
4260 KB |
Time limit exceeded |
8 |
Execution timed out |
20100 ms |
4176 KB |
Time limit exceeded |
9 |
Execution timed out |
20021 ms |
4180 KB |
Time limit exceeded |
10 |
Execution timed out |
20017 ms |
4268 KB |
Time limit exceeded |