結果

問題 No.877 Range ReLU Query
ユーザー kotamanegikotamanegi
提出日時 2019-09-06 21:55:43
言語 C++17(clang)
(17.0.6 + boost 1.83.0)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 4,356 bytes
コンパイル時間 5,012 ms
コンパイル使用メモリ 282,852 KB
実行使用メモリ 14,320 KB
最終ジャッジ日時 2023-08-08 04:16:13
合計ジャッジ時間 9,172 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
7,592 KB
testcase_01 AC 3 ms
4,380 KB
testcase_02 AC 3 ms
5,608 KB
testcase_03 AC 4 ms
7,604 KB
testcase_04 AC 2 ms
7,588 KB
testcase_05 AC 3 ms
5,560 KB
testcase_06 AC 3 ms
5,580 KB
testcase_07 AC 3 ms
5,552 KB
testcase_08 AC 4 ms
7,624 KB
testcase_09 AC 3 ms
7,568 KB
testcase_10 AC 4 ms
5,584 KB
testcase_11 AC 252 ms
10,900 KB
testcase_12 AC 219 ms
11,480 KB
testcase_13 AC 178 ms
11,420 KB
testcase_14 AC 195 ms
10,368 KB
testcase_15 AC 259 ms
14,188 KB
testcase_16 AC 241 ms
11,352 KB
testcase_17 AC 254 ms
12,688 KB
testcase_18 AC 243 ms
12,676 KB
testcase_19 AC 220 ms
14,320 KB
testcase_20 AC 245 ms
11,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*

This Submission is to determine how many 120/240 min const. delivery point there are.

//info
120 req. steps <= 5
*/
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define MOD 998244353LL
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)

unsigned long xor128() {
	static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		double now_length = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa - now_min >= eps || (abs(goa - now_min) <= eps && (abs(a[i] - a[starter]) - now_length) >= eps)) {
					now_min = goa;
					now_go = i;
					now_length = abs(a[i] - a[starter]);
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
pair<long long,long long> cnt_seg[seg_size * 2];
pair<long long, long long> plu(pair<long long, long long> A, pair<long long, long long> B) {
	return make_pair(A.first + B.first, A.second + B.second);
}
pair<long long,long long> ans_find(int now, int n_l, int n_r, int w_l, int w_r) {
	if (w_l <= n_l && n_r <= w_r) return cnt_seg[now];
	if (w_r <= n_l || n_r <= w_l) return make_pair(0,0);
	return plu(ans_find(now * 2, n_l, (n_l + n_r) / 2, w_l, w_r) ,ans_find(now * 2 + 1, (n_l + n_r) / 2, n_r, w_l, w_r));
}
void ans_set(int now) {
	cnt_seg[now] = plu(cnt_seg[now * 2], cnt_seg[now * 2 + 1]);
	if (now != 1) ans_set(now / 2);
}
long long gogo[200000];
long long ans[200000];
int main() {
#define int long long
	iostream::sync_with_stdio(false);
	cin.tie(0);
	int n, query;
	cin >> n >> query;
	vector<pair<long long, long long>> gogo;
	REP(i, n) {
		long long a;
		cin >> a;
		gogo.push_back(make_pair(a, i));
	}
	gogo.push_back(make_pair(-1, -100));
	sort(gogo.begin(), gogo.end());
	vector<tuple<long long, long long, long long, long long>> que;
	REP(i, query) {
		long long a, b, c, d;
		cin >> a >> b >> c >> d;
		que.push_back(make_tuple(d, b - 1, c - 1, i));
	}
	sort(que.begin(), que.end());
	reverse(que.begin(), que.end());
	REP(i, query) {
		while (get<0>(que[i]) <= gogo.back().first) {
			int hoge = gogo.back().second;
			cnt_seg[(seg_size + hoge)].first += gogo.back().first;
			cnt_seg[(seg_size + hoge)].second++;
			ans_set((seg_size + hoge) / 2);
			gogo.pop_back();
		}
		pair<long long, long long> tmp = ans_find(1, 0, seg_size, get<1>(que[i]), get<2>(que[i]) + 1);
		ans[get<3>(que[i])] = tmp.first - tmp.second * get<0>(que[i]);

	}
	REP(i, query) {
		cout << ans[i] << endl;
	}
}
0