oj.uz

Submission #65523

# Submission time Handle Problem Language Result Execution time Memory
65523 2018-08-07T20:34:23 Z reality Secret (JOI14_secret) C++17
6 / 100
 1305 ms 8876 KB 
#include "secret.h"

#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class P , class Q > ostream& operator<<(ostream& stream, pair < P , Q > v){ stream << "(" << v.fi << ',' << v.se << ")"; return stream;}
template < class T > ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream;}
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}

const int NN = 1024;

int G[NN][NN];

int n;

void go(int l,int r) {
	if (l == r)
		return;
	int m = (l + r) / 2;
	go(l,m);
	go(m+1,r);
	for (int i = l;i >= 0;--i)
		if (G[i][m + 1] == -1) {
			for (int t = i;G[i][m + 1] == -1 && t <= m;++t)
				if (G[i][t] != -1 && G[t + 1][m + 1] != -1)
					G[i][m + 1] = Secret(G[i][t],G[t + 1][m + 1]);
		}
	for (int i = m + 1;i <= r;++i)
		if (G[m][i] == -1) {
			for (int t = m;t < i && G[m][i] == -1;++t)
				if (G[m][t] != -1 && G[t + 1][i] != -1)
					G[m][i] = Secret(G[m][t],G[t + 1][i]);
		}

}

void Init(int N, int A[]) {
	int n = N;
	memset(G,-1,sizeof(G));
	for (int i = 0;i < n;++i)
		G[i][i] = A[i];
	go(0,n - 1);
}

int Query(int L, int R) {
	if (G[L][R] != -1)
		return G[L][R];
	for (int k = L;k < R;++k)
		if (G[L][k] != -1 && G[k + 1][R] != -1)
			return G[L][R] = Secret(G[L][k],G[k + 1][R]);
	assert(0);
}

Subtask #1
6.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 316 ms 6484 KB Output isn't correct - number of calls to Secret by Init = 128767, maximum number of calls to Secret by Query = 1
2 Incorrect 315 ms 6504 KB Output isn't correct - number of calls to Secret by Init = 129278, maximum number of calls to Secret by Query = 1
3 Incorrect 328 ms 6704 KB Output isn't correct - number of calls to Secret by Init = 129782, maximum number of calls to Secret by Query = 1
4 Incorrect 1275 ms 8756 KB Output isn't correct - number of calls to Secret by Init = 494969, maximum number of calls to Secret by Query = 1
5 Incorrect 1299 ms 8756 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 1
6 Incorrect 1305 ms 8876 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 1
7 Incorrect 1213 ms 8876 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 0
8 Incorrect 1230 ms 8876 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 0
9 Incorrect 1226 ms 8876 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 0
10 Incorrect 1219 ms 8876 KB Output isn't correct - number of calls to Secret by Init = 495966, maximum number of calls to Secret by Query = 0