| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 293218 |
2020-09-07T19:08:34 Z |
XmtosX |
Secret (JOI14_secret) |
C++17 |
|
507 ms |
8824 KB |
#include <bits/stdc++.h>;
#include "secret.h"
using namespace std;
#define LL pos*2+1
#define RR pos*2+2
const int NN=1e3+3;
long long seg[NN*4],a[NN],n,l,r,ans[NN][NN];
void build (int st,int en,int pos)
{
if (st==en)
{
seg[pos]=a[st];
return;
}
int mid= (st+en)/2;
build(st,mid,LL);
build(mid+1,en,RR);
seg[pos]=Secret(seg[LL],seg[RR]);
}
int query(int st,int en,int pos)
{
if (st>=l&&en<=r)
return seg[pos];
int mid=(st+en)/2;
int p1=-1,p2=-1;
if (!(st>r||mid<l))
p1=query(st,mid,LL);
if (!(mid+1>r||en<l))
p2=query(mid+1,en,RR);
if (p1==-1)
return p2;
if (p2==-1)
return p1;
return Secret(p1,p2);
}
void Init(int N, int A[])
{
n=N;
for (int i=0;i<n;i++)
a[i]=A[i];
bool x[4]={true};
for (int i=0;i<1000;i++)
{
if (Secret(i,i+1)==i+i+1)
x[0]=false;
if (Secret(i,i+1)==i|(i+1))
x[1]=false;
if (Secret(i,i+1)==i^(i+1))
x[2]=false;
if (Secret(i,i+1)==i*(i+1))
x[3]=false;
}
if (x[0]|x[1]|x[2]|x[3])
assert(0);
bool yes=true;
for (int i=0;i<1000;i++)
{
if (Secret(i,i+1)!=i+i+1)
yes=false;
}
if (yes)
{
for (int i=0;i<n;i++)
{
ans[i][i]=a[i];
for (int j=i+1;j<n;j++)
{
ans[i][j]=ans[i][j-1]+a[i];
ans[i][j]=min(ans[i][j],(long long)1e9);
}
}
}
yes=true;
for (int i=0;i<1000;i++)
{
if (Secret(i,i+1)!=i|(i+1))
yes=false;
}
if (yes)
{
for (int i=0;i<n;i++)
{
ans[i][i]=a[i];
for (int j=i+1;j<n;j++)
{
ans[i][j]=ans[i][j-1]|a[i];
ans[i][j]=min(ans[i][j],(long long)1e9);
}
}
}
yes=true;
for (int i=0;i<1000;i++)
{
if (Secret(i,i+1)!=i*(i+1))
yes=false;
}
if (yes)
{
for (int i=0;i<n;i++)
{
ans[i][i]=a[i];
for (int j=i+1;j<n;j++)
{
ans[i][j]=ans[i][j-1]*a[i];
ans[i][j]=min(ans[i][j],(long long)1e9);
}
}
}
yes=true;
for (int i=0;i<1000;i++)
{
if (Secret(i,i+1)!=i^(i+1))
yes=false;
}
if (yes)
{
for (int i=0;i<n;i++)
{
ans[i][i]=a[i];
for (int j=i+1;j<n;j++)
{
ans[i][j]=ans[i][j-1]^a[i];
ans[i][j]=min(ans[i][j],(long long)1e9);
}
}
}
yes=true;
}
int Query(int L, int R)
{
l=L;
r=R;
return ans[l][r];
}
/*
8
1 4 7 2 5 8 3 6
4
0 3
1 7
5 5
2 4
*/
Compilation message
secret.cpp:1:25: warning: extra tokens at end of #include directive
1 | #include <bits/stdc++.h>;
| ^
secret.cpp: In function 'void Init(int, int*)':
secret.cpp:46:26: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
46 | if (Secret(i,i+1)==i|(i+1))
| ~~~~~~~~~~~~~^~~
secret.cpp:48:26: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
48 | if (Secret(i,i+1)==i^(i+1))
| ~~~~~~~~~~~~~^~~
secret.cpp:76:26: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
76 | if (Secret(i,i+1)!=i|(i+1))
| ~~~~~~~~~~~~~^~~
secret.cpp:112:26: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
112 | if (Secret(i,i+1)!=i^(i+1))
| ~~~~~~~~~~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
137 ms |
4728 KB |
Execution killed with signal 11 |
| 2 |
Runtime error |
135 ms |
4728 KB |
Execution killed with signal 11 |
| 3 |
Runtime error |
134 ms |
4728 KB |
Execution killed with signal 11 |
| 4 |
Incorrect |
503 ms |
4344 KB |
Wrong Answer: Query(90, 497) - expected : 397934825, actual : 0. |
| 5 |
Runtime error |
492 ms |
8568 KB |
Execution killed with signal 11 |
| 6 |
Runtime error |
496 ms |
8824 KB |
Execution killed with signal 11 |
| 7 |
Incorrect |
499 ms |
4384 KB |
Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0. |
| 8 |
Runtime error |
497 ms |
8696 KB |
Execution killed with signal 11 |
| 9 |
Runtime error |
507 ms |
8732 KB |
Execution killed with signal 11 |
| 10 |
Incorrect |
497 ms |
4344 KB |
Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0. |
