oj.uz

답안 #901764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901764 2024-01-10T01:57:42 Z trMatherz 비밀 (JOI14_secret) C++17
0 / 100
 366 ms 8552 KB 
//#include <iostream> //cin, cout
#include "secret.h"
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)


int n;
vvi v = vvi(1005, vi(1005, 0));

void go(int l, int r, int a[]){
	int m = (l + r) / 2;
	v[m][m] = a[m];
	for(int i = m - 1; i >= l; i--) v[m][i] = Secret(v[m][i + 1], a[i]);
	v[m + 1][m + 1] = a[m + 1];
	for(int i = m + 2; i <= r; i++) v[m + 1][i] = Secret(v[m + 1][i - 1], a[i]);
	if(l < m) go(l, m, a);
	if(r > m + 1) go(m + 1, r, a);
}

void Init(int N, int A[]){
	n = N;
	go(0, n - 1, A);
}
int Query(int L, int R){
	int l = 0, r = n - 1;
	while(l != r){
		int m = (l + r) / 2;
		if(L <= m && R > m) return Secret(v[m][L], v[m + 1][R]);
		else if(R == m) return v[m][L];
		else if(m < L) l = m + 1;
		else r = m;
	}
	return v[l][l];
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 105 ms 7408 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 95 ms 7508 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 96 ms 7508 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 352 ms 8552 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 351 ms 8276 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 354 ms 8312 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 351 ms 8164 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 366 ms 8148 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 351 ms 8260 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 354 ms 8156 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.