vs抽风。。

//二分，前缀和

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
long long  n, m, r[N], num[N], dayr[N], dayl[N], diff[N], re[N];
bool check(long long m)
{
	memset(diff, 0, sizeof(diff));
	for (int i = 1; i <= m; i++) {
		diff[dayl[i]] += num[i];
		diff[dayr[i] +1] -= num[i];//差分，统计什么时候借什么时候还 
	}
	for (int i = 1; i <= n; i++)
	{
		re[i] = re[i - 1] + diff[i];//计算要借的数量 
		if (r[i] < re[i]) {
			return 0;//如果要借的比剩下的多，输出0然后找是第几个订单导致不够借 
		}
	}
	return 1;
}

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> r[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> num[i] >> dayl[i] >> dayr[i];
	}
	long long left = 1, right = m; long long mid;
	if (check(m)) { cout << "0"; return 0; }
	
		while (right > left) 
		{
			mid= (left + right) / 2;
			if (check(mid))left= mid +1;
			else right= mid;
		}

		cout << "-1" << endl << left;
	

}

//dfs剪枝
#include<bits/stdc++.h> 
using namespace std;
long long n, x, num, ans = 0, minn = 50,can=0;

int temp(long long n) {
	long long  cur=0;
	while (n>0)
	{
		cur++;
		n /= 10;
		
	}
	return cur;
}
int dif(long long n, long long num) {
	return x - temp(n) + num;
}
void dfs(long long n, long long step)
{
	
	if (dif(n, step) >= minn)return;//最优情况剪枝
	if (temp(n) == x) {
		ans = 1;
		minn = min(minn, step);
		return;
	}
	long long k = n;
	while (k > 0) {
		if (k % 10 > 1) { dfs(n * (k%10), step + 1); }
		k /= 10;
	}
	
	return;
}
int main() {
	scanf("%lld%lld", &x, &n);
	dfs(n, 0);
	if (!ans)cout << -1;
	else cout << minn;
}

//二分
#include<bits/stdc++.h>
using namespace std;
struct pos {
	int num;
	int sum;
}a[100005];
bool cmp(pos x, pos y) {
	return x.sum < y.sum;
}
int main() {
	int n, m, q;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].sum;
		a[i].num = i;
	}
	sort(a + 1, a + 1 + n, cmp);
	cin >> m;
	for (int i = 1; i <= m; i++) {
		cin >> q;
		int l = 1, r = n, ans = 0;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (a[mid].sum <= q) {
				l = mid + 1;
				ans = mid;
			}
			else {
				r = mid - 1;
			}
		}
		if (a[ans].sum == q)
			cout << a[ans].num << endl;
		else
			cout << 0 << endl;

	}
	return 0;
}

//转换进制
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 1001;
int a[N], n, k, l = 0;
int main() {
	LL ans = 0;
	scanf("%d%d", &k, &n);
	while (n) { a[++l] = n % 2, n /= 2; }//先转二进制
	for (int i = l; i >= 1; i--)
		ans += pow(k, i - 1) * a[i];//再转n进制
	printf("%lld\n", ans);
	return 0;
}

//二分结构体快排

#include<iostream>
#include<bits/stdc++.h>
#include <algorithm>
using namespace std;
const int N = 100005;
struct pos {
	int num;
	int sum;
}s[N];
bool amp(pos x, pos y) {
	return x.sum< y.sum;
}
int n, q, m, mid;
int search(int l, int r, int x, pos s[N])
{
	while (l < r - 1)
	{
		mid = (r + l) / 2;
		if (s[mid].sum == x) 
		{
			return mid;
		}
		if (s[mid].sum > x)
		{
			r = mid-1;
		}
		else {
			l = mid+1;
			
		}
	}
	return 0;
}
int main() {
	cin >> n;
	memset(s, 0, sizeof(s));
	for (int i = 1; i <= n; i++) {
		cin >> s[i].sum;
		s[i].num = i;
	}
	sort(s+1, s+1 + n,amp);
	cin >> q;
	while (q>0) {
		cin >> m;
		int ans = search(0, n, m, s);
		//if (ans == 0) { cout << 0 << endl; return 0; }
		cout << s[ans].num;
		if (q != 1)cout << endl;
		q--;
	}
	return 0;
}

//二维前缀和
int s[5005][5005];
int x, y, m, n, v;
int N = 0, M = 0;
int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> x >> y >> v;
		s[x + 1][y + 1] += v;//+1避免越界 
		
		N = (N, x);
		M = (N, x);
	}
	
	for (int i = 1; i <= N; i++) {

		for (int j = 1; j <= N; j++) {

			s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + s[i][j];
		}
	}
	int ans = 0, end = 0;
	for (int i = m; i <= N; i++) {
		for (int j = m; j <= N; j++)
			end = s[i][j] - s[i - m][j] - s[i][j - m] + s[i - m][j - m];
		ans = max(ans, end);
	}
	cout << ans << endl;
	return 0;
}

//dp，森林冰火人
const int N = 2e4 + 50;
int l[N], r[N];
int n;
int f[N][2];
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d%d", &l[i], &r[i]);
	}
	f[1][0] = 2 * r[1] - l[1] - 1;//第1行往返，走到右端点再回来
	f[1][1] = r[1] - 1;//直接走到右端点
	for (int i = 2; i <= n; i++) {
		 f[i][1] = min(f[i - 1][1] + abs(l[i] - r[i - 1]) + r[i] - l[i] + 1, f[i - 1][0] + abs(l[i] - l[i - 1]) + r[i] - l[i] + 1);
		 f[i][0] = min(f[i - 1][1] + abs(r[i] - r[i - 1]) + r[i] - l[i] + 1, f[i - 1][0] + abs(r[i] - l[i - 1]) + r[i] - l[i] + 1);
	}
	printf("%d\n", min(f[n][1] + n - r[n], f[n][0] + n - l[n]));
	return 0;
}

//01背包
include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int main() {
	int N, V;
	while (scanf("%d %d", &V, &N) != EOF) {
		int v[10 + 1], w[10 + 1];
		for (int i = 1; i < N + 1; i++) {
			scanf("%d %d", &v[i], &w[i]);
		}
		int f[10 + 1][10 + 1];
		memset(f, 0, sizeof(f));
		for (int i = 1; i < N + 1; i++) {
			for (int j = 1; j < V + 1; j++) {
				f[i][j] = f[i - 1][j];
				if (j >= v[i]) {
					f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
				}
			}
		}
		printf("%d\n", f[N][V]);
	}
	return 0;
}

//深搜
#define int long long
int n, k, a[10];
void dfs(int x, int kk) { //值，第几层
	a[kk] = x;
	if (kk == n) {
		for (int i = 1; i <= n; i++) {
			cout << a[i] << " ";
		}
		cout << "\n";
		return;
	}
	for (int i = 1; i <= k; i++) {
		dfs(i, kk + 1);
	}
}
void solve() {
	cin >> n >> k;
	dfs(0,0);
}
signed main()
{
	int t = 1;
	while (t--) 
	{
		solve();
	}
}

//计算矩形正方形
long long  n, m,cuc,cul;
void check(int n, int m) {
	
	for (int i = 0; i <n; i++) {
		for (int j = 0; j < m; j++) {
			if (i != j) { cul += (n - i) * (m - j); }
			else cuc += (n - i) * (m - j);
		}
	}
}
int main() {
	cin >> n >> m;
	check(n, m);
	cout << cuc << " ";
	cout << cul << " ";

}

https://www.luogu.com.cn/problem/P3913
#include<iostream>
const  int  N = 1e6+10;
long long  n, m, a[N],b[N];
int main() {
	scanf("%lld%lld", &n, &m);
	for(int i=0;i<m;i++){
		scanf("%lld%lld", &a[i], &b[i]);
	}
	sort(a, a+ m);
	sort(b, b + m);
	long long sizex = unique(a, a + m) - a;
	long long sizey = unique(b, b + m) - b;
	//cout<<n*n-(n-sizex)*(n-sizey);
	printf("%lld", n * n - (n - sizex) * (n - sizey));
	return 0;
	
}
//去重有内置函数

累了先存这一部分