oj.uz

답안 #217209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217209 2020-03-29T08:45:31 Z tselmegkh 비밀 (JOI14_secret) C++14
0 / 100
 526 ms 8440 KB 
#include<bits/stdc++.h>
#include "secret.h"
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int ans[1005][1005], b[1005];

void solve(int l, int r){
	if(l == r){
		return;
	}
	int mid = (l + r) / 2;
	for(int i = mid - 1; i >= l; i--){
		ans[i][mid] = Secret(b[i], ans[i + 1][mid]);
	}
	for(int i = mid + 2; i <= r; i++){
		ans[mid + 1][i] = Secret(ans[mid + 1][i - 1], b[i]);
	}
	solve(l, mid);
	solve(mid + 1, r);
}
void Init(int n, int a[]){
	memset(ans, -1, sizeof ans);
	for(int i = 0; i < n; i++)b[i] = a[i];
	for(int i = 0; i < n; i++){
		ans[i][i] = Secret(a[i], a[i]);
	}
	solve(0, n - 1);
}
int Query(int ql, int qr){
	if(ans[ql][qr] != -1)return ans[ql][qr];
	for(int i = ql; i < qr; i++){
		if(ans[ql][i] != -1 && ans[i + 1][qr] != -1){
			return Secret(ans[ql][i], ans[i + 1][qr]);
		}
	}
}

Compilation message

secret.cpp: In function 'int Query(int, int)':
secret.cpp:55:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 147 ms 6392 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 592803351.
2 Incorrect 155 ms 6392 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 318937448.
3 Incorrect 143 ms 6392 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 277905744.
4 Incorrect 521 ms 8312 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 937460335.
5 Incorrect 514 ms 8312 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 577243406.
6 Incorrect 524 ms 8440 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 31281100.
7 Incorrect 525 ms 8440 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 599439394.
8 Incorrect 520 ms 8312 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 470104064.
9 Incorrect 526 ms 8388 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 961425929.
10 Incorrect 521 ms 8440 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 269001350.