結果

問題 No.876 Range Compress Query
コンテスト
ユーザー kotamanegi
提出日時 2019-09-06 21:43:39
言語 C++17(clang)
(17.0.6 + boost 1.87.0)
結果
AC  
実行時間 136 ms / 2,000 ms
コード長 4,099 bytes
コンパイル時間 1,979 ms
コンパイル使用メモリ 149,812 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-30 14:51:05
合計ジャッジ時間 4,166 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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;
}
int cnt_seg[seg_size * 2];
int 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 0;
	return 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] = cnt_seg[now * 2] + cnt_seg[now * 2 + 1];
	if (now != 1) ans_set(now / 2);
}
long long gogo[200000];
int main() {
#define int long long
	iostream::sync_with_stdio(false);
	cin.tie(0);
	int n, query;
	cin >> n >> query;
	REP(i, n) {
		cin >> gogo[i];
	}
	for (int i = 0; i < n-1; ++i) {
		gogo[i] = gogo[i + 1] - gogo[i];
		if (gogo[i] != 0) {
			cnt_seg[(seg_size + i)]++;
			ans_set((seg_size + i) / 2);
		}
	}
	for (int i = 0; i < query; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		b--;
		c--;
		if (a == 1) {
			int d;
			cin >> d;
			if (b != 0) {
				if (gogo[b-1] != 0) {
					cnt_seg[(seg_size + b-1)]--;
					ans_set((seg_size + b-1) / 2);
				}
				gogo[b-1] += d;
				if (gogo[b-1] != 0) {
					cnt_seg[(seg_size + b-1)]++;
					ans_set((seg_size + b-1) / 2);
				}
			}
			if (c != n - 1) {
				if (gogo[c] != 0) {
					cnt_seg[(seg_size + c)]--;
					ans_set((seg_size + c) / 2);
				}
				gogo[c] -= d;
				if (gogo[c] != 0) {
					cnt_seg[(seg_size + c)]++;
					ans_set((seg_size + c) / 2);
				}
			}
		}
		else {
			int ans = 1 + ans_find(1, 0, seg_size, b, c);
			cout << ans << endl;
		}
	}
}
0