oj.uz

Submission #21129

# Submission time Handle Problem Language Result Execution time Memory
21129 2017-04-04T18:37:25 Z sbansalcs Secret (JOI14_secret) C++14
100 / 100
 619 ms 12956 KB 
#include "secret.h"
int val[1002][1002], hav[1002][1002], X[1002];
void comp(int a, int b)  {
	if(a>=b)	return;
    if(b-a==1)  hav[a][b]=1,val[a][b]=Secret(X[a],X[b]);
    int f=(a+b)/2,f2=f+1;
    for(int i=f-1;i>=a;i--)	hav[i][f]=1,val[i][f]=(i==f-1)?Secret(X[i],X[f]):Secret(X[i],val[i+1][f]);
    for(int i=f+2;i<=b;i++)	hav[f+1][i]=1,val[f+1][i]=(i==f+2)?Secret(X[f+1],X[i]):Secret(val[f+1][i-1],X[i]);
    if(hav[f][f2]==0)	hav[f][f2]=1,val[f][f2]=Secret(X[f],X[f2]);
    comp(a,f-1),comp(f2+1,b);
}
void Init(int N, int A[]) {
	for(int i=1;i<=N;i++)	X[i]=A[i-1],hav[i][i]=1,val[i][i]=A[i-1];
	comp(1,N);
}
int Query(int L, int R) {
	if(hav[L+1][R+1])	return val[L+1][R+1];
	for(int i=L+1;i<=R;i++)	{
		if(hav[L+1][i] && hav[i+1][R+1])	return Secret(val[L+1][i],val[i+1][R+1]);
	}
  return -1;
}

Compilation message

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 12956 KB Output is correct - number of calls to Secret by Init = 3339, maximum number of calls to Secret by Query = 1
2 Correct 173 ms 12956 KB Output is correct - number of calls to Secret by Init = 3347, maximum number of calls to Secret by Query = 1
3 Correct 173 ms 12956 KB Output is correct - number of calls to Secret by Init = 3355, maximum number of calls to Secret by Query = 1
4 Correct 619 ms 12956 KB Output is correct - number of calls to Secret by Init = 7476, maximum number of calls to Secret by Query = 1
5 Correct 613 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1
6 Correct 586 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1
7 Correct 613 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1
8 Correct 609 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1
9 Correct 613 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1
10 Correct 613 ms 12956 KB Output is correct - number of calls to Secret by Init = 7485, maximum number of calls to Secret by Query = 1