repo
stringlengths 5
121
| content
stringlengths 35
2.09M
|
|---|---|
zukahai/Support-everyone
|
zukahai/Support-everyone
TamGiac1.py
```# Input
# N = 4
# Output:
# *
# **
# ***
# ****
# Input
# N = 6
# Output:
# *
# **
# ***
# ****
# *****
# ******
n = int(input("Nhập N: "))
for i in range(n):
print("*" * (i + 1))```
README.md
```## <p align="center"> SUPPORT EVERYONE </p>
<p align="center"> <img src="/images/support.png" alt="support" /> </p>```
2021-08-30.py
```
# Cau A:
# Imput: a = [1, 2, 3, 4, 5]
# Output: 5 4 3 2 1
# Cau B:
# Input a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
# OutPut [[1], [2, 3], [4, 5, 6], [7, 8, 9, 10]]
# Câu C:Tính tổng các phần tử trong mảng 2 chiều:
# Input a = [[1], [2, 3], [4], [1, 1, 1]]
# Output: 13
# câu a
a=[1,5,2,4,3,6]
a.sort()
print(a)
a.sort(reverse=True)
print(a)
#################################
a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
size = 2
print(a)
b = []
index = 0
for i in range(len(a)):
if index == 0:
c = []
c.append(a[i])
index = index + 1
if index == size:
b.append(c)
index = 0
print(b)
#########################
a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
size = 1
print(a)
b = []
index = 0
for i in range(len(a)):
if index == 0:
c = []
c.append(a[i])
index = index + 1
if index == size:
b.append(c)
index = 0
size = size + 1
print(b)
#################################
# bài tập liên quan về đếm
""" [[1],[2], [3,4] ,[5,6] , [7,8,9], [8,9,10]]"""
a=[1,2,3,4,5,6,7,8,9,10]
print(a)
size =1
dem_size =0 #biến đém
index = 0 # biến đếm
b=[]
for i in range(len(a)):
if index ==0:
c =[]
c.append(a[i])
index = index +1
if index ==size:
b.append(c)
dem_size = dem_size +1
if dem_size%2==0:
size = size +1
index =0
print(b)
```
PTHH.cpp
```#include <iostream>
#include <map>
using namespace std;
long long a[100][100];
long long b[100];
long long B[100];
long long c[100];
map <string, int> mp[100];
int m = 0, n = 0;
string s[100];
void in();
void solve();
void rutGon();
void in(){
cout << endl;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++)
cout << a[i][j] << " ";
cout << endl;
}
cout << endl;
}
string intToString(int n){
string s = "";
while (n > 0){
s = char (n % 10 + '0') + s;
n /= 10;
}
return s;
}
long long ucln(long long a, long long b){
if (a == 0 && b == 0)
return 0;
if (a * b == 0)
return (a == 0) ? a : b;
while (a % b != 0){
long long d = a % b;
a = b;
b = d;
}
return b;
}
void swap(int l, int r){
int t;
for (int j = 0; j < n; j++){
t = a[l][j];
a[l][j] = a[r][j];
a[r][j] = t;
}
}
void mul(int i, int k){
for (int j = 0; j < n; j++)
a[i][j] *= k;
}
void sub(int i1, int i2){
for (int j = 0; j < n; j++)
a[i1][j] -= a[i2][j];
}
void matrix(string str){
str = str + "+";
n = 0;
int k = 1;
string S = "";
for (int i = 0; i < str.length(); i++){
if (str[i] == ' ')
continue;
if (str[i] == '+'){
b[n] = k;
s[n++] = S;
S = "";
} else if (str[i] == '='){
b[n] = k;
s[n++] = S;
S = "";
k = -1;
} else
S = S + str[i];
}
for (int i = 0; i < n; i++)
B[i] = b[i];
string nt = "";
for (int V = 0; V < n; V++){
k = 1;
nt = "";
for (int i = s[V].length() - 1; i >= 0; i--){
if (s[V][i] >= '0' && s[V][i] <= '9'){
if (k == 1 && s[V].find('(') < s[V].length() && s[V].find('(') >= 0)
k = s[V][i] - '0';
else{
int t = 1;
int k2 = 0;
while (s[V][i] >= '0' && s[V][i] <= '9'){
k2 += t * (s[V][i] - '0');
t *= 10;
i--;
}
while (s[V][i] >= 'a' && s[V][i] <= 'z'){
nt = s[V][i] + nt;
i--;
}
nt = s[V][i] + nt;
mp[V][nt] += k * k2 * b[V];
// cout << k << "---" << k2 << "---" << nt << endl;
nt = "";
}
} else if (s[V][i] >= 'a' && s[V][i] <= 'z'){
while (s[V][i] >= 'a' && s[V][i] <= 'z'){
nt = s[V][i] + nt;
i--;
}
nt = s[V][i] + nt;
mp[V][nt] += k * b[V];
nt = "";
// cout << k << "---2-- " << nt << endl;
} else if (s[V][i] >= 'A' && s[V][i] <= 'Z'){
nt = s[V][i] + nt;
mp[V][nt] = k * b[V];
nt = "";
} else if (s[V][i] == '(')
k = 1;
}
// for (map <string, int> :: iterator it = mp[V].begin(); it != mp[V].end(); it++)
// cout << it->first << " " << it->second << endl;
// cout << "---------------------" << endl;
}
map <string, int> M;
m = 0;
for (int V = 0; V < n; V++){
for (map <string, int> :: iterator it = mp[V].begin(); it != mp[V].end(); it++){
if (M[it->first] != 123){
for (int j = 0; j < n; j++)
a[m][j] = mp[j][it->first];
m++;
M[it->first] = 123;
}
}
}
}
void solve(){
for (int v = 0; v < n - 1; v++){
int k = m - 1;
while (a[k][v] == 0)
k--;
for (int i = k - 1; i >= v; i--)
if (a[i][v] == 0){
swap(i, k);
k--;
}
// in();
for (int i = m - 1; i >= v + 1; i--)
if (a[i][v] != 0){
int t = a[v][v];
mul(v, a[i][v]);
mul(i, t);
sub(i, v);
}
// in();
rutGon();
}
// in();
m = n - 1;
for (int v = n - 2; v >= 1; v--){
for (int i = 0; i < v; i++)
if (a[i][v] != 0){
int t = a[v][v];
mul(v, a[i][v]);
mul(i, t);
sub(i, v);
}
rutGon();
}
c[n - 1] = 1;
for (int i = 0; i < n - 1; i++)
c[n - 1] *= a[i][i];
for (int i = 0; i < n - 1; i++)
c[i] = -c[n - 1] * a[i][n - 1] / a[i][i];
for (int i = 0; i < n; i++)
if (c[i] < 0)
c[i] = -c[i];
long long k = c[0];
for (int i = 1; i < n; i++)
k = ucln(k, c[i]);
for (int i = 0; i < n; i++)
c[i] /= k;
// for (int i = 0; i < n; i++)
// cout << c[i] << " ";
}
void rutGon(){
long long k;
for (int i = 0; i < m; i++){
for (int j = 0; j < n; j++)
if (a[i][j] != 0){
k = a[i][j];
break;
}
for (int j = 0; j < n; j++)
if (a[i][j] != 0)
k = ucln(k, a[i][j]);
for (int j = 0; j < n; j++)
a[i][j] /= k;
}
}
void thanhPhan(map <string, int> m){
int n = 0;
for (map <string, int> :: iterator it = m.begin(); it != m.end(); it++)
if (it->second > 0)
n++;
cout << "{";
int k = 0;
for (map <string, int> :: iterator it = m.begin(); it != m.end(); it++)
if (it->second > 0) {
k++;
cout << it->first << "=" << it->second;
if (k < n)
cout << ", ";
}
cout << "}";
}
string PTHH(string str){
matrix(str);
solve();
string st = "";
if (c[0] > 1)
cout << c[0];
cout << s[0];
for (int i = 1; i < n; i++){
if (B[i] > 0){
st = st + " + ";
if (c[i] > 1)
st = st + intToString(c[i]);
st = st + s[i];
} else {
if (B[i - 1] > 0)
st = st + " = ";
if (c[i] > 1)
st = st + intToString(c[i]);
st = st + s[i];
if (i != n - 1)
st = st + " + ";
}
}
return st;
}
int main(){
cout << endl;
string s;
getline(cin, s);
cout << PTHH(s);
cout << endl << endl << " ";
return 0;
}
```
game.js
```game_W = 0, game_H = 0;
var bg_im = new Image();
bg_im.src = "images/Map2.png";
SPEED = 1;
MaxSpeed = 0;
chX = chY = 0;
mySnake = [];
FOOD = [];
NFood = 2000;
Nsnake = 50;
sizeMap = 2000;
index = 0;
minScore = 200;
Xfocus = Yfocus = 0;
XX = 0, YY = 0;
names = ["Ahmed Steinke",
"Aubrey Brass",
"Johanne Boothe",
"Sunni Markland",
"Tifany Sugar",
"Latonya Tully",
"Bobette Huckaby",
"Daryl Nowicki",
"Lizeth Kremer",
"Chiquita Pitt",
"Christinia Siler",
"Rena Reep",
"Evan Mcknight",
"Sofia Freeland",
"Virgie Vaughns",
"Kit Polen",
"Emma Rutland",
"Queen Guertin",
"Cecily Pasquariello",
"Palmer Myer",
"Kera Quinton",
"Domonique Diebold",
"Henriette Sockwell",
"Adeline Pettway",
"Shu Osby",
"Shantay Wallner",
"Isaias Drewes",
"Lettie Gatz",
"Remona Maravilla",
"Jessenia Mick",
"Noelle Rickey",
"Lavon Revard",
"Shavonne Stogsdill",
"Hailey Razo",
"Bart Somerville",
"Hannah Masker",
"Frederica Farmer",
"Glennie Thorpe",
"Sherrell Arriaga",
"Lawanda Maines",
"Douglass Watts",
"Naida Grund",
"Branda Bussiere",
"Carmelo Savory",
"Gabriela Blanchette",
"Tran Huf",
"Antoinette Hinrichs",
"Deborah Primmer",
"Drusilla Mcvea",
"Charlsie Acy",
"Nadene Royce",
"Danette Touchet",
"Luana Endo",
"Elvina Hibbitts",
"Ludivina Dahle",
"Fabiola Mcwhirter",
"Isabella Mosier",
"Lon Lassiter",
"Laurence Hanning",
"Laurene Singleton"
];
class game {
constructor() {
this.canvas = null;
this.context = null;
this.init();
}
init() {
this.canvas = document.createElement("canvas");
this.context = this.canvas.getContext("2d");
document.body.appendChild(this.canvas);
this.render();
for (let i = 0; i < Nsnake; i++)
mySnake[i] = new snake(names[Math.floor(Math.random() * 99999) % names.length], this, Math.floor(2 * minScore + Math.random() * 2 * minScore), (Math.random() - Math.random()) * sizeMap, (Math.random() - Math.random()) * sizeMap);
mySnake[0] = new snake("HaiZuka", this, minScore, game_W / 2, game_H / 2);
for (let i = 0; i < NFood; i++) {
FOOD[i] = new food(this, this.getSize() / (7 + Math.random() * 10), (Math.random() - Math.random()) * sizeMap, (Math.random() - Math.random()) * sizeMap);
}
this.loop();
this.listenMouse();
this.listenTouch();
}
listenTouch() {
document.addEventListener("touchmove", evt => {
var y = evt.touches[0].pageY;
var x = evt.touches[0].pageX;
chX = (x - game_W / 2) / 15;
chY = (y - game_H / 2) / 15;
})
document.addEventListener("touchstart", evt => {
var y = evt.touches[0].pageY;
var x = evt.touches[0].pageX;
chX = (x - game_W / 2) / 15;
chY = (y - game_H / 2) / 15;
mySnake[0].speed = 2;
})
document.addEventListener("touchend", evt => {
mySnake[0].speed = 1;
})
}
listenMouse() {
document.addEventListener("mousedown", evt => {
var x = evt.offsetX == undefined ? evt.layerX : evt.offsetX;
var y = evt.offsetY == undefined ? evt.layerY : evt.offsetY;
mySnake[0].speed = 2;
})
document.addEventListener("mousemove", evt => {
var x = evt.offsetX == undefined ? evt.layerX : evt.offsetX;
var y = evt.offsetY == undefined ? evt.layerY : evt.offsetY;
chX = (x - game_W / 2) / 15;
chY = (y - game_H / 2) / 15;
})
document.addEventListener("mouseup", evt => {
var x = evt.offsetX == undefined ? evt.layerX : evt.offsetX;
var y = evt.offsetY == undefined ? evt.layerY : evt.offsetY;
mySnake[0].speed = 1;
})
}
loop() {
this.update();
this.draw();
setTimeout(() => this.loop(), 30);
}
update() {
this.render();
this.unFood();
this.changeFood();
this.changeSnake();
this.updateChXY();
this.checkDie();
mySnake[0].dx = chX;
mySnake[0].dy = chY;
XX += chX * mySnake[0].speed;
YY += chY * mySnake[0].speed;
mySnake[0].v[0].x = XX + game_W / 2;
mySnake[0].v[0].y = YY + game_H / 2;
}
updateChXY() {
while (Math.abs(chY) * Math.abs(chY) + Math.abs(chX) * Math.abs(chX) > MaxSpeed * MaxSpeed && chY * chX != 0) {
chX /= 1.1;
chY /= 1.1;
}
while (Math.abs(chY) * Math.abs(chY) + Math.abs(chX) * Math.abs(chX) < MaxSpeed * MaxSpeed && chY * chX != 0) {
chX *= 1.1;
chY *= 1.1;
}
Xfocus += 1.5 * chX * mySnake[0].speed;
Yfocus += 1.5 * chY * mySnake[0].speed;
if (Xfocus < 0)
Xfocus = bg_im.width / 2 + 22;
if (Xfocus > bg_im.width / 2 + 22)
Xfocus = 0;
if (Yfocus < 0)
Yfocus = bg_im.height / 2 + 60;
if (Yfocus > bg_im.height / 2 + 60)
Yfocus = 0;
}
changeFood() {
for (let i = 0; i < FOOD.length; i++)
if (Math.sqrt((mySnake[0].v[0].x - FOOD[i].x) * (mySnake[0].v[0].x - FOOD[i].x) + (mySnake[0].v[0].y - FOOD[i].y) * (mySnake[0].v[0].y - FOOD[i].y)) > sizeMap) {
FOOD[i] = new food(this, this.getSize() / (10 + Math.random() * 10), (Math.random() - Math.random()) * sizeMap + mySnake[0].v[0].x, (Math.random() - Math.random()) * sizeMap + mySnake[0].v[0].y);
// console.log(FOOD[i]);
}
}
changeSnake() {
for (let i = 0; i < mySnake.length; i++)
if (Math.sqrt((mySnake[0].v[0].x - mySnake[i].v[0].x) * (mySnake[0].v[0].x - mySnake[i].v[0].x ) + (mySnake[0].v[0].y - mySnake[i].v[0].y ) * (mySnake[0].v[0].y - mySnake[i].v[0].y)) > sizeMap) {
mySnake[i].v[0].x = (mySnake[0].v[0].x + mySnake[i].v[0].x) / 2;
mySnake[i].v[0].y = (mySnake[0].v[0].y + mySnake[i].v[0].y) / 2;
}
}
unFood() {
if (mySnake.length <= 0)
return;
for (let i = 0; i < mySnake.length; i++)
for (let j = 0; j < FOOD.length; j++) {
if ((mySnake[i].v[0].x - FOOD[j].x) * (mySnake[i].v[0].x - FOOD[j].x) + (mySnake[i].v[0].y - FOOD[j].y) * (mySnake[i].v[0].y - FOOD[j].y) < 1.5 * mySnake[i].size * mySnake[i].size) {
mySnake[i].score += Math.floor(FOOD[j].size);
FOOD[j] = new food(this, this.getSize() / (5 + Math.random() * 10), (Math.random() - Math.random()) * 5000 + XX, (Math.random() - Math.random()) * 5000 + YY);
}
}
}
checkDie() {
for (let i = 0; i < mySnake.length; i++)
for (let j = 0; j < mySnake.length; j++)
if (i != j) {
let kt = true;
for (let k = 0; k < mySnake[j].v.length; k++)
if (this.range(mySnake[i].v[0].x, mySnake[i].v[0].y, mySnake[j].v[k].x, mySnake[j].v[k].y) < mySnake[i].size)
kt = false;
if (!kt) {
for (let k = 0; k < mySnake[i].v.length; k += 5) {
FOOD[index++] = new food(this, this.getSize() / (2 + Math.random() * 2), mySnake[i].v[k].x, mySnake[i].v[k].y);
if (index >= FOOD.length)
index = 0;
}
if (i != 0)
mySnake[i] = new snake(names[Math.floor(Math.random() * 99999) % names.length], this, Math.floor((mySnake[0].score > 1.5 * minScore) ? mySnake[0].score / 1.5 : minScore), this.randomXY(XX), this.randomXY(YY));
else {
mySnake[i] = new snake("HaiZuka", this, minScore, this.randomXY(XX), this.randomXY(YY));
XX = mySnake[0].v[0].x - game_W / 2;
YY = mySnake[0].v[0].y - game_H / 2;
}
}
}
}
render() {
if (this.canvas.width != document.documentElement.clientWidth || this.canvas.height != document.documentElement.clientHeight) {
this.canvas.width = document.documentElement.clientWidth;
this.canvas.height = document.documentElement.clientHeight;
game_W = this.canvas.width;
game_H = this.canvas.height;
SPEED = this.getSize() / 7;
SPEED = 1;
MaxSpeed = this.getSize() / 7;
if (mySnake.length == 0)
return;
if (mySnake[0].v != null) {
mySnake[0].v[0].x = XX + game_W / 2;
mySnake[0].v[0].y = YY + game_H / 2;
}
}
}
draw() {
this.clearScreen();
for (let i = 0; i < FOOD.length; i++)
FOOD[i].draw();
for (let i = 0; i < mySnake.length; i++)
mySnake[i].draw();
this.drawScore();
}
drawScore() {
let data = [];
for (let i = 0; i < mySnake.length; i++)
data[i] = mySnake[i];
for (let i = 0; i < data.length - 1; i++)
for (let j = i + 1; j < data.length; j++)
if (data[i].score < data[j].score) {
let t = data[i];
data[i] = data[j];
data[j] = t;
}
let index = 0;
for (let i = 1; i < mySnake.length; i++)
if (data[i].name == "HaiZuka")
index = i;
this.context.font = this.getSize() / 4 + 'px Arial Black';
for (let i = 0; i < 10; i++) {
this.context.fillStyle = "#AA0000";
if (i == index)
this.context.fillStyle = "#CC99FF";
this.context.fillText("#" + (i + 1), 3 * game_W / 4, this.getSize() / 2 * (i + 1));
this.context.fillText(data[i].name, 3 * game_W / 4 + game_W / 24, this.getSize() / 2 * (i + 1));
this.context.fillText(Math.floor(data[i].score), 3 * game_W / 4 + game_W / 5.5, this.getSize() / 2 * (i + 1));
}
if (index > 9) {
this.context.fillStyle = "#CC99FF";
this.context.fillText("#" + (index + 1), 3 * game_W / 4, this.getSize() / 2 * (10 + 1));
this.context.fillText(data[index].name, 3 * game_W / 4 + game_W / 24, this.getSize() / 2 * (10 + 1));
this.context.fillText(Math.floor(data[index].score), 3 * game_W / 4 + game_W / 5.5, this.getSize() / 2 * (10 + 1));
}
}
clearScreen() {
this.context.clearRect(0, 0, game_W, game_H);
this.context.drawImage(bg_im, Xfocus, Yfocus, 1.5 * game_W, 1.5 * game_H, 0, 0, game_W, game_H);
}
getSize() {
var area = game_W * game_H;
return Math.sqrt(area / 300);
}
range(a, b, c, d) {
return Math.sqrt((a - c) * (a - c) + (b - d) * (b - d));
}
randomXY(n) {
let ans = 0;
while (Math.abs(ans) < 1) {
ans = 3 * Math.random() - 3 * Math.random();
}
return ans * sizeMap + n;
}
}
var g = new game();```
Gon.py
```a = [1, 2, 3, 4, 5, 6]
print(a)
b = []
for i in range(len(a)):
b.append([a[i]])
print(b)
print(b[0][0])
print(b[1][0])
print(b[2][0])
```
sqrt.cpp
```#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
double SQRT(double n) {
long long l = 0;
long long r = 10e9;
long long mid = 0;
long long int_Sqrt = 123;
double sqrt_temp = 0;
while (l < r){
mid = (l + r + 1) / 2;
if (mid * mid < n)
l = mid;
else
r = mid - 1;
}
int_Sqrt = l;
if (int_Sqrt * int_Sqrt == n)
return int_Sqrt;
l = 0;
r = 10e17 - 1;
while(l < r){
mid = (l + r) / 2;
sqrt_temp = int_Sqrt + mid / 10e17;
if (sqrt_temp * sqrt_temp < n)
l = mid + 1;
else
r = mid;
}
sqrt_temp = int_Sqrt + l / 10e17;
return sqrt_temp;
}
int count(double a, double b) {
int c = -1;
a = fabs(a - b);
if (a == 0)
return -1;
while (a < 1) {
c++;
a *= 10;
}
return c;
}
int main() {
double n;
cin >> n;
cout << fixed << "SQRT() = " << setprecision(52) << SQRT(n) << endl;
cout << fixed << "sqrt() = " << setprecision(52) << sqrt(n) << endl;
int k = count(SQRT(n), sqrt(n));
if (k != -1)
cout << "Sai so: 10 ^ -" << k;
else
cout << "Khong co sai so.";
cout << endl << " " << endl;
}
```
HinhThoi.py
```# N = 3
# *
# ***
# *****
# ***
# *
# N = 10
# *
# ***
# *****
# *******
# *********
# ***********
# *************
# ***************
# *****************
# *******************
# *****************
# ***************
# *************
# ***********
# *********
# *******
# *****
# ***
# *
n = int(input("Nhập N: "))
for i in range(1, n + 1):
print(" " * (2 * n - 1 - i), end = "")
print("*" * (2 * i - 1))
for i in range(n - 1, 0, -1):
print(" " * (2 * n - 1 - i), end = "")
print("*" * (2 * i - 1))
```
snake.js
```class snake{
constructor(name ,game, score,x , y) {
this.name = name;
this.game = game;
this.score = score;
this.x = x;
this.y = y;
this.init();
}
init() {
this.time = Math.floor(20 + Math.random() * 100);
this.speed = 1;
this.size = this.game.getSize() * 1;
this.angle = 0;
this.dx = Math.random() * MaxSpeed - Math.random() * MaxSpeed;
this.dy = Math.random() * MaxSpeed - Math.random() * MaxSpeed;
this.v = [];
for (let i = 0; i < 50; i++)
this.v[i] = {x : this.x, y : this.y};
this.sn_im = new Image();
this.sn_im.src = "images/head.png";
this.bd_im = new Image();
this.bd_im.src = "images/body/" + Math.floor(Math.random() * 999999) % 6 + ".png";
}
update() {
this.time--;
this.angle = this.getAngle(this.dx, this.dy);
if (this.name != "HaiZuka") {
if (this.time > 90)
this.speed = 2;
else
this.speed = 1;
if (this.time <= 0) {
this.time = Math.floor(20 + Math.random() * 100);
this.dx = Math.random() * MaxSpeed - Math.random() * MaxSpeed;
this.dy = Math.random() * MaxSpeed - Math.random() * MaxSpeed;
}
this.score += 0.2;
}
this.v[0].x += this.dx * this.speed;
this.v[0].y += this.dy * this.speed;
for (let i = 1; i < this.v.length; i++) {
if (this.range(this.v[i], this.v[i - 1]) > this.size / 5) {
this.v[i].x = (this.v[i].x + this.v[i - 1].x) / 2;
this.v[i].y = (this.v[i].y + this.v[i - 1].y) / 2;
this.v[i].x = (this.v[i].x + this.v[i - 1].x) / 2;
this.v[i].y = (this.v[i].y + this.v[i - 1].y) / 2;
}
}
if (this.score < 200)
return;
if (this.speed == 2)
this.score -= this.score / 2000;;
let csUp = Math.pow((this.score) / 1000, 1 / 5) ;
this.size = this.game.getSize() / 2 * csUp;
let N = 3 * Math.floor(50 * Math.pow((this.score) / 1000, 1 / 1));
if (N > this.v.length) {
this.v[this.v.length] = {x : this.v[this.v.length - 1].x, y : this.v[this.v.length - 1].y};
} else
this.v = this.v.slice(0, N);
}
draw() {
this.update();
for (let i = this.v.length - 1; i >= 1; i--)
this.game.context.drawImage(this.bd_im, this.v[i].x - XX - (this.size) / 2, this.v[i].y - YY - (this.size) / 2, this.size, this.size);
this.game.context.save();
this.game.context.translate(this.v[0].x - XX, this.v[0].y - YY);
this.game.context.rotate(this.angle - Math.PI / 2);
this.game.context.drawImage(this.sn_im, -this.size / 2, - this.size / 2, this.size, this.size);
this.game.context.restore();
}
getAngle(a, b){
let c = Math.sqrt(a * a + b * b);
let al = Math.acos(a / c);
if (b < 0)
al += 2 * (Math.PI - al);
return al;
}
range(v1, v2) {
return Math.sqrt((v1.x - v2.x) * (v1.x - v2.x) + (v1.y - v2.y) * (v1.y - v2.y));
}
}```
Sum.py
```a = [[1], [2, 3], [4], [5, 6, 7]]
Sum = 0
for i in a:
Sum += sum(i)
print(Sum)```
food.js
```class food{
constructor(game, size, x, y) {
this.game = game;
this.size = size;
this.x = x;
this.y = y;
this.init();
}
init() {
let rd = Math.floor(Math.random() * 1000000) % 5;
this.food_im = new Image();
this.food_im.src = "images/food/" + rd + ".png";
}
draw() {
this.game.context.drawImage(this.food_im, this.x - this.size / 2 - XX, this.y - this.size / 2 - YY, this.size, this.size);
}
}```
sqrt.py
```import math
x = (float)(input())
def SQRT(n):
l, r, mid, int_Sqrt, sqrt_temp = 0, 10**9, 0, 123, 0
while l < r:
mid = (l + r + 1) // 2
if mid * mid < n:
l = mid
else:
r = mid - 1
int_Sqrt = l
if int_Sqrt * int_Sqrt == n:
return int_Sqrt
l, r = 0, 10**17 - 1
while l < r:
mid = (l + r) // 2
sqrt_temp = int_Sqrt + mid / 10**17
if sqrt_temp * sqrt_temp < n:
l = mid + 1
else:
r = mid
sqrt_temp = int_Sqrt + l / 10**17
return sqrt_temp
print(format(SQRT(x), '.52f'))
print(format(math.sqrt(x), '.52f'))
print(2**30)```
MaHoaNhiPhan.cpp
```#include <iostream>
using namespace std;
char binToString(string s){
int ans = 0;
for (int i = 0; i < s.length(); i++)
ans = 2 * ans + (s[i] - '0');
return ans;
}
string deCode(string s){
string ans = "";
for (int i = 0; i < s.length(); i += 9)
ans = ans + binToString(s.substr(i, 8));
return ans;
}
string intToBin(int n){
string ans = "";
while (n > 0){
ans = char(n % 2 + '0') + ans;
n /= 2;
}
while (ans.length() < 8)
ans = "0" + ans;
return ans;
}
string enCode(string s){
string ans = "";
for (int i = 0; i < s.length(); i++){
ans = ans + intToBin(s[i]) + " ";
}
return ans;
}
int main(){
string s;
getline(cin, s);
cout << enCode(s);
}
```
2021-08-31.py
```# Bài 1:
# Đếm số chẵn trong mảng A
# Input: A = [1, 2, 3, 4, 4]
# Output: 3
# Vì có 3 số chẵn trong dãy
# Bài 2:
# Tìm số xuất hiện nhiều nhất trong dãy a. Nếu có nhiều số xuất hiện cùng số lần, đưa ra số lớn nhất.
# a = [1, 2, 2, 3, 2, 5]
# Kết quả là 2 vì: 2 xuất hiện 3 lần, là nhiều nhất
# a = [1, 2, 3, 2, 3]
# Kết quả là 3, vì 3 xuất hiện 2 lần, số 2 cũng xuất hiện 2 lần nhưng mình lấy số lớn hơn.
# Gợi ý: Sắp xếp tăng dần và đếm tần số```
sqrtNewton.cpp
```#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
double SQRT(double n) {
double x = 1, x2 = 10e17;
while (x != x2){
x = x2;
x2 = (x + n / x) / 2;
}
return x;
}
int count(double a, double b) {
int c = -1;
a = fabs(a - b);
if (a == 0)
return -1;
while (a < 1) {
c++;
a *= 10;
}
return c;
}
int main() {
double n;
cin >> n;
cout << fixed << "SQRT() = " << setprecision(52) << SQRT(n) << endl;
cout << fixed << "sqrt() = " << setprecision(52) << sqrt(n) << endl;
int k = count(SQRT(n), sqrt(n));
if (k != -1)
cout << "Sai so: 10 ^ -" << k;
else
cout << "Khong co sai so.";
cout << endl << " " << endl;
}
```
loop.py
```"""bài 1
inpt a=[1,2,3]
output 1 2 3"""
# a =[1,2,3]
# for i in a:
# print(i, end=" ")# end là ngăn xuống dòng .. range là khi khi các chỉ số ,,
"""N=3
output
*
**
***
****
"""
n = int(input("nhạp n :"))
for i in range(1,n+1):
for item in range(i):
print("*",end="")
print()
#######################
n = int(input("Nhập N: "))
for i in range(1, n + 1):
print("*" * i)
bài toán ngược
n = int(input("Nhập N: "))
for i in range(n, 0,-1):
print("*" * i)
######################
n = int(input("Nhập N: "))
s = ""
for i in range(1, n + 1):
s = s + str(i)
print(s)
# 1
# 12
# 123
# 1234
```
tesst.py
```#ok nha Long
#ok eiu
""" Đề là cho 1 cái mảng
input
a =[1,2,3]
ouput
a =[[1],[2],[3]]
dùng bằng ngôn ngữ python"""
# a = [1, 2, 3]
# print(a)
# b = []
# for i in range(len(a)):
# b.append([i]) // từng phần tử
# print(b)
# a = [1, 2, 3, 3, 2, 1]
# print(a)
# b = []
# for i in range(len(a)):
# b.append([a[i]]) // từng giá trị
# print(b)
"""ý tưởng : cho 1 mảng rỗng xong rồi để forr chạy/.. vd mảng rỗng bay giờ làa a=[ 1] => append lại b=[a] =>b=[[1]] """
# a = [1, 2, 3, 3, 2, 1]
# print(a)
# b = [] # cho
# for i in range(len(a)):
# c = []
# c.append(a[i])
# b.append(c)
# print(b)
""" đề bài :Ví dụ a = [1, 2, 3, 4, 5, 6]
output b = [[1, 2], [3, 4], [5, 6]]"""
a=[2,4,6,8]
print(a)
b = []
# for i in range(len(a)):
# if i%2==0:
# c = []
# c.append(a[i])
# if i%2 ==1:
# b.append(c)
for i in range(0,len(a),2):
c=[]
c.append([a[i],a[i+1]])# lưu ý appent chỉ đc 1 phần tử thui
b.append(c)
print(b)
# print(b[0][1])
# print(b[1][1])
# [2,4]
```
string.py
```a = input()
print(a)
print(a * 2)
print(a * 5)
print(a[0:4])
# Input
# PhanDucHai
# OutPut:
# PhanDucHai
# PhanDucHaiPhanDucHai
# PhanDucHaiPhanDucHaiPhanDucHaiPhanDucHaiPhanDucHai
# Phan```
TestFunction.py
```# def countOdd(a):
# count = 0
# for i in a:
# count += i % 2
# return count
def countOdd(a):
return sum(1 for i in a if i % 2 == 1)
a = [1, 2, 3, 4, 5, 7]
print(countOdd(a))
```
sqrtNewton.py
```import math
x = (float)(input())
def SQRT(n):
x, x2 = 1, 10**17
while x != x2 :
x = x2
x2 = (x + n / x) / 2
return x
print(format(SQRT(x), '.52f'))
print(format(math.sqrt(x), '.52f'))```
2021-09-03.py
```# Đưa ra HCN bằng dấu *
# Input N = 3
#Output:
# ***
# * *
# ***
```
ImageSegmentation.py
```import cv2
import numpy as np
import matplotlib.pyplot as plt
image = cv2.imread("D:\TGMT\image.png")
image = cv2.cvtColor(image, cv2.COLOR_BGR2RGB)
pixel_values = image.reshape((-1, 3))
pixel_values = np.float32(pixel_values)
print(pixel_values.shape)
criteria = (cv2.TERM_CRITERIA_EPS + cv2.TERM_CRITERIA_MAX_ITER, 100, 0.2)
k = 3
_, labels, (centers) = cv2.kmeans(pixel_values, k, None, criteria, 10, cv2.KMEANS_RANDOM_CENTERS)
centers = np.uint8(centers)
labels = labels.flatten()
segmented_image = centers[labels.flatten()]
segmented_image = segmented_image.reshape(image.shape)
plt.imshow(segmented_image)
plt.show()
masked_image = np.copy(image)
masked_image = masked_image.reshape((-1, 3))
cluster = 2
masked_image[labels == cluster] = [0, 0, 0]
masked_image = masked_image.reshape(image.shape)
plt.imshow(masked_image)
plt.show()
```
CanBangPTHH.py
```pt = []
b = []
n = 0
m = 0
a = []
hs = []
s = []
mp = []
# Hàm tìm ước chung lớn nhất của hai số
def ucln(a1, a2):
if a1 * a2 == 0:
return a1+a2
while a1 % a2 != 0:
tmp = a1 % a2
a1 = a2
a2 = tmp
return a2
# Hàm nhân hàng row trong ma trận a lên k lần
def mul(row, k):
for i in range(n):
a[row][i] *= k
# Hàm trừ 2 hàng trong ma trận a: row1 = row1 - row2
def sub(row1, row2):
for i in range(n):
a[row1][i] -= a[row2][i]
# Hàm hoán đổi 2 hàng với nhau
def swap(row1, row2):
for i in range(n):
tmp = a[row1][i]
a[row1][i] = a[row2][i]
a[row2][i] = tmp
# Hàm rút gọn ma trận a
def rutgon():
for i in range(m):
for j in range(n):
if a[i][j] != 0:
k = a[i][j]
break
for j in range(n):
if a[i][j] != 0:
k = ucln(k, a[i][j])
for j in range(n):
a[i][j] //= k
# Hàm biến đổi ma trận a về ma trận đường chéo
def biendoi():
k1 = 1
k2 = 1
for i in range(n-1):
k = m-1
while a[k][i] == 0:
k -= 1
for j in range(k-1, i-1, -1):
if a[j][i] == 0:
swap(j, k)
k -= 1
for j in range(m-1, i, -1):
if a[j][i] != 0:
k1 = a[j][i]
k2 = a[i][i]
mul(i, k1)
mul(j, k2)
sub(j, i)
rutgon()
for i in range(n-2):
for j in range(i+1, n-1):
if a[i][j] != 0:
k1 = a[j][j]
k2 = a[i][j]
mul(i, k1)
mul(j, k2)
sub(i, j)
rutgon()
# Hàm tìm các hệ số cân bằng của phương trình hóa học
# Trả về biến hs
def canbang():
k3 = 1
for i in range(n-1):
k3 *= a[i][i]
for i in range(n-1):
hs.append(k3*a[i][n-1]//a[i][i])
hs.append(k3)
k3 = hs[0]
for i in range(n):
k3 = ucln(k3, hs[i])
for i in range(n):
hs[i] = abs(hs[i]//k3)
# Hàm xuất ma trận a ra màn hình
def show():
for i in a:
print(i)
print("------------------")
# Hàm in phương trình hóa học đã cân bằng ra màn hình
def ketqua():
print()
print("Phuong trinh hoa hoc da can bang:")
print()
equal = b.index(-1)
for i in range(0, n):
if hs[i] > 1:
print(hs[i], end="")
print(pt[i], end=" ")
if i == equal-1:
print("=", end=" ")
elif i != n-1:
print("+", end=" ")
else:
print()
# Hàm tách các phân tử và hệ số ban đầu từ phương trình hóa học
# Trả về biến pt và b
def get_pt(str):
str = str + "+"
global n
global m
n = 0
k = 1
S = ""
for i in range(len(str)):
if str[i] == " ":
continue
if str[i] == "+":
b.append(k)
pt.append(S)
n += 1
S = ""
elif str[i] == "=":
b.append(k)
pt.append(S)
n += 1
S = ""
k = -1
else:
S = S+str[i]
# Hàm tạo ma trận a
def get_a():
global n
global m
nt = ""
lst = {}
for v in range(n):
k = 1
nt = ""
tmp = 0
i = len(pt[v])-1
while i >= 0:
if pt[v][i] >= "0" and pt[v][i] <= "9":
if k == 1 and pt[v].find("(") < len(pt[v]) and pt[v].find("(") >= 0:
k = int(pt[v][i])
else:
t = 1
k2 = 0
while pt[v][i] >= "0" and pt[v][i] <= "9":
k2 += t*int(pt[v][i])
t *= 10
i -= 1
while pt[v][i] >= "a" and pt[v][i] <= "z":
nt = pt[v][i]+nt
i -= 1
nt = pt[v][i]+nt
lst[nt] = k*k2*b[v]
tmp += k*k2*b[v]
nt = ""
elif pt[v][i] >= "a" and pt[v][i] <= "z":
while pt[v][i] >= "a" and pt[v][i] <= "z":
nt = pt[v][i]+nt
i -= 1
nt = pt[v][i] + nt
lst[nt] = k*b[v]
tmp += k*b[v]
nt = ""
elif pt[v][i] >= "A" and pt[v][i] <= "Z":
nt = pt[v][i]+nt
lst[nt] = k*b[v]
tmp = k*b[v]
nt = ""
elif pt[v][i] == "(":
k = 1
i -= 1
mp.append(lst)
lst = {}
check = []
pt1 = []
for i in range(n):
for item in mp[i]:
if item in check:
pass
else:
for j in range(n):
if mp[j].get(item) == None:
hs1 = 0
else:
hs1 = mp[j].get(item)
pt1.append(hs1)
check.append(item)
a.append(pt1)
pt1 = []
m = len(a)
# Chương trình chính
print("Nhap vao phuong trinh hoa hoc:")
ptr = input()
get_pt(ptr)
get_a()
biendoi()
canbang()
ketqua()
input()
```
|
zulfikar-ditya/laravel-todo-list
|
zulfikar-ditya/laravel-todo-list
todoCotrol.php
```<?php
namespace App\Http\Controllers;
use Illuminate\Http\Request;
use Illuminate\Support\Facades\Auth;
use Illuminate\Support\Facades\DB;
use App\models\todos;
class todoCotrol extends Controller
{
function index() {
return 'Here Is From Contorller';
}
function addTodoView() {
return view('add');
}
function addTodoFucn(Request $request) {
$NewData = new todos;
$NewData['name'] = $request->input('name');
$NewData['user_id'] = Auth::id();
$NewData->save();
if ($request->input('add')) {
return redirect('my-todo');
} else{
return redirect('add-todo');
}
}
function MyTodo() {
$MyTodo = DB::table('todos')->where('user_id', '=', Auth::id())->get();
return view('my-todo', ['data' => $MyTodo]);
}
function deleteTodo($id) {
$id= (int)$id;
$getTodo = todos::findOrFail($id);
if ($getTodo['user_id'] != Auth::id()) {
return abort('404');
}
else {
$getTodo->delete();
return redirect('my-todo');
}
}
}
```
README.md
```# A Todo App Project Using laravel 8
```
web.php
```<?php
use Illuminate\Support\Facades\Route;
use App\Http\Controllers\todoCotrol;
/*
|--------------------------------------------------------------------------
| Web Routes
|--------------------------------------------------------------------------
|
| Here is where you can register web routes for your application. These
| routes are loaded by the RouteServiceProvider within a group which
| contains the "web" middleware group. Now create something great!
|
*/
Route::get('/', function () {
return view('index');
})->name('home');
Route::middleware(['auth:sanctum', 'verified'])->get('/dashboard', function () {
return view('dashboard');
})->name('dashboard');
Route::group(['middleware' => ['auth']], function() {
Route::get('todo/', [todoCotrol::class, 'index']);
Route::get('add-todo/', [todoCotrol::class, 'addTodoView'])->name('add');
Route::post('add-todo/', [todoCotrol::class, 'addTodoFucn']);
Route::get('my-todo/', [todoCotrol::class, 'MyTodo'])->name('list');
Route::get('delete/{id}/', [todoCotrol::class, 'deleteTodo']);
});```
|
zulmy/datasciencecoursera
|
zulmy/datasciencecoursera
README.md
```datasciencecoursera
===================
Repo for classes
```
|
zulov/artofwar
|
zulov/artofwar
UnitActionType.h
```#pragma once
enum class UnitActionType : char {
ORDER=0,
FORMATION
};
```
UnitFactory.cpp
```#include "UnitFactory.h"
#include "Game.h"
#include "Unit.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
#include "state/StateManager.h"
UnitFactory::UnitFactory() {
StateManager::init();
}
UnitFactory::~UnitFactory() {
StateManager::dispose();
}
std::vector<Unit*>& UnitFactory::create(unsigned number, int id, Urho3D::Vector2& center, int player, int level) {
units.clear();
units.reserve(number);
int y = 0;
const int xMax = number / sqrt(number);
const float sideSize = xMax / 2;
while (units.size() < number) {
for (int x = 0; x < xMax; ++x) {
auto position = Urho3D::Vector3(x + center.x_ - sideSize, 0, y + center.y_ - sideSize);
position.y_ = Game::getEnvironment()->getGroundHeightAt(position.x_, position.z_);
units.push_back(new Unit(position, id, player, level));
if (units.size() >= number) { break; }
}
++y;
}
return units;
}
std::vector<Unit*>& UnitFactory::load(dbload_unit* unit) {
units.clear();
auto position = Urho3D::Vector3(unit->pos_x, Game::getEnvironment()->getGroundHeightAt(unit->pos_x, unit->pos_z), unit->pos_z);
auto newUnit = new Unit(position, unit->id_db, unit->player, unit->level);
newUnit->load(unit);
units.push_back(newUnit);
return units;
}
```
SimColorMode.h
```#pragma once
enum class SimColorMode : char
{
BASIC,
VELOCITY,
STATE,
FORMATION
};
```
Aims.h
```#pragma once
#include <optional>
#include <vector>
namespace Urho3D {
class Vector3;
class Vector2;
}
class IndividualOrder;
class Aim;
class Unit;
class Aims {
public:
Aims();
Aims(const Aims& rhs) = delete;
~Aims();
std::optional<Urho3D::Vector2> getDirection(Unit* unit) const;
void clearExpired();
bool process(Unit* unit);
void add(IndividualOrder* order);
void clear();
void removeCurrentAim();
bool hasCurrent() const { return current != nullptr; }
bool hasAim() const { return hasCurrent() || !nextAims.empty(); }
std::vector<Urho3D::Vector3> getDebugLines(Unit* unit) const;
void set(Aim* aim);
private:
std::vector<IndividualOrder*> nextAims;
Aim* current;
};
```
ActionType.h
```#pragma once
enum class ActionType : char {
NONE=0,
UNIT_CREATE,
UNIT_LEVEL,
UNIT_UPGRADE,
BUILDING_CREATE,
BUILDING_LEVEL,
ORDER,
FORMATION,
RESOURCE
};
```
DummyAim.h
```#pragma once
#include "Aim.h"
class DummyAim : public Aim {
public:
DummyAim() = default;
~DummyAim() override = default;
Urho3D::Vector2 getDirection(Unit* unit) override {
return {};
}
bool ifReach(Unit* unit) override {
return true;
}
bool expired() override {
return false;
}
std::vector<Urho3D::Vector3> getDebugLines(Unit* unit) const override {
return {};
}
};
```
ResourceActionType.h
```#pragma once
enum class ResourceActionType : char {
COLLECT=0,
CANCEL
};
```
DefendState.h
```#pragma once
#include "State.h"
class DefendState : public State
{
public:
DefendState() : State({UnitState::STOP, UnitState::DEAD}) {
}
~DefendState() override = default;
};
```
UnitAction.h
```#pragma once
enum class UnitAction : char {
GO = 0,
STOP,
CHARGE,
ATTACK,
DEAD,
DEFEND,
FOLLOW,
COLLECT
};
```
SceneLoader.h
```#pragma once
#include <Urho3D/Container/Str.h>
#include "Loading.h"
struct dbload_config;
class sqlite3;
struct dbload_building;
struct dbload_container;
struct dbload_player;
struct dbload_resource;
struct dbload_resource_entities;
struct dbload_unit;
class SceneLoader {
public:
SceneLoader() = default;
~SceneLoader();
void load();
void reset();
dbload_container* getData() const;
void createLoad(const Urho3D::String& fileName, bool tryReuse);
dbload_config* getConfig() const;
std::vector<dbload_player*>* loadPlayers();
std::vector<dbload_resource*>* loadResources();
std::vector<dbload_unit*>* loadUnits();
std::vector<dbload_building*>* loadBuildings();
std::vector<dbload_resource_entities*>* loadResourcesEntities();
void close();
void end();
private:
void load(const std::string& sql, int (*load)(void*, int, char**, char**)) const;
sqlite3* database{};
dbload_container* dbLoad{};
Urho3D::String lastLoad = "";
};
```
BuildingActionType.h
```#pragma once
enum class BuildingActionType : char {
UNIT_CREATE=0,
UNIT_LEVEL,
UNIT_UPGRADE,
};
```
ChargeAim.cpp
```#include "ChargeAim.h"
#include "../Unit.h"
ChargeAim::ChargeAim(Urho3D::Vector2* _direction): direction(*_direction), chargeEnergy(50) {
direction.Normalize();
}
std::vector<Urho3D::Vector3> ChargeAim::getDebugLines(Unit* unit) const {
std::vector<Urho3D::Vector3> points;
auto position = unit->getPosition();
points.emplace_back(position);
points.emplace_back(position.x_ + direction.x_ * 10, position.y_, position.z_ + direction.y_ * 10);
return points;
}
Urho3D::Vector2 ChargeAim::getDirection(Unit* unit) {
return direction;
}
bool ChargeAim::ifReach(Unit* unit) {
return false;
}
bool ChargeAim::expired() {
return false;
}
```
db_grah_structs.h
```#pragma once
#include "db_basic_struct.h"
struct db_hud_size : db_with_name {
db_hud_size(short id, char* name) : db_with_name(id, name) {
}
};
struct db_settings {
short graph;
short resolution;
db_settings(short graph, short resolution)
: graph(graph),
resolution(resolution) {
}
};
struct db_resolution : db_entity {
const short x;
const short y;
db_resolution(short id, short x, short y)
: db_entity(id), x(x), y(y) {
}
};
struct db_graph_settings : db_entity {
short hud_size;
float max_fps;
float min_fps;
Urho3D::Vector<Urho3D::String> styles;
Urho3D::String name;
short texture_quality;
bool fullscreen;
bool v_sync;
bool shadow;
db_graph_settings(short id, short hudSize, char* styles, int fullscreen, float maxFps, float minFps,
char* name, bool v_sync, bool shadow, short texture_quality)
: db_entity(id),
hud_size(hudSize),
max_fps(maxFps),
min_fps(minFps),
styles(Urho3D::String(styles).Split(SPLIT_SIGN)),
name(name),
texture_quality(texture_quality),
fullscreen(fullscreen),
v_sync(v_sync),
shadow(shadow) {
}
};
struct db_hud_vars : db_with_name {
const short hud_size;
float value;
db_hud_vars(short id, short hudSize, char* name, float value)
: db_with_name(id, name), hud_size(hudSize), value(value) {
}
};
```
FilePanel.h
```#pragma once
#include "AbstractMiddlePanel.h"
namespace Urho3D {
class LineEdit;
}
struct FileFormData;
class FilePanel : public AbstractMiddlePanel {
public:
FilePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~FilePanel();
void createBody() override;
Urho3D::Button* getMainButton() override;
void HandleValueChange(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
private:
Urho3D::LineEdit* lineEdit;
Urho3D::Button* action;
FileFormData* data;
};
```
StaticStateUtils.h
```#pragma once
#include "Static.h"
#include "StaticState.h"
inline void startState(StaticState state, Static* obj) {
obj->setState(state);
switch (state) {
case StaticState::FREE:
StateManager::changeState(obj, StaticState::ALIVE);
break;
case StaticState::DEAD:
StateManager::changeState(obj, StaticState::DISPOSE);
break;
case StaticState::DISPOSE:
if (obj->getType() == ObjectType::BUILDING) {
StateManager::setBuildingToDispose(true);
} else {
StateManager::setResourceToDispose(true);
}
break;
default: ;
}
}
inline void endState(StaticState state, Static* obj) {}
```
InfluenceMapHistory.cpp
```#include "InfluenceMapHistory.h"
InfluenceMapHistory::InfluenceMapHistory(unsigned short resolution, float size, float coef, char level,
float minimalThreshold, float vanishCoef, float valueThresholdDebug):
InfluenceMapFloat(resolution, size, coef, level, valueThresholdDebug),
minimalThreshold(minimalThreshold), vanishCoef(vanishCoef) {}
void InfluenceMapHistory::reset() {
const auto end = values + arraySize;
for (auto i = values; i < end; ++i) {
*i *= (*i > minimalThreshold) * vanishCoef;
}
minMaxInited = false;
}
```
ProjectileWithNode.h
```#pragma once
#include "objects/NodeUtils.h"
#include "math/MathUtils.h"
#include <Urho3D/Math/Vector3.h>
#include "ProjectileBase.h"
#include "math/RandGen.h"
#include "player/Player.h"
#include "env/Environment.h"
struct ProjectileWithNode : public ProjectileBase {
Urho3D::Node* node;
Urho3D::Vector2 direction;
float startHeight;
float endHeight;
float peakHeight;
ProjectileWithNode(Urho3D::Node* node): ProjectileBase(), node(node) {
}
~ProjectileWithNode() {
// if (node) {node->Remove(); }
}
ProjectileWithNode(const ProjectileWithNode&) = delete;
void init(Physical* shooter, Physical* aim, float speed, char player) override {
ProjectileBase::init(shooter, aim, speed, player);
const auto end = aim->getPosition();
const auto start = shooter->getPosition();
direction = dirTo(start, end);
const auto model = node->GetComponent<Urho3D::StaticModel>();
if (aim->getType() == ObjectType::BUILDING) {
changeMaterial("Materials/projectiles/black.xml", model);
} else {
changeMaterial("Materials/projectiles/brown.xml", model);
}
startHeight = start.y_ + shooter->getModelHeight() * 0.9f;
endHeight = end.y_ + aim->getModelHeight() / (RandGen::nextRand(RandFloatType::OTHER, 3) + 2.f);
peakHeight = direction.Length() / (RandGen::nextRand(RandFloatType::OTHER, 3) + 4.1f);
direction.Normalize();
direction *= speed;
node->SetEnabled(true);
node->SetPosition(start);
}
bool update(float timeStep) override {
const bool result = ProjectileBase::update(timeStep);
auto pos = node->GetPosition();
pos.x_ += direction.x_ * timeStep;
pos.z_ += direction.y_ * timeStep;
const auto percent = 1.f - percentToGo;
pos.y_ = peakHeight * sin(percent * Urho3D::M_PI)
+ startHeight * percentToGo
+ endHeight * percent;
node->SetDirection(pos - node->GetPosition());
node->SetPosition(pos);
return result;
}
void reset() override {
ProjectileBase::reset();
node->SetEnabled(false);
}
};
```
InfluenceMapInt.h
```#pragma once
#include "InfluenceMap.h"
class InfluenceMapInt : public InfluenceMap {
public:
InfluenceMapInt(unsigned short resolution, float size, float valueThresholdDebug);
~InfluenceMapInt();
void update(Physical* thing, float value = 1.f) override;
void updateInt(Physical* thing, int value = 1) override;
void updateInt(int index, int value = 1) const;
void reset() override;
char getValueAt(const Urho3D::Vector2& pos) const;
float getValueAsPercent(const Urho3D::Vector2& pos) const override;
float getValueAsPercent(const int index) const override;
float getValueAt(int index) const override;
void computeMinMax() override;
void ensureReady() override;
int getMaxIdx();
private:
unsigned char* values;
};
```
ObjectEnums.h
```#pragma once
enum class ObjectType : char {
NONE =-1,
UNIT,
BUILDING,
RESOURCE,
};
```
State.h
```#pragma once
#include "UnitState.h"
#include <initializer_list>
#include <magic_enum.hpp>
struct ActionParameter;
class Unit;
class State {
public:
State(std::initializer_list<UnitState> active);
virtual ~State() = default;
virtual bool canStart(Unit* unit, const ActionParameter& parameter);
virtual void onStart(Unit* unit, const ActionParameter& parameter) {
}
virtual void execute(Unit* unit, float timeStep) {
}
virtual void onEnd(Unit* unit) {
}
bool validateTransition(UnitState stateTo);
protected:
bool nextStates[magic_enum::enum_count<UnitState>()];
};
```
NamesUtils.h
```#pragma once
#include "database/db_strcut.h"
#include <Urho3D/Container/Str.h>
Urho3D::String stringFrom(const Urho3D::String& name, const db_cost* costs) {
auto msg = name + "\n";
for (int i = 0; i < costs->values.size(); ++i) {
if (const auto val = costs->values[i]; val > 0) {
msg += Game::getDatabase()->getResource(i)->name + " - " + Urho3D::String(val) + "\n";
}
}
return msg;
}
```
QueueHudElement.cpp
```#include "QueueHudElement.h"
#include "../../UiUtils.h"
#include "objects/queue/QueueElement.h"
#include <Urho3D/UI/ProgressBar.h>
#include <Urho3D/UI/UIEvents.h>
QueueHudElement::QueueHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style) {
button = createElement<Urho3D::Button>(parent, style, "SmallIcon");
button->SetVisible(false);
text = addChildText(button, "MiniText", style);
icon = createElement<MySprite>(button, style, "SmallSprite");
button->SetVar("QueueHudElement", this);
const auto mock = createElement<Urho3D::UIElement>(button, style, "mock");
bar = createElement<Urho3D::ProgressBar>(mock, style, "QueueProgressBar");
bar->SetRange(1);
bar->SetValue(0.5);
bar->SetVisible(true);
element = nullptr;
}
Urho3D::Button* QueueHudElement::getButton() const {
return button;
}
void QueueHudElement::hide() const {
if (button->IsVisible()) {
button->SetVisible(false);
}
}
void QueueHudElement::show() const {
if (!button->IsVisible()) {
button->SetVisible(true);
}
}
void QueueHudElement::setText(const Urho3D::String& msg) const {
text->SetVisible(true);
text->SetText(msg);
}
void QueueHudElement::hideText() const {
text->SetVisible(false);
}
void QueueHudElement::setTexture(Urho3D::Texture2D* texture) const {
setTextureToSprite(icon, texture);
}
void QueueHudElement::setProgress(float progress) const {
bar->SetValue(progress);
}
void QueueHudElement::setData(QueueElement* _element) {
element = _element;
}
void QueueHudElement::reduce(short amount) const {
element->reduce(amount);
}
QueueHudElement* QueueHudElement::getFromElement(Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
return static_cast<QueueHudElement *>(element->GetVar("QueueHudElement").GetVoidPtr());
}
```
ControlsUtils.h
```#pragma once
#include "Game.h"
#include "HitData.h"
#include "camera/CameraManager.h"
#include "objects/Physical.h"
#include <Urho3D/Graphics/Camera.h>
#include <Urho3D/Graphics/Graphics.h>
#include <Urho3D/Graphics/Octree.h>
#include <Urho3D/Graphics/OctreeQuery.h>
#include <Urho3D/UI/UI.h>
inline Physical* getLink(Urho3D::Node* node) {
return static_cast<Physical*>(node->GetVar("link").GetVoidPtr());
}
inline bool isGround(Urho3D::Node* node) {
return node->GetVar("ground").GetBool() || (node->GetParent() && node->GetParent()->GetVar("ground").GetBool());
}
inline void resultQuery(const Urho3D::IntVector2& pos, Urho3D::PODVector<Urho3D::RayQueryResult>& results) {
const auto cameraRay = Game::getCameraManager()->getComponent()
->GetScreenRay((float)pos.x_ / Game::getGraphics()->GetWidth(),
(float)pos.y_ / Game::getGraphics()->GetHeight());
Urho3D::RayOctreeQuery query(results, cameraRay, Urho3D::RAY_TRIANGLE, 300, Urho3D::DRAWABLE_GEOMETRY);
Game::getScene()->Node::GetComponent<Urho3D::Octree>()->Raycast(query);
}
inline bool skipRayCast(const Urho3D::IntVector2 pos) {
auto ui = Game::getUI();
return !ui->GetCursor()->IsVisible() || ui->GetElementAt(pos, true);
}
bool raycast(hit_data& hitData) {
const auto pos = Game::getUI()->GetCursorPosition();
if (skipRayCast(pos)) {
return false;
}
Urho3D::PODVector<Urho3D::RayQueryResult> results;
resultQuery(pos, results);
for (const auto result : results) {
const auto node = result.node_;
if (isGround(node)) {
hitData.set(result, true);
return true;
}
if (Physical * lc; (lc = getLink(node)) || (lc = getLink(node->GetParent()))) {
hitData.set(result, lc);
return true;
}
}
hitData.reset();
return false;
}
bool raycastGround(hit_data& hitData) {
const auto pos = Game::getUI()->GetCursorPosition();
if (skipRayCast(pos)) {
return false;
}
Urho3D::PODVector<Urho3D::RayQueryResult> results;
resultQuery(pos, results);
for (const auto result : results) {
if (isGround(result.node_)) {
hitData.set(result, true);
return true;
}
}
hitData.reset();
return false;
}
```
UiUtils.h
```#pragma once
#include <utility>
#include <vector>
#include <Urho3D/Graphics/Texture2D.h>
#include <Urho3D/UI/Button.h>
#include <Urho3D/UI/DropDownList.h>
#include <Urho3D/UI/Sprite.h>
#include <Urho3D/UI/Text.h>
#include "Game.h"
#include "MySprite.h"
static Urho3D::Button* simpleButton(Urho3D::XMLFile* style, const Urho3D::String& styleName) {
auto button = new Urho3D::Button(Game::getContext());
button->SetStyle(styleName, style);
return button;
}
static void setTextureToSprite(MySprite* sprite, Urho3D::Texture2D* texture) {
if (texture) {
sprite->SetVisible(true);
sprite->SetTexture(texture);
const int textureWidth = texture->GetWidth();
const int textureHeight = texture->GetHeight();
const auto size = sprite->getMySize();
const float scaleX = size.x_ / (float)textureWidth;
const float scaleY = size.y_ / (float)textureHeight;
sprite->SetScale(Urho3D::Min(scaleX, scaleY));
sprite->SetSize(textureWidth, textureHeight);
const auto perHotSpot = sprite->getPercentHotSpot();
sprite->SetFullImageRect();
sprite->SetHotSpot(textureWidth * perHotSpot.x_, textureHeight * perHotSpot.y_);
} else {
sprite->SetVisible(false);
}
}
static void setExactTextureToSprite(MySprite* sprite, Urho3D::Texture2D* texture) {
sprite->SetTexture(texture);
const int textureWidth = texture->GetWidth();
const int textureHeight = texture->GetHeight();
sprite->SetSize(textureWidth, textureHeight);
const auto perHotSpot = sprite->getPercentHotSpot();
sprite->SetFullImageRect();
sprite->SetHotSpot(textureWidth * perHotSpot.x_, textureHeight * perHotSpot.y_);
}
template <class T>
T* createElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style,
const Urho3D::String& styleName) {
auto element = parent->CreateChild<T>();
element->SetStyle(styleName, style);
return element;
}
static MySprite* createSprite(Urho3D::UIElement* parent, Urho3D::Texture2D* texture, Urho3D::XMLFile* style,
const Urho3D::String& styleName) {
const auto sprite = createElement<MySprite>(parent, style, styleName);
setTextureToSprite(sprite, texture);
return sprite;
}
inline Urho3D::Text* addTextItem(Urho3D::DropDownList* cob, const Urho3D::String& str, Urho3D::XMLFile* style) {
auto item = new Urho3D::Text(Game::getContext());
item->SetStyle("MyText", style);
item->SetText(str);
cob->AddItem(item);
return item;
}
inline Urho3D::Text* addChildText(Urho3D::UIElement* parent, const Urho3D::String& styleName, Urho3D::XMLFile* style) {
return createElement<Urho3D::Text>(parent, style, styleName);
}
inline Urho3D::Text* addChildText(Urho3D::UIElement* parent, Urho3D::String styleName, const Urho3D::String& value,
Urho3D::XMLFile* style) {
auto text = addChildText(parent, std::move(styleName), style);
text->SetText(value);
return text;
}
inline void addChildTexts(Urho3D::DropDownList* cob, const std::vector<Urho3D::String>& names, Urho3D::XMLFile* style) {
for (auto& name : names) {
addTextItem(cob, name, style);
}
}
inline void addTextItem(Urho3D::DropDownList* cob, Urho3D::String& name, Urho3D::XMLFile* style,
const Urho3D::Variant& var, const Urho3D::String& varName) {
addTextItem(cob, name, style)->SetVar(varName, var);
}
inline void addChildTexts(Urho3D::DropDownList* cob, std::vector<Urho3D::String> names, Urho3D::XMLFile* style,
std::vector<Urho3D::Variant> vars, const Urho3D::String& varsName) {
for (int i = 0; i < names.size(); ++i) {
addTextItem(cob, names.at(i), style, vars.at(i), varsName);
}
}
```
ChargeData.h
```#pragma once
struct ChargeData {
float energy;
float energyMax;
float attackRange;
ChargeData(float energyMax, float attackRange)
: energyMax(energyMax),
attackRange(attackRange) {
reset();
}
ChargeData(const ChargeData&) = delete;
void reset() {
energy = energyMax;
}
bool updateFrame() {
--energy;
return energy > 0;
}
bool updateHit(float before, float after) {
if (after < 0.1f && before - after > 0.1f) {
++energy;
} else {
energy -= 5;
}
return energy > 0;
}
};
```
PathFinder.cpp
```#include "PathFinder.h"
#include <chrono>
#include <iostream>
#include <Urho3D/IO/Log.h>
#include "DrawGridUtils.h"
#include "Game.h"
#include "../ComplexBucketData.h"
#include "env/GridCalculator.h"
#include "env/GridCalculatorProvider.h"
#include "env/CloseIndexes.h"
#include "env/CloseIndexesProvider.h"
PathFinder::PathFinder(short resolution, float size) :
closeIndexes(CloseIndexesProvider::get(resolution)), calculator(GridCalculatorProvider::get(resolution, size)),
resolution(resolution), fieldSize(size / resolution), max_cost_to_ref(resolution * resolution - 1) {
FibHeap::initCache();
const auto sqRes = resolution * resolution;
came_from = new int[sqRes];
cost_so_far = new float[sqRes];
std::fill_n(came_from, sqRes, -1);
std::fill_n(cost_so_far, sqRes, -1.f);
}
PathFinder::~PathFinder() {
delete[]came_from;
delete[]cost_so_far;
delete tempPath;
delete closePath;
}
void PathFinder::setComplexBucketData(ComplexBucketData* complexData) {
this->complexData = complexData;
}
const std::vector<int>* PathFinder::reconstructPath(int start, int goal, const int came_from[]) const {
tempPath->clear();
int current = goal;
while (current != start) {
current = came_from[current];
tempPath->emplace_back(current);
}
std::ranges::reverse(*tempPath);
tempPath->emplace_back(goal);
return tempPath;
}
const std::vector<int>* PathFinder::reconstructSimplifyPath(int start, int goal, const int came_from[]) const {
tempPath->clear();
int current = goal;
int lastDirection = 0;
while (current != start) {
const int currentDirection = current - came_from[current];
if (currentDirection != lastDirection) {
tempPath->emplace_back(current);
lastDirection = currentDirection;
}
int next = came_from[current];
if (next == current || !calculator->isValidIndex(next)) {
assert(false);
break; //TODO BUG tu cos dziwnego sie dzieje
}
current = next;
}
std::ranges::reverse(*tempPath);
return tempPath;
}
void PathFinder::prepareToStart(int startIdx) {
resetPathArrays();
frontier.clear();
frontier.put(startIdx, 0.f);
came_from[startIdx] = startIdx;
updateCost(startIdx, 0.f);
}
const std::vector<int>* PathFinder::realFindPath(int startIdx, const std::vector<int>& endIdxs, int limit) {
assert(limit>0);
prepareToStart(startIdx);
auto endCords = getCords(endIdxs);
assert(!endCords.empty());
int steps = 0;
while (!frontier.empty()) {
++steps;
if (steps > limit) {
break;
}
const auto current = frontier.get();
if (std::ranges::any_of(endIdxs, [current](int i) { return i == current; })) {
//debug(startIdx, endIdx);
return reconstructSimplifyPath(startIdx, current, came_from);
}
auto const& currentData = complexData[current];
for (auto i : closeIndexes->getTabIndexes(current)) {
if (currentData.ifNeightIsFree(i)) {
int next = current + closeIndexes->getIndexAt(i);
assert(validateIndex(current, next));
if (came_from[current] != next) {
const float new_cost = cost_so_far[current] + currentData.getCost(i);
auto const nextCost = cost_so_far[next];
if (nextCost < 0.f || new_cost < nextCost) {
updateCost(next, new_cost);
frontier.put(next, new_cost + heuristic(next, endCords));
came_from[next] = current;
}
}
}
}
}
//debug(startIdx, endIdx);
tempPath->clear();
return tempPath;
}
const std::vector<int>* PathFinder::getClosePath2(int startIdx, int endIdx, const std::vector<short>& closePass) const {
if (!closePass.empty()) {
for (auto pass : closePass) {
auto newPass = pass + startIdx;
assert(calculator->isValidIndex(newPass) && isInLocalArea(startIdx, newPass));
if (complexData[newPass].isPassable()) {
closePath->clear();
closePath->emplace_back(newPass);
closePath->emplace_back(endIdx);
return closePath;
}
}
}
return nullptr;
}
const std::vector<int>* PathFinder::findPath(int startIdx, int endIdx, int limit) {
endIdx = getPassableEnd(endIdx); //TODO improve kolejnosc tego i nize jest istotna?
if (ifInCache(startIdx, endIdx)) {
return tempPath;
}
if (isInLocalArea(startIdx, endIdx)) {
closePath->clear();
closePath->emplace_back(endIdx);
return closePath;
}
const auto closePath = getClosePath2(startIdx, endIdx, closeIndexes->getPassIndexVia1LevelTo2(startIdx, endIdx));
if (closePath) { return closePath; }
lastStartIdx = startIdx;
lastEndIdx = endIdx;
const std::vector endIdxs = {endIdx};
return realFindPath(startIdx, endIdxs, limit);
}
const std::vector<int>* PathFinder::findPath(int startIdx, const std::vector<int>& endIdxs, int limit) {
if (endIdxs.empty()) {
closePath->clear();
return closePath;
}
if (ifInCache(startIdx, endIdxs)) {
return tempPath;
}
auto newEndIndexes = getPassableIndexes(endIdxs);
if (newEndIndexes.empty()) {
Game::getLog()->WriteRaw("No TargetFound");
closePath->clear();
return closePath;
}
const int localIdx = isInLocalArea(startIdx, newEndIndexes);
if (localIdx != -1) {
closePath->clear();
closePath->emplace_back(localIdx);
return closePath;
}
auto [closePass, endIdx] = closeIndexes->getPassIndexVia1LevelTo2(startIdx, newEndIndexes);
//TODO zwrócic kilka vectorów??
const auto closePath = getClosePath2(startIdx, endIdx, closePass);
if (closePath) { return closePath; }
const auto path = realFindPath(startIdx, newEndIndexes, limit);
if (path->empty()) {
invalidateCache();
} else {
lastStartIdx = startIdx;
lastEndIdx = path->back();
}
return path;
}
bool PathFinder::validateIndex(const int current, int next) const {
if (calculator->isValidIndex(next)) {
return true;
}
std::cout << current << "@@" << next << std::endl;
return false;
}
int PathFinder::getPassableEnd(int endIdx) const {
while (!complexData[endIdx].isPassable()) {
auto& data = complexData[endIdx];
if (data.allNeightOccupied()) {
endIdx = data.getEscapeBucket();
assert(calculator->isValidIndex(endIdx));
} else {
for (auto i : closeIndexes->getTabIndexes(endIdx)) {
if (data.ifNeightIsFree(i)) {
endIdx = endIdx + closeIndexes->getIndexAt(i); //TODO obliczyc lepszy, a nie pierwszy z brzegu
break;
}
}
}
}
return endIdx;
}
std::vector<int> PathFinder::getPassableIndexes(const std::vector<int>& endIdxs) const {
std::vector<int> result;
result.reserve(endIdxs.size());
for (int endIdx : endIdxs) {
result.push_back(getPassableEnd(endIdx));
}
std::ranges::sort(result);
result.erase(std::unique(result.begin(), result.end()), result.end());
return result;
}
void PathFinder::refreshWayOut(std::vector<int>& toRefresh) {
std::vector<int> refreshed;
while (!toRefresh.empty()) {
int startIndex = toRefresh.back();
toRefresh.pop_back();
if (std::ranges::find(refreshed, startIndex) != refreshed.end()) {
continue;
}
if (!complexData[startIndex].allNeightOccupied()) {
complexData[startIndex].setEscapeThrough(-1);
continue;
}
prepareToStart(startIndex);
int end = startIndex;
while (!frontier.empty()) {
const auto current = frontier.get();
assert(calculator->isValidIndex(current));
auto& currentData = complexData[current];
if (!currentData.allNeightOccupied()) {
end = current;
currentData.setEscapeThrough(-1);
break;
}
for (auto i : closeIndexes->getTabIndexes(current)) {
if (!currentData.ifNeightIsFree(i)) {
int nI = current + closeIndexes->getIndexAt(i);
assert(calculator->isValidIndex(nI));
if (!complexData[nI].allNeightOccupied()
&& std::ranges::find(refreshed, nI) != refreshed.end()) {
//TODO to chyba glupi warunek
toRefresh.push_back(nI);
}
int next = nI;
if (came_from[current] != next) {
const float new_cost = cost_so_far[current] + currentData.getCost(i);
if (cost_so_far[next] < 0.f || new_cost < cost_so_far[next]) {
updateCost(next, new_cost);
frontier.put(next, new_cost);
came_from[next] = current;
}
}
}
}
}
const std::vector<int>* path = reconstructPath(startIndex, end, came_from);
if (!path->empty()) {
int current2 = startIndex;
for (int i = 1; i < path->size(); ++i) {
assert(calculator->isValidIndex(current2));
complexData[current2].setEscapeThrough(path->at(i));
refreshed.push_back(current2);
current2 = path->at(i);
}
} else {
assert(calculator->isValidIndex(startIndex));
refreshed.push_back(startIndex);
complexData[startIndex].setEscapeThrough(-1);
}
}
}
inline float PathFinder::heuristic(const Urho3D::IntVector2& from, const Urho3D::IntVector2& to) const {
return (abs(from.x_ - to.x_) + abs(from.y_ - to.y_)) * fieldSize;
}
inline float PathFinder::heuristic(int from, const Urho3D::IntVector2& to) const {
return heuristic(getCords(from), to);
}
float PathFinder::heuristic(int from, std::vector<Urho3D::IntVector2>& endIdxs) const {
//closest from endIdxs
assert(!endIdxs.empty());
const auto a = getCords(from);
float min = 1024.f;
for (auto& endCords : endIdxs) {
const float val = heuristic(a, endCords);
if (val < min) {
min = val;
}
}
return min;
}
bool PathFinder::ifInCache(int startIdx, const std::vector<int>& endIdxs) const {
if (lastStartIdx != startIdx) { return false; }
return std::ranges::any_of(endIdxs.begin(), endIdxs.end(),
[this](int i) { return i == lastEndIdx; });
}
void PathFinder::invalidateCache() {
lastStartIdx = -1;
lastEndIdx = -1;
}
void PathFinder::debug(int start, int end) {
auto image = new Urho3D::Image(Game::getContext());
image->SetSize(resolution, resolution, 4);
Urho3D::String prefix = Urho3D::String(staticCounter) + "_";
drawMap(image);
image->SaveBMP("result/images/" + prefix + "1_grid_map.bmp");
//draw_grid_from(came_from, image);
//image->SaveBMP("result/images/" + prefix + "2_grid_from.bmp");
draw_grid_cost(cost_so_far, image, resolution);
image->SaveBMP("result/images/" + prefix + "3_grid_cost.bmp");
auto path = reconstructPath(start, end, came_from);
draw_grid_path(path, image, resolution);
image->SaveBMP("result/images/" + prefix + "4_grid_path.bmp");
delete image;
staticCounter++;
}
void PathFinder::drawMap(Urho3D::Image* image) const {
const auto data = (uint32_t*)image->GetData();
for (short y = 0; y != resolution; ++y) {
for (short x = 0; x != resolution; ++x) {
const int index = calculator->getIndex(x, y);
const int idR = calculator->getIndex(resolution - y - 1, x);
if (complexData[index].isPassable()) {
*(data + idR) = 0xFFFFFFFF;
} else {
*(data + idR) = 0xFF000000;
}
}
}
}
void PathFinder::updateCost(int idx, float x) {
cost_so_far[idx] = x;
if (idx < min_cost_to_ref) {
min_cost_to_ref = idx;
}
if (idx > max_cost_to_ref) {
max_cost_to_ref = idx;
}
}
std::vector<Urho3D::IntVector2> PathFinder::getCords(const std::vector<int>& endIdxs) const {
std::vector<Urho3D::IntVector2> cords;
cords.reserve(endIdxs.size());
for (auto idx : endIdxs) {
cords.emplace_back(getCords(idx));
}
return cords;
}
void PathFinder::resetPathArrays() {
assert(min_cost_to_ref != resolution * resolution - 1);
//std::fill_n(cost_so_far + min_cost_to_ref, max_cost_to_ref + 1 - min_cost_to_ref, -1.f);
std::fill(cost_so_far + min_cost_to_ref, cost_so_far + max_cost_to_ref + 1, -1.f);
//std::fill_n(cost_so_far, resolution * resolution, -1.f);
int x = -1;
int y = -1;
long long val = ((long long)x) << 32 | y;
memset(came_from + min_cost_to_ref / 2, val, (max_cost_to_ref + 2 - min_cost_to_ref) / 2);
//std::fill_n(came_from, resolution * resolution, -1);
min_cost_to_ref = resolution * resolution - 1;
max_cost_to_ref = 0;
}
bool PathFinder::isInLocalArea(const int center, int indexOfAim) const {
return closeIndexes->isInLocalArea(center, indexOfAim);
}
bool PathFinder::isInLocal2Area(int center, int indexOfAim) const {
return closeIndexes->isInLocal2Area(center, indexOfAim);
}
int PathFinder::isInLocalArea(int center, std::vector<int>& endIdxs) const {
for (auto const idxs : endIdxs) {
//TOOD perf tu pewnie kilka rzecz sprawdzane pare rzeczy
if (isInLocalArea(center, idxs)) {
return idxs;
}
}
return -1;
}
```
UnitState.h
```#pragma once
enum class UnitState : char {
STOP=0,
MOVE,
GO,
FOLLOW,
ATTACK,
SHOT,
CHARGE,
DEFEND,
COLLECT,
DEAD,
DISPOSE
};
```
Unit.h
```#pragma once
#include <Urho3D/Container/Str.h>
#include <Urho3D/Math/Vector2.h>
#include <tuple>
#include "ActionParameter.h"
#include "aim/Aims.h"
#include "objects/ObjectEnums.h"
#include "objects/Physical.h"
#include "state/UnitState.h"
class IndividualOrder;
namespace Urho3D {
class Vector4;
class Color;
class Material;
class Vector3;
}
constexpr char USE_SOCKETS_NUMBER = 8;
enum class UnitAction : char;
enum class DebugUnitType : char;
enum class SimColorMode : char;
struct ForceStats;
struct db_unit_level;
struct db_unit;
struct dbload_unit;
struct ProjectileWithNode;
struct ChargeData;
struct ActionParameter;
struct CameraInfo;
class Aim;
class Unit : public Physical {
friend class State;
friend class StopState;
friend class DefendState;
friend class DeadState;
friend class GoState;
friend class PatrolState;
friend class FollowState;
friend class AttackState;
friend class ChargeState;
friend class CollectState;
friend class DisposeState;
friend class ShotState;
friend class MoveState;
public:
Unit(Urho3D::Vector3& _position, int id, int player, int level);
~Unit() override;
void populate() override;
void checkAim();
void updatePosition() const;
bool move(float timeStep, const CameraInfo* camInfo);
bool ifVisible(bool hasMoved, const CameraInfo* camInfo) const;
void applyForce(float timeStep);
void setAcceleration(Urho3D::Vector2& _acceleration);
void forceGo(float boostCoef, float aimCoef, Urho3D::Vector2& force) const;
Urho3D::Vector2 getDestination(float boostCoef, float aimCoef);
std::pair<float, bool> absorbAttack(float attackCoef) override;
bool toActionIfInRange(Physical* closest, UnitAction order);
bool toAction(Physical* closest, UnitAction order);
void updateHeight(float y, double timeStep);
void setState(UnitState _state);
void load(dbload_unit* unit);
ObjectType getType() const override { return ObjectType::UNIT; }
float getAttackVal(Physical* aim) override;
void setFormation(short _formation);
void resetFormation();
void setPositionInFormation(short _pos);
void clearAims();
void removeCurrentAim();
void setIndexToInteract(int index);
int getIndexToInteract() const { return indexToInteract; }
void setNextState(UnitState stateTo, const ActionParameter& actionParameter);
void setNextState(UnitState stateTo);
ActionParameter& getNextActionParameter();
bool hasStateChangePending() const;
void changeColor(SimColorMode mode);
void addOrder(IndividualOrder* aim);
void drawLineTo(const Urho3D::Vector2& second, const Urho3D::Color& color) const;
void debug(DebugUnitType type, ForceStats& stats);
bool isFirstThingAlive() const;
short getThingToInterActId() const { return thingToInteract ? thingToInteract->getId() : -1; }
float getMaxSeparationDistance() const;
short getPositionInFormation() const { return posInFormation; }
float getMinimalDistance() const;
UnitState getActionState() const;
UnitState getState() const { return state; }
UnitState getNextState() const { return nextState; }
short getFormation() const { return formation; }
bool isToDispose() const override { return state == UnitState::DISPOSE; }
bool hasAim() const { return aims.hasAim(); }
db_unit_level* getLevel() const { return dbLevel; }
db_unit* getDbUnit() const { return dbUnit; }
short getLastActionThingId() const { return lastActionThingId; }
float getAttackRange() const;
int getSparseIndex() const { return sparseIndexInGrid; }
bool isIndexSlotOccupied(int indexToInteract) override;
void setOccupiedIndexSlot(char index, bool value) override;
bool ifSlotIsOccupied(char index) const;
std::optional<std::tuple<Urho3D::Vector2, float>> getPosToUseWithDist(Unit* user) override;
std::vector<int> getIndexesForUse(Unit* user) const override;
std::vector<int> getIndexesForRangeUse(Unit* user) const override;
bool action(UnitAction unitAction, const ActionParameter& parameter);
bool action(UnitAction unitAction);
bool indexChanged() const override { return indexHasChanged; }
std::string getValues(int precision) override;
Urho3D::String getInfo() const override;
const Urho3D::String& getName() const override;
unsigned short getMaxHpBarSize() const override;
bool isAlive() const override;
char getLevelNum() override;
void clean();
float getSightRadius() const override;
Urho3D::Vector2 getSocketPos(Unit* toFollow, int i) const;
short getCostSum() const override;
bool isInCloseRange(int index) const override;
void setSlotToInteract(char slot) { slotToInteract = slot; }
void setSparseIndex(int index);
float getModelHeight() const override;
void setModelData(float modelHeight) const override;
Urho3D::Color getColor(db_player_colors* col) const override;
void setVisibility(VisibilityType type) override;
void setThingToInteract(Physical* toUse) {
thingToInteract = toUse;
}
unsigned char getMaxRangeUsers() const { return 16; }
void resetStateChangePending();
Physical* getThingToInteract() const { return thingToInteract; }
private:
void setAim(Aim* aim);
Urho3D::Vector2 velocity, acceleration;
Aims aims;
db_unit* dbUnit;
db_unit_level* dbLevel;
ChargeData* chargeData{};
Physical* thingToInteract{}; //TODO jak to wczytac :O
int sparseIndexInGrid;
float maxSpeed;
int indexToInteract = -1; //TODO moze sie tego pozbyc
unsigned short currentFrameState = 0;
short posInFormation = -1, formation = -1;
UnitState state;
UnitState nextState;
bool stateChangePending = false;
char slotToInteract = -1;
unsigned char useSockets = 0;
char lastActionThingId = -1; //TODO reset po jakim czasie
ActionParameter nextActionParameter;
};
```
NewGamePlayer.h
```#pragma once
#include <Urho3D/Container/Str.h>
struct NewGamePlayer {
Urho3D::String name;
int nation;
int team;
int color;
int id;
bool active;
};
```
BuildingFactory.cpp
```#include "BuildingFactory.h"
#include "Game.h"
#include "database/DatabaseCache.h"
#include "objects/building/Building.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
Building* BuildingFactory::create(int id, const Urho3D::IntVector2& bucketCords, int level, int player) const {
const auto db_building = Game::getDatabase()->getBuilding(id);
if (Game::getEnvironment()->validateStatic(db_building->size, bucketCords, true)) {
const auto center = Game::getEnvironment()->getValidPosition(db_building->size, bucketCords);
return new Building(Urho3D::Vector3(center.x_,
Game::getEnvironment()->getGroundHeightAt(center.x_, center.y_),
center.y_),
id, player, level, Game::getEnvironment()->getIndex(bucketCords.x_, bucketCords.y_),
!SIM_GLOBALS.HEADLESS);
}
return nullptr;
}
Building* BuildingFactory::load(dbload_building* building) const {
const Urho3D::IntVector2 bucketCords(building->buc_x, building->buc_y);
auto build = create(building->id_db, bucketCords, building->level, building->player);
if (build) {
return build->load(building);
}
return nullptr;
}
```
FileFormData.h
```#pragma once
#include <Urho3D/Container/Str.h>
struct FileFormData {
Urho3D::String fileName;
};
```
VisibilityMode.h
```#pragma once
#include <magic_enum.hpp>
enum class VisibilityMode:char {
PLAYER_ONLY= 0,
ALL_PLAYERS,
//TEAM,
ALL,
};
constexpr inline VisibilityMode NEXT_VISIBILITY_MODES[magic_enum::enum_count<VisibilityMode>()] = {
VisibilityMode::ALL_PLAYERS, VisibilityMode::ALL, VisibilityMode::PLAYER_ONLY
};
```
CameraInfo.h
```#pragma once
#include <Urho3D/Math/Vector4.h>
struct CameraInfo {
Urho3D::String info;
Urho3D::Vector4 boundary;
bool hasMoved = true;
};
```
RtsCameraBehave.h
```#pragma once
#include "CameraBehave.h"
class RtsCameraBehave : public CameraBehave {
public:
RtsCameraBehave();
virtual ~RtsCameraBehave() = default;
bool translate(bool cameraKeys[], int wheel, float timeStep, float min) override;
bool rotate(const Urho3D::IntVector2& mouseMove, float mouse_sensitivity) override { return false; }
void setRotation(const Urho3D::Quaternion& rotation) override {
}
Urho3D::MouseMode getMouseMode() override;
Urho3D::Vector2 getTargetPos() const override;
private:
float maxY = 200;
};
```
ParentBuildingType.h
```#pragma once
enum class ParentBuildingType : char {
OTHER = 0,
DEFENCE,
RESOURCE,
TECH,
UNITS
};
```
ComplexBucketData.h
```#pragma once
#include <vector>
#include "objects/CellState.h"
#include "objects/resource/ResourceEntity.h"
#include "utils/defines.h"
#include "utils/Flags.h"
//enum class CellState : char;
namespace Urho3D {
class Vector2;
class Vector3;
}
class Building;
class Static;
class ComplexBucketData {
public:
ComplexBucketData();
~ComplexBucketData() = default;
ComplexBucketData(const ComplexBucketData&) = delete;
void setStatic(Static* object);
void clear();
void setEscapeThrough(int val);
Urho3D::Vector2 getDirectionFrom(const Urho3D::Vector3& position, Urho3D::Vector2 centerEscape);
void setNeightOccupied(unsigned char index);
void setNeightFree(unsigned char index);
bool ifNeightIsFree(unsigned char index) const { return !(isNeightOccupied & Flags::bitFlags[index]); };
float getCost(const unsigned char index) const { return costToNeight[index]; }
void setCost(const unsigned char index, float cost) { costToNeight[index] = cost; }
bool allNeightOccupied() const { return isNeightOccupied == 255; }
char getAdditionalInfo() const { return additionalInfo; }
int getEscapeBucket() const { return escapeBucketIndex; }
CellState getType() const { return state; }
void updateSize(char val, CellState cellState);
void setResBonuses(char player, const std::vector<char>& resIds, float bonus);
void resetResBonuses(char player, char resId);
float getResBonus(char player, short resId) const;
void setDeploy();
bool cellIsCollectable() const;
bool cellIsAttackable() const;
bool isPassable() const { return state <= CellState::DEPLOY; }
bool isBuildable() const;
private:
CellState state;
char size, additionalInfo{};
unsigned char isNeightOccupied = 255; //na poczatku wszystko zajęte
int escapeBucketIndex = -1;//TODO moze zrezygnowac z tego całkiem
float costToNeight[8] = {0.f};
float resourceBonuses[MAX_PLAYERS][RESOURCES_SIZE];
//float cost{};
bool belowCellLimit() const;
};
```
Flags.h
```#pragma once
struct Flags {
inline static const unsigned char bitFlags[8] =
{
0x1,
0x2,
0x4,
0x8,
0x10,
0x20,
0x40,
0x80
};
};
```
BuildingActionCommand.h
```#pragma once
#include <vector>
#include "commands/AbstractCommand.h"
enum class BuildingActionType : char;
class Building;
class Physical;
class BuildingActionCommand : public AbstractCommand {
friend class Stats;
public:
BuildingActionCommand(Building* building, BuildingActionType action, short id, char player);
BuildingActionCommand(const std::vector<Physical*>& buildings, BuildingActionType action, short id, char player);
void clean() override;
bool expired() override;
void execute() override;
private:
short id;
BuildingActionType action;
std::vector<Building*> buildings;
};
```
CameraEnums.h
```#pragma once
enum class CameraBehaviorType : char {
FREE = 0,
RTS,
TOP
};
```
ChargeState.h
```#pragma once
#include "State.h"
#include "../Unit.h"
#include "database/db_strcut.h"
#include "math/MathUtils.h"
#include "objects/unit/ChargeData.h"
struct ActionParameter;
class ChargeState : public State {
public:
ChargeState(): State({
UnitState::STOP, UnitState::DEFEND, UnitState::DEAD, UnitState::GO, UnitState::FOLLOW, UnitState::CHARGE,
UnitState::MOVE
}) {
}
~ChargeState() = default;
bool canStart(Unit* unit, const ActionParameter& parameter) override {
return parameter.aim != nullptr;
}
void onStart(Unit* unit, const ActionParameter& parameter) override {
unit->setAim(parameter.aim); //TODO Storzyc charge data tutaj
// unit->thingsToInteract.clear();
// unit->thingsToInteract.push_back(parameter.thingToInteract);//TODO to chyba nie potrzebne
//TODO aim?
unit->maxSpeed = unit->dbLevel->maxSpeed * 2;
unit->chargeData->reset();
}
void onEnd(Unit* unit) override {
unit->maxSpeed = unit->dbLevel->maxSpeed;
unit->removeCurrentAim();
}
void execute(Unit* unit, float timeStep) override {
if (!unit->aims.hasCurrent() && !unit->hasStateChangePending()) {
StateManager::toDefaultState(unit);
} else {
const auto thingsToInteract = toCharge(
Game::getEnvironment()->getNeighboursFromTeamNotEq(unit, unit->chargeData->attackRange), unit);
if (unit->chargeData->updateFrame()) {
for (const auto physical : thingsToInteract) {
if (unit->getTeam() != physical->getTeam()) {
const auto before = physical->getHealthPercent();
const auto [value, died] = physical->absorbAttack(
unit->getAttackVal(physical) / thingsToInteract.size());//TODO może nie dzielić uzależnic od czegoś?
Game::getEnvironment()->addAttack(unit->getPlayer(), physical->getPosition(), value);
if (died) {
Game::getPlayersMan()->getPlayer(unit->getPlayer())->addKilled(physical);
}
const auto after = physical->getHealthPercent();
if (!unit->chargeData->updateHit(before, after)) {
StateManager::changeState(unit, UnitState::MOVE);
break;
}
}
}
} else {
StateManager::changeState(unit, UnitState::MOVE);
}
}
}
std::vector<Physical*> toCharge(const std::vector<Physical*>* enemies, Unit* unit) const {
std::vector<Physical*> thingsToInteract;
const auto sqRange = unit->chargeData->attackRange * unit->chargeData->attackRange;
for (auto entity : *enemies) {
if (entity->isAlive() && sqDist(unit->getPosition(), entity->getPosition()) <= sqRange) {
thingsToInteract.push_back(entity);
}
}
return thingsToInteract;
}
};
```
ColorPallet.h
```#pragma once
enum class ColorPallet : char {
RED=0,
};
```
StaticGrid.cpp
```#include "StaticGrid.h"
#include <cassert>
#include <iostream>
#include "Bucket.h"
#include "levels/LevelCache.h"
#include "objects/Physical.h"
#include "utils/DeleteUtils.h"
StaticGrid::StaticGrid(short resolution, float size, std::vector<float> queryRadius): Grid(resolution, size, true,
queryRadius.back()), queryRadius(queryRadius) {
assert(queryRadius.size()>1);
bucketsPerRadius.reserve(queryRadius.size());
for (int i = 0; i < queryRadius.size(); ++i) {
bucketsPerRadius.push_back(new Bucket[sqResolution]);
bool* arr = new bool[sqResolution];
std::fill_n(arr, sqResolution, false);
inited.push_back(arr);
}
}
StaticGrid::~StaticGrid() {
clear_vector_array(bucketsPerRadius);
clear_vector_array(inited);
}
int StaticGrid::update(Physical* entity, int currentIndex) const {
assert(false);
return -1;
}
void StaticGrid::remove(Physical* physical) const {
Grid::remove(physical);
const int centerIndex = calculator->indexFromPosition(physical->getPosition());
const auto centerCords = calculator->getIndexes(centerIndex);
for (int i = 0; i < queryRadius.size(); ++i) {
auto const [indexes, cords] = levelCache->getBoth(queryRadius.at(i));
assert(indexes->size() == cords->size());
const auto itr = bucketsPerRadius[i];
auto ptrIdx = indexes->begin();
for (const auto& shiftCords : *cords) {
if (calculator->isValidIndex(shiftCords.x_ + centerCords.x_, shiftCords.y_ + centerCords.y_)) {
if (inited[i][centerIndex + *ptrIdx]) {
itr[centerIndex + *ptrIdx].remove(physical); //TODDO notafe or if inited
}
}
++ptrIdx;
}
}
}
void StaticGrid::updateStatic(Static* staticObj, bool bulkAdd) const {
staticObj->setBucket(Grid::updateNew(staticObj));
if (!bulkAdd) {
const int centerIndex = calculator->indexFromPosition(staticObj->getPosition());
const auto centerCords = calculator->getIndexes(centerIndex);
for (int i = 0; i < queryRadius.size(); ++i) {
auto const [indexes, cords] = levelCache->getBoth(queryRadius.at(i));
const auto itr = bucketsPerRadius[i];
auto ptrIdx = indexes->begin();
auto x = itr + centerIndex;
for (const auto& shiftCords : *cords) {
if (calculator->isValidIndex(shiftCords.x_ + centerCords.x_, shiftCords.y_ + centerCords.y_)) {
if (inited[i][centerIndex + *ptrIdx]) {
(*(x + *ptrIdx)).add(staticObj);
}
}
++ptrIdx;
}
}
}
}
void StaticGrid::ensureInited(int index, int centerIndex) {
if (inited[index][centerIndex]) { return; }
inited[index][centerIndex] = true;
auto const [indexes, cords] = levelCache->getBoth(queryRadius.at(index));
const auto centerCords = calculator->getIndexes(centerIndex);
auto ptrIdx = indexes->begin();
//TODO pref? reserver size
auto& bucketRad = bucketsPerRadius[index][centerIndex];
for (const auto& shiftCords : *cords) {
if (calculator->isValidIndex(shiftCords.x_ + centerCords.x_, shiftCords.y_ + centerCords.y_)) {
bucketRad.add(buckets[centerIndex + *ptrIdx].getContent());
}
++ptrIdx;
}
}
const std::vector<Physical*>& StaticGrid::get(const Urho3D::Vector3& center, float radius) {
const int index = getIndexForRadius(radius);
const int centerIndex = calculator->indexFromPosition(center);
ensureInited(index, centerIndex);
return bucketsPerRadius[index][centerIndex].getContent();
}
int StaticGrid::getIndexForRadius(float radius) const {
for (int i = 0; i < queryRadius.size(); ++i) {
if (queryRadius[i] >= radius) {
return i;
}
}
return queryRadius.size() - 1;
}
```
QueueActionType.h
```#pragma once
enum class QueueActionType : char {
UNIT_CREATE=0,
UNIT_LEVEL,
UNIT_UPGRADE,//TODO dodac to kiedys
BUILDING_LEVEL,
BUILDING_CREATE,
};
```
Unit.cpp
```#include "Unit.h"
#include <Urho3D/Resource/Localization.h>
#include "Game.h"
#include "colors/ColorPaletteRepo.h"
#include "colors/ColorPallet.h"
#include "database/DatabaseCache.h"
#include "database/db_strcut.h"
#include "debug/DebugLineRepo.h"
#include "debug/DebugUnitType.h"
#include "math/VectorUtils.h"
#include "objects/unit/ChargeData.h"
#include "objects/unit/SimColorMode.h"
#include "order/IndividualOrder.h"
#include "order/enums/UnitAction.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
#include "simulation/force/ForceStats.h"
#include "simulation/formation/FormationManager.h"
#include "state/StateManager.h"
#include "camera/CameraInfo.h"
#include "math/MathUtils.h"
#include "player/Player.h"
#include "utils/consts.h"
#include "utils/Flags.h"
#include "objects/NodeUtils.h"
Unit::Unit(Urho3D::Vector3& _position, int id, int player, int level) : Physical(_position, !SIM_GLOBALS.HEADLESS),
state(UnitState::STOP),
nextState(UnitState::STOP) {
dbUnit = Game::getDatabase()->getUnit(id);
dbLevel = dbUnit->getLevel(level).value(); //TODO bug value
setPlayerAndTeam(player);
loadXml("Objects/units/" + dbLevel->node);
if (dbUnit->typeCalvary) {
chargeData = new ChargeData(150, 2);
}
}
Unit::~Unit() {
delete chargeData;
}
bool Unit::isAlive() const {
return state != UnitState::DEAD && state != UnitState::DISPOSE;
}
void Unit::populate() {
maxSpeed = dbLevel->maxSpeed;
invMaxHp = dbLevel->invMaxHp;
hp = dbLevel->maxHp;
id = dbUnit->id;
}
void Unit::checkAim() {
if (aims.process(this)) {
StateManager::changeState(this, UnitState::MOVE);
}
}
void Unit::updatePosition() const {
if (shouldUpdate) {
if (isInStates(state, {UnitState::ATTACK, UnitState::COLLECT, UnitState::SHOT}) && isFirstThingAlive()) {
const auto dir = dirTo(position, thingToInteract->getPosition());
node->SetTransform(
position,
Urho3D::Quaternion(Urho3D::Vector3::FORWARD, Urho3D::Vector3(dir.x_, 0.f, dir.y_)));
} else if (velocity.LengthSquared() > 4 * dbLevel->sqMinSpeed) {
node->SetTransform(
position,
Urho3D::Quaternion(Urho3D::Vector3::FORWARD, Urho3D::Vector3(velocity.x_, 0.f, velocity.y_)));
} else {
node->SetPosition(position);
}
}
}
bool Unit::move(float timeStep, const CameraInfo* camInfo) {
bool hasMoved = false;
const bool prevVisible = shouldUpdate;
if (state != UnitState::STOP) {
hasMoved = true;
position.x_ += velocity.x_ * timeStep;
position.z_ += velocity.y_ * timeStep;
shouldUpdate = ifVisible(true, camInfo);
updatePosition();
} else {
shouldUpdate = ifVisible(false, camInfo);
}
if (prevVisible == false && shouldUpdate == true) {
node->SetPosition(position);
}
return hasMoved;
}
bool Unit::ifVisible(bool hasMoved, const CameraInfo* camInfo) const {
if (SIM_GLOBALS.HEADLESS) {
return false;
}
if (!(camInfo->hasMoved || hasMoved)) {
return shouldUpdate;
}
auto& boundary = camInfo->boundary;
return (boundary.x_ < position.x_ || boundary.x_ < node->GetPosition().x_)
&& (position.x_ < boundary.y_ || node->GetPosition().x_ < boundary.y_)
&& (boundary.z_ < position.z_ || boundary.z_ < node->GetPosition().z_)
&& (position.z_ < boundary.w_ || node->GetPosition().z_ < boundary.w_);
}
void Unit::setAcceleration(Urho3D::Vector2& _acceleration) {
acceleration = _acceleration;
if (acceleration.LengthSquared() > dbLevel->maxForce * dbLevel->maxForce) {
acceleration.Normalize();
acceleration *= dbLevel->maxForce;
}
}
void Unit::forceGo(float boostCoef, float aimCoef, Urho3D::Vector2& force) const {
force.Normalize();
force *= boostCoef;
force -= velocity;
force *= dbLevel->mass * aimCoef * 2.f;
}
Urho3D::Vector2 Unit::getDestination(float boostCoef, float aimCoef) {
Urho3D::Vector2 force;
aims.clearExpired();
if (aims.hasAim()) {
auto dirOpt = aims.getDirection(this);
if (dirOpt.has_value()) {
force = dirOpt.value();
forceGo(boostCoef, aimCoef, force);
}
}
return force;
}
std::pair<float, bool> Unit::absorbAttack(float attackCoef) {
if (hp <= 0.f) {
return {0.f, false};
}
auto val = attackCoef * (1 - dbLevel->armor);
hp -= val;
if (hp <= 0) {
StateManager::changeState(this, UnitState::DEAD);
return {val, true};
}
return {val, false};
}
bool Unit::toActionIfInRange(Physical* closest, UnitAction order) {
if (closest && sqDistAs2D(getPosition(), closest->getPosition()) < dbLevel->sqSightRadius) {
return toAction(closest, order);
}
return false;
}
bool Unit::toAction(Physical* closest, UnitAction order) {
if (closest) {
addOrder(new IndividualOrder(this, order, closest, true));
return true;
}
return false;
}
void Unit::updateHeight(float y, double timeStep) {
velocity *= 1 + (position.y_ - y) * 0.1f * dbLevel->mass * timeStep;
position.y_ = y;
}
void Unit::addOrder(IndividualOrder* aim) {
resetFormation();
aims.add(aim);
}
void Unit::setAim(Aim* aim) {
aims.set(aim);
}
void Unit::drawLineTo(const Urho3D::Vector2& second,
const Urho3D::Color& color = Urho3D::Color::WHITE) const {
if (!second.Equals(Urho3D::Vector2::ZERO)) {
Urho3D::Vector3 to = Urho3D::Vector3(position.x_ + second.x_, position.y_, position.z_ + second.y_);
DebugLineRepo::drawLine(DebugLineType::UNIT_LINES, position, to, color);
}
}
void Unit::debug(DebugUnitType type, ForceStats& stats) {
if constexpr (DEBUG_LINES_ENABLED) {
if (selected) {
switch (type) {
case DebugUnitType::NONE:
break;
case DebugUnitType::VELOCITY:
drawLineTo(velocity);
break;
case DebugUnitType::ACCELERATION:
drawLineTo(acceleration);
break;
case DebugUnitType::SEPARATION_UNITS:
drawLineTo(stats.sepUnitLast);
break;
case DebugUnitType::SEPARATION_OBSTACLE:
drawLineTo(stats.sepObstLast);
break;
case DebugUnitType::DESTINATION:
drawLineTo(stats.destLast);
break;
case DebugUnitType::FORMATION:
drawLineTo(stats.formLast);
break;
case DebugUnitType::ESCAPE:
drawLineTo(stats.escaLast);
break;
case DebugUnitType::ALL_FORCE:
drawLineTo(velocity);
drawLineTo(stats.sepUnitLast, Urho3D::Color::RED);
drawLineTo(stats.sepObstLast, Urho3D::Color::GREEN);
drawLineTo(stats.destLast, Urho3D::Color::BLUE);
drawLineTo(stats.formLast, Urho3D::Color::YELLOW);
drawLineTo(stats.escaLast, Urho3D::Color::CYAN);
break;
case DebugUnitType::AIM:
if (aims.hasCurrent()) {
const auto lines = aims.getDebugLines(this);
if (!lines.empty()) {
for (int i = 0; i < lines.size() - 1; ++i) {
DebugLineRepo::drawLine(DebugLineType::UNIT_LINES, lines[i], lines[i + 1]);
}
}
}
break;
case DebugUnitType::INTERACT: //TODO charge
DebugLineRepo::drawLine(DebugLineType::UNIT_LINES, position, thingToInteract->getPosition());
break;
default: ;
}
//stats.vectorReset();
}
}
}
void Unit::removeCurrentAim() {
aims.removeCurrentAim();
}
void Unit::setIndexToInteract(int index) {
indexToInteract = index;
}
Urho3D::String Unit::getInfo() const {
const auto l10n = Game::getLocalization();
return Urho3D::String(dbUnit->name + " " + dbLevel->name)
.AppendWithFormat(l10n->Get("info_unit").CString(),
asStringF(dbLevel->attack, 1).c_str(),
asStringF(dbLevel->attackRange, 1).c_str(),
asStringF(dbLevel->attackReload, 1).c_str(),
asStringF(dbLevel->armor).c_str(),
(int)hp, dbLevel->maxHp,
closeUsers, getMaxCloseUsers(),
rangeUsers, getMaxRangeUsers(),
magic_enum::enum_name(state).data());
}
const Urho3D::String& Unit::getName() const {
return dbUnit->name;
}
bool Unit::action(UnitAction unitAction) {
assert(unitAction == UnitAction::STOP || unitAction == UnitAction::DEAD || unitAction == UnitAction::DEFEND);
return action(unitAction, Consts::EMPTY_ACTION_PARAMETER);
}
bool Unit::action(UnitAction unitAction, const ActionParameter& parameter) {
switch (unitAction) {
case UnitAction::GO:
return StateManager::changeState(this, UnitState::GO, parameter);
case UnitAction::STOP:
return StateManager::changeState(this, UnitState::STOP, parameter);
case UnitAction::CHARGE:
return StateManager::changeState(this, UnitState::CHARGE, parameter);
case UnitAction::ATTACK:
if (dbUnit->typeRange) {
//TODO perf chyba trzeba dodacparamter do actionParameter
//TODO zawsze strzelac? nawet z bliska
if (!parameter.thingToInteract->isInCloseRange(getMainGridIndex())) {
//jezeli nie jest in close range
return StateManager::changeState(this, UnitState::SHOT, parameter);
}
}
return StateManager::changeState(this, UnitState::ATTACK, parameter);
break;
case UnitAction::DEAD:
return StateManager::changeState(this, UnitState::DEAD, parameter);
case UnitAction::DEFEND:
resetFormation();
return StateManager::changeState(this, UnitState::DEFEND, parameter);
case UnitAction::FOLLOW:
return StateManager::changeState(this, UnitState::FOLLOW, parameter);
case UnitAction::COLLECT:
return StateManager::changeState(this, UnitState::COLLECT, parameter);
default: ;
}
}
void Unit::setSparseIndex(int index) {
if (index >= 0) {
sparseIndexInGrid = index;
}
}
float Unit::getModelHeight() const {
return dbLevel->modelHeight;
}
void Unit::setModelData(float modelHeight) const {
dbLevel->modelHeight = modelHeight;
}
Urho3D::Color Unit::getColor(db_player_colors* col) const {
return col->unitColor;
}
void Unit::setVisibility(VisibilityType type) {
if (node) {
switch (type) {
case VisibilityType::NONE:
case VisibilityType::SEEN:
if (node->IsEnabled()) {
node->SetEnabled(false);
}
break;
case VisibilityType::VISIBLE: {
if (!node->IsEnabled()) {
node->SetEnabled(true);
}
}
}
}
}
void Unit::resetStateChangePending() {
stateChangePending = false;
}
void Unit::changeColor(SimColorMode mode) {
switch (mode) {
case SimColorMode::BASIC:
setShaderParam(this, "ColorPercent", 2.f);
break;
case SimColorMode::VELOCITY:
setShaderParam(this, "ColorPercent", velocity.LengthSquared() / maxSpeed * maxSpeed);
break;
case SimColorMode::STATE:
setShaderParam(this, "ColorPercent", ((float)state )/ magic_enum::enum_count<UnitState>());
break;
case SimColorMode::FORMATION:
if (formation != -1) {
setShaderParam(this, "ColorPercent", Game::getFormationManager()->getPriority(this) / 3.f);
}
}
}
void Unit::setState(UnitState _state) {
state = _state;
}
void Unit::load(dbload_unit* unit) {
Physical::load(unit);
state = UnitState(unit->state); //TODO nie wiem czy nie przepisaæpoprzez przejscie?
velocity = {unit->vel_x, unit->vel_z};
}
char Unit::getLevelNum() {
return dbLevel->level;
}
unsigned short Unit::getMaxHpBarSize() const {
return 0.4f;
}
float Unit::getAttackVal(Physical* aim) {
if (aim->getType() == ObjectType::BUILDING) {
return dbLevel->attack * (1.f + dbLevel->bonusBuilding);
}
if (aim->getType() == ObjectType::UNIT) {
return dbLevel->attack * (1.f + ((Unit*)aim)->getDbUnit()->getBonuses(dbLevel));
}
return dbLevel->attack;
}
void Unit::setFormation(short _formation) {
formation = _formation;
}
void Unit::resetFormation() {
formation = -1;
posInFormation = -1;
}
void Unit::setPositionInFormation(short _pos) {
posInFormation = _pos;
}
void Unit::clearAims() {
aims.clear();
}
void Unit::setNextState(UnitState stateTo, const ActionParameter& actionParameter) {
const bool mayHaveAim = nextState == UnitState::GO || nextState == UnitState::CHARGE || nextState ==
UnitState::FOLLOW;
nextActionParameter.reset(actionParameter, mayHaveAim);
nextState = stateTo;
stateChangePending = true;
}
void Unit::setNextState(UnitState stateTo) {
setNextState(stateTo, Consts::EMPTY_ACTION_PARAMETER);
}
ActionParameter& Unit::getNextActionParameter() {
return nextActionParameter;
}
bool Unit::hasStateChangePending() const {
return stateChangePending;
}
std::string Unit::getValues(int precision) {
const int position_x = position.x_ * precision;
const int position_z = position.z_ * precision;
const int state = static_cast<int>(this->state);
const int velocity_x = velocity.x_ * precision;
const int velocity_z = velocity.y_ * precision;
return Physical::getValues(precision)
+ std::to_string(position_x) + "," +
std::to_string(position_z) + "," +
std::to_string(state) + "," +
std::to_string(velocity_x) + "," +
std::to_string(velocity_z);
}
void Unit::applyForce(float timeStep) {
velocity *= 0.5f; //TODO to dac jaki wspolczynnik tarcia terenu
velocity += acceleration * (timeStep * dbLevel->invMass);
const float velLength = velocity.LengthSquared();
if (velLength < dbLevel->sqMinSpeed) {
if (state == UnitState::MOVE) {
StateManager::changeState(this, UnitState::STOP);
}
} else {
if (velLength > maxSpeed * maxSpeed) {
velocity.Normalize();
velocity *= maxSpeed;
}
if (state == UnitState::STOP) {
StateManager::changeState(this, UnitState::MOVE);
}
}
}
float Unit::getAttackRange() const {
return dbLevel->attackRange;
}
float Unit::getMinimalDistance() const {
return dbLevel->minDist;
}
float Unit::getMaxSeparationDistance() const {
return dbLevel->maxSep;
}
UnitState Unit::getActionState() const {
return dbUnit->actionState;
}
bool Unit::isIndexSlotOccupied(int indexToInteract) {
const unsigned char index = Game::getEnvironment()->getRevertCloseIndex(getMainGridIndex(), indexToInteract);
return ifSlotIsOccupied(index);
}
bool Unit::isFirstThingAlive() const {
return thingToInteract != nullptr
&& thingToInteract->isUsable();
}
void Unit::clean() {
if (notAlive(thingToInteract)) {
thingToInteract = nullptr;
}
}
float Unit::getSightRadius() const {
return dbLevel->sightRadius;
}
Urho3D::Vector2 Unit::getSocketPos(Unit* toFollow, int i) const {
//TODO bug co to za dziwna funkcja
const auto vector = Consts::circleCords[i] * (dbLevel->minDist + toFollow->getMinimalDistance()) * 2;
return {toFollow->getPosition().x_ + vector.x_, toFollow->getPosition().z_ + vector.y_};
}
short Unit::getCostSum() const {
return dbUnit->getSumCost();
}
bool Unit::isInCloseRange(int index) const {
return Game::getEnvironment()->isInLocalArea(getMainGridIndex(), index);
}
std::optional<std::tuple<Urho3D::Vector2, float>> Unit::getPosToUseWithDist(Unit* user) {
float minDistance = 99999;
Urho3D::Vector2 closest;
int closestIndex = -1;
const int mainIndex = getMainGridIndex();
const std::vector<unsigned char>& closeTabIndexes = Game::getEnvironment()->getCloseTabIndexes(mainIndex);
const std::vector<short>& closeIndexes = Game::getEnvironment()->getCloseIndexs(mainIndex);
for (auto i : closeTabIndexes) {
if (!ifSlotIsOccupied(i)) {
//TODO1
int index = mainIndex + closeIndexes[i];
if (Game::getEnvironment()->cellIsPassable(index)) {
//TODO2 to chyba sprawdza to samo prawie?
Urho3D::Vector2 posToFollow = getSocketPos(this, i);
if (index == user->getMainGridIndex()) {
return {{posToFollow, 0}};
}
setClosest(minDistance, closest, closestIndex, index, posToFollow, user->getPosition());
}
}
}
if (closestIndex >= 0) {
return {{closest, minDistance}};
}
return {};
}
std::vector<int> Unit::getIndexesForUse(Unit* user) const {
std::vector<int> indexes;
if (belowCloseLimit() <= 0) { return indexes; }
const int mainIndex = getMainGridIndex();
const std::vector<unsigned char>& closeTabIndexes = Game::getEnvironment()->getCloseTabIndexes(mainIndex);
const std::vector<short>& closeIndexes = Game::getEnvironment()->getCloseIndexs(mainIndex);
for (auto i : closeTabIndexes) {
if (!ifSlotIsOccupied(i)) {
int index = mainIndex + closeIndexes[i];
if (Game::getEnvironment()->cellIsPassable(index)) {
indexes.push_back(index);
}
}
}
return indexes;
}
std::vector<int> Unit::getIndexesForRangeUse(Unit* user) const {
std::vector<int> indexes;
if (belowRangeLimit() <= 0) { return indexes; }
const std::vector<int> allIndexes = Game::getEnvironment()->getIndexesInRange(
getPosition(), user->getLevel()->attackRange);
const int mainIndex = getMainGridIndex();
const std::vector<short>& closeIndexes = Game::getEnvironment()->getCloseIndexs(mainIndex);
for (auto index : allIndexes) {
if (Game::getEnvironment()->cellIsAttackable(index)
&& mainIndex != index
&& std::ranges::find(closeIndexes, index - mainIndex) == closeIndexes.end()) {
//czy to ok?
indexes.push_back(index);
}
}
return indexes;
}
void Unit::setOccupiedIndexSlot(char index, bool value) {
assert(index < 8);
assert(index >= 0);
if (value) {
useSockets |= Flags::bitFlags[index];
} else {
useSockets &= ~Flags::bitFlags[index];
}
}
bool Unit::ifSlotIsOccupied(char index) const {
assert(index < 8);
assert(index >= 0);
return useSockets & Flags::bitFlags[index];
}
```
PhysicalUtils.h
```#pragma once
#include "Physical.h"
#include "database/db_strcut.h"
#include "unit/Unit.h"
#include "unit/state/StateManager.h"
inline bool alwaysFalse(Physical* physical) {
return false;
}
inline bool belowClose(Physical* physical) {
return physical->belowCloseLimit();
}
inline bool belowRange(Physical* physical) {
return physical->belowRangeLimit();
}
inline bool belowCloseOrRange(Physical* physical) {
return physical->belowRangeLimit() || physical->belowCloseLimit();
}
inline bool isFree(Unit* unit) {
return unit->getFormation() < 0 && isInFreeState(unit->getState()) && !unit->hasAim();
}
inline bool isFreeWorker(Unit* unit) {
return unit->getDbUnit()->typeWorker && isFree(unit);
}
inline bool isFreeSolider(Unit* unit) {
return !unit->getDbUnit()->typeWorker && isFree(unit);
}
inline float getCircleSize(const db_building* dbBuilding, const db_building_level * level) {
if (dbBuilding->typeDefence) {
return level->attackRange;
}
if (dbBuilding->typeResourceFood || dbBuilding->typeResourceWood
|| dbBuilding->typeResourceStone || dbBuilding->typeResourceGold) {
return level->resourceRange;
}
return level->sightRadius;
}
```
LevelCache.h
```#pragma once
#include <vector>
#include "env/GridCalculator.h"
struct GridCalculator;
constexpr char RES_SEP_DIST = 120;
class LevelCache {
public:
explicit LevelCache(float maxDistance, bool initCords, GridCalculator* calculator);
~LevelCache();
unsigned short getResolution() const { return calculator->getResolution(); }
float getMaxDistance() const { return maxDistance; }
std::vector<short>* get(float radius) const;
std::vector<Urho3D::IntVector2>* getCords(float radius) const;
std::pair<std::vector<short>*, std::vector<Urho3D::IntVector2>*> getBoth(float radius) const;
void initCordsFn();
private:
std::vector<short>* getEnvIndexs(float radius, std::vector<short>* prev, std::vector<short>& temp) const;
float maxDistance;
float invDiff;
GridCalculator* calculator;
std::vector<short>* levelsCache[RES_SEP_DIST];
std::vector<Urho3D::IntVector2>* levelsCacheCords[RES_SEP_DIST];
};
```
StateUtils.h
```#pragma once
#include "Game.h"
#include "objects/unit/Unit.h"
#include "env/Environment.h"
inline void setStartData(Unit* unit, int index, Physical* toUse) {
unit->setThingToInteract(toUse);
unit->setIndexToInteract(index);
toUse->upClose();
}
inline void setSlotData(Unit* unit, int index, Physical* toUse) {
const char slot = Game::getEnvironment()->getRevertCloseIndex(toUse->getMainGridIndex(), index);
unit->setSlotToInteract(slot);
toUse->setOccupiedIndexSlot(slot, true);
}
```
SimpleQueueManager.h
```#pragma once
#include "AbstractQueueManager.h"
class QueueElement;
class SimpleQueueManager : public AbstractQueueManager {
public:
SimpleQueueManager() = default;
~SimpleQueueManager() override;
void add(short number, QueueActionType type, short id, unsigned short localMaxCapacity) override;
QueueElement* update() override;
short getSize() const override;
QueueElement* getAt(short i) override;
private:
QueueElement* element = nullptr;
};
```
LeftMenuModes.h
```#pragma once
enum class LeftMenuMode : char {
BUILDING=0,
UNIT,
ORDER,
RESOURCE
};
enum class LeftMenuSubMode : char {
BASIC=0,
LEVEL,
UPGRADE
};
```
DebugPanel.cpp
```#include "DebugPanel.h"
#include "hud/UiUtils.h"
#include <Urho3D/UI/Window.h>
DebugPanel::DebugPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : SimplePanel(root, _style, "MyDebugHudWindow",
{GameState::RUNNING, GameState::PAUSE}) {
}
void DebugPanel::setText(unsigned int seconds, float avgLow, float avgMiddle,
float avgHighest, const Urho3D::String& camInfo) {
msg.Clear();
msg .Append("FPS: ")
.Append(Urho3D::String(avgLow)).Append("|")
.Append(Urho3D::String(avgMiddle)).Append("|")
.Append(Urho3D::String(avgHighest)).Append("|")
.Append("\nTime: ").Append(Urho3D::String(seconds / 60)).Append(":").Append(Urho3D::String(seconds % 60))
.Append("\nCamera: \n\t").Append(camInfo);
fpsText->SetText(msg);
}
void DebugPanel::createBody() {
fpsText = addChildText(window, "MyText", style);
}
```
AFUtil.h
```#pragma once
#include <cstdlib>
inline float sigm(float x) {
return 1 / (1 + exp(-x));
}
inline float tanh1(float x) {
return tanh(x);
}
inline float fsigm(float x) {
return x / (1 + abs(x));
}
```
TopCameraBehave.h
```#pragma once
#include "CameraBehave.h"
class TopCameraBehave : public CameraBehave {
public:
TopCameraBehave();
~TopCameraBehave() override = default;
bool translate(bool cameraKeys[], int wheel, float timeStep, float min) override;
Urho3D::MouseMode getMouseMode() override;
private:
float orthoSize = 100;
};
```
SettingsForm.h
```#pragma once
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/UIElement.h>
struct SettingsForm {
SettingsForm() = default;
SettingsForm(const SettingsForm&) = delete;
int resolution;
int maxFps;
int minFps;
int textureQuality;
int hudSize;
bool fullScreen;
bool vSync;
bool shadow;
static SettingsForm* getFromElement(Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
return static_cast<SettingsForm *>(element->GetVar("SettingsForm").GetVoidPtr());
}
};
```
SceneSaver.h
```#pragma once
#include <vector>
#include "Loading.h"
namespace Urho3D {
class String;
}
class sqlite3;
class Unit;
class ResourceEntity;
class Building;
class Player;
class SceneSaver {
public:
explicit SceneSaver(int precision);
~SceneSaver() = default;
void createTables() const;
void createDatabase(const Urho3D::String& fileName);
void createSave(const Urho3D::String& fileName);
void saveUnits(std::vector<Unit*>* units);
void saveBuildings(std::vector<Building*>* buildings);
void saveResourceEntities(std::vector<ResourceEntity*>* resources);
void savePlayers(std::vector<Player*>& players);
void saveResources(const std::vector<Player*>& players);
void saveConfig(int mapId, int size);
void close();
private:
void executeInsert(std::string& sql) const;
void createUnitsTable() const;
void createTable(const std::string& sql) const;
void createBuildingsTable() const;
void createResourceEntitiesTable() const;
void createPlayerTable() const;
void createConfigTable() const;
void createResourceTable() const;
sqlite3* database;
int precision;
Loading loadingState;
};
```
NodeUtils.h
```#pragma once
#include "Game.h"
#include <Urho3D/Graphics/StaticModel.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/Resource/XMLFile.h>
#include <Urho3D/Scene/Scene.h>
#include <Urho3D/Graphics/Material.h>
#include "Physical.h"
inline Urho3D::Node* createNode(const Urho3D::String& name) {
const auto node = Game::getScene()->CreateChild();
node->LoadXML(Game::getCache()->GetResource<Urho3D::XMLFile>(name)->GetRoot());
return node;
}
inline void changeMaterial(Urho3D::Material* newMaterial, Urho3D::StaticModel* model) {
if (model && newMaterial && newMaterial != model->GetMaterial(0)) {
model->SetMaterial(newMaterial);
}
}
inline void changeMaterial(const Urho3D::String& name, Urho3D::StaticModel* model) {
changeMaterial(Game::getCache()->GetResource<Urho3D::Material>(name), model);
}
inline void setShaderParam(Urho3D::Node * node, const Urho3D::String& name, const Urho3D::Variant& value) {
if (node) {
const auto comp = node->GetComponent<Urho3D::StaticModel>();
if (comp) {
for (int i = 0; i < comp->GetNumGeometries(); ++i) {
comp->GetMaterial(i)->SetShaderParameter(name, value);
}
}
}
}
inline void setShaderParam(Physical* phy, const Urho3D::String& name, const Urho3D::Variant& value) {
phy->ensureMaterialCloned();
setShaderParam(phy->getNode(), name, value);
}
```
SceneSaver.cpp
```#include "SceneSaver.h"
#include "SQLConsts.h"
#include "database/db_utils.h"
#include "objects/building/Building.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/unit/Unit.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
SceneSaver::SceneSaver(int precision): loadingState(7), precision(precision) {
//TODO zapisywanie powinno byc tylko miedzy klatkami
}
void SceneSaver::createUnitsTable() const {
const std::string sql = "units(" + SQLConsts::UNIT_COL + ");";
createTable(sql);
}
void SceneSaver::createTable(const std::string& sql) const {
const char* charSql = (SQLConsts::CREATE_TABLE + sql).c_str();
char* error;
const int rc = sqlite3_exec(database, charSql, nullptr, nullptr, &error);
ifError(rc, error, sql);
}
void SceneSaver::createBuildingsTable() const {
const std::string sql = "buildings(" + SQLConsts::BUILDING_COL + ");";
createTable(sql);
}
void SceneSaver::createResourceEntitiesTable() const {
const std::string sql = "resource_entities(" + SQLConsts::RESOURCE_COL + ");";
createTable(sql);
}
void SceneSaver::createPlayerTable() const {
const std::string sql = "players(" + SQLConsts::PLAYER_COL + ");";
createTable(sql);
}
void SceneSaver::createConfigTable() const {
const std::string sql = "config(" + SQLConsts::CONFIG_COL + ");";
createTable(sql);
}
void SceneSaver::createResourceTable() const {
const std::string sql = "resources(" + SQLConsts::PLAYER_RESOURCES_COL + ");";
createTable(sql);
}
void SceneSaver::createTables() const {
createUnitsTable();
createBuildingsTable();
createResourceEntitiesTable();
createPlayerTable();
createConfigTable();
createResourceTable();
}
void SceneSaver::createDatabase(const Urho3D::String& fileName) {
database = nullptr;
std::string name = std::string("saves/") + fileName.CString() + ".db";
const int rc = sqlite3_open(name.c_str(), &database);
if (rc) {
std::cerr << "Error opening SQLite3 database: " << sqlite3_errmsg(database) << std::endl << std::endl;
sqlite3_close_v2(database);
}
}
void SceneSaver::createSave(const Urho3D::String& fileName) {
loadingState.reset("create database");
createDatabase(fileName);
loadingState.inc("create Tables");
createTables();
}
void SceneSaver::executeInsert(std::string& sql) const {
sql[sql.size() - 1] = ';';
sqlite3_stmt* stmt;
const int rc = sqlite3_prepare(database, sql.c_str(), -1, &stmt, NULL);
ifError(rc, NULL, sql);
const int rc1 = sqlite3_step(stmt);
ifError(rc1, NULL, sql);
const int rc2 = sqlite3_finalize(stmt);
ifError(rc2, NULL, sql);
}
void SceneSaver::saveUnits(std::vector<Unit*>* units) {
loadingState.inc("saving units");
if (units->empty()) { return; }
std::string sql = "INSERT INTO units VALUES ";
for (auto unit : *units) {
sql += " (" + unit->getValues(precision) + "),";
}
executeInsert(sql);
}
void SceneSaver::saveBuildings(std::vector<Building*>* buildings) {
loadingState.inc("saving buildings");
if (buildings->empty()) { return; }
std::string sql = "INSERT INTO buildings VALUES ";
for (auto building : *buildings) {
sql += " (" + building->getValues(precision) + "),";
}
executeInsert(sql);
}
void SceneSaver::saveResourceEntities(std::vector<ResourceEntity*>* resources) {
loadingState.inc("saving resource_entities");
if (resources->empty()) { return; }
std::string sql = "INSERT INTO resource_entities VALUES ";
for (auto resourceEntity : *resources) {
sql += " (" + resourceEntity->getValues(precision) + "),";
}
executeInsert(sql);
}
void SceneSaver::savePlayers(std::vector<Player*>& players) {
loadingState.inc("saving players");
if (players.empty()) { return; }
std::string sql = "INSERT INTO players VALUES ";
for (auto player : players) {
sql += " (" + player->getValues(precision) + "),";
}
executeInsert(sql);
}
void SceneSaver::saveResources(const std::vector<Player*>& players) {
loadingState.inc("saving resources");
if (players.empty()) { return; }
std::string sql = "INSERT INTO resources VALUES ";
for (auto player : players) {
Resources& resources = player->getResources();
sql += resources.getValues(precision, player->getId());
}
executeInsert(sql);
}
void SceneSaver::saveConfig(int mapId, int size) {
loadingState.inc("saving config");
std::string sql = "INSERT INTO config VALUES (";
sql += std::to_string(precision) + "," + std::to_string(mapId) + "," + std::to_string(size) + "),";
executeInsert(sql);
}
void SceneSaver::close() {
sqlite3_close_v2(database);
loadingState.inc("");
}
```
FormationType.h
```#pragma once
enum class FormationType : char
{
NONE=0,
SQUERE
};
```
SelectedInfo.h
```#pragma once
#include <optional>
#include <vector>
class Physical;
enum class ObjectType : char;
class SelectedInfoType;
class SelectedInfo {
public:
SelectedInfo();
~SelectedInfo();
void setAllNumber(int allNumber);
void setSelectedType(ObjectType selectedType);
void reset();
void select(Physical* entity);
void hasBeenUpdatedDrawn();
std::optional<SelectedInfoType*> getOneSelectedTypeInfo() const;
std::vector<SelectedInfoType*>& getSelectedTypes() { return selectedByType; }
ObjectType getSelectedType() const { return selectedType; }
char getSelectedSubTypeNumber() const { return allSubTypeNumber; }
int getAllNumber() const { return allNumber; }
bool hasChanged() const { return changed; }
bool isSthSelected() const;
void refresh(const std::vector<Physical*>& selected);
private:
std::vector<SelectedInfoType*> selectedByType;
int allNumber;
bool changed = true;
char allSubTypeNumber;
ObjectType selectedType;
};
```
GeneralActionType.h
```#pragma once
enum class GeneralActionType : char {
BUILDING_LEVEL=0
};
```
ProjectileManager.cpp
```#include "ProjectileManager.h"
#include "ProjectileWithNode.h"
#include "simulation/SimGlobals.h"
#include "objects/NodeUtils.h"
#include "utils/DeleteUtils.h"
ProjectileManager* ProjectileManager::instance = nullptr;
constexpr int MAX_PROJECTILE_NODES = 100;
void ProjectileManager::update(float timeStep) {
for (const auto projectile : instance->projectiles) {
projectile->update(timeStep);
//TODO perf free pool
}
}
void ProjectileManager::shoot(Physical* shooter, Physical* aim, float speed, char player) {
findNext()->init(shooter, aim, speed, player);
}
ProjectileBase* ProjectileManager::findNext() {
for (const auto projectile : instance->projectiles) {
if (!projectile->isActive()) {
return projectile;
}
}
ProjectileBase* projectile;
if (instance->projectiles.size() < MAX_PROJECTILE_NODES && !SIM_GLOBALS.HEADLESS) {
projectile = new ProjectileWithNode(createNode("Objects/projectiles/arrow.xml"));
} else {
projectile = new ProjectileBase();
}
instance->projectiles.push_back(projectile);
return projectile;
}
void ProjectileManager::init() {
if (instance == nullptr) {
instance = new ProjectileManager();
}
}
void ProjectileManager::dispose() {
delete instance;
instance = nullptr;
}
void ProjectileManager::reset() {
for (auto projectile : instance->projectiles) {
projectile->reset();
}
}
ProjectileManager::~ProjectileManager() {
clear_vector(projectiles);
}
```
InfluenceDataType.h
```#pragma once
enum class InfluenceDataType : char {
NONE = 0,
UNITS_NUMBER_PER_PLAYER,
UNITS_INFLUENCE_PER_PLAYER,
BUILDING_INFLUENCE_PER_PLAYER,
RESOURCE_INFLUENCE,
FOOD_SPEED,
WOOD_SPEED,
STONE_SPEED,
GOLD_SPEED,
ATTACK_SPEED,
ECON_QUAD,
BUILDINGS_QUAD,
UNITS_QUAD,
VISIBILITY
};
```
SelectedInfoType.cpp
```#include "SelectedInfoType.h"
#include "objects/Physical.h"
SelectedInfoType::SelectedInfoType(unsigned short id):id(id) {
data.reserve(10);
}
void SelectedInfoType::clear() {
data.clear();
}
void SelectedInfoType::add(Physical* physical) {
assert(physical->getId() == id);
data.push_back(physical);
}
```
GameState.h
```#pragma once
enum class GameState : char {
STARTING=0,
NEW_GAME,
LOADING,
MENU_MAIN,
RUNNING,
PAUSE,
CLOSING
};
```
AbstractMiddlePanel.h
```#pragma once
#include "hud/window/EventPanel.h"
namespace Urho3D {
class UIElement;
class Text;
class Button;
}
constexpr char MIDDLE_LIST_ROW_NUMBER = 3;
class AbstractMiddlePanel : public EventPanel {
public:
AbstractMiddlePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
virtual ~AbstractMiddlePanel();
void createBody() override;
void HandleClose(Urho3D::StringHash, Urho3D::VariantMap& eventData);
virtual Urho3D::Button* getMainButton();
protected:
Urho3D::UIElement* body;
private:
Urho3D::Button* buttonClose;
Urho3D::Text* title;
Urho3D::String msg;
};
```
DebugUnitType.h
```#pragma once
enum class DebugUnitType : char {
NONE=0,
VELOCITY,
ACCELERATION,
SEPARATION_UNITS,
SEPARATION_OBSTACLE,
DESTINATION,
FORMATION,
ESCAPE,
ALL_FORCE,
AIM,
INTERACT
};
```
MainMenuPanel.cpp
```#include "MainMenuPanel.h"
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/UI.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "GameState.h"
#include "close//MainMenuClosePanel.h"
#include "help/MainMenuHelpPanel.h"
#include "hud/UiUtils.h"
#include "load/MainMenuLoadPanel.h"
#include "new_game/MainMenuNewGamePanel.h"
#include "settings/MainMenuSettingsPanel.h"
MainMenuPanel::MainMenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style): EventPanel(root, _style, "MainMenuWindow",
{GameState::MENU_MAIN}) {}
MainMenuPanel::~MainMenuPanel() {
clear_array(detailsPanels,MAIN_MENU_BUTTON_NUMBER);
}
void MainMenuPanel::action(short id) const {
close();
detailsPanels[id]->setVisible(true);
}
void MainMenuPanel::close() const {
for (auto detailsPanel : detailsPanels) {
detailsPanel->setVisible(false);
}
}
void MainMenuPanel::setVisible(bool enable) {
SimplePanel::setVisible(enable);
close();
background->SetVisible(enable);
}
Urho3D::Button* MainMenuPanel::getNewGameProceed() const {
return dynamic_cast<MainMenuNewGamePanel*>(detailsPanels[0])->getProceed();
}
Urho3D::Button* MainMenuPanel::getLoadButton() const {
return dynamic_cast<MainMenuLoadPanel*>(detailsPanels[1])->getLoadButton();
}
Urho3D::Button* MainMenuPanel::getCloseButton() const {
return dynamic_cast<MainMenuClosePanel*>(detailsPanels[4])->getCloseButton();
}
void MainMenuPanel::HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
int id = element->GetVar("Num").GetInt();
action(id);
}
void MainMenuPanel::createBody() {
background = createElement<Urho3D::BorderImage>(Game::getUI()->GetRoot(), style, "MainMenuBackground");
background->SetBringToBack(true);
background->SetPriority(-1);
window->SetPriority(1);
auto l10n = Game::getLocalization();
detailsPanels[0] = new MainMenuNewGamePanel(root, style, l10n->Get("menu_0"));
detailsPanels[1] = new MainMenuLoadPanel(root, style, l10n->Get("menu_1"));
detailsPanels[2] = new MainMenuSettingsPanel(root, style, l10n->Get("menu_2"));
detailsPanels[3] = new MainMenuHelpPanel(root, style, l10n->Get("menu_3"));
detailsPanels[4] = new MainMenuClosePanel(root, style, l10n->Get("menu_4"));
for (auto detailsPanel : detailsPanels) {
detailsPanel->createWindow();
detailsPanel->setVisible(false);
}
for (int i = 0; i < MAIN_MENU_BUTTON_NUMBER; ++i) {
auto texture2 = Game::getCache()->GetResource<Urho3D::Texture2D
>("textures/hud/icon/menu/menu_" + Urho3D::String(i) + ".png");
auto button = createElement<Urho3D::Button>(window, style, "MainMenuButton");
createSprite(button, texture2, style, "MainMenuSprite");
addChildText(button, "MainMenuText", l10n->Get("menu_" + Urho3D::String(i)), style);
button->SetVar("Num", i);
SubscribeToEvent(button, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuPanel, HandleButtonClick));
}
}
```
StaticState.h
```#pragma once
enum class StaticState : char {
ALIVE=0,
FREE,
DEAD,
DISPOSE
};
```
HealthBarProvider.cpp
```#include "HealthBarProvider.h"
#include <Urho3D/UI/ProgressBar.h>
#include <Urho3D/UI/UI.h>
#include "Game.h"
#include "database/DatabaseCache.h"
#include "hud/UiUtils.h"
#include "objects/ObjectEnums.h"
#include "player/Player.h"
constexpr int PLAYER_SIZE = 5000;
constexpr int RESOURCE_SIZE = 1000;
HealthBarProvider::~HealthBarProvider() {
delete[]playerBars;
delete[]resourceBars;
//TODO bug a kiedy sie pozbywam UI?
}
void HealthBarProvider::init() {
root = Game::getUI()->GetRoot()->CreateChild<Urho3D::UIElement>();
resourceBars = createSet(RESOURCE_SIZE);
playerBars = createSet(PLAYER_SIZE);
}
Urho3D::ProgressBar** HealthBarProvider::createSet(int size) const {
auto data = new Urho3D::ProgressBar*[size];
std::fill_n(data, size, nullptr);
return data;
}
void HealthBarProvider::reset(int size, ObjectType type) {
for (int i = type == ObjectType::BUILDING || type == ObjectType::UNIT ? size : 0; i < Urho3D::Min(
playerIdx, PLAYER_SIZE); ++i) {
hide(playerBars[i]);
}
for (int i = type == ObjectType::RESOURCE ? size : 0; i < Urho3D::Min(resIdx, RESOURCE_SIZE); ++i) {
hide(resourceBars[i]);
}
resIdx = 0;
playerIdx = 0;
}
void HealthBarProvider::hide(Urho3D::ProgressBar* bar) {
bar->SetEnabled(false);
bar->SetVisible(false);
}
Urho3D::ProgressBar* HealthBarProvider::createNew(const Urho3D::String& style) {
Urho3D::ProgressBar* nowy = createElement<Urho3D::ProgressBar>(root, root->GetDefaultStyle(), style);
hide(nowy);
return nowy;
}
Urho3D::ProgressBar* HealthBarProvider::getNext(ObjectType type) {
Urho3D::ProgressBar* toReturn = nullptr;
switch (type) {
case ObjectType::UNIT:
case ObjectType::BUILDING:
if (playerIdx < PLAYER_SIZE) {
if (!playerBars[playerIdx]) {
playerBars[playerIdx] = createNew("HealthBar");
}
toReturn = playerBars[playerIdx];
}
++playerIdx;
break;
case ObjectType::RESOURCE:
if (resIdx < RESOURCE_SIZE) {
if (!resourceBars[resIdx]) {
resourceBars[resIdx] = createNew("ResHealthBar");
}
toReturn = resourceBars[resIdx];
}
++resIdx;
}
return toReturn;
}
```
CenterType.h
```#pragma once
enum class CenterType:char {
ECON=0,
BUILDING,
ARMY
};
```
replace_utils.h
```#pragma once
#include <regex>
#include <string>
namespace std {
template <class BidirIt, class Traits, class CharT>
std::basic_string<CharT> regex_replace(BidirIt first, BidirIt last,
const std::basic_regex<CharT, Traits>& re, vector<int>& values) {
std::basic_string<CharT> s;
typename std::match_results<BidirIt>::difference_type
positionOfLastMatch = 0;
auto endOfLastMatch = first;
int i = 0;
auto callback = [&](const std::match_results<BidirIt>& match)
{
auto positionOfThisMatch = match.position(0);
auto diff = positionOfThisMatch - positionOfLastMatch;
auto startOfThisMatch = endOfLastMatch;
std::advance(startOfThisMatch, diff);
s.append(endOfLastMatch, startOfThisMatch);
s.append(std::to_string(values[i++]));
auto lengthOfMatch = match.length(0);
positionOfLastMatch = positionOfThisMatch + lengthOfMatch;
endOfLastMatch = startOfThisMatch;
std::advance(endOfLastMatch, lengthOfMatch);
};
std::regex_iterator<BidirIt> begin(first, last, re), end;
std::for_each(begin, end, callback);
s.append(endOfLastMatch, last);
return s;
}
template <class Traits, class CharT>
std::string regex_replace(const std::string& s,
const basic_regex<CharT, Traits>& re, vector<int>& values) {
return regex_replace(s.cbegin(), s.cend(), re, values);
}
}
```
CellState.h
```#pragma once
enum class CellState : char {
NONE=0,
ATTACK,
COLLECT,
DEPLOY,
RESOURCE,
BUILDING
};
```
AiUtils.h
```#pragma once
#include "math/RandGen.h"
#include "math/VectorUtils.h"
#include "ActionMakerLogger.h"
inline bool randFromTwo(float val) {
return val + 1.f > RandGen::nextRand(RandFloatType::AI, 2.f);
}
inline int biggestWithRand(std::span<float> vals) {
assert(validateSpan(__LINE__, __FILE__, vals));
assert(!vals.empty());
for (float& val : vals) {
if (val < 0) {
val = 0.f;
}
}
assert(allPositive(__LINE__, __FILE__, vals));
const float max = std::accumulate(vals.begin(), vals.end(), 0.f);
if (max <= 0) { return 0; }
const float rand = RandGen::nextRand(RandFloatType::AI, max);
float sum = 0.f;
for (int i = 0; i < vals.size(); ++i) {
sum += vals[i];
if (rand < sum) {
return i;
}
}
}
inline int lowestWithRand(std::span<float> diffs) {
assert(allPositive(__LINE__, __FILE__, diffs));
const float sum = std::accumulate(diffs.begin(), diffs.end(), 0.f);
for (float& val : diffs) {
val = sum - val;
}
return biggestWithRand(diffs);
}
```
FormationState.h
```#pragma once
enum class FormationState : char
{
FORMING=0,
MOVING,
REACHED,
EMPTY
};
```
UpgradeCommand.cpp
```#include "UpgradeCommand.h"
#include "Game.h"
#include "objects/building/Building.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "simulation/SimulationObjectManager.h"
#include "objects/queue/QueueActionType.h"
UpgradeCommand::UpgradeCommand(char player, int id, QueueActionType type): AbstractCommand(player), type(type), id(id) {
}
void UpgradeCommand::execute() {
char level = Game::getPlayersMan()->getPlayer(player)->upgradeLevel(type, id);
if (type == QueueActionType::BUILDING_LEVEL && level > 0) {
for (auto building : *simulationObjectManager->getBuildings()) {
if (building->getPlayer() == player && building->getId() == id) {
building->levelUp(level);
}
}
}
}
void UpgradeCommand::setSimulationObjectManager(SimulationObjectManager* _simulationObjectManager) {
simulationObjectManager = _simulationObjectManager;
}
```
ProjectileBase.h
```#pragma once
#include "database/db_strcut.h"
#include "objects/Physical.h"
#include "math/MathUtils.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "env/Environment.h"
#include "Game.h"
struct ProjectileBase {
Physical* aim;
float percentToGo;
float speed;
float attackVal;
char player;
bool active = false;
ProjectileBase() = default;
ProjectileBase(const ProjectileBase&) = delete;
virtual void init(Physical* shooter, Physical* aim, float speed, char player) {
this->aim = aim;
this->player = player;
this->attackVal = shooter->getAttackVal(aim);
const auto start = shooter->getPosition();
const auto end = aim->getPosition();
this->speed = speed / sqrt(sqDistAs2D(start, end));
percentToGo = 1.f;
active = true;
}
virtual bool update(float timeStep) {
if (aim && !aim->isAlive()) {
aim = nullptr;
}
percentToGo -= speed * timeStep;
if (percentToGo <= 0.f && active) {
if (aim && aim->isAlive()) {
const auto [value, died] = aim->absorbAttack(attackVal);
Game::getEnvironment()->addAttack(player, aim->getPosition(), value);
if (died) {
Game::getPlayersMan()->getPlayer(player)->addKilled(aim);
}
}
reset();
return true;
}
return false;
}
virtual void reset() {
aim = nullptr;
active = false;
}
bool isActive() const {
return active;
}
};
```
Static.h
```#pragma once
#include <unordered_set>
#include "../Physical.h"
#include "StaticState.h"
#include "env/influence/map/VisibilityType.h"
struct dbload_static;
enum class CellState : char;
class Static : public Physical {
public:
Static(Urho3D::Vector3& _position, int indexInGrid, bool withNode);
virtual ~Static();
void setNextState(StaticState stateTo) { nextState = stateTo; }
void setState(StaticState state) { this->state = state; }
void load(dbload_static* dbloadStatic);
int belowCloseLimit() const override;
int hasFreeSpace() const;
bool hasAnyFreeSpace() const;
virtual bool canUse(int index) const =0;
bool indexChanged() const override { return false; }
StaticState getNextState() const { return nextState; }
StaticState getState() const { return state; }
bool isUsable() const override { return state == StaticState::ALIVE; }
bool isAlive() const override { return state == StaticState::ALIVE || state == StaticState::FREE; }
bool isToDispose() const override { return state == StaticState::DISPOSE; }
virtual const Urho3D::IntVector2 getGridSize() const =0;
// const std::span<int>& getOccupiedCells() const { return occupiedCells; }
// const std::span<int>& getSurroundCells() const { return surroundCells; }
const std::span<int> getOccupiedCells() const { return std::span{data, occupiedCellsSize}; }
const std::span<int> getSurroundCells() const { return std::span{data + occupiedCellsSize, surroundCellsSize}; }
std::optional<std::tuple<Urho3D::Vector2, float>> getPosToUseWithDist(Unit* user) override;
std::vector<int> getIndexesForUse(Unit* user) const override;
std::vector<int> getIndexesForRangeUse(Unit* user) const override;
std::string getValues(int precision) override;
unsigned short getIndexInInfluence() const { return indexInInfluence; }
void setIndexInInfluence(int index);
bool isInCloseRange(int index) const override;
Urho3D::Color getColor(db_player_colors* col) const override;
void setVisibility(VisibilityType type) override;
unsigned char getHealthBarThick() const override { return 6; }
protected:
void populate() override;
unsigned short indexInInfluence;
StaticState state, nextState;
unsigned char occupiedCellsSize = 0;
unsigned char surroundCellsSize = 0;
VisibilityType visibilityType = VisibilityType::VISIBLE;
int* data{};
};
```
NamesCache.h
```#pragma once
#include "Game.h"
#include "objects/ObjectEnums.h"
#include "database/DatabaseCache.h"
#include <Urho3D/Container/Str.h>
#include "queue/QueueActionType.h"
inline Urho3D::String getIconName(ObjectType type, int i) {
auto dbCache = Game::getDatabase();
switch (type) {
case ObjectType::UNIT:
return "unit/" + dbCache->getUnit(i)->icon;
case ObjectType::BUILDING:
return "building/" + dbCache->getBuilding(i)->icon;
case ObjectType::RESOURCE:
return "resource/" + dbCache->getResource(i)->icon;
default:
return "mock.png";
}
}
inline Urho3D::String getIconName(QueueActionType type, int level, int i) {
DatabaseCache* dbCache = Game::getDatabase();
switch (type) {
case QueueActionType::UNIT_CREATE:
return "unit/" + dbCache->getUnit(i)->icon;
case QueueActionType::UNIT_LEVEL:
return "unit/levels/" + Urho3D::String(level) + "/" + dbCache->getUnit(i)->icon;
case QueueActionType::BUILDING_LEVEL:
return "building/levels/" + Urho3D::String(level) + "/" + dbCache->getBuilding(i)->icon;
case QueueActionType::BUILDING_CREATE:
return "building/" + dbCache->getBuilding(i)->icon;
default:
return "mock.png";
}
}```
Simulation.h
```#pragma once
#include "force/Force.h"
#include <vector>
#include <functional>
#include "database/db_strcut.h"
enum class UnitAction : char;
enum class UnitState : char;
enum class SimColorMode : char;
struct NewGameForm;
class Unit;
class ResourceEntity;
class Building;
class QueueElement;
class Environment;
class SceneSaver;
class SceneLoader;
class CreationCommandList;
class ObjectsInfo;
class CreationCommandList;
class SimulationObjectManager;
class UpgradeCommandList;
class CommandList;
class AiManager;
class SimInfo;
namespace Urho3D {
class Node;
class Scene;
}
class Simulation {
public:
explicit Simulation(Environment* enviroment);
~Simulation();
void clearNodesWithoutDelete();
void updateInfluenceMaps() const;
void forceUpdateInfluenceMaps() const;
SimInfo* update(float timeStep);
void initScene(SceneLoader& loader) const;
void initScene(NewGameForm* form) const;
void save(SceneSaver& saver) const;
void changeCoef(int i, int wheel);
void changeColorMode(SimColorMode _colorMode);
private:
void aiPlayers() const;
void calculateForces();
void moveUnitsAndCheck(float timeStep);
void performStateAction(float timeStep) const;
void executeStateTransition() const;
float updateTime(float timeStep) const;
void loadEntities(NewGameForm* form) const;
void loadEntities(SceneLoader& loader) const;
void countFrame();
void applyForce() const;
void levelUp(QueueElement* done, char player) const;
void updateBuildingQueues() const;
void updateQueues() const;
std::function<bool(Physical*)> getCondition(db_unit* dbUnit) const;
void selfAI() const;
void addTestEntities() const;
float accumulateTime = 0;
unsigned int secondsElapsed = 0;
unsigned char currentFrame = 0;
SimColorMode colorScheme;
bool colorSchemeChanged = true;
Force force;
std::vector<Unit*>* units;
std::vector<Building*>* buildings;
std::vector<ResourceEntity*>* resources;
SimInfo* simInfo;
Environment* enviroment;
SimulationObjectManager* simObjectManager;
AiManager* aiManager;
};
```
VisibilityType.h
```#pragma once
enum class VisibilityType : char {
NONE =0,
SEEN=1,
VISIBLE=3
};
```
PerFrameAction.h
```#pragma once
#include <array>
#include <magic_enum.hpp>
#include "FrameInfo.h"
#include "SimGlobals.h"
#include "utils/OtherUtils.h"
enum class PerFrameAction:char {
INFLUENCE_UNITS_1=0,
INFLUENCE_UNITS_2,
INFLUENCE_RESOURCES,
INFLUENCE_OTHER,
INFLUENCE_QUAD_OTHER,
SELF_AI,
AI_ACTION,
AI_ORDER,
QUEUE_HUD,
HUD_UPDATE,
VISIBILITY
};
constexpr inline struct PerFrameActionData {
private:
inline static const std::array<unsigned char, FRAMES_IN_PERIOD> ONCE_PER_SECOND = {
1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
inline static const std::array<unsigned char, FRAMES_IN_PERIOD> ONCE_PER_2_SECONDS = {
2, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
inline static const std::array<unsigned char, FRAMES_IN_PERIOD> data[magic_enum::enum_count<PerFrameAction>()] = {
{
2, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //INFLUENCE_UNITS_1
{
0, 2, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //INFLUENCE_UNITS_2
{
0, 0, 10, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //INFLUENCE_RESOURCES
{
0, 0, 0, 5, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //INFLUENCE_OTHER
{
0, 0, 0, 0, 1, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //INFLUENCE_QUAD_OTHER
{
0, 0, 0, 0, 0, 1, 0, 0, 0, 0,
0, 1, 0, 0, 0, 0, 0, 1, 0, 0,
0, 0, 0, 1, 0, 0, 0, 0, 0, 1
}, //SELF_AI
{
0, 0, 0, 0, 1, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //AI_ACTION
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 1, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}, //AI_ORDER
ONCE_PER_2_SECONDS, //QUEUE_HUD
ONCE_PER_SECOND, //HUD_UPDATE
{
0, 0, 0, 0, 0, 0, 1, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0
}
};
public:
static bool get(PerFrameAction type, unsigned char frameNum, unsigned int second = 1) {
const auto val = data[cast(type)][frameNum];
return val != 0 && second % val == 0;
}
static bool get(PerFrameAction type, const FrameInfo* frameInfo) {
const auto val = data[cast(type)][frameInfo->getCurrentFrame()];
return val != 0 && frameInfo->getSeconds() % val == 0;
}
} PER_FRAME_ACTION;
```
EnvironmentDebugMode.h
```#pragma once
enum class EnvironmentDebugMode : char {
NONE = 0,
MAIN_GRID,
INF_UNITS_NUMBER_PER_PLAYER,
INF_UNITS_INFLUENCE_PER_PLAYER,
INF_BUILDING_INFLUENCE_PER_PLAYER,
INF_RESOURCE,
INF_FOOD_SPEED,
INF_WOOD_SPEED,
INF_STONE_SPEED,
INF_GOLD_SPEED,
INF_ATTACK_SPEED,
// INF_ECON_QUAD,
// INF_BUILDINGS_QUAD,
// INF_UNITS_QUAD,
VISIBILITY,
};
```
Possession.cpp
```#include "Possession.h"
#include "Game.h"
#include "Resources.h"
#include "ai/AiMetric.h"
#include "database/DatabaseCache.h"
#include "math/SpanUtils.h"
#include "math/VectorUtils.h"
#include "objects/PhysicalUtils.h"
#include "objects/building/Building.h"
#include "objects/building/ParentBuildingType.h"
#include "simulation/ObjectsInfo.h"
Possession::Possession(char nation) {
for (auto building : Game::getDatabase()->getNation(nation)->buildings) {
auto id = building->id;
if (buildingsPerId.size() <= id) {
buildingsPerId.resize(id + 1, nullptr);
}
buildingsPerId[id] = new std::vector<Building*>();
}
int dataSize = UNIT_SIZE * 2 + BUILDING_SIZE
+ BUILDING_OTHER_SIZE + BUILDING_DEF_SIZE
+ BUILDING_TECH_SIZE
+ BUILDING_UNITS_SIZE + RESOURCES_SIZE;
data = new float[dataSize];
int begin = 0;
unitsSumAsSpan = std::span(data, UNIT_SIZE);
freeArmySumAsSpan = std::span(data + (begin += UNIT_SIZE), UNIT_SIZE);
buildingsSumAsSpan = std::span(data + (begin += UNIT_SIZE), BUILDING_SIZE);
buildingsOtherSumSpan = std::span(data + (begin += BUILDING_SIZE), BUILDING_OTHER_SIZE);
buildingsDefenceSumSpan = std::span(data + (begin += BUILDING_OTHER_SIZE), BUILDING_DEF_SIZE);
buildingsTechSumSpan = std::span(data + (begin += BUILDING_DEF_SIZE), BUILDING_TECH_SIZE);
buildingsUnitsSumSpan = std::span(data + (begin += BUILDING_TECH_SIZE), BUILDING_UNITS_SIZE);
resWithoutBonus = std::span(data + (begin += BUILDING_UNITS_SIZE), RESOURCES_SIZE);
std::fill_n(data, dataSize, 0.f);
levelsSize = Urho3D::Max(Game::getDatabase()->getUnitLevels().size(),
Game::getDatabase()->getBuildingLevels().size());
levels = new float[levelsSize];
levelsFree = new float[levelsSize];
}
Possession::~Possession() {
clear_vector(buildingsPerId);
delete[]data;
delete[]levels;
delete[]levelsFree;
}
int Possession::getScore() const {
float buildingScore = 0.f;
for (auto building : buildings) {
auto cost = building->getCostSum();
if (!building->isReady()) {
cost *= 0.5;
}
buildingScore += cost;
}
float unitsScore = 0.f;
float workerScore = 0.f;
for (auto unit : units) {
if (unit->getDbUnit()->typeWorker) {
workerScore += unit->getCostSum();
} else {
unitsScore += unit->getCostSum();
}
}
return buildingScore * 0.25f + unitsScore * 0.2f + workerScore * 0.05f + resourcesSum * 0.01f;
//return buildings.size() * 10 + units.size() + resourcesSum / 100;
}
int Possession::getUnitsNumber() const {
return units.size();
}
int Possession::getBuildingsNumber() const {
return buildings.size();
}
int Possession::getWorkersNumber() const {
return workers.size();
}
int Possession::getFreeWorkersNumber() const { return freeWorkersNumber; }
int Possession::getFreeArmyNumber() const { return freeArmyNumber; }
std::vector<Building*>* Possession::getBuildings(short id) {
return buildingsPerId[id];
}
const std::vector<Building*>& Possession::getBuildings() {
return buildings;
}
void Possession::addKilled(Physical* physical) {
resourcesDestroyed += physical->getCostSum();
}
std::span<float> Possession::refreshBuildingSum(const std::span<unsigned char> idxs, std::span<float> out) const {
assert(idxs.size() == out.size());
for (int i = 0; i < idxs.size(); ++i) {
out[i] = buildingsSumAsSpan[idxs[i]];
}
return out;
}
std::span<float> Possession::refreshResource(const std::span<unsigned char> idxs, std::span<float> out) const {
assert(idxs.size() == out.size());
for (int i = 0; i < idxs.size(); ++i) {
out[i] = buildingsSumAsSpan[idxs[i]];
}
return out;
}
std::span<float> Possession::getBuildingsMetrics(ParentBuildingType type) const {
switch (type) {
case ParentBuildingType::OTHER:
return refreshBuildingSum(METRIC_DEFINITIONS.getBuildingOtherIdxs(), buildingsOtherSumSpan);
case ParentBuildingType::DEFENCE:
return refreshBuildingSum(METRIC_DEFINITIONS.getBuildingDefenceIdxs(), buildingsDefenceSumSpan);
case ParentBuildingType::RESOURCE:
assert(false);
//return refreshResource(METRIC_DEFINITIONS.getResWithoutBonusIdxs(), buildingsResSumSpan);
case ParentBuildingType::TECH:
return refreshBuildingSum(METRIC_DEFINITIONS.getBuildingTechIdxs(), buildingsTechSumSpan);
case ParentBuildingType::UNITS:
return refreshBuildingSum(METRIC_DEFINITIONS.getBuildingUnitsIdxs(), buildingsUnitsSumSpan);
default: ;
}
}
std::vector<Unit*> Possession::getFreeArmy() {
std::vector<Unit*> army(units.size());
auto it = std::ranges::copy_if(units, army.begin(), [](Unit* unit) {
return isFreeSolider(unit);
}).out;
army.resize(std::distance(army.begin(), it));
return army;
}
bool Possession::hasAnyFreeArmy() const {
return std::ranges::any_of(units, [](Unit* unit)-> bool { return isFreeSolider(unit); });
}
float Possession::getAttackSum() const {
return unitsSumAsSpan[5];
//TODO hardcoded from AiUnitMetric {[](db_unit* u, db_unit_level* l) -> float { return l->attack; }, 10, UNITS_SUM_X},
}
float Possession::getDefenceAttackSum() {
return buildingsSumAsSpan[5];
//TODO hardcoded from AiBuildingMetric {[](db_building* b, db_building_level* l) -> float { return l->attack; }, 20, BUILDINGS_SUM_X},
}
void Possession::add(Building* building) {
buildings.push_back(building);
buildingsPerId[building->getId()]->push_back(building);
}
void Possession::add(Unit* unit) {
units.push_back(unit);
if (unit->getDbUnit()->typeWorker) {
workers.push_back(unit);
}
}
void Possession::updateAndClean(const Resources& resources, const ObjectsInfo* simInfo) {
cleanDead(buildings, simInfo->ifBuildingDied());
cleanDead(units, simInfo->ifUnitDied());
cleanDead(workers, simInfo->ifUnitDied());
if (simInfo->ifBuildingDied()) {
for (const auto perId : buildingsPerId) {
if (perId) {
cleanDead(perId);
}
}
}
resetSpan(unitsSumAsSpan);
resetSpan(freeArmySumAsSpan);
std::fill_n(levels, levelsSize, 0.f);
std::fill_n(levelsFree, levelsSize, 0.f);
for (const auto unit : units) {
auto per = unit->getHealthPercent();
levels[unit->getLevel()->id] += per;
//TODO to dac jako któtkie
if (isFreeSolider(unit)) {
levelsFree[unit->getLevel()->id] += per;
}
}
auto& uLevels = Game::getDatabase()->getUnitLevels();
for (int i = 0; i < levelsSize; ++i) {
const auto val = levels[i];
if (val > 0.f) {
auto& metric = uLevels[i]->dbUnitMetric->getValuesNormForSum();
assert(metric.size() == unitsSumAsSpan.size());
for (int j = 0; j < unitsSumAsSpan.size(); ++j) {
unitsSumAsSpan[j] += val * metric[j];
}
const auto val2 = levelsFree[i];
if (val2 > 0.f) {
for (int j = 0; j < freeArmySumAsSpan.size(); ++j) {
freeArmySumAsSpan[j] += val2 * metric[j];
}
}
}
}
resetSpan(buildingsSumAsSpan);
std::fill_n(levels, levelsSize, 0.f);
for (const auto building : buildings) {
levels[building->getLevel()->id] += building->getHealthPercent();
}
auto& bLevels = Game::getDatabase()->getBuildingLevels();
for (int i = 0; i < levelsSize; ++i) {
const auto lVal = levels[i];
if (lVal > 0.f) {
auto& metric = bLevels[i]->dbBuildingMetric->getValuesNormForSum();
assert(metric.size() == buildingsSumAsSpan.size());
for (int j = 0; j < buildingsSumAsSpan.size(); ++j) {
buildingsSumAsSpan[j] += lVal * metric[j];
}
}
}
resourcesSum = sumSpan(resources.getValues());
freeWorkersNumber = std::ranges::count_if(workers, [](Unit* worker) {
return isInFreeState(worker->getState());
});
freeArmyNumber = std::ranges::count_if(units, [](Unit* worker) {
return isFreeSolider(worker);
});
resetSpan(resWithoutBonus);
for (const auto worker : workers) {
if (worker->getState() == UnitState::COLLECT && worker->isFirstThingAlive()) {
auto res = (ResourceEntity*)worker->getThingToInteract();
//TODO przechowac w resource
const auto bonus = Game::getEnvironment()->getBonuses(worker->getPlayer(), res);
if (bonus <= 1.f) {
resWithoutBonus[res->getId()] += 1;
}
}
}
assert(validateSpan(__LINE__, __FILE__, unitsSumAsSpan));
assert(validateSpan(__LINE__, __FILE__, freeArmySumAsSpan));
assert(validateSpan(__LINE__, __FILE__, buildingsSumAsSpan));
}
```
QueueUtils.h
```#pragma once
#include "Game.h"
#include "QueueActionType.h"
#include "database/DatabaseCache.h"
inline float getSecToComplete(QueueActionType type, short id, int level) {
switch (type) {
case QueueActionType::UNIT_CREATE:
return Game::getDatabase()->getUnit(id)->getLevel(level).value()->buildTime;
case QueueActionType::BUILDING_CREATE:
return Game::getDatabase()->getBuilding(id)->getLevel(level).value()->buildTime;
case QueueActionType::UNIT_LEVEL:
return Game::getDatabase()->getUnit(id)->getLevel(level).value()->upgradeTime; //TODO BUG value
case QueueActionType::BUILDING_LEVEL:
return Game::getDatabase()->getBuilding(id)->getLevel(level).value()->upgradeTime;
default:
return 1;
}
}
inline float getSecPerInstance(QueueActionType type, short id, int level) {
//TODO performance przerobic na tablice
switch (type) {
case QueueActionType::UNIT_CREATE:
return 30;
case QueueActionType::BUILDING_CREATE:
case QueueActionType::UNIT_LEVEL:
case QueueActionType::BUILDING_LEVEL:
default:
return 0;
}
}```
Main.cpp
```#include "Main.h"
#include <numeric>
#include <Urho3D/Core/CoreEvents.h>
#include <Urho3D/Engine/Console.h>
#include <Urho3D/Engine/DebugHud.h>
#include <Urho3D/Engine/EngineDefs.h>
#include <Urho3D/Graphics/Camera.h>
#include <Urho3D/Graphics/Graphics.h>
#include <Urho3D/Graphics/Renderer.h>
#include <Urho3D/Input/Input.h>
#include <Urho3D/IO/FileSystem.h>
#include <Urho3D/IO/Log.h>
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/Scene/SceneEvents.h>
#include <Urho3D/UI/Button.h>
#include <Urho3D/UI/UI.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/Graphics/RenderPath.h>
#include <Urho3D/UI/ProgressBar.h>
#include "camera/CameraEnums.h"
#include "camera/CameraManager.h"
#include "colors/ColorPaletteRepo.h"
#include "control/Controls.h"
#include "control/SelectedInfo.h"
#include "database/DatabaseCache.h"
#include "database/db_grah_structs.h"
#include "debug/DebugLineRepo.h"
#include "hud/Hud.h"
#include "hud/HudData.h"
#include "hud/MySprite.h"
#include "hud/window/in_game_menu/middle/FileFormData.h"
#include "hud/window/main_menu/new_game/NewGameForm.h"
#include "hud/window/selected/SelectedHudElement.h"
#include "math/RandGen.h"
#include "objects/ActionType.h"
#include "objects/projectile/ProjectileManager.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "scene/LevelBuilder.h"
#include "scene/load/dbload_container.h"
#include "simulation/FrameInfo.h"
#include "simulation/SimGlobals.h"
#include "simulation/SimInfo.h"
#include "simulation/Simulation.h"
#include "env/Environment.h"
#include "env/influence/CenterType.h"
#include "hud/UiUtils.h"
#include "simulation/formation/FormationManager.h"
#include "stats/AiInputProvider.h"
URHO3D_DEFINE_APPLICATION_MAIN(Main)
using namespace Urho3D;
Main::Main(Context* context) : Application(context), useMouseMode_(MM_ABSOLUTE), saver(100),
gameState(GameState::STARTING), loadingProgress(6) {
MySprite::RegisterObject(context);
Game::init();
ProjectileManager::init();
}
void Main::Setup() {
miniReadParameters();
Game::setDatabaseCache(new DatabaseCache(SIM_GLOBALS.DATABASE_NUMBER.CString()));
if (!SIM_GLOBALS.HEADLESS) {
const db_settings* settings = Game::getDatabase()->getSettings();
const db_graph_settings* graphSettings = Game::getDatabase()->getGraphSettings()[settings->graph];
const db_resolution* resolution = Game::getDatabase()->getResolution(settings->resolution);
engineParameters_[EP_WINDOW_TITLE] = GetTypeName();
engineParameters_[EP_FULL_SCREEN] = graphSettings->fullscreen;
engineParameters_[EP_SOUND] = false;
engineParameters_[EP_WINDOW_WIDTH] = resolution->x;
engineParameters_[EP_WINDOW_HEIGHT] = resolution->y;
engine_->SetMaxFps(graphSettings->max_fps);
engine_->SetMinFps(graphSettings->min_fps);
}
engineParameters_[EP_RESOURCE_PATHS] = "Data;CoreData;CoreDataMy";
engineParameters_[EP_RESOURCE_PREFIX_PATHS] = " ;../";
readParameters();
RandGen::init(SIM_GLOBALS.RANDOM);
if (SIM_GLOBALS.HEADLESS) {
engineParameters_[EP_LOG_NAME] = "";
GetSubsystem<Log>()->SetLevel(LOG_NONE);
} else {
engineParameters_[EP_LOG_NAME] = "logs/" + GetTypeName() + ".log";
}
Game::setCache(GetSubsystem<ResourceCache>())
->setUI(GetSubsystem<UI>())
->setConsole(GetSubsystem<Console>())
->setContext(context_)
->setLog(GetSubsystem<Log>());
}
void Main::Start() {
Game::setGraphics(GetSubsystem<Graphics>());
SetWindowTitleAndIcon();
InitLocalizationSystem();
subscribeToEvents();
hud = new Hud();
if (!engineParameters_[EP_HEADLESS].GetBool()) {
hud->prepareUrho(engine_);
hud->createMyPanels();
healthBarProvider.init();
subscribeToUIEvents();
}
InitMouseMode(MM_RELATIVE);
changeState(GameState::LOADING);
}
void Main::writeOutput(std::initializer_list<const std::function<float(Player*)>> funcs1,
std::initializer_list<const std::function<std::span<float>(Player*)>> funcs2) const {
std::ofstream outFile(("result/" + outputName).CString(), std::ios_base::out);
for (const auto player : Game::getPlayersMan()->getAllPlayers()) {
outFile << std::to_string(player->getId());
for (auto& func : funcs1) {
outFile << ";" << func(player);
}
for (auto& func : funcs2) {
for (const auto val : func(player)) {
outFile << ";" << val;
}
}
outFile << "\n";
}
outFile.close();
}
void Main::writeOutput() const {
if (!outputName.Empty()) {
writeOutput(
{
[](Player* p) -> float { return p->getScore(); },
[](Player* p) -> float { return p->getPossession().getUnitsNumber(); },
[](Player* p) -> float { return p->getPossession().getBuildingsNumber(); }
},
{
[](Player* p) -> std::span<float> { return p->getResources().getValues(); },
[](Player* p) -> std::span<float> { return p->getResources().getSumValues(); },
[](Player* p) -> std::span<float> { return p->getPossession().getUnitsMetrics(); },
[](Player* p) -> std::span<float> { return p->getPossession().getBuildingsMetrics(); }
});
}
}
void Main::setCameraPos() const {
if (!SIM_GLOBALS.HEADLESS) {
auto camPos = Game::getEnvironment()
->getCenterOf(CenterType::BUILDING, Game::getPlayersMan()->getActivePlayerID())
.value_or(Urho3D::Vector2::ZERO);
Game::getCameraManager()->changePosition(camPos.x_, camPos.y_);
}
}
void Main::Stop() {
disposeScene();
delete hud;
delete Game::getDatabase();
Game::setDatabaseCache(nullptr);
Game::dispose();
RandGen::dispose();
ProjectileManager::dispose();
if (!SIM_GLOBALS.HEADLESS) { engine_->DumpResources(true); }
const auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(
std::chrono::system_clock::now() - SimGlobals::SUPER_START);
std::cout << "ENDED at " << duration.count() << " ms" << std::endl;
}
void Main::subscribeToUIEvents() {
for (auto hudData : hud->getButtonsLeftMenuToSubscribe()) {
SubscribeToEvent(hudData->getUIParent(), E_CLICK, URHO3D_HANDLER(Main, HandleLeftMenuButton));
}
for (auto buttton : hud->getButtonsSelectedToSubscribe()) {
SubscribeToEvent(buttton, E_CLICK, URHO3D_HANDLER(Main, HandleSelectedButton));
}
SubscribeToEvent(hud->getSaveButton(), E_CLICK, URHO3D_HANDLER(Main, HandleSaveScene));
SubscribeToEvent(hud->getNewGameProceed(), E_CLICK, URHO3D_HANDLER(Main, HandleNewGame));
SubscribeToEvent(hud->getLoadButton(), E_CLICK, URHO3D_HANDLER(Main, HandleLoadGame));
SubscribeToEvent(hud->getCloseButton(), E_CLICK, URHO3D_HANDLER(Main, HandleCloseGame));
hud->subscribeToUIEvents();
}
void Main::subscribeToEvents() {
SubscribeToEvent(E_KEYDOWN, URHO3D_HANDLER(Main, HandleKeyDown));
SubscribeToEvent(E_KEYUP, URHO3D_HANDLER(Main, HandleKeyUp));
SubscribeToEvent(E_UPDATE, URHO3D_HANDLER(Main, HandleUpdate));
}
void Main::running(const double timeStep) {
Game::addTime(timeStep);
SimInfo* simInfo = simulation->update(timeStep);
if (!engineParameters_[EP_HEADLESS].GetBool()) {
benchmark.add(1.0f / timeStep);
debugManager.draw();
SelectedInfo* selectedInfo = control(timeStep, simInfo);
hud->update(benchmark, Game::getCameraManager(), selectedInfo, simInfo);
}
if (timeLimit != -1 && simInfo->getFrameInfo()->getSeconds() > timeLimit) {
if (SimGlobals::CURRENT_RUN + 1 < SimGlobals::MAX_RUNS) {
changeState(GameState::CLOSING);
} else {
engine_->Exit();
}
}
}
void Main::HandleUpdate(StringHash eventType, VariantMap& eventData) {
switch (gameState) {
case GameState::MENU_MAIN:
//changeState(GameState::LOADING);
break;
case GameState::LOADING:
load(saveToLoad, nullptr);
break;
case GameState::RUNNING:
running(eventData[SceneUpdate::P_TIMESTEP].GetDouble());
break;
case GameState::PAUSE:
break;
case GameState::CLOSING:
disposeScene();
changeState(GameState::LOADING);
break;
case GameState::NEW_GAME:
load(saveToLoad, newGameForm);
break;
case GameState::STARTING:
break;
default: ;
}
}
void Main::InitMouseMode(MouseMode mode) {
useMouseMode_ = mode;
auto input = GetSubsystem<Input>();
Console* console = Game::getConsole();
if (useMouseMode_ != MM_ABSOLUTE) {
input->SetMouseMode(useMouseMode_);
if (console && console->IsVisible()) {
input->SetMouseMode(MM_ABSOLUTE, true);
}
}
}
void Main::SetWindowTitleAndIcon() {
Graphics* graphics = Game::getGraphics();
if (graphics) {
const auto icon = Game::getCache()->GetResource<Image>("textures/UrhoIcon.png");
graphics->SetWindowIcon(icon);
graphics->SetWindowTitle("Art of War 2017");
}
}
void Main::changeCamera(CameraBehaviorType type) {
if (!engineParameters_[EP_HEADLESS].GetBool()) {
Game::getCameraManager()->setCameraBehave(type);
SetupViewport();
InitMouseMode(Game::getCameraManager()->getMouseMode());
}
}
void Main::InitLocalizationSystem() const {
const auto l10n = GetSubsystem<Localization>();
if (!SIM_GLOBALS.HEADLESS) {
l10n->LoadJSONFile("lang/language.json");
}
Game::setLocalization(l10n);
}
void Main::save(const String& name) {
saver.createSave(name);
int mapId = 1; //TODO id mapy wpisac
saver.saveConfig(mapId, Game::getEnvironment()->getResolution());
simulation->save(saver);
Game::getPlayersMan()->save(saver);
saver.close();
}
void Main::createSimulation() {
simulation = new Simulation(Game::getEnvironment());
}
void Main::setSimpleManagers() {
Game::setCameraManager(new CameraManager())
->setFormationManager(new FormationManager())
->setPlayersManager(new PlayersManager())
->setAiInputProvider(new AiInputProvider())
->setColorPaletteRepo(new ColorPaletteRepo());
}
void Main::updateProgress(Loading& progress) const {
if (!SIM_GLOBALS.HEADLESS) {
std::string msg = Game::getLocalization()->Get("load_msg_" +
String((int)loadingProgress.currentStage)).CString();
progress.inc(std::move(msg));
hud->updateLoading(progress.getProgress());
} else {
progress.inc();
}
}
void Main::load(const String& saveName, NewGameForm* form) {
switch (loadingProgress.currentStage) {
case 0: {
RandGen::reset(SIM_GLOBALS.RANDOM);
ProjectileManager::reset();
//disposeScene();
Game::getDatabase()->refreshAfterParametersRead();
setSimpleManagers();
levelBuilder = new LevelBuilder();
if (form) {
Game::getPlayersMan()->load(form);
} else {
loader.createLoad(saveName, SIM_GLOBALS.CURRENT_RUN > 0);
Game::getPlayersMan()->load(loader.loadPlayers(), loader.loadResources());
}
if (!engineParameters_[EP_HEADLESS].GetBool()) {
SetupViewport();
controls = new Controls(GetSubsystem<Input>());
}
hud->resetLoading();
if (form) {
levelBuilder->createScene(form);
} else {
levelBuilder->createScene(loader);
}
}
break;
case 1: {
if (form) {
createEnv(form->size);
} else {
createEnv(loader.getConfig()->size);
}
break;
}
case 2: {
Game::getEnvironment()->prepareGridToFind();
hud->createMiniMap();
break;
}
case 3:
createSimulation();
break;
case 4:
if (form) {
simulation->initScene(form);
} else {
simulation->initScene(loader);
}
simulation->forceUpdateInfluenceMaps();
setCameraPos();
break;
case 5:
delete form; //TODO trzeba ustawic na null
loader.end();
changeState(GameState::RUNNING);
inited = true;
break;
}
updateProgress(loadingProgress);
}
void Main::createEnv(unsigned short mainMapResolution) const {
Game::setEnvironment(new Environment(levelBuilder->getTerrain(), mainMapResolution));
}
void Main::changeState(GameState newState) {
gameState = newState;
hud->updateStateVisibilty(newState);
}
void Main::HandleKeyUp(StringHash /*eventType*/, VariantMap& eventData) {
int key = eventData[KeyUp::P_KEY].GetInt();
if (key == KEY_ESCAPE) {
auto console = GetSubsystem<Console>();
if (console->IsVisible()) {
console->SetVisible(false);
} else {
engine_->Exit();
}
}
if (key == KEY_KP_0) {
Game::getPlayersMan()->changeActive(0);
} else if (key == KEY_KP_1) {
Game::getPlayersMan()->changeActive(1);
}
if (gameState == GameState::RUNNING || gameState == GameState::PAUSE) {
if (key == KEY_1) {
changeCamera(CameraBehaviorType::FREE);
} else if (key == KEY_2) {
changeCamera(CameraBehaviorType::RTS);
} else if (key == KEY_3) {
changeCamera(CameraBehaviorType::TOP);
} else if (key == KEY_F5) {
String name = "test" + String(RandGen::nextRand(RandIntType::SAVE, 99999999));
save(name);
} else if (key == KEY_F6) {
saveToLoad = "quicksave.db";
changeState(GameState::CLOSING);
} else if (key == KEY_H) {
auto& possession = Game::getPlayersMan()->getActivePlayer()->getPossession();
for (auto building : possession.getBuildings()) {
//TODO perf
if (building->getDbBuilding()->typeCenter) {
auto pos = building->getPosition();
Game::getCameraManager()->changePosition(pos.x_, pos.z_);
}
}
}
}
}
void Main::HandleNewGame(StringHash eventType, VariantMap& eventData) {
const auto element = static_cast<UIElement*>(eventData[UIMouseClick::P_ELEMENT].GetVoidPtr());
const auto form = static_cast<NewGameForm*>(element->GetVar("NewGameForm").GetVoidPtr());
changeState(GameState::NEW_GAME);
newGameForm = new NewGameForm(*form);
}
void Main::HandleLoadGame(StringHash eventType, VariantMap& eventData) {
const auto element = static_cast<UIElement*>(eventData[UIMouseClick::P_ELEMENT].GetVoidPtr());
const auto fileName = element->GetVar("LoadFileName").GetString();
changeState(GameState::LOADING);
saveToLoad = String(fileName);
}
void Main::HandleCloseGame(StringHash eventType, VariantMap& eventData) {
engine_->Exit();
}
void Main::HandleLeftMenuButton(StringHash eventType, VariantMap& eventData) {
const auto hudData = HudData::getFromElement(eventData);
switch (hudData->getType()) {
case ActionType::BUILDING_CREATE:
return controls->toBuild(hudData);
default: ;
controls->order(hudData->getId(), hudData->getType());
}
}
void Main::HandleSelectedButton(StringHash eventType, VariantMap& eventData) {
controls->unSelectAll();
const auto element = static_cast<UIElement*>(eventData[UIMouseClick::P_ELEMENT].GetVoidPtr());
auto sHudElement = static_cast<SelectedHudElement*>(element->GetVar("SelectedHudElement").GetVoidPtr());
controls->select(&sHudElement->getSelected());
}
void Main::HandleKeyDown(StringHash /*eventType*/, VariantMap& eventData) {
const int key = eventData[KeyDown::P_KEY].GetInt();
if (key == KEY_F1) {
GetSubsystem<Console>()->Toggle();
} else if (key == KEY_F2) {
GetSubsystem<DebugHud>()->ToggleAll();
}
if (key == KEY_KP_PLUS) {
simulation->changeCoef(coefToEdit, 1);
} else if (key == KEY_KP_MINUS) {
simulation->changeCoef(coefToEdit, -1);
}
if (key == KEY_F8) {
engine_->SetMaxFps((engine_->GetMaxFps() + 1) * 2);
} else if (key == KEY_F7) {
engine_->SetMaxFps(engine_->GetMaxFps() / 2);
}
if (key == KEY_G) {
Game::getEnvironment()->flipTerrainShaderParam("GridEnable");
}
if (key == KEY_V) {
Game::getEnvironment()->nextVisibilityType();
}
}
void Main::HandleMouseModeRequest(StringHash /*eventType*/, VariantMap& eventData) {
const auto console = GetSubsystem<Console>();
if (console && console->IsVisible()) { return; }
auto input = GetSubsystem<Input>();
if (useMouseMode_ == MM_ABSOLUTE) {
input->SetMouseVisible(false);
} else if (useMouseMode_ == MM_FREE) {
input->SetMouseVisible(true);
}
input->SetMouseMode(useMouseMode_);
}
void Main::HandleMouseModeChange(StringHash /*eventType*/, VariantMap& eventData) {
bool mouseLocked = eventData[MouseModeChanged::P_MOUSELOCKED].GetBool();
GetSubsystem<Input>()->SetMouseVisible(!mouseLocked);
}
void Main::HandleSaveScene(StringHash /*eventType*/, VariantMap& eventData) {
const auto element = static_cast<UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
const auto data = static_cast<FileFormData*>(element->GetVar("file_data").GetVoidPtr());
save(data->fileName);
}
void Main::SetupViewport() {
auto v = new Viewport(context_, Game::getScene(), Game::getCameraManager()->getComponent());
SharedPtr<Viewport> viewport(v);
//v->GetRenderPath()->Append(Game::getCache()->GetResource<XMLFile>("PostProcess/FXAA2.xml"));
const auto renderer = GetSubsystem<Renderer>();
if (renderer) {
renderer->SetViewport(0, viewport);
}
}
void Main::disposeScene() {
if (inited) {
writeOutput();
Loading loading2(5, !SIM_GLOBALS.HEADLESS);
Game::getScene()->SetUpdateEnabled(false);
loading2.reset("dispose simulation");
if (simulation) {
simulation->clearNodesWithoutDelete();
delete simulation;
simulation = nullptr;
}
loading2.inc("dispose managers");
delete Game::getCameraManager();
Game::setCameraManager(nullptr);
delete Game::getFormationManager();
Game::setFormationManager(nullptr);
delete Game::getColorPaletteRepo();
Game::setColorPaletteRepo(nullptr);
loading2.inc("dispose environment");
delete Game::getEnvironment();
Game::setEnvironment(nullptr);
loading2.inc("dispose playerManager");
delete Game::getPlayersMan();
Game::setPlayersManager(nullptr);
loading2.inc("dispose Stats & AIinput");
delete Game::getAiInputProvider();
Game::setAiInputProvider(nullptr);
loading2.inc("dispose controls");
delete controls;
controls = nullptr;
loading2.inc("dispose levelBuilder");
delete levelBuilder;
levelBuilder = nullptr;
DebugLineRepo::dispose();
}
SimGlobals::CURRENT_RUN++;
if (SimGlobals::CURRENT_RUN < SimGlobals::OUTPUT_NAMES.Size()) {
outputName = SimGlobals::OUTPUT_NAMES[SimGlobals::CURRENT_RUN];
}
inited = false;
loadingProgress.reset();
}
SelectedInfo* Main::control(const float timeStep, SimInfo* simulationInfo) {
const IntVector2 cursorPos = Game::getUI()->GetCursorPosition();
UIElement* element = Game::getUI()->GetElementAt(hud->getRoot(), cursorPos, true);
if (element) {
controls->deactivate();
} else {
controls->activate();
controls->control();
}
const auto input = GetSubsystem<Input>();
debugManager.change(input, simulation);
if (input->GetKeyPress(Urho3D::KEY_P)) {
Game::getEnvironment()->drawInfluence();
}
Game::getCameraManager()->translate(cursorPos, input, timeStep);
controls->cleanAndUpdate(simulationInfo);
auto camera = Game::getCameraManager()->getComponent();
healthBarProvider.reset(controls->getSelected().size(), controls->getInfo()->getSelectedType());
for (auto selected : controls->getSelected()) {
auto progressBar = healthBarProvider.getNext(selected->getType());
if (progressBar) {
auto pos = selected->getPosition();
pos.y_ += selected->getModelHeight() * 1.3f;
IntVector2 pixel{
VectorRoundToInt(Vector2(Game::getGraphics()->GetSize()) * camera->WorldToScreenPoint(pos))};
auto halfSize = progressBar->GetSize().x_ / 2;
pixel.x_ -= halfSize;
progressBar->SetPosition(pixel);
progressBar->SetValue(selected->getHealthPercent());
progressBar->SetVisible(true);
progressBar->SetEnabled(true);
}
}
return controls->getInfo();
}
void Main::readParameters() {
auto const& arguments = GetArguments();
for (unsigned i = 0; i < arguments.Size(); ++i) {
auto& current = arguments[i];
if (current.Length() > 1 && current[0] == '-') {
String argument = current.Substring(1).ToLower();
const String value = i + 1 < arguments.Size() ? arguments[i + 1] : String::EMPTY;
if (argument == "train") {
SimGlobals::TRAIN_MODE = true;
engine_->SetMaxFps(0);
engine_->SetMaxInactiveFps(0);
} else if (argument == "benchmark") {
SimGlobals::BENCHMARK_MODE = true;
engine_->SetMaxFps(0);
engine_->SetMaxInactiveFps(0);
} else if (argument == "headless") {
SimGlobals::HEADLESS = true;
} else if (argument == "faketerrain") {
SimGlobals::FAKE_TERRAIN = true;
} else if (argument == "allplayerai") {
SimGlobals::ALL_PLAYER_AI = true;
} else if (argument == "noplayerai") {
SimGlobals::NO_PLAYER_AI = true;
} else if (argument == "savename") {
saveToLoad = SIM_GLOBALS.DATABASE_NUMBER + value;
} else if (argument == "outputname" && !value.Empty()) {
SimGlobals::OUTPUT_NAMES = value.Split('|');
SimGlobals::MAX_RUNS = SimGlobals::OUTPUT_NAMES.Size();
outputName = SimGlobals::OUTPUT_NAMES[0];
++i;
} else if (argument == "timelimit" && !value.Empty()) {
timeLimit = ToInt(value);
++i;
} else if (argument == "x" && !value.Empty()) {
engineParameters_[EP_WINDOW_WIDTH] = ToInt(value);
++i;
} else if (argument == "y" && !value.Empty()) {
engineParameters_[EP_WINDOW_HEIGHT] = ToInt(value);
++i;
} else if (argument == "actionaipath1" && !value.Empty()) {
SimGlobals::ACTION_AI_PATH[0] = value.CString();
++i;
} else if (argument == "actionaipath2" && !value.Empty()) {
SimGlobals::ACTION_AI_PATH[1] = value.CString();
++i;
} else if (argument == "orderaipath1" && !value.Empty()) {
SimGlobals::ORDER_AI_PATH[0] = value.CString();
++i;
} else if (argument == "orderaipath2" && !value.Empty()) {
SimGlobals::ORDER_AI_PATH[1] = value.CString();
++i;
} else if (argument == "random") {
SimGlobals::RANDOM = true;
}
}
}
}
void Main::miniReadParameters() const {
auto const& arguments = GetArguments();
for (unsigned i = 0; i < arguments.Size(); ++i) {
if (arguments[i].Length() > 1 && arguments[i][0] == '-') {
String argument = arguments[i].Substring(1).ToLower();
const String value = i + 1 < arguments.Size() ? arguments[i + 1] : String::EMPTY;
if (argument == "databasename" && !value.Empty()) {
SimGlobals::DATABASE_NUMBER = value;
++i;
} else if (argument == "headless") {
SimGlobals::HEADLESS = true;
}
}
}
}
```
AiTypes.h
```#pragma once
enum class AiActionType:char {
WORKER_CREATE=0,
UNIT_CREATE,
BUILDING_CREATE
};
```
db_utils.h
```#pragma once
#include <sqlite3/sqlite3.h>
#include <cstdio>
inline void ifError(int rc, char* error, const std::string& sql) {
if (rc != SQLITE_OK && rc != SQLITE_DONE) {
fprintf(stderr, "SQL error %d: %s\t", rc, error);
fprintf(stderr, sql.c_str());
fprintf(stderr, "\n");
sqlite3_free(error);
}
}
```
RandType.h
```#pragma once
enum class RandFloatType : char {
AI=0,
RESOURCE_ROTATION,
COLLISION_FORCE,
OTHER
};
enum class RandIntType : char {
SAVE=0,
PLAYER_NAME,
RESOURCE_NODE
};
```
Grid.h
```#pragma once
#include "BucketIterator.h"
#include "objects/building/Building.h"
namespace Urho3D {
class Vector2;
class Vector3;
}
class CloseIndexes;
class LevelCache;
class Unit;
class Bucket;
class Physical;
struct GridCalculator;
class Grid {
public:
Grid(short resolution, float size, bool initCords, float maxQueryRadius);
Grid(const Grid& rhs) = delete;
virtual ~Grid();
virtual int update(Physical* physical, int currentIndex) const;
virtual void remove(Physical* physical) const;
void removeAt(int index, Physical* entity) const;
virtual int updateNew(Physical* physical) const;
const std::vector<Physical*>& getContentAt(int index) const;
std::vector<Physical*>* getArrayNeight(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& pair, char player);
std::vector<Physical*>* getArrayNeightSimilarAs(Physical* clicked, float radius);
std::vector<int> getCloseCenters(Urho3D::Vector2& center, float radius) const;
void invalidateCache();
void invalidateCache(int currentIdx, float radius);
BucketIterator& getArrayNeight(const Urho3D::Vector3& position, float radius);
BucketIterator& getArrayNeight(int center, float radius);
const std::vector<short>& getCloseIndexes(int center) const;
const std::vector<unsigned char>& getCloseTabIndexes(int center) const;
bool onlyOneInside(int index) const;
std::vector<Physical*>* getAllFromCache(int currentIdx, float radius);
std::vector<Physical*>* getAll(int currentIdx, float radius);
protected:
GridCalculator* calculator;
CloseIndexes* closeIndexes;
Bucket* buckets;
LevelCache* levelCache;
int sqResolution;
private:
const std::vector<Physical*>& getNotSafeContentAt(short x, short z) const;
void addAt(int index, Physical* entity) const;
BucketIterator iterator;
std::vector<Physical*>* tempSelected;
int prevIndex = -1;
float prevRadius = -1.f;
};
```
db_other_struct.h
```#pragma once
#include <Urho3D/Math/Color.h>
#include "db_basic_struct.h"
struct db_order : db_with_icon {
db_order(short id, char* icon, char* name) : db_with_icon(id, name, icon) {
}
};
struct db_map : db_with_name {
const Urho3D::String xmlName;
db_map(short id, char* xmlName, char* name): db_with_name(id, name), xmlName(xmlName) {
}
};
struct db_player_colors : db_with_name {
const unsigned unit;
const unsigned building;
Urho3D::Color unitColor;
Urho3D::Color buildingColor;
db_player_colors(short id, unsigned unit, unsigned building, char* name)
: db_with_name(id, name),
unit(unit), building(building),
unitColor(unit), buildingColor(building) {
}
};
```
HudData.cpp
```#include "HudData.h"
#include <Urho3D/UI/UIEvents.h>
#include <utility>
#include <Urho3D/UI/UIElement.h>
HudData::HudData(Urho3D::UIElement* _uiParent) : parent(_uiParent) {
}
void HudData::set(short _id, ActionType _type, Urho3D::String _text) {
id = _id;
type = _type;
text = std::move(_text);
}
HudData* HudData::getFromElement(Urho3D::VariantMap& eventData) {
const auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
return static_cast<HudData *>(element->GetVar("HudElement").GetVoidPtr());
}
```
ControlsState.h
```#pragma once
enum class ControlsState : char {
DEFAULT = 0,
BUILD,
ORDER
};
```
DeadState.h
```#pragma once
#include "State.h"
#include "StateManager.h"
class DeadState : public State
{
public:
DeadState() : State({UnitState::DISPOSE}) {
}
~DeadState() = default;
void execute(Unit* unit, float timeStep) override {
StateManager::changeState(unit, UnitState::DISPOSE);
}
};
```
TopInfoPanel.h
```#pragma once
#include "hud/window/SimplePanel.h"
namespace Urho3D {
class Text;
}
class TopInfoPanel : public SimplePanel {
public:
explicit TopInfoPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~TopInfoPanel() = default;
void hoverOn();
void hoverOff();
private:
void createBody() override;
bool hoverIsOn = false;
Urho3D::Text* text;
};
```
InfluenceMapQuad.h
```#pragma once
#include <optional>
#include <span>
#include <vector>
#include <Urho3D/Math/Vector2.h>
#include "InfluenceMapI.h"
struct GridCalculator;
class Physical;
class InfluenceMapQuad {
public:
InfluenceMapQuad(unsigned short topResolution, float mapSize);
virtual ~InfluenceMapQuad();
std::optional<Urho3D::Vector2> getCenter();
void update(int index, float value = 1.f);
void updateInt(Physical* thing, int value = 1);
void updateInt(int index, int value = 1);
void reset();
void print(const Urho3D::String& name, std::span<float> map);
void print(Urho3D::String name);
unsigned short getResolution() const; //TODO to chyba niepotrzebne
private:
int getMaxElement(const std::array<int, 4>& indexes, std::span<float> values) const;
GridCalculator* calculator;
void ensureReady();
std::vector<std::span<float>> maps;
float* data;
int dataSize;
bool dataReady = false;//TODO bug czy dobrze jest resetowana
unsigned short counter = 0;
};
```
AiInputProvider.cpp
```#include "AiInputProvider.h"
#include "Game.h"
#include "math/SpanUtils.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "player/ai/AiMetric.h"
#include "player/ai/AiUtils.h"
#include "objects/building/ParentBuildingType.h"
AiInputProvider::AiInputProvider() {
// std::cout << std::format("AI Sizes INPUT\t Res: {}, Unit: {}, Build: {}, UnitM: {}, BuildM: {}\n",
// resourceIdInputSpan.size(), unitsInputSpan.size(), buildingsInputSpan.size(), unitsWithMetricUnitSpan.size(), basicWithMetricUnitSpan.size());
}
std::span<float> AiInputProvider::getResourceInput(char playerId) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
return combineWithBasic(resourceIdInputSpan,
METRIC_DEFINITIONS.getResourceNorm(player->getResources(), player->getPossession(),
METRIC_DEFINITIONS.aiResInputIdxs),
player);
}
std::span<float> AiInputProvider::getUnitsInput(char playerId) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
return combineWithBasic(unitsInputSpan, player->getPossession().getUnitsMetrics(), player);
}
std::span<float> AiInputProvider::getBuildingsInput(char playerId) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
return combineWithBasic(buildingsInputSpan, player->getPossession().getBuildingsMetrics(), player);
}
std::span<float> AiInputProvider::getUnitsInputWithMetric(char playerId, const db_unit_metric* prop) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
return combineWithBasic(unitsWithMetricUnitSpan, prop->getTypesVal(), player);
}
std::span<float> AiInputProvider::getBuildingsInputWithMetric(char playerId, const db_building_metric* prop,
ParentBuildingType type) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
if (type == ParentBuildingType::RESOURCE) {
return combineWithBasic(buildingsResWhereInputSpan, prop->getValuesNormAsValForType(type), player);
}
return combineWithBasic(buildingsWhereInputSpan, prop->getTypesVal(), player);
}
std::span<float> AiInputProvider::getAttackOrDefenceInput(char playerId) const {
const auto plyMng = Game::getPlayersMan();
const char idEnemy = plyMng->getEnemyFor(playerId);
auto& data = METRIC_DEFINITIONS.getAttackOrDefenceNorm(plyMng->getPlayer(playerId), plyMng->getPlayer(idEnemy));
std::ranges::copy(data, attackOfDefenceInputSpan.begin());
assert(validateSpan(__LINE__, __FILE__, attackOfDefenceInputSpan));
return attackOfDefenceInputSpan;
}
std::span<float> AiInputProvider::getWhereAttack(char playerId) const {
const auto plyMng = Game::getPlayersMan();
auto* player = plyMng->getPlayer(playerId);
const char idEnemy = plyMng->getEnemyFor(playerId);
return combineWithBasic(whereAttackInputSpan,
METRIC_DEFINITIONS.getWhereAttackNorm(player, plyMng->getPlayer(idEnemy)), player);
}
std::span<float> AiInputProvider::getWhereDefend(char playerId) const {
const auto plyMng = Game::getPlayersMan();
auto* player = plyMng->getPlayer(playerId);
const char idEnemy = plyMng->getEnemyFor(playerId);
return combineWithBasic(whereDefendInputSpan,
METRIC_DEFINITIONS.getWhereDefendNorm(player, plyMng->getPlayer(idEnemy)), player);
}
std::span<float> AiInputProvider::getBuildingInputSpan(ParentBuildingType type) const {
switch (type) {
case ParentBuildingType::OTHER: return buildingsOtherInputSpan;
case ParentBuildingType::DEFENCE: return buildingsDefenceInputSpan;
case ParentBuildingType::RESOURCE: assert(false);
return buildingsResInputSpan;
case ParentBuildingType::TECH: return buildingsTechInputSpan;
case ParentBuildingType::UNITS: return buildingsUnitsInputSpan;
default: ;
}
}
std::span<float> AiInputProvider::getBuildingsTypeInput(char playerId, ParentBuildingType type) const {
auto* player = Game::getPlayersMan()->getPlayer(playerId);
if (type == ParentBuildingType::RESOURCE) {
return combineWithBasic(buildingsResInputSpan,
METRIC_DEFINITIONS.getResourceNorm(player->getResources(), player->getPossession(),
METRIC_DEFINITIONS.aiResWithoutBonusIdxsSpan),
player);
}
return combineWithBasic(getBuildingInputSpan(type), player->getPossession().getBuildingsMetrics(type), player);
}
std::span<float> AiInputProvider::getBasicInput(std::span<float> dest, Player* player) const {
const auto plyMng = Game::getPlayersMan();
char idEnemy = plyMng->getEnemyFor(player->getId());
auto& data = METRIC_DEFINITIONS.getBasicNorm(player, plyMng->getPlayer(idEnemy));
assert(validateSpan(__LINE__, __FILE__, data));
std::ranges::copy(data, dest.begin());
return std::span(dest.begin() + data.size(), dest.size() - data.size());
}
std::span<float> AiInputProvider::combineWithBasic(const std::span<float> output, const std::span<const float> toJoin,
Player* player) const {
std::ranges::copy(toJoin, getBasicInput(output, player).begin());
assert(toJoin.size() > 0);
assert(validateSpan(__LINE__, __FILE__, toJoin));
assert(validateSpan(__LINE__, __FILE__, output));
assert(output.size() == BASIC_SIZE + toJoin.size());
return output;
}
std::span<float> AiInputProvider::combineWithBasic(const std::span<float> output, const std::vector<float>& toJoin,
Player* player) const {
std::ranges::copy(toJoin, getBasicInput(output, player).begin());
assert(toJoin.size() > 0);
assert(validateSpan(__LINE__, __FILE__, toJoin));
assert(validateSpan(__LINE__, __FILE__, output));
assert(output.size() == BASIC_SIZE + toJoin.size());
return output;
}
```
ActionMaker.h
```#pragma once
#include <optional>
#include <span>
#include <valarray>
#include <vector>
namespace Urho3D {
class Vector2;
}
enum class ParentBuildingType : char;
enum class AiActionType : char;
class Player;
class Building;
struct db_building_metric;
struct db_nation;
struct db_basic_metric;
struct db_with_cost;
struct db_building;
struct db_unit_level;
struct db_unit;
struct db_building_level;
struct Brain;
class ActionMaker {
public:
explicit ActionMaker(Player* player, db_nation* nation);
ActionMaker(const ActionMaker& rhs) = delete;
void action();
private:
bool createUnit(db_unit* unit, Building* building) const;
bool createUnit(db_unit* unit) const;
bool createWorker(db_unit* unit) const;
bool enoughResources(db_with_cost* withCosts) const;
bool levelUpUnit();
bool levelUpBuilding();
bool createBuilding(db_building* building, ParentBuildingType type) const;
std::vector<db_building*> getBuildingsInType(ParentBuildingType type);
bool createBuilding(std::span<float> buildingsInput);
bool createUnit(std::span<float> unitsInput);
bool createWorker() const;
std::span<float> getWhichBuilding(ParentBuildingType type, const std::span<float> aiTypeInput) const;
bool execute(const std::span<float> unitsInput, const std::span<float> buildingsInput, AiActionType decision);
std::optional<Urho3D::Vector2> findPosToBuild(db_building* building, ParentBuildingType type) const;
std::vector<Building*> getBuildingsCanDeploy(short unitId) const;
float dist(std::valarray<float>& center, const db_basic_metric* metric);
float dist(std::valarray<float>& center, const db_building_metric* metric, ParentBuildingType type);
db_building* chooseBuilding(std::span<float> result, ParentBuildingType type);
db_building_level* chooseBuildingLevelUp();
db_unit* chooseUnit(std::span<float> result);
db_unit_level* chooseUnitLevelUp();
Building* getBuildingToDeploy(db_unit* unit) const;
Building* getBuildingToDeployWorker(db_unit* unit) const;
Building* getBuildingToLevelUpUnit(db_unit_level* level);
Building* getBuildingClosestArea(std::vector<Building*>& allPossible, std::span<float> result) const;
bool isEnoughResToWorker() const;
Player* player;
db_nation* nation;
Brain* ifWorker;
Brain* whereWorker;
Brain* ifBuilding;
Brain* whichBuildingType;
Brain* whichBuildingTypeOther;
Brain* whichBuildingTypeDefence;
Brain* whichBuildingTypeResource;
Brain* whichBuildingTypeTech;
Brain* whichBuildingTypeUnits;
Brain* whereBuilding;
Brain* ifFarmBuild;
Brain* ifUnit;
Brain* whichUnit;
Brain* whereUnit;
};
```
SimGlobals.h
```#pragma once
#include <chrono>
#include "utils/defines.h"
constexpr bool FORCE_BENCHMARK_MODE = false;
constexpr bool FORCE_TRAIN_MODE = false;
constexpr bool FORCE_AI_OUTPUT = false;
constexpr bool FORCE_ALL_PLAYER_AI = false;
constexpr bool FORCE_NO_PLAYER_AI = false;
constexpr bool FORCE_HEADLESS = false;
constexpr float UPDATE_DRAW_DISTANCE = 120.f;
constexpr float TIME_PER_UPDATE = 0.033333333f;
constexpr unsigned char FRAMES_IN_PERIOD = 1 / TIME_PER_UPDATE;
inline struct SimGlobals {
inline static bool BENCHMARK_MODE = FORCE_BENCHMARK_MODE;
inline static bool TRAIN_MODE = FORCE_TRAIN_MODE;
inline static bool ALL_PLAYER_AI = FORCE_ALL_PLAYER_AI;
inline static bool NO_PLAYER_AI = FORCE_NO_PLAYER_AI;
inline static bool HEADLESS = false;
inline static bool FAKE_TERRAIN = false;
inline static bool RANDOM = false;
inline static Urho3D::String DATABASE_NUMBER = "";
inline static std::string ACTION_AI_PATH[MAX_PLAYERS] = {"", ""};
inline static std::string ORDER_AI_PATH[MAX_PLAYERS] = {"", ""};
inline static Urho3D::Vector<Urho3D::String> OUTPUT_NAMES;
inline static int CURRENT_RUN = 0;
inline static int MAX_RUNS = 0;
inline static std::chrono::system_clock::time_point SUPER_START = std::chrono::system_clock::now();
} SIM_GLOBALS;
```
MainMenuClosePanel.cpp
```#include "MainMenuClosePanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
MainMenuClosePanel::
MainMenuClosePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): MainMenuDetailsPanel(root, _style, _title) {
bodyStyle = "MainMenuCloseMock";
}
Urho3D::Button* MainMenuClosePanel::getCloseButton() const {
return yes;
}
void MainMenuClosePanel::createBody() {
MainMenuDetailsPanel::createBody();
auto l10n = Game::getLocalization();
miniWindow = createElement<Urho3D::Window>(body, style, "MiniWindow");
miniWindow->SetVisible(true);
text = addChildText(miniWindow, "CloseText", l10n->Get("if_close"), style);
row = createElement<Urho3D::UIElement>(miniWindow, style, "MainMenuCloseRow");
yes = createElement<Urho3D::Button>(row, style, "MsgButton");
addChildText(yes, "MsgTextButton", l10n->Get("quit"), style);
no = createElement<Urho3D::Button>(row, style, "MsgButton");
addChildText(no, "MsgTextButton", l10n->Get("cancel"), style);
SubscribeToEvent(no, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuClosePanel, HandleCancelClick));
}
void MainMenuClosePanel::HandleCancelClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
setVisible(false);
}
```
FormationOrder.cpp
```#include "FormationOrder.h"
#include "Game.h"
#include "IndividualOrder.h"
#include "objects/unit/Unit.h"
#include "enums/UnitAction.h"
#include "simulation/formation/Formation.h"
#include "env/Environment.h"
FormationOrder::FormationOrder(Formation* formation, short action,
Urho3D::Vector2& vector, bool append):
UnitOrder(action, append, vector), formation(formation) {
}
FormationOrder::FormationOrder(Formation* formation, short action,
Physical* toUse, bool append):
UnitOrder(action, append, toUse), formation(formation) {
}
bool FormationOrder::add() {
//TODO to implement
return false;
}
bool FormationOrder::expired() {
return formation == nullptr
|| formation->getSize() <= 0
|| toUse != nullptr && !toUse->isAlive();
}
short FormationOrder::getSize() const {
return formation->getSize();
}
void FormationOrder::addCollectAim() {
followAndAct(9);
}
void FormationOrder::addTargetAim() {
auto opt = formation->getLeader();
if (opt.has_value() && vector) {
Unit* leader = opt.value();
leader->action(static_cast<UnitAction>(id), getTargetAim(leader->getMainGridIndex(), *vector));
formation->stopAllBesideLeader();
Game::getEnvironment()->invalidatePathCache();
}
}
void FormationOrder::addFollowAim() {
auto leaderOpt = formation->getLeader();
if (leaderOpt.has_value()) {
formation->stopAllBesideLeader();
Unit* leader = leaderOpt.value();
auto const indexes = toUse->getIndexesForUse(leader);
if (!indexes.empty()) {
leader->action(static_cast<UnitAction>(id), getFollowAim(leader->getMainGridIndex(), indexes));
}
}
}
void FormationOrder::addChargeAim() {
auto action = static_cast<UnitAction>(id);
for (auto unit : formation->getUnits()) {
unit->action(action, getChargeAim(*vector));
}
}
void FormationOrder::followAndAct(float distThreshold) {
if (const auto optLeader = formation->getLeader(); optLeader.has_value()) {
Unit* leader = optLeader.value();
auto const indexes = toUse->getIndexesForUse(leader);
if (!indexes.empty()) {
if (Game::getEnvironment()->anyCloseEnough(indexes, leader->getMainGridIndex(), distThreshold)) {
for (auto* unit : formation->getUnits()) {
unit->resetFormation();
unit->addOrder(new IndividualOrder(unit, UnitAction(id), toUse, false));
//TODO to samo zrobic w innnych akcjach z atakiem
//TOAttack jak nie ten to zaatakowac blizeszego
}
formation->remove();
} else {
//auto pos = std::get<0>(postToUse);
leader->action(UnitAction::FOLLOW, getFollowAim(leader->getMainGridIndex(), indexes));
formation->addOrder(new FormationOrder(formation, id, toUse, true));
//Dodanie celu po dojsciu
}
}
}
}
void FormationOrder::addAttackAim() {
auto optLeader = formation->getLeader();
if (optLeader.has_value()) {
followAndAct(optLeader.value()->getAttackRange());
}
}
void FormationOrder::addDefendAim() {
simpleAction();
}
void FormationOrder::addDeadAim() {
simpleAction();
}
void FormationOrder::addStopAim() {
simpleAction();
}
void FormationOrder::simpleAction() const {
const auto action = static_cast<UnitAction>(id);
for (auto* unit : formation->getUnits()) {
unit->resetFormation();
unit->action(action);
}
formation->remove();
}
```
AiInputProvider.h
```#pragma once
#include <span>
#include "database/db_strcut.h"
#include "player/ai/AiMetric.h"
class Player;
struct db_unit_metric;
struct db_building_metric;
struct db_basic_metric;
class AiInputProvider {
public:
AiInputProvider();
AiInputProvider(const AiInputProvider&) = delete;
std::span<float> getResourceInput(char playerId) const;
std::span<float> getUnitsInput(char playerId) const;
std::span<float> getBuildingsInput(char playerId) const;
std::span<float> getUnitsInputWithMetric(char playerId, const db_unit_metric* prop) const;
std::span<float> getBuildingsInputWithMetric(char playerId, const db_building_metric* prop, ParentBuildingType type) const;
std::span<float> getAttackOrDefenceInput(char playerId) const;
std::span<float> getWhereAttack(char playerId) const;
std::span<float> getWhereDefend(char playerId) const;
std::span<float> getBuildingInputSpan(ParentBuildingType type) const;
std::span<float> getBuildingsTypeInput(char playerId, ParentBuildingType type) const;
private:
std::span<float> getBasicInput(std::span<float> dest, Player* player) const;
std::span<float> combineWithBasic(const std::span<float> output, const std::span<const float> toJoin,
Player* player) const;
std::span<float> combineWithBasic(const std::span<float> output, const std::vector<float>& toJoin,
Player* player) const;
float resourceIdInput[BASIC_SIZE + RESOURCE_AI_SIZE];
float unitsInput[BASIC_SIZE + UNIT_SIZE];
float buildingsInput[BASIC_SIZE + BUILDING_SIZE];
float attackOfDefenceInput[ATTACK_OR_DEFENCE_SIZE];
float whereAttackInput[BASIC_SIZE + WHERE_ATTACK_SIZE];
float whereDefendInput[BASIC_SIZE + WHERE_DEFEND_SIZE];
float unitsWithMetric[BASIC_SIZE + UNIT_TYPES_SIZE];
float buildingsOtherInput[BASIC_SIZE + BUILDING_OTHER_SIZE];
float buildingsDefenceInput[BASIC_SIZE + BUILDING_DEF_SIZE];
float buildingsResInput[BASIC_SIZE + BUILDING_RES_BONUS_SIZE];
float buildingsTechInput[BASIC_SIZE + BUILDING_TECH_SIZE];
float buildingsUnitsInput[BASIC_SIZE + BUILDING_UNITS_SIZE];
float buildingsWhereInput[BASIC_SIZE + BUILDING_TYPES_SIZE];
float buildingsResWhereInput[BASIC_SIZE + BUILDING_RES_SIZE];
std::span<float> resourceIdInputSpan = std::span(resourceIdInput);
std::span<float> unitsInputSpan = std::span(unitsInput);
std::span<float> buildingsInputSpan = std::span(buildingsInput);
std::span<float> attackOfDefenceInputSpan = std::span(attackOfDefenceInput);
std::span<float> whereAttackInputSpan = std::span(whereAttackInput);
std::span<float> whereDefendInputSpan = std::span(whereDefendInput);
std::span<float> unitsWithMetricUnitSpan = std::span(unitsWithMetric);
std::span<float> buildingsWhereInputSpan = std::span(buildingsWhereInput);
std::span<float> buildingsResWhereInputSpan = std::span(buildingsResWhereInput);
std::span<float> buildingsOtherInputSpan = std::span(buildingsOtherInput);
std::span<float> buildingsDefenceInputSpan = std::span(buildingsDefenceInput);
std::span<float> buildingsResInputSpan = std::span(buildingsResInput);
std::span<float> buildingsTechInputSpan = std::span(buildingsTechInput);
std::span<float> buildingsUnitsInputSpan = std::span(buildingsUnitsInput);
};
```
Force.h
```#pragma once
#include "ForceStats.h"
#include <vector>
enum class UnitState : char;
class Unit;
class Physical;
class Force {
public:
Force() = default;
~Force() = default;
void separationObstacle(Urho3D::Vector2& newForce, Unit* unit);
void separationUnits(Urho3D::Vector2& newForce, Unit* unit, std::vector<Physical*>* neights);
void destOrFormation(Urho3D::Vector2& newForce, Unit* unit);
void destination(Urho3D::Vector2& newForce, Unit* unit, float factor);
void formation(Urho3D::Vector2& newForce, Unit* unit);
void escapeFromInvalidPosition(Urho3D::Vector2& newForce, Unit* unit);
void inCell(Urho3D::Vector2& newForce, Unit* unit) const;
ForceStats& stats();
void changeCoef(int i, int wheel);
private:
void turnIfAreOpposite(Urho3D::Vector2& newForce, Urho3D::Vector2& force) const;
float calculateCoef(float distance, float minDist) const;
void randSepForce(Urho3D::Vector2& newForce) const;
float boostCoef = 100;
float sepCoef = 10;
float aimCoef = 2;
float escapeCoef = 20;
float formationCoef = 50;
float inCellCoef = 1;
float inSocketCoef = 10;
ForceStats forceStats;
};
```
BrainProvider.h
```#pragma once
#include <string>
#include <vector>
struct Brain;
class BrainProvider {
public:
~BrainProvider();
static Brain* get(std::string name);
private:
BrainProvider() = default;
static std::vector<Brain*> brains;
static std::vector<std::string> tempLines;
};
```
Formation.cpp
```#include "Formation.h"
#include <iterator>
#include <numeric>
#include "Game.h"
#include "math/MathUtils.h"
#include "objects/unit/GroupUtils.h"
#include "objects/unit/Unit.h"
#include "objects/unit/order/FormationOrder.h"
#include "objects/unit/order/OrderUtils.h"
#include "objects/unit/state/StateManager.h"
#include "env/Environment.h"
#include "utils/OtherUtils.h"
constexpr float THRESHOLD_MIN = 0.3f;
constexpr float THRESHOLD_MAX = 0.5f;
Formation::Formation(short _id, const std::vector<Unit*>& _units, FormationType _type, Urho3D::Vector2 _direction) :
id(_id), type(_type), state(FormationState::FORMING), direction(_direction), units(_units) {
for (auto* unit : units) {
unit->clearAims();
StateManager::toDefaultState(unit);
}
if (!units.empty()) {
updateIds();
setCenter();
} else {
changeState(FormationState::EMPTY);
}
levelOfReach = new char[units.size()];
std::fill_n(levelOfReach, units.size(), 0);
}
Formation::~Formation() {
delete[] levelOfReach;
}
void Formation::chooseLeader(Urho3D::Vector2& localCenter) {
float maxDist = 99999.f;
leader = nullptr;
for (auto* unit : units) {
const auto dist = sqDist(localCenter, unit->getPosition());
if (dist < maxDist) {
leader = unit;
maxDist = dist;
}
}
}
void Formation::electLeader() {
auto center = computeLocalCenter(units);
chooseLeader(center);
if (oldLeader != nullptr && leader != oldLeader) {
if (oldLeader->getFormation() == id) {
oldLeader->clearAims();
}
if (pendingOrder) {
stopAllBesideLeader();
pendingOrder->execute();
} else if (!unitOrders.empty()) {
//??a co to get next?
}
changeState(FormationState::FORMING);
}
oldLeader = leader;
}
void Formation::setFormationClearPosition() {
for (auto* unit : units) {
unit->setFormation(id);
unit->setPositionInFormation(-1);
}
}
void Formation::setPosInFormationForLeader() const {
short posInFormation = (short)((sideB - 1) / 2) * sideA + (short)(sideA / 2.0 + 0.5);
if (posInFormation >= units.size()) {
posInFormation = units.size() - 1;
}
leader->setPositionInFormation(posInFormation);
}
void Formation::updateIds() {
if (changed) {
pathCache.clear();
updateSideSize();
electLeader();
setCenter();
setFormationClearPosition();
setPosInFormationForLeader();
auto* const env = Game::getEnvironment();
std::unordered_map<int, std::vector<short>> bucketToIds;
for (int i = 0; i < units.size(); ++i) {
if (leader->getPositionInFormation() == i) {
continue;
}
auto pos = getPositionFor(i);
int bucketForI = env->getIndex(pos);
auto it = bucketToIds.find(bucketForI);
if (it != bucketToIds.end()) {
it->second.push_back(i);
} else {
auto inserted = bucketToIds.emplace(bucketForI, std::vector<short>());
inserted.first->second.reserve(4);
inserted.first->second.push_back(i);
}
}
std::vector<short> tempVec(units.size());
std::iota(tempVec.begin(), tempVec.end(), 0);
const short leaderID = leader->getPositionInFormation();
tempVec[leaderID] = -1;
short restToAssign = tempVec.size() - 1;
for (auto unit : units) {
if (leader == unit) {
continue;
}
int bucketId = unit->getMainGridIndex();
const auto pos = unit->getPosition();
const auto currentPos = Urho3D::Vector2(pos.x_, pos.z_);
auto it = bucketToIds.find(bucketId);
if (it != bucketToIds.end()) {
short bestId = -1;
float bestSize = 99999; //TODO do zast¹pienia tym z unit
for (int i = 0; i < it->second.size(); ++i) {
const auto id = it->second[i];
if (tempVec[id] != -1) {
const auto dist = sqDist(currentPos, getPositionFor(id));
if (dist < bestSize) {
bestSize = dist;
bestId = i;
}
}
}
if (bestId >= 0) {
--restToAssign;
tempVec[it->second[bestId]] = -1;
unit->setPositionInFormation(it->second[bestId]);
it->second.erase(it->second.begin() + bestId);
}
}
}
std::vector<short> output;
output.reserve(restToAssign);
std::ranges::copy_if(tempVec, std::back_inserter(output), [](const short i) { return i >= 0; });
int i = 0;
for (auto unit : units) {
if (unit->getPositionInFormation() == -1) {
unit->setPositionInFormation(output[i]);
++i;
}
}
changed = false;
}
}
void Formation::updateSideSize() {
sideA = sqrt(units.size()) + 0.5f;
sideB = units.size() / sideA;
}
void Formation::calculateCohesion() {
notWellFormed = 0;
notWellFormedExact = 0;
for (const auto unit : units) {
const auto desiredPos = getPositionFor(unit->getPositionInFormation());
const auto dist = sqDist(unit->getPosition(), desiredPos);
if (dist < 0.5f) {
levelOfReach[unit->getPositionInFormation()] = 0;
} else if (dist < 2 * 2) {
notWellFormedExact += 1;
levelOfReach[unit->getPositionInFormation()] = 1;
} else {
notWellFormed += 1;
notWellFormedExact += 1;
levelOfReach[unit->getPositionInFormation()] = 2;
}
}
notWellFormed /= units.size();
notWellFormedExact /= units.size();
}
void Formation::innerUpdate() {
//pathCache.clear();
removeExpired(unitOrders);
if (pendingOrder && pendingOrder->expired()) {
delete pendingOrder;
pendingOrder = nullptr;
}
updateUnits();
if (!units.empty()) {
updateIds();
setCenter();
calculateCohesion();
} else {
changeState(FormationState::EMPTY);
}
}
void Formation::stopAllBesideLeader() {
pathCache.clear();
for (auto* unit : units) {
if (unit != leader) {
StateManager::toDefaultState(unit);
}
}
}
bool Formation::isLeader(Unit* unit) const {
return hasLeader() && unit == leader;
}
bool Formation::isMoving(Unit* unit) const {
return state == FormationState::MOVING;
}
int Formation::getCachePath(int startIdx, int aimIndex) const {
const auto ptr = pathCache.find(key(startIdx, aimIndex));
if (ptr == pathCache.end()) {
return -1;
}
return ptr->second;
}
void Formation::addCachePath(int startIdx, int aimIndex, int next) {
pathCache[key(startIdx, aimIndex)] = next;
}
void Formation::update() {
switch (state) {
case FormationState::FORMING:
innerUpdate();
if (notWellFormed < THRESHOLD_MIN) {
changeState(FormationState::MOVING);
if (!leader->hasAim()) {
removePending();
if (!unitOrders.empty()) {
pendingOrder = unitOrders[0];
unitOrders.erase(unitOrders.begin());
pendingOrder->execute();
stopAllBesideLeader();
}
}
}
break;
case FormationState::MOVING:
innerUpdate();
if (notWellFormed > THRESHOLD_MAX) {
changeState(FormationState::FORMING);
} else if (notWellFormedExact < THRESHOLD_MIN && !leader->hasAim()) {
removePending();
if (unitOrders.empty()) {
changeState(FormationState::REACHED);
} else {
changeState(FormationState::FORMING);
}
}
break;
case FormationState::REACHED:
for (auto* unit : units) {
unit->resetFormation();
}
units.clear();
changeState(FormationState::EMPTY);
break;
}
}
void Formation::removePending() {
if (pendingOrder) {
delete pendingOrder;
pendingOrder = nullptr;
}
}
void Formation::remove() {
changeState(FormationState::REACHED);
}
void Formation::changeState(FormationState newState) {
state = newState;
}
Urho3D::Vector2 Formation::getPositionFor(short id) const {
const short columnThis = id % sideA;
const short rowThis = id / sideA;
const short leaderID = leader->getPositionInFormation();
if (leaderID == id) {
return center;
}
const short columnLeader = leaderID % sideA;
const short rowLeader = leaderID / sideA;
const short column = columnThis - columnLeader;
const short row = rowThis - rowLeader;
auto position = center - Urho3D::Vector2(column * sparsity, row * sparsity);
const auto posIndex = Game::getEnvironment()->getIndex(position);
if (Game::getEnvironment()->cellIsPassable(posIndex)) {
return position;
}
//TODO perf map posIndex to closestIndex
const int closestIndex = Game::getEnvironment()->closestPassableCell(posIndex);
const auto diff = position - Game::getEnvironment()->getCenter(posIndex);
return Game::getEnvironment()->getCenter(closestIndex) + diff;
}
float Formation::getPriority(int id) const {
return levelOfReach[id];
}
bool Formation::hasLeader() const {
return state != FormationState::REACHED && units.size() > leader->getPositionInFormation();
}
std::optional<Unit*> Formation::getLeader() {
if (hasLeader()) {
return leader;
}
return {};
}
void Formation::addOrder(FormationOrder* order) {
if (!order->getAppend()) {
semiReset();
leader->clearAims();
}
unitOrders.emplace_back(order);
}
size_t Formation::getSize() const {
return units.size();
}
void Formation::semiReset() {
notWellFormed = 1;
notWellFormedExact = 1;
changed = true;
clear_vector(unitOrders);
delete pendingOrder;
pendingOrder = nullptr;
std::fill_n(levelOfReach, units.size(), 0);
changeState(FormationState::FORMING);
}
void Formation::updateUnits() {
units.erase(
std::remove_if(
units.begin(), units.end(),
[this](Unit* unit) {
const bool ifErase = !unit->isAlive() || unit->getFormation() != id;
if (ifErase) {
if(unit->getFormation() == id) {
unit->resetFormation();
}
changed = true;
}
return ifErase;
}),
units.end());
}
void Formation::setCenter() {
const auto leaderPos = leader->getPosition();
center = {leaderPos.x_, leaderPos.z_};
}
```
GridCalculatorTest.cpp
```#include "pch.h"
#include "../game/src/env/GridCalculator.h"
#include "../game/include/Urho3D/Math/Vector3.h"
class GridCalculatorFixture : public ::testing::Test {
public:
static GridCalculator* gc;
static GridCalculator* gcBig;
protected:
static void SetUpTestCase() {
// Kod uruchamiany przed pierwszym testem wewnątrz `Test Case`
gc = new GridCalculator(4, 8);
gcBig = new GridCalculator(8, 8);
}
static void TearDownTestCase() {
delete gc;
delete gcBig;
// Kod uruchamiany po ostatnim teście wewnątrz `Test Case`
}
};
GridCalculator* GridCalculatorFixture::gc = nullptr;
GridCalculator* GridCalculatorFixture::gcBig = nullptr;
TEST_F(GridCalculatorFixture, Center) {
EXPECT_EQ(gc->getCenter(0), Urho3D::Vector2(-3.f, -3.f));
EXPECT_EQ(gc->getCenter(6), Urho3D::Vector2(-1.f, 1.f));
EXPECT_EQ(gc->getCenter(9), Urho3D::Vector2(1.f, -1.f));
EXPECT_EQ(gc->getCenter(15), Urho3D::Vector2(3.f, 3.f));
}
TEST_F(GridCalculatorFixture, GetIndex) {
EXPECT_EQ(gc->getIndex(-3.f), 0);
EXPECT_EQ(gc->getIndex(3.f), 3);
EXPECT_EQ(gc->getIndex(-0.1f), 1);
EXPECT_EQ(gc->getIndex(0.1f), 2);
EXPECT_EQ(gc->getIndex(-5.f), 0);
EXPECT_EQ(gc->getIndex(5.f), 3);
EXPECT_EQ(gc->getIndexes(0), Urho3D::IntVector2(0, 0));
EXPECT_EQ(gc->getIndexes(3), Urho3D::IntVector2(0, 3));
EXPECT_EQ(gc->getIndexes(6), Urho3D::IntVector2(1, 2));
EXPECT_EQ(gc->getIndexes(9), Urho3D::IntVector2(2, 1));
EXPECT_EQ(gc->getIndexes(15), Urho3D::IntVector2(3, 3));
}
TEST_F(GridCalculatorFixture, GetBiggestDiff) {
EXPECT_EQ(gc->getBiggestDiff(0, { 0, 1, 2, 6, 7 }), 3);
EXPECT_EQ(gc->getBiggestDiff(15, { 1, 6, 7 }), 3);
}
TEST_F(GridCalculatorFixture, CombineTest) {
for (auto i = -3.f; i < 3.f; i += 2.f) {
for (auto j = -3.f; j < 3.f; j += 2.f) {
auto index = gc->indexFromPosition(i, j);
auto center = gc->getCenter(index);
EXPECT_TRUE(abs(center.x_ - i)<=0.f);
EXPECT_TRUE(abs(center.y_ - j) <= 0.f);
}
}
}
TEST_F(GridCalculatorFixture, GetShiftCords) {
EXPECT_EQ(gcBig->getShiftCords(-18), Urho3D::IntVector2(-2, -2));
EXPECT_EQ(gcBig->getShiftCords(-17), Urho3D::IntVector2(-2, -1));
EXPECT_EQ(gcBig->getShiftCords(-16), Urho3D::IntVector2(-2, 0));
EXPECT_EQ(gcBig->getShiftCords(-15), Urho3D::IntVector2(-2, 1));
EXPECT_EQ(gcBig->getShiftCords(-14), Urho3D::IntVector2(-2, 2));
EXPECT_EQ(gcBig->getShiftCords(-10), Urho3D::IntVector2(-1, -2));
EXPECT_EQ(gcBig->getShiftCords(-9), Urho3D::IntVector2(-1, -1));
EXPECT_EQ(gcBig->getShiftCords(-8), Urho3D::IntVector2(-1, 0));
EXPECT_EQ(gcBig->getShiftCords(-7), Urho3D::IntVector2(-1, 1));
EXPECT_EQ(gcBig->getShiftCords(-6), Urho3D::IntVector2(-1, 2));
EXPECT_EQ(gcBig->getShiftCords(-2), Urho3D::IntVector2(0, -2));
EXPECT_EQ(gcBig->getShiftCords(-1), Urho3D::IntVector2(0, -1));
EXPECT_EQ(gcBig->getShiftCords(0), Urho3D::IntVector2(0, 0));
EXPECT_EQ(gcBig->getShiftCords(1), Urho3D::IntVector2(0, 1));
EXPECT_EQ(gcBig->getShiftCords(2), Urho3D::IntVector2(0, 2));
EXPECT_EQ(gcBig->getShiftCords(6), Urho3D::IntVector2(1, -2));
EXPECT_EQ(gcBig->getShiftCords(7), Urho3D::IntVector2(1, -1));
EXPECT_EQ(gcBig->getShiftCords(8), Urho3D::IntVector2(1, 0));
EXPECT_EQ(gcBig->getShiftCords(9), Urho3D::IntVector2(1, 1));
EXPECT_EQ(gcBig->getShiftCords(10), Urho3D::IntVector2(1, 2));
EXPECT_EQ(gcBig->getShiftCords(14), Urho3D::IntVector2(2, -2));
EXPECT_EQ(gcBig->getShiftCords(15), Urho3D::IntVector2(2, -1));
EXPECT_EQ(gcBig->getShiftCords(16), Urho3D::IntVector2(2, 0));
EXPECT_EQ(gcBig->getShiftCords(17), Urho3D::IntVector2(2, 1));
EXPECT_EQ(gcBig->getShiftCords(18), Urho3D::IntVector2(2, 2));
EXPECT_EQ(gcBig->getShiftCords(21), Urho3D::IntVector2(3, -3));
EXPECT_EQ(gcBig->getShiftCords(-21), Urho3D::IntVector2(-3, 3));
EXPECT_EQ(gcBig->getShiftCords(27), Urho3D::IntVector2(3, 3));
EXPECT_EQ(gcBig->getShiftCords(-27), Urho3D::IntVector2(-3, -3));
}
```
PlayersManager.h
```#pragma once
#include <vector>
constexpr char TEAMS_NUMBER = 3;
class ObjectsInfo;
class SceneSaver;
class Player;
struct NewGameForm;
struct NewGamePlayer;
struct dbload_player;
struct dbload_resource;
class PlayersManager {
public:
PlayersManager() = default;
~PlayersManager();
void load(std::vector<dbload_player*>* players, std::vector<dbload_resource*>* resources);
void addPlayer(NewGamePlayer& player);
void load(NewGameForm* form);
Player* getActivePlayer() const;
Player* getPlayer(short i);
std::vector<Player*>& getTeam(short i);
void changeActive(short i);
void save(SceneSaver& saver);
void update(const ObjectsInfo* simInfo);
char getActivePlayerID() const;
static char getEnemyFor(char player);
std::vector<Player*>& getAllPlayers();
private:
Player* activePlayer;
std::vector<Player*> allPlayers;
std::vector<Player*> teams[TEAMS_NUMBER];
};
```
OrderMaker.h
```#pragma once
#include <vector>
struct db_nation;
enum class UnitState : char;
class Player;
class Unit;
class Physical;
class Brain;
class OrderMaker {
public:
explicit OrderMaker(Player* player, db_nation* nation);
void semiCloseAttack(const std::vector<Unit*>& subArmy, const std::vector<Physical*>& things) const;
OrderMaker(const OrderMaker& rhs) = delete;
void action();
private:
std::vector<Unit*> findFreeWorkers() const;
Physical* closetInRange(Unit* worker, int resourceId);
void actCollect(unsigned char& resHistogram, char resId, std::vector<Unit*>& rest, std::vector<Unit*>& workers);
void collect(std::vector<Unit*>& freeWorkers);
Player* player;
Brain* whichResource;
Brain* attackOrDefence;
Brain* whereAttack;
Brain* whereDefence;
};
```
defines.h
```#pragma once
constexpr short UNITS_NUMBER = 100;
constexpr char MAX_PLAYERS = 2;
constexpr bool DEBUG_LINES_ENABLED = true;
constexpr unsigned char RESOURCES_SIZE = 4;```
UnitOrder.h
```#pragma once
#include <vector>
namespace Urho3D {
class Vector2;
}
class Physical;
class TargetAim;
struct ActionParameter;
enum class UnitAction : char;
class UnitOrder {
public:
UnitOrder(short id, bool append, Physical* toUse);
UnitOrder(short id, bool append, Urho3D::Vector2& vector);
virtual ~UnitOrder();
virtual void execute();
virtual bool expired() =0;
virtual bool add() =0;
virtual short getSize() const =0;
bool getAppend() const { return append; }
short getId() const { return id; }
short getToUseId() const;
protected:
Physical* toUse = nullptr; //TODO tu nadała by sie unia?
Urho3D::Vector2* vector = nullptr;
const short id;
const bool append;
ActionParameter getTargetAim(int startInx, Urho3D::Vector2& to);
ActionParameter getFollowAim(int startInx, const std::vector<int>& endIdxs);
ActionParameter getChargeAim(Urho3D::Vector2& charge);
private:
TargetAim* getTargetAimPtr(int startInx, const std::vector<int>& endIdxs) const;
TargetAim* getTargetAimPtr(int startInx, const Urho3D::Vector2& to) const;
TargetAim* getAimFromPath(const std::vector<int>* path) const;
virtual void addCollectAim() =0;
virtual void addTargetAim() =0;
virtual void addFollowAim() =0;
virtual void addChargeAim() =0;
virtual void addAttackAim() =0;
virtual void addDefendAim() =0;
virtual void addDeadAim() =0;
virtual void addStopAim() =0;
};
```
PlayersManager.cpp
```#include "PlayersManager.h"
#include "Player.h"
#include "hud/window/main_menu/new_game/NewGameForm.h"
#include "scene/load/dbload_container.h"
#include "scene/save/SceneSaver.h"
PlayersManager::~PlayersManager() {
clear_vector(allPlayers);
}
void PlayersManager::load(std::vector<dbload_player*>* players, std::vector<dbload_resource*>* resources) {
for (auto player : *players) {
auto newPlayer = new Player(player->nation, player->team, player->id, player->color, player->name,
player->is_active);
if (player->is_active) {
activePlayer = newPlayer;
}
allPlayers.push_back(newPlayer);
teams[player->team].push_back(newPlayer);
}
for (auto resource : *resources) {
for (auto player : allPlayers) {
if (player->getId() == resource->player) {
player->setResourceAmount(resource->resource, resource->amount);
}
}
}
}
void PlayersManager::addPlayer(NewGamePlayer& player) {
auto newPlayer = new Player(player.nation, player.team, player.id, player.color, player.name, player.active);
if (player.active) {
activePlayer = newPlayer;
}
allPlayers.push_back(newPlayer);
teams[player.team].push_back(newPlayer);
newPlayer->setResourceAmount(10000);
}
void PlayersManager::load(NewGameForm* form) {
for (auto& player : form->players) {
addPlayer(player);
}
}
Player* PlayersManager::getActivePlayer() const {
return activePlayer;
}
Player* PlayersManager::getPlayer(short i) {
return allPlayers.at(i);
}
std::vector<Player*>& PlayersManager::getTeam(short i) {
return teams[i];
}
void PlayersManager::changeActive(short i) {
activePlayer = allPlayers[i];
}
void PlayersManager::save(SceneSaver& saver) {
saver.savePlayers(allPlayers);
saver.saveResources(allPlayers);
}
void PlayersManager::update(const ObjectsInfo* simInfo) {
for (const auto player : allPlayers) {
player->updatePossession(simInfo);
player->updateResource();
player->resetScore();
}
}
char PlayersManager::getActivePlayerID() const {
return activePlayer->getId();
}
char PlayersManager::getEnemyFor(char player) {
if (player == 0) {//TODO bug do it better
return 1;
}
return 0;
}
std::vector<Player*>& PlayersManager::getAllPlayers() {
return allPlayers; //TODO bug id playera a jego index to często nie to samo
}
```
Controls.h
```#pragma once
#include <vector>
#include "ControlsState.h"
#include "MouseButton.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "HealthBarProvider.h"
#include "database/db_strcut.h"
#include "objects/building/Building.h"
enum class ActionType : char;
class SimInfo;
constexpr char MAX_DEPLOY_MARK_NUMBER = 5;
namespace Urho3D {
class StaticModel;
class Input;
class Vector3;
class Vector2;
class Node;
}
enum class BuildingActionType : char;
enum class ResourceActionType : char;
class HudData;
class ObjectsInfo;
class Physical;
class SelectedInfo;
class UnitOrder;
struct ActionParameter;
struct hit_data;
class Controls {
public:
explicit Controls(Urho3D::Input* _input);
~Controls();
void updateAdditionalInfo() const;
void setCircle(int i, Urho3D::Vector4 val) const;
void resetCircles() const;
void select(const std::vector<Physical*>* entities);
void selectOne(Physical* entity, char player);
void unSelectAll();
void toBuild(HudData* hud);
void order(short id, ActionType type);
void cleanMouse();
void deactivate();
void activate();
void unitOrder(short id);
void cleanAndUpdate(const SimInfo* simulationInfo);
void updateSelection() const;
void updateArrow() const;
void defaultControl();
void buildControl();
void orderControl();
void control();
const std::vector<Physical*>& getSelected() const { return selected; }
SelectedInfo* getInfo() const { return selectedInfo; }
private:
void executeOnUnits(short id) const;
void executeOnResources(ResourceActionType action) const;
void executeOnBuildings(BuildingActionType action, short id) const;
void unitFormation(short id) const;
void actionUnit(short id, ActionType type);
void refreshSelected();
bool conditionToClean(const SimInfo* simulationInfo) const;
void setCircleSight(int i, const Urho3D::Vector3& position, float radius, Urho3D::Color color) const;
bool clickDown(MouseButton& var) const;
void createBuilding(Urho3D::Vector2 pos) const;
void leftClick(hit_data& hitData);
void leftDoubleClick(hit_data& hitData);
void leftClickBuild(hit_data& hitData);
BuildingActionType getBuildingActionType(ActionType type);
UnitOrder* vectorOrder(UnitAction order, Urho3D::Vector2* vector, bool shiftPressed,
const std::vector<Physical*>& vec) const;
UnitOrder* thingOrder(UnitAction order, Physical* toUse, bool shiftPressed,
const std::vector<Physical*>& vec) const;
UnitAction chooseAction(hit_data& hitData) const;
UnitOrder* createUnitOrder(hit_data& hitData) const;
void rightClick(hit_data& hitData) const;
void leftHold(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& held);
void rightHold(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& held) const;
void releaseRight();
bool orderAction() const;
void releaseLeft();
void releaseBuildLeft();
void toDefault();
std::vector<Physical*> selected;
Urho3D::Input* input;
Urho3D::Node* deployMark[MAX_DEPLOY_MARK_NUMBER];
Urho3D::Node* arrowNode{};
Urho3D::Node* tempBuildingNode{};
SelectedInfo* selectedInfo{};
float clickDistance = 2 * 2;
short idToCreate = -1;
bool active = true;
ControlsState state = ControlsState::DEFAULT;
UnitAction unitOrderType = UnitAction::GO;
ObjectType typeToCreate;
MouseButton left;
MouseButton right;
};
```
SimpleQueueManager.cpp
```#include "SimpleQueueManager.h"
#include "QueueElement.h"
#include "QueueUtils.h"
SimpleQueueManager::~SimpleQueueManager() {
delete element;
}
void SimpleQueueManager::add(short number, QueueActionType type, short id, unsigned short localMaxCapacity) {
if (!element) {
element = new QueueElement(type, id, 1, getSecToComplete(type, id, 0),
getSecPerInstance(type, id, 0));
element->add(number);
}
}
QueueElement* SimpleQueueManager::update() {
if (element) {
if (element->getAmount() <= 0) {
delete element;
element = nullptr;
}
}
if (element) {
if (element->update()) {
auto el = element;
element = nullptr;
return el;
}
}
return nullptr;
}
short SimpleQueueManager::getSize() const {
return element == nullptr ? 0 : 1;
}
QueueElement* SimpleQueueManager::getAt(short i) {
if (getSize() == 1 && i == 0) {
return element;
}
return nullptr;
}
```
Environment.h
```#pragma once
#include <functional>
#include <Urho3D/Math/Vector2.h>
#include <Urho3D/Math/Vector3.h>
#include "GridCalculator.h"
#include "bucket/Grid.h"
#include "bucket/MainGrid.h"
#include "bucket/StaticGrid.h"
#include "debug/EnvironmentDebugMode.h"
#include "influence/InfluenceManager.h"
enum class CenterType:char;
struct db_building;
namespace Urho3D {
class Terrain;
}
struct content_info;
class ResourceEntity;
class Unit;
class Building;
enum class OperatorType : char;
class Environment {
public:
explicit Environment(Urho3D::Terrain* terrain, unsigned short mainMapResolution);
~Environment();
std::vector<Physical*>* getNeighboursFromSparseSamePlayer(Physical* physical, float radius, char player);
std::vector<Physical*>* getNeighboursFromTeamNotEq(Physical* physical, float radius);
std::vector<Physical*>* getNeighboursWithCache(Unit* unit, float radius);
const std::vector<Physical*>* getNeighboursSimilarAs(Physical* clicked) const;
//std::vector<Physical*>* getResources(Physical* physical, float radius);
std::vector<Physical*>* getResources(const Urho3D::Vector3& center, int id, float radius, float prevRadius);
std::vector<Physical*>* getResources(const Urho3D::Vector3& center, int id, float radius);
std::vector<Physical*>* getBuildingsFromTeamNotEq(Physical* physical, int id, float radius);
void updateInfluenceUnits1(std::vector<Unit*>* units) const;
void updateInfluenceUnits2(std::vector<Unit*>* units) const;
void updateInfluenceResources(std::vector<ResourceEntity*>* resources) const;
void updateInfluenceOther(std::vector<Building*>* buildings, std::vector<Unit*>* units) const;
void updateQuadOther() const;
void updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units,
std::vector<ResourceEntity*>* resources) const;
void invalidateCaches();
void update(Unit* unit) const;
void addNew(const std::vector<Unit*>& units);
void addNew(Building* building);
void addNew(ResourceEntity* resource, bool bulkAdd);
void removeFromGrids(const std::vector<Unit*>& units) const;
void removeFromGrids(const std::vector<Building*>& buildingsToDispose,
const std::vector<ResourceEntity*>& resourceToDispose) const;
Urho3D::Vector2 repulseObstacle(Unit* unit) const;
std::optional<Urho3D::Vector2> validatePosition(int index, const Urho3D::Vector3& position) const;
const std::vector<Physical*>* getNeighbours(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& pair, char player);
float getGroundHeightAt(float x, float z) const;
float getGroundHeightAt(const Urho3D::Vector3& pos) const;
Urho3D::Vector3 getPosWithHeightAt(float x, float z) const;
Urho3D::Vector3 getPosWithHeightAt(int index) const;
float getGroundHeightPercentScaled(float x, float z, float div) const;
bool validateStatic(const Urho3D::IntVector2& size, Urho3D::Vector2& pos, bool isBuilding) const;
bool validateStatic(const Urho3D::IntVector2& size, const Urho3D::IntVector2 bucketCords, bool isBuilding) const;
Urho3D::Vector2 getValidPosition(const Urho3D::IntVector2& size, const Urho3D::Vector2& pos) const;
Urho3D::Vector2 getValidPosition(const Urho3D::IntVector2& size, const Urho3D::IntVector2& bucketCords) const;
const std::vector<int>* findPath(int startIdx, const Urho3D::Vector2& aim);
const std::vector<int>* findPath(int startIdx, const std::vector<int>& endIdxs);
const std::vector<int>* findPath(int startIdx, int endIdx, int limit);
void prepareGridToFind() const;
content_info* getContentInfo(Urho3D::Vector2 centerPercent, bool checks[], int activePlayer);
Urho3D::Vector2 getPosFromPercent(float x, float z) const;
Physical* closestPhysical(Unit* unit, const std::vector<Physical*>* things,
const std::function<bool(Physical*)>& condition, int limit);
Physical* closestPhysicalSimple(const Physical* physical, const std::vector<Physical*>* things, float range) const;
Urho3D::Vector2 getCenter(int index) const;
Urho3D::Vector2 getCenter(short x, short z) const;
Urho3D::Vector2 getPositionInBucket(Unit* unit) const;
void invalidatePathCache();
int getIndex(Urho3D::Vector2& pos) const { return calculator->indexFromPosition(pos); }
int getIndex(short x, short z) const { return calculator->getIndex(x, z); }
Urho3D::IntVector2 getCords(int index) const { return calculator->getIndexes(index); }
Urho3D::IntVector2 getCords(const Urho3D::Vector2& pos) {
return calculator->getIndexes(calculator->indexFromPosition(pos));
}
bool cellInState(int index, CellState state) const;
void updateCell(int index, char val, CellState cellState) const;
unsigned char getRevertCloseIndex(int center, int gridIndex) const;
bool isInLocalArea(int getMainCell, int aimIndex) const;
bool isInLocal1and2Area(int getMainCell, int aimIndex) const;
int closestPassableCell(int posIndex) const;
void drawDebug(EnvironmentDebugMode environmentDebugMode, char index);
const std::vector<short>& getCloseIndexs(int center) const;
const std::vector<unsigned char>& getCloseTabIndexes(int center) const;
std::array<float, 5>& getInfluenceDataAt(char player, const Urho3D::Vector2& pos);
std::optional<Urho3D::Vector2> getPosFromIndexes(db_building* building, char player, const std::vector<int>* indexes);
std::optional<Urho3D::Vector2> getPosToCreate(const std::span<float> result, ParentBuildingType type,
db_building* building, char player);
std::optional<Urho3D::Vector2> getPosToCreateResBonus(db_building* building, char player);
std::vector<Urho3D::Vector2> getAreas(char player, const std::span<float>, int min);
void addCollect(Unit* unit, char resId, float value);
void addAttack(char player, const Urho3D::Vector3& position, float value);
void drawInfluence();
bool cellIsPassable(int index) const;
bool cellIsCollectable(int index) const;
bool cellIsAttackable(int index) const;
std::optional<Urho3D::Vector2> getCenterOf(CenterType type, char player);
float getDiffOfCenters(CenterType type1, char id1, CenterType type2, char id2, float dfVal);
bool anyCloseEnough(std::vector<int> const& indexes, int center, float distThreshold) const;
short getResolution() const { return calculator->getResolution(); }
bool isVisible(char player, const Urho3D::Vector2& pos) const;
float getVisibilityScore(char player) const;
std::vector<int> getIndexesInRange(const Urho3D::Vector3& center, float range) const;
Urho3D::Terrain* getTerrain() { return terrain; }
void setTerrainShaderParam(const Urho3D::String& name, const Urho3D::Variant& value) const;
void flipTerrainShaderParam(const Urho3D::String& name) const;
void nextVisibilityType();
void reAddBonuses(std::vector<Building*>* buildings, char player, char resId) const;
float getBonuses(char player, const ResourceEntity* resource) const;
private:
//std::vector<Physical*>* getNeighbours(Physical* physical, Grid& bucketGrid, float radius) const;
std::vector<Physical*>* getNeighbours(Physical* physical, Grid& bucketGrid, float radius,
const std::function<bool(Physical*)>& condition) const;
std::vector<Physical*>* getNeighbours(const Urho3D::Vector3& center, Grid& bucketGrid, int id, float radius,
float prevRadius) const;
void addIfInRange(Physical* physical, Physical* neight, const float sqRadius,
const std::function<bool(Physical*)>& condition) const;
float getPosFromPercent(float value) const;
float mapSize;
MainGrid mainGrid;
Grid buildingGrid;
StaticGrid resourceStaticGrid;
Grid sparseUnitGrid;
Urho3D::Terrain* terrain;
InfluenceManager influenceManager;
Grid* grids[3] = {&mainGrid, &buildingGrid, &resourceStaticGrid};
GridCalculator* calculator;
std::vector<Physical*>* neights;
};
```
MySprite.h
```#pragma once
#include <Urho3D/UI/Sprite.h>
class MySprite : public Urho3D::Sprite {
URHO3D_OBJECT(MySprite, Sprite)
explicit MySprite(Urho3D::Context* context);
~MySprite() override = default;
static void RegisterObject(Urho3D::Context* context);
const Urho3D::Vector2& getPercentHotSpot() const { return percentHotspot; }
const Urho3D::IntVector2& getMySize() const { return mySize; }
private:
Urho3D::Vector2 percentHotspot;
Urho3D::IntVector2 mySize;
};
```
InfluenceMap.h
```#pragma once
#include "InfluenceMapI.h"
#include "env/GridCalculator.h"
struct GridCalculator;
class Physical;
class InfluenceMap : public InfluenceMapI {
public:
InfluenceMap(unsigned short resolution, float size, float valueThresholdDebug);
virtual ~InfluenceMap() = default;
virtual float getValueAt(int index) const =0;
virtual void computeMinMax() = 0;
virtual void ensureReady() = 0;
void draw(short batch, short maxParts);
Urho3D::Vector3 getVertex(const Urho3D::Vector2 center, Urho3D::Vector2 vertex) const;
void drawCell(int index, short batch) const;
Urho3D::Vector2 getCenter(int index) const;
float getFieldSize() const;
virtual float getValueAsPercent(const Urho3D::Vector2& pos) const =0;
virtual float getValueAsPercent(const int index) const =0;
void print(Urho3D::String name) override;
unsigned short getResolution() const override { return calculator->getResolution(); }
Urho3D::Vector2 getCenter(int index) override { return calculator->getCenter(index); }
protected:
GridCalculator* calculator;
unsigned int arraySize;
const float valueThresholdDebug;
float min;
float max;
int minIdx;
int maxIdx;
unsigned short counter = 0;
bool minMaxInited = false;
};
```
QueueHudElement.h
```#pragma once
#include <Urho3D/Core/Variant.h>
namespace Urho3D {
class Text;
class ProgressBar;
class Texture2D;
class String;
class XMLFile;
class UIElement;
class Button;
}
class QueueElement;
class MySprite;
class QueueHudElement {
public:
explicit QueueHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style);
~QueueHudElement() = default;
Urho3D::Button* getButton() const;
void hide() const;
void show() const;
void setText(const Urho3D::String& msg) const;
void hideText() const;
void setTexture(Urho3D::Texture2D* texture) const;
void setProgress(float progress) const;
void setData(QueueElement* _element);
void reduce(short amount) const;
static QueueHudElement* getFromElement(Urho3D::VariantMap& eventData);
private:
Urho3D::Button* button;
MySprite* icon;
Urho3D::ProgressBar* bar;
Urho3D::Text* text;
QueueElement* element;
};
```
FileUtils.h
```#pragma once
#include <fstream>
#include <string>
#include <vector>
inline void loadLines(const std::string& path, std::vector<std::string>& lines) {
std::ifstream infile(path, std::fstream::in);
std::string data;
lines.clear();
while (std::getline(infile, data)) {
lines.push_back(data);
}
infile.close();
}
```
NewGameTeamLine.h
```#pragma once
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/Resource/JSONFile.h>
#include <Urho3D/UI/CheckBox.h>
#include <Urho3D/UI/DropDownList.h>
#include <Urho3D/UI/LineEdit.h>
#include "NewGamePlayer.h"
#include "database/DatabaseCache.h"
#include "database/db_other_struct.h"
#include "hud/UiUtils.h"
#include "math/RandGen.h"
namespace Urho3D { class BorderImage; }
namespace Urho3D { class Localization; }
namespace Urho3D { class XMLFile; }
struct NewGameTeamLine {
NewGameTeamLine() = default;
NewGameTeamLine(const NewGameTeamLine&) = delete;
Urho3D::LineEdit* lineEdit;
Urho3D::DropDownList* nation;
Urho3D::DropDownList* color;
Urho3D::DropDownList* team;
Urho3D::CheckBox* chk;
Urho3D::XMLFile* style;
Urho3D::Localization* l10n;
int id;
void init(Urho3D::XMLFile* style, Urho3D::Localization* l10n, int id) {
this->style = style;
this->l10n = l10n;
this->id = id;
}
void populateTeams(Urho3D::BorderImage* row) {
lineEdit = createElement<Urho3D::LineEdit>(row, style, "LineEdit");
auto names = Game::getCache()->GetResource<Urho3D::JSONFile>("lang/names.json");
auto namesArray = names->GetRoot().Get("player_names").GetArray();
lineEdit->SetText(namesArray.At(RandGen::nextRand(RandIntType::PLAYER_NAME, namesArray.Size())).GetCString());
team = createElement<Urho3D::DropDownList>(row, style, "MainMenuNewGameDropDownList");
addChildTexts(team, {l10n->Get("1"), l10n->Get("2")}, style);
nation = createElement<Urho3D::DropDownList>(row, style, "MainMenuNewGameDropDownList");
for (auto dbNation : Game::getDatabase()->getNations()) {
if (dbNation) {
addTextItem(nation, l10n->Get("nation_" + dbNation->name), style);
}
}
color = createElement<Urho3D::DropDownList>(row, style, "MainMenuNewGameDropDownList");
for (auto playerColor : Game::getDatabase()->getPlayerColors()) {
if (playerColor) {
addTextItem(color, l10n->Get("color_" + playerColor->name), style);
}
}
chk = createElement<Urho3D::CheckBox>(row, style, "CheckBox");
}
NewGamePlayer getNewGamePlayer() const {
NewGamePlayer player;
player.name = lineEdit->GetText();
player.color = color->GetSelection();
player.nation = nation->GetSelection();
player.team = team->GetSelection();
player.id = id;
player.active = chk->IsChecked();
return player;
}
Urho3D::CheckBox* getCheckBox() const {
return chk;
}
void setCheck(bool check) const {
chk->SetChecked(check);
}
};
```
Grid.cpp
```#include "Grid.h"
#include "Bucket.h"
#include "levels/LevelCache.h"
#include "levels/LevelCacheProvider.h"
#include "objects/unit/Unit.h"
#include "env/CloseIndexes.h"
#include "env/CloseIndexesProvider.h"
#include "env/ContentInfo.h"
#include "env/GridCalculator.h"
#include "env/GridCalculatorProvider.h"
#include "utils/consts.h"
Grid::Grid(short resolution, float size, bool initCords, float maxQueryRadius)
: calculator(GridCalculatorProvider::get(resolution, size)),
levelCache(LevelCacheProvider::get(resolution, initCords, maxQueryRadius, calculator)),
closeIndexes(CloseIndexesProvider::get(resolution)),
sqResolution(resolution * resolution) {
buckets = new Bucket[sqResolution];
tempSelected = new std::vector<Physical*>();
}
Grid::~Grid() {
delete[] buckets;
delete tempSelected;
}
int Grid::update(Physical* physical, int currentIndex) const {
assert(!physical->isToDispose());
const int index = calculator->indexFromPosition(physical->getPosition());
if (currentIndex != index) {
removeAt(currentIndex, physical);
addAt(index, physical);
return index;
}
return -1;
}
int Grid::updateNew(Physical* physical) const {
//assert(physical->getMainGridIndex(), -1);
const int index = calculator->indexFromPosition(physical->getPosition());
addAt(index, physical);
return index;
}
BucketIterator& Grid::getArrayNeight(const Urho3D::Vector3& position, float radius) {
return *iterator.init(levelCache->get(radius), calculator->indexFromPosition(position), this);
}
BucketIterator& Grid::getArrayNeight(int center, float radius) {
return *iterator.init(levelCache->get(radius), center, this);
}
const std::vector<short>& Grid::getCloseIndexes(int center) const {
return closeIndexes->get(center);
}
const std::vector<unsigned char>& Grid::getCloseTabIndexes(int center) const {
return closeIndexes->getTabIndexes(center);
}
bool Grid::onlyOneInside(int index) const {
return buckets[index].getSize() == 1;
}
void Grid::removeAt(int index, Physical* entity) const {
assert(index >= 0);
if (calculator->isValidIndex(index)) {
buckets[index].remove(entity);
}
}
void Grid::remove(Physical* physical) const {
auto index = calculator->indexFromPosition(physical->getPosition());
buckets[index].remove(physical);
}
void Grid::addAt(int index, Physical* entity) const {
buckets[index].add(entity);
}
const std::vector<Physical*>& Grid::getContentAt(int index) const {
//TODO bug jezeli jest skrajne to bierze z drugiego konca
if (calculator->isValidIndex(index)) {
return buckets[index].getContent();
}
return Consts::EMPTY_PHYSICAL;
}
const std::vector<Physical*>& Grid::getNotSafeContentAt(short x, short z) const {
return buckets[calculator->getNotSafeIndex(x, z)].getContent();
}
std::vector<Physical*>* Grid::getArrayNeight(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& pair,
const char player) {
invalidateCache();
const auto posBeginX = calculator->getIndex(std::min(pair.first->x_, pair.second->x_));
const auto posEndX = calculator->getIndex(std::max(pair.first->x_, pair.second->x_));
const auto posBeginZ = calculator->getIndex(std::min(pair.first->z_, pair.second->z_));
const auto posEndZ = calculator->getIndex(std::max(pair.first->z_, pair.second->z_));
for (short i = posBeginX; i <= posEndX; ++i) {
for (short j = posBeginZ; j <= posEndZ; ++j) {
const auto& content = getNotSafeContentAt(i, j);
std::ranges::copy_if(content, std::back_inserter(*tempSelected),
[player](Physical* p) { return (p->getPlayer() < 0 || p->getPlayer() == player) && p->isAlive(); });
}
}
return tempSelected;
}
std::vector<int> Grid::getCloseCenters(Urho3D::Vector2& center, float radius) const {
//TODO clean prawie to samo co wyżej
radius *= calculator->getFieldSize();
radius *= 0.5;
radius -= 0.1;
const auto posBeginX = calculator->getIndex(center.x_ - radius);
const auto posBeginZ = calculator->getIndex(center.y_ - radius);
const auto posEndX = calculator->getIndex(center.x_ + radius);
const auto posEndZ = calculator->getIndex(center.y_ + radius);
std::vector<int> indexes; //TODO performance
indexes.reserve((abs(posEndX - posBeginX) + 1) * (abs(posEndZ - posBeginZ) + 1));
for (short i = posBeginX; i <= posEndX; ++i) {
for (short j = posBeginZ; j <= posEndZ; ++j) {
indexes.push_back(calculator->getNotSafeIndex(i, j));
}
}
return indexes;
}
void Grid::invalidateCache() {
invalidateCache(-1, -1.f);
}
void Grid::invalidateCache(int currentIdx, float radius) {
tempSelected->clear();
prevIndex = currentIdx;
prevRadius = radius;
}
std::vector<Physical*>* Grid::getArrayNeightSimilarAs(Physical* clicked, float radius) {
//TODO clean prawie to samo co wyżej
invalidateCache();
const auto posBeginX = calculator->getIndex(clicked->getPosition().x_ - radius);
const auto posBeginZ = calculator->getIndex(clicked->getPosition().z_ - radius);
const auto posEndX = calculator->getIndex(clicked->getPosition().x_ + radius);
const auto posEndZ = calculator->getIndex(clicked->getPosition().z_ + radius);
for (short i = posBeginX; i <= posEndX; ++i) {
for (short j = posBeginZ; j <= posEndZ; ++j) {
auto& content = getNotSafeContentAt(i, j);
std::ranges::copy_if(content, std::back_inserter(*tempSelected),
[clicked](Physical* p) {
return p->getId() == clicked->getId() && p->getPlayer() == clicked->getPlayer() && p->isAlive();
});
}
}
return tempSelected;
}
std::vector<Physical*>* Grid::getAllFromCache(int currentIdx, float radius) {
if (currentIdx == prevIndex && radius == prevRadius) {
return tempSelected;
}
return getAll(currentIdx, radius);
}
std::vector<Physical*>* Grid::getAll(int currentIdx, float radius) {
invalidateCache(currentIdx, radius);
for (auto level : *levelCache->get(radius)) {
auto& content = getContentAt(level + currentIdx);
tempSelected->insert(tempSelected->end(), content.begin(), content.end());
}
return tempSelected;
}
```
GroupOrder.cpp
```#include "GroupOrder.h"
#include <utility>
#include "FormationOrder.h"
#include "Game.h"
#include "enums/UnitActionType.h"
#include "objects/unit/GroupUtils.h"
#include "objects/unit/Unit.h"
#include "simulation/formation/FormationManager.h"
GroupOrder::GroupOrder(const std::vector<Physical*>& entities, UnitActionType actionType, short id,
Physical* toUse, bool append)
: UnitOrder(id, append, toUse), actionType(actionType) {
addUnits(entities);
}
GroupOrder::GroupOrder(const std::vector<Physical*>& entities, UnitActionType actionType, short id,
Urho3D::Vector2 vector, bool append)
: UnitOrder(id, append, vector), actionType(actionType) {
addUnits(entities);
}
GroupOrder::GroupOrder(std::vector<Unit*> entities, UnitActionType actionType, short id,
Urho3D::Vector2 vector, bool append)
: UnitOrder(id, append, vector), actionType(actionType),
units(std::move(entities)) {
}
GroupOrder::GroupOrder(std::vector<Unit*> entities, UnitActionType actionType, short id, Physical* toUse, bool append)
: UnitOrder(id, append, toUse), actionType(actionType),
units(std::move(entities)) {
}
void GroupOrder::addUnits(const std::vector<Physical*>& entities) {
units.reserve(entities.size());
for (const auto unit : entities) {
this->units.emplace_back(reinterpret_cast<Unit*>(unit));
}
}
bool GroupOrder::add() {
switch (actionType) {
case UnitActionType::ORDER:
execute();
break;
case UnitActionType::FORMATION: {
}
break;
default: ;
}
return true;
}
void GroupOrder::addCollectAim() {
transformToFormationOrder();
}
void GroupOrder::addTargetAim() {
transformToFormationOrder();
}
void GroupOrder::addFollowAim() {
transformToFormationOrder();
}
void GroupOrder::addChargeAim() {
transformToFormationOrder();
}
void GroupOrder::addAttackAim() {
transformToFormationOrder();
}
void GroupOrder::addDefendAim() {
simpleAction();
}
void GroupOrder::addDeadAim() {
simpleAction();
}
void GroupOrder::addStopAim() {
simpleAction();
}
void GroupOrder::simpleAction(ActionParameter& parameter) const {
const auto action = static_cast<UnitAction>(id);
for (auto* unit : units) {
unit->action(action, parameter);
}
}
void GroupOrder::simpleAction() const {
const auto action = static_cast<UnitAction>(id);
for (auto* unit : units) {
unit->action(action);
}
}
void GroupOrder::actOnFormation(std::vector<Unit*>& group) const {
auto opt = Game::getFormationManager()->createFormation(group);
if (opt.has_value()) {
if (vector) {
opt.value()->addOrder(new FormationOrder(opt.value(), id, *vector, append));
} else {
opt.value()->addOrder(new FormationOrder(opt.value(), id, toUse, append));
}
}
}
void GroupOrder::transformToFormationOrder() const {
for (auto& group : divide(units)) {
actOnFormation(group);
}
}
bool GroupOrder::expired() {
return units.empty()
|| toUse != nullptr && !toUse->isAlive();
}
short GroupOrder::getSize() const {
return units.size();
}
```
UnitActionCommand.cpp
```#include "UnitActionCommand.h"
#include "objects/unit/order/UnitOrder.h"
UnitActionCommand::UnitActionCommand(UnitOrder* order, char player)
: AbstractCommand(player),
order(order) {}
void UnitActionCommand::execute() {
const bool ifRemove = order->add();
if (ifRemove) {
delete order;
order = nullptr;
}
}
```
TopPanel.h
```#pragma once
#include "../SimplePanel.h"
#include "utils/defines.h"
namespace Urho3D { class XMLFile; }
class TopInfoPanel;
class Player;
class TopHudElement;
class TopPanel : public SimplePanel {
public:
explicit TopPanel(Urho3D::UIElement* root, Urho3D::XMLFile* style);
~TopPanel();
void update(Player * player) const;
void setVisible(bool enable) override;
private:
void createBody() override;
TopHudElement* elements[RESOURCES_SIZE];
TopHudElement* units;
TopHudElement* workers;
TopHudElement* name;
TopInfoPanel* infoPanel;
};
```
InfluenceMapFloat.cpp
```#include "InfluenceMapFloat.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include "math/MathUtils.h"
#include "objects/Physical.h"
#include "env/Environment.h"
InfluenceMapFloat::
InfluenceMapFloat(unsigned short resolution, float size, float coef, char level, float valueThresholdDebug):
InfluenceMap(resolution, size, valueThresholdDebug),
coef(coef),
level(level) {
levelRes = level * 2 + 1;
values = new float[arraySize];
tempVals = new float[arraySize];
templateV = new float[levelRes * levelRes];
std::fill_n(values, arraySize, 0.f);
std::fill_n(tempVals, arraySize, 0.f);
auto* ptr = templateV;
for (short i = -level; i <= level; ++i) {
const auto a = i * i;
for (short j = -level; j <= level; ++j) {
const auto b = j * j;
*(ptr++) = 1 / ((a + b) * coef + 1.f);
}
}
assert(level > 0);
}
InfluenceMapFloat::~InfluenceMapFloat() {
delete[] values;
delete[] tempVals;
delete[] templateV;
}
void InfluenceMapFloat::update(Physical* thing, float value) {
assert(false);
auto& pos = thing->getPosition();
update(value, calculator->getIndex(pos.x_), calculator->getIndex(pos.z_));
}
void InfluenceMapFloat::updateInt(Physical* thing, int value) {
assert(false);
}
void InfluenceMapFloat::tempUpdate(const Urho3D::Vector3& pos, float value) {
tempUpdate(calculator->indexFromPosition(pos), value);
}
void InfluenceMapFloat::tempUpdate(int index, float value) {
tempVals[index] += value;
valuesCalculateNeeded = true;
}
void InfluenceMapFloat::update(int index, float value) const {
auto [centerX, centerZ] = calculator->getIndexes(index);
update(value, centerX, centerZ);
}
void InfluenceMapFloat::update(float value, const unsigned short centerX, const unsigned short centerZ) const {
const auto minI = calculator->getValidLow(centerX - level);
const auto maxI = calculator->getValidHigh(centerX + level);
const auto minJ = calculator->getValidLow(centerZ - level);
const auto maxJ = calculator->getValidHigh(centerZ + level);
const auto jStart = (minJ - centerZ + level);
for (short i = minI; i <= maxI; ++i) {
const int index = calculator->getNotSafeIndex(i, minJ);
auto* t = &values[index];
auto idx = (i - centerX + level) * levelRes + jStart;
auto ptr = templateV + idx;
for (short j = minJ; j <= maxJ; ++j) {
*(t++) += value * *(ptr++);
}
}
}
void InfluenceMapFloat::reset() {
minMaxInited = false;
std::fill_n(values, arraySize, 0.f);
}
float InfluenceMapFloat::getValueAt(int index) const {
assert(!valuesCalculateNeeded);
return values[index];
}
float InfluenceMapFloat::getValueAt(const Urho3D::Vector2& pos) const {
assert(!valuesCalculateNeeded);
return getValueAt(calculator->indexFromPosition(pos));
}
float InfluenceMapFloat::getValueAsPercent(const Urho3D::Vector2& pos) const {
assert(minMaxInited);
assert(!valuesCalculateNeeded);
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(pos) - min) / diff;
}
return 0.5f;
}
float InfluenceMapFloat::getValueAsPercent(int index) const {
assert(minMaxInited);
assert(!valuesCalculateNeeded);
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(index) - min) / diff;
}
return 0.5f;
}
void InfluenceMapFloat::computeMinMax() {
assert(!valuesCalculateNeeded);
if (!minMaxInited) {
const auto [minPtr, maxPtr] = std::minmax_element(values, values + arraySize);
min = *minPtr;
max = *maxPtr;
minIdx = std::distance(values, minPtr);
maxIdx = std::distance(values, maxPtr);
minMaxInited = true;
}
}
void InfluenceMapFloat::ensureReady() {
updateFromTemp();
computeMinMax();
}
std::vector<int> InfluenceMapFloat::getIndexesWithByValue(float percent, float tolerance) {
const float diff = max - min;
auto minV = diff * (percent - tolerance) + min;
auto maxV = diff * (percent + tolerance) + min;
float* iter = values;
std::vector<int> indexes;
indexes.reserve(16);
auto pred = [minV,maxV](float i) { return i >= minV && i <= maxV; };
while ((iter = std::find_if(iter, values + arraySize, pred)) != values + arraySize) {
//TODO performance!!!
indexes.push_back(iter - values);
++iter;
}
return indexes; //TODO should stay sorted
}
bool InfluenceMapFloat::cumulateErros(float percent, float* intersection) const {
assert(minMaxInited);
assert(!valuesCalculateNeeded);
const float diff = max - min;
if (diff != 0.f) {
percent = fixValue(percent, 1.f);
//const auto centerVal = percent * diff + min;
const auto invDiff = 1.f / diff;
const auto endV = values + arraySize;
constexpr auto maxVal = std::numeric_limits<float>::max() - 1.f;
for (auto ptrV = values; ptrV < endV; ++ptrV, ++intersection) {
if (*intersection < maxVal) {
float val = percent < 0.f ? *ptrV - min : max - *ptrV;
val *= invDiff * percent;
*intersection += val * val;
}
}
return true;
}
return false;
}
void InfluenceMapFloat::updateFromTemp() {
if (valuesCalculateNeeded) {
for (int i = 0; i < arraySize; ++i) {
const auto val = tempVals[i];
if (val > 0.f) {
update(i, val);
}
}
std::fill_n(tempVals, arraySize, 0.f);
valuesCalculateNeeded = false;
}
}
```
InfluenceManager.cpp
```#include "InfluenceManager.h"
#include <exprtk/exprtk.hpp>
#include "MapsUtils.h"
#include "VisibilityManager.h"
#include "map/InfluenceMapHistory.h"
#include "map/InfluenceMapQuad.h"
#include "debug/DebugLineRepo.h"
#include "map/InfluenceMapInt.h"
#include "math/VectorUtils.h"
#include "objects/CellState.h"
#include "objects/building/Building.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/unit/Unit.h"
#include "env/ContentInfo.h"
#include "env/GridCalculatorProvider.h"
#include "utils/AssertUtils.h"
#include "utils/OtherUtils.h"
InfluenceManager::InfluenceManager(char numberOfPlayers, float mapSize, Urho3D::Terrain* terrain) {
unitsNumberPerPlayer.reserve(numberOfPlayers);
buildingsInfluencePerPlayer.reserve(numberOfPlayers);
unitsInfluencePerPlayer.reserve(numberOfPlayers);
foodGatherSpeed.reserve(numberOfPlayers);
woodGatherSpeed.reserve(numberOfPlayers);
stoneGatherSpeed.reserve(numberOfPlayers);
goldGatherSpeed.reserve(numberOfPlayers);
foodNotInBonus.reserve(numberOfPlayers);
woodNotInBonus.reserve(numberOfPlayers);
stoneNotInBonus.reserve(numberOfPlayers);
goldNotInBonus.reserve(numberOfPlayers);
attackSpeed.reserve(numberOfPlayers);
armyQuad.reserve(numberOfPlayers);
buildingsQuad.reserve(numberOfPlayers);
econQuad.reserve(numberOfPlayers);
mapsForAiArmyPerPlayer.reserve(numberOfPlayers);
mapsForAiPerPlayer.reserve(numberOfPlayers);
mapsForCentersPerPlayer.reserve(numberOfPlayers);
unsigned short resolution = mapSize / INF_GRID_FIELD_SIZE;
for (int player = 0; player < numberOfPlayers; ++player) {
unitsNumberPerPlayer.emplace_back(new InfluenceMapInt(resolution, mapSize, 40));
buildingsInfluencePerPlayer.emplace_back(
new InfluenceMapFloat(resolution, mapSize, 0.5f, INF_LEVEL, 2));
unitsInfluencePerPlayer.emplace_back(
new InfluenceMapFloat(resolution, mapSize, 0.5f, INF_LEVEL, 40));
foodGatherSpeed.emplace_back(new InfluenceMapHistory(resolution, mapSize, 0.5f, INF_LEVEL, 0.0001f, 0.5f, 40));
woodGatherSpeed.emplace_back(new InfluenceMapHistory(resolution, mapSize, 0.5f, INF_LEVEL, 0.0001f, 0.5f, 40));
stoneGatherSpeed.emplace_back(new InfluenceMapHistory(resolution, mapSize, 0.5f, INF_LEVEL, 0.0001f, 0.5f, 40));
goldGatherSpeed.emplace_back(new InfluenceMapHistory(resolution, mapSize, 0.5f, INF_LEVEL, 0.0001f, 0.5f, 40));
foodNotInBonus.emplace_back(new InfluenceMapInt(resolution, mapSize, 5));
woodNotInBonus.emplace_back(new InfluenceMapInt(resolution, mapSize, 5));
stoneNotInBonus.emplace_back(new InfluenceMapInt(resolution, mapSize, 5));
goldNotInBonus.emplace_back(new InfluenceMapInt(resolution, mapSize, 5));
attackSpeed.emplace_back(new InfluenceMapHistory(resolution, mapSize, 0.5f, INF_LEVEL, 0.0001f, 0.5f, 40));
armyQuad.emplace_back(new InfluenceMapQuad(resolution, mapSize));
buildingsQuad.emplace_back(new InfluenceMapQuad(resolution, mapSize));
econQuad.emplace_back(new InfluenceMapQuad(mapSize / INF_GRID_FIELD_SIZE, mapSize));
}
resourceInfluence = new InfluenceMapFloat(resolution, mapSize, 0.5f, INF_LEVEL, 40);
for (int player = 0; player < numberOfPlayers; ++player) {
mapsForAiPerPlayer.emplace_back(std::array<InfluenceMapFloat*, 8>{
buildingsInfluencePerPlayer[player],
unitsInfluencePerPlayer[player],
resourceInfluence, //TODO czy to jest ważne?
attackSpeed[player],
foodGatherSpeed[player],
woodGatherSpeed[player],
stoneGatherSpeed[player],
goldGatherSpeed[player],
});
mapsForAiArmyPerPlayer.emplace_back(std::array<InfluenceMapFloat*, 3>{
buildingsInfluencePerPlayer[player],
unitsInfluencePerPlayer[player],
attackSpeed[player],
});
mapsForCentersPerPlayer.emplace_back(std::array<InfluenceMapQuad*, 3>{
econQuad[player],
buildingsQuad[player],
armyQuad[player]
});
mapsGatherSpeedPerPlayer.emplace_back(std::array<InfluenceMapFloat*, 4>{
foodGatherSpeed[player],
woodGatherSpeed[player],
stoneGatherSpeed[player],
goldGatherSpeed[player],
});
mapsResNotInBonusPerPlayer.emplace_back(std::array<InfluenceMapInt*, 4>{
foodNotInBonus[player],
woodNotInBonus[player],
stoneNotInBonus[player],
goldNotInBonus[player],
});
assert(validSizes(mapsForAiPerPlayer.at(player)));
}
visibilityManager = new VisibilityManager(numberOfPlayers, mapSize, terrain);
calculator = GridCalculatorProvider::get(resolution, mapSize);
ci = new content_info();
DebugLineRepo::init(DebugLineType::INFLUENCE, MAX_DEBUG_PARTS_INFLUENCE);
arraySize = calculator->getResolution() * calculator->getResolution();
assert(arraySize <= std::numeric_limits<unsigned short>::max());
intersection = new float[arraySize];
tempIndexes = new std::vector<int>();
assert(unitsNumberPerPlayer[0]->getResolution() == unitsInfluencePerPlayer[0]->getResolution()
&& calculator->getResolution() == unitsNumberPerPlayer[0]->getResolution());
}
InfluenceManager::~InfluenceManager() {
clear_vector(unitsNumberPerPlayer);
clear_vector(buildingsInfluencePerPlayer);
clear_vector(unitsInfluencePerPlayer);
clear_vector(foodGatherSpeed);
clear_vector(woodGatherSpeed);
clear_vector(stoneGatherSpeed);
clear_vector(goldGatherSpeed);
clear_vector(foodNotInBonus);
clear_vector(woodNotInBonus);
clear_vector(stoneNotInBonus);
clear_vector(goldNotInBonus);
clear_vector(attackSpeed);
delete resourceInfluence;
clear_vector(armyQuad);
clear_vector(buildingsQuad);
clear_vector(econQuad);
delete visibilityManager;
delete ci;
delete[]intersection;
delete tempIndexes;
}
void InfluenceManager::update(std::vector<Unit*>* units) const {
MapsUtils::resetMaps(unitsInfluencePerPlayer);
if (SIM_GLOBALS.HEADLESS) {
for (const auto unit : (*units)) {
const auto pId = unit->getPlayer();
const auto index = calculator->indexFromPosition(unit->getPosition());
unitsInfluencePerPlayer[pId]->tempUpdate(index);
}
} else {
MapsUtils::resetMaps(unitsNumberPerPlayer);
for (const auto unit : (*units)) {
const auto pId = unit->getPlayer();
const auto index = calculator->indexFromPosition(unit->getPosition());
unitsNumberPerPlayer[pId]->updateInt(index);
unitsInfluencePerPlayer[pId]->tempUpdate(index);
}
}
MapsUtils::finalize(unitsInfluencePerPlayer);
}
void InfluenceManager::update(const std::vector<ResourceEntity*>* resources) const {
resourceInfluence->reset();
for (const auto resource : (*resources)) {
resourceInfluence->tempUpdate(resource->getIndexInInfluence(), resource->getHealthPercent());
}
//resourceInfluence->updateFromTemp();
}
void InfluenceManager::updateQuadUnits(const std::vector<Unit*>* units) const {
MapsUtils::resetMaps(armyQuad);
for (const auto unit : (*units)) {
if (!unit->getDbUnit()->typeWorker) {
armyQuad[unit->getPlayer()]->updateInt(unit);
}
}
}
void InfluenceManager::update(const std::vector<Building*>* buildings) const {
MapsUtils::resetMaps(buildingsInfluencePerPlayer);
MapsUtils::resetMaps(buildingsQuad);
for (const auto building : (*buildings)) {
const auto player = building->getPlayer();
const auto index = building->getIndexInInfluence();
buildingsInfluencePerPlayer[player]->tempUpdate(index);
buildingsQuad[player]->updateInt(index);
}
MapsUtils::finalize(buildingsInfluencePerPlayer);
}
void InfluenceManager::updateWithHistory() const {
MapsUtils::resetMaps(foodGatherSpeed);
MapsUtils::resetMaps(woodGatherSpeed);
MapsUtils::resetMaps(stoneGatherSpeed);
MapsUtils::resetMaps(goldGatherSpeed);
MapsUtils::resetMaps(attackSpeed);
MapsUtils::finalize(foodGatherSpeed);
MapsUtils::finalize(woodGatherSpeed);
MapsUtils::finalize(stoneGatherSpeed);
MapsUtils::finalize(goldGatherSpeed);
MapsUtils::finalize(attackSpeed);
}
void InfluenceManager::updateNotInBonus(std::vector<Unit*>* units) const {
MapsUtils::resetMaps(foodNotInBonus);
MapsUtils::resetMaps(woodNotInBonus);
MapsUtils::resetMaps(stoneNotInBonus);
MapsUtils::resetMaps(goldNotInBonus);
//TODO perf tylko workerów sprawdzić
for (const auto unit : *units) {
if (unit->getDbUnit()->typeWorker && unit->getState() == UnitState::COLLECT && unit->isFirstThingAlive()) {
auto res = (ResourceEntity*)unit->getThingToInteract();
//TODO albo uzyc occupied cell tylko trzeba jakos przeliczyc
mapsResNotInBonusPerPlayer[unit->getPlayer()][res->getId()]->updateInt(res);
}
}
}
void InfluenceManager::updateQuadOther() const {
MapsUtils::resetMaps(econQuad);
}
void InfluenceManager::updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units,
std::vector<ResourceEntity*>* resources) const {
visibilityManager->updateVisibility(buildings, units, resources);
}
void InfluenceManager::draw(InfluenceDataType type, char index) {
DebugLineRepo::clear(DebugLineType::INFLUENCE, currentDebugBatch);
DebugLineRepo::beginGeometry(DebugLineType::INFLUENCE, currentDebugBatch);
switch (type) {
case InfluenceDataType::NONE:
break;
case InfluenceDataType::UNITS_NUMBER_PER_PLAYER:
MapsUtils::drawMap(currentDebugBatch, index, unitsNumberPerPlayer);
break;
case InfluenceDataType::UNITS_INFLUENCE_PER_PLAYER:
MapsUtils::drawMap(currentDebugBatch, index, unitsInfluencePerPlayer);
break;
case InfluenceDataType::BUILDING_INFLUENCE_PER_PLAYER:
MapsUtils::drawMap(currentDebugBatch, index, buildingsInfluencePerPlayer);
break;
case InfluenceDataType::RESOURCE_INFLUENCE:
resourceInfluence->draw(currentDebugBatch, MAX_DEBUG_PARTS_INFLUENCE);
break;
case InfluenceDataType::FOOD_SPEED:
MapsUtils::drawMap(currentDebugBatch, index, foodGatherSpeed);
break;
case InfluenceDataType::WOOD_SPEED:
MapsUtils::drawMap(currentDebugBatch, index, woodGatherSpeed);
break;
case InfluenceDataType::STONE_SPEED:
MapsUtils::drawMap(currentDebugBatch, index, stoneGatherSpeed);
break;
case InfluenceDataType::GOLD_SPEED:
MapsUtils::drawMap(currentDebugBatch, index, goldGatherSpeed);
break;
case InfluenceDataType::ATTACK_SPEED:
MapsUtils::drawMap(currentDebugBatch, index, attackSpeed);
break;
// case InfluenceDataType::ECON_QUAD:
// drawMap(index, econQuad);
// break;
// case InfluenceDataType::BUILDINGS_QUAD:
// drawMap(index, buildingsQuad);
// break;
// case InfluenceDataType::UNITS_QUAD:
// drawMap(index, armyQuad);
// break;
case InfluenceDataType::VISIBILITY:
visibilityManager->drawMaps(currentDebugBatch, index);
break;
default: ;
}
DebugLineRepo::commit(DebugLineType::INFLUENCE, currentDebugBatch);
currentDebugBatch++;
if (currentDebugBatch >= MAX_DEBUG_PARTS_INFLUENCE) {
currentDebugBatch = 0;
}
}
void InfluenceManager::drawAll() const {
MapsUtils::drawAll(unitsNumberPerPlayer, "unitsInt");
MapsUtils::drawAll(buildingsInfluencePerPlayer, "buildingsInt");
MapsUtils::drawAll(unitsInfluencePerPlayer, "units");
resourceInfluence->print("resource_");
MapsUtils::drawAll(foodGatherSpeed, "gatherFood");
MapsUtils::drawAll(woodGatherSpeed, "gatherWood");
MapsUtils::drawAll(stoneGatherSpeed, "gatherStone");
MapsUtils::drawAll(goldGatherSpeed, "gatherGold");
MapsUtils::drawAll(attackSpeed, "attack");
MapsUtils::drawAll(armyQuad, "armyQuad");
MapsUtils::drawAll(buildingsQuad, "buildingsQuad");
MapsUtils::drawAll(econQuad, "econQuad");
}
content_info* InfluenceManager::getContentInfo(const Urho3D::Vector2& center, CellState state, int additionalInfo,
bool checks[], int activePlayer) {
ci->reset(); //TODO przemyslec to, zbyt skomplikowane
switch (state) {
case CellState::NONE:
case CellState::ATTACK:
case CellState::COLLECT:
case CellState::DEPLOY:
if (checks[3] || checks[4]) {
for (int i = 0; i < unitsNumberPerPlayer.size(); ++i) {
char value = unitsNumberPerPlayer[i]->getValueAt(center);
if ((checks[3] && i == activePlayer || checks[4] && i != activePlayer) && value > 0) {
ci->unitsNumberPerPlayer[i] = value;
ci->hasUnit = true;
}
}
}
break;
case CellState::RESOURCE:
if (checks[1]) {
ci->hasResource = true;
ci->resourceNumber[additionalInfo]++;
}
break;
case CellState::BUILDING:
if (checks[2]) {
ci->hasBuilding = true;
ci->buildingNumberPerPlayer[additionalInfo]++;
}
break;
default: ;
}
return ci;
}
std::array<float, 5>& InfluenceManager::getInfluenceDataAt(char player, const Urho3D::Vector2& pos) {
auto& array = mapsForAiPerPlayer[player];
assert(array.size()==dataFromPos.size());
for (int i = 0; i < array.size(); ++i) {
array[i]->ensureReady();
dataFromPos[i] = array[i]->getValueAsPercent(pos);
}
return dataFromPos;
}
std::vector<int> InfluenceManager::getIndexesIterative(const std::span<float> result, float tolerance, int min,
std::span<InfluenceMapFloat*> maps) const {
assert(result.size() == maps.size());
for (auto map : maps) {
map->ensureReady();
}
int k = 0;
for (auto step : {0.0f, 0.05f, 0.1f}) {
tolerance += step;
k++;
std::vector<int> intersection = maps[0]->getIndexesWithByValue(result[0], tolerance);
for (char i = 1; i < maps.size(); ++i) {
std::vector<int> indexes = maps[i]->getIndexesWithByValue(result[i], tolerance);
std::vector<int> temp;
std::ranges::set_intersection(intersection, indexes,
std::back_inserter(temp));
if (temp.empty() || temp.size() < min && k != 3) {
intersection.clear();
break;
}
intersection = temp; //TODO optimize, nie kopiować?
}
if (!intersection.empty()) {
return intersection;
}
}
return {};
}
std::vector<Urho3D::Vector2> InfluenceManager::getAreasIterative(const std::span<float> result, char player,
float tolerance, int min) {
//TODO better!!!
if (result.size() == 8) {
return centersFromIndexes(getIndexesIterative(result, tolerance, min, mapsForAiPerPlayer[player]));
}
if (result.size() == 3) {
return centersFromIndexes(getIndexesIterative(result, tolerance, min, mapsForAiArmyPerPlayer[player]));
}
assert(false);
}
std::vector<int>*
InfluenceManager::getAreas(const std::span<float> result, ParentBuildingType type, char player) {
if (type == ParentBuildingType::RESOURCE) {
return getAreas(mapsGatherSpeedPerPlayer[player], result, player);
}
return getAreas(mapsForAiPerPlayer[player], result, player);
}
std::vector<int>* InfluenceManager::getAreasResBonus(char id, char player) {
tempIndexes->clear();
const int maxIdx = mapsResNotInBonusPerPlayer[player][id]->getMaxIdx();
tempIndexes->push_back(maxIdx);
return tempIndexes;
}
std::vector<int>*
InfluenceManager::getAreas(std::span<InfluenceMapFloat*> maps, const std::span<float> result, char player) const {
assert(result.size() == maps.size());
std::fill_n(intersection, arraySize, 0.f); //TODO perf move to removeunsean
const int noOfVisible = visibilityManager->removeUnseen(player, intersection);
for (const auto map : maps) {
map->ensureReady();
}
char numberOfNotEmptyMap = 0;
for (char i = 0; i < maps.size(); ++i) {
const auto ok = maps[i]->cumulateErros(result[i], intersection);
numberOfNotEmptyMap += ok;
}
const int size = Urho3D::Min(noOfVisible, calculator->getResolution() * calculator->getResolution() / 8);
const auto idx = sort_indexes(std::span(intersection, arraySize), size);
return bestIndexes(intersection, idx, 0.1f * numberOfNotEmptyMap);
}
void InfluenceManager::addCollect(Unit* unit, char resId, float value) {
const auto playerId = unit->getPlayer();
assert(foodGatherSpeed[playerId]->getResolution() == calculator->getResolution());
const auto index = calculator->indexFromPosition(unit->getPosition());
switch (resId) {
//TODO better!!!
case 0:
foodGatherSpeed[playerId]->tempUpdate(index, value);
break;
case 1:
woodGatherSpeed[playerId]->tempUpdate(index, value);
break;
case 2:
stoneGatherSpeed[playerId]->tempUpdate(index, value);
break;
case 3:
goldGatherSpeed[playerId]->tempUpdate(index, value);
break;
}
econQuad[playerId]->update(index, value);
}
void InfluenceManager::addAttack(char player, const Urho3D::Vector3& position, float value) {
attackSpeed[player]->tempUpdate(position, value);
}
std::optional<Urho3D::Vector2> InfluenceManager::getCenterOf(CenterType id, char player) {
return mapsForCentersPerPlayer[player][cast(id)]->getCenter();
}
bool InfluenceManager::isVisible(char player, const Urho3D::Vector2& pos) const {
return visibilityManager->isVisible(player, pos);
}
Urho3D::Vector2 InfluenceManager::getCenter(int index) const {
return calculator->getCenter(index);
}
float InfluenceManager::getVisibilityScore(char player) const {
return visibilityManager->getVisibilityScore(player);
}
int InfluenceManager::getIndex(const Urho3D::Vector3& position) const {
return calculator->indexFromPosition(position);
}
void InfluenceManager::nextVisibilityType() const {
visibilityManager->nextVisibilityType();
}
std::vector<int>* InfluenceManager::bestIndexes(float* values, const std::vector<unsigned>& indexes,
float minVal) const {
tempIndexes->clear();
for (auto ptr = indexes.begin(); ptr < indexes.end(); ++ptr) {
if (values[*ptr] > minVal) {
break;
}
tempIndexes->emplace_back(*ptr);
}
return tempIndexes;
}
std::vector<Urho3D::Vector2> InfluenceManager::centersFromIndexes(const std::vector<int>& intersection) const {
std::vector<Urho3D::Vector2> centers;
centers.reserve(intersection.size());
for (const auto value : intersection) {
centers.emplace_back(calculator->getCenter(value));
}
return centers;
}
float InfluenceManager::getFieldSize() const {
return resourceInfluence->getFieldSize();
}
```
dbload_container.h
```#pragma once
#include <vector>
#include <Urho3D/Container/Str.h>
#include "utils/DeleteUtils.h"
struct dbload_config {
dbload_config(const dbload_config&) = delete;
dbload_config() = default;
int precision;
int map;
int size;
};
struct dbload_physical {
float hp;
short id_db;
char player;
char level;
dbload_physical(short idDb, float hp, short player, short level)
: id_db(idDb),
hp(hp),
player(player),
level(level) { }
};
struct dbload_static : dbload_physical {
short buc_x;
short buc_y;
char state;
char nextState;
dbload_static(int idDb, float hp, int player, int bucX, int bucY, int level, int state,
int nextState)
: dbload_physical(idDb, hp, player, level),
buc_x(bucX),
buc_y(bucY),
state(state),
nextState(nextState) { }
};
struct dbload_unit : dbload_physical {
float pos_x;
float pos_z;
int state;
float vel_x;
float vel_z;
dbload_unit(int idDb, float hp, int player, int level, float posX, float posZ, int state,
float velX, float velZ)
: dbload_physical(idDb, hp, player, level),
pos_x(posX),
pos_z(posZ),
state(state),
vel_x(velX),
vel_z(velZ) { }
};
struct dbload_building : dbload_static {
int deploy_idx;
dbload_building(int idDb, float hpCoef, int player, int level, int bucX, int bucY, int state, int nextState,
int deploy_idx)
: dbload_static(idDb, hpCoef, player, bucX, bucY, level, state, nextState),
deploy_idx(deploy_idx) { }
};
struct dbload_resource_entities : dbload_static {
dbload_resource_entities(int idDb, float hpCoef, int player, int level, int bucX, int bucY, int state,
int nextState) : dbload_static(idDb, hpCoef, player, bucX, bucY, level, state,
nextState) { }
};
struct dbload_player {
bool is_active;
char id;
char team;
char nation;
char color;
Urho3D::String name;
dbload_player(int id, bool isActive, int team, int nation, char* name, int color)
: is_active(isActive),
id(id),
team(team),
nation(nation),
color(color),
name(name) { }
};
struct dbload_resource {
short player;
short resource;
float amount;
dbload_resource(short player, short resource, float amount)
: player(player),
resource(resource),
amount(amount) { }
};
struct dbload_container {
dbload_container() {
precision = 1;
config = new dbload_config();
}
~dbload_container() {
delete config;
clear_and_delete_vector(players);
clear_and_delete_vector(resources);
clear_and_delete_vector(units);
clear_and_delete_vector(buildings);
clear_and_delete_vector(resource_entities);
}
int precision;
dbload_config* config;
std::vector<dbload_player*>* players{};
std::vector<dbload_resource*>* resources{};
std::vector<dbload_unit*>* units{};
std::vector<dbload_building*>* buildings{};
std::vector<dbload_resource_entities*>* resource_entities{};
};
```
CreationCommand.cpp
```#include "CreationCommand.h"
#include "objects/ObjectEnums.h"
#include "simulation/SimulationObjectManager.h"
CreationCommand::CreationCommand(ObjectType type, int id, const Urho3D::IntVector2 bucketCords, char level, char player)
: AbstractCommand(player), id(id), number(0), level(level),
objectType(type), bucketCords(bucketCords) {}
CreationCommand::CreationCommand(ObjectType type, int id, const Urho3D::Vector2& position, char level, char player,
int number): AbstractCommand(player), id(id),
number(number), level(level), position(position), objectType(type) {}
void CreationCommand::execute() {
switch (objectType) {
case ObjectType::UNIT:
simulationObjectManager->addUnits(number, id, position, level, player);
break;
case ObjectType::BUILDING:
simulationObjectManager->addBuilding(id, bucketCords, level, player);
break;
case ObjectType::RESOURCE:
simulationObjectManager->addResource(id, bucketCords, level);
break;
}
}
void CreationCommand::setSimulationObjectManager(SimulationObjectManager* _simulationObjectManager) {
simulationObjectManager = _simulationObjectManager;
}
```
ResourceFactory.cpp
```#include "ResourceFactory.h"
#include "Game.h"
#include "ResourceEntity.h"
#include "database/DatabaseCache.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
ResourceEntity* ResourceFactory::create(int id, Urho3D::IntVector2 bucketCords, int level) const {
db_resource* db_resource = Game::getDatabase()->getResource(id);
if (Game::getEnvironment()->validateStatic(db_resource->size, bucketCords, false)) {
auto center = Game::getEnvironment()->getValidPosition(db_resource->size, bucketCords);
float y = Game::getEnvironment()->getGroundHeightAt(center.x_, center.y_);
return new ResourceEntity(Urho3D::Vector3(center.x_, y, center.y_), id, level,
Game::getEnvironment()->getIndex(bucketCords.x_, bucketCords.y_),
!SIM_GLOBALS.HEADLESS);
}
return nullptr;
}
ResourceEntity* ResourceFactory::load(dbload_resource_entities* resource) const {
const Urho3D::IntVector2 bucketCords(resource->buc_x, resource->buc_y);
auto ress = create(resource->id_db, bucketCords, resource->level);
if (ress) {
return ress->load(resource);
}
return nullptr;
}
```
DebugPanel.h
```#pragma once
#include "../SimplePanel.h"
namespace Urho3D {
class Text;
class XMLFile;
}
class DebugPanel : public SimplePanel {
public:
explicit DebugPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~DebugPanel() = default;
void setText(unsigned int seconds, float avgLow, float avgMiddle,
float avgHighest, const Urho3D::String& camInfo);
private:
void createBody() override;
Urho3D::Text* fpsText;
Urho3D::String msg = "";
};
```
AssertUtils.h
```#pragma once
#include "env/influence/map/InfluenceMapFloat.h"
inline bool validSizes(std::array<InfluenceMapFloat*, 8> &array) {
for (int i = 1; i < array.size(); ++i) {
if (array[i-1]->getResolution()!=array[i]->getResolution()) {
return false;
}
}
return true;
}
```
SimulationObjectManager.cpp
```#include "SimulationObjectManager.h"
#include <Urho3D/IO/Log.h>
#include "Game.h"
#include "ObjectsInfo.h"
#include "objects/building/Building.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/unit/Unit.h"
#include "objects/unit/state/StateManager.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
SimulationObjectManager::SimulationObjectManager() {
units = new std::vector<Unit*>();
buildings = new std::vector<Building*>();
resources = new std::vector<ResourceEntity*>();
units->reserve(4069);
buildings->reserve(128);
resources->reserve(20 * 1024);
simulationInfo = new ObjectsInfo();
}
SimulationObjectManager::~SimulationObjectManager() {
clear_and_delete_vector(units);
clear_and_delete_vector(buildings);
clear_and_delete_vector(resources);
delete simulationInfo;
dispose();
}
void SimulationObjectManager::clearNodesWithoutDelete() {
for (auto value : *units) {
value->clearNodeWithOutDelete();
}
for (auto value : *buildings) {
value->clearNodeWithOutDelete();
}
for (auto value : *resources) {
value->clearNodeWithOutDelete();
}
}
void SimulationObjectManager::addUnits(unsigned number, int id, Urho3D::Vector2& center, char level, char player) {
addUnits(unitFactory.create(number, id, center, player, level));
}
void SimulationObjectManager::addBuilding(int id, const Urho3D::IntVector2& _bucketCords, char level,
char player) const {
auto* building = buildingFactory.create(id, _bucketCords, level, player);
if(building) {
building->postCreate();
addBuilding(building);
}
}
void SimulationObjectManager::addResource(int id, const Urho3D::IntVector2& _bucketCords, char level) const {
auto res = resourceFactory.create(id, _bucketCords, level);
if(res) {
addResource(res, false);
}
}
void SimulationObjectManager::findToDispose() {
findToDisposeUnits(); //TODO perf jezeli cos zmieniło stan do dispose
findToDisposeBuildings();
findToDisposeResources();
}
void SimulationObjectManager::load(dbload_unit* unit) {
addUnits(unitFactory.load(unit));
}
void SimulationObjectManager::load(dbload_building* building) {
addBuilding(buildingFactory.load(building));
}
void SimulationObjectManager::load(dbload_resource_entities* resource) const {
addResource(resourceFactory.load(resource), true);
}
void SimulationObjectManager::addUnits(std::vector<Unit*>& temp) const {
if (!temp.empty()) {
units->insert(units->end(), temp.begin(), temp.end());
for (auto value : temp) {
Game::getPlayersMan()->getPlayer(value->getPlayer())->add(value);
}
Game::getEnvironment()->addNew(temp);
simulationInfo->setAmountUnitChanged();
}
}
void SimulationObjectManager::addBuilding(Building* building) const {
if (building) {
buildings->push_back(building);
Game::getPlayersMan()->getPlayer(building->getPlayer())->add(building);
Game::getEnvironment()->addNew(building);
simulationInfo->setAmountBuildingChanged();
} else {
Game::getLog()->Write(0, "Building loading not possible");
}
}
void SimulationObjectManager::addResource(ResourceEntity* resource, bool bulkAdd) const {
if (resource) {
resources->push_back(resource);
Game::getEnvironment()->addNew(resource, bulkAdd);
simulationInfo->setAmountResourceChanged();
} else {
Game::getLog()->Write(0, "Resource adding not possible");
}
}
void SimulationObjectManager::findToDisposeUnits() {
units->erase(
std::remove_if(
units->begin(), units->end(),
[this](Unit* unit) {
if (unit->isToDispose()) {
unitsToDispose.push_back(unit);
return true;
}
unit->clean();
return false;
}
), units->end());
if (!unitsToDispose.empty()) {
simulationInfo->setUnitDied();
}
}
void SimulationObjectManager::findToDisposeBuildings() {
if (StateManager::isBuildingToDispose()) {
buildings->erase(
std::remove_if(
buildings->begin(), buildings->end(),
[this](Building* building) {
if (building->isToDispose()) {
buildingsToDispose.push_back(building);
return true;
}
return false;
}
), buildings->end());
if (!buildingsToDispose.empty()) {
simulationInfo->setBuildingDied();
}
StateManager::setBuildingToDispose(false);
}
}
void SimulationObjectManager::findToDisposeResources() {
if (StateManager::isResourceToDispose()) {
resources->erase(
std::remove_if(
resources->begin(), resources->end(),
[this](ResourceEntity* resource) {
if (resource->isToDispose()) {
resourcesToDispose.push_back(resource);
return true;
}
return false;
}
), resources->end());
if (!resourcesToDispose.empty()) {
simulationInfo->setResourceDied();
}
StateManager::setResourceToDispose(false);
}
}
void SimulationObjectManager::refreshResBonuses() {
//TODO perf ugly, refresh całości
bool resourceBuildingChanged[MAX_PLAYERS][RESOURCES_SIZE] =
{{false, false, false, false},
{false, false, false, false}};
for (const auto building : buildingsToDispose) {
auto& vals = resourceBuildingChanged[building->getPlayer()];
for (const char resId : building->getDbBuilding()->resourceTypes) {
vals[resId] = true;
}
}
for (char p = 0; p < MAX_PLAYERS; ++p) {
const auto& perPlayer = resourceBuildingChanged[p];
for (char r = 0; r < RESOURCES_SIZE; ++r) {
if (perPlayer[r]) {
Game::getEnvironment()->reAddBonuses(buildings, p, r);
}
}
}
}
void SimulationObjectManager::dispose() {
Game::getEnvironment()->removeFromGrids(unitsToDispose);
Game::getEnvironment()->removeFromGrids(buildingsToDispose, resourcesToDispose);
refreshResBonuses();
clear_vector(unitsToDispose);
clear_vector(buildingsToDispose);
clear_vector(resourcesToDispose);
simulationInfo->reset();
}
```
MathUtils.h
```#pragma once
#include <Urho3D/Math/Vector3.h>
#include <Urho3D/Math/Vector2.h>
#include <array>
inline float sqDistAs2D(float a, float b) {
return a * a + b * b;
}
inline float sqDist(const Urho3D::Vector3* one, const Urho3D::Vector3* two) {
return (*one - *two).LengthSquared();
}
inline float sqDist(const Urho3D::Vector2& one, const Urho3D::Vector2& two) {
return (one - two).LengthSquared();
}
inline float sqDist(const Urho3D::Vector3& one, const Urho3D::Vector3& two) {
return (one - two).LengthSquared();
}
inline float sqDist(const Urho3D::Vector2& one, const Urho3D::Vector3& two) {
return sqDistAs2D(one.x_ - two.x_, one.y_ - two.z_);
}
inline float sqDist(const Urho3D::Vector3& one, const Urho3D::Vector2& two) {
return sqDistAs2D(one.x_ - two.x_, one.z_ - two.y_);
}
inline float sqDistAs2D(const Urho3D::Vector3& one, const Urho3D::Vector3& two) {
return sqDistAs2D(one.x_ - two.x_, one.z_ - two.z_);
}
inline Urho3D::IntVector2 calculateSize(int size, int central) {
const int first = -((size - 1) / 2);
const int second = size + first;
return Urho3D::IntVector2(first + central, second + central);
}
inline Urho3D::Vector2 dirTo(Urho3D::Vector3* a, const Urho3D::Vector2& b) {
return {b.x_ - a->x_, b.y_ - a->z_};
}
inline Urho3D::Vector2 dirTo(const Urho3D::Vector3& a, const Urho3D::Vector2& b) {
return {b.x_ - a.x_, b.y_ - a.z_};
}
inline Urho3D::Vector2 dirTo(const Urho3D::Vector3& a, const Urho3D::Vector3& b) {
return {b.x_ - a.x_, b.z_ - a.z_};
}
inline void setClosest(float& minDistance, Urho3D::Vector2& closest, int& closestindex, int i,
Urho3D::Vector2 posToFollow, const Urho3D::Vector3& pos1) {
auto dist = sqDist(pos1, posToFollow);
if (dist < minDistance) {
minDistance = dist;
closest = posToFollow;
closestindex = i;
}
}
inline short diff(const short a, const short b) {
auto diff = Urho3D::Sign(b - a);
if (diff == 0) { return 1; }
return diff;
}
inline float fixValue(float value, float maxValue) {
if (value > maxValue) {
return maxValue;
}
if (value < 0) {
return 0;
}
return value;
}
inline std::array<int, 4> getCordsInHigher(unsigned short resolution, int index) {
const auto mod = index % resolution;
const auto div = index / resolution;
const auto resX2 = resolution * 2;
const auto value = 2 * (mod + div * resX2);
return {value, value + 1, value + resX2, value + resX2 + 1};
}
inline int getCordsInLower(int currentRes, int parentRes, int index) {
auto x = index / parentRes;
auto z = index % parentRes;
x /= 2;
z /= 2;
return x * currentRes + z;
}
inline Urho3D::Vector2 to2D(Urho3D::Vector3 vec) {
return {vec.x_, vec.z_};
}
inline Urho3D::Vector3 to3D(Urho3D::Vector2 vec, float y) {
return {vec.x_, y, vec.y_};
}
```
RtsCameraBehave.cpp
```#include "RtsCameraBehave.h"
#include <Urho3D/Scene/Node.h>
#include <Urho3D/Input/Input.h>
#include "math/MathUtils.h"
RtsCameraBehave::RtsCameraBehave(): CameraBehave(Urho3D::Vector3(0.0f, 50.0f, -50.0f), 3, "RTSCam") {
const auto diff = sqrt(50.0f - minY) + 1.f;
cameraNode->SetDirection(Urho3D::Vector3::DOWN * diff + Urho3D::Vector3::FORWARD * 10.f);
}
bool RtsCameraBehave::translate(bool cameraKeys[], int wheel, float timeStep, float min) {
Urho3D::Vector3 pos = cameraNode->GetWorldPosition();
const float localMin = minY + min;
const float localMax = maxY + min;
float diff;
if (pos.y_ < localMin) {
diff = 1;
} else {
diff = sqrt((pos.y_ - localMin) / 10) + 1.f;
}
bool hasChange = translateInternal(cameraKeys, timeStep, diff);
if (wheel != 0 || pos.y_ < localMin) {
Urho3D::Vector3 pos2 = cameraNode->GetWorldPosition();
if (pos2.y_ < localMin) {
pos2.y_ = localMin;
}
float diff = sqrt(pos2.y_ - localMin) + 1.f;
pos2 += Urho3D::Vector3::DOWN * wheel * diff * 1.5f;
if (pos2.y_ < localMin) {
pos2.y_ = localMin;
} else if (pos2.y_ > localMax) {
pos2.y_ = localMax;
}
cameraNode->SetWorldPosition(pos2);
cameraNode->SetDirection(Urho3D::Vector3::DOWN * diff + Urho3D::Vector3::FORWARD * 10);
hasChange = true;
}
return hasChange;
}
Urho3D::MouseMode RtsCameraBehave::getMouseMode() {
return Urho3D::MM_RELATIVE;
}
Urho3D::Vector2 RtsCameraBehave::getTargetPos() const {
const auto cameraRay = getComponent()->GetScreenRay(0.5, 0.5);
auto plane = camera->ScreenToWorldPoint(Urho3D::Vector3(0.5, 0.5, cameraRay.HitDistance(Urho3D::Plane::UP)));
return to2D(plane);
}
```
DebugLineRepo.cpp
```#include "DebugLineRepo.h"
#include <Urho3D/Graphics/CustomGeometry.h>
#include "Game.h"
#include "colors/ColorPaletteRepo.h"
#include "simulation/SimGlobals.h"
#include "utils/defines.h"
#include "utils/OtherUtils.h"
std::vector<Urho3D::CustomGeometry*> DebugLineRepo::geometry[];
void DebugLineRepo::init(DebugLineType type) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto& geom = geometry[cast(type)];
if (geom.empty()) {
geom.push_back(Game::getScene()->CreateChild()
->GetOrCreateComponent<Urho3D::CustomGeometry>());
}
}
}
}
void DebugLineRepo::init(DebugLineType type, short batches) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto& geom = geometry[cast(type)];
if (geom.empty()) {
for (int i = 0; i < batches; ++i) {
geom.push_back(Game::getScene()->CreateChild()
->GetOrCreateComponent<Urho3D::CustomGeometry>());
}
}
}
}
}
void DebugLineRepo::dispose() {
for (auto& customGeometries : geometry) {
customGeometries.clear();
}
}
DebugLineRepo::~DebugLineRepo() {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
for (const auto& vector : geometry) {
for (auto* customGeometry : vector) {
customGeometry->Remove();
}
}
}
}
}
void DebugLineRepo::commit(DebugLineType type, short batch) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto* geom = geometry[cast(type)].at(batch);
switch (type) {
case DebugLineType::INFLUENCE:
case DebugLineType::MAIN_GRID:
geom->SetMaterial(Game::getColorPaletteRepo()->getInfluenceMaterial());
break;
default:
geom->SetMaterial(Game::getColorPaletteRepo()->getLineMaterial());
}
geom->Commit();
}
}
}
void DebugLineRepo::beginGeometry(DebugLineType type, short batch) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
if (type == DebugLineType::INFLUENCE || type == DebugLineType::MAIN_GRID) {
geometry[cast(type)].at(batch)->BeginGeometry(0, Urho3D::PrimitiveType::TRIANGLE_LIST);
} else {
geometry[cast(type)].at(batch)->BeginGeometry(0, Urho3D::PrimitiveType::LINE_LIST);
}
}
}
}
void DebugLineRepo::clear(DebugLineType type, short batch) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto* geom = geometry[cast(type)].at(batch);
geom->Clear();
geom->SetNumGeometries(1);
}
}
}
void DebugLineRepo::drawLine(DebugLineType type, const Urho3D::Vector3& first, const Urho3D::Vector3& second,
const Urho3D::Color& color, short batch) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto* geom = geometry[cast(type)].at(batch);
geom->DefineVertex(first);
geom->DefineColor(color);
geom->DefineVertex(second);
geom->DefineColor(color);
}
}
}
void DebugLineRepo::drawTriangle(DebugLineType type, const Urho3D::Vector3& first, const Urho3D::Vector3& second,
const Urho3D::Vector3& third, const Urho3D::Color& color, short batch) {
if constexpr (DEBUG_LINES_ENABLED) {
if (!SIM_GLOBALS.HEADLESS) {
auto* geom = geometry[cast(type)].at(batch);
geom->DefineVertex(first);
geom->DefineColor(color);
geom->DefineVertex(second);
geom->DefineColor(color);
geom->DefineVertex(third);
geom->DefineColor(color);
}
}
}
```
CollectState.h
```#pragma once
#include "Game.h"
#include "State.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "player/Resources.h"
#include "env/Environment.h"
#include "objects/CellState.h"
#include "objects/resource/ResourceEntity.h"
class CollectState : public State {
public:
CollectState(): State({
UnitState::STOP, UnitState::DEFEND, UnitState::DEAD,
UnitState::GO, UnitState::FOLLOW, UnitState::CHARGE
}) { }
~CollectState() = default;
bool canStart(Unit* unit, const ActionParameter& parameter) override {
if (parameter.isThingAlive()) {
auto const indexesToUse = parameter.thingToInteract->getIndexesForUse(unit);
return std::ranges::find(indexesToUse, unit->getMainGridIndex()) != indexesToUse.end();
}
return false;
}
void onStart(Unit* unit, const ActionParameter& parameter) override {
auto const indexesToUse = parameter.thingToInteract->getIndexesForUse(unit);
const auto found = std::ranges::find(indexesToUse, unit->getMainGridIndex());
assert(found != indexesToUse.end());
setStartData(unit, *found, parameter.thingToInteract);
unit->lastActionThingId = parameter.thingToInteract->getId();
unit->velocity = Urho3D::Vector2::ZERO;
Game::getEnvironment()->updateCell(unit->getMainGridIndex(), 1, CellState::COLLECT);
}
void onEnd(Unit* unit) override {
if (unit->isFirstThingAlive()) {
unit->thingToInteract->reduceClose();
}
Game::getEnvironment()->updateCell(unit->indexToInteract, -1, CellState::NONE);
unit->indexToInteract = -1;
}
void execute(Unit* unit, float timeStep) override {
if (!unit->isFirstThingAlive() || !Game::getEnvironment()->cellInState(
unit->getMainGridIndex(), CellState::COLLECT)) {
StateManager::toDefaultState(unit);
return;
}
const auto first = unit->thingToInteract;
if (unit->indexChanged()) {
first->reduceClose();
unit->thingToInteract = nullptr;
auto const indexesToUse = first->getIndexesForUse(unit);
const auto found = std::ranges::find(indexesToUse, unit->getMainGridIndex());
if (found != indexesToUse.end()) {
setStartData(unit, *found, first);
} else {
StateManager::toDefaultState(unit);
return;
}
}
auto& resources = Game::getPlayersMan()->getPlayer(unit->player)->getResources();
const auto resource = (ResourceEntity*)unit->thingToInteract;
const auto bonus = Game::getEnvironment()->getBonuses(unit->player, resource);
const auto [value, died] = resource->absorbAttack(unit->dbLevel->collect * bonus * timeStep);
//resource->getIndexInInfluence()
Game::getEnvironment()->addCollect(unit, resource->getId(), value);
resources.add(resource->getId(), value);
}
};
```
Physical.h
```#pragma once
#include <optional>
#include <span>
#include <string>
#include <vector>
#include <Urho3D/Core/Variant.h>
#include <Urho3D/Graphics/Material.h>
#include "database/db_other_struct.h"
#include "objects/ObjectEnums.h"
#include "player/Possession.h"
#include "Urho3D/Math/Vector3.h"
enum class VisibilityType : char;
namespace Urho3D
{
class Node;
class StaticModel;
}
class Unit;
struct dbload_physical;
class Physical {
public:
explicit Physical(Urho3D::Vector3& _position, bool withNode);
virtual ~Physical();
void clearNodeWithOutDelete();
virtual bool isAlive() const;
short getId() const { return id; }
virtual float getHealthBarSize() const;
void setBucket(int _bucketIndex) {
if (_bucketIndex < 0) {
indexHasChanged = false;
} else {
indexInMainGrid = _bucketIndex;
indexHasChanged = true;
}
}
void setTeam(unsigned char team) { this->team = team; }
void setPlayer(unsigned char player) { this->player = player; }
bool isSelected() const;
void load(dbload_physical* dbloadPhysical);
virtual bool isIndexSlotOccupied(int indexToInteract) { return false; }
virtual bool indexChanged() const { return false; }
virtual void setOccupiedIndexSlot(char index, bool value) { }
virtual std::string getValues(int precision);
virtual bool isUsable() const { return isAlive(); }
virtual int belowCloseLimit() const;
void reduceClose() { --closeUsers; }
void upClose() { ++closeUsers; }
bool belowRangeLimit() const { return rangeUsers < getMaxRangeUsers(); }
void reduceRange() { --rangeUsers; }
void upRange() { ++rangeUsers; }
virtual ObjectType getType() const = 0;
virtual float getAttackVal(Physical* aim) { return 0.f; }
float getHealthPercent() const { return hp * invMaxHp; }
signed char getTeam() const { return team; }
const Urho3D::Vector3& getPosition() const { return position; }
virtual char getPlayer() const { return player; }
int getMainGridIndex() const { return indexInMainGrid; }
virtual void populate() { }
virtual bool isToDispose() const { return false; }
virtual std::vector<int> getIndexesForUse(Unit* user) const = 0;
virtual std::vector<int> getIndexesForRangeUse(Unit* user) const = 0;
virtual std::optional<std::tuple<Urho3D::Vector2, float>> getPosToUseWithDist(Unit* user) = 0;
std::optional<Urho3D::Vector2> getPosToUseBy(Unit* follower);
virtual unsigned short getMaxHpBarSize() const = 0;
virtual std::pair<float, bool> absorbAttack(float attackCoef) = 0;
void select();
void clearSelection();
virtual short getCostSum() const = 0;
void unSelect();
virtual float getSightRadius() const { return -1.f; }
virtual Urho3D::String getInfo() const = 0;
virtual char getLevelNum();
virtual void addValues(std::span<float> vals) const { }
virtual unsigned char getMaxRangeUsers() const { return 128; }
virtual unsigned char getMaxCloseUsers() const { return 8; }
virtual bool isInCloseRange(int index) const = 0;
virtual const Urho3D::String& getName() const = 0;
virtual float getModelHeight() const =0;
virtual void setVisibility(VisibilityType type) = 0;
virtual unsigned char getHealthBarThick() const { return 5; }
bool isNodeEnabled() const;
void setDefaultShader(Urho3D::Material* mat) const;
void ensureMaterialCloned();
Urho3D::Node* getNode() { return node; }
protected:
virtual void setModelData(float modelHeight) const =0;
virtual Urho3D::Color getColor(db_player_colors* col) const = 0;
void loadXml(const Urho3D::String& xmlName);
void setPlayerAndTeam(int player);
Urho3D::Node* node{};
Urho3D::Vector3 position;
int indexInMainGrid = -1;
float hp = -1;
float invMaxHp; // optm
short id = -1; // optm
char team, player = -1;
unsigned char closeUsers = 0,
rangeUsers = 0;
bool indexHasChanged = false; ///TODO to tylko dla unit
bool shouldUpdate = false;
bool selected = false;
bool materialCloned = false;
};
```
Aims.cpp
```#include "Aims.h"
#include "TargetAim.h"
#include "../order/OrderUtils.h"
#include "objects/unit/order/IndividualOrder.h"
#include "utils/DeleteUtils.h"
Aims::Aims(): current(nullptr) {
}
Aims::~Aims() {
delete current;
clear_vector(nextAims);
}
std::optional<Urho3D::Vector2> Aims::getDirection(Unit* unit) const {
if (current) {
return current->getDirection(unit);
}
return {};
}
void Aims::clearExpired() {
removeExpired(nextAims);
if (current != nullptr && current->expired()) {
removeCurrentAim();
}
}
bool Aims::process(Unit* unit) {
if (current) {
if (current->ifReach(unit)) {
removeCurrentAim();
return nextAims.empty();
}
} else if (!nextAims.empty()) {
auto toExecute = nextAims[0];
nextAims.erase(nextAims.begin());
toExecute->execute();
delete toExecute;
}
return false;
}
void Aims::add(IndividualOrder* order) {
if (!order->getAppend()) {
clear();
}
nextAims.push_back(order);
}
void Aims::clear() {
clear_vector(nextAims);
removeCurrentAim();
}
void Aims::removeCurrentAim() {
delete current;
current = nullptr;
}
std::vector<Urho3D::Vector3> Aims::getDebugLines(Unit* unit) const {
return current->getDebugLines(unit);
}
void Aims::set(Aim* aim) {
current = aim;
}
```
MainMenuLoadPanel.h
```#pragma once
#include "hud/window/main_menu/MainMenuDetailsPanel.h"
namespace Urho3D {
class UIElement;
class Button;
class ScrollView;
class ListView;
}
class MainMenuLoadPanel : public MainMenuDetailsPanel {
public:
MainMenuLoadPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuLoadPanel() = default;
void HandleLoadClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
Urho3D::Button* getLoadButton() const;
private:
void createBody() override;
void action(const Urho3D::String& saveName);
Urho3D::UIElement* leftMock;
Urho3D::ListView* list;
Urho3D::ScrollView* content;
Urho3D::Button* loadButton;
};
```
QueueElement.cpp
```#include "QueueElement.h"
#include "QueueActionType.h"
QueueElement::QueueElement(QueueActionType type, short id, short maxCapacity, short initialTicksToComplete,
short ticksToCompletePerInstance): type(type), id(id), maxCapacity(maxCapacity), amount(0),
ticksToComplete(initialTicksToComplete), elapsedTicks(0),
ticksToCompletePerInstance(ticksToCompletePerInstance) {
}
bool QueueElement::checkType(QueueActionType _type, short _id) const {
return type == _type && id == _id;
}
short QueueElement::add(short value) {
short rest;
if (maxCapacity <= amount + value) {
rest = amount + value - maxCapacity;
amount = maxCapacity;
} else {
amount += value;
ticksToComplete += value * ticksToCompletePerInstance;
rest = 0;
}
return rest;
}
void QueueElement::reduce(short value) {
amount -= value;
ticksToComplete -= value * ticksToCompletePerInstance;
}
bool QueueElement::update() {
++elapsedTicks ;
return elapsedTicks >= ticksToComplete;
}
```
TargetAim.h
```#pragma once
#include "Aim.h"
#include <vector>
class TargetAim : public Aim {
public:
explicit TargetAim(std::vector<int> _path);
~TargetAim() = default;
std::vector<Urho3D::Vector3> getDebugLines(Unit* unit) const override;
Urho3D::Vector2 getDirection(Unit* unit) override;
bool ifReach(Unit* unit) override;
bool expired() override;
private:
std::vector<int> path;
Urho3D::Vector2 currentTarget;
short current;
};
```
FormationManager.h
```#pragma once
#include "Formation.h"
#include <optional>
#include <vector>
class FormationManager {
public:
FormationManager() = default;
~FormationManager();
std::optional<Formation*> createFormation(const std::vector<Unit*>& _units,
FormationType _type = FormationType::SQUERE);
void update();
float getPriority(Unit* unit);
std::optional<Urho3D::Vector2> getPositionFor(Unit* unit);
bool isLeader(Unit* unit) const;
bool isMoving(Unit* unit) const;
int getCachePath(Unit* unit, int aimIndex) const;
void addCachePath(Unit* unit, int aimIndex, int next);
private:
std::vector<Formation*> formations;
unsigned currentlyFree = 0;
};
```
FormationOrder.h
```#pragma once
#include "UnitOrder.h"
class Physical;
namespace Urho3D
{
class Vector2;
}
enum class UnitAction : char;
class Formation;
class FormationOrder : public UnitOrder {
public:
FormationOrder(Formation* formation, short action, Urho3D::Vector2& vector, bool append = false);
FormationOrder(Formation* formation, short action, Physical* toUse, bool append = false);
~FormationOrder() = default;
bool add() override;
bool expired() override;
short getSize() const override;
private:
Formation* formation;
void addCollectAim() override;
void addTargetAim() override;
void addFollowAim() override;
void addChargeAim() override;
void addAttackAim() override;
void addDefendAim() override;
void addDeadAim() override;
void addStopAim() override;
void simpleAction() const;
void followAndAct(float distThreshold);
};
```
MainMenuSettingsPanel.cpp
```#include "MainMenuSettingsPanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/CheckBox.h>
#include "SettingsForm.h"
#include "database/DatabaseCache.h"
#include "database/db_grah_structs.h"
#include "hud/UiUtils.h"
MainMenuSettingsPanel::
MainMenuSettingsPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): MainMenuDetailsPanel(root, _style, _title) {
bodyStyle = "MainMenuSettingsMock";
}
MainMenuSettingsPanel::~MainMenuSettingsPanel() {
delete data;
}
void MainMenuSettingsPanel::setValues(int graphID) const {
db_graph_settings* graphSettings = Game::getDatabase()->getGraphSettings()[graphID];
fullScreen->SetChecked(graphSettings->fullscreen);
vSync->SetChecked(graphSettings->v_sync);
textureQuality->SetSelection(graphSettings->texture_quality);
shadow->SetChecked(graphSettings->shadow);
hudSize->SetSelection(graphSettings->hud_size);
}
void MainMenuSettingsPanel::createBody() {
MainMenuDetailsPanel::createBody();
for (auto& row : rows) {
row = createElement<Urho3D::BorderImage>(body, style, "MainMenuSettingsRow");
}
populateLabels(0, "mmsp_settings");
populateLabels(1, "mmsp_resolution");
populateLabels(2, "mmsp_fullscreen");
populateLabels(3, "mmsp_max_fps");
populateLabels(4, "mmsp_min_fps");
populateLabels(5, "mmsp_vSync");
populateLabels(6, "mmsp_texture_quality");
populateLabels(7, "mmsp_shadow");
populateLabels(8, "mmsp_hud_size");
Urho3D::Localization* l10n = Game::getLocalization();
settings = createElement<Urho3D::DropDownList>(rows[0], style, "MainMenuNewGameDropDownList");
std::vector<Urho3D::String> settingsNames;
for (auto graphSetting : Game::getDatabase()->getGraphSettings()) {
if (graphSetting) {
settingsNames.push_back(l10n->Get(graphSetting->name));
}
}
SubscribeToEvent(settings, Urho3D::E_ITEMSELECTED, URHO3D_HANDLER(MainMenuSettingsPanel, HandleChangeSettings));
addChildTexts(settings, settingsNames, style);
resolution = createElement<Urho3D::DropDownList>(rows[1], style, "MainMenuNewGameDropDownList");
std::vector<Urho3D::String> resNames;
for (auto res : Game::getDatabase()->getResolutions()) {
resNames.push_back(Urho3D::String(res->x) + "x" + Urho3D::String(res->y));
}
addChildTexts(resolution, resNames, style);
fullScreen = createElement<Urho3D::CheckBox>(rows[2], style, "CheckBox");
maxFps = createElement<Urho3D::DropDownList>(rows[3], style, "MainMenuNewGameDropDownList");
addChildTexts(maxFps, {"30", "60", "120", "240"}, style, {30, 60, 120, 240}, "IntValue");
minFps = createElement<Urho3D::DropDownList>(rows[4], style, "MainMenuNewGameDropDownList");
addChildTexts(minFps, {"1", "5", "10"}, style, {1, 5, 10}, "IntValue");
vSync = createElement<Urho3D::CheckBox>(rows[5], style, "CheckBox");
textureQuality = createElement<Urho3D::DropDownList>(rows[6], style, "MainMenuNewGameDropDownList");
addChildTexts(textureQuality, {l10n->Get("low"), l10n->Get("normal"), l10n->Get("high")}, style);
shadow = createElement<Urho3D::CheckBox>(rows[7], style, "CheckBox");
hudSize = createElement<Urho3D::DropDownList>(rows[8], style, "MainMenuNewGameDropDownList");
std::vector<Urho3D::String> hudNames;
for (auto hudSize : Game::getDatabase()->getHudSizes()) {
hudNames.push_back(hudSize->name);
}
addChildTexts(hudSize, hudNames, style);
save = createElement<Urho3D::Button>(body, style, "MainMenuSettingsButton");
addChildText(save, "MainMenuSettingsButtonText", l10n->Get("mmsp_save"), style);
data = new SettingsForm();
save->SetVar("SettingsForm", data);
SubscribeToEvent(save, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuSettingsPanel, HandleSaveSettings));
db_settings* set = Game::getDatabase()->getSettings();
settings->SetSelection(set->graph);
resolution->SetSelection(set->resolution);
int graphID = set->graph;
setValues(graphID);
}
void MainMenuSettingsPanel::populateLabels(int index, const Urho3D::String& name) {
addChildText(rows[index], "MainMenuSettingsLabel", Game::getLocalization()->Get(name), style);
}
void MainMenuSettingsPanel::popualateForm(SettingsForm* form) const {
form->resolution = resolution->GetSelection();
form->fullScreen = fullScreen->IsChecked();
form->maxFps = maxFps->GetSelectedItem()->GetVar("IntValue").GetInt();
form->minFps = minFps->GetSelectedItem()->GetVar("IntValue").GetInt();
form->vSync = vSync->IsChecked();
form->textureQuality = textureQuality->GetSelection();
form->shadow = shadow->IsChecked();
form->hudSize = hudSize->GetSelection();
}
void MainMenuSettingsPanel::HandleChangeSettings(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::DropDownList*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
unsigned index = element->GetSelection();
if (index > 0) {
setValues(index);
}
}
void MainMenuSettingsPanel::HandleSaveSettings(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto form = SettingsForm::getFromElement(eventData);
popualateForm(form);
auto graphSettings = new db_graph_settings(0, form->hudSize, nullptr, form->fullScreen, form->maxFps,
form->minFps, nullptr, form->vSync, form->shadow,
form->textureQuality);
Game::getDatabase()->setGraphSettings(0, graphSettings);
Game::getDatabase()->setSettings(0, new db_settings(0, form->resolution));
}
```
SelectedHudElement.cpp
```#include "SelectedHudElement.h"
#include <Urho3D/UI/ProgressBar.h>
#include <Urho3D/UI/Text.h>
#include "hud/UiUtils.h"
#include "objects/Physical.h"
SelectedHudElement::SelectedHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style) {
selected.reserve(MAX_SELECTED_IN_BUTTON);
button = createElement<Urho3D::Button>(parent, style, "Icon");
button->SetVisible(false);
text = addChildText(button, "MyText", style);
icon = createElement<MySprite>(button, style, "NormalSprite");
button->SetVar("SelectedHudElement", this);
const auto mock = createElement<Urho3D::UIElement>(button, style, "mock");
bar = createElement<Urho3D::ProgressBar>(mock, style, "MiniProgressBar");
bar->SetRange(1);
bar->SetValue(0.5);
bar->SetVisible(false);
}
Urho3D::Button* SelectedHudElement::getButton() const {
return button;
}
void SelectedHudElement::hide() const {
button->SetVisible(false);
}
void SelectedHudElement::show() const {
button->SetVisible(true);
}
void SelectedHudElement::setText(const Urho3D::String& msg) const {
text->SetVisible(true);
text->SetText(msg);
}
void SelectedHudElement::hideText() const {
text->SetVisible(false);
}
void SelectedHudElement::setTexture(Urho3D::Texture2D* texture) const {
setTextureToSprite(icon, texture);
}
void SelectedHudElement::add(const std::vector<Physical*>& physicals, int start, int end) {
selected.clear();
float sum = 0;
for (int i = start; i < end; ++i) {
selected.push_back(physicals.at(i));
int ind = i - start;
if (ind < MAX_SELECTED_IN_BUTTON) {
sum += physicals.at(i)->getHealthPercent();
}
}
bar->SetRange(1);
bar->SetValue(sum + (end - start));
bar->SetVisible(true);
}
std::vector<Physical*>& SelectedHudElement::getSelected() {
return selected;
}
```
SceneLoader.cpp
```#include "SceneLoader.h"
#include "dbload_container.h"
#include "database/db_utils.h"
#include "scene/save/SQLConsts.h"
#include "utils/StringUtils.h"
SceneLoader::~SceneLoader() {
end();
}
void SceneLoader::load() {
loadPlayers();
loadResources();
loadUnits();
loadBuildings();
loadResourcesEntities();
close();
}
int static load_config(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
xyz->precision = atoi(argv[0]);
xyz->config->precision = xyz->precision;
xyz->config->map = atoi(argv[1]);
xyz->config->size = atoi(argv[2]);
return 0;
}
int static load_players(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
xyz->players->push_back(new dbload_player(atoi(argv[0]), atoi(argv[1]), atoi(argv[2]),
atoi(argv[3]), argv[4], atoi(argv[5])));
return 0;
}
int static load_resources(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
int p = xyz->precision;
xyz->resources->push_back(new dbload_resource(atoi(argv[0]), atoi(argv[1]), atof(argv[2]) / p));
return 0;
}
int static load_units(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
int p = xyz->precision;
xyz->units->push_back(new dbload_unit(atoi(argv[0]), atof(argv[1]) / p, atoi(argv[2]),
atoi(argv[3]), atof(argv[4]) / p, atof(argv[5]) / p,
atoi(argv[6]), atof(argv[7]) / p, atof(argv[8]) / p));
return 0;
}
int static load_buildings(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
int p = xyz->precision;
xyz->buildings->push_back(new dbload_building(atoi(argv[0]), atof(argv[1]) / p, atoi(argv[2]),
atoi(argv[3]), atoi(argv[4]), atoi(argv[5]),
atoi(argv[6]), atoi(argv[7]), atoi(argv[8])));
return 0;
}
int static load_resources_entities(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
float p = xyz->precision;
xyz->resource_entities->push_back(new dbload_resource_entities(fatoi(argv[0]), fatoi(argv[1]) / p, -1,
-1, fatoi(argv[4]), fatoi(argv[5]),
fatoi(argv[6]), fatoi(argv[7])));
return 0;
}
int static load_resources_entities_size(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = static_cast<dbload_container*>(data);
xyz->resource_entities->reserve(atoi(argv[0]));
return 0;
}
void SceneLoader::reset() {
database = nullptr;
delete dbLoad;
dbLoad = new dbload_container();
}
dbload_container* SceneLoader::getData() const {
return dbLoad;
}
void SceneLoader::createLoad(const Urho3D::String& fileName, bool tryReuse) {
if(fileName == lastLoad && tryReuse) {
return;
}
reset();
lastLoad = fileName;
std::string name = std::string("saves/") + fileName.CString();
int rc = sqlite3_open_v2(name.c_str(), &database, SQLITE_OPEN_READONLY, nullptr);
if (rc) {
std::cerr << "Error opening SQLite3 database: " << sqlite3_errmsg(database) << std::endl << std::endl;
sqlite3_close_v2(database);
}
load(SQLConsts::SELECT + "config", load_config);
}
dbload_config* SceneLoader::getConfig() const {
return dbLoad->config;
}
std::vector<dbload_player*>* SceneLoader::loadPlayers() {
if (dbLoad->players) { return dbLoad->players; }
dbLoad->players = new std::vector<dbload_player*>();
load(SQLConsts::SELECT + "players", load_players);
return dbLoad->players;
}
std::vector<dbload_resource*>* SceneLoader::loadResources() {
if (dbLoad->resources) { return dbLoad->resources; }
dbLoad->resources = new std::vector<dbload_resource*>();
load(SQLConsts::SELECT + "resources", load_resources);
return dbLoad->resources;
}
std::vector<dbload_unit*>* SceneLoader::loadUnits() {
if (dbLoad->units) { return dbLoad->units; }
dbLoad->units = new std::vector<dbload_unit*>();
load(SQLConsts::SELECT + "units", load_units);
return dbLoad->units;
}
std::vector<dbload_building*>* SceneLoader::loadBuildings() {
if (dbLoad->buildings) { return dbLoad->buildings; }
dbLoad->buildings = new std::vector<dbload_building*>();
load(SQLConsts::SELECT + "buildings", load_buildings);
return dbLoad->buildings;
}
std::vector<dbload_resource_entities*>* SceneLoader::loadResourcesEntities() {
if (dbLoad->resource_entities) { return dbLoad->resource_entities; }
dbLoad->resource_entities = new std::vector<dbload_resource_entities*>();
load(SQLConsts::COUNT + "resource_entities", load_resources_entities_size);
load(SQLConsts::SELECT + "resource_entities", load_resources_entities);
return dbLoad->resource_entities;
}
void SceneLoader::load(const std::string& sql, int (*load)(void*, int, char**, char**)) const {
char* error;
int rc = sqlite3_exec(database, sql.c_str(), load, dbLoad, &error);
ifError(rc, error, sql);
}
void SceneLoader::end() {
close();
//delete dbLoad;
//dbLoad = nullptr;
}
void SceneLoader::close() {
sqlite3_close_v2(database);
database = nullptr;
}
```
MainMenuNewGamePanel.h
```#pragma once
#include "NewGameTeamLine.h"
#include "hud/window/main_menu/MainMenuDetailsPanel.h"
struct NewGameForm;
namespace Urho3D {
class BorderImage;
class Button;
class DropDownList;
class Localization;
class XMLFile;
}
constexpr char NEW_GAME_ROWS_NUMBER = 5;
class MainMenuNewGamePanel : public MainMenuDetailsPanel {
public:
MainMenuNewGamePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuNewGamePanel();
Urho3D::Button* getProceed() const;
private:
void populateLabels(Urho3D::Localization* l10n, int index, const Urho3D::String& name);
void HandleCheck(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleNewGame(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void createBody() override;
Urho3D::BorderImage* rows[NEW_GAME_ROWS_NUMBER];
NewGameTeamLine myLine;
NewGameTeamLine enemyLine;
Urho3D::DropDownList* map;
Urho3D::DropDownList* difficulty;
Urho3D::DropDownList* gameSpeed;
Urho3D::Button* proceed;
NewGameForm* data;
};
```
SimInfo.cpp
```#include "SimInfo.h"
#include "FrameInfo.h"
SimInfo::SimInfo() {
frameInfo = new FrameInfo();
}
SimInfo::~SimInfo() { delete frameInfo; }
void SimInfo::setIsRealFrame(bool realFrame) const {
frameInfo->setIsRealFrame(realFrame);
}
void SimInfo::setFrame(unsigned char currentFrame, unsigned secondsElapsed) const {
frameInfo->setCurrentFrame(currentFrame);
frameInfo->setSeconds(secondsElapsed);
}
```
ResourceFactory.h
```#pragma once
namespace Urho3D {
class IntVector2;
class Vector2;
}
struct dbload_resource_entities;
class ResourceEntity;
class ResourceFactory {
public:
ResourceFactory() = default;
~ResourceFactory() = default;
ResourceEntity* create(int id, Urho3D::IntVector2 bucketCords, int level) const;
ResourceEntity* load(dbload_resource_entities* resource) const;
};
```
MainGrid.h
```#pragma once
#include <array>
#include <optional>
#include "ComplexBucketData.h"
#include "Grid.h"
#include "objects/resource/ResourceEntity.h"
#include "path/PathFinder.h"
namespace Urho3D {
class Image;
}
class Unit;
struct content_info;
enum class GridDebugType : char {
NONE,
CELLS_TYPE
};
class MainGrid : public Grid {
public:
MainGrid(short resolution, float size, float maxQueryRadius);
MainGrid(const MainGrid& rhs) = delete;
~MainGrid() override;
void prepareGridToFind() const;
bool validateAdd(const Urho3D::IntVector2& size, Urho3D::IntVector2 bucketCords, bool isBuilding) const;
void addStatic(Static* object);
void removeStatic(Static* object) const;
std::optional<Urho3D::Vector2> getDirectionFrom(int index, const Urho3D::Vector3& position) const;
Urho3D::Vector2 getValidPosition(const Urho3D::IntVector2& size, const Urho3D::Vector2& pos) const;
Urho3D::Vector2 getValidPosition(const Urho3D::IntVector2& size, const Urho3D::IntVector2& cords) const;
void updateNeighbors(ComplexBucketData& data, int current) const;
float cost(const Urho3D::IntVector2& centerParams, int next) const;
const std::vector<int>* findPath(int startIdx, int endIdx, int limit);
const std::vector<int>* findPath(int startIdx, const std::vector<int>& endIdxs, int limit);
void drawComplex(Urho3D::Image* image, Urho3D::String prefix) const;
Urho3D::Vector2 repulseObstacle(Unit* unit) const;
void invalidatePathCache();
Urho3D::Vector2 getPositionInBucket(Unit* unit) const;
bool cellInState(int index, CellState state) const;
void updateCell(int index, char val, CellState cellState) const;
unsigned char getRevertCloseIndex(int center, int gridIndex) const;
void addDeploy(Building* building) const;
void removeDeploy(Building* building) const;
bool isInLocalArea(int center, int indexOfAim) const;
bool isInLocal1and2Area(int center, int indexOfAim) const;
bool isPassable(int inx) const;
bool isBuildable(int inx) const;
int closestPassableCell(int posIndex) const;
void addResourceBonuses(Building* building) const;
void removeResourceBonuses(Static* object) const;
CellState getCellAt(float x, float z) const;
int getAdditionalInfoAt(float x, float z) const;
void drawDebug(GridDebugType type) const;
Urho3D::Vector3 getVertex(Urho3D::Vector2 center, Urho3D::Vector2 vertex) const;
float getFieldSize() const;
void drawAll();
bool cellIsCollectable(int index) const;
bool cellIsAttackable(int index) const;
bool anyCloseEnough(std::vector<int> const& indexes, int center, float distThreshold) const;
std::vector<int> getIndexesInRange(const Urho3D::Vector3& center, float range) const;
void reAddBonuses(std::vector<Building*>* buildings, char player, char resId) const;
float getBonuses(char player, const ResourceEntity* resource) const;
private:
ComplexBucketData* complexData;
PathFinder pathFinder;
std::array<Urho3D::Vector2, 4> posInBucket;
int counter = 0;
};
```
Game.cpp
```#include "Game.h"
Game* Game::instance = nullptr;
Game::Game() = default;
void Game::init() {
if (instance == nullptr) {
instance = new Game();
}
}
void Game::dispose() {
delete instance;
}
Game* Game::setCache(Urho3D::ResourceCache* _cache) {
instance->cache = _cache;
return instance;
}
Game* Game::setContext(Urho3D::Context* _context) {
instance->context = _context;
return instance;
}
Game* Game::setUI(Urho3D::UI* _ui) {
instance->ui = _ui;
return instance;
}
Game* Game::setGraphics(Urho3D::Graphics* _graphics) {
instance->graphics = _graphics;
return instance;
}
Game* Game::setScene(Urho3D::Scene* scene) {
instance->scene = scene;
return instance;
}
Game* Game::setCameraManager(CameraManager* cameraManager) {
instance->cameraManager = cameraManager;
return instance;
}
Game* Game::setConsole(Urho3D::Console* _console) {
instance->console = _console;
return instance;
}
Game* Game::setLocalization(Urho3D::Localization* _localization) {
instance->localization = _localization;
return instance;
}
Game* Game::setDatabaseCache(DatabaseCache* _databaseCache) {
instance->databaseCache = _databaseCache;
return instance;
}
Game* Game::setPlayersManager(PlayersManager* _playersManager) {
instance->playersManager = _playersManager;
return instance;
}
Game* Game::setEnvironment(Environment* _environment) {
instance->environment = _environment;
return instance;
}
Game* Game::setFormationManager(FormationManager* _formationManager) {
instance->formationManager = _formationManager;
return instance;
}
Game* Game::setColorPaletteRepo(ColorPaletteRepo* _colorPaletteRepo) {
instance->colorPaletteRepo = _colorPaletteRepo;
return instance;
}
Game* Game::setLog(Urho3D::Log* _log) {
instance->log = _log;
return instance;
}
Game* Game::setAiInputProvider(AiInputProvider* _aiInputProvider) {
instance->aiInputProvider = _aiInputProvider;
return instance;
}
Game* Game::setActionCenter(ActionCenter* _actionCenter) {
instance->actionCenter = _actionCenter;
return instance;
}
void Game::addTime(float time) {
instance->accumTime += time;
}
```
Benchmark.cpp
```#include "Benchmark.h"
#include <algorithm>
#include <ctime>
#include <numeric>
#include <string>
Benchmark::Benchmark() {
if constexpr (BENCH_SAVE) {
auto now = time(0);
auto ltm = localtime(&now);
std::string name = "result/" + std::to_string(1900 + ltm->tm_year) + "" + std::to_string(1 + ltm->tm_mon) + "" +
std::to_string(ltm->tm_mday) + "" + std::to_string(1 + ltm->tm_hour) + "" +
std::to_string(1 + ltm->tm_min) + "" + std::to_string(+ ltm->tm_sec) + "performance.txt";
output.open(name);
}
}
Benchmark::~Benchmark() {
if constexpr (BENCH_SAVE) {
output.close();
}
}
void Benchmark::add(float fps) {
if (index >= BENCH_LENGTH) {
index = 0;
std::sort(data, data + BENCH_LENGTH);
avgLowest = roundf(std::accumulate(std::begin(data), data + PERCENT, 0.f) / PERCENT);
avgMiddle = roundf(std::accumulate(data + PERCENT, data + PERCENT2, 0.f) / (PERCENT2 - PERCENT));
avgHighest = roundf(std::accumulate(data + PERCENT2, data + BENCH_LENGTH, 0.f) / (BENCH_LENGTH - PERCENT2));
save();
}
data[index] = fps;
++index;
}
void Benchmark::save() {
if constexpr (BENCH_SAVE) {
for (float count : data) {
output << count << std::endl;
}
}
}
```
Bucket.cpp
```#include "Bucket.h"
#include <algorithm>
#include "objects/Physical.h"
int Bucket::getSize() const {
return content.size();
}
void Bucket::reserve(int i) {
content.reserve(i);
}
void Bucket::add(Physical* entity) {
content.push_back(entity);
}
void Bucket::add(const std::vector<Physical*>& things) {
content.insert(content.end(), things.begin(), things.end());
}
void Bucket::remove(Physical* entity) {
auto pos = std::ranges::find(content, entity) - content.begin();
if (pos < content.size()) {
content.erase(content.begin() + pos);
// std::iter_swap(content.begin() + pos, content.end()-1);
// content.erase(content.end()-1);
} else {
assert(false);
}
}
```
GeneralActionCommand.h
```#pragma once
#include "commands/AbstractCommand.h"
enum class GeneralActionType : char;
class GeneralActionCommand : public AbstractCommand {
friend class Stats;
public:
GeneralActionCommand(short id, GeneralActionType action, char player);
void clean() override;
bool expired() override;
void execute() override;
private:
short id;
GeneralActionType action;
};
```
UpgradeCommand.h
```#pragma once
#include "commands/AbstractCommand.h"
enum class ActionType : char;
enum class QueueActionType : char;
class SimulationObjectManager;
class UpgradeCommand : public AbstractCommand {
friend class Stats;
public:
UpgradeCommand(char player, int id, QueueActionType type);
~UpgradeCommand() override = default;
void execute() override;
void setSimulationObjectManager(SimulationObjectManager* _simulationObjectManager);
private:
QueueActionType type;
short id;
SimulationObjectManager* simulationObjectManager;
};
```
PathFinder.h
```#pragma once
#include <vector>
#include "fiboheap.h"
#include "Urho3D/Math/Vector2.h"
namespace Urho3D {
class Vector3;
class Image;
}
struct GridCalculator;
struct CloseIndexes;
class ComplexBucketData;
//TODO perf zrobic takiego wstepnego findera o nizesz rozdzielczosci jezeli sa w jednym squere i tam nic niema to mozna isc prosto
class PathFinder {
public:
PathFinder(short resolution, float size);
~PathFinder();
void setComplexBucketData(ComplexBucketData* complexData);
const std::vector<int>* reconstructPath(int start, int goal, const int came_from[]) const;
const std::vector<int>* reconstructSimplifyPath(int start, int goal, const int came_from[]) const;
const std::vector<int>* findPath(int startIdx, int endIdx, int limit);
const std::vector<int>* findPath(int startIdx, const std::vector<int>& endIdxs, int limit);
void refreshWayOut(std::vector<int>& toRefresh);
void invalidateCache();
void debug(int start, int end);
void drawMap(Urho3D::Image* image) const;
private:
const std::vector<int>* realFindPath(int startIdx, const std::vector<int>& endIdxs, int limit);
const std::vector<int>* getClosePath2(int startIdx, int endIdx, const std::vector<short>& closePass) const;
void prepareToStart(int startIdx);
bool validateIndex(int current, int next) const;
int getPassableEnd(int endIdx) const;
std::vector<int> getPassableIndexes(const std::vector<int>& endIdxs) const;
float heuristic(const Urho3D::IntVector2& from, const Urho3D::IntVector2& to) const;
float heuristic(int from, const Urho3D::IntVector2& to) const;
float heuristic(int from, std::vector<Urho3D::IntVector2>& endIdxs) const;
bool ifInCache(int startIdx, int end) const { return lastStartIdx == startIdx && lastEndIdx == end; }
bool ifInCache(int startIdx, const std::vector<int>& endIdxs) const;
Urho3D::IntVector2 getCords(int index) const { return Urho3D::IntVector2(index / resolution, index % resolution); }
std::vector<Urho3D::IntVector2> getCords(const std::vector<int>& endIdxs) const;
void resetPathArrays();
bool isInLocalArea(int center, int indexOfAim) const;
bool isInLocal2Area(int center, int indexOfAim) const;
int isInLocalArea(int center, std::vector<int>& endIdxs) const;
void updateCost(int idx, float x);
CloseIndexes* closeIndexes;
GridCalculator* calculator;
FibHeap frontier;
std::vector<int>* tempPath = new std::vector<int>();
std::vector<int>* closePath = new std::vector<int>();
int lastStartIdx = -1;
int lastEndIdx = -1;
const short resolution;
const float fieldSize;
int* came_from;
float* cost_so_far;
ComplexBucketData* complexData;
int min_cost_to_ref = 0;
int max_cost_to_ref;
unsigned short staticCounter = 0;
};
```
DisposeState.h
```#pragma once
#include "State.h"
class DisposeState : public State
{
public:
DisposeState(): State({}) {
}
~DisposeState() override = default;
};
```
ActionCenter.h
```#pragma once
#include "commands/creation/CreationCommandList.h"
#include "commands/upgrade/UpgradeCommandList.h"
namespace Urho3D {
class Vector2;
}
enum class QueueActionType : char;
class UnitOrder;
class GeneralActionCommand;
class BuildingActionCommand;
class ResourceActionCommand;
class SimulationObjectManager;
class UnitActionCommand;
class CreationCommand;
class UpgradeCommand;
class ActionCenter {
public:
explicit ActionCenter(SimulationObjectManager* simulationObjectManager);
void add(UpgradeCommand* command);
void add(GeneralActionCommand* command);
void add(ResourceActionCommand* command);
void add(BuildingActionCommand* command);
void addUnitAction(UnitOrder* first, char player);
void addUnitAction(UnitOrder* first, UnitOrder* second, char player);
void executeActions();
void executeLists();
bool addUnits(int number, int id, Urho3D::Vector2 position, char player);
bool addBuilding(int id, Urho3D::Vector2& position, char player, bool force);
bool addResource(int id, Urho3D::Vector2& position);
private:
bool addUnits(int number, int id, Urho3D::Vector2& position, char player, int level);
bool addBuilding(int id, Urho3D::Vector2& position, char player, int level, bool force);
CreationCommandList creation;
UpgradeCommandList upgrade;
CommandList action;
};
```
db_load.h
```#pragma once
#include <cstdlib>
#include <iosfwd>
#include "db_other_struct.h"
static unsigned fromHex(char** argv, int index) {
unsigned x;
std::stringstream ss;
ss << std::hex << argv[index];
ss >> x;
return x;
}
static db_container* getContainer(void* data) { return static_cast<db_container*>(data); }
int static loadUnits(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->units, new db_unit(atoi(argv[0]), argv[1], argv[2], atoi(argv[3]),
atoi(argv[4]), atoi(argv[5]), atoi(argv[6]), atoi(argv[7]),
atoi(argv[8]), atoi(argv[9]), atoi(argv[10]),
atoi(argv[11])));
return 0;
}
int static loadHudSizes(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
getContainer(data)->hudSizes.push_back(new db_hud_size(atoi(argv[0]), argv[1]));
return 0;
}
int static loadGraphSettings(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->graphSettings, new db_graph_settings(atoi(argv[0]), atoi(argv[1]), argv[2],
atoi(argv[3]),
atof(argv[4]), atof(argv[5]), argv[6],
atoi(argv[7]), atoi(argv[8]), atoi(argv[9])));
return 0;
}
int static loadBuildings(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->buildings,
new db_building(atoi(argv[0]), argv[1], argv[2], atoi(argv[3]), atoi(argv[4]),
atoi(argv[5]), atoi(argv[6]), atoi(argv[7]), atoi(argv[8]), atoi(argv[9]),
atoi(argv[10]), atoi(argv[11]), atoi(argv[12]), atoi(argv[13]), atoi(argv[14]),
atoi(argv[15]), atoi(argv[16])
));
return 0;
}
int static loadNation(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->nations, new db_nation(atoi(argv[0]), argv[1], argv[2], argv[3]));
return 0;
}
int static loadResource(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto resource = new db_resource(atoi(argv[0]), argv[1], argv[2], atoi(argv[3]), argv[4],
atoi(argv[5]), atoi(argv[6]), atoi(argv[7]), fromHex(argv, 8));
setEntity(getContainer(data)->resources, resource);
return 0;
}
int static loadHudVars(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const int id = atoi(argv[0]);
getContainer(data)->hudVars.push_back(new db_hud_vars(id, atoi(argv[1]), argv[2], atof(argv[3])));
return 0;
}
static void addCost(char** argv, db_with_cost* withCost) {
withCost->costs = new db_cost(atoi(argv[1]), atoi(argv[2]), atoi(argv[3]), atoi(argv[4]));
}
int static loadCostUnit(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
addCost(argv, getContainer(data)->units[atoi(argv[0])]);
return 0;
}
int static loadCostUnitLevel(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
addCost(argv, getContainer(data)->unitsLevels[atoi(argv[0])]);
return 0;
}
int static loadCostBuildingLevel(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
addCost(argv, getContainer(data)->buildingsLevels[atoi(argv[0])]);
return 0;
}
int static loadCostBuilding(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
addCost(argv, getContainer(data)->buildings[atoi(argv[0])]);
return 0;
}
int static loadOrders(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->orders, new db_order(atoi(argv[0]), argv[1], argv[2]));
return 0;
}
int static loadMap(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->maps, new db_map(atoi(argv[0]), argv[1], argv[2]));
return 0;
}
int static loadPlayerColors(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->playerColors,
new db_player_colors(atoi(argv[0]), fromHex(argv, 1), fromHex(argv, 2), argv[3]));
return 0;
}
int static loadResolution(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
setEntity(getContainer(data)->resolutions, new db_resolution(atoi(argv[0]), atoi(argv[1]), atoi(argv[2])));
return 0;
}
int static loadSettings(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
ensureSize(1, xyz->settings);
xyz->settings[0] = new db_settings(atoi(argv[0]), atoi(argv[1]));
return 0;
}
int static loadBuildingLevels(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
auto level = new db_building_level(atoi(argv[0]), atoi(argv[1]), atoi(argv[2]), argv[3], argv[4],
atoi(argv[5]), atoi(argv[6]), atoi(argv[7]), atoi(argv[8]),
atof(argv[9]), atof(argv[10]), atof(argv[11]), atof(argv[12]),
atoi(argv[13]), atof(argv[14]), atof(argv[15]));
setEntity(xyz->buildingsLevels, level);
xyz->buildings[level->building]->levels.push_back(level);
for (auto nation : xyz->nations) {
if (nation) {
ensureSize(nation->id + 1, level->unitsPerNation);
ensureSize(nation->id + 1, level->unitsPerNationIds);
if (level->unitsPerNation[nation->id] == nullptr) {
level->unitsPerNation[nation->id] = new std::vector<db_unit*>();
}
if (level->unitsPerNationIds[nation->id] == nullptr) {
level->unitsPerNationIds[nation->id] = new std::vector<unsigned char>();
}
}
}
return 0;
}
int static loadUnitLevels(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
auto levelId = atoi(argv[0]);
int unitId = atoi(argv[2]);
auto level = new db_unit_level(levelId, atoi(argv[1]), atoi(argv[2]), argv[3], argv[4], atoi(argv[5]),
atoi(argv[6]), atof(argv[7]), atof(argv[8]), atof(argv[9]), atof(argv[10]),
atoi(argv[11]), atoi(argv[12]), atof(argv[13]), atof(argv[14]), atof(argv[15]),
atof(argv[16]), atof(argv[17]), atoi(argv[18]), atof(argv[19]), atof(argv[20]),
atof(argv[21]), atof(argv[22]), atof(argv[23]), atof(argv[24]), atof(argv[25]),
atof(argv[26]), atof(argv[27]));
setEntity(xyz->unitsLevels, level);
xyz->units[unitId]->levels.push_back(level);
return 0;
}
int static loadUnitToNation(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
auto unit = xyz->units[atoi(argv[0])];
auto nation = xyz->nations[atoi(argv[1])];
nation->units.push_back(unit);
if (unit->typeWorker) {
nation->workers.push_back(unit);
}
unit->nations.push_back(nation);
return 0;
}
int static loadBuildingToNation(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
auto building = xyz->buildings[atoi(argv[0])];
auto nation = xyz->nations[atoi(argv[1])];
nation->buildings.push_back(building);
building->nations.push_back(nation);
return 0;
}
int static loadUnitToBuildingLevels(void* data, int argc, char** argv, char** azColName) {
if (argc == 0) { return 0; }
const auto xyz = getContainer(data);
auto level = xyz->buildingsLevels[atoi(argv[0])];
auto unit = xyz->units[atoi(argv[1])];
level->allUnits.push_back(unit);
for (auto nation : unit->nations) {
level->unitsPerNation[nation->id]->push_back(unit);
level->unitsPerNationIds[nation->id]->push_back(unit->id);
}
return 0;
}
static int callback(void* data, int argc, char** argv, char** azColName) {
return 0;
}
```
fiboheap.h
```#pragma once
#include <cassert>
#include <cmath>
#include <vector>
#include "utils/DeleteUtils.h"
constexpr short CACHE_SIZE = 8192;
static unsigned char DEGREE_CACHE[CACHE_SIZE];
class FibHeap {
public:
class FibNode {
public:
FibNode(const float k, const int pl):
left(nullptr), right(nullptr), child(nullptr),
key(k), payload(pl), degree(0), used(false) { }
FibNode(const FibNode& obj) = delete;
~FibNode() = default;
bool isEmpty() const {
return key < 0.f;
}
void reset() {
left = nullptr;
right = nullptr;
child = nullptr;
key = -1.f;
payload = -1;
degree = 0;
}
FibNode* left;
FibNode* right;
FibNode* child;
float key;
int payload;
unsigned short degree;
bool used;
};
FibHeap(): tempSize(64) {
temp = new FibNode*[tempSize];
constexpr short initialSize = 1024;
freePool.reserve(initialSize);
allPool.reserve(initialSize);
for (auto i = 0; i < initialSize; ++i) {
auto fn = new FibNode(-1, -1);
freePool.push_back(fn);
allPool.push_back(fn);
}
}
FibHeap(const FibHeap& obj) = delete;
~FibHeap() {
delete[] temp;
clear_vector(allPool);
}
FibNode* getNode(const int pl, const float k) {
assert(pl >= 0);
assert(k >= 0.f);
if (freePool.empty()) {
const auto fn = new FibNode(k, pl);
allPool.push_back(fn);
return fn;
}
const auto fibNode = freePool.back();
freePool.pop_back();
fibNode->payload = pl;
fibNode->key = k;
return fibNode;
}
void resetNode(FibNode* node) {
if (node->key >= 0.f) {
freePool.push_back(node);
}
node->reset();
}
void clear() {
n = 0;
minNode = nullptr;
for (const auto fibNode : usedPool) {
resetNode(fibNode);
fibNode->used = false;
}
assert(allPool.size() == freePool.size());
usedPool.clear();
std::fill_n(temp, tempSize, nullptr);
}
void ensureSizeAndClear(unsigned int size) {
if (tempSize < size) {
tempSize = size;
delete[] temp;
temp = new FibNode*[tempSize];
}
std::fill_n(temp, tempSize, nullptr);
}
FibNode* extractMin() {
const auto z = minNode;
if (z != nullptr) {
auto x = z->child;
if (x != nullptr) {
ensureSizeAndClear(z->degree);
auto next = x;
for (auto i = 0; i < z->degree; ++i) {
temp[i] = next;
next = next->right;
}
for (auto i = 0; i < z->degree; ++i) {
x = temp[i];
minNode->left->right = x;
x->left = minNode->left;
minNode->left = x;
x->right = minNode;
}
}
z->left->right = z->right;
z->right->left = z->left;
if (z == z->right) {
minNode = nullptr;
} else {
minNode = z->right;
consolidate();
}
--n;
}
return z;
}
void consolidate() {
assert(n<CACHE_SIZE);
auto w = minNode;
unsigned short rootSize = 0;
auto next = w;
do {
++rootSize;
next = next->right;
} while (next != w);
const auto maxDegree = DEGREE_CACHE[n];
const auto secondSize = maxDegree + rootSize;
ensureSizeAndClear(secondSize);
for (int i = maxDegree; i < secondSize; ++i) {
temp[i] = next;
next = next->right;
}
for (int i = maxDegree; i < secondSize; ++i) {
w = temp[i];
auto x = w;
int d = x->degree;
while (temp[d] != nullptr) {
auto y = temp[d];
if (x->key > y->key) {
std::swap(x, y);
}
fibHeapLink(y, x);
temp[d] = nullptr;
++d;
}
temp[d] = x;
}
minNode = nullptr;
auto tii = temp;
for (auto i = 0; i < maxDegree; ++i, ++tii) {
const auto ti = *tii;
if (ti != nullptr) {
if (minNode == nullptr) {
minNode = ti->left = ti->right = ti;
} else {
minNode->left->right = ti;
ti->left = minNode->left;
minNode->left = ti;
ti->right = minNode;
if (ti->key < minNode->key) {
minNode = ti;
}
}
}
}
}
static void fibHeapLink(FibNode* y, FibNode* x) {
y->left->right = y->right;
y->right->left = y->left;
if (x->child != nullptr) {
x->child->left->right = y;
y->left = x->child->left;
x->child->left = y;
y->right = x->child;
} else {
x->child = y;
y->right = y;
y->left = y;
}
++x->degree;
assert(x->degree<60000);
}
bool empty() const {
return n == 0;
}
void pop() {
if (empty()) {
return;
}
const auto x = extractMin();
if (x) {
resetNode(x);
}
}
int get() {
const auto toReturn = minNode->payload;
pop();
return toReturn;
}
void put(const int pl, const float k) {
const auto x = getNode(pl, k);
if (!x->used) {
usedPool.push_back(x);
x->used = true;
}
x->degree = 0;
//x->child = nullptr;
if (minNode == nullptr) {
minNode = x->left = x->right = x;
} else {
minNode->left->right = x;
x->left = minNode->left;
minNode->left = x;
x->right = minNode;
if (x->key < minNode->key) {
minNode = x;
}
}
++n;
}
FibNode* minNode{};
std::vector<FibNode*> freePool;
std::vector<FibNode*> allPool;
std::vector<FibNode*> usedPool;
FibNode** temp;
unsigned short tempSize;
int n{0};
static void initCache() {
const auto coef = 1 / log(static_cast<double>(1 + sqrt(static_cast<double>(5))) / 2);
for (auto i = 0; i < CACHE_SIZE; ++i) {
DEGREE_CACHE[i] = static_cast<unsigned char>(floor(log(static_cast<double>(i)) * coef)) + 2;
// plus two both for indexing to max degree and so A[max_degree+1] == NIL
}
}
};
```
CameraManager.cpp
```#include "CameraManager.h"
#include "FreeCameraBehave.h"
#include "Game.h"
#include "RtsCameraBehave.h"
#include "TopCameraBehave.h"
#include "CameraEnums.h"
#include "env/Environment.h"
#include <Urho3D/Graphics/Graphics.h>
#include <Urho3D/Input/Input.h>
#include "simulation/SimGlobals.h"
#include "utils/OtherUtils.h"
CameraManager::CameraManager() {
if (!SIM_GLOBALS.HEADLESS) {
cameraBehaves[0] = new FreeCameraBehave();
cameraBehaves[1] = new RtsCameraBehave();
cameraBehaves[2] = new TopCameraBehave();
activeBehave = cameraBehaves[1];
float border = 256.f;
auto graphics = Game::getGraphics();
if (graphics) {
const int width = Game::getGraphics()->GetWidth();
const int height = Game::getGraphics()->GetHeight();
widthEdge = width / border;
heightEdge = height / border;
widthEdgeMax = width - widthEdge;
heightEdgeMax = height - heightEdge;
}
}
camInfo = new CameraInfo();
}
CameraManager::~CameraManager() {
clear_array(cameraBehaves, 3);
delete camInfo;
}
void CameraManager::setCameraBehave(CameraBehaviorType _type) {
auto& pos = activeBehave->getPosition();
activeBehave = cameraBehaves[cast(_type)];
activeBehave->setPos(pos);
hasMoved = true;
}
Urho3D::Camera* CameraManager::getComponent() const {
return activeBehave->getComponent();
}
void CameraManager::createCameraKeys(Urho3D::Input* input, bool cameraKeys[4],
const Urho3D::IntVector2& cursorPos) const {
cameraKeys[0] = input->GetKeyDown(Urho3D::KEY_W);
cameraKeys[1] = input->GetKeyDown(Urho3D::KEY_S);
cameraKeys[2] = input->GetKeyDown(Urho3D::KEY_A);
cameraKeys[3] = input->GetKeyDown(Urho3D::KEY_D);
if (cursorPos.x_ < widthEdge) {
cameraKeys[2] = true;
} else if (cursorPos.x_ > widthEdgeMax) {
cameraKeys[3] = true;
}
if (cursorPos.y_ < heightEdge) {
cameraKeys[0] = true;
} else if (cursorPos.y_ > heightEdgeMax) {
cameraKeys[1] = true;
}
}
void CameraManager::translate(const Urho3D::IntVector2& cursorPos, Urho3D::Input* input, float timeStep) {
bool cameraKeys[4];
createCameraKeys(input, cameraKeys, cursorPos);
const int wheel = input->GetMouseMoveWheel();
const Urho3D::Vector3 pos = activeBehave->getPosition();
const float min = Game::getEnvironment()->getGroundHeightAt(pos.x_, pos.z_);
hasMoved = activeBehave->translate(cameraKeys, wheel, timeStep * MOVE_SPEED, min) || hasMoved;
hasMoved = activeBehave->rotate(input->GetMouseMove(), MOUSE_SENSITIVITY) || hasMoved;
if (hasMoved) {
camInfo->info = activeBehave->getInfo();
}
}
const Urho3D::String& CameraManager::getPosInfo() const {
return camInfo->info;
}
Urho3D::MouseMode CameraManager::getMouseMode() const {
return activeBehave->getMouseMode();
}
void CameraManager::changePositionInPercent(float x, float y) {
activeBehave->changeTargetInPercent(x, y);
hasMoved = true;
camInfo->info = activeBehave->getInfo();
}
void CameraManager::changePosition(float x, float y) {
activeBehave->changeTarget(x, y);
hasMoved = true;
camInfo->info = activeBehave->getInfo();
}
const Urho3D::Vector2 CameraManager::getTargetPos() const {
return activeBehave->getTargetPos();
}
const CameraInfo* CameraManager::getCamInfo(float radius) {
if (!SIM_GLOBALS.HEADLESS) {
auto camPos = activeBehave->getTargetPos();
camInfo->boundary = Urho3D::Vector4(camPos.x_ - radius, camPos.x_ + radius, camPos.y_ - radius,
camPos.y_ + radius);
camInfo->hasMoved = hasMoved;
hasMoved = false;
} else {
camInfo->boundary = Urho3D::Vector4::ZERO;
camInfo->hasMoved = false;
hasMoved = false;
}
return camInfo;
}
```
TopHudElement.h
```#pragma once
#include "Urho3D/Container/Str.h"
namespace Urho3D {
class String;
class Button;
class Text;
class Texture2D;
class ToolTip;
class UIElement;
class XMLFile;
}
class MySprite;
class TopHudElement {
public:
TopHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style, Urho3D::Texture2D* texture,
Urho3D::String styleName = "TopButtons");
~TopHudElement() = default;
void hide() const;
void show() const;
void setText(const Urho3D::String& msg, const Urho3D::String& msg1) const;
private:
MySprite* icon;
Urho3D::Button* button;
Urho3D::Text* value;
Urho3D::Text* value1;
Urho3D::ToolTip* toolTip;
};
```
ResourceEntity.h
```#pragma once
#include "objects/static/Static.h"
namespace Urho3D {
class Vector3;
}
struct dbload_resource_entities;
struct db_resource;
enum class ResourceActionType : char;
class ResourceEntity : public Static {
public:
ResourceEntity(Urho3D::Vector3 _position, int id, int level, int indexInGrid, bool withNode);
virtual ~ResourceEntity() = default;
void populate() override;
std::pair<float, bool> absorbAttack(float collectSpeed) override;
ResourceEntity* load(dbload_resource_entities* resource);
char getPlayer() const override { return -1; }
const Urho3D::IntVector2 getGridSize() const override;
unsigned short getMaxHpBarSize() const override;
Urho3D::String getInfo() const override;
const Urho3D::String& getName() const override;
std::string getValues(int precision) override;
void action(ResourceActionType type, char player);
bool canUse(int index) const override;
float getModelHeight() const override;
void setModelData(float modelHeight) const override;
ObjectType getType() const override { return ObjectType::RESOURCE; }
unsigned char getMaxCloseUsers() const override;
short getCostSum() const override { return 0; }
private:
db_resource* dbResource;
};
```
VisibilityManager.h
```#pragma once
#include <vector>
#include <Urho3D/Container/Ptr.h>
#include "VisibilityMode.h"
class Physical;
namespace Urho3D {
class Terrain;
class Texture2D;
class Image;
class Vector2;
}
class ResourceEntity;
class Unit;
class Building;
struct GridCalculator;
class VisibilityMap;
class VisibilityManager {
public:
VisibilityManager(char numberOfPlayers, float mapSize, Urho3D::Terrain* terrain);
~VisibilityManager();
void setToImage(unsigned* data, std::array<int, 4>& indexes, unsigned color);
void setToImage(unsigned* data, std::array<int, 4>& indexes, unsigned color, bool operatorA);
void hideOrShow(VisibilityMap* current, Physical* physical);
void updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units, std::vector<ResourceEntity*>* resources);
void drawMaps(short currentDebugBatch, char index) const;
bool isVisible(char player, const Urho3D::Vector2& pos) const;
float getVisibilityScore(char player) const;
int removeUnseen(char player, float* intersection) const;
void nextVisibilityType();
private:
std::vector<VisibilityMap*> visibilityPerPlayer;
GridCalculator* calculator;
Urho3D::SharedPtr<Urho3D::Image> image;
unsigned* dataCopy{};
Urho3D::Texture2D* texture{};
VisibilityMode visibilityMode = VisibilityMode::PLAYER_ONLY;
bool imageChanged;
};
```
CreationCommand.h
```#pragma once
#include "commands/AbstractCommand.h"
#include <Urho3D/Math/Vector2.h>
enum class ObjectType : char;
class SimulationObjectManager;
class CreationCommand : public AbstractCommand {
friend class Stats;
public:
CreationCommand(ObjectType type, int id, const Urho3D::IntVector2 bucketCords, char level, char player);
CreationCommand(ObjectType type, int id, const Urho3D::Vector2& position, char level, char player, int number);
virtual ~CreationCommand() = default;
void execute() override;
void setSimulationObjectManager(SimulationObjectManager* _simulationObjectManager);
private:
SimulationObjectManager* simulationObjectManager;
Urho3D::Vector2 position;
Urho3D::IntVector2 bucketCords;
int number;
ObjectType objectType;
char id;
char level;
};
```
MenuPanel.h
```#pragma once
#include <vector>
#include "LeftMenuModes.h"
#include "database/db_basic_struct.h"
#include "hud/window/EventPanel.h"
namespace Urho3D {
class Button;
class CheckBox;
class XMLFile;
class UIElement;
}
constexpr char ROWS_NUMBER = 4;
constexpr char CHECKS_NUMBER = 3;
constexpr char BUTTONS_PER_ROW = 4;
constexpr char BUTTONS_NUMBER = BUTTONS_PER_ROW * (ROWS_NUMBER - 1);
enum class ActionType : char;
enum class LeftMenuMode : char;
class SelectedInfo;
class HudData;
class LeftMenuInfoPanel;
class MySprite;
class MenuPanel : public EventPanel {
public:
explicit MenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~MenuPanel();
void removeHoverInfo() const;
void refresh(LeftMenuMode _mode, SelectedInfo* selectedInfo);
void setHoverInfo(HudData* hudData) const;
void updateSelected(SelectedInfo* selectedInfo) const;
void setVisible(bool enable) override;
std::vector<HudData*>& getButtons();
void clearSelected() const;
private:
void setCheckVisibility(std::initializer_list<bool> active);
void updateMode(LeftMenuMode mode);
void createBody() override;
void setChecks(char val);
void ChangeModeButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void NextPage(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void setNext(int& k, const Urho3D::String& texture, short id, ActionType menuAction, Urho3D::String text = "") const;
void basicUnit(SelectedInfo* selectedInfo);
void levelUnit(SelectedInfo* selectedInfo);
void basicBuilding();
void levelBuilding();
void basicOrder(SelectedInfo* selectedInfo);
void formationOrder();
void buildingMenu();
void unitMenu(SelectedInfo* selectedInfo);
void orderMenu(SelectedInfo* selectedInfo);
void basicResource(SelectedInfo* selectedInfo);
void resourceMenu(SelectedInfo* selectedInfo);
void updateButtons(SelectedInfo* selectedInfo);
void resetRestButtons(int from) const;
std::vector<unsigned char> getUnitInBuilding(SelectedInfo* selectedInfo) const;
std::vector<unsigned char> getOrderForUnit(SelectedInfo* selectedInfo) const;
template <typename T>
void setIcons(const std::vector<T*>& icons, Urho3D::String path, ActionType type);
Urho3D::Button* buttons[BUTTONS_NUMBER];
std::vector<HudData*> hudElements;
MySprite* sprites[BUTTONS_NUMBER];
Urho3D::CheckBox* checks[CHECKS_NUMBER];
LeftMenuInfoPanel* infoPanel;
SelectedInfo* lastSelectedInfo = nullptr;
char page = 0;
char maxPage = 1;
LeftMenuMode mode = LeftMenuMode::UNIT;
LeftMenuSubMode subMode = LeftMenuSubMode::BASIC;
};
```
MainMenuPanel.h
```#pragma once
#include "hud/window/EventPanel.h"
namespace Urho3D {
class BorderImage;
class Button;
class XMLFile;
}
constexpr char MAIN_MENU_BUTTON_NUMBER = 5;
class MainMenuDetailsPanel;
class MainMenuPanel : public EventPanel {
public:
explicit MainMenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~MainMenuPanel();
void action(short id) const;
void close() const;
void setVisible(bool enable) override;
Urho3D::Button* getNewGameProceed() const;
Urho3D::Button* getLoadButton() const;
Urho3D::Button* getCloseButton() const;
void HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
private:
void createBody() override;
MainMenuDetailsPanel* detailsPanels[MAIN_MENU_BUTTON_NUMBER];
Urho3D::BorderImage* background;
};
```
ActionMaker.cpp
```#include "ActionMaker.h"
#include <format>
#include "AiTypes.h"
#include "AiUtils.h"
#include "Game.h"
#include "commands/action/BuildingActionCommand.h"
#include "commands/action/BuildingActionType.h"
#include "commands/action/GeneralActionCommand.h"
#include "commands/action/GeneralActionType.h"
#include "nn/Brain.h"
#include "nn/BrainProvider.h"
#include "objects/building/Building.h"
#include "player/Player.h"
#include "player/ai/ActionCenter.h"
#include "env/Environment.h"
#include "objects/building/ParentBuildingType.h"
#include "stats/AiInputProvider.h"
ActionMaker::ActionMaker(Player* player, db_nation* nation):
player(player), nation(nation),
ifWorker(BrainProvider::get(nation->actionPrefix[0] + "ifWorker.csv")),
whereWorker(BrainProvider::get(nation->actionPrefix[1] + "whereWorker.csv")),
ifBuilding(BrainProvider::get(nation->actionPrefix[2] + "ifBuilding.csv")),
whichBuildingType(BrainProvider::get(nation->actionPrefix[3] + "whichBuildingType.csv")),
whichBuildingTypeOther(BrainProvider::get(nation->actionPrefix[4] + "whichBuildTypeOther.csv")),
whichBuildingTypeDefence(BrainProvider::get(nation->actionPrefix[5] + "whichBuildTypeDefence.csv")),
whichBuildingTypeResource(BrainProvider::get(nation->actionPrefix[6] + "whichBuildTypeResource.csv")),
whichBuildingTypeTech(BrainProvider::get(nation->actionPrefix[7] + "whichBuildTypeTech.csv")),
whichBuildingTypeUnits(BrainProvider::get(nation->actionPrefix[8] + "whichBuildTypeUnits.csv")),
whereBuilding(BrainProvider::get(nation->actionPrefix[9] + "whereBuilding.csv")),
ifFarmBuild(BrainProvider::get(nation->actionPrefix[10] + "ifFarmBuild.csv")),
ifUnit(BrainProvider::get(nation->actionPrefix[11] + "ifUnit.csv")),
whichUnit(BrainProvider::get(nation->actionPrefix[12] + "whichUnit.csv")),
whereUnit(BrainProvider::get(nation->actionPrefix[13] + "whereUnit.csv")) {
}
std::span<float> ActionMaker::getWhichBuilding(ParentBuildingType type, const std::span<float> aiTypeInput) const {
switch (type) {
case ParentBuildingType::OTHER:
return whichBuildingTypeOther->decide(aiTypeInput);
case ParentBuildingType::DEFENCE:
return whichBuildingTypeDefence->decide(aiTypeInput);
case ParentBuildingType::RESOURCE:
return whichBuildingTypeResource->decide(aiTypeInput);
case ParentBuildingType::TECH:
return whichBuildingTypeTech->decide(aiTypeInput);
case ParentBuildingType::UNITS:
return whichBuildingTypeUnits->decide(aiTypeInput);
}
}
bool ActionMaker::createBuilding(const std::span<float> buildingsInput) {
const auto whichTypeOutput = whichBuildingType->decide(buildingsInput);
ParentBuildingType type = static_cast<ParentBuildingType>(biggestWithRand(whichTypeOutput));
const auto aiTypeInput = Game::getAiInputProvider()->getBuildingsTypeInput(player->getId(), type);
auto output = getWhichBuilding(type, aiTypeInput);
return createBuilding(chooseBuilding(output, type), type);
}
bool ActionMaker::createWorker() const {
assert(!nation->workers.empty());
return createWorker(nation->workers.at(0)); //TODO get better
}
bool ActionMaker::createUnit(std::span<float> unitsInput) {
const auto whichOutput = whichUnit->decide(unitsInput);
const auto unit = chooseUnit(whichOutput);
return createUnit(unit);
}
bool ActionMaker::execute(const std::span<float> unitsInput, const std::span<float> buildingsInput,
AiActionType decision) {
switch (decision) {
case AiActionType::WORKER_CREATE:
return createWorker();
case AiActionType::UNIT_CREATE:
return createUnit(unitsInput);
case AiActionType::BUILDING_CREATE:
return createBuilding(buildingsInput);
default: ;
}
return false;
}
void ActionMaker::action() {
const auto aiInput = Game::getAiInputProvider();
const bool enoughResToWorker = isEnoughResToWorker();
if (enoughResToWorker) {
const auto resInput = aiInput->getResourceInput(player->getId());
const auto resResult = ifWorker->decide(resInput);
if (randFromTwo(resResult[0])) {
createWorker();
}
}
const auto unitsInput = aiInput->getUnitsInput(player->getId());
const auto unitsResult = ifUnit->decide(unitsInput);
if (randFromTwo(unitsResult[0])) {
createUnit(unitsInput);
}
const auto buildingsInput = aiInput->getBuildingsInput(player->getId());
const auto buildingsResult = ifBuilding->decide(buildingsInput);
if (randFromTwo(buildingsResult[0])) {
createBuilding(buildingsInput);
}
//return levelUpUnit();
//return levelUpBuilding();
}
bool ActionMaker::createUnit(db_unit* unit, Building* building) const {
if (building) {
Game::getActionCenter()->add(
new BuildingActionCommand(building, BuildingActionType::UNIT_CREATE, unit->id, player->getId()));
return true;
} else {
//TODO try to build
return false;
}
}
bool ActionMaker::createWorker(db_unit* unit) const {
if (enoughResources(unit)) {
Building* building = getBuildingToDeployWorker(unit);
return createUnit(unit, building);
}
return false;
}
bool ActionMaker::createUnit(db_unit* unit) const {
if (enoughResources(unit)) {
Building* building = getBuildingToDeploy(unit);
return createUnit(unit, building);
}
return false;
}
bool ActionMaker::enoughResources(db_with_cost* withCosts) const {
return withCosts && player->getResources().hasEnough(withCosts->costs);
}
bool ActionMaker::createBuilding(db_building* building, ParentBuildingType type) const {
if (enoughResources(building)) {
auto pos = findPosToBuild(building, type);
if (pos.has_value()) {
return Game::getActionCenter()->addBuilding(building->id, pos.value(), player->getId(), false);
}
}
return false;
}
std::vector<db_building*> ActionMaker::getBuildingsInType(ParentBuildingType type) {
std::vector<db_building*> buildings;
for (auto dbBuilding : nation->buildings) {
if (dbBuilding->parentType[cast(type)]) {
buildings.push_back(dbBuilding);
}
}
return buildings;
}
db_building* ActionMaker::chooseBuilding(std::span<float> result, ParentBuildingType type) {
const auto buildings = getBuildingsInType(type);
if (buildings.empty()) {
return nullptr;
}
if (buildings.size() == 1) {
return buildings.at(1);
}
if (type == ParentBuildingType::RESOURCE) {
int res = biggestWithRand(result);
for (auto building : buildings) {
if (building->hasResourceType[res]) { return building; }
}
return nullptr;
}
std::valarray<float> center(result.data(), result.size());
std::vector<float> diffs;
diffs.reserve(buildings.size());
for (const auto building : buildings) {
diffs.push_back(dist(center, player->getLevelForBuilding(building->id)->dbBuildingMetric, type));
}
auto inx = lowestWithRand(diffs);
const auto building = buildings[inx];
logBuilding(building);
return building;
}
db_building_level* ActionMaker::chooseBuildingLevelUp() {
auto& buildings = nation->buildings;
//auto result = decideFromBasic(buildingLevelUpId);
// std::valarray<float> center(result.data(), result.size()); //TODO perf valarraay test
// std::vector<float> diffs;
// diffs.reserve(buildings.size());
// for (auto building : buildings) {
// auto opt = player->getNextLevelForBuilding(building->id);
// if (opt.has_value()) {
// diffs.push_back(dist(center, opt.value()->dbBuildingMetricUp));
// } else {
// diffs.push_back(1000);
// }
// }
// if (diffs.empty() ) {
// return nullptr;
// }
// auto inx = lowestWithRand(diffs);
//
// const auto building = buildings[inx];
// auto opt = player->getNextLevelForBuilding(building->id);
// if (opt.has_value()) {
// logBuildingLevel(building, opt);
// return opt.value();
// }
return nullptr;
}
db_unit* ActionMaker::chooseUnit(std::span<float> result) {
auto pred = [this](db_unit* unit) { return !unit->typeWorker; };
auto& units = nation->units;
std::vector<db_unit*> unitsWithoutWorker;
unitsWithoutWorker.reserve(units.size());
std::copy_if(units.begin(), units.end(), std::back_inserter(unitsWithoutWorker), pred);
std::valarray<float> center(result.data(), result.size()); //TODO perf valarraay test
std::vector<float> diffs;
diffs.reserve(unitsWithoutWorker.size());
for (auto unit : unitsWithoutWorker) {
diffs.push_back(dist(center, player->getLevelForUnit(unit->id)->dbUnitMetric));
}
if (diffs.empty()) {
return nullptr;
}
const auto inx = lowestWithRand(diffs);
const auto unit = unitsWithoutWorker[inx];
logUnit(unit);
return unit;
}
db_unit_level* ActionMaker::chooseUnitLevelUp() {
auto& units = nation->units;
//auto result = decideFromBasic(unitLevelUpId);
// std::valarray<float> center(result.data(), result.size()); //TODO perf valarraay test
// std::vector<float> diffs;
// diffs.reserve(units.size());
// for (auto unit : units) {
// auto opt = player->getNextLevelForUnit(unit->id);
// if (opt.has_value()) {
// diffs.push_back(dist(center, opt.value()->dbUnitMetricUp));
// } else {
// diffs.push_back(1000);
// }
// }
// if (diffs.empty() ) {
// return nullptr;
// }
// auto inx = lowestWithRand(diffs);
//
// auto unit = units[inx];
// auto opt = player->getNextLevelForUnit(unit->id);
// if (opt.has_value()) {
// logUnitLevel(unit, opt);
// return opt.value();
// }
return nullptr;
}
float ActionMaker::dist(std::valarray<float>& center, const db_basic_metric* metric) {
auto diff = metric->getValuesNormAsVal() - center;
diff *= diff;
return diff.sum();
}
float ActionMaker::dist(std::valarray<float>& center, const db_building_metric* metric, ParentBuildingType type) {
std::valarray<float> diff = metric->getValuesNormAsValForType(type) - center;
diff *= diff;
return diff.sum();
}
std::optional<Urho3D::Vector2> ActionMaker::findPosToBuild(db_building* building, ParentBuildingType type) const {
const auto input = Game::getAiInputProvider()->getBuildingsInputWithMetric(
player->getId(), player->getLevelForBuilding(building->id)->dbBuildingMetric, type);
if (type == ParentBuildingType::RESOURCE) {
return Game::getEnvironment()->getPosToCreateResBonus(building, player->getId());
}
return Game::getEnvironment()->getPosToCreate(whereBuilding->decide(input), type, building, player->getId());
}
std::vector<Building*> ActionMaker::getBuildingsCanDeploy(short unitId) const {
const auto& buildings = nation->buildings;
std::vector<short> buildingIdsThatCanDeploy;
for (const auto building : buildings) {
auto unitIds = player->getLevelForBuilding(building->id)->unitsPerNationIds[player->getNation()];
if (std::ranges::find(*unitIds, unitId) != unitIds->end()) {
buildingIdsThatCanDeploy.push_back(building->id);
}
}
std::vector<Building*> allPossible;
for (auto thatCanDeploy : buildingIdsThatCanDeploy) {
std::ranges::copy_if(*player->getPossession().getBuildings(thatCanDeploy),
std::back_inserter(allPossible), [](Building* b) { return b->isReady(); });
}
return allPossible;
}
Building* ActionMaker::getBuildingToDeploy(db_unit* unit) const {
std::vector<Building*> allPossible = getBuildingsCanDeploy(unit->id);
if (allPossible.empty()) { return nullptr; }
if (allPossible.size() == 1) { return allPossible.at(0); }
const auto input = Game::getAiInputProvider()
->getUnitsInputWithMetric(player->getId(), player->getLevelForUnit(unit->id)->dbUnitMetric);
const auto result = whereUnit->decide(input);
return getBuildingClosestArea(allPossible, result);
}
Building* ActionMaker::getBuildingToDeployWorker(db_unit* unit) const {
std::vector<Building*> allPossible = getBuildingsCanDeploy(unit->id);
if (allPossible.empty()) { return nullptr; }
if (allPossible.size() == 1) { return allPossible.at(0); }
const auto input = Game::getAiInputProvider()->getResourceInput(player->getId());
const auto result = whereWorker->decide(input);
return getBuildingClosestArea(allPossible, result);
}
Building* ActionMaker::getBuildingClosestArea(std::vector<Building*>& allPossible, std::span<float> result) const {
auto centers = Game::getEnvironment()->getAreas(player->getId(), result, 10);
float closestVal = 99999;
Building* closest = allPossible[0];
for (const auto possible : allPossible) {
//TODO performance O(^2)
Urho3D::Vector2 pos = {possible->getPosition().x_, possible->getPosition().z_};
for (auto& center : centers) {
auto diff = pos - center;
auto val = diff.LengthSquared();
if (val < closestVal) {
closest = possible;
closestVal = val;
}
}
}
return closest;
}
Building* ActionMaker::getBuildingToLevelUpUnit(db_unit_level* level) {
auto& buildings = nation->buildings;
//std::vector<Building*> allPossible = getBuildingsCanDeploy(level->unit, buildings);
// if (allPossible.empty()) { return nullptr; }
// auto& result = inputWithParamsDecide(unitLevelUpPos, level->dbUnitMetricUp);
// float val = result[0] * 10.f; //TODO hard code DEFAULT_NORMALIZE_VALUE
// float closestVal = 99999;
// Building* closest = allPossible[0];
// for (auto possible : allPossible) {
// auto diff = val - possible->getQueue()->getSize();
// diff = diff * diff;
// if (diff < closestVal) {
// closest = possible;
// closestVal = diff;
// }
// }
// return closest;
return nullptr;
}
bool ActionMaker::levelUpBuilding() {
const auto level = chooseBuildingLevelUp();
if (enoughResources(level)) {
Game::getActionCenter()->add(
new GeneralActionCommand(level->building, GeneralActionType::BUILDING_LEVEL, player->getId()));
return true;
}
return false;
}
bool ActionMaker::levelUpUnit() {
db_unit_level* level = chooseUnitLevelUp();
if (enoughResources(level)) {
Building* building = getBuildingToLevelUpUnit(level);
if (building) {
Game::getActionCenter()->add(
new BuildingActionCommand(building, BuildingActionType::UNIT_LEVEL, level->unit, player->getId()));
return true;
}
}
return false;
}
bool ActionMaker::isEnoughResToWorker() const {
for (auto worker : nation->workers) {
if (enoughResources(worker)) {
return true;
}
}
return false;
}
```
Building.h
```#pragma once
#include "objects/static/Static.h"
struct ProjectileWithNode;
class AbstractQueueManager;
struct dbload_building;
enum class BuildingActionType : char;
struct db_building;
struct db_building_level;
struct db_unit;
class QueueElement;
class Building : public Static {
public:
Building(Urho3D::Vector3 _position, int id, int player, int level, int indexInGrid, bool withNode);
~Building();
void populate() override;
void levelUp(char level);
void postCreate();
Building* load(dbload_building* dbloadBuilding);
QueueElement* updateQueue();
void updateAi(bool ifBuildingAction);
std::optional<int> getDeploy();
//TODO target to nie to samo co gdzie sie maja pojawiac!
AbstractQueueManager* getQueue() const { return queue; }
bool isReady() const { return ready; }
Urho3D::String getInfo() const override;
const Urho3D::String& getName() const override;
std::pair<float, bool> absorbAttack(float attackCoef) override;
ObjectType getType() const override { return ObjectType::BUILDING; }
float getAttackVal(Physical* aim) override;
void action(BuildingActionType type, short id) const;
std::string getValues(int precision) override;
unsigned short getMaxHpBarSize() const override;
float getHealthBarSize() const override;
char getLevelNum() override;
const Urho3D::IntVector2 getGridSize() const override;
void createDeploy();
void setDeploy(int cell);
void complete();
float getSightRadius() const override;
short getCostSum() const override;
bool canUse(int index) const override;
db_building_level* getLevel() const;
float getModelHeight() const override;
void setModelData(float modelHeight) const override;
db_building* getDbBuilding() const { return dbBuilding; }
std::pair<db_building*, db_building_level*> getData() const { return {dbBuilding, dbLevel}; }//TODO getUniT DATA i resource
private:
int deployIndex = -1;
unsigned short currentFrameState = 0;
bool ready = true;
db_building* dbBuilding;
db_building_level* dbLevel;
AbstractQueueManager* queue{};
Physical* thingToInteract{};
};
```
ForceStats.h
```#pragma once
#include "utils/defines.h"
#include <Urho3D/Math/Vector2.h>
#include <iostream>
constexpr unsigned short FORCE_STATS_SIZE = 1000;
constexpr bool FORCE_STATS_ENABLE = false;
struct ForceStats {
void vectorReset() {
if constexpr (DEBUG_LINES_ENABLED) {
sepObstLast = {};
sepUnitLast = {};
destLast = {};
formLast = {};
escaLast = {};
}
}
void reset() {
sepObstStat = 0;
sepUnitStat = 0;
destStat = 0;
formStat = 0;
escaStat = 0;
}
ForceStats() {
reset();
std::fill_n(stats, 5, 0.f);
}
ForceStats(const ForceStats&) = delete;
void addSepObst(Urho3D::Vector2& force) {
if constexpr (FORCE_STATS_ENABLE) {
sepObstStat += force.Length();
}
if constexpr (DEBUG_LINES_ENABLED) {
sepObstLast = force;
sepObstLast.Normalize();
}
}
void addSepUnit(Urho3D::Vector2& force) {
if constexpr (FORCE_STATS_ENABLE) { sepUnitStat += force.Length(); }
if constexpr (DEBUG_LINES_ENABLED) {
sepUnitLast = force;
sepUnitLast.Normalize();
}
}
void addDest(Urho3D::Vector2& force) {
if constexpr (FORCE_STATS_ENABLE) { destStat += force.Length(); }
if constexpr (DEBUG_LINES_ENABLED) {
destLast = force;
destLast.Normalize();
}
}
void addForm(Urho3D::Vector2& force) {
if constexpr (FORCE_STATS_ENABLE) { formStat += force.Length(); }
if constexpr (DEBUG_LINES_ENABLED) {
formLast = force;
formLast.Normalize();
}
}
void addEscp(Urho3D::Vector2& force) {
if constexpr (FORCE_STATS_ENABLE) { escaStat += force.Length(); }
if constexpr (DEBUG_LINES_ENABLED) {
escaLast = force;
escaLast.Normalize();
}
}
float* result() {
if constexpr (FORCE_STATS_ENABLE) {
++statIndex;
if (statIndex >= FORCE_STATS_SIZE) {
stats[0] = sepObstStat / FORCE_STATS_SIZE;
stats[1] = sepUnitStat / FORCE_STATS_SIZE;
stats[2] = destStat / FORCE_STATS_SIZE;
stats[3] = formStat / FORCE_STATS_SIZE;
stats[4] = escaStat / FORCE_STATS_SIZE;
statIndex = 0;
std::cout <<
"sepObs-" << stats[0] << "\tsepUnit-" << stats[1] << "\tdestStat-" <<
stats[2] << "\tformStat-" << stats[3] << "\tescaStat-" <<
stats[4] << std::endl;
reset();
}
}
longestLast = 0;
return stats;
}
Urho3D::Vector2 sepObstLast;
Urho3D::Vector2 sepUnitLast;
Urho3D::Vector2 destLast;
Urho3D::Vector2 formLast;
Urho3D::Vector2 escaLast;
float longestLast = 0;
float sepObstStat;
float sepUnitStat;
float destStat;
float formStat;
float escaStat;
float stats[5];
short statIndex = 0;
};
```
UpgradeCommandList.cpp
```#include "UpgradeCommandList.h"
#include "UpgradeCommand.h"
UpgradeCommandList::UpgradeCommandList(SimulationObjectManager* simulationObjectManager)
: simulationObjectManager(simulationObjectManager) {
}
void UpgradeCommandList::setParameters(AbstractCommand* command) {
auto* m = dynamic_cast<UpgradeCommand*>(command);
m->setSimulationObjectManager(simulationObjectManager);
}
```
QueuePanel.h
```#pragma once
#include "hud/window/EventPanel.h"
class AbstractQueueManager;
class SelectedInfo;
class QueueManager;
class QueueHudElement;
class QueuePanel : public EventPanel {
public:
explicit QueuePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~QueuePanel();
void show(SelectedInfo* selectedInfo);
void show(AbstractQueueManager* queue);
void update(SelectedInfo* selectedInfo);
private:
void finish(int from);
void update(AbstractQueueManager* queue, short& j) const;
void createBody() override;
void HandleReduce(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
char MAX_ICON_SELECTION = 31;
QueueHudElement** elements;
};
```
ActionCenter.cpp
```#include "player/ai/ActionCenter.h"
#include "Game.h"
#include "commands/action/BuildingActionCommand.h"
#include "commands/action/ResourceActionCommand.h"
#include "commands/action/GeneralActionCommand.h"
#include "commands/action/UnitActionCommand.h"
#include "commands/creation/CreationCommand.h"
#include "commands/upgrade/UpgradeCommand.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
ActionCenter::ActionCenter(SimulationObjectManager* simulationObjectManager):
creation(simulationObjectManager), upgrade(simulationObjectManager) {
}
void ActionCenter::add(UpgradeCommand* command) {
upgrade.add(command);
}
void ActionCenter::add(ResourceActionCommand* command) {
action.add(command);
}
void ActionCenter::add(BuildingActionCommand* command) {
action.add(command);
}
void ActionCenter::addUnitAction(UnitOrder* first, char player) {
auto com = new UnitActionCommand(first, player);
action.add(com);
}
void ActionCenter::addUnitAction(UnitOrder* first, UnitOrder* second, char player) {
auto com1 = new UnitActionCommand(first, player);
auto com2 = new UnitActionCommand(second, player);
action.add(com1, com2);
}
void ActionCenter::add(GeneralActionCommand* command) {
action.add(command);
}
void ActionCenter::executeActions() {
action.execute();
}
void ActionCenter::executeLists() {
upgrade.execute();
creation.execute();
}
bool ActionCenter::addUnits(int number, int id, Urho3D::Vector2 position, char player) {
auto level = Game::getPlayersMan()->getPlayer(player)->getLevelForUnit(id)->level;
return addUnits(number, id, position, player, level);
}
bool ActionCenter::addUnits(int number, int id, Urho3D::Vector2& position, char player, int level) {
auto command = creation.addUnits(number, id, position, player, level);
if (command) {
creation.add(command);
return true;
}
return false;
}
bool ActionCenter::addBuilding(int id, Urho3D::Vector2& position, char player, bool force) {
auto level = Game::getPlayersMan()->getPlayer(player)->getLevelForBuilding(id)->level;
return addBuilding(id, position, player, level, force);
}
bool ActionCenter::addBuilding(int id, Urho3D::Vector2& position, char player, int level, bool force) {
CreationCommand* command{};
if (force) {
command = creation.addBuildingForce(id, position, player, level);
} else {
command = creation.addBuilding(id, position, player, level);
}
if (command) {
creation.add(command);
return true;
}
return false;
}
bool ActionCenter::addResource(int id, Urho3D::Vector2& position) {
auto command = creation.addResource(id, position, 0);
if (command) {
creation.add(command);
return true;
}
return false;
}
```
db_basic_struct.h
```#pragma once
#include <Urho3D/Container/Str.h>
constexpr char SPLIT_SIGN = ';';
constexpr char SPLIT_SIGN_2 = '|';
struct db_entity {
const short id;
explicit db_entity(short id) : id(id) {
}
};
struct db_with_name : db_entity {
const Urho3D::String name;
db_with_name(short id, const Urho3D::String name)
: db_entity(id), name(name) {
}
};
struct db_with_icon : db_with_name {
const Urho3D::String icon;
db_with_icon(short id, const Urho3D::String name, const Urho3D::String icon)
: db_with_name(id, name), icon(icon) {
}
};
template <typename T>
void ensureSize(int size, std::vector<T*>& array) {
if (array.size() <= size) {
array.resize(size + 1, nullptr);
}
}
template <typename T>
static void setEntity(std::vector<T*>& array, T* entity) {
auto id = static_cast<db_entity*>(entity)->id;
ensureSize(id, array);
array[id] = entity;
}
```
Building.cpp
```#include "Building.h"
#include "commands/action/BuildingActionType.h"
#include "database/DatabaseCache.h"
#include "Game.h"
#include "objects/NodeUtils.h"
#include "objects/queue/QueueActionType.h"
#include "objects/queue/SimpleQueueManager.h"
#include "objects/unit/state/StateManager.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "player/Resources.h"
#include "scene/load/dbload_container.h"
#include <magic_enum.hpp>
#include <string>
#include <Urho3D/IO/Log.h>
#include <Urho3D/Resource/Localization.h>
#include "math/MathUtils.h"
#include "math/SpanUtils.h"
#include "objects/projectile/ProjectileManager.h"
#include "objects/queue/QueueElement.h"
#include "env/Environment.h"
Building::Building(Urho3D::Vector3 _position, int id, int player, int level, int indexInGrid, bool withNode):
Static(_position, indexInGrid, withNode) {
setPlayerAndTeam(player);
dbBuilding = Game::getDatabase()->getBuilding(id);
levelUp(level);
}
Building::~Building() {
if (node) {
node->RemoveAllChildren();
}
delete queue;
}
void Building::postCreate() {
ready = false;
queue->add(1, QueueActionType::BUILDING_CREATE, getId(), 1);
setShaderParam(this, "Progress", 0.0);
}
unsigned short Building::getMaxHpBarSize() const {
const auto gridSize = getGridSize();
return Urho3D::Max(gridSize.x_, gridSize.y_) * 0.5f;
}
float Building::getHealthBarSize() const {
if (ready) {
return Physical::getHealthBarSize();
}
return getMaxHpBarSize() * queue->getAt(0)->getProgress();
}
char Building::getLevelNum() {
return dbLevel->level;
}
void Building::populate() {
Static::populate();
hp = dbLevel->maxHp;
id = dbBuilding->id;
invMaxHp = dbLevel->invMaxHp;
delete queue; //TODO optimize //TODO bug co jezeli cos jets w kolejce!!!!
if (dbLevel->queueMaxCapacity > 0) {
queue = new QueueManager(dbLevel->queueMaxCapacity);
} else {
queue = new SimpleQueueManager();
}
}
std::pair<float, bool> Building::absorbAttack(float attackCoef) {
if (hp <= 0) {
return {0.f, false};
}
const auto val = (attackCoef + attackCoef * !ready) * (1 - dbLevel->armor);
hp -= val;
if (hp <= 0) {
StateManager::changeState(this, StaticState::DEAD);
return {val, true};
}
return {val, false};
}
Urho3D::String Building::getInfo() const {
const auto l10n = Game::getLocalization();
return Urho3D::String(dbBuilding->name + " " + dbLevel->name)
.AppendWithFormat(l10n->Get("info_build").CString(),
asStringF(dbLevel->attack, 1).c_str(),
asStringF(dbLevel->armor).c_str(),
(int)hp, dbLevel->maxHp,
closeUsers, getMaxCloseUsers(),
rangeUsers, getMaxRangeUsers(),
magic_enum::enum_name(state).data());
}
const Urho3D::String& Building::getName() const {
return dbBuilding->name;
}
float Building::getAttackVal(Physical* aim) {
return dbLevel->attack;
}
void Building::action(BuildingActionType type, short id) const {
if (!ready) { return; }
Resources& resources = Game::getPlayersMan()->getPlayer(getPlayer())->getResources();
switch (type) {
case BuildingActionType::UNIT_CREATE:
if (resources.reduce(Game::getDatabase()->getUnit(id)->costs)) {
queue->add(1, QueueActionType::UNIT_CREATE, id, 30);
}
break;
case BuildingActionType::UNIT_LEVEL: {
auto opt = Game::getPlayersMan()->getPlayer(getPlayer())->getNextLevelForUnit(id);
if (opt.has_value()) {
if (resources.reduce(opt.value()->costs)) {
queue->add(1, QueueActionType::UNIT_LEVEL, id, 1);
}
}
}
break;
case BuildingActionType::UNIT_UPGRADE:
break;
}
}
void Building::levelUp(char level) {
dbLevel = dbBuilding->getLevel(level).value(); //TODO BUG value()
const int hpTemp = hp;
loadXml("Objects/buildings/" + dbLevel->nodeName);
if (hpTemp >= 0) {
hp = hpTemp;
}
}
Building* Building::load(dbload_building* dbloadBuilding) {
Static::load(dbloadBuilding);
return this;
}
QueueElement* Building::updateQueue() {
if (!ready) {
setShaderParam(this, "Progress", queue->getAt(0)->getProgress());
}
return queue->update();
}
void Building::updateAi(bool ifBuildingAction) {
if (thingToInteract &&
(!thingToInteract->isAlive() || sqDistAs2D(thingToInteract->getPosition(), position) >
dbLevel->sqAttackRange)) {
thingToInteract = nullptr;
currentFrameState = 0;
}
if (ready && dbLevel->canAttack) {
if (thingToInteract) {
if (currentFrameState >= dbLevel->attackReload) {
ProjectileManager::shoot(this, thingToInteract, 7, player);
currentFrameState = 0;
} else {
++currentFrameState;
}
} else if (ifBuildingAction) {
const auto thingsToInteract = Game::getEnvironment()->getNeighboursFromTeamNotEq(
this, dbLevel->attackRange);
const auto closest = Game::getEnvironment()->closestPhysicalSimple(
this, thingsToInteract, dbLevel->attackRange);
thingToInteract = closest;
}
}
}
std::optional<int> Building::getDeploy() {
if (deployIndex > -1) {
return deployIndex;
}
return {};
}
std::string Building::getValues(int precision) {
return Static::getValues(precision)
+ std::to_string(deployIndex);
}
const Urho3D::IntVector2 Building::getGridSize() const {
return dbBuilding->size;
}
void Building::createDeploy() {
deployIndex = -1;
for (auto i : getSurroundCells()) {
if (Game::getEnvironment()->cellIsPassable(i)) {
deployIndex = i;
}
}
}
void Building::setDeploy(int cell) {
deployIndex = cell;
}
void Building::complete() {
ready = true;
setShaderParam(this, "Progress", 2.0);
//const int hpTemp = hp;
//loadXml("Objects/buildings/" + dbLevel->nodeName);
//hp = hpTemp;
}
float Building::getSightRadius() const {
return dbLevel->sightRadius * (1 - 0.7f * !ready);
}
short Building::getCostSum() const {
return dbBuilding->getSumCost();
}
bool Building::canUse(int index) const {
return Game::getEnvironment()->cellIsAttackable(index);
}
db_building_level* Building::getLevel() const {
return dbLevel;
}
float Building::getModelHeight() const {
return dbLevel->modelHeight;
}
void Building::setModelData(float modelHeight) const {
dbLevel->modelHeight = modelHeight;
}
```
db_container.h
```#pragma once
#include "db_strcut.h"
#include "player/ai/AiMetric.h"
#include "utils/DeleteUtils.h"
struct db_hud_vars;
struct db_map;
struct db_hud_size;
struct db_graph_settings;
struct db_resolution;
struct db_settings;
struct db_player_colors;
struct db_container {
std::vector<db_hud_size*> hudSizes;
std::vector<db_hud_vars*> hudVars;
std::vector<db_graph_settings*> graphSettings;
std::vector<db_resolution*> resolutions;
std::vector<db_settings*> settings;
std::vector<db_map*> maps;
std::vector<db_unit*> units;
std::vector<db_unit_level*> unitsLevels;
std::vector<db_building*> buildings;
std::vector<db_building_level*> buildingsLevels;
std::vector<db_nation*> nations;
std::vector<db_resource*> resources;
std::vector<db_player_colors*> playerColors;
std::vector<db_order*> orders;
explicit db_container() = default;
~db_container() {
clear_vector(hudSizes);
clear_vector(hudVars);
clear_vector(resolutions);
clear_vector(graphSettings);
clear_vector(settings);
clear_vector(maps);
clear_vector(resources);
clear_vector(nations);
clear_vector(units);
clear_vector(orders);
clear_vector(buildings);
clear_vector(playerColors);
clear_vector(unitsLevels);
clear_vector(buildingsLevels);
}
void finish() {
for (auto* level : unitsLevels) {
const auto unit = units[level->unit];
level->finish(METRIC_DEFINITIONS.getUnitNorm(unit, level),
METRIC_DEFINITIONS.getUnitNormForSum(unit, level),
METRIC_DEFINITIONS.getUnitTypesIdxs());
}
for (auto* level : buildingsLevels) {
const auto building = buildings[level->building];
level->finish(
METRIC_DEFINITIONS.getBuildingNorm(building, level), METRIC_DEFINITIONS.getBuildingNormForSum(building, level),
METRIC_DEFINITIONS.getBuildingOtherIdxs(), METRIC_DEFINITIONS.getBuildingDefenceIdxs(),
METRIC_DEFINITIONS.getBuildingResourceIdxs(), METRIC_DEFINITIONS.getBuildingTechIdxs(),
METRIC_DEFINITIONS.getBuildingUnitsIdxs(), METRIC_DEFINITIONS.getBuildingTypesIdxs());
}
}
};
```
TopPanel.cpp
```#include "TopPanel.h"
#include <Urho3D/Graphics/Texture2D.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/Window.h>
#include "GameState.h"
#include "TopHudElement.h"
#include "../../UiUtils.h"
#include "database/DatabaseCache.h"
#include "info/TopInfoPanel.h"
#include "objects/unit/Unit.h"
#include "player/Player.h"
#include "player/Possession.h"
#include "player/Resources.h"
TopPanel::TopPanel(Urho3D::UIElement* root, Urho3D::XMLFile* style) : SimplePanel(root, style, "TopWindow",
{GameState::RUNNING, GameState::PAUSE}) {}
TopPanel::~TopPanel() {
clear_array(elements, RESOURCES_SIZE);
delete units;
delete workers;
delete name;
delete infoPanel;
}
void TopPanel::createBody() {
const Urho3D::String path = "textures/hud/icon/top/";
const auto textureHuman = Game::getCache()->GetResource<Urho3D::Texture2D>(path + "human.png");
const auto textureWorker = Game::getCache()->GetResource<Urho3D::Texture2D>(path + "worker.png");
const auto textureName = Game::getCache()->GetResource<Urho3D::Texture2D>(path + "helmet.png");
name = new TopHudElement(window, style, textureName);
units = new TopHudElement(window, style, textureHuman, "TopButtonsNarrow");
workers = new TopHudElement(window, style, textureWorker, "TopButtonsNarrow");
for (int i = 0; i < RESOURCES_SIZE; ++i) {
const auto resource = Game::getDatabase()->getResource(i);
const auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>(
"textures/hud/icon/resource/" + resource->icon);
elements[i] = new TopHudElement(window, style, texture);
}
infoPanel = new TopInfoPanel(root, style);
infoPanel->createWindow();
infoPanel->setVisible(true);
}
void TopPanel::update(Player* player) const {
const auto& possession = player->getPossession();
units->setText(Urho3D::String(possession.getFreeArmyNumber()) + "/", Urho3D::String(possession.getUnitsNumber()));
workers->setText(Urho3D::String(possession.getFreeWorkersNumber())+"/", Urho3D::String(possession.getWorkersNumber()));
name->setText(Urho3D::String(player->getName()), "");
auto& resources = player->getResources();
unsigned short workersPerRes[RESOURCES_SIZE] = {0, 0, 0, 0};
for (const auto worker : possession.getWorkers()) {
const auto id = worker->getThingToInterActId();
if (id >= 0 && worker->getState() == UnitState::COLLECT) {
++workersPerRes[id];
}
}
auto vals = resources.getValues();
for (int i = 0; i < vals.size(); ++i) {
elements[i]->setText(
Urho3D::String((int)vals[i])+"|", Urho3D::String(workersPerRes[i]));
}
}
void TopPanel::setVisible(bool enable) {
SimplePanel::setVisible(enable);
//if (!enable) {
infoPanel->setVisible(enable);
//}
}
```
MenuPanel.cpp
```#include "MenuPanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/CheckBox.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "control/SelectedInfo.h"
#include "control/SelectedInfoType.h"
#include "database/DatabaseCache.h"
#include "hud/HudData.h"
#include "hud/UiUtils.h"
#include "info/LeftMenuInfoPanel.h"
#include "objects/ActionType.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "commands/action/ResourceActionType.h"
#include "database/db_other_struct.h"
#include "math/VectorUtils.h"
static constexpr const char* ICONS_PATH = "textures/hud/icon/";
MenuPanel::MenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : EventPanel(root, _style, "LeftMenuWindow",
{GameState::RUNNING, GameState::PAUSE}) {
}
MenuPanel::~MenuPanel() {
delete infoPanel;
clear_vector(hudElements);
}
void MenuPanel::removeHoverInfo() const {
infoPanel->removeHoverInfo();
}
void MenuPanel::refresh(LeftMenuMode _mode, SelectedInfo* selectedInfo) {
lastSelectedInfo = selectedInfo;
if (mode != _mode) {
mode = _mode;
updateMode(mode);
subMode = LeftMenuSubMode::BASIC;
page = 0;
}
updateButtons(lastSelectedInfo);
}
void MenuPanel::setHoverInfo(HudData* hudData) const {
infoPanel->setHoverInfo(hudData);
}
void MenuPanel::updateSelected(SelectedInfo* selectedInfo) const {
infoPanel->updateSelected(selectedInfo);
}
void MenuPanel::setVisible(bool enable) {
SimplePanel::setVisible(enable);
if (!enable) {
removeHoverInfo();
}
}
std::vector<HudData*>& MenuPanel::getButtons() {
return hudElements;
}
void MenuPanel::clearSelected() const {
infoPanel->clearSelected();
}
void MenuPanel::setCheckVisibility(std::initializer_list<bool> active) {
int k = 0;
for (auto a : active) {
checks[k++]->SetVisible(a);
}
}
void MenuPanel::updateMode(LeftMenuMode mode) {
switch (mode) {
case LeftMenuMode::BUILDING:
return setCheckVisibility({true, true, false});
case LeftMenuMode::UNIT:
return setCheckVisibility({true, true, true});
case LeftMenuMode::ORDER:
return setCheckVisibility({true, true, false});
case LeftMenuMode::RESOURCE:
return setCheckVisibility({true, false, false});
}
}
void MenuPanel::createBody() {
infoPanel = new LeftMenuInfoPanel(root, style);
infoPanel->createWindow();
removeHoverInfo();
const auto mock = createElement<Urho3D::UIElement>(window, style, "LeftMenuMock");
Urho3D::UIElement* rows[ROWS_NUMBER];
for (auto& row : rows) {
row = createElement<Urho3D::UIElement>(mock, style, "LeftMenuListRow");
}
for (int i = 0; i < CHECKS_NUMBER; ++i) {
const auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>(
"textures/hud/icon/lm/lm" + Urho3D::String(i) + ".png");
checks[i] = createElement<Urho3D::CheckBox>(rows[ROWS_NUMBER - 1], style, "LeftMenuCheckBox");
checks[i]->SetVar("Num", i);
createSprite(checks[i], texture, style, "LeftMenuSmallSprite");
SubscribeToEvent(checks[i], Urho3D::E_CLICK, URHO3D_HANDLER(MenuPanel, ChangeModeButton));
}
const auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>("textures/hud/icon/lm/lm3.png");
const auto nextButton = createElement<Urho3D::Button>(rows[ROWS_NUMBER - 1], style, "LeftMenuIcon");
SubscribeToEvent(nextButton, Urho3D::E_CLICK, URHO3D_HANDLER(MenuPanel, NextPage));
createSprite(nextButton, texture, style, "LeftMenuSmallSprite");
int k = 0;
for (int i = 0; i < ROWS_NUMBER - 1; ++i) {
const auto row = rows[i];
for (int j = 0; j < BUTTONS_PER_ROW; ++j) {
buttons[k] = createElement<Urho3D::Button>(row, style, "LeftMenuBigIcon");
sprites[k] = createElement<MySprite>(buttons[k], style, "LeftMenuSprite");
hudElements.push_back(new HudData(buttons[k]));
hudElements[k]->set(-1, ActionType::NONE, "");
buttons[k]->SetVar("HudElement", hudElements[k]);
k++;
}
}
}
void MenuPanel::setChecks(char val) {
for (const auto check : checks) {
check->SetChecked(false);
}
checks[val]->SetChecked(true);
}
void MenuPanel::NextPage(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
page = (page + 1) % maxPage;
updateButtons(lastSelectedInfo);
}
void MenuPanel::ChangeModeButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::CheckBox*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
auto newSubMode = static_cast<LeftMenuSubMode>(element->GetVar("Num").GetInt());
if (newSubMode != subMode) {
subMode = newSubMode;
page = 0;
updateButtons(lastSelectedInfo);
}
}
void MenuPanel::setNext(int& k, const Urho3D::String& texture, short id, ActionType menuAction,
Urho3D::String text) const {
setTextureToSprite(sprites[k], Game::getCache()->GetResource<Urho3D::Texture2D>(ICONS_PATH + texture));
buttons[k]->SetVisible(true);
hudElements[k]->set(id, menuAction, std::move(text));
++k;
}
void MenuPanel::basicBuilding() {
const short nation = Game::getPlayersMan()->getActivePlayer()->getNation();
setIcons(Game::getDatabase()->getNation(nation)->buildings, "building/", ActionType::BUILDING_CREATE);
}
void MenuPanel::levelBuilding() {
int nation = Game::getPlayersMan()->getActivePlayer()->getNation();
int k = 0;
std::vector<db_building_level*> levels;
const auto player = Game::getPlayersMan()->getActivePlayer();
for (const auto building : Game::getDatabase()->getNation(nation)->buildings) {
auto opt = player->getNextLevelForBuilding(building->id);
if (opt.has_value()) {
levels.push_back(opt.value());
}
}
for (int i = page * BUTTONS_NUMBER; i < levels.size() && i < (page + 1) * BUTTONS_NUMBER; ++ i) {
const auto level = levels[i];
const db_building* building = Game::getDatabase()->getBuilding(level->building);
setNext(k, "building/levels/" + Urho3D::String(level->level) + "/" + building->icon,
building->id, ActionType::BUILDING_LEVEL);
}
resetRestButtons(k);
}
std::vector<unsigned char> MenuPanel::getUnitInBuilding(SelectedInfo* selectedInfo) const {
if (selectedInfo->getAllNumber() <= 0) { return {}; }
auto& infoTypes = selectedInfo->getSelectedTypes();
int nation = Game::getPlayersMan()->getActivePlayer()->getNation();
std::vector<std::vector<unsigned char>*> ids;
for (int i = 0; i < infoTypes.size(); ++i) {
if (!infoTypes.at(i)->getData().empty()) {
ids.push_back(Game::getPlayersMan()->getActivePlayer()->getLevelForBuilding(i)->unitsPerNationIds[nation]);
}
}
return intersection(ids);
}
void MenuPanel::basicUnit(SelectedInfo* selectedInfo) {
std::vector<db_with_icon*> units;
for (auto id : getUnitInBuilding(selectedInfo)) {
db_unit* unit = Game::getDatabase()->getUnit(id);
if (unit) {
units.push_back(unit);
}
}
setIcons(units, "unit/", ActionType::UNIT_CREATE);
}
void MenuPanel::levelUnit(SelectedInfo* selectedInfo) {
std::vector<db_unit_level*> levels;
for (auto id : getUnitInBuilding(selectedInfo)) {
auto opt = Game::getPlayersMan()->getActivePlayer()->getNextLevelForUnit(id);
if (opt.has_value()) {
levels.push_back(opt.value());
}
}
int k = 0;
maxPage = levels.size() / BUTTONS_NUMBER + 1;
for (int i = page * BUTTONS_NUMBER; i < levels.size() && i < (page + 1) * BUTTONS_NUMBER; ++i) {
auto level = levels[i];
db_unit* unit = Game::getDatabase()->getUnit(level->unit);
setNext(k, "unit/levels/" + Urho3D::String(level->level) + "/" + unit->icon, unit->id, ActionType::UNIT_LEVEL);
}
resetRestButtons(k);
}
std::vector<unsigned char> MenuPanel::getOrderForUnit(SelectedInfo* selectedInfo) const {
if (selectedInfo->getAllNumber() <= 0) { return {}; }
auto& infoTypes = selectedInfo->getSelectedTypes();
std::vector<std::vector<unsigned char>*> ids;
for (int i = 0; i < infoTypes.size(); ++i) {
const auto info = infoTypes.at(i);
if (!info->getData().empty()) {
const auto dbUnit = Game::getDatabase()->getUnit(i);
ids.push_back(&dbUnit->ordersIds);
}
}
return intersection(ids);
}
template <typename T>
void MenuPanel::setIcons(const std::vector<T*>& icons, Urho3D::String path, ActionType type) {
int k = 0;
maxPage = icons.size() / BUTTONS_NUMBER + 1;
for (int i = page * BUTTONS_NUMBER; i < icons.size() && i < (page + 1) * BUTTONS_NUMBER; ++i) {
auto icon = icons[i];
setNext(k, path + icon->icon, icon->id, type);
}
resetRestButtons(k);
}
void MenuPanel::basicOrder(SelectedInfo* selectedInfo) {
std::vector<db_with_icon*> orders;
for (auto id : getOrderForUnit(selectedInfo)) {
db_order* order = Game::getDatabase()->getOrder(id);
if (order) {
orders.push_back(order);
}
}
setIcons(orders, "orders/", ActionType::ORDER);
}
void MenuPanel::formationOrder() {
int k = 0;
const auto l10n = Game::getLocalization();
setNext(k, "formation/none.png", 0, ActionType::FORMATION, l10n->Get("form_none"));
setNext(k, "formation/square.png", 1, ActionType::FORMATION, l10n->Get("form_square"));
maxPage = 1;
resetRestButtons(k);
}
void MenuPanel::resetRestButtons(int from) const {
for (int i = from; i < BUTTONS_PER_ROW * (ROWS_NUMBER - 1); ++i) {
setTextureToSprite(sprites[i], nullptr);
buttons[i]->SetVisible(false);
}
}
void MenuPanel::updateButtons(SelectedInfo* selectedInfo) {
setChecks(cast(subMode));
switch (mode) {
case LeftMenuMode::BUILDING:
return buildingMenu();
case LeftMenuMode::UNIT:
return unitMenu(selectedInfo);
case LeftMenuMode::ORDER:
return orderMenu(selectedInfo);
case LeftMenuMode::RESOURCE:
return resourceMenu(selectedInfo);
default: ;
}
}
void MenuPanel::unitMenu(SelectedInfo* selectedInfo) {
switch (subMode) {
case LeftMenuSubMode::BASIC:
return basicUnit(selectedInfo);
case LeftMenuSubMode::LEVEL:
return levelUnit(selectedInfo);
}
}
void MenuPanel::buildingMenu() {
switch (subMode) {
case LeftMenuSubMode::BASIC:
return basicBuilding();
case LeftMenuSubMode::LEVEL:
return levelBuilding();
}
}
void MenuPanel::orderMenu(SelectedInfo* selectedInfo) {
switch (subMode) {
case LeftMenuSubMode::BASIC:
return basicOrder(selectedInfo);
case LeftMenuSubMode::LEVEL:
return formationOrder();
}
}
void MenuPanel::resourceMenu(SelectedInfo* selectedInfo) {
switch (subMode) {
case LeftMenuSubMode::BASIC:
return basicResource(selectedInfo);
}
}
void MenuPanel::basicResource(SelectedInfo* selectedInfo) {
int k = 0;
const auto l10n = Game::getLocalization();
setNext(k, "resource_action/get_worker.png", cast(ResourceActionType::COLLECT),
ActionType::RESOURCE, l10n->Get("res_act_get_worker"));
setNext(k, "resource_action/remove_workers.png", cast(ResourceActionType::CANCEL),
ActionType::RESOURCE, l10n->Get("res_act_cancel_worker"));
maxPage = 1;
resetRestButtons(k);
}
```
MainGrid.cpp
```#include "MainGrid.h"
#include <exprtk/exprtk.hpp>
#include <Urho3D/Resource/Image.h>
#include <Urho3D/IO/Log.h>
#include "Bucket.h"
#include "Game.h"
#include "colors/ColorPaletteRepo.h"
#include "database/db_strcut.h"
#include "debug/DebugLineRepo.h"
#include "levels/LevelCache.h"
#include "math/MathUtils.h"
#include "objects/building/Building.h"
#include "objects/unit/Unit.h"
#include "env/CloseIndexes.h"
#include "env/Environment.h"
MainGrid::MainGrid(short resolution, float size, float maxQueryRadius):
Grid(resolution, size, true, maxQueryRadius), complexData(new ComplexBucketData[sqResolution]),
pathFinder(resolution, size) {
const auto quarter = calculator->getFieldSize() / 4;
pathFinder.setComplexBucketData(complexData);
posInBucket = {
Urho3D::Vector2(quarter, quarter), Urho3D::Vector2(-quarter, -quarter),
Urho3D::Vector2(quarter, -quarter), Urho3D::Vector2(-quarter, quarter)
};
DebugLineRepo::init(DebugLineType::MAIN_GRID);
}
MainGrid::~MainGrid() {
delete[] complexData;
}
void MainGrid::prepareGridToFind() const {
for (int current = 0; current < sqResolution; ++current) {
auto& data = complexData[current];
auto centerParams = calculator->getIndexes(current);
for (auto i : closeIndexes->getTabIndexes(current)) {
data.setNeightFree(i);
const int nI = current + closeIndexes->getIndexAt(i);
data.setCost(i, cost(centerParams, nI));
}
}
}
bool MainGrid::validateAdd(const Urho3D::IntVector2& size, const Urho3D::IntVector2 bucketCords,
bool isBuilding) const {
const auto sizeX = calculateSize(size.x_, bucketCords.x_);
const auto sizeZ = calculateSize(size.y_, bucketCords.y_);
//WARN to troche złe użycie tego ale działa
if (!calculator->isValidIndex(sizeX.x_, sizeX.y_)
|| !calculator->isValidIndex(sizeZ.x_, sizeZ.y_)) {
return false;
}
for (int i = sizeX.x_; i < sizeX.y_; ++i) {
int index = calculator->getNotSafeIndex(i, sizeZ.x_);
for (int j = sizeZ.x_; j < sizeZ.y_; ++j) {
if (!isBuildable(index)) {
return false;
}
++index;
}
}
if (isBuilding) {
auto x1 = calculator->getValidLow(sizeX.x_ - 1);
auto x2 = calculator->getValidHigh(sizeX.y_);
auto z1 = calculator->getValidLow(sizeZ.x_ - 1);
auto z2 = calculator->getValidHigh(sizeZ.y_);
for (int i = x1; i <= x2; ++i) {
for (int j = z1; j <= z2; ++j) {
if ((i < sizeX.x_ || i >= sizeX.y_) || (j < sizeZ.x_ || j >= sizeZ.y_)) {
if (isBuildable(calculator->getNotSafeIndex(i, j))) {
return true;
}
}
}
}
return false;
}
return true;
}
Urho3D::Vector2 MainGrid::repulseObstacle(Unit* unit) const {
auto index = unit->getMainGridIndex();
auto& data = complexData[index];
Urho3D::Vector2 sum;
if (index != unit->getIndexToInteract()
&& data.isPassable()
&& data.allNeightOccupied()) {
int counter = 0;
for (auto i : closeIndexes->getTabIndexes(index)) {
if (!data.ifNeightIsFree(i)) {
sum += calculator->getCenter(index + closeIndexes->getIndexAt(i));
++counter;
}
}
sum /= counter;
sum -= Urho3D::Vector2(unit->getPosition().x_, unit->getPosition().z_);
}
return -sum;
}
void MainGrid::invalidatePathCache() {
pathFinder.invalidateCache();
}
bool MainGrid::cellInState(int index, CellState state) const {
return complexData[index].getType() == state;
}
void MainGrid::updateCell(int index, char val, CellState cellState) const {
assert(calculator->isValidIndex(index));
complexData[index].updateSize(val, cellState);
}
Urho3D::Vector2 MainGrid::getPositionInBucket(Unit* unit) const {
const auto index = unit->getMainGridIndex();
const auto center = calculator->getCenter(index);
auto& content = buckets[index].getContent();
if (content.size() == 1) {
return center;
}
const auto pos = std::ranges::find(content, unit);
const auto idx = pos - content.begin();
assert(idx >= 0 && idx <= 4);
return posInBucket[idx] + center;
}
unsigned char MainGrid::getRevertCloseIndex(int center, int gridIndex) const {
int index = gridIndex - center;
for (auto i : closeIndexes->getTabIndexes(center)) {
if (closeIndexes->getIndexAt(i) == index) {
return i;
}
}
for (auto i : closeIndexes->getTabIndexes(center)) {
if (closeIndexes->getIndexAt(i) == index) {
return i;
}
}
assert(false);
Game::getLog()->Write(0, "closeIndex miscalculate");
return 0;
}
void MainGrid::addDeploy(Building* building) const {
const auto optDeployIndex = building->getDeploy();
if (optDeployIndex.has_value()) {
complexData[optDeployIndex.value()].setDeploy();
}
}
void MainGrid::removeDeploy(Building* building) const {
complexData[building->getDeploy().value()].clear();
}
CellState MainGrid::getCellAt(float x, float z) const {
auto index = calculator->indexFromPosition(x, z);
return complexData[index].getType();
}
int MainGrid::getAdditionalInfoAt(float x, float z) const {
auto index = calculator->indexFromPosition(x, z);
return complexData[index].getAdditionalInfo();
}
void MainGrid::drawDebug(GridDebugType type) const {
DebugLineRepo::clear(DebugLineType::MAIN_GRID);
DebugLineRepo::beginGeometry(DebugLineType::MAIN_GRID);
switch (type) {
case GridDebugType::NONE:
break;
case GridDebugType::CELLS_TYPE: {
for (int i = 0; i < sqResolution; ++i) {
auto center = calculator->getCenter(i);
std::tuple<bool, Urho3D::Color> info = Game::getColorPaletteRepo()->
getInfoForGrid(complexData[i].getType());
if (std::get<0>(info)) {
const auto v = calculator->getFieldSize() / 2.3f;
const auto a = getVertex(center, Urho3D::Vector2(-v, v));
const auto b = getVertex(center, Urho3D::Vector2(v, -v));
const auto c = getVertex(center, Urho3D::Vector2(v, v));
const auto d = getVertex(center, Urho3D::Vector2(-v, -v));
// DebugLineRepo::drawTriangle(DebugLineType::MAIN_GRID, {center.x_, 10, center.y_},
// {center.x_, 20, center.y_}, std::get<1>(info));
DebugLineRepo::drawTriangle(DebugLineType::MAIN_GRID, a, c, b, std::get<1>(info));
DebugLineRepo::drawTriangle(DebugLineType::MAIN_GRID, b, d, a, std::get<1>(info));
}
}
}
break;
default: ;
}
DebugLineRepo::commit(DebugLineType::MAIN_GRID);
}
Urho3D::Vector3 MainGrid::getVertex(const Urho3D::Vector2 center, Urho3D::Vector2 vertex) const {
auto result = Game::getEnvironment()->getPosWithHeightAt(center.x_ + vertex.x_, center.y_ + vertex.y_);
result.y_ += 1.f;
return result;
}
float MainGrid::getFieldSize() const {
return calculator->getFieldSize();
}
void MainGrid::drawAll() {
auto image = new Urho3D::Image(Game::getContext());
image->SetSize(calculator->getResolution(), calculator->getResolution(), 4);
Urho3D::String prefix = Urho3D::String(counter) + "_";
drawComplex(image, prefix);
++counter;
delete image;
}
bool MainGrid::cellIsCollectable(int index) const {
return complexData[index].cellIsCollectable();
}
bool MainGrid::cellIsAttackable(int index) const {
return complexData[index].cellIsAttackable();
}
bool MainGrid::anyCloseEnough(std::vector<int> const& indexes, int center, float distThreshold) const {
//TODO perf dac square anie sqroot
const auto centerCord = calculator->getIndexes(center);
for (const auto index : indexes) {
if (calculator->getDistance(centerCord, index) < distThreshold) {
return true;
}
}
return false;
}
std::vector<int> MainGrid::getIndexesInRange(const Urho3D::Vector3& center, float range) const {
std::vector<int> allIndexes;
const auto centerIdx = calculator->indexFromPosition(center);
const auto centerCords = calculator->getIndexes(centerIdx);
auto const [indexes, cords] = levelCache->getBoth(range);
auto ptrIdx = indexes->begin();
for (const auto& shiftCords : *cords) {
if (calculator->isValidIndex(shiftCords.x_ + centerCords.x_, shiftCords.y_ + centerCords.y_)) {
allIndexes.push_back(*ptrIdx + centerIdx);
}
++ptrIdx;
}
return allIndexes;
}
void MainGrid::reAddBonuses(std::vector<Building*>* buildings, char player, char resId) const {
for (int i = 0; i < sqResolution; ++i) {
complexData[i].resetResBonuses(player, resId);
}
for (const auto building : *buildings) {
const auto dbBuilding = building->getDbBuilding();
if (building->getPlayer() == player && dbBuilding->hasResourceType[resId]) {
addResourceBonuses(building);
}
}
}
float MainGrid::getBonuses(char player, const ResourceEntity* resource) const {
float best = .0f;
for (const int cell : resource->getOccupiedCells()) {
const float val = complexData[cell].getResBonus(player, resource->getId());
if (val > best) {
best = val;
}
}
return best;
}
bool MainGrid::isInLocalArea(const int center, int indexOfAim) const {
return closeIndexes->isInLocalArea(center, indexOfAim);
}
bool MainGrid::isInLocal1and2Area(int center, int indexOfAim) const {
return closeIndexes->isInLocalArea(center, indexOfAim) || closeIndexes->isInLocal2Area(center, indexOfAim);
}
bool MainGrid::isPassable(int inx) const {
return calculator->isValidIndex(inx) && complexData[inx].isPassable();
}
bool MainGrid::isBuildable(int inx) const {
return calculator->isValidIndex(inx) && complexData[inx].isBuildable();
}
int MainGrid::closestPassableCell(int posIndex) const {
//TODO improved pathFinder getPassableEnd
for (auto i : closeIndexes->get(posIndex)) {
if (complexData[i + posIndex].isPassable()) {
return i + posIndex;
}
}
for (auto i : closeIndexes->getSecond(posIndex)) {
if (complexData[i + posIndex].isPassable()) {
return i + posIndex;
}
}
return posIndex; //TODO to zwrócic optional empty
}
void MainGrid::addResourceBonuses(Building* building) const {
const auto [dbBuilding, level] = building->getData();
if (dbBuilding->typeResourceAny) {
auto const [levels, cords] = levelCache->getBoth(level->resourceRange);
std::vector<int> indexes;
indexes.reserve(levels->size() * building->getOccupiedCells().size());
for (const int cell : building->getOccupiedCells()) {
const auto centerCords = calculator->getIndexes(cell);
auto ptrIdx = levels->begin();
for (const auto& shiftCords : *cords) {
if (calculator->isValidIndex(shiftCords.x_ + centerCords.x_, shiftCords.y_ + centerCords.y_)) {
auto newIndex = cell + *ptrIdx;
indexes.push_back(newIndex);
}
++ptrIdx;
}
}
std::ranges::sort(indexes);
indexes.erase(std::unique(indexes.begin(), indexes.end()), indexes.end());
for (const int index : indexes) {
complexData[index].setResBonuses(building->getPlayer(), dbBuilding->resourceTypes, level->collect);
}
}
}
void MainGrid::removeResourceBonuses(Static* object) const {
if (object->getType() == ObjectType::BUILDING) {
const Building* building = (Building*)object;
const auto [dbBuilding, level] = building->getData();
if (dbBuilding->typeResourceAny) {
//TODO tu czegoś brakuje
}
}
}
void MainGrid::addStatic(Static* object) {
const auto bucketPos = calculator->getIndexes(object->getMainGridIndex());
for (const auto index : object->getOccupiedCells()) {
complexData[index].setStatic(object);
}
std::vector<int> toRefresh;
toRefresh.reserve(9);
const auto size = object->getGridSize();
const auto sizeX = calculateSize(size.x_, bucketPos.x_);
const auto sizeZ = calculateSize(size.y_, bucketPos.y_);
const auto iMin = calculator->getValid(sizeX.x_ - 1);
const auto iMax = calculator->getValid(sizeX.y_ + 1);
const auto jMin = calculator->getValid(sizeZ.x_ - 1);
const auto jMax = calculator->getValid(sizeZ.y_ + 1);
for (int i = iMin; i < iMax; ++i) {
int index = calculator->getNotSafeIndex(i, jMin);
for (int j = jMin; j < jMax; ++j) {
auto& data = complexData[index];
updateNeighbors(data, index);
if (data.isPassable()) {
data.setEscapeThrough(-1);
} else {
toRefresh.push_back(index);
}
++index;
}
}
pathFinder.refreshWayOut(toRefresh);
}
void MainGrid::removeStatic(Static* object) const {
for (const auto index : object->getOccupiedCells()) {
auto& data = complexData[index];
data.clear();
updateNeighbors(data, index);
}
for (const auto index : object->getSurroundCells()) {
updateNeighbors(complexData[index], index);
}
removeResourceBonuses(object);
//TODO BUG remove deploy??
}
std::optional<Urho3D::Vector2> MainGrid::getDirectionFrom(int index, const Urho3D::Vector3& position) const {
//assert(unit->getMainGridIndex()==index);//TODO perf zamienic jezeli ok
auto& data = complexData[index];
if (!data.isPassable()) {
int escapeBucket; //=-1
//auto& neights = complexData[index].getNeightbours();
if (!data.allNeightOccupied()) {
float dist = 999999;
const auto center = calculator->getCenter(index);
for (auto i : closeIndexes->getTabIndexes(index)) {
if (data.ifNeightIsFree(i)) {
int ni = index + closeIndexes->getIndexAt(i);
float newDist = sqDist(calculator->getCenter(ni), center);
//TODO perf da sie obliczyc oglosc bez obliczania centrów calculator->getDistance
if (newDist < dist) {
dist = newDist;
escapeBucket = ni;
}
}
}
} else {
escapeBucket = data.getEscapeBucket();
}
if (escapeBucket == -1) {
return {};
}
auto direction = data //TODO Error'this' nie uzywany
.getDirectionFrom(position, calculator->getCenter(escapeBucket));
direction.Normalize();
return direction;
}
return {};
}
Urho3D::Vector2 MainGrid::getValidPosition(const Urho3D::IntVector2& size, const Urho3D::Vector2& pos) const {
return getValidPosition(size, Urho3D::IntVector2(calculator->getIndex(pos.x_), calculator->getIndex(pos.y_)));
}
Urho3D::Vector2 MainGrid::getValidPosition(const Urho3D::IntVector2& size, const Urho3D::IntVector2& cords) const {
const auto sizeX = calculateSize(size.x_, cords.x_);
const auto sizeZ = calculateSize(size.y_, cords.y_);
const int index1 = calculator->getIndex(sizeX.x_, sizeZ.x_);
const int index2 = calculator->getIndex(sizeX.y_ - 1, sizeZ.y_ - 1);
const auto center1 = calculator->getCenter(index1);
const auto center2 = calculator->getCenter(index2);
return (center1 + center2) / 2;
}
void MainGrid::updateNeighbors(ComplexBucketData& data, const int current) const {
for (auto i : closeIndexes->getTabIndexes(current)) {
const int nI = current + closeIndexes->getIndexAt(i);
if (complexData[nI].isPassable()) {
data.setNeightFree(i);
} else {
data.setNeightOccupied(i);
}
}
}
float inline MainGrid::cost(const Urho3D::IntVector2& centerParams, int next) const {
return calculator->getDistance(centerParams, next);
}
const std::vector<int>* MainGrid::findPath(int startIdx, int endIdx, int limit) {
return pathFinder.findPath(startIdx, endIdx, limit);
}
const std::vector<int>* MainGrid::findPath(int startIdx, const std::vector<int>& endIdxs, int limit) {
return pathFinder.findPath(startIdx, endIdxs, limit);
}
void MainGrid::drawComplex(Urho3D::Image* image, const Urho3D::String prefix) const {
for (short y = 0; y != calculator->getResolution(); ++y) {
for (short x = 0; x != calculator->getResolution(); ++x) {
const int index = calculator->getIndex(x, y);
image->SetPixel(x, calculator->getResolution() - y - 1,
std::get<1>(Game::getColorPaletteRepo()->getInfoForGrid(complexData[index].getType())));
}
}
image->SavePNG("result/images/complexData/type_" + prefix + ".png");
}
```
ObjectsInfo.cpp
```#include "ObjectsInfo.h"
ObjectsInfo::ObjectsInfo() {
reset();
}
void ObjectsInfo::reset() {
unitDied = false;
amountUnitChanged = false;
buildingDied = false;
amountBuildingChanged = false;
resourceDied = false;
amountResourceChanged = false;
}
void ObjectsInfo::setUnitDied() {
unitDied = true;
amountUnitChanged = true;
}
void ObjectsInfo::setAmountUnitChanged() {
amountUnitChanged = true;
}
void ObjectsInfo::setBuildingDied() {
buildingDied = true;
amountBuildingChanged = true;
}
void ObjectsInfo::setAmountBuildingChanged() {
amountBuildingChanged = true;
}
void ObjectsInfo::setResourceDied() {
resourceDied = true;
amountResourceChanged = true;
}
void ObjectsInfo::setAmountResourceChanged() {
amountResourceChanged = true;
}
```
Brain.h
```#pragma once
#include <span>
#include <string>
#include <vector>
class Layer;
class Brain {
public:
explicit Brain(const std::string& filename, std::vector<std::string>& lines);
Brain(const Brain& rhs) = delete;
~Brain();
const std::span<float> decide(std::span<float> data);
std::string getName() const;
short getOutputSize() const;
private:
std::vector<Layer*> allLayers;
std::string filename;
};
```
OrderUtils.h
```#pragma once
#include "database/db_strcut.h"
#include "Game.h"
#include "env/Environment.h"
#include "objects/PhysicalUtils.h"
template <typename T>
void removeExpired(std::vector<T*>& orders) {
orders.erase(std::remove_if(orders.begin(), orders.end(),
[](T* uo) {
const bool expired = uo->expired();
if (expired) {
delete uo;
}
return expired;
}),
orders.end());
}
inline bool toAction(Unit* unit, std::vector<Physical*>* list, UnitAction order,
const std::function<bool(Physical*)>& condition) {
const auto closest = Game::getEnvironment()->closestPhysical(unit, list, condition,
unit->getLevel()->sqSightRadius);
return unit->toActionIfInRange(closest, order);
}
inline void tryToAttack(Unit* unit,
const std::function<bool(Physical*)>& condition) {
const bool result = toAction(
unit, Game::getEnvironment()->getNeighboursFromTeamNotEq(unit, unit->getLevel()->interestRange),
UnitAction::ATTACK, condition);
if (!result) {
toAction(
unit, Game::getEnvironment()->getBuildingsFromTeamNotEq(unit, -1, unit->getLevel()->interestRange),
UnitAction::ATTACK, condition);
}
}
inline void tryToCollect(Unit* unit) {
const auto id = unit->getLastActionThingId();
std::vector<Physical*>* list;
bool result = false;
if (id >= 0) {
list = Game::getEnvironment()->getResources(unit->getPosition(), id, unit->getLevel()->interestRange);
result = toAction(unit, list, UnitAction::COLLECT, belowClose);
}
if (id < 0 || !result) {
list = Game::getEnvironment()->getResources(unit->getPosition(), -1, unit->getLevel()->interestRange);
toAction(unit, list, UnitAction::COLLECT, belowClose);
}
}
```
InfluenceMapFloat.h
```#pragma once
#include <vector>
#include "InfluenceMap.h"
class InfluenceMapFloat : public InfluenceMap {
public:
InfluenceMapFloat(unsigned short resolution, float size, float coef, char level, float valueThresholdDebug);
virtual ~InfluenceMapFloat();
void update(Physical* thing, float value = 1.f) override;
void updateInt(Physical* thing, int value = 1) override;
void tempUpdate(const Urho3D::Vector3& pos, float value = 1.f);
void tempUpdate(int index, float value = 1.f);
void update(int index, float value) const;
void reset() override;
float getValueAt(int index) const override;
float getValueAt(const Urho3D::Vector2& pos) const;
float getValueAsPercent(const Urho3D::Vector2& pos) const override;
float getValueAsPercent(int index) const override;
void computeMinMax() override;
void ensureReady() override;
std::vector<int> getIndexesWithByValue(float percent, float tolerance);
bool cumulateErros(float percent, float* intersection) const;
void updateFromTemp();
protected:
float* values;
float* tempVals;
float coef;
bool valuesCalculateNeeded = false;
private:
void update(float value, unsigned short centerX, unsigned short centerZ) const;
unsigned char level;
unsigned char levelRes;
float* templateV;
};
```
ContentInfo.h
```#pragma once
#include <algorithm>
#include "database/DatabaseCache.h"
#include "utils/defines.h"
struct content_info {
content_info() {
reset();
}
~content_info() = default;
content_info(const content_info&) = delete;
void reset() {
allyNumber = 0;
enemiesNumber = 0;
allyBuilding = 0;
enemyBuilding = 0;
std::fill_n(unitsNumberPerPlayer, MAX_PLAYERS, 0);
std::fill_n(buildingNumberPerPlayer, MAX_PLAYERS, 0);
std::fill_n(resourceNumber, RESOURCES_SIZE, 0);
hasBuilding = false;
hasUnit = false;
hasResource = false;
}
unsigned char biggestBuilding() {
return std::max_element(buildingNumberPerPlayer, buildingNumberPerPlayer + MAX_PLAYERS) -
buildingNumberPerPlayer;
}
unsigned char biggestUnits() {
return std::max_element(unitsNumberPerPlayer, unitsNumberPerPlayer + MAX_PLAYERS) -
unitsNumberPerPlayer;
}
unsigned char biggestResource() {
return std::max_element(resourceNumber, resourceNumber + RESOURCES_SIZE) -
resourceNumber;
}
unsigned short unitsNumberPerPlayer[MAX_PLAYERS];
unsigned short allyNumber;
unsigned short enemiesNumber;
unsigned char allyBuilding;
unsigned char enemyBuilding;
unsigned char buildingNumberPerPlayer[MAX_PLAYERS];
unsigned char resourceNumber[RESOURCES_SIZE];
bool hasUnit;
bool hasBuilding;
bool hasResource;
};
```
SelectedInfoType.h
```#pragma once
#include <vector>
class Physical;
class SelectedInfoType {
public:
explicit SelectedInfoType(unsigned short id);
~SelectedInfoType() = default;
void clear();
void add(Physical* physical);
const std::vector<Physical*>& getData() const { return data; }
unsigned short getId() const { return id; }
private:
unsigned short id;
std::vector<Physical*> data;
};
```
MiniMapPanel.h
```#pragma once
#include "hud/window/EventPanel.h"
#include "utils/defines.h"
namespace Urho3D {
class Texture2D;
class Image;
class Sprite;
}
constexpr char MINI_MAP_BUTTON_NUMBER = 5;
class MiniMapPanel : public EventPanel {
public:
void initColors();
explicit MiniMapPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~MiniMapPanel();
void createEmpty(int parts);
void changeValue(uint32_t* data, bool& changed, unsigned val) const;
void update();
private:
void createBody() override;
void HandleButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleMiniMapClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
Urho3D::Sprite* spr;
Urho3D::Image* minimap;
Urho3D::Texture2D* text;
unsigned* heightMap;
int indexUpdate = 0;
int indexPerUpdate;
bool checks[MINI_MAP_BUTTON_NUMBER];
unsigned *unitsColors,
*buildingColors;
unsigned resourceColors[RESOURCES_SIZE];
};
```
ComplexBucketData.cpp
```#include "ComplexBucketData.h"
#include "objects/static/Static.h"
#include "objects/CellState.h"
#include "utils/Flags.h"
ComplexBucketData::ComplexBucketData() {
clear();
}
void ComplexBucketData::setStatic(Static* object) {
size = 0;
if (object->getType() == ObjectType::BUILDING) {
state = CellState::BUILDING;
additionalInfo = object->getPlayer();
} else {
state = CellState::RESOURCE;
additionalInfo = object->getId();
}
for (auto& resourceBonus : resourceBonuses) {
std::fill_n(resourceBonus, RESOURCES_SIZE, 1.f);
}
}
void ComplexBucketData::clear() {
state = CellState::NONE;
additionalInfo = -1;
size = 0;
}
void ComplexBucketData::setEscapeThrough(int val) {
escapeBucketIndex = val;
}
Urho3D::Vector2 ComplexBucketData::getDirectionFrom(const Urho3D::Vector3& position, Urho3D::Vector2 centerEscape) {
return {centerEscape.x_ - position.x_, centerEscape.y_ - position.z_};
}
void ComplexBucketData::setNeightOccupied(const unsigned char index) {
isNeightOccupied |= Flags::bitFlags[index];
}
void ComplexBucketData::setNeightFree(const unsigned char index) {
isNeightOccupied &= ~Flags::bitFlags[index];
}
bool ComplexBucketData::isBuildable() const {
return state == CellState::NONE
|| state == CellState::COLLECT;
}
void ComplexBucketData::updateSize(char val, CellState cellState) {//TODO przemyslec to
size += val;
if (size <= 0) {
size = 0;
if (state == CellState::ATTACK || state == CellState::COLLECT) {
state = CellState::NONE;
}
} else {
if (state == CellState::NONE || state == CellState::ATTACK || state == CellState::COLLECT) {
state = cellState;
}
}
}
void ComplexBucketData::setResBonuses(char player, const std::vector<char>& resIds, float bonus) {
auto& vals = resourceBonuses[player];
for (const char resId : resIds) {
auto& val = vals[resId];
if (val < bonus) {
val = bonus;
}
}
}
void ComplexBucketData::resetResBonuses(char player, char resId) {
resourceBonuses[player][resId] = 1.f;
}
float ComplexBucketData::getResBonus(char player, short resId) const {
return resourceBonuses[player][resId];
}
bool ComplexBucketData::belowCellLimit() const {
return size < 2;
}
void ComplexBucketData::setDeploy() {
state = CellState::DEPLOY;
}
bool ComplexBucketData::cellIsCollectable() const {
return (state == CellState::NONE
|| state == CellState::COLLECT)
&& belowCellLimit();
}
bool ComplexBucketData::cellIsAttackable() const {
return (state == CellState::NONE
|| state == CellState::ATTACK
|| state == CellState::DEPLOY)
&& belowCellLimit();
}
```
DatabaseCache.cpp
```#include "DatabaseCache.h"
#include <iostream>
#include "db_grah_structs.h"
#include "db_load.h"
#include "db_utils.h"
#include "scene/save/SQLConsts.h"
void DatabaseCache::execute(const std::string& sql, int (*load)(void*, int, char**, char**)) const {
char* error;
const int rc = sqlite3_exec(database, sql.c_str(), load, dbContainer, &error);
ifError(rc, error, sql);
}
bool DatabaseCache::openDatabase(const std::string& name) {
const int rc = sqlite3_open_v2((pathStr + name).c_str(), &database, SQLITE_OPEN_READONLY, nullptr);
if (rc) {
std::cerr << "Error opening SQLite3 database: " << sqlite3_errmsg(database) << " " << name << std::endl;
sqlite3_close_v2(database);
return true;
}
//std::cout << "Database Opened: " << name << std::endl;
return false;
}
DatabaseCache::DatabaseCache(std::string postfix) {
dbContainer = new db_container();
pathStr = std::string("Data/");
if(!SIM_GLOBALS.HEADLESS) {
loadBasic("Database/base" + postfix + ".db");
}
loadData("Database/data" + postfix + ".db");
loadMaps("map/maps" + postfix + ".db");
}
void DatabaseCache::loadBasic(const std::string& name) {
if (openDatabase(name)) { return; }
execute(SQLConsts::SELECT + "hud_size", loadHudSizes);
execute(SQLConsts::SELECT + "graph_settings", loadGraphSettings);
execute(SQLConsts::SELECT + "hud_size_vars", loadHudVars);
execute(SQLConsts::SELECT + "resolution", loadResolution);
execute(SQLConsts::SELECT + "settings", loadSettings);
sqlite3_close_v2(database);
}
void DatabaseCache::loadData(const std::string& name) {
if (openDatabase(name)) { return; }
execute(SQLConsts::SELECT + "nation order by id desc", loadNation);
execute(SQLConsts::SELECT + "unit order by id desc", loadUnits);
execute(SQLConsts::SELECT + "building order by id desc", loadBuildings);
execute(SQLConsts::SELECT + "resource order by id desc", loadResource);
execute(SQLConsts::SELECT + "building_cost", loadCostBuilding);
execute(SQLConsts::SELECT + "unit_cost", loadCostUnit);
execute(SQLConsts::SELECT + "orders order by id desc", loadOrders);
execute(SQLConsts::SELECT + "player_color order by id desc", loadPlayerColors);
execute(SQLConsts::SELECT + "unit_level order by level", loadUnitLevels);
execute(SQLConsts::SELECT + "building_level order by level", loadBuildingLevels);
execute(SQLConsts::SELECT + "unit_to_nation order by unit", loadUnitToNation);
execute(SQLConsts::SELECT + "building_to_nation order by building", loadBuildingToNation);
execute(SQLConsts::SELECT + "unit_to_building_level order by unit", loadUnitToBuildingLevels);
//TODO make sure its sorted set_intersection
execute(SQLConsts::SELECT + "unit_level_cost", loadCostUnitLevel);
execute(SQLConsts::SELECT + "building_level_cost", loadCostBuildingLevel);
dbContainer->finish();
sqlite3_close_v2(database);
}
void DatabaseCache::loadMaps(const std::string& name) {
if (openDatabase(name)) { return; }
execute(SQLConsts::SELECT + "map order by id desc", loadMap);
sqlite3_close_v2(database);
}
DatabaseCache::~DatabaseCache() {
delete dbContainer;
}
void DatabaseCache::executeSingleBasic(const std::string& name, const char* sql) {
if (openDatabase(name)) { return; }
execute(sql, callback);
sqlite3_close_v2(database);
}
void DatabaseCache::setGraphSettings(int i, db_graph_settings* graphSettings) {
graphSettings->name = dbContainer->graphSettings[i]->name;
graphSettings->styles = dbContainer->graphSettings[i]->styles;
delete dbContainer->graphSettings[i];
dbContainer->graphSettings[i] = graphSettings;
Urho3D::String sql = "UPDATE graph_settings";
sql.Append(" SET hud_size = ").Append(Urho3D::String(graphSettings->hud_size))
//.Append("SET style =").Append(Urho3D::String(graphSettings->hud_size));
.Append(", fullscreen = ").Append(Urho3D::String((int)graphSettings->fullscreen))
.Append(", max_fps =").Append(Urho3D::String(graphSettings->max_fps))
.Append(", min_fps =").Append(Urho3D::String(graphSettings->min_fps))
.Append(", name = ").Append("'" + Urho3D::String(graphSettings->name) + "'")
.Append(", v_sync = ").Append(Urho3D::String((int)graphSettings->v_sync))
.Append(", shadow = ").Append(Urho3D::String((int)graphSettings->shadow))
.Append(", texture_quality =").Append(Urho3D::String(graphSettings->texture_quality))
.Append(" WHERE id =").Append(Urho3D::String(i));
executeSingleBasic("base.db", sql.CString());
}
void DatabaseCache::setSettings(int i, db_settings* settings) {
settings->graph = 0;
delete dbContainer->settings[0];
dbContainer->settings[0] = settings;
Urho3D::String sql = "UPDATE settings";
sql.Append(" SET graph = ").Append(Urho3D::String(settings->graph))
.Append(", resolution = ").Append(Urho3D::String(settings->resolution));
executeSingleBasic("base.db", sql.CString());
}
void DatabaseCache::refreshAfterParametersRead() const {
for (const auto nation : dbContainer->nations) {
nation->refresh();
}
}
```
UnitOrder.cpp
```#include "UnitOrder.h"
#include "Game.h"
#include "enums/UnitAction.h"
#include "objects/Physical.h"
#include "objects/unit/aim/FollowAim.h"
#include "objects/unit/aim/TargetAim.h"
#include "env/Environment.h"
#include "utils/consts.h"
UnitOrder::UnitOrder(short id, bool append, Urho3D::Vector2& vector):
id(id), append(append), toUse(nullptr), vector(new Urho3D::Vector2(vector)) {}
UnitOrder::UnitOrder(short id, bool append, Physical* toUse):
id(id), append(append), toUse(toUse), vector(nullptr) {}
UnitOrder::~UnitOrder() {
delete vector;
}
ActionParameter UnitOrder::getTargetAim(int startInx, Urho3D::Vector2& to) {
const auto target = getTargetAimPtr(startInx, to);
if (target) {
return ActionParameter(target);
}
return Consts::EMPTY_ACTION_PARAMETER;
}
TargetAim* UnitOrder::getTargetAimPtr(int startInx, const Urho3D::Vector2& to) const {
const auto path = Game::getEnvironment()->findPath(startInx, to);
return getAimFromPath(path);
}
TargetAim* UnitOrder::getTargetAimPtr(int startInx, const std::vector<int>& endIdxs) const {
const auto path = Game::getEnvironment()->findPath(startInx, endIdxs);
return getAimFromPath(path);
}
TargetAim* UnitOrder::getAimFromPath(const std::vector<int>* path) const {
if (!path->empty()) {
return new TargetAim(*path);
}
return nullptr;
}
ActionParameter UnitOrder::getFollowAim(int startInx, const std::vector<int>& endIdxs) {
auto* const target = getTargetAimPtr(startInx, endIdxs);
if (target) {
return ActionParameter(new FollowAim(toUse, target));
}
return Consts::EMPTY_ACTION_PARAMETER;
//assert(target != nullptr); //TODO check
}
ActionParameter UnitOrder::getChargeAim(Urho3D::Vector2& charge) {
return Consts::EMPTY_ACTION_PARAMETER;
}
void UnitOrder::execute() {
if (expired()) {
assert(false);
}
switch (static_cast<UnitAction>(id)) {
case UnitAction::GO:
return addTargetAim();
case UnitAction::FOLLOW:
if (toUse && toUse->isAlive()) {
addFollowAim();
}
break;
case UnitAction::CHARGE:
return addChargeAim();
case UnitAction::ATTACK:
return addAttackAim();
case UnitAction::DEAD:
return addDeadAim();
case UnitAction::DEFEND:
return addDefendAim();
case UnitAction::COLLECT:
return addCollectAim();
case UnitAction::STOP:
return addStopAim();
}
}
short UnitOrder::getToUseId() const {
assert(toUse!=nullptr);
if (toUse) {
return toUse->getId();
}
}
```
SQLConsts.h
```#pragma once
#include <string>
struct SQLConsts {
inline const static std::string PHYSICAL_COL =
"id_db INT NOT NULL,"
"hp_coef INT NOT NULL,"
"player INT NOT NULL,"
"level INT NOT NULL,";
inline const static std::string STATIC_COL =
PHYSICAL_COL
+ "bucket_x INT NOT NULL,"
+ "bucket_y INT NOT NULL,"
+ "state INT NOT NULL,"
+ "next_state INT NOT NULL,";
inline const static std::string BUILDING_COL =
STATIC_COL +
"deploy_Idx INT NOT NULL";
inline const static std::string RESOURCE_COL = STATIC_COL;
inline const static std::string UNIT_COL =
PHYSICAL_COL +
"position_x INT NOT NULL,"
"position_z INT NOT NULL,"
"state INT NOT NULL,"
"velocity_x INT NOT NULL,"
"velocity_z INT NOT NULL";
inline const static std::string PLAYER_COL =
"id INT NOT NULL,"
"is_active INT NOT NULL,"
"team INT NOT NULL,"
"nation INT NOT NULL,"
"name TEXT NOT NULL,"
"color INT NOT NULL";
inline const static std::string PLAYER_RESOURCES_COL =
"player INT NOT NULL,"
"resource INT NOT NULL,"
"amount INT NOT NULL";
inline const static std::string CONFIG_COL =
"precision INT NOT NULL,"
"map INT NOT NULL,"
"size INT NOT NULL";
inline const static std::string CREATE_TABLE = "CREATE TABLE ";
inline const static std::string SELECT = "SELECT * from ";
inline const static std::string COUNT = "SELECT count(*) from ";
};
```
InfluenceMapI.h
```#pragma once
#include <Urho3D/Math/Vector2.h>
class Physical;
namespace Urho3D {
class String;
}
class InfluenceMapI {
public:
virtual ~InfluenceMapI() = default;
virtual void update(Physical* thing, float value = 1.f) =0;
virtual void updateInt(Physical* thing, int value = 1) =0;
virtual void reset() =0;
virtual void print(Urho3D::String name) =0;
virtual unsigned short getResolution() const =0;
virtual Urho3D::Vector2 getCenter(int index) =0;
};
```
Possession.h
```#pragma once
#include <span>
#include <vector>
enum class ParentBuildingType : char;
class Physical;
class Player;
class ObjectsInfo;
class Unit;
class Building;
class Resources;
class Possession {
public:
Possession(char nation);
~Possession();
Possession(const Possession&) = delete;
void add(Building* building);
void add(Unit* unit);
void updateAndClean(const Resources& resources, const ObjectsInfo* simInfo);
int getScore() const;
int getUnitsNumber() const;
int getBuildingsNumber() const;
int getWorkersNumber() const;
int getFreeWorkersNumber() const;
int getFreeArmyNumber() const;
std::span<float> getResWithOutBonus() const { return resWithoutBonus; };
std::vector<Building*>* getBuildings(short id);
const std::vector<Building*>& getBuildings();
void addKilled(Physical* physical);
std::span<float> getUnitsMetrics() const { return unitsSumAsSpan; }
std::span<float> getFreeArmyMetrics() const { return freeArmySumAsSpan; }
std::span<float> getBuildingsMetrics() const { return buildingsSumAsSpan; }
std::span<float> getBuildingsMetrics(ParentBuildingType type) const;
const std::vector<Unit*>& getWorkers() const { return workers; }
std::vector<Unit*> getFreeArmy();
bool hasAnyFreeArmy() const;
float getAttackSum() const;
float getDefenceAttackSum();
private:
std::span<float> refreshBuildingSum(const std::span<unsigned char> idxs, std::span<float> out) const;
std::span<float> refreshResource(const std::span<unsigned char> idxs, std::span<float> out) const;
std::vector<Building*> buildings;
std::vector<std::vector<Building*>*> buildingsPerId;
std::vector<Unit*> units;
std::vector<Unit*> workers;
int freeWorkersNumber = 0;
int freeArmyNumber = 0;
float resourcesSum = 0.f;
float resourcesDestroyed = 0.f;
int levelsSize;
float* levels;
float* levelsFree;
float* data;
std::span<float> unitsSumAsSpan;
std::span<float> freeArmySumAsSpan; //TODO to dac jako któtkie
std::span<float> buildingsSumAsSpan;
std::span<float> buildingsOtherSumSpan;
std::span<float> buildingsDefenceSumSpan;
std::span<float> resWithoutBonus;
std::span<float> buildingsTechSumSpan;
std::span<float> buildingsUnitsSumSpan;
};
```
ResourceActionCommand.cpp
```#include "ResourceActionCommand.h"
#include "math/VectorUtils.h"
#include "objects/resource/ResourceEntity.h"
ResourceActionCommand::ResourceActionCommand(ResourceEntity* resource, ResourceActionType action, char player)
: AbstractCommand(player), action(action) {
resources.emplace_back(resource);
}
ResourceActionCommand::ResourceActionCommand(const std::vector<Physical*>& resources, ResourceActionType action,
char player) : AbstractCommand(player), action(action) {
this->resources.reserve(resources.size());
for (auto* resource : resources) {
this->resources.emplace_back(reinterpret_cast<ResourceEntity*>(resource));
}
}
void ResourceActionCommand::execute() {
for (const auto resource : resources) {
resource->action(action, player);
}
}
void ResourceActionCommand::clean() {
cleanDead(resources);
}
bool ResourceActionCommand::expired() {
return resources.empty();
}
```
GridCalculatorProvider.h
```#pragma once
#include <vector>
struct GridCalculator;
class GridCalculatorProvider {
public:
~GridCalculatorProvider();
static GridCalculator* get(unsigned short resolution, float size);
private:
GridCalculatorProvider() = default;
static std::vector<GridCalculator*> calculators;
};
```
QueueManager.cpp
```#include "QueueManager.h"
#include "QueueElement.h"
#include "QueueUtils.h"
QueueManager::QueueManager(unsigned short maxCapacity): maxCapacity(maxCapacity) {
}
QueueManager::~QueueManager() {
clear_vector(queue);
}
void QueueManager::add(short number, QueueActionType type, short id, unsigned short localMaxCapacity) {
for (auto i : queue) {
if (i->checkType(type, id)) {
number = i->add(number);
}
}
while (number > 0) {
auto element = new QueueElement(type, id, std::min(maxCapacity, localMaxCapacity),
getSecToComplete(type, id, 0),
getSecPerInstance(type, id, 0));
number = element->add(number);
queue.push_back(element);
}
}
QueueElement* QueueManager::update() {
for (auto i = 0; i < queue.size(); ++i) {
if (queue.at(i)->getAmount() <= 0) {
delete queue.at(i);
queue.erase(queue.begin() + i);
}
}
if (!queue.empty()) {
auto element = *queue.begin();
if (element->update()) {
queue.erase(queue.begin());
return element;
}
}
return nullptr;
}
short QueueManager::getSize() const {
return queue.size();
}
QueueElement* QueueManager::getAt(short i) {
return queue.at(i);
}
```
StringUtils.h
```#pragma once
#include <iomanip>
#include <string>
#include <vector>
#include <sstream>
#include <span>
inline std::vector<std::string> split(const std::string& s, char delimiter) {
std::vector<std::string> tokens;
std::string token;
std::istringstream tokenStream(s);
while (std::getline(tokenStream, token, delimiter)) {
tokens.push_back(token);
}
return tokens; //TODO performance czy to kopia?
}
template <typename Iterator>
std::string join(Iterator begin, Iterator end, char separator = ';') {
std::ostringstream o;
if (begin != end) {
o << *begin++;
for (; begin != end; ++begin)
o << separator << *begin;
}
return o.str(); //TODO performance czy to kopia?
}
template <typename T>
std::string join(std::span<T> span, char separator = ';') {
return join(span.begin(), span.end(), separator);
}
template <typename T>
std::string join(std::vector<T> span, char separator = ';') {
return join(span.begin(), span.end(), separator);
}
inline std::string asStringF(float val, int precision = 2) {
std::stringstream ss;
ss << std::fixed << std::setprecision(precision) << val;
return ss.str();
}
inline int fatoi(const char* str) {
int val = 0;
while (*str) {
val = val * 10 + (*str++ - '0');
}
return val;
}
```
State.cpp
```#include "State.h"
#include <magic_enum.hpp>
#include "../Unit.h"
#include "utils/OtherUtils.h"
State::State(std::initializer_list<UnitState> active) {
std::fill_n(nextStates, magic_enum::enum_count<UnitState>(), false);
for (auto state : active) {
nextStates[cast(state)] = true;
}
}
bool State::canStart(Unit* unit, const ActionParameter& parameter) {
return true;
}
bool State::validateTransition(UnitState stateTo) {
return nextStates[cast(stateTo)];
}
```
TopInfoPanel.cpp
```#include "TopInfoPanel.h"
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
TopInfoPanel::TopInfoPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : SimplePanel(root, _style, "TopInfoPanel", {}) {
}
void TopInfoPanel::hoverOn() {
setVisible(true);
}
void TopInfoPanel::hoverOff() {
setVisible(false);
}
void TopInfoPanel::createBody() {
text = addChildText(window, "MyText", style);
}
```
BuildingActionCommand.cpp
```#include "BuildingActionCommand.h"
#include "math/VectorUtils.h"
#include "objects/building/Building.h"
BuildingActionCommand::BuildingActionCommand(Building* building, BuildingActionType action, short id, char player)
: AbstractCommand(player), id(id), action(action) {
buildings.emplace_back(building);
if (building->isReady()) {
this->buildings.emplace_back(building);
}
}
BuildingActionCommand::BuildingActionCommand(const std::vector<Physical*>& buildings, BuildingActionType action,
short id,
char player) : AbstractCommand(player), id(id), action(action) {
this->buildings.reserve(buildings.size());
for (const auto building : buildings) {
auto build = reinterpret_cast<Building*>(building);
if (build->isReady()) {
this->buildings.emplace_back(build);
}
}
}
void BuildingActionCommand::clean() {
cleanDead(buildings);
}
bool BuildingActionCommand::expired() {
return buildings.empty();
}
void BuildingActionCommand::execute() {
for (const auto building : buildings) {
building->action(action, id);
}
}
```
SelectedHudPanel.cpp
```#include "SelectedHudPanel.h"
#include <Urho3D/Graphics/Texture2D.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/Window.h>
#include "GameState.h"
#include "SelectedHudElement.h"
#include "control/SelectedInfo.h"
#include "control/SelectedInfoType.h"
#include "database/DatabaseCache.h"
#include "hud/UiUtils.h"
#include "objects/NamesCache.h"
SelectedHudPanel::SelectedHudPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style)
: SimplePanel(root, _style, "SelectedInfoWindow",
{GameState::RUNNING, GameState::PAUSE}) {
}
SelectedHudPanel::~SelectedHudPanel() {
clear_array(elements, linesNumber * maxInRow);
delete[]elements;
delete[]rows;
}
void SelectedHudPanel::hide(int i) {
const auto lh = lastHidden;
lastHidden = i;
for (; i < lh; ++i) {
elements[i]->hide();
}
}
std::vector<Urho3D::Button*> SelectedHudPanel::getButtonsSelectedToSubscribe() const {
std::vector<Urho3D::Button*> buttons;
buttons.reserve(linesNumber * maxInRow);
for (int i = 0; i < linesNumber * maxInRow; ++i) {
buttons.push_back(elements[i]->getButton());
}
return buttons;
}
void SelectedHudPanel::createBody() {
createRows();
int border = rows[0]->GetLayoutBorder().left_ + rows[0]->GetLayoutBorder().right_
+ window->GetLayoutBorder().left_ + window->GetLayoutBorder().right_;
int space = window->GetSize().x_ - border;
maxInRow = space / iconSize();
elements = new SelectedHudElement*[linesNumber * maxInRow];
for (int i = 0; i < linesNumber; ++i) {
for (int j = 0; j < maxInRow; ++j) {
elements[i * maxInRow + j] = new SelectedHudElement(rows[i], style);
}
}
lastHidden = linesNumber * maxInRow;
}
int SelectedHudPanel::iconSize() const {
auto test = new Urho3D::UIElement(Game::getContext());
test->SetStyle("Icon", style);
int size = test->GetSize().x_ + rows[0]->GetLayoutSpacing();
test->Remove();
delete test;
return size;
}
void SelectedHudPanel::createRows() {
rows = new Urho3D::UIElement*[linesNumber];
for (int i = 0; i < linesNumber; ++i) {
rows[i] = createElement<Urho3D::UIElement>(window, style, "MyListRow");
}
}
void SelectedHudPanel::clearSelected() {
hide(0);
}
void SelectedHudPanel::update(SelectedInfo* selectedInfo) {
ObjectType type = selectedInfo->getSelectedType();
int all = selectedInfo->getAllNumber();
auto selectedSubTypeNumber = selectedInfo->getSelectedSubTypeNumber();
int ratio = all / (linesNumber * maxInRow - selectedSubTypeNumber + 2) + 1;
int k = 0;
for (auto& infoType : selectedInfo->getSelectedTypes()) {
auto& data = infoType->getData();
if (data.empty()) { continue; }
auto name = getIconName(type, infoType->getId());
auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>("textures/hud/icon/" + name);
for (int j = 0; j < data.size(); j += ratio) {
int max = Urho3D::Min(data.size(), j + ratio);
int diff = max - j;
elements[k]->add(data, j, max);
elements[k]->show();
elements[k]->setTexture(texture);
if (diff > 1) {
elements[k]->setText(Urho3D::String(diff));
} else {
elements[k]->hideText();
}
++k;
if (k >= linesNumber * maxInRow) {
break;
}
}
}
hide(k);
}
```
NewGameForm.h
```#pragma once
#include "NewGamePlayer.h"
#include <vector>
struct NewGameForm {
std::vector<NewGamePlayer> players;
int map;
int difficulty;
int gameSpeed;
unsigned size = 256;
};
```
ObjectsInfo.h
```#pragma once
enum class ObjectType : char;
class ObjectsInfo {
public:
ObjectsInfo();
~ObjectsInfo() = default;
void reset();
void setAmountUnitChanged();
void setAmountBuildingChanged();
void setAmountResourceChanged();
bool ifUnitDied() const { return unitDied; }
bool ifAmountUnitChanged() const { return amountUnitChanged; }
bool ifBuildingDied() const { return buildingDied; }
bool ifAmountBuildingChanged() const { return amountBuildingChanged; }
bool ifResourceDied() const { return resourceDied; }
bool ifAmountResourceChanged() const { return amountResourceChanged; }
void setUnitDied();
void setBuildingDied();
void setResourceDied();
private:
bool unitDied;
bool amountUnitChanged;
bool buildingDied;
bool amountBuildingChanged;
bool resourceDied;
bool amountResourceChanged;
};
```
Layer.cpp
```#include "Layer.h"
#include <algorithm>
#include <cassert>
#include <iostream>
#include <span>
#include "AFUtil.h"
Layer::Layer(std::vector<float>& w, std::vector<float>& bias) {
prevSize = w.size() / bias.size();
values = new float[bias.size()];
std::fill_n(values, bias.size(), 0);
this->bias = new float[bias.size()];
std::ranges::copy(bias, this->bias);
this->w = new float[w.size()];
std::ranges::copy(w, this->w);
valuesSpan = std::span{values, bias.size()};
}
Layer::~Layer() {
delete []values;
delete []bias;
delete []w;
}
void Layer::setValues(std::span<float> data) const {
assert(valuesSpan.size() == data.size());
std::ranges::copy(data, valuesSpan.begin());
}
void Layer::setValues(Eigen::MatrixXf& mult) const {
auto* bPtr = bias;
auto* vPtr = values;
for (int i = 0; i < mult.rows(); ++i, ++bPtr, ++vPtr) {
*vPtr = tanh1(mult(i) + *bPtr);
}
}
```
CloseIndexesProvider.h
```#pragma once
#include <vector>
class CloseIndexes;
class CloseIndexesProvider {
public:
~CloseIndexesProvider();
static CloseIndexes* get(unsigned short resolution);
private:
CloseIndexesProvider() = default;
static std::vector<CloseIndexes*> closeIndexeses;
};
```
StateManager.cpp
```#include "StateManager.h"
#include <Urho3D\IO\Log.h>
#include "AttackState.h"
#include "ChargeState.h"
#include "CollectState.h"
#include "DeadState.h"
#include "DefendState.h"
#include "DisposeState.h"
#include "FollowState.h"
#include "GoState.h"
#include "MoveState.h"
#include "ShotState.h"
#include "StopState.h"
#include "database/DatabaseCache.h"
#include "objects/building/Building.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/static/StaticStateUtils.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "utils/consts.h"
#include "utils/OtherUtils.h"
StateManager* StateManager::instance = nullptr;
StateManager::StateManager() {
states[cast(UnitState::STOP)] = new StopState();
states[cast(UnitState::MOVE)] = new MoveState();
states[cast(UnitState::GO)] = new GoState();
states[cast(UnitState::FOLLOW)] = new FollowState();
states[cast(UnitState::ATTACK)] = new AttackState();
states[cast(UnitState::SHOT)] = new ShotState();
states[cast(UnitState::CHARGE)] = new ChargeState();
states[cast(UnitState::DEFEND)] = new DefendState();
states[cast(UnitState::COLLECT)] = new CollectState();
states[cast(UnitState::DEAD)] = new DeadState();
states[cast(UnitState::DISPOSE)] = new DisposeState();
initStates(
{UnitState::GO, UnitState::MOVE, UnitState::FOLLOW, UnitState::STOP, UnitState::DEAD, UnitState::DISPOSE});
initOrders({UnitAction::GO, UnitAction::DEAD, UnitAction::STOP, UnitAction::FOLLOW});
}
StateManager::~StateManager() {
clear_array(states, magic_enum::enum_count<UnitState>());
}
bool StateManager::changeState(Unit* unit, UnitState stateTo) {
return changeState(unit, stateTo, Consts::EMPTY_ACTION_PARAMETER);
}
bool StateManager::toDefaultState(Unit* unit) {
return changeState(unit, UnitState::STOP, Consts::EMPTY_ACTION_PARAMETER); //TODO może lepiej move
}
bool StateManager::canStartState(Unit* unit, UnitState stateTo, const ActionParameter& actionParameter,
State* stateFrom, State* toState) {
return stateFrom->validateTransition(stateTo)
&& unit->getDbUnit()->possibleStates[cast(stateTo)]
&& toState->canStart(unit, actionParameter);
}
bool StateManager::changeState(Unit* unit, UnitState stateTo, const ActionParameter& actionParameter) {
State* stateFrom = instance->states[cast(unit->getNextState())];
State* toState = instance->states[cast(stateTo)];
if (canStartState(unit, stateTo, actionParameter, stateFrom, toState)) {
unit->setNextState(stateTo, actionParameter);
instance->unitHasChanged = true;
return true;
}
Game::getLog()->Write(0, "fail to change state from " +
Urho3D::String(magic_enum::enum_name(unit->getNextState()).data()) + " to " +
Urho3D::String(magic_enum::enum_name(stateTo).data()));
return false;
}
bool StateManager::canChangeState(Unit* unit, UnitState stateTo) {
return getState(unit)->validateTransition(stateTo);
}
State* StateManager::getState(Unit* unit) {
return instance->states[cast(unit->getState())];
}
void StateManager::execute(Unit* unit, float timeStamp) {
getState(unit)->execute(unit, timeStamp);
}
void StateManager::executeChange(std::vector<Unit*>* units) {
if (instance->unitHasChanged) {
instance->unitHasChanged = false;
for (const auto unit : *units) {
if (unit->hasStateChangePending()) {
const auto nextState = unit->getNextState();
State* stateFrom = instance->states[cast(unit->getState())];
State* toState = instance->states[cast(nextState)];
//assert(canStartState(unit, unit->getNextState(), unit->getNextActionParameter(), stateFrom, toState));
if (canStartState(unit, nextState, unit->getNextActionParameter(), stateFrom, toState)) {
stateFrom->onEnd(unit);
unit->setState(nextState);
toState->onStart(unit, unit->getNextActionParameter());
unit->getNextActionParameter().resetUsed();
} else {
const bool mayHaveAim = nextState == UnitState::GO || nextState == UnitState::CHARGE || nextState ==
UnitState::FOLLOW;
unit->getNextActionParameter().reset(mayHaveAim);
}
unit->resetStateChangePending();
}
}
}
}
bool StateManager::changeState(Static* obj, StaticState stateTo) {
if (obj->getState() != StaticState::DISPOSE && obj->getState() != stateTo) {
obj->setNextState(stateTo);
if (obj->getType() == ObjectType::BUILDING) {
instance->buildingHasChanged = true;
} else {
instance->resourceHasChanged = true;
}
return true;
}
return false;
}
void StateManager::executeChange(std::vector<Building*>* buildings) {
if (instance->buildingHasChanged) {
instance->buildingHasChanged = false;
for (auto building : *buildings) {
executeChange(building);
}
}
}
void StateManager::executeChange(std::vector<ResourceEntity*>* resources) {
if (instance->resourceHasChanged) {
instance->resourceHasChanged = false;
for (auto resource : *resources) {
executeChange(resource);
}
}
}
void StateManager::executeChange(Static* obj) {
if (obj->getState() != obj->getNextState()) {
endState(obj->getState(), obj);
startState(obj->getNextState(), obj);
}
}
void StateManager::init() {
if (instance == nullptr) {
instance = new StateManager();
}
}
void StateManager::dispose() {
delete instance;
instance = nullptr;
}
void StateManager::initOrders(std::initializer_list<UnitAction> states) const {
std::vector<char> ids;
for (const auto state : states) {
ids.push_back(cast(state));
}
for (auto unit : Game::getDatabase()->getUnits()) {
if (unit) {
unit->ordersIds.insert(unit->ordersIds.begin(), ids.begin(), ids.end());
if (unit->typeWorker) {
unit->ordersIds.push_back(cast(UnitAction::COLLECT));
} else {
unit->ordersIds.push_back(cast(UnitAction::DEFEND));
}
if (unit->typeCalvary) {
unit->ordersIds.push_back(cast(UnitAction::CHARGE));
}
if (unit->typeMelee || unit->typeRange || unit->typeCalvary) {
unit->ordersIds.push_back(cast(UnitAction::ATTACK));
}
unit->ordersIds.shrink_to_fit();
std::ranges::sort(unit->ordersIds);
}
}
}
void StateManager::initStates(std::initializer_list<UnitState> states) const {
constexpr char SIZE = magic_enum::enum_count<UnitState>();
bool possibleStates[SIZE];
std::fill_n(possibleStates, SIZE, false);
for (auto state : states) {
possibleStates[cast(state)] = true;
}
for (const auto unit : Game::getDatabase()->getUnits()) {
if (unit) {
std::copy_n(possibleStates, SIZE, unit->possibleStates);
if (unit->typeWorker) {
unit->possibleStates[cast(UnitState::COLLECT)] = true;
} else {
unit->possibleStates[cast(UnitState::DEFEND)] = true;
}
if (unit->typeCalvary) {
unit->possibleStates[cast(UnitState::CHARGE)] = true;
}
if (unit->typeRange) {
unit->possibleStates[cast(UnitState::SHOT)] = true;
}
if (unit->typeMelee || unit->typeRange || unit->typeCalvary) {
unit->possibleStates[cast(UnitState::ATTACK)] = true;
}
}
}
}
void StateManager::setBuildingToDispose(bool value) {
instance->buildingIsToDispose = value;
}
void StateManager::setResourceToDispose(bool value) {
instance->resourceIsToDispose = value;
}
bool StateManager::isBuildingToDispose() {
return instance->buildingIsToDispose;
}
bool StateManager::isResourceToDispose() {
return instance->resourceIsToDispose;
}
```
InGameMenuPanel.cpp
```#include "InGameMenuPanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/UI.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
#include "middle/FilePanel.h"
#include "utils/DeleteUtils.h"
InGameMenuPanel::InGameMenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style)
: EventPanel(root, _style, "InGameMenuWindow",
{GameState::RUNNING, GameState::PAUSE}) {}
InGameMenuPanel::~InGameMenuPanel() {
toggleButton->Remove();
clear_array(additionalPanels, IN_GAME_MENU_BUTTON_NUMBER);
}
void InGameMenuPanel::setVisible(bool enable) {
if (enable) {
SimplePanel::setVisible(menuVisibility);
} else {
SimplePanel::setVisible(enable);
}
toggleButton->SetVisible(enable);
}
Urho3D::Button* InGameMenuPanel::getSaveButton() const {
return additionalPanels[0]->getMainButton();
}
void InGameMenuPanel::toggle() {
menuVisibility = !menuVisibility;
setVisible(true);
}
void InGameMenuPanel::action(short id) {
close();
additionalPanels[id]->setVisible(true);
}
void InGameMenuPanel::close() const {
for (auto addionalPanel : additionalPanels) {
addionalPanel->setVisible(false);
}
}
void InGameMenuPanel::createBody() {
auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>("textures/hud/icon/igm/menu.png");
toggleButton = createElement<Urho3D::Button>(Game::getUI()->GetRoot(), style, "InGameToggledButton");
createSprite(toggleButton, texture, style, "InGameToggledSprite");
SubscribeToEvent(toggleButton, Urho3D::E_CLICK, URHO3D_HANDLER(InGameMenuPanel, HandleToggle));
for (int i = 0; i < IN_GAME_MENU_BUTTON_NUMBER; ++i) {
auto texture2 = Game::getCache()->GetResource<Urho3D::Texture2D
>("textures/hud/icon/igm/igm_" + Urho3D::String(i) + ".png");
auto button = createElement<Urho3D::Button>(window, style, "InGameButton");
createSprite(button, texture2, style, "InGameSprite");
addChildText(button, "InGameText", Game::getLocalization()->Get("igm_" + Urho3D::String(i)), style);
button->SetVar("Num", i);
SubscribeToEvent(button, Urho3D::E_CLICK, URHO3D_HANDLER(InGameMenuPanel, HandleButtonClick));
}
auto l10n = Game::getLocalization();
additionalPanels[0] = new FilePanel(root, style, l10n->Get("igm_0"));
additionalPanels[1] = new FilePanel(root, style, l10n->Get("igm_1"));
additionalPanels[2] = new AbstractMiddlePanel(root, style, l10n->Get("igm_2"));
additionalPanels[3] = new AbstractMiddlePanel(root, style, l10n->Get("igm_3"));
additionalPanels[4] = new AbstractMiddlePanel(root, style, l10n->Get("igm_4"));
for (auto addionalPanel : additionalPanels) {
addionalPanel->createWindow();
}
}
void InGameMenuPanel::HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
action(element->GetVar("HudElement").GetInt());
}
void InGameMenuPanel::HandleToggle(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
toggle();
}
```
UnitFactory.h
```#pragma once
#include <vector>
namespace Urho3D {
class Vector2;
}
struct dbload_unit;
class Unit;
class UnitFactory {
public:
UnitFactory();
~UnitFactory();
std::vector<Unit*>& create(unsigned int number, int id, Urho3D::Vector2& center, int player, int level);
std::vector<Unit*>& load(dbload_unit* unit);
private:
std::vector<Unit*> units;
};
```
HitData.h
```#pragma once
#include <Urho3D/Graphics/OctreeQuery.h>
#include "objects/Physical.h"
class Physical;
struct hit_data {
hit_data() = default;
hit_data(const hit_data&) = delete;
Urho3D::Drawable* drawable = nullptr;
Physical* clicked = nullptr;
Urho3D::Vector3 position;
bool isGround = false;
void set(const Urho3D::RayQueryResult& result, Physical* lc) {
position = result.position_;
drawable = result.drawable_;
clicked = lc;
}
void set(const Urho3D::RayQueryResult& result, bool isGround) {
position = result.position_;
drawable = result.drawable_;
this->isGround = isGround;
}
ObjectType getType() const {
if (isGround || clicked == nullptr) {
return ObjectType::NONE;
}
return clicked->getType();
}
bool isSth() const {
return isGround || clicked;
}
void reset() {
drawable = nullptr;
clicked = nullptr;
}
};
```
ScorePanel.h
```#pragma once
#include <vector>
#include "hud/window/SimplePanel.h"
namespace Urho3D {
class Text;
}
class Player;
class ScorePanel : public SimplePanel {
public:
explicit ScorePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~ScorePanel() = default;
void update(const std::vector<Player*>& players) const;
private:
void createBody() override;
Urho3D::Text* text;
};
```
MainMenuHelpPanel.h
```#pragma once
#include "hud/window/main_menu/MainMenuDetailsPanel.h"
namespace Urho3D {
class Text;
class ScrollView;
class ListView;
}
constexpr char HELP_ITEMS = 5;
class MainMenuHelpPanel : public MainMenuDetailsPanel {
public:
MainMenuHelpPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuHelpPanel() = default;
void action(short id) const;
void HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
private:
void createBody() override;
Urho3D::ListView* list;
Urho3D::ScrollView* content;
Urho3D::Text* contentText;
};
```
InfluenceMapQuad.cpp
```#include "InfluenceMapQuad.h"
#include <array>
#include <Urho3D/Resource/Image.h>
#include "Game.h"
#include "colors/ColorPaletteRepo.h"
#include "math/MathUtils.h"
#include "math/SpanUtils.h"
#include "objects/Physical.h"
#include "env/GridCalculator.h"
#include "env/GridCalculatorProvider.h"
InfluenceMapQuad::InfluenceMapQuad(unsigned short topResolution, float mapSize)
: calculator(GridCalculatorProvider::get(topResolution, mapSize)) {
dataSize = 0;
auto currentRes = topResolution;
while (currentRes % 2 == 0 && currentRes != 1) {
dataSize += currentRes * currentRes;
currentRes /= 2;
}
currentRes *= 2;
data = new float[dataSize];
float* ptr = data;
for (int i = currentRes; i <= topResolution; i *= 2) {
const auto arraySize = i * i;
maps.emplace_back(ptr, arraySize);
ptr += arraySize;
}
}
InfluenceMapQuad::~InfluenceMapQuad() {
delete[] data;
}
void InfluenceMapQuad::ensureReady() {
if (dataReady == false) {
std::fill_n(data, dataSize - maps.back().size(), 0.f);
auto sum = sumSpan(maps.back());
if (sum != 0.f) {
unsigned short parentRes = calculator->getResolution();
unsigned short currentRes = parentRes / 2;
for (int i = maps.size() - 2; i >= 0; --i, parentRes /= 2, currentRes /= 2) {
auto parent = maps[i + 1];
const auto current = maps[i];
int j = 0;
for (float parent1 : parent) {
if (parent1 > 0.f) {
const int newIndex = getCordsInLower(currentRes, parentRes, j);
assert(newIndex<currentRes*currentRes);
current[newIndex] += parent1;
}
++j;
}
}
}
dataReady = true;
}
}
std::optional<Urho3D::Vector2> InfluenceMapQuad::getCenter() {
ensureReady(); //TODO performce remember center
bool hasData = std::ranges::any_of(maps[0], [](float v) { return v > 0.f; });
if (hasData) {
int index = std::distance(maps[0].begin(), std::ranges::max_element(maps[0]));
unsigned short res = sqrt(maps[0].size());
for (int i = 1; i < maps.size(); ++i) {
std::array<int, 4> indexes = getCordsInHigher(res, index);
index = getMaxElement(indexes, maps[i]);
res *= 2;
}
return calculator->getCenter(index);
}
return {};
}
int InfluenceMapQuad::getMaxElement(const std::array<int, 4>& indexes, std::span<float> values) const {
float values1[4] = {values[indexes[0]], values[indexes[1]], values[indexes[2]], values[indexes[3]]};
int i = std::distance(values1, std::max_element(values1, values1 + 4));
return indexes[i];
}
unsigned short InfluenceMapQuad::getResolution() const {
return calculator->getResolution();
}
void InfluenceMapQuad::update(int index, float value) {
dataReady = false;
maps.back()[index] += value;
}
void InfluenceMapQuad::updateInt(Physical* thing, int value) {
updateInt(calculator->indexFromPosition(thing->getPosition()), value);
}
void InfluenceMapQuad::updateInt(int index, int value) {
dataReady = false;
maps.back()[index] += value;
}
void InfluenceMapQuad::reset() {
//dataReady = false;
std::fill_n(maps.back().begin(), maps.back().size(), 0.f);
}
void InfluenceMapQuad::print(const Urho3D::String& name, std::span<float> map) {
auto [minIdx, maxIdx] = std::minmax_element(map.begin(), map.end());
const auto min = *minIdx;
const auto max = *maxIdx;
const float diff = max - min;
if (diff == 0.f) {
return;
}
auto image = new Urho3D::Image(Game::getContext());
const int resolution = sqrt(map.size());
image->SetSize(resolution, resolution, 4);
for (short y = 0; y != resolution; ++y) {
for (short x = 0; x != resolution; ++x) {
const int index = x * resolution + y;
const auto color = Game::getColorPaletteRepo()->getColor((map[index] - min) / diff, 1.f);
image->SetPixel(x, resolution - y - 1, color);
}
}
image->Resize(256, 256);
image->SavePNG("result/images/infl/" + name + "_" + Urho3D::String(resolution) + "x" + Urho3D::String(resolution)
+ "#" + Urho3D::String(counter) + ".png");
++counter;
delete image;
}
void InfluenceMapQuad::print(const Urho3D::String name) {
ensureReady();
for (const auto map : maps) {
print(name, map);
}
}
```
ColorPaletteRepo.h
```#pragma once
#include <Urho3D/Graphics/Terrain.h>
#include <Urho3D/Math/Color.h>
struct db_building;
enum class VisibilityType : char;
enum class CellState : char;
enum class ColorPallet : char;
namespace Urho3D {
class Material;
}
constexpr char PALLET_RESOLUTION = 32;
constexpr char SPECTRUM_RESOLUTION = 64;
class ColorPaletteRepo {
public:
ColorPaletteRepo();
~ColorPaletteRepo() = default;
Urho3D::Color& getColor(float value, float maxValue);
Urho3D::Material* getLineMaterial() const;
Urho3D::Material* getInfluenceMaterial() const;
std::tuple<bool, Urho3D::Color> getInfoForGrid(CellState state) const;
Urho3D::Color getCircleColor(db_building* dbBuilding) const;
Urho3D::Color getColorForValidation(const db_building* building, Urho3D::Vector2& hitPos) const;
private:
Urho3D::Material* lineMaterial;
Urho3D::Material* influenceMaterial;
Urho3D::Color basicSpectrum[SPECTRUM_RESOLUTION + 1];
};
```
BrainProvider.cpp
```#include "BrainProvider.h"
#include <Urho3D/IO/Log.h>
#include "Brain.h"
#include "Game.h"
#include "utils/DeleteUtils.h"
#include "utils/FileUtils.h"
std::vector<Brain*> BrainProvider::brains;
std::vector<std::string> BrainProvider::tempLines;
BrainProvider::~BrainProvider() {
clear_vector(brains);
}
Brain* BrainProvider::get(const std::string name) {
for (const auto brain : brains) {
if (brain->getName() == name) {
return brain;
}
}
loadLines(name, tempLines);
assert(!tempLines.empty());
if (tempLines.empty()) {
Game::getLog()->WriteRaw("No brain Found " + Urho3D::String(name.c_str()) + "\n", true);
return nullptr;
}
auto* const brain = new Brain(name, tempLines);
brains.push_back(brain);
return brain;
}
```
CommandList.cpp
```#include "CommandList.h"
#include "AbstractCommand.h"
#include "utils/DeleteUtils.h"
CommandList::~CommandList() {
clear_vector(commands);
}
void CommandList::add(AbstractCommand* command) {
commands.push_back(command);
}
void CommandList::add(AbstractCommand* first, AbstractCommand* second) {
add(first);
add(second);
}
void CommandList::execute() {
for (auto& command : commands) {
command->clean();
if (!command->expired()) {
setParameters(command);
command->execute();
}
delete command;
}
commands.clear();
}
void CommandList::setParameters(AbstractCommand* command) {
}
```
InfluenceMap.cpp
```#include "InfluenceMap.h"
#include <Urho3D/Resource/Image.h>
#include "Game.h"
#include "debug/DebugLineRepo.h"
#include "env/Environment.h"
#include "colors/ColorPaletteRepo.h"
#include "env/GridCalculatorProvider.h"
InfluenceMap::InfluenceMap(unsigned short resolution, float size, float valueThresholdDebug):
arraySize(resolution * resolution), valueThresholdDebug(valueThresholdDebug),
calculator(GridCalculatorProvider::get(resolution, size)) {}
void InfluenceMap::draw(short batch, short maxParts) {
auto size = arraySize / maxParts;
ensureReady();
for (int i = batch * size; i < arraySize && i < (batch + 1) * size; ++i) {
drawCell(i, batch);
}
}
Urho3D::Vector3 InfluenceMap::getVertex(const Urho3D::Vector2 center, Urho3D::Vector2 vertex) const {
auto result = Game::getEnvironment()->getPosWithHeightAt(center.x_ + vertex.x_, center.y_ + vertex.y_);
result.y_ += 1.f;
return result;
}
void InfluenceMap::drawCell(int index, short batch) const {
const auto center = calculator->getCenter(index);
const auto v = calculator->getFieldSize() / 2.3f;
const auto a = getVertex(center, Urho3D::Vector2(-v, v));
const auto b = getVertex(center, Urho3D::Vector2(v, -v));
const auto c = getVertex(center, Urho3D::Vector2(v, v));
const auto d = getVertex(center, Urho3D::Vector2(-v, -v));
const auto color = Game::getColorPaletteRepo()->getColor(getValueAt(index), valueThresholdDebug);
DebugLineRepo::drawTriangle(DebugLineType::INFLUENCE, a, c, b, color, batch);
DebugLineRepo::drawTriangle(DebugLineType::INFLUENCE, b, d, a, color, batch);
}
Urho3D::Vector2 InfluenceMap::getCenter(int index) const {
return calculator->getCenter(index);
}
float InfluenceMap::getFieldSize() const {
return calculator->getFieldSize();
}
void InfluenceMap::print(Urho3D::String name) {
auto image = new Urho3D::Image(Game::getContext());
const auto resolution = getResolution();
image->SetSize(resolution, resolution, 4);
ensureReady();
computeMinMax();
for (short y = 0; y != resolution; ++y) {
for (short x = 0; x != resolution; ++x) {
const int index = calculator->getNotSafeIndex(x, y);
const auto color = Game::getColorPaletteRepo()->getColor(getValueAsPercent(index), 1.f);
image->SetPixel(x, resolution - y - 1, color);
}
}
image->Resize(256, 256);
image->SavePNG("result/images/infl/" + name + "_" + Urho3D::String(resolution) + "x" + Urho3D::String(resolution)
+ "#" + Urho3D::String(counter) + ".png");
++counter;
delete image;
}
```
UpgradeCommandList.h
```#pragma once
#include "commands/CommandList.h"
class SimulationObjectManager;
class UpgradeCommandList : public CommandList {
public:
explicit UpgradeCommandList(SimulationObjectManager* simulationObjectManager);
~UpgradeCommandList() = default;
protected:
void setParameters(AbstractCommand* command) override;
private:
SimulationObjectManager* simulationObjectManager;
};
```
MainMenuDetailsPanel.h
```#pragma once
#include "hud/window/EventPanel.h"
namespace Urho3D
{
class UIElement;
}
class MainMenuDetailsPanel : public EventPanel {
public:
MainMenuDetailsPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuDetailsPanel() = default;
protected:
Urho3D::UIElement* body;
void createBody() override;
private:
Urho3D::String msg;
};
```
Layer.h
```#pragma once
#include <span>
#include <vector>
#include <Eigen/Core>
class Layer {
public:
Layer(std::vector<float>& w, std::vector<float>& bias);
Layer(const Layer& rhs) = delete;
~Layer();
void setValues(std::span<float> data) const;
void setValues(Eigen::MatrixXf& mult) const;
std::span<float> getValues() const { return valuesSpan; }
short getNumberOfValues() const { return valuesSpan.size(); }
short getPrevSize() const { return prevSize; }
float* getW() const { return w; }
short getWSize() const { return valuesSpan.size() * prevSize; }
float getBias(int i) const { return bias[i]; }
void setValueAt(int i, float newValue) const { values[i] = newValue; }
private:
std::span<float> valuesSpan;
short prevSize;
float* values;//TODO performance replate with eigen Vector
float* bias;
float* w;
};
```
DebugManager.h
```#pragma once
#include <magic_enum.hpp>
#include "debug/EnvironmentDebugMode.h"
#include "objects/unit/SimColorMode.h"
namespace Urho3D {
class Input;
}
class Simulation;
constexpr char MAX_ENV_INDEX = 32;
class DebugManager {
public:
void change(Urho3D::Input* input, Simulation* simulation);
void draw() const;
private:
SimColorMode simColorMode = SimColorMode::BASIC;
EnvironmentDebugMode environmentDebugMode = EnvironmentDebugMode::NONE;
char environmentIndex = 0;
EnvironmentDebugMode nextEnvMode[magic_enum::enum_count<EnvironmentDebugMode>()] = {
EnvironmentDebugMode::MAIN_GRID, EnvironmentDebugMode::INF_UNITS_NUMBER_PER_PLAYER,
EnvironmentDebugMode::INF_UNITS_INFLUENCE_PER_PLAYER, EnvironmentDebugMode::INF_BUILDING_INFLUENCE_PER_PLAYER,
EnvironmentDebugMode::INF_RESOURCE, EnvironmentDebugMode::INF_FOOD_SPEED, EnvironmentDebugMode::INF_WOOD_SPEED,
EnvironmentDebugMode::INF_STONE_SPEED, EnvironmentDebugMode::INF_GOLD_SPEED,
EnvironmentDebugMode::INF_ATTACK_SPEED, EnvironmentDebugMode::VISIBILITY, EnvironmentDebugMode::NONE
};
SimColorMode nextColorMode[magic_enum::enum_count<SimColorMode>()] = {
SimColorMode::VELOCITY, SimColorMode::STATE, SimColorMode::FORMATION, SimColorMode::BASIC
};
};
```
FrameInfo.h
```#pragma once
struct FrameInfo {
void setIsRealFrame(bool realFrame) { this->realFrame = realFrame; }
void setCurrentFrame(unsigned char currentFrame) {
this->currentFrame = currentFrame;
this->realFrame = true;
}
void setSeconds(unsigned int seconds) {
this->seconds = seconds;
}
char getCurrentFrame() const { return currentFrame; }
bool isRealFrame() const { return realFrame; }
unsigned int getSeconds() const { return seconds; }
private:
bool realFrame;
unsigned char currentFrame;
unsigned int seconds;
};
```
UnitActionCommand.h
```#pragma once
#include "commands/AbstractCommand.h"
namespace Urho3D {
class Vector2;
}
class UnitOrder;
class Physical;
enum class UnitAction : char;
class UnitActionCommand : public AbstractCommand {
friend class Stats;
public:
UnitActionCommand(UnitOrder* order, char player);
~UnitActionCommand() override = default;
void execute() override;
protected:
UnitOrder* order;
};
```
TopHudElement.cpp
```#include "TopHudElement.h"
#include "../../UiUtils.h"
#include <Urho3D/UI/ToolTip.h>
TopHudElement::TopHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style, Urho3D::Texture2D* texture,
Urho3D::String styleName) {
button = createElement<Urho3D::Button>(parent, style, styleName);
icon = createSprite(button, texture, style, "SpriteLeft");
const auto mock = createElement<Urho3D::UIElement>(button, style, "mockCenter");
value = addChildText(mock, "TopText", style);
value1 = addChildText(mock, "TopTextSmall", style);
button->SetVar("TopHudElement", this);
}
void TopHudElement::hide() const {
button->SetVisible(false);
}
void TopHudElement::show() const {
button->SetVisible(true);
}
void TopHudElement::setText(const Urho3D::String& msg, const Urho3D::String& msg1) const {
value->SetText(msg);
value1->SetText(msg1);
}
```
SimplePanel.h
```#pragma once
#include <magic_enum.hpp>
#include <Urho3D/Container/Str.h>
#include "GameState.h"
#include "initializer_list"
namespace Urho3D
{
class UIElement;
class Window;
class XMLFile;
}
class SimplePanel {
public:
SimplePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, Urho3D::String styleName,
std::initializer_list<GameState> active);
virtual ~SimplePanel();
void createWindow();
void updateStateVisibility(GameState state);
virtual void setVisible(bool enable);
protected:
Urho3D::XMLFile* style;
Urho3D::Window* window;
Urho3D::UIElement* root;
Urho3D::String styleName, bodyStyle;
bool visibleAt[magic_enum::enum_count<GameState>()];
private:
virtual void createBody() =0;
};
```
Hud.h
```#pragma once
#include <Urho3D/Core/Object.h>
#include "window/in_game_menu/InGameMenuPanel.h"
#include "window/main_menu/MainMenuPanel.h"
#include "window/menu/MenuPanel.h"
#include "window/selected/SelectedHudPanel.h"
class SimInfo;
namespace Urho3D {
class Engine;
class XMLFile;
class Button;
}
class SimplePanel;
class Benchmark;
class ScorePanel;
class SelectedHudPanel;
class SelectedInfo;
class CameraManager;
class ObjectsInfo;
class MiniMapPanel;
class TopPanel;
class HudData;
class DebugPanel;
class QueuePanel;
class LoadingPanel;
struct db_graph_settings;
struct db_resolution;
class Hud : public Urho3D::Object {
public:
URHO3D_OBJECT(Hud, Object)
Hud();
~Hud();
void clear();
void update(Benchmark& benchmark, CameraManager* cameraManager, SelectedInfo* selectedInfo,
SimInfo* simInfo) const;
void createMiniMap() const;
void updateSelected(SelectedInfo* selectedInfo, SimInfo* simInfo) const;
void hoverOnIcon(HudData* hudElement) const { menuPanel->setHoverInfo(hudElement); }
void hoverOffIcon() const { menuPanel->removeHoverInfo(); }
void HandleUIButtonHoverOn(Urho3D::StringHash, Urho3D::VariantMap& eventData);
void HandleUIButtonHoverOff(Urho3D::StringHash, Urho3D::VariantMap& eventData);
void resetLoading() const;
void updateLoading(float progress) const;
void updateStateVisibilty(GameState state);
void createMyPanels();
void prepareStyle();
void prepareUrho(Urho3D::Engine* engine) const;
void subscribeToUIEvents();
std::vector<Urho3D::Button*> getButtonsSelectedToSubscribe() const {
return selectedHudPanel->getButtonsSelectedToSubscribe();
}
std::vector<HudData*>& getButtonsLeftMenuToSubscribe() const { return menuPanel->getButtons(); }
Urho3D::Button* getSaveButton() const { return inGameMenuPanel->getSaveButton(); }
Urho3D::Button* getNewGameProceed() const { return mainMenuPanel->getNewGameProceed(); }
Urho3D::Button* getLoadButton() const { return mainMenuPanel->getLoadButton(); }
Urho3D::Button* getCloseButton() const { return mainMenuPanel->getCloseButton(); }
Urho3D::UIElement* getRoot() const { return root; }
private:
void replaceVariables(std::string& xml, int hudSizeId) const;
void createConsole(Urho3D::Engine* engine) const;
void createCursor() const;
SelectedHudPanel* selectedHudPanel{};
DebugPanel* debugPanel{};
TopPanel* topPanel{};
MiniMapPanel* miniMapPanel{};
MenuPanel* menuPanel{};
QueuePanel* queuePanel{};
LoadingPanel* loadingPanel{};
InGameMenuPanel* inGameMenuPanel{};
MainMenuPanel* mainMenuPanel{};
ScorePanel* scorePanel{};
std::array<SimplePanel*, 10> panels;
db_graph_settings* graphSettings;
db_resolution* resolution;
Urho3D::XMLFile* style;
Urho3D::UIElement* root;
};
```
CommandList.h
```#pragma once
#include <vector>
class AbstractCommand;
class CommandList {
public:
CommandList() = default;
virtual ~CommandList();
void add(AbstractCommand* command);
void add(AbstractCommand* first, AbstractCommand* second);
void execute();
protected:
virtual void setParameters(AbstractCommand* command);
private:
std::vector<AbstractCommand*> commands;
};
```
InfluenceManager.h
```#pragma once
#include <span>
#include <array>
#include <optional>
#include <vector>
#include <Urho3D/Math/Vector3.h>
#include "player/ai/InfluenceDataType.h"
enum class ParentBuildingType : char;
class VisibilityManager;
class VisibilityMap;
enum class CenterType:char;
struct GridCalculator;
class InfluenceMapInt;
class Building;
class ResourceEntity;
class InfluenceMapFloat;
class InfluenceMapCombine;
class InfluenceMapQuad;
class InfluenceMapHistory;
namespace Urho3D {
class Terrain;
class String;
class Vector2;
}
enum class CellState : char;
class Unit;
struct content_info;
class InfluenceManager {
public:
explicit InfluenceManager(char numberOfPlayers, float mapSize, Urho3D::Terrain* terrain);
~InfluenceManager();
void update(std::vector<Unit*>* units) const;
void update(const std::vector<Building*>* buildings) const;
void update(const std::vector<ResourceEntity*>* resources) const;
void updateQuadUnits(const std::vector<Unit*>* units) const;
void updateWithHistory() const;
void updateNotInBonus(std::vector<Unit*>* units) const;
void updateQuadOther() const;
void updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units,
std::vector<ResourceEntity*>* resources) const;
void draw(InfluenceDataType type, char index);
void drawAll() const;
content_info* getContentInfo(const Urho3D::Vector2& center, CellState state, int additionalInfos, bool* checks,
int activePlayer);
std::array<float, 5>& getInfluenceDataAt(char player, const Urho3D::Vector2& pos);
std::vector<int> getIndexesIterative(const std::span<float> result, float tolerance, int min,
std::span<InfluenceMapFloat*> maps) const;
std::vector<Urho3D::Vector2> getAreasIterative(const std::span<float> result, char player, float tolerance,
int min);
float getFieldSize() const;
std::vector<int>* getAreas(const std::span<float> result, ParentBuildingType type, char player);
std::vector<int>* getAreasResBonus(char id, char player);
void addCollect(Unit* unit, char resId, float value);
void addAttack(char player, const Urho3D::Vector3& position, float value);
std::optional<Urho3D::Vector2> getCenterOf(CenterType id, char player);
bool isVisible(char player, const Urho3D::Vector2& pos) const;
Urho3D::Vector2 getCenter(int index) const;
float getVisibilityScore(char player) const;
int getIndex(const Urho3D::Vector3& position) const;
void nextVisibilityType() const;
private:
std::vector<int>* getAreas(std::span<InfluenceMapFloat*> maps, const std::span<float> result, char player) const;
std::vector<int>* bestIndexes(float* values, const std::vector<unsigned>& indexes, float minVal) const;
std::vector<Urho3D::Vector2> centersFromIndexes(const std::vector<int>& intersection) const;
//TODO imprve nie vectory tylko obiekt z mapami per player
std::vector<std::array<InfluenceMapFloat*, 3>> mapsForAiArmyPerPlayer;
std::vector<std::array<InfluenceMapFloat*, 8>> mapsForAiPerPlayer;
std::vector<std::array<InfluenceMapFloat*, 4>> mapsGatherSpeedPerPlayer;
std::vector<std::array<InfluenceMapInt*, 4>> mapsResNotInBonusPerPlayer;
std::vector<std::array<InfluenceMapQuad*, 3>> mapsForCentersPerPlayer;
std::vector<InfluenceMapInt*> unitsNumberPerPlayer;
std::vector<InfluenceMapFloat*> buildingsInfluencePerPlayer;
std::vector<InfluenceMapFloat*> unitsInfluencePerPlayer;
InfluenceMapFloat* resourceInfluence;
std::vector<InfluenceMapHistory*> foodGatherSpeed;
std::vector<InfluenceMapHistory*> woodGatherSpeed;
std::vector<InfluenceMapHistory*> stoneGatherSpeed;
std::vector<InfluenceMapHistory*> goldGatherSpeed;
std::vector<InfluenceMapInt*> foodNotInBonus;
std::vector<InfluenceMapInt*> woodNotInBonus;
std::vector<InfluenceMapInt*> stoneNotInBonus;
std::vector<InfluenceMapInt*> goldNotInBonus;
std::vector<InfluenceMapHistory*> attackSpeed;
std::vector<InfluenceMapQuad*> econQuad;
std::vector<InfluenceMapQuad*> buildingsQuad;
std::vector<InfluenceMapQuad*> armyQuad;
VisibilityManager* visibilityManager;
content_info* ci;
GridCalculator* calculator;
std::array<float, 5> dataFromPos;
short currentDebugBatch = 0;
InfluenceDataType debugType = InfluenceDataType::UNITS_INFLUENCE_PER_PLAYER;
unsigned int arraySize;
float* intersection; // [arraySize] ;
std::vector<int>* tempIndexes;
};
```
AbstractMiddlePanel.cpp
```#include "AbstractMiddlePanel.h"
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
AbstractMiddlePanel::
AbstractMiddlePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title):
EventPanel(root, _style, "AdditionalInGameWindow", {}) {
msg = _title;
}
AbstractMiddlePanel::~AbstractMiddlePanel() = default;
void AbstractMiddlePanel::createBody() {
buttonClose = createElement<Urho3D::Button>(window, style, "MyCloseButton");
SubscribeToEvent(buttonClose, Urho3D::E_CLICK, URHO3D_HANDLER(AbstractMiddlePanel, HandleClose));
title = addChildText(window, "MiddleTitle", msg, style);
body = createElement<Urho3D::UIElement>(window, style, "MiddleMock");
}
void AbstractMiddlePanel::HandleClose(Urho3D::StringHash /*eventType*/, Urho3D::VariantMap& eventData) {
setVisible(false);
}
Urho3D::Button* AbstractMiddlePanel::getMainButton() {
return nullptr;
}
```
LoadingPanel.h
```#pragma once
#include "hud/window/SimplePanel.h"
namespace Urho3D {
class BorderImage;
class ProgressBar;
}
class LoadingPanel : public SimplePanel {
public:
explicit LoadingPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~LoadingPanel() = default;
void show();
void update(float progres) const;
void end();
private:
void createBody() override;
Urho3D::ProgressBar* bar;
Urho3D::BorderImage* background;
};
```
GeneralActionCommand.cpp
```#include "GeneralActionCommand.h"
#include "Game.h"
#include "objects/queue/QueueActionType.h"
#include "GeneralActionType.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
GeneralActionCommand::GeneralActionCommand(short id, GeneralActionType action, char player)
: AbstractCommand(player), id(id), action(action) {
}
void GeneralActionCommand::clean() {
}
bool GeneralActionCommand::expired() {
return false;
}
void GeneralActionCommand::execute() {
if (action == GeneralActionType::BUILDING_LEVEL) {
auto playerEnt = Game::getPlayersMan()->getPlayer(player);
auto opt = playerEnt->getNextLevelForBuilding(id); //TODO ten id to powinien byc id levelu konkretnego
if (opt.has_value()) {
if (playerEnt->getResources().reduce(opt.value()->costs)) {
playerEnt->getQueue()->add(1, QueueActionType::BUILDING_LEVEL, id, 1);
}
}
}
}
```
FilePanel.cpp
```#include "FilePanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/LineEdit.h>
#include <Urho3D/UI/UIEvents.h>
#include "FileFormData.h"
#include "Game.h"
#include "hud/UiUtils.h"
FilePanel::FilePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): AbstractMiddlePanel(root, _style, _title) {
data = nullptr;
}
FilePanel::~FilePanel() {
delete data;
}
void FilePanel::createBody() {
AbstractMiddlePanel::createBody();
const auto name = Game::getLocalization()->Get("save");
lineEdit = createElement<Urho3D::LineEdit>(body, style, "FileNameLineEdit");
SubscribeToEvent(lineEdit, Urho3D::E_DEFOCUSED, URHO3D_HANDLER(FilePanel, HandleValueChange));
action = createElement<Urho3D::Button>(body, style, "FileConfirmButton");
data = new FileFormData();
action->SetVar("file_data", data);
addChildText(action, "MiddleText", name, style);
}
Urho3D::Button* FilePanel::getMainButton() {
return action;
}
void FilePanel::HandleValueChange(const Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
data->fileName = Urho3D::String(lineEdit->GetText());
}
```
SelectedHudPanel.h
```#pragma once
#include <vector>
#include "../SimplePanel.h"
namespace Urho3D {
class Button;
class UIElement;
class XMLFile;
}
class SelectedInfo;
class SelectedHudElement;
class SelectedHudPanel : public SimplePanel {
public:
explicit SelectedHudPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~SelectedHudPanel();
void update(SelectedInfo* selectedInfo);
std::vector<Urho3D::Button*> getButtonsSelectedToSubscribe() const;
void createRows();
void clearSelected();
private:
int iconSize() const;
void hide(int i);
void createBody() override;
char maxInRow;
const char linesNumber = 3;
char lastHidden;
SelectedHudElement** elements;
Urho3D::UIElement** rows;
};
```
ActionParameter.h
```#pragma once
class Aim;
class Physical;
struct ActionParameter {
ActionParameter() = default;
explicit ActionParameter(Aim* aim) : aim(aim) {
}
ActionParameter(Physical* thing)
: thingToInteract(thing) {
}
bool isThingAlive() const;
void reset(const ActionParameter& actionParameter, bool withDelete);
void reset(bool withDelete);
void resetUsed();
union {
Aim* aim = nullptr;
Physical* thingToInteract;
};
};
```
CameraBehave.cpp
```#include "CameraBehave.h"
#include "Game.h"
#include "math/MathUtils.h"
#include "env/Environment.h"
#include "utils/consts.h"
CameraBehave::CameraBehave(const Urho3D::Vector3& pos, float minY, Urho3D::String name):
name(std::move(name)), minY(minY) {
cameraNode = new Urho3D::Node(Game::getContext());
cameraNode->SetPosition(pos);
camera = cameraNode->CreateComponent<Urho3D::Camera>();
camera->SetFarClip(300.0f);
coefs[0] = 1;
coefs[1] = 1;
coefs[2] = 1;
coefs[3] = 1;
}
CameraBehave::~CameraBehave() {
cameraNode->Remove();
}
Urho3D::Camera* CameraBehave::getComponent() const {
return cameraNode->GetComponent<Urho3D::Camera>();
}
Urho3D::String CameraBehave::getInfo() const {
return name + " \t" + cameraNode->GetPosition().ToString() + "\n" + cameraNode->GetRotation().ToString();
}
const Urho3D::Vector3& CameraBehave::getPosition() const {
return cameraNode->GetPosition();
}
void CameraBehave::changeTargetInPercent(float percentX, float percentY) const {
const auto pos = Game::getEnvironment()->getPosFromPercent(percentX, percentY);
changeTarget(pos.x_, pos.y_);
}
void CameraBehave::changeTarget(float x, float z) const {
const auto currentTarget = getTargetPos();
const auto diff = Urho3D::Vector2(x, z) - currentTarget;
const auto currentPos = cameraNode->GetPosition();
const auto newPos = Urho3D::Vector2(currentPos.x_ + diff.x_, currentPos.z_ + diff.y_);
float h = Game::getEnvironment()->getGroundHeightAt(newPos.x_, newPos.y_);
auto y = Urho3D::Max(h + minY, cameraNode->GetPosition().y_);
setPos(to3D(newPos, y));
}
void CameraBehave::setPos(const Urho3D::Vector3& newPos) const {
cameraNode->SetPosition(newPos);
}
Urho3D::Vector2 CameraBehave::getTargetPos() const {
return to2D(cameraNode->GetPosition());
}
void CameraBehave::translateCam(float timeStep, float diff, Urho3D::Vector3 dir) const {
cameraNode->Translate(diff * dir * timeStep, Urho3D::TS_WORLD);
}
bool CameraBehave::translateInternal(const bool* cameraKeys, float timeStep, float diff) {
bool hasMoved = false;
for (int i = 0; i < 4; ++i) {
if (cameraKeys[i]) {
translateCam(timeStep, coefs[i] * diff, Consts::DIRS[i]);
hasMoved = true;
}
}
return hasMoved;
}
```
GridCalculator.h
```#pragma once
#include <Urho3D/Math/Vector3.h>
#include <vector>
struct GridCalculator {
explicit GridCalculator(unsigned short resolution, float size)
: resolution(resolution), halfResolution(resolution / 2), sqResolution(resolution * resolution),
fieldSize(size / static_cast<float>(resolution)), halfSize(size * 0.5f),
invFieldSize(static_cast<float>(resolution) / size), sqFieldSize(fieldSize * fieldSize) {
}
GridCalculator(const GridCalculator&) = delete;
int getIndex(short posX, short posZ) const {
return getNotSafeIndex(getValid(posX), getValid(posZ));
}
int getNotSafeIndex(unsigned short posX, unsigned short posZ) const {
return posX * resolution + posZ;
}
short getNotSafeIndexClose(short posX, short posZ) const {
return posX * resolution + posZ;
}
unsigned short getIndex(float value) const {
return getValid((short)(value + halfSize) * invFieldSize);
}
int indexFromPosition(const Urho3D::Vector3& pos) const {
return getNotSafeIndex(getIndex(pos.x_), getIndex(pos.z_));
}
int indexFromPosition(const Urho3D::Vector2& pos) const {
return getNotSafeIndex(getIndex(pos.x_), getIndex(pos.y_));
}
int indexFromPosition(float x, float z) const {
return getNotSafeIndex(getIndex(x), getIndex(z));
}
Urho3D::IntVector2 getIndexes(int i) const {
return {i / resolution, i % resolution};
//return { i >> shiftAmount, i & mask };
//Zamiast dzielenia przez "resolution" użyto zmiennej "shiftAmount", która jest równe log2(resolution), a zamiast modulo(operator %) użyto maski,
//która ma wartość "resolution - 1" i ma wypełnione jedynkami tylko najmniej znaczące bity.
}
Urho3D::IntVector2 getShiftCords(int i) const {
auto cord = getIndexes(i);
if (cord.y_ <= -halfResolution) {
if (cord.x_ > 0) {
++cord.x_;
} else {
--cord.x_;
}
cord.y_ = i - (cord.x_ * resolution);
return cord;
}
if (cord.y_ >= halfResolution) {
if (cord.x_ >= 0) {
++cord.x_;
} else {
--cord.x_;
}
cord.y_ = i - (cord.x_ * resolution);
return cord;
}
return cord;
}
Urho3D::Vector2 getCenter(int i) const {
const Urho3D::IntVector2 pos = getIndexes(i);
const float cX = (pos.x_ + 0.5f) * fieldSize - halfSize;
const float cZ = (pos.y_ + 0.5f) * fieldSize - halfSize;
return {cX, cZ};
}
bool isValidIndex(short x, short z) const {
return !(x < 0 || x >= resolution || z < 0 || z >= resolution);
}
bool isValidIndex(int index) const { return index >= 0 && index < sqResolution; }
float getFieldSize() const { return fieldSize; }
unsigned short getValidLow(short val) const {
return val >= 0 ? val : 0;
}
unsigned short getValidHigh(short val) const {
return val < resolution ? val : resolution - 1;
}
unsigned short getValid(short val) const {
if (val < 0) {
return 0;
}
return getValidHigh(val);
}
unsigned short getResolution() const { return resolution; }
float getDistance(const Urho3D::IntVector2& a, int next) const {
const auto b = getIndexes(next);
const auto dx = (a.x_ - b.x_);
const auto dy = (a.y_ - b.y_);
return sqrt((dx * dx + dy * dy) * sqFieldSize);
}
float getDistance(int first, int next) const {
return getDistance(getIndexes(first), next);
}
int getBiggestDiff(int first, int next) const {
auto a = getIndexes(first);
auto b = getIndexes(next);
const auto dx = (a.x_ - b.x_);
const auto dy = (a.y_ - b.y_);
return Urho3D::Max(Urho3D::Abs(dx), Urho3D::Abs(dy));
}
int getBiggestDiff(int first, const std::vector<int>& endIdxs) const {
auto a = getIndexes(first);
int max = 0;
for (const int idx : endIdxs) {
auto b = getIndexes(idx);
const auto dx = (a.x_ - b.x_);
const auto dy = (a.y_ - b.y_);
const auto val = Urho3D::Max(Urho3D::Abs(dx), Urho3D::Abs(dy));
if (val > max) {
max = val;
}
}
return max;
}
float getSize() const {
return fieldSize * resolution;
}
private:
unsigned short resolution;
unsigned short halfResolution;
unsigned int sqResolution;
float fieldSize;
float halfSize;
float invFieldSize;
float sqFieldSize;
};
```
DrawGridUtils.h
```#pragma once
#include <vector>
#include <Urho3D/Resource/Image.h>
inline int getIndex(const short posX, const short posZ, const short resolution) {
return posX * resolution + posZ;
}
inline Urho3D::IntVector2 getCords(const int index, const short resolution) {
return Urho3D::IntVector2(index / resolution, index % resolution);
}
void draw_grid_path(const std::vector<int>* path, Urho3D::Image* image, short resolution) {
auto data = (uint32_t*)image->GetData();
for (auto value : *path) {
Urho3D::IntVector2 a = getCords(value, resolution);
int idR = getIndex(resolution - a.y_ - 1, a.x_, resolution);
*(data + idR) -= 0x0000007F;
}
}
void draw_grid_from(int* cameFrom, Urho3D::Image* image, short resolution) {
auto data = (uint32_t*)image->GetData();
for (int y = 0; y != resolution; ++y) {
for (int x = 0; x != resolution; ++x) {
int id = getIndex(x, y, resolution);
if (cameFrom[id] != -1) {
Urho3D::IntVector2 cords2 = getCords(cameFrom[id], resolution);
int x2 = cords2.x_;
int y2 = cords2.y_;
int idR = getIndex(resolution - y - 1, x, resolution);
if (x2 == x + 1) {
*(data + idR) -= 0x00003F00;
} else if (x2 == x - 1) {
*(data + idR) -= 0x00007F00;
} else if (y2 == y + 1) {
*(data + idR) -= 0x0000BF00;
} else if (y2 == y - 1) {
*(data + idR) -= 0x0000FF00;
}
}
}
}
}
void draw_grid_cost(const float* costSoFar, Urho3D::Image* image, short resolution) {
const auto data = (uint32_t*)image->GetData();
for (short y = 0; y != resolution; ++y) {
for (short x = 0; x != resolution; ++x) {
int id = getIndex(x, y, resolution);
if (costSoFar[id] > 0.f) {
int idR = getIndex(resolution - y - 1, x, resolution);
*(data + idR) -= 0x0000007F;
}
}
}
}
```
Player.h
```#pragma once
#include "Resources.h"
#include "Possession.h"
#include "objects/queue/QueueManager.h"
#include "ai/ActionMaker.h"
#include "ai/OrderMaker.h"
#include "database/db_strcut.h"
struct db_nation;
enum class ActionType : char;
class Player {
friend class ActionMaker;
friend class OrderMaker;
public:
Player(int nationId, char team, char id, int color, Urho3D::String name, bool active);
~Player();
std::string getValues(int precision) const;
void setResourceAmount(int resource, float amount);
void setResourceAmount(float amount);
char upgradeLevel(QueueActionType type, int id) const;
Resources& getResources() { return resources; }
Possession& getPossession() { return possession; }
short getNation() const { return dbNation->id; }
char getTeam() const { return team; }
char getId() const { return id; } //TODO bug id playera a jego index to często nie to samo
int getColor() const { return color; }
Urho3D::String& getName() { return name; }
void updateResource() const;
void updatePossession(const ObjectsInfo* simInfo);
void add(Unit* unit);
void add(Building* building);
void aiAction();
void aiOrder();
int getScore();
int getWorkersNumber() const;
QueueElement* updateQueue() const;
QueueManager* getQueue() const;
db_unit_level* getLevelForUnit(short id) const;
db_building_level* getLevelForBuilding(short id) const;
std::optional<db_unit_level*> getNextLevelForUnit(short id) const;
std::optional<db_building_level*> getNextLevelForBuilding(short id) const;
void addKilled(Physical* physical);
void resetScore();
private:
db_nation* dbNation; //Must by first
QueueManager* queue;
Possession possession;
Resources resources;
ActionMaker actionMaker;
OrderMaker orderMaker;
Urho3D::String name;
int score = -1;
char team;
char id;
bool active;
int color;
char* unitLevels;
char* buildingLevels;
};
```
MoveState.h
```#pragma once
#include "State.h"
class MoveState : public State
{
public:
MoveState(): State({
UnitState::DEFEND, UnitState::DEAD, UnitState::GO, UnitState::FOLLOW, UnitState::ATTACK,
UnitState::COLLECT, UnitState::SHOT, UnitState::STOP,UnitState::CHARGE
}) {
}
~MoveState() override = default;
};
```
OrderMaker.cpp
```#include "OrderMaker.h"
#include "ActionCenter.h"
#include "AiUtils.h"
#include "Game.h"
#include "database/DatabaseCache.h"
#include "math/MathUtils.h"
#include "objects/PhysicalUtils.h"
#include "objects/unit/Unit.h"
#include "objects/unit/order/IndividualOrder.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "env/Environment.h"
#include "stats/AiInputProvider.h"
#include "nn/Brain.h"
#include "nn/BrainProvider.h"
#include "objects/unit/GroupUtils.h"
#include "objects/unit/order/GroupOrder.h"
#include "objects/unit/order/enums/UnitActionType.h"
#include "env/influence/CenterType.h"
#include "utils/OtherUtils.h"
constexpr float SEMI_CLOSE = 30.f;
constexpr float SQ_SEMI_CLOSE = SEMI_CLOSE * SEMI_CLOSE;
OrderMaker::OrderMaker(Player* player, db_nation* nation)
: player(player),
whichResource(BrainProvider::get(nation->orderPrefix[0] + "whichResource.csv")),
attackOrDefence(BrainProvider::get(nation->orderPrefix[1] + "attackOrDefence.csv")),
whereAttack(BrainProvider::get(nation->orderPrefix[2] + "whereAttack.csv")),
whereDefence(BrainProvider::get(nation->orderPrefix[3] + "whereDefence.csv")) {
}
void OrderMaker::action() {
auto freeWorkers = findFreeWorkers();
if (!freeWorkers.empty()) {
collect(freeWorkers);
}
if (player->getPossession().hasAnyFreeArmy()) {
const auto aiInput = Game::getAiInputProvider();
auto const resultAoD = attackOrDefence->decide(aiInput->getAttackOrDefenceInput(player->getId()));
std::span<float> whereGo;
char playerToGo = player->getId();
if (randFromTwo(resultAoD[0])) {
playerToGo = Game::getPlayersMan()->getEnemyFor(player->getId());
whereGo = whereAttack->decide(aiInput->getWhereAttack(player->getId()));
} else {
whereGo = whereDefence->decide(aiInput->getWhereDefend(player->getId()));
}
const CenterType centerType = static_cast<CenterType>(biggestWithRand(whereGo));
const auto posOpt = Game::getEnvironment()->getCenterOf(centerType, playerToGo);
if (posOpt.has_value()) {
std::vector<Unit*> army = player->getPossession().getFreeArmy();
auto center = posOpt.value();
for (auto& subArmy : divide(army)) {
if (!subArmy.empty()) {
auto centerLocal = computeLocalCenter(subArmy);
const auto dist = sqDist(centerLocal, center);
if (dist > SQ_SEMI_CLOSE) {
if (subArmy.size() > 1) {
Game::getActionCenter()->addUnitAction(
new GroupOrder(subArmy, UnitActionType::ORDER, cast(UnitAction::GO), center),
player->getId());
} else {
Game::getActionCenter()->addUnitAction(
new IndividualOrder(subArmy.at(0), UnitAction::GO, center), player->getId());
}
} else {
const auto unit = subArmy.at(0);
if (centerType == CenterType::BUILDING) {
const auto buildings = Game::getEnvironment()->getBuildingsFromTeamNotEq(
unit, -1, SEMI_CLOSE);
semiCloseAttack(subArmy, *buildings);
} else if (centerType == CenterType::ECON) {
const auto neights = Game::getEnvironment()->getNeighboursFromTeamNotEq(unit, SEMI_CLOSE);
//TODO perf wrzucić predykat do środka
std::vector<Physical*> workers;
workers.reserve(neights->size());
auto pred = [](const Physical* physical) {
return ((Unit*)physical)->getDbUnit()->typeWorker;
};
std::copy_if(neights->begin(), neights->end(), std::back_inserter(workers), pred);
semiCloseAttack(subArmy, workers);
} else {
//CenterType::UNITS
const auto neights = Game::getEnvironment()->getNeighboursFromTeamNotEq(unit, SEMI_CLOSE);
semiCloseAttack(subArmy, *neights);
}
}
}
}
}
}
}
void OrderMaker::semiCloseAttack(const std::vector<Unit*>& subArmy, const std::vector<Physical*>& things) const {
if (!things.empty()) {
const auto closest = Game::getEnvironment()->closestPhysical(subArmy.at(0), &things, belowClose, SQ_SEMI_CLOSE);
if (closest) {
Game::getActionCenter()->addUnitAction(
new GroupOrder(subArmy, UnitActionType::ORDER, cast(UnitAction::ATTACK), closest), player->getId());
}
}
}
std::vector<Unit*> OrderMaker::findFreeWorkers() const {
std::vector<Unit*> freeWorkers;
for (auto worker : player->getPossession().getWorkers()) {
if (isFreeWorker(worker)) {
freeWorkers.push_back(worker);
}
}
return freeWorkers;
}
Physical* OrderMaker::closetInRange(Unit* worker, int resourceId) {
float prevRadius = -1.f;
for (auto radius : {64.f, 128.f, 256.f}) {
// {64.f, 128.f, 256.f}
const auto list = Game::getEnvironment()->getResources(worker->getPosition(), resourceId, radius, prevRadius);
const auto closest = Game::getEnvironment()->closestPhysical(worker, list, belowClose, radius * radius);
if (closest) {
return closest;
}
prevRadius = radius;
}
return nullptr;
}
void OrderMaker::actCollect(unsigned char& resHistogram, char resId, std::vector<Unit*>& rest,
std::vector<Unit*>& workers) {
if (!workers.empty()) {
resHistogram -= workers.size();
const auto closest = closetInRange(workers.at(0), resId);
if (closest) {
if (workers.size() <= 1) {
Game::getActionCenter()
->addUnitAction(new IndividualOrder(workers.at(0), UnitAction::COLLECT, closest),
player->getId());
} else {
Game::getActionCenter()
->addUnitAction(
new GroupOrder(workers, UnitActionType::ORDER, cast(UnitAction::COLLECT), closest),
player->getId());
}
} else {
rest.insert(rest.end(), workers.begin(), workers.end());
}
workers.clear();
}
}
void OrderMaker::collect(std::vector<Unit*>& freeWorkers) {
const auto input = Game::getAiInputProvider()->getResourceInput(player->getId());
const auto result = whichResource->decide(input);
//TODO perf pogrupowac workerów a nie po jednym
unsigned char resHistogram[RESOURCES_SIZE];
std::fill_n(resHistogram, RESOURCES_SIZE, 0);
for (int i = 0; i < freeWorkers.size(); ++i) {
//TODO to powinno byc posortowane wedługo ilości?
const auto resourceId = biggestWithRand(result); //TODO perf tutaj tylko losowaca sortowanie wyciagnac wyżej
++resHistogram[resourceId];
}
char idx = 0;
std::vector<Unit*> rest;
for (auto& workersGroup : divide(freeWorkers)) {
//TODO close divide
std::vector<Unit*> workers;
for (int i = 0; i < workersGroup.size(); ++i) {
if (workers.size() < resHistogram[idx]) {
workers.push_back(workersGroup[i]);
} else {
actCollect(resHistogram[idx], idx, rest, workers);
--i;
++idx;
}
if (idx >= RESOURCES_SIZE) {
break;
}
}
actCollect(resHistogram[idx], idx, rest, workers);
}
}
```
SelectedHudElement.h
```#pragma once
#include <vector>
namespace Urho3D {
class Texture2D;
class String;
class Text;
class XMLFile;
class UIElement;
class ProgressBar;
class Button;
}
constexpr char MAX_SELECTED_IN_BUTTON = 5;
class MySprite;
class Physical;
class SelectedHudElement {
public:
explicit SelectedHudElement(Urho3D::UIElement* parent, Urho3D::XMLFile* style);
~SelectedHudElement() = default;
Urho3D::Button* getButton() const;
void hide() const;
void show() const;
void setText(const Urho3D::String& msg) const;
void hideText() const;
void setTexture(Urho3D::Texture2D* texture) const;
void add(const std::vector<Physical*>& physicals, int start, int end);
std::vector<Physical*>& getSelected();
private:
Urho3D::Button* button;
Urho3D::ProgressBar* bar;
Urho3D::Text* text;
MySprite* icon;
std::vector<Physical*> selected;
};
```
consts.h
```#pragma once
#include "objects/unit/ActionParameter.h"
struct Consts {
inline static Urho3D::Vector2 circleCords[8] =
{
{0.f, 1.f},
{0.71f, 0.71f},
{1, 0},
{-0.71f, -0.71f},
{0.f, -1.f},
{-0.71f, -0.71f},
{-1.f, 0.f},
{-0.71f, 0.71f}
};
inline constexpr static ActionParameter EMPTY_ACTION_PARAMETER = ActionParameter();
inline const static std::vector<Physical*> EMPTY_PHYSICAL;
inline const static Urho3D::Vector3 DIRS[4] = {
Urho3D::Vector3::FORWARD, Urho3D::Vector3::BACK, Urho3D::Vector3::LEFT, Urho3D::Vector3::RIGHT
};
};
```
Formation.h
```#pragma once
#include <optional>
#include <unordered_map>
#include <vector>
#include <Urho3D/Math/Vector2.h>
#include "FormationState.h"
#include "FormationType.h"
class FormationOrder;
class Unit;
class Formation {
public:
Formation(short _id, const std::vector<Unit*>& _units, FormationType _type, Urho3D::Vector2 _direction);
~Formation();
void update();
void remove();
Urho3D::Vector2 getPositionFor(short id) const;
float getPriority(int id) const;
FormationState getState() const { return state; }
std::optional<Unit*> getLeader();
void addOrder(FormationOrder* order);
size_t getSize() const;
void semiReset();
std::vector<Unit*>& getUnits() { return units; }
void stopAllBesideLeader();
bool isLeader(Unit* unit) const;
bool isMoving(Unit* unit) const;
int getCachePath(int startIdx, int aimIndex) const;
void addCachePath(int startIdx, int aimIndex, int next);
private:
bool hasLeader() const;
void chooseLeader(Urho3D::Vector2& localCenter);
void updateUnits();
void setCenter();
void updateIds();
void updateSideSize();
void calculateCohesion();
void innerUpdate();
void removePending();
void electLeader();
void setFormationClearPosition();
void setPosInFormationForLeader() const;
void changeState(FormationState newState);
short id;
short sideA;
short sideB;
FormationType type;
FormationState state;
char* levelOfReach;
float sparsity = 1;
bool changed = true;
Urho3D::Vector2 center;
Urho3D::Vector2 direction;
Unit* leader = nullptr;
Unit* oldLeader = nullptr;
std::vector<Unit*> units;
std::vector<FormationOrder*> unitOrders;
FormationOrder* pendingOrder{};
float notWellFormed = 1.f;
float notWellFormedExact = 1.f;
std::unordered_map<size_t, int> pathCache;
};
```
CreationCommandList.cpp
```#include "CreationCommandList.h"
#include "CreationCommand.h"
#include "Game.h"
#include "objects/ObjectEnums.h"
#include "database/DatabaseCache.h"
#include "player/PlayersManager.h"
#include "env/Environment.h"
#include "player/Player.h"
CreationCommandList::CreationCommandList(SimulationObjectManager* simulationObjectManager)
: simulationObjectManager(simulationObjectManager) {
}
CreationCommand* CreationCommandList::addUnits(int number, int id, Urho3D::Vector2& position, char player,
int level) const {
return new CreationCommand(ObjectType::UNIT, id, position, level, player, number);
}
CreationCommand* CreationCommandList::addBuilding(int id, Urho3D::Vector2& position, char player, int level) const {
Resources& resources = Game::getPlayersMan()->getPlayer(player)->getResources();
db_building* building = Game::getDatabase()->getBuilding(id);
if (resources.hasEnough(building->costs)) {
const auto env = Game::getEnvironment();
if (env->isVisible(player, position)) {
if (env->validateStatic(building->size, position, true)) {
resources.reduce(building->costs);
return new CreationCommand(ObjectType::BUILDING, id, env->getCords(position), level, player);
}
}
} else {
//TODO add resource presures
}
return nullptr;
}
CreationCommand* CreationCommandList::addResource(int id, Urho3D::Vector2& position, int level) const {
auto env = Game::getEnvironment();
db_resource* db_resource = Game::getDatabase()->getResource(id);
if (env->validateStatic(db_resource->size, position, false)) {
return new CreationCommand(ObjectType::RESOURCE, id, env->getCords(position), level, -1);
}
return nullptr;
}
CreationCommand*
CreationCommandList::addBuildingForce(int id, Urho3D::Vector2& position, char player, int level) const {
db_building* building = Game::getDatabase()->getBuilding(id);
const auto env = Game::getEnvironment();
if (env->validateStatic(building->size, position, true)) {
//resources.reduce(building->costs);
return new CreationCommand(ObjectType::BUILDING, id, env->getCords(position), level, player);
}
return nullptr;
}
void CreationCommandList::setParameters(AbstractCommand* command) {
dynamic_cast<CreationCommand*>(command)->setSimulationObjectManager(simulationObjectManager);
}
```
MainMenuNewGamePanel.cpp
```#include "MainMenuNewGamePanel.h"
#include "Game.h"
#include "NewGameForm.h"
#include "database/DatabaseCache.h"
#include "hud/HudData.h"
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/Button.h>
#include <Urho3D/UI/DropDownList.h>
#include "database/db_other_struct.h"
MainMenuNewGamePanel::
MainMenuNewGamePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): MainMenuDetailsPanel(root, _style, _title) {
bodyStyle = "MainMenuNewGameMock";
}
void MainMenuNewGamePanel::createBody() {
MainMenuDetailsPanel::createBody();
for (auto& row : rows) {
row = createElement<Urho3D::BorderImage>(body, style, "MainMenuNewGameRow");
}
auto l10n = Game::getLocalization();
myLine.init(style, l10n, 0);
enemyLine.init(style, l10n, 1);
populateLabels(l10n, 0, "player");
populateLabels(l10n, 1, "enemy");
populateLabels(l10n, 2, "map_name");
populateLabels(l10n, 3, "difficulty");
populateLabels(l10n, 4, "game_speed");
myLine.populateTeams(rows[0]);
enemyLine.populateTeams(rows[1]);
myLine.setCheck(true);
map = createElement<Urho3D::DropDownList>(rows[2], style, "MainMenuNewGameDropDownList");
for (auto dbMap : Game::getDatabase()->getMaps()) {
if (dbMap) {
addTextItem(map, dbMap->name, style);
}
}
difficulty = createElement<Urho3D::DropDownList>(rows[3], style, "MainMenuNewGameDropDownList");
addChildTexts(difficulty, {l10n->Get("easy"), l10n->Get("normal"), l10n->Get("hard")}, style);
gameSpeed = createElement<Urho3D::DropDownList>(rows[4], style, "MainMenuNewGameDropDownList");
addChildTexts(gameSpeed, {l10n->Get("slow"), l10n->Get("normal"), l10n->Get("fast")}, style);
proceed = createElement<Urho3D::Button>(body, style, "MainMenuNewGameButton");
data = new NewGameForm();
proceed->SetVar("NewGameForm", data);
SubscribeToEvent(proceed, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuNewGamePanel, HandleNewGame));
SubscribeToEvent(myLine.getCheckBox(), Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuNewGamePanel, HandleCheck));
SubscribeToEvent(enemyLine.getCheckBox(), Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuNewGamePanel, HandleCheck));
addChildText(proceed, "MainMenuNewGameButtonText", l10n->Get("start"), style);
}
Urho3D::Button* MainMenuNewGamePanel::getProceed() const {
return proceed;
}
void MainMenuNewGamePanel::HandleCheck(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
myLine.setCheck(false);
enemyLine.setCheck(false);
auto element = static_cast<Urho3D::CheckBox*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
element->SetChecked(true);
}
void MainMenuNewGamePanel::HandleNewGame(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
data->map = map->GetSelection();//TODO bug niezgodnosc indeksów w wyborze i id
data->difficulty = difficulty->GetSelection();
data->gameSpeed = gameSpeed->GetSelection();
data->players.push_back(myLine.getNewGamePlayer());
data->players.push_back(enemyLine.getNewGamePlayer());
}
void MainMenuNewGamePanel::populateLabels(Urho3D::Localization* l10n, int index, const Urho3D::String& name) {
addChildText(rows[index], "MainMenuNewGameButtonLabel", l10n->Get(name), style);
}
MainMenuNewGamePanel::~MainMenuNewGamePanel() {
delete data;
}
```
VisibilityMap.cpp
```#include "VisibilityMap.h"
#include "VisibilityType.h"
#include "math/MathUtils.h"
#include "math/SpanUtils.h"
#include "objects/Physical.h"
#include "env/GridCalculatorProvider.h"
#include "env/bucket/levels/LevelCache.h"
#include "env/bucket/levels/LevelCacheProvider.h"
#include "utils/OtherUtils.h"
VisibilityMap::VisibilityMap(unsigned short resolution, float size, float valueThresholdDebug)
: InfluenceMap(resolution, size, valueThresholdDebug),
levelCache(LevelCacheProvider::get(resolution, false, 60.f, calculator)) {
values = new VisibilityType[arraySize];
std::fill_n(values, arraySize, VisibilityType::NONE);
valuesForInfluence = new bool[arraySize / 4];
std::fill_n(valuesForInfluence, arraySize / 4, false);
}
VisibilityMap::~VisibilityMap() {
delete[] values;
delete[] valuesForInfluence;
}
void VisibilityMap::update(Physical* thing, float value) {
valuesForInfluenceReady = false;
percentReady = false;
const auto sRadius = thing->getSightRadius();
if (sRadius < 0) { return; }
const auto centerIdx = calculator->indexFromPosition(thing->getPosition());
for (auto level : *levelCache->get(sRadius)) {
const auto index = centerIdx + level; //TOdo to trzeba inaczej sprawdzic, bo to wychodzi poza plansze i tak
if (calculator->isValidIndex(index)) {
values[index] = VisibilityType::VISIBLE;
}
}
}
void VisibilityMap::updateInt(Physical* thing, int value) {
valuesForInfluenceReady = false;
percentReady = false;
update(thing);
}
void VisibilityMap::updateInt(int index, int value) const {
assert(false);
}
void VisibilityMap::reset() {
valuesForInfluenceReady = false;
percentReady = false;
minMaxInited = false;
char* end = (char*)values + arraySize;
for (char* i = (char*)values; i < end; i++) {
*i &= 1;
}
// auto func = [](VisibilityType vt) -> float { return vt == VisibilityType::VISIBLE; };
// std::replace_if(values, values + arraySize, func, VisibilityType::SEEN);
}
char VisibilityMap::getValueAt(const Urho3D::Vector2& pos) const {
return getValueAt(calculator->indexFromPosition(pos));
}
VisibilityType VisibilityMap::getValueAt(float x, float z) const {
char val = getValueAt(calculator->indexFromPosition(x, z));
return static_cast<VisibilityType>(val);
}
float VisibilityMap::getValueAsPercent(const Urho3D::Vector2& pos) const {
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(pos) - min) / diff;
}
return 0.5f;
}
float VisibilityMap::getValueAsPercent(const int index) const {
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(index) - min) / diff;
}
return 0.5f;
}
float VisibilityMap::getValueAt(int index) const {
assert(index < getResolution() * getResolution());
return cast(values[index]);
}
void VisibilityMap::computeMinMax() {
if (!minMaxInited) {
const auto [minPtr, maxPtr] = std::minmax_element(values, values + arraySize);
min = cast(*minPtr);
max = cast(*maxPtr);
minIdx = std::distance(values, minPtr);
maxIdx = std::distance(values, maxPtr);
minMaxInited = true;
}
}
int VisibilityMap::removeUnseen(float* intersection) {
ensureReady();
int notSeen = 0;
const auto end = valuesForInfluence + arraySize / 4;
for (auto ptrI = valuesForInfluence; ptrI < end; ++ptrI, ++intersection) {
if (!(*ptrI)) {
++notSeen;
*intersection = std::numeric_limits<float>::max();
}
}
return arraySize / 4 - notSeen;
}
float VisibilityMap::getPercent() {
if (!percentReady) {
const int sum = std::accumulate((char*)values, (char*)(values + arraySize), 0);
percent = sum / (arraySize * 3.f);
percentReady = true;
}
return percent;
}
void VisibilityMap::ensureReady() {
if (valuesForInfluenceReady == false) {
std::fill_n(valuesForInfluence, arraySize / 4, false);
const auto parent = values;
const int parentRes = sqrt(arraySize); //TODO bug a co z zaokragleniem
const auto current = valuesForInfluence;
const int currentRes = sqrt(arraySize / 4);
for (int j = 0; j < arraySize; ++j) {
if (parent[j] == VisibilityType::VISIBLE) {
const int newIndex = getCordsInLower(currentRes, parentRes, j);
assert(newIndex<currentRes*currentRes);
current[newIndex] = true;
}
}
valuesForInfluenceReady = true;
}
}
```
VisibilityMap.h
```#pragma once
#include "InfluenceMap.h"
enum class VisibilityType : char;
class LevelCache;
class VisibilityMap : public InfluenceMap {
public:
VisibilityMap(unsigned short resolution, float size, float valueThresholdDebug);
~VisibilityMap() override;
void update(Physical* thing, float value = 1.f) override;
void updateInt(Physical* thing, int value = 1) override;
void updateInt(int index, int value = 1) const;
void reset() override;
char getValueAt(const Urho3D::Vector2& pos) const;
VisibilityType getValueAt(float x, float z) const;
float getValueAsPercent(const Urho3D::Vector2& pos) const override;
float getValueAsPercent(const int index) const override;
float getValueAt(int index) const override;
void computeMinMax() override;
int removeUnseen(float* intersection);
float getPercent();
private:
void ensureReady();
VisibilityType* values;
bool* valuesForInfluence;
LevelCache* levelCache;
float percent = -1.f;
bool percentReady = false;
bool valuesForInfluenceReady = false;
};
```
ResourceActionCommand.h
```#pragma once
#include <vector>
#include "commands/AbstractCommand.h"
enum class ResourceActionType : char;
class ResourceEntity;
class Physical;
class ResourceActionCommand : public AbstractCommand {
friend class Stats;
public:
ResourceActionCommand(ResourceEntity* resource, ResourceActionType action, char player);
ResourceActionCommand(const std::vector<Physical*>& resources, ResourceActionType action, char player);
bool expired() override;
void clean() override;
void execute() override;
private:
ResourceActionType action;
std::vector<ResourceEntity*> resources;
};
```
DebugManager.cpp
```#include "debug/DebugManager.h"
#include <Urho3D/Input/Input.h>
#include <Urho3D/IO/Log.h>
#include "Game.h"
#include "simulation/Simulation.h"
#include "env/Environment.h"
#include "utils/OtherUtils.h"
#include "simulation/SimGlobals.h"
void DebugManager::change(Urho3D::Input* input, Simulation* simulation) {
if (input->GetKeyPress(Urho3D::KEY_F9)) {
simColorMode = nextColorMode[cast(simColorMode)];
simulation->changeColorMode(simColorMode);
Game::getLog()->Write(0, "Debug Mode Simulation change to "
+ Urho3D::String(magic_enum::enum_name(simColorMode).data()));
}
if (input->GetKeyPress(Urho3D::KEY_F10)) {
environmentDebugMode = nextEnvMode[cast(environmentDebugMode)];
Game::getLog()->Write(2, "Debug Mode Environment change to "
+ Urho3D::String(magic_enum::enum_name(environmentDebugMode).data()));
environmentIndex = 0;
} else if (input->GetKeyPress(Urho3D::KEY_F11)) {
environmentIndex++;
environmentIndex = environmentIndex % MAX_ENV_INDEX;
Game::getLog()->Write(2, "Debug Mode Environment index change to "
+ Urho3D::String((int)environmentIndex));
}
}
void DebugManager::draw() const {
if (!SIM_GLOBALS.HEADLESS) {
Game::getEnvironment()->drawDebug(environmentDebugMode, environmentIndex);
}
}
```
Brain.cpp
```#include "Brain.h"
#include <Eigen/Geometry>
#include "Game.h"
#include "Layer.h"
#include "math/SpanUtils.h"
#include "utils/DeleteUtils.h"
#include "utils/StringUtils.h"
Brain::Brain(const std::string& filename, std::vector<std::string>& lines): filename(filename) {
std::vector<float> w;
std::vector<float> b;
for (auto& line : lines) {
auto splitVec = split(line, ';');
auto p = std::ranges::find(splitVec, "");
std::vector<std::string>::iterator i;
for (i = splitVec.begin(); i != p; ++i) {
w.push_back(atof((*i).c_str()));
}
i += 2;
for (; i != splitVec.end(); ++i) {
b.push_back(atof((*i).c_str()));
}
allLayers.push_back(new Layer(w, b));
w.clear();
b.clear();
}
}
Brain::~Brain() {
clear_vector(allLayers);
}
const std::span<float> Brain::decide(std::span<float> data) {
assert(validateSpan(__LINE__, __FILE__, data));
allLayers.front()->setValues(data);
for (int i = 1; i < allLayers.size(); i++) {
Layer* layer = allLayers.at(i);
Layer* prevLayer = allLayers.at(i - 1);
const auto vals = prevLayer->getValues(); //TODO performance to eigen
const auto input = Eigen::Map<Eigen::VectorXf>(vals.data(), vals.size());
const auto weightedMatrix = Eigen::Map<Eigen::MatrixXf>(layer->getW(), layer->getPrevSize(),
layer->getNumberOfValues()).transpose();
Eigen::MatrixXf mult = weightedMatrix * input;
layer->setValues(mult);
}
auto result = allLayers.back()->getValues();
assert(validateSpan(__LINE__, __FILE__, result));
return result;
}
std::string Brain::getName() const {
return filename;
}
short Brain::getOutputSize() const {
return allLayers.back()->getValues().size();
}```
ChargeAim.h
```#pragma once
#include "Aim.h"
class ChargeAim : public Aim
{
public:
explicit ChargeAim(Urho3D::Vector2* _direction);
~ChargeAim() = default;
std::vector<Urho3D::Vector3> getDebugLines(Unit* unit) const override;
Urho3D::Vector2 getDirection(Unit* unit) override;
bool ifReach(Unit* unit) override;
bool expired() override;
private:
Urho3D::Vector2 direction;
float chargeEnergy = 20 * 10;
};
```
AiMetric.h
```#pragma once
#include <functional>
#include "player/Player.h"
#include "env/Environment.h"
#include "Game.h"
#include "env/influence/CenterType.h"
constexpr char UNITS_SUM_X = 100;
constexpr char BUILDINGS_SUM_X = 10;
struct AiMetric {
const float weight;
const float weightForSum;
AiMetric(float weight, float weightMultiplier) : weight(1 / weight),
weightForSum(1 / (weight * weightMultiplier)) {
}
};
struct AiUnitMetric : AiMetric {
const std::function<float(db_unit* unit, db_unit_level* level)> fn;
AiUnitMetric(const std::function<float(db_unit* unit, db_unit_level* level)>& fn, float weight,
float weightMultiplier = 1.f) : fn(fn), AiMetric(weight, weightMultiplier) {
}
};
struct AiBuildingMetric : AiMetric {
const std::function<float(db_building* building, db_building_level* level)> fn;
AiBuildingMetric(const std::function<float(db_building* building, db_building_level* level)>& fn, float weight,
int weightMultiplier = 1.f) : fn(fn), AiMetric(weight, weightMultiplier) {
}
};
struct AiResourceMetric : AiMetric {
const std::function<float(Resources& resources, Possession& possession)> fn;
AiResourceMetric(const std::function<float(const Resources& resources, const Possession& possession)>& fn,
float weight, float weightMultiplier = 1.f) : fn(fn), AiMetric(weight, weightMultiplier) {
}
};
struct AiPlayerMetric : AiMetric {
const std::function<float(Player* one, Player* two)> fn;
AiPlayerMetric(const std::function<float(Player* one, Player* two)>& fn,
float weight = 1.f, float weightMultiplier = 1.f) : fn(fn), AiMetric(weight, weightMultiplier) {
}
};
constexpr inline struct MetricDefinitions {
const std::vector<float>& getAiPlayerMetricNorm(Player* one, Player* two, std::span<AiPlayerMetric> metric) const {
output.clear();
for (auto const& v : metric) {
output.push_back(v.fn(one, two) * v.weight);
}
return output;
}
const std::vector<float>& getUnitNormForSum(db_unit* unit, db_unit_level* level) const {
outputSum.clear();
for (auto const& v : unitInputSpan) {
outputSum.push_back(v.fn(unit, level) * v.weightForSum);
}
return outputSum;
}
const std::vector<float>& getUnitNorm(db_unit* unit, db_unit_level* level) const {
output.clear();
for (auto const& v : unitInputSpan) {
output.push_back(v.fn(unit, level) * v.weight);
}
return output;
}
const void getBuildingNorm(std::vector<float>& result, std::span<AiBuildingMetric> span,
const std::function<float(const AiBuildingMetric&)>& getWeight,
db_building* building, db_building_level* level) const {
result.clear();
result.reserve(span.size());
for (auto const& v : span) {
result.push_back(v.fn(building, level) * getWeight(v));
}
}
const std::vector<float> getBuildingNorm(db_building* building, db_building_level* level) const {
std::vector<float> result;
getBuildingNorm(result, buildingInputSpan, [](const AiBuildingMetric& m) { return m.weight; }, building, level);
return result;
}
const std::vector<float> getBuildingNormForSum(db_building* building, db_building_level* level) const {
std::vector<float> result;
getBuildingNorm(result, buildingInputSpan, [](const AiBuildingMetric& m) { return m.weightForSum; }, building,
level);
return result;
}
// const std::vector<float> getResourceNorm(Resources& resources, Possession& possession) const {
// output.clear();
// for (auto const& v : resourceAllInputSpan) {
// output.push_back(v.fn(resources, possession) * v.weight);
// }
// return output;
// }
const std::vector<float> getResourceNorm(Resources& resources, Possession& possession,
std::span<unsigned char> idxs) const {
output.clear();
for (auto idx : idxs) {
auto& v = resourceAllInputSpan[idx];
output.push_back(v.fn(resources, possession) * v.weight);
}
return output;
}
const std::vector<float>& getBasicNorm(Player* one, Player* two) const {
basic.clear();
for (auto const& v : basicInputSpan) {
basic.push_back(v.fn(one, two) * v.weight);
}
return basic;
}
const std::vector<float>& getAttackOrDefenceNorm(Player* one, Player* two) const {
return getAiPlayerMetricNorm(one, two, attackOrDefenceInputSpan);
}
const std::vector<float>& getWhereAttackNorm(Player* one, Player* two) const {
return getAiPlayerMetricNorm(one, two, whereAttackInputSpan);
}
const std::vector<float>& getWhereDefendNorm(Player* one, Player* two) const {
return getAiPlayerMetricNorm(one, two, whereDefendInputSpan);
}
const std::span<unsigned char> getUnitTypesIdxs() const { return aiUnitTypesIdxsSpan; }
const std::span<unsigned char> getBuildingOtherIdxs() const { return aiBuildingOtherIdxsSpan; }
const std::span<unsigned char> getBuildingDefenceIdxs() const { return aiBuildingDefIdxsSpan; }
const std::span<unsigned char> getBuildingResourceIdxs() const { return aiBuildingResIdxsSpan; }
const std::span<unsigned char> getBuildingTechIdxs() const { return aiBuildingTechIdxsSpan; }
const std::span<unsigned char> getBuildingUnitsIdxs() const { return aiBuildingUnitsIdxsSpan; }
const std::span<unsigned char> getBuildingTypesIdxs() const { return aiBuildingTypesIdxsSpan; }
const std::span<unsigned char> getResWithoutBonusIdxs() const { return aiResWithoutBonusIdxsSpan; }
static inline AiUnitMetric aiUnitMetric[] = {
{[](db_unit* u, db_unit_level* l) -> float { return u->getSumCost(); }, 400, UNITS_SUM_X},
//TODO czy grupowe ma sens?
{[](db_unit* u, db_unit_level* l) -> float { return l->maxHp; }, 300, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->armor; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->sightRadius; }, 20, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->collect; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->attack; }, 10, UNITS_SUM_X}, //index 5
{[](db_unit* u, db_unit_level* l) -> float { return l->attackReload; }, 200, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->attackRange; }, 20, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeInfantry; }, 1, UNITS_SUM_X}, //8
{[](db_unit* u, db_unit_level* l) -> float { return u->typeRange; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeCalvary; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeWorker; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeSpecial; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeMelee; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeHeavy; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return u->typeLight; }, 1, UNITS_SUM_X}, //15
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusInfantry; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusRange; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusCalvary; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusWorker; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusSpecial; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusMelee; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusHeavy; }, 1, UNITS_SUM_X},
{[](db_unit* u, db_unit_level* l) -> float { return l->bonusLight; }, 1, UNITS_SUM_X},
};
static inline AiBuildingMetric aiBuildingMetric[] = {
{[](db_building* b, db_building_level* l) -> float { return b->getSumCost(); }, 400, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->maxHp; }, 500, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->armor; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->sightRadius; }, 50, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->collect; }, 2, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->attack; }, 20, BUILDINGS_SUM_X}, //5
{[](db_building* b, db_building_level* l) -> float { return l->attackReload; }, 200, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->attackRange; }, 20, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return l->resourceRange; }, 20, BUILDINGS_SUM_X},
//TODO stad duzo wyrzucić
{[](db_building* b, db_building_level* l) -> float { return b->typeCenter; }, 1, BUILDINGS_SUM_X}, //9
{[](db_building* b, db_building_level* l) -> float { return b->typeHome; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeDefence; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeResourceFood; }, 1, BUILDINGS_SUM_X}, //12
{[](db_building* b, db_building_level* l) -> float { return b->typeResourceWood; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeResourceStone; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeResourceGold; }, 1, BUILDINGS_SUM_X}, //15
{[](db_building* b, db_building_level* l) -> float { return b->typeTechBlacksmith; }, 1, BUILDINGS_SUM_X}, //16
{[](db_building* b, db_building_level* l) -> float { return b->typeTechUniversity; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeUnitBarracks; }, 1, BUILDINGS_SUM_X}, //18
{[](db_building* b, db_building_level* l) -> float { return b->typeUnitRange; }, 1, BUILDINGS_SUM_X},
{[](db_building* b, db_building_level* l) -> float { return b->typeUnitCavalry; }, 1, BUILDINGS_SUM_X},
};
static inline unsigned char aiUnitsTypesIdxs[] = {8, 9, 10, 11, 12, 12, 13, 14, 15};
static inline unsigned char aiBuildingOtherIdxs[] = {9, 10}; //TODO moze cos wiecej?
static inline unsigned char aiBuildingUnitsIdxs[] = {18, 19, 20}; //TODO moze cos wiecej?
static inline unsigned char aiBuildingTechIdxs[] = {16, 17}; //TODO moze cos wiecej?
static inline unsigned char aiBuildingResIdxs[] = {4, 8, 12, 13, 14, 15};
static inline unsigned char aiBuildingDefIdxs[] = {0, 1, 2, 3, 5, 6, 7};
static inline unsigned char aiBuildingTypesIdxs[] = {9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
static inline unsigned char aiResInputIdxs[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
static inline unsigned char aiResWithoutBonusIdxs[] = {10, 11, 12, 13};
//TODO moze to zwracac od razy przedziałem jakos
static inline AiResourceMetric aiResourceMetric[] = {
{[](const Resources& r, const Possession& p) -> float { return r.getGatherSpeeds()[0]; }, 10},
{[](const Resources& r, const Possession& p) -> float { return r.getGatherSpeeds()[1]; }, 10},
{[](const Resources& r, const Possession& p) -> float { return r.getGatherSpeeds()[2]; }, 10},
{[](const Resources& r, const Possession& p) -> float { return r.getGatherSpeeds()[3]; }, 10},
{[](const Resources& r, const Possession& p) -> float { return r.getValues()[0]; }, 1000},
{[](const Resources& r, const Possession& p) -> float { return r.getValues()[1]; }, 1000},
{[](const Resources& r, const Possession& p) -> float { return r.getValues()[2]; }, 1000},
{[](const Resources& r, const Possession& p) -> float { return r.getValues()[3]; }, 1000},
{[](const Resources& r, const Possession& p) -> float { return p.getFreeWorkersNumber(); }, 100},
{[](const Resources& r, const Possession& p) -> float { return p.getWorkersNumber(); }, 100},
{[](const Resources& r, const Possession& p) -> float { return p.getResWithOutBonus()[0]; }, 20}, //10
{[](const Resources& r, const Possession& p) -> float { return p.getResWithOutBonus()[1]; }, 20},
{[](const Resources& r, const Possession& p) -> float { return p.getResWithOutBonus()[2]; }, 20},
{[](const Resources& r, const Possession& p) -> float { return p.getResWithOutBonus()[3]; }, 20},
};
static inline AiPlayerMetric aiBasicMetric[] = {
{[](Player* one, Player* two) -> float { return one->getScore(); }, 1000},
{[](Player* one, Player* two) -> float { return one->getPossession().getUnitsNumber(); }, 200},
{[](Player* one, Player* two) -> float { return one->getPossession().getBuildingsNumber(); }, 50},
{[](Player* one, Player* two) -> float { return two->getScore(); }, 1000}
};
static inline AiPlayerMetric aiAttackOrDefence[] = {
{[](Player* p1, Player* p2) -> float { return p1->getPossession().getAttackSum(); }, 1000},
{[](Player* p1, Player* p2) -> float { return p1->getPossession().getDefenceAttackSum(); }, 100},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::BUILDING, p1->getId(), 0.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::BUILDING, p2->getId(), 1.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p2->getId(), CenterType::BUILDING, p1->getId(), 1.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p2->getId(), CenterType::BUILDING, p2->getId(), 0.f); }},
};
static inline AiPlayerMetric aiWhereAttack[] = {
{[](Player* p1, Player* p2) -> float { return p1->getPossession().getAttackSum(); }, 1000},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::ECON, p2->getId(), 1.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::BUILDING, p2->getId(), 1.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::ARMY, p2->getId(), 1.f); }},
};
static inline AiPlayerMetric aiWhereDefend[] = {
{[](Player* p1, Player* p2) -> float { return p1->getPossession().getAttackSum(); }, 1000},
{[](Player* p1, Player* p2) -> float { return p1->getPossession().getDefenceAttackSum(); }, 100},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::ECON, p1->getId(), 0.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::BUILDING, p1->getId(), 0.f); }},
{[](Player* p1, Player* p2) -> float { return Game::getEnvironment()->getDiffOfCenters(CenterType::ARMY, p1->getId(), CenterType::ARMY, p2->getId(), 1.f); }},
//TODO musi być do przeciwnika bo inaczej zawsze do siebie
};
constexpr static std::span<unsigned char> aiBuildingOtherIdxsSpan = std::span(aiBuildingOtherIdxs);
constexpr static std::span<unsigned char> aiBuildingUnitsIdxsSpan = std::span(aiBuildingUnitsIdxs);
constexpr static std::span<unsigned char> aiBuildingTechIdxsSpan = std::span(aiBuildingTechIdxs);
constexpr static std::span<unsigned char> aiBuildingResIdxsSpan = std::span(aiBuildingResIdxs);
constexpr static std::span<unsigned char> aiBuildingDefIdxsSpan = std::span(aiBuildingDefIdxs);
constexpr static std::span<unsigned char> aiBuildingTypesIdxsSpan = std::span(aiBuildingTypesIdxs);
constexpr static std::span<unsigned char> aiResWithoutBonusIdxsSpan = std::span(aiResWithoutBonusIdxs);
constexpr static std::span<unsigned char> aiResInputIdxsSpan = std::span(aiResInputIdxs);
constexpr static std::span<unsigned char> aiUnitTypesIdxsSpan = std::span(aiUnitsTypesIdxs);
constexpr static std::span<AiUnitMetric> unitInputSpan = std::span(aiUnitMetric);
constexpr static std::span<AiBuildingMetric> buildingInputSpan = std::span(aiBuildingMetric);
constexpr static std::span<AiResourceMetric> resourceAllInputSpan = std::span(aiResourceMetric);
constexpr static std::span<AiPlayerMetric> basicInputSpan = std::span(aiBasicMetric);
constexpr static std::span<AiPlayerMetric> attackOrDefenceInputSpan = std::span(aiAttackOrDefence);
constexpr static std::span<AiPlayerMetric> whereAttackInputSpan = std::span(aiWhereAttack);
constexpr static std::span<AiPlayerMetric> whereDefendInputSpan = std::span(aiWhereDefend);
private:
inline static std::vector<float> basic;
inline static std::vector<float> output; //TODO mem perf mozna zastapic czyms lzejszym
inline static std::vector<float> outputSum;
//inline static std::vector<float> outputSmall;
} METRIC_DEFINITIONS;
constexpr char BASIC_SIZE = std::size(METRIC_DEFINITIONS.aiBasicMetric);
constexpr char UNIT_SIZE = std::size(METRIC_DEFINITIONS.aiUnitMetric);
constexpr char BUILDING_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingMetric);
constexpr char UNIT_TYPES_SIZE = std::size(METRIC_DEFINITIONS.aiUnitsTypesIdxs);
constexpr char BUILDING_OTHER_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingOtherIdxs);
constexpr char BUILDING_DEF_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingDefIdxs);
constexpr char BUILDING_RES_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingResIdxs);
constexpr char BUILDING_TECH_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingTechIdxs);
constexpr char BUILDING_UNITS_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingUnitsIdxs);
constexpr char BUILDING_RES_BONUS_SIZE = std::size(METRIC_DEFINITIONS.aiResWithoutBonusIdxs);
constexpr char BUILDING_TYPES_SIZE = std::size(METRIC_DEFINITIONS.aiBuildingTypesIdxs);
constexpr char RESOURCE_AI_SIZE = std::size(METRIC_DEFINITIONS.aiResInputIdxsSpan);
constexpr char ATTACK_OR_DEFENCE_SIZE = std::size(METRIC_DEFINITIONS.aiAttackOrDefence);
constexpr char WHERE_ATTACK_SIZE = std::size(METRIC_DEFINITIONS.aiWhereAttack);
constexpr char WHERE_DEFEND_SIZE = std::size(METRIC_DEFINITIONS.aiWhereDefend);
```
SpanUtils.h
```#pragma once
#include <span>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <functional>
inline float minSpan(std::span<float> vec) {
return *std::ranges::min_element(vec);
}
template <typename T>
inline float sumSpan(std::span<T> vec) {
return std::accumulate(vec.begin(), vec.end(), 0.f);
}
inline float minAndSumSpan(std::span<float> vec) {
return sumSpan(vec) + minSpan(vec);
}
inline float minSpanSq(std::span<float> vec) {
const auto a = minSpan(vec);
return a * a;
}
template <typename T>
inline void printSpan(std::span<T> vec) {
for (auto val : vec) {
std::cerr << val << ";";
}
std::cerr << std::endl;
}
template <typename T>
inline void printSpan(std::span<T> vec, std::function<bool(T)> condition) {
for (auto val : vec) {
if (condition(val)) {
std::cerr << val << ";";
}
}
std::cerr << std::endl;
}
template <typename T>
inline void printSpan(std::span<T> vec, int cols) {
int i = 0;
for (auto val : vec) {
if (i % cols == 0) {
std::cerr << std::endl;
}
++i;
std::cerr << (int)val << ";";
}
std::cerr << std::endl;
}
inline bool validateSpan(int line, std::string file, std::span<const float> vec) {
bool valid = true;
for (const auto val : vec) {
if (isnan(val) || isinf(val)) {
valid = false;
}
}
if (!valid) {
std::cerr << line << " at " << file << std::endl;
printSpan(vec);
assert(false);
}
return valid;
}
inline bool allPositive(int line, std::string file, std::span<float> vec) {
bool valid = true;
for (const auto val : vec) {
if (val < 0.f) {
valid = false;
}
}
if (!valid) {
std::cerr << line << " at " << file << std::endl;
printSpan(vec);
assert(false);
}
return valid;
}
inline bool validateSpan(int line, std::string file, std::vector<float> vec) {
return validateSpan(line, file, std::span(vec.begin(), vec.size()));
}
inline float maxSpan(std::span<float> vec) {
return *std::ranges::max_element(vec);
}
inline float maxSpanRoot(std::span<float> vec) {
assert(validateSpan(__LINE__, __FILE__, vec));
return sqrt(maxSpan(vec) + 1);
}
inline void resetSpan(std::span<float> vec, float val = 0.f) {
std::fill_n(vec.begin(), vec.size(), val);
}
```
VectorUtils.h
```#pragma once
#include <iterator>
#include <numeric>
#include <vector>
#include <span>
#include "objects/Physical.h"
inline auto notAlive = [](Physical* physical) {
return physical == nullptr || !physical->isAlive();
};
template <typename T>
static void cleanDead(std::vector<T*>& vector, bool sthDead = true) {
if (sthDead) {
vector.erase(
std::remove_if(vector.begin(), vector.end(), notAlive),
vector.end());
}
}
template <typename T>
static void cleanDead(std::vector<T*>* vector, bool sthDead = true) {
if (sthDead) {
vector->erase(
std::remove_if(vector->begin(), vector->end(), notAlive),
vector->end());
}
}
template <typename T, class _Pr>
static std::vector<unsigned int> sort_indexes(std::span<T> v, _Pr pred, int size) {
std::vector<unsigned int> idx(v.size());
std::iota(idx.begin(), idx.end(), 0);
//stable_sort(idx.begin(), idx.end(), pred);
if (size != -1) {
std::partial_sort(idx.begin(), idx.begin() + size, idx.end(), pred);
idx.resize(size);
} else {
stable_sort(idx.begin(), idx.end(), pred);
}
return idx;
}
template <typename T>
static std::vector<unsigned int> sort_indexes(std::span<T> v, int size = -1) {
return sort_indexes(v, [&v](auto i1, auto i2) { return v[i1] < v[i2]; }, size);
}
template <typename T>
static std::vector<unsigned int> sort_indexes_desc(std::span<T> v, int size = -1) {
return sort_indexes(v, [&v](auto i1, auto i2) { return v[i1] > v[i2]; }, size);
}
static std::vector<unsigned char> intersection(std::vector<std::vector<unsigned char>*>& ids) {
std::vector<unsigned char> common; //TODO check if ids sorted sometimes?
if (ids.empty()) {
return common;
}
common = *ids[0];
for (int i = 1; i < ids.size(); ++i) {
std::vector<unsigned char> temp;
std::ranges::set_intersection(common, *ids[i],
std::back_inserter(temp));
common = temp; //TODO optimize, może nie kopiować
if (temp.empty()) {
break;
}
}
return common;
}
```
StaticGrid.h
```#pragma once
#include <vector>
#include "Grid.h"
class StaticGrid : public Grid {
public:
StaticGrid(short resolution, float size, std::vector<float> queryRadius);
StaticGrid(const StaticGrid& rhs) = delete;
~StaticGrid() override;
int update(Physical* physical, int currentIndex) const override;
void remove(Physical* physical) const;
void updateStatic(Static* staticObj, bool bulkAdd) const;
void ensureInited(int index, int centerIndex);
const std::vector<Physical*>& get(const Urho3D::Vector3& center, float radius);
private:
int getIndexForRadius(float radius) const;
std::vector<float> queryRadius;
std::vector<Bucket*> bucketsPerRadius;
std::vector<bool*> inited;
};
```
EnvConsts.h
```#pragma once
#include <magic_enum.hpp>
constexpr float BUCKET_GRID_FIELD_SIZE = 2.f;
constexpr float BUCKET_GRID_FIELD_SIZE_BUILD = 8.f;
constexpr float BUCKET_GRID_FIELD_SIZE_ENEMY = 16.f;
constexpr float BUCKET_GRID_FIELD_SIZE_RESOURCE = 16.f;
constexpr inline InfluenceDataType ENV_TO_INF_MAP[magic_enum::enum_count<EnvironmentDebugMode>()] = {
InfluenceDataType::NONE, InfluenceDataType::NONE, InfluenceDataType::UNITS_NUMBER_PER_PLAYER,
InfluenceDataType::UNITS_INFLUENCE_PER_PLAYER, InfluenceDataType::BUILDING_INFLUENCE_PER_PLAYER,
InfluenceDataType::RESOURCE_INFLUENCE, InfluenceDataType::FOOD_SPEED, InfluenceDataType::WOOD_SPEED,
InfluenceDataType::STONE_SPEED, InfluenceDataType::GOLD_SPEED, InfluenceDataType::ATTACK_SPEED,
//InfluenceDataType::ECON_QUAD, InfluenceDataType::BUILDINGS_QUAD, InfluenceDataType::UNITS_QUAD,
InfluenceDataType::VISIBILITY
};
```
LevelCacheProvider.h
```#pragma once
#include <vector>
struct GridCalculator;
class LevelCache;
class LevelCacheProvider {
public:
~LevelCacheProvider();
static LevelCache* get(unsigned short resolution, bool initCords, float maxDistance, GridCalculator* calculator);
private:
LevelCacheProvider() = default;
static std::vector<LevelCache*> caches;
};
```
VisibilityManager.cpp
```#include "VisibilityManager.h"
#include <Urho3D/Graphics/Material.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/Graphics/Texture2D.h>
#include <Urho3D/Resource/Image.h>
#include "Game.h"
#include "MapsUtils.h"
#include "colors/ColorPaletteRepo.h"
#include "map/VisibilityMap.h"
#include "objects/unit/Unit.h"
#include "math/MathUtils.h"
#include "player/PlayersManager.h"
#include "simulation/SimGlobals.h"
#include "env/Environment.h"
#include "env/GridCalculatorProvider.h"
#include "utils/OtherUtils.h"
#include "objects/resource/ResourceEntity.h"
VisibilityManager::VisibilityManager(char numberOfPlayers, float mapSize, Urho3D::Terrain* terrain) {
visibilityPerPlayer.reserve(numberOfPlayers);
const unsigned short resolution = mapSize / VISIBILITY_GRID_FIELD_SIZE;
for (int player = 0; player < numberOfPlayers; ++player) {
visibilityPerPlayer.emplace_back(new VisibilityMap(resolution, mapSize, 3));
}
calculator = GridCalculatorProvider::get(resolution, mapSize);
if (terrain && !SIM_GLOBALS.HEADLESS) {
const auto name = terrain->GetMaterial()->GetTexture(Urho3D::TextureUnit::TU_DIFFUSE)->GetName();
texture = Game::getCache()->GetResource<Urho3D::Texture2D>(name);
image = texture->GetImage();
dataCopy = new unsigned[texture->GetHeight() * texture->GetWidth()];
auto* data = (unsigned*)image.Get()->GetData();
std::copy_n(data, texture->GetHeight() * texture->GetWidth(), dataCopy);
}
}
VisibilityManager::~VisibilityManager() {
clear_vector(visibilityPerPlayer);
delete[] dataCopy;
}
void VisibilityManager::setToImage(unsigned* data, std::array<int, 4>& indexes, unsigned color, bool operatorA) {
for (const auto index : indexes) {
const auto prev = *(data + index);
if (operatorA) {
*(data + index) = color & (*(dataCopy + index));
} else {
*(data + index) = color | (*(dataCopy + index));
}
if (*(data + index) != prev) {
imageChanged = true;
}
}
}
void VisibilityManager::setToImage(unsigned* data, std::array<int, 4>& indexes, unsigned color) {
for (const auto index : indexes) {
if (*(data + index) != color) {
imageChanged = true;
*(data + index) = color;
}
}
}
void VisibilityManager::hideOrShow(VisibilityMap* current, Physical* physical) {
VisibilityType type = VisibilityType::NONE;
const auto pos = physical->getPosition();
if (visibilityMode == VisibilityMode::ALL) {
type = VisibilityType::VISIBLE;
} else if (visibilityMode == VisibilityMode::ALL_PLAYERS) {
char val = cast(type);
for (auto vis : visibilityPerPlayer) {
val |= cast(vis->getValueAt(pos.x_, pos.z_));
}
type = static_cast<VisibilityType>(val);
} else {
type = current->getValueAt(pos.x_,pos.z_);
}
physical->setVisibility(type);
}
void VisibilityManager::updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units,
std::vector<ResourceEntity*>* resources) {
MapsUtils::resetMaps(visibilityPerPlayer);
for (const auto unit : (*units)) {
visibilityPerPlayer[unit->getPlayer()]->update(unit);
}
for (const auto building : (*buildings)) {
visibilityPerPlayer[building->getPlayer()]->update(building);
}
const auto terrain = Game::getEnvironment()->getTerrain();
if (terrain && !SIM_GLOBALS.HEADLESS) {
imageChanged = false;
auto current = visibilityPerPlayer[Game::getPlayersMan()->getActivePlayerID()];
auto* data = (unsigned*)image.Get()->GetData();
for (int i = 0; i < current->getResolution() * current->getResolution(); ++i) {
auto parentIndexes = getCordsInHigher(calculator->getResolution(), i);
assert(parentIndexes[3] < texture->GetHeight()* texture->GetWidth());
if (visibilityMode == VisibilityMode::ALL) {
setToImage(data, parentIndexes, 0x00FFFFFF, true);
} else {
char combineTime = cast(VisibilityType::NONE);
if (visibilityMode == VisibilityMode::ALL_PLAYERS) {
for (auto vis : visibilityPerPlayer) {
const char currentValue = vis->getValueAt(i);
combineTime |= currentValue;
}
} else {
combineTime = current->getValueAt(i);
}
VisibilityType currentValue = static_cast<VisibilityType>(combineTime);
if (currentValue == VisibilityType::VISIBLE) {
setToImage(data, parentIndexes, 0x00FFFFFF, true);
} else if (currentValue == VisibilityType::SEEN) {
setToImage(data, parentIndexes, 0xFF000000, false);
} else {
setToImage(data, parentIndexes, 0xFF000000);
}
}
}
if (imageChanged) {
texture->SetData(image, true);
}
for (const auto resource : (*resources)) {
hideOrShow(current, resource);
}
for (const auto unit : (*units)) {
hideOrShow(current, unit);
}
for (const auto building : (*buildings)) {
hideOrShow(current, building);
}
}
}
void VisibilityManager::drawMaps(short currentDebugBatch, char index) const {
MapsUtils::drawMap(currentDebugBatch, index, visibilityPerPlayer);
}
bool VisibilityManager::isVisible(char player, const Urho3D::Vector2& pos) const {
return visibilityPerPlayer[player]->getValueAt(pos) == static_cast<char>(VisibilityType::VISIBLE);
}
float VisibilityManager::getVisibilityScore(char player) const {
return visibilityPerPlayer[player]->getPercent();
}
int VisibilityManager::removeUnseen(char player, float* intersection) const {
return visibilityPerPlayer[player]->removeUnseen(intersection);
}
void VisibilityManager::nextVisibilityType() {
visibilityMode = NEXT_VISIBILITY_MODES[cast(visibilityMode)];
}
```
Hud.cpp
```#include "Hud.h"
#include <exprtk/exprtk.hpp>
#include <Urho3D/Engine/Console.h>
#include <Urho3D/Engine/DebugHud.h>
#include <Urho3D/Engine/Engine.h>
#include <Urho3D/Graphics/Graphics.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/UI.h>
#include <Urho3D/UI/UIEvents.h>
#include "Benchmark.h"
#include "Game.h"
#include "HudData.h"
#include "UiUtils.h"
#include "camera/CameraManager.h"
#include "control/SelectedInfo.h"
#include "database/DatabaseCache.h"
#include "database/db_grah_structs.h"
#include "objects/ObjectEnums.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "simulation/PerFrameAction.h"
#include "simulation/SimInfo.h"
#include "utils/replace_utils.h"
#include "window/debug/DebugPanel.h"
#include "window/loading/LoadingPanel.h"
#include "window/minimap/MiniMapPanel.h"
#include "window/queue/QueuePanel.h"
#include "window/score/ScorePanel.h"
#include "window/top/TopPanel.h"
void Hud::replaceVariables(std::string& xml, int hudSizeId) const {
exprtk::symbol_table<float> symbol_table;
for (auto var : Game::getDatabase()->getHudVars()) {
if (var != nullptr && var->hud_size == hudSizeId) {
symbol_table.add_variable(var->name.CString(), var->value);
}
}
float resX = resolution->x;
float resY = resolution->y;
symbol_table.add_variable("resX", resX);
symbol_table.add_variable("resY", resY);
using expression_t = exprtk::expression<float>;
using parser_t = exprtk::parser<float>;
expression_t expression;
expression.register_symbol_table(symbol_table);
std::regex reg(R"(\{[^\}]*\})");
std::regex_iterator<std::string::iterator> iterator(xml.begin(), xml.end(), reg);
std::regex_iterator<std::string::iterator> rend;
std::vector<int> values;
parser_t parser;
while (iterator != rend) {
std::string expression_string = iterator->str().substr(1, iterator->str().length() - 2);
parser.compile(expression_string, expression);
values.push_back((int)expression.value());
++iterator;
}
xml = regex_replace(xml, reg, values);
}
void Hud::createCursor() const {
Urho3D::SharedPtr<Urho3D::Cursor> cursor(new Urho3D::Cursor(Game::getContext()));
cursor->SetStyleAuto(style);
Game::getUI()->SetCursor(cursor);
auto graphics = Game::getGraphics();
if (graphics) {
cursor->SetPosition(graphics->GetWidth() / 2, graphics->GetHeight() / 2);
}
}
void Hud::createMyPanels() {
panels = {
selectedHudPanel = new SelectedHudPanel(root, style),
debugPanel = new DebugPanel(root, style),
topPanel = new TopPanel(root, style),
menuPanel = new MenuPanel(root, style),
queuePanel = new QueuePanel(root, style),
loadingPanel = new LoadingPanel(root, style),
inGameMenuPanel = new InGameMenuPanel(root, style),
mainMenuPanel = new MainMenuPanel(root, style),
miniMapPanel = new MiniMapPanel(root, style),
scorePanel = new ScorePanel(root, style)
};
for (auto panel : panels) {
panel->createWindow();
panel->setVisible(false);
}
}
void Hud::prepareStyle() {
Urho3D::String body = "<elements>";
for (const auto& sett : graphSettings->styles) {
auto style2 = Game::getCache()->GetResource<Urho3D::XMLFile>("UI/" + sett);
body.Append(style2->ToString());
Game::getCache()->ReleaseResource<Urho3D::XMLFile>("UI/" + sett);
}
body.Append("</elements>");
std::string result_xml = body.CString();
replaceVariables(result_xml, graphSettings->hud_size);
style = new Urho3D::XMLFile(Game::getContext());
style->FromString(result_xml.c_str()); //TODO moze problem z pamiecia
Game::getUI()->GetRoot()->SetDefaultStyle(style);
}
void Hud::prepareUrho(Urho3D::Engine* engine) const {
createConsole(engine);
engine->CreateDebugHud()->SetDefaultStyle(style);
createCursor();
}
void Hud::subscribeToUIEvents() {
for (auto hudElement : getButtonsLeftMenuToSubscribe()) {
auto element = hudElement->getUIParent();
SubscribeToEvent(element, Urho3D::E_HOVERBEGIN, URHO3D_HANDLER(Hud, HandleUIButtonHoverOn));
SubscribeToEvent(element, Urho3D::E_HOVEREND, URHO3D_HANDLER(Hud, HandleUIButtonHoverOff));
}
}
Hud::Hud() : Object(Game::getContext()) {
if (!SIM_GLOBALS.HEADLESS) {
db_settings* settings = Game::getDatabase()->getSettings();
graphSettings = Game::getDatabase()->getGraphSettings()[settings->graph];
resolution = Game::getDatabase()->getResolution(settings->resolution);
prepareStyle();
root = createElement<Urho3D::UIElement>(Game::getUI()->GetRoot(), style, "rootMock");
}
std::ranges::fill(panels, nullptr);
}
void Hud::clear() {
clear_array(panels);
Game::getUI()->GetRoot()->RemoveAllChildren();
}
Hud::~Hud() {
clear();
if (Game::getUI()->GetCursor() != nullptr) {
Game::getUI()->GetCursor()->Remove();
}
}
void Hud::createConsole(Urho3D::Engine* engine) const {
auto console = engine->CreateConsole();
if (console) {
console->SetDefaultStyle(style);
console->GetBackground()->SetOpacity(0.8f);
}
}
void Hud::update(Benchmark& benchmark, CameraManager* cameraManager, SelectedInfo* selectedInfo,
SimInfo* simInfo) const {
updateSelected(selectedInfo, simInfo);
debugPanel->setText(simInfo->getFrameInfo()->getSeconds(),
benchmark.getAvgLowest(), benchmark.getAvgMiddle(), benchmark.getAvgHighest(),
cameraManager->getPosInfo());
if (PER_FRAME_ACTION.get(PerFrameAction::HUD_UPDATE, simInfo->getFrameInfo())) {
topPanel->update(Game::getPlayersMan()->getActivePlayer());
scorePanel->update(Game::getPlayersMan()->getAllPlayers());
}
miniMapPanel->update();
selectedInfo->hasBeenUpdatedDrawn();
}
void Hud::createMiniMap() const {
if (miniMapPanel) {
miniMapPanel->createEmpty(160);
}
}
void Hud::resetLoading() const {
if (loadingPanel) {
loadingPanel->show();
}
}
void Hud::updateLoading(float progress) const {
if (loadingPanel) {
loadingPanel->update(progress);
}
}
void Hud::updateStateVisibilty(GameState state) {
for (auto panel : panels) {
if (panel) {
panel->updateStateVisibility(state);
}
}
}
void Hud::updateSelected(SelectedInfo* selectedInfo, SimInfo* simInfo) const {
if (selectedInfo->isSthSelected() || selectedInfo->hasChanged()) {
if (selectedInfo->hasChanged()
|| PER_FRAME_ACTION.get(PerFrameAction::QUEUE_HUD, simInfo->getFrameInfo())) {
selectedHudPanel->update(selectedInfo);
menuPanel->updateSelected(selectedInfo);
switch (selectedInfo->getSelectedType()) {
case ObjectType::NONE:
menuPanel->refresh(LeftMenuMode::BUILDING, selectedInfo);
queuePanel->show(Game::getPlayersMan()->getActivePlayer()->getQueue());
break;
case ObjectType::UNIT:
menuPanel->refresh(LeftMenuMode::ORDER, selectedInfo);
queuePanel->setVisible(false);
break;
case ObjectType::BUILDING:
menuPanel->refresh(LeftMenuMode::UNIT, selectedInfo);
queuePanel->show(selectedInfo);
break;
case ObjectType::RESOURCE:
menuPanel->refresh(LeftMenuMode::RESOURCE, selectedInfo);
queuePanel->setVisible(false);
break;
}
}
if (selectedInfo->getSelectedType() == ObjectType::BUILDING) {
queuePanel->update(selectedInfo);
}
} else {
if (PER_FRAME_ACTION.get(PerFrameAction::QUEUE_HUD, simInfo->getFrameInfo())) {
queuePanel->show(Game::getPlayersMan()->getActivePlayer()->getQueue());
}
selectedHudPanel->clearSelected();
menuPanel->clearSelected();
}
}
void Hud::HandleUIButtonHoverOn(Urho3D::StringHash /*eventType*/, Urho3D::VariantMap& eventData) {
hoverOnIcon(HudData::getFromElement(eventData));
}
void Hud::HandleUIButtonHoverOff(Urho3D::StringHash /*eventType*/, Urho3D::VariantMap& eventData) {
hoverOffIcon();
}
```
Resources.cpp
```#include "Resources.h"
#include <numeric>
#include "database/DatabaseCache.h"
#include "math/SpanUtils.h"
Resources::Resources() {
init(0);
}
Resources::Resources(float valueForAll) {
init(valueForAll);
}
void Resources::init(float valueForAll) {
values = std::span(data, RESOURCES_SIZE);
gatherSpeeds = std::span(data + RESOURCES_SIZE, RESOURCES_SIZE);
sumGatherSpeed = std::span(data + 2 * RESOURCES_SIZE, RESOURCES_SIZE);
sumValues = std::span(data + 3 * RESOURCES_SIZE, RESOURCES_SIZE);
resetSpan(values, valueForAll);
resetSpan(gatherSpeeds);
resetSpan(sumGatherSpeed);
resetSpan(sumValues);
}
bool Resources::reduce(const db_cost* costs) {
if (hasEnough(costs)) {
for (int i = 0; i < costs->values.size(); ++i) {
values[i] -= costs->values[i];
}
return true;
}
return false;
}
bool Resources::hasEnough(const db_cost* costs) const {
for (int i = 0; i < costs->values.size(); ++i) {
if (values[i] < costs->values[i]) {
return false;
}
}
return true;
}
void Resources::add(int id, float value) {
values[id] += value;
sumGatherSpeed[id] += value;
sumValues[id] += value;
}
int Resources::getSum() const {
return sumSpan(values);
}
std::string Resources::getValues(int precision, int player) const {
std::string str;
for (int i = 0; i < RESOURCES_SIZE; ++i) {
str += "(" + std::to_string(player) + "," + std::to_string(i) + "," + std::to_string(
(int)(values[i] * precision)) + "),";
}
return str;
}
void Resources::setValue(int id, float amount) {
values[id] = amount;
}
void Resources::resetStats() const {
std::ranges::copy(sumGatherSpeed, gatherSpeeds.begin());
resetSpan(sumGatherSpeed);
}
```
TopCameraBehave.cpp
```#include "TopCameraBehave.h"
#include <Urho3D/Graphics/Camera.h>
#include <Urho3D/Scene/Node.h>
#include <Urho3D/Input/Input.h>
constexpr float TOP_CAM_MAX_Y = 200.f;
TopCameraBehave::TopCameraBehave(): CameraBehave(Urho3D::Vector3(0, 50, 0), 20, "TopCam") {
const auto diff = sqrt(50.0f - minY) + 1;
cameraNode->SetDirection(Urho3D::Vector3::DOWN * diff);
camera->SetOrthographic(true);
}
bool TopCameraBehave::translate(bool cameraKeys[], int wheel, float timeStep, float min) {
bool hasMoved = translateInternal(cameraKeys, timeStep, sqrt((orthoSize - minY) / 10.f) + 1.f);
if (wheel != 0) {
orthoSize -= wheel * (sqrt(orthoSize - minY) + 1) * 1.5f;
if (orthoSize < minY) {
orthoSize = minY;
} else if (orthoSize > TOP_CAM_MAX_Y) {
orthoSize = TOP_CAM_MAX_Y;
}
camera->SetOrthoSize(orthoSize);
hasMoved = true;
}
return hasMoved;
}
Urho3D::MouseMode TopCameraBehave::getMouseMode() {
return Urho3D::MM_RELATIVE;
}
```
Static.cpp
```#include "Static.h"
#include <magic_enum.hpp>
#include <string>
#include "Game.h"
#include "math/MathUtils.h"
#include "../unit/Unit.h"
#include "database/db_strcut.h"
#include "objects/NodeUtils.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
#include "utils/OtherUtils.h"
Static::Static(Urho3D::Vector3& _position, int indexInGrid, bool withNode) : Physical(_position, withNode),
state(StaticState::ALIVE),
nextState(StaticState::ALIVE) {
this->indexInMainGrid = indexInGrid;
}
Static::~Static() {
delete []data;
}
void Static::load(dbload_static* dbloadStatic) {
Physical::load(dbloadStatic);
this->state = StaticState(dbloadStatic->state);
this->nextState = StaticState(dbloadStatic->nextState);
}
void Static::setIndexInInfluence(int index) {
assert(index < std::numeric_limits<unsigned short>::max());
assert(index >= 0);
indexInInfluence = index;
}
bool Static::isInCloseRange(int index) const {
auto cells = getSurroundCells();
return std::ranges::find(cells, index) != cells.end();
}
Urho3D::Color Static::getColor(db_player_colors* col) const {
return col->buildingColor;
}
void Static::setVisibility(VisibilityType type) {
if (node && type != visibilityType) {
switch (type) {
case VisibilityType::NONE:
if (node->IsEnabled()) {
node->SetEnabled(false);
}
break;
case VisibilityType::SEEN:
if (!node->IsEnabled()) {
node->SetEnabled(true);
}
setShaderParam(this, "SemiHide", true);
break;
case VisibilityType::VISIBLE: {
if (!node->IsEnabled()) {
node->SetEnabled(true);
}
setShaderParam(this, "SemiHide", false);
}
break;
}
}
visibilityType = type;
}
void Static::populate() {
//assert(mainCell==indexInMainGrid);
std::vector<int> occupiedCells1;
auto gridSize = getGridSize();
const auto cordsCell = Game::getEnvironment()->getCords(indexInMainGrid);
const auto sizeX = calculateSize(gridSize.x_, cordsCell.x_);
const auto sizeZ = calculateSize(gridSize.y_, cordsCell.y_);
occupiedCells1.reserve(gridSize.x_ * gridSize.y_);
for (short i = sizeX.x_; i < sizeX.y_; ++i) {
for (short j = sizeZ.x_; j < sizeZ.y_; ++j) {
occupiedCells1.push_back(Game::getEnvironment()->getIndex(i, j));
}
}
std::vector<int> surroundCells1;
surroundCells1.reserve(occupiedCells1.size() * 8);
for (auto index : occupiedCells1) {
for (auto inIndex : Game::getEnvironment()->getCloseIndexs(index)) {
surroundCells1.emplace_back(index + inIndex);
}
}
std::ranges::sort(surroundCells1);
surroundCells1.erase(std::unique(surroundCells1.begin(), surroundCells1.end()), surroundCells1.end());
surroundCells1.erase(
std::ranges::remove_if(surroundCells1,
[&](auto x) {
return std::find(occupiedCells1.begin(), occupiedCells1.end(), x) != occupiedCells1.
end();
}).begin(),
surroundCells1.end());
occupiedCellsSize = occupiedCells1.size();
surroundCellsSize = surroundCells1.size();
delete[] data;
data = new int[occupiedCellsSize + surroundCellsSize];
auto occupiedCells = getOccupiedCells();
auto surroundCells = getSurroundCells();
std::ranges::copy(occupiedCells1, occupiedCells.begin());
std::ranges::copy(surroundCells1, surroundCells.begin());
}
int Static::belowCloseLimit() const {
const auto freeClose = Physical::belowCloseLimit();
if (freeClose <= 0) {
return 0;
}
return Urho3D::Min(freeClose, hasFreeSpace());
}
bool Static::hasAnyFreeSpace() const {
return std::ranges::any_of(getSurroundCells(), [this](int index) { return canUse(index); });
}
int Static::hasFreeSpace() const {
return std::ranges::count_if(getSurroundCells(), [this](int index) { return canUse(index); });
}
std::optional<std::tuple<Urho3D::Vector2, float>> Static::getPosToUseWithDist(Unit* user) {
float minDistance = 9999999;
Urho3D::Vector2 closest;
int closestIndex = -1;
for (auto index : getSurroundCells()) {
if (canUse(index)) {
const auto vec = Game::getEnvironment()->getCenter(index);
setClosest(minDistance, closest, closestIndex, index, vec, user->getPosition());
}
}
if (closestIndex >= 0) {
return {{closest, minDistance}};
}
return {};
}
std::vector<int> Static::getIndexesForUse(Unit* user) const {
std::vector<int> indexes;
if (belowCloseLimit() <= 0) { return indexes; }
indexes.reserve(surroundCellsSize);
for (auto index : getSurroundCells()) {
if (canUse(index)) {
indexes.push_back(index);
}
}
return indexes;
}
std::vector<int> Static::getIndexesForRangeUse(Unit* user) const {
std::vector<int> indexes;
if (belowRangeLimit() <= 0) { return indexes; }
const std::vector<int> allIndexes = Game::getEnvironment()->getIndexesInRange(
getPosition(), user->getLevel()->attackRange);
auto cells = getOccupiedCells();
for (auto index : allIndexes) {
if (canUse(index)
&& !isInCloseRange(index)
&& std::ranges::find(cells, index) == cells.end()) {
indexes.push_back(index);
}
}
return indexes;
}
std::string Static::getValues(int precision) {
const auto cordsCell = Game::getEnvironment()->getCords(indexInMainGrid);
return Physical::getValues(precision)
+ std::to_string(cordsCell.x_) + ","
+ std::to_string(cordsCell.y_) + ","
+ std::to_string(cast(state)) + ","
+ std::to_string(cast(nextState)) + ",";
}
```
ActionMakerLogger.h
```#pragma once
#include <iostream>
#include "database/db_strcut.h"
constexpr bool LOG_ACTIONS_MAKER = false;
using namespace magic_enum::ostream_operators;
inline void logThree(int ids[3], float vals[3], float max) {
if constexpr (LOG_ACTIONS_MAKER) {
for (int i = 0; i < 3; ++i) {
std::cout << ids[i] << "-" << (vals[i] / max * 100) << "%, ";
}
std::cout << std::endl;
}
}
inline void logResult(int id, const bool result) {
if constexpr (LOG_ACTIONS_MAKER) {
std::cout << " -> " << id;
if (result) {
std::cout << "(DONE)" << std::endl;
} else {
std::cout << std::endl;
}
}
}
inline void logBuilding(db_building* building) {
if constexpr (LOG_ACTIONS_MAKER) {
std::cout << building->name.CString();
}
}
inline void logBuildingLevel(db_building* const building, std::optional<db_building_level*> opt) {
if constexpr (LOG_ACTIONS_MAKER) {
std::cout << building->name.CString() << " " << opt.value()->name.CString();
}
}
inline void logUnit(db_unit* unit) {
if constexpr (LOG_ACTIONS_MAKER) {
std::cout << unit->name.CString();
}
}
inline void logUnitLevel(db_unit* unit, std::optional<db_unit_level*> opt) {
if constexpr (LOG_ACTIONS_MAKER) {
std::cout << unit->name.CString() << " " << opt.value()->name.CString();
}
}
```
Physical.cpp
```#include "objects/Physical.h"
#include <Urho3D/Graphics/Material.h>
#include <Urho3D/Graphics/Model.h>
#include <Urho3D/Graphics/StaticModel.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/Resource/XMLFile.h>
#include <Urho3D/Scene/Scene.h>
#include "Game.h"
#include "NodeUtils.h"
#include "database/DatabaseCache.h"
#include "database/db_other_struct.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "scene/load/dbload_container.h"
Physical::Physical(Urho3D::Vector3& _position, bool withNode):
position(_position) {
if (withNode) {
node = Game::getScene()->CreateChild();
node->SetVar("link", this);
node->SetPosition(position);
}
shouldUpdate = true;
}
Physical::~Physical() {
if (node) {
node->Remove();
node = nullptr;
}
clearSelection();
}
void Physical::clearNodeWithOutDelete() {
node = nullptr;
}
bool Physical::isAlive() const {
return true;
}
std::optional<Urho3D::Vector2> Physical::getPosToUseBy(Unit* follower) {
auto a = getPosToUseWithDist(follower);
if (a.has_value()) {
return std::get<0>(a.value());
}
return {};
}
float Physical::getHealthBarSize() const {
const auto healthBarSize = getMaxHpBarSize() * getHealthPercent();
return healthBarSize <= 0.f ? 0.f : healthBarSize;
}
bool Physical::isSelected() const {
return selected;
}
void Physical::load(dbload_physical* dbloadPhysical) {
hp = dbloadPhysical->hp;
}
char Physical::getLevelNum() {
return -1;
}
std::string Physical::getValues(int precision) {
int hp_coef = hp * precision;
return std::to_string(getId()) + ","
+ std::to_string(hp_coef) + ","
+ std::to_string(player) + ","
+ std::to_string(getLevelNum()) + ",";
}
int Physical::belowCloseLimit() const {
return Urho3D::Max(getMaxCloseUsers() - closeUsers, 0);
}
void Physical::select() {
assert(!selected);
selected = true;
setShaderParam(this, "OutlineEnable", true);
}
void Physical::clearSelection() {
selected = false;
}
void Physical::unSelect() {
setShaderParam(this, "OutlineEnable", false);
clearSelection();
}
bool Physical::isNodeEnabled() const {
return node && node->IsEnabled();
}
void Physical::setDefaultShader(Urho3D::Material* mat) const {
mat->SetShaderParameter("OutlineEnable", false);
mat->SetShaderParameter("SemiHide", false);
mat->SetShaderParameter("ColorPercent", 2.0);
mat->SetShaderParameter("Progress", 2.0);
mat->SetShaderParameter("VerticalPos",
Urho3D::Vector2(getPosition().y_, getPosition().y_ + getModelHeight()));
}
void Physical::loadXml(const Urho3D::String& xmlName) {
if (!SIM_GLOBALS.HEADLESS) {
node->LoadXML(Game::getCache()->GetResource<Urho3D::XMLFile>(xmlName)->GetRoot());
const auto model = node->GetComponent<Urho3D::StaticModel>();
if (getModelHeight() < 0.f) {
const auto boundingBox = model->GetModel()->GetBoundingBox().Size() * node->GetScale();
setModelData(Urho3D::Max(1.f, boundingBox.y_));
}
for (int i = 0; i < model->GetNumGeometries(); ++i) {
setDefaultShader(model->GetMaterial(i));
}
}
populate();
}
void Physical::setPlayerAndTeam(int player) {
setPlayer(player);
setTeam(Game::getPlayersMan()->getPlayer(player)->getTeam());
}
void Physical::ensureMaterialCloned() {
if (node && !materialCloned) {
if(getType()==ObjectType::BUILDING) {
std::cout << "test";
}
const auto model = node->GetComponent<Urho3D::StaticModel>();
for (int i = 0; i < model->GetNumGeometries(); ++i) {
model->SetMaterial(i, model->GetMaterial(i)->Clone());
auto mat = model->GetMaterial(i);
setDefaultShader(mat);
if (player >= 0 && mat->GetShaderParameter("OutlineColor").IsEmpty()) {
auto colorId = Game::getPlayersMan()->getPlayer(player)->getColor();
db_player_colors* col = Game::getDatabase()->getPlayerColor(colorId);
mat->SetShaderParameter("OutlineColor", getColor(col));
}
}
materialCloned = true;
}
}
```
Resources.h
```#pragma once
#include <string>
#include <span>
#include "utils/defines.h"
struct db_with_cost;
struct db_cost;
class Resources {
public:
Resources();
~Resources() = default;
void init(float valueForAll);
explicit Resources(float valueForAll);
Resources(const Resources&) = delete;
bool reduce(const db_cost* costs);
bool hasEnough(const db_cost* costs) const;
void add(int id, float value);
std::span<float> getValues() const { return values; }
std::span<float> getGatherSpeeds() const { return gatherSpeeds; }
std::span<float> getSumValues() const { return sumValues; }
int getSum() const;
std::string getValues(int precision, int player) const;
void setValue(int id, float amount);
void resetStats() const;
private:
float data[RESOURCES_SIZE * 4];
std::span<float> values;
std::span<float> gatherSpeeds;
std::span<float> sumGatherSpeed;
std::span<float> sumValues;
};
```
RandGen.h
```#pragma once
#include <magic_enum.hpp>
#include "RandType.h"
constexpr short RAND_TAB_SIZE = 1024 * 2;
enum class RandType : char;
class RandGen {
public:
static void init(bool isRandom);
static void dispose();
static void reset(bool isRandom);
static float nextRand(RandFloatType type, float max = 1.f);
static int nextRand(RandIntType type, int max = 255.f);
private:
RandGen() = default;
~RandGen() = default;
static void resetIndexes();
static RandGen* instance;
int indexesFloat[magic_enum::enum_count<RandFloatType>()];
int indexesInt[magic_enum::enum_count<RandIntType>()];
float dataFloat[RAND_TAB_SIZE];
int dataInt[RAND_TAB_SIZE];
};
```
FormationManager.cpp
```#include "FormationManager.h"
#include "objects/unit/Unit.h"
#include "utils/DeleteUtils.h"
#include <optional>
FormationManager::~FormationManager() {
clear_vector(formations);
}
std::optional<Formation*> FormationManager::createFormation(const std::vector<Unit*>& _units, FormationType _type) {
if (_units.empty()) { return {}; }
if (_type == FormationType::NONE) {
for (auto unit : _units) {
unit->resetFormation();
}
} else {
const short formationInFirst = _units.at(0)->getFormation();
bool allIn = true;
if (formationInFirst >= 0
&& formations[formationInFirst] != nullptr
&& formations[formationInFirst]->getSize() == _units.size()) {
for (auto unit : _units) {
if (unit->getFormation() != formationInFirst) {
allIn = false;
break;
}
}
if (allIn) {
return formations[formationInFirst];
}
}
for (; currentlyFree < formations.size(); ++currentlyFree) {
if (formations[currentlyFree] == nullptr) {
break;
}
}
if (currentlyFree == formations.size()) {
formations.push_back(nullptr);
}
auto returnFormation = formations[currentlyFree] = new Formation(
currentlyFree, _units, _type, Urho3D::Vector2(1, 1));
currentlyFree++;
return returnFormation;
}
return {};
}
void FormationManager::update() {
for (int i = 0; i < formations.size(); ++i) {
if (formations[i]) {
formations[i]->update();
if (formations[i]->getState() == FormationState::EMPTY) {
delete formations[i];
formations[i] = nullptr;
if (i < currentlyFree) {
currentlyFree = i;
}
}
}
}
}
float FormationManager::getPriority(Unit* unit) {
const short formation = unit->getFormation();
if (formation >= 0) {
return formations[formation]->getPriority(unit->getPositionInFormation());
}
return 0.f;
}
std::optional<Urho3D::Vector2> FormationManager::getPositionFor(Unit* unit) {
const short formation = unit->getFormation();
if (formation >= 0) {
return formations[formation]->getPositionFor(unit->getPositionInFormation());
}
return {};
}
bool FormationManager::isLeader(Unit* unit) const {
const short formation = unit->getFormation();
return formation >= 0 && formations[formation]->isLeader(unit);
}
bool FormationManager::isMoving(Unit* unit) const {
const short formation = unit->getFormation();
return formation >= 0 && formations[formation]->isMoving(unit);
}
int FormationManager::getCachePath(Unit* unit, int aimIndex) const {
const short formation = unit->getFormation();
if (formation > 0) {
return formations[formation]->getCachePath(unit->getMainGridIndex(), aimIndex);
}
return -1;
assert(false);
}
void FormationManager::addCachePath(Unit* unit, int aimIndex, int next) {
const short formation = unit->getFormation();
if (formation > 0) {
formations[formation]->addCachePath(unit->getMainGridIndex(), aimIndex, next);
}
}
```
MiniMapPanel.cpp
```#include "MiniMapPanel.h"
#include <Urho3D/Resource/Image.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/UI/CheckBox.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "camera/CameraManager.h"
#include "database/db_other_struct.h"
#include "hud/UiUtils.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "env/ContentInfo.h"
#include "env/Environment.h"
MiniMapPanel::MiniMapPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style)
: EventPanel(root, _style, "MiniMapWindow", {GameState::RUNNING, GameState::PAUSE}) {
std::fill_n(checks, MINI_MAP_BUTTON_NUMBER, true);
}
MiniMapPanel::~MiniMapPanel() {
delete[] heightMap;
delete minimap;
delete[] unitsColors;
delete[] buildingColors;
text->Release();
}
void MiniMapPanel::initColors() {
auto colorsSize = Game::getDatabase()->getPlayerColors().size();
unitsColors = new unsigned[colorsSize];
buildingColors = new unsigned[colorsSize];
std::fill_n(unitsColors, colorsSize, 0xFF505050);
std::fill_n(buildingColors, colorsSize, 0xFF505050);
std::fill_n(resourceColors, RESOURCES_SIZE, 0xFF808080);
for (int i = 0; i < RESOURCES_SIZE; ++i) {
const auto res = Game::getDatabase()->getResource(i);
if (res) {
resourceColors[i] = res->mini_map_color;
}
}
PlayersManager* playerManager = Game::getPlayersMan();
for (auto player : playerManager->getAllPlayers()) {
db_player_colors* col = Game::getDatabase()->getPlayerColor(player->getColor());
if (col) {
unitsColors[player->getId()] = col->unit;
buildingColors[player->getId()] = col->building;
}
}
}
void MiniMapPanel::createEmpty(int parts) {
initColors();
auto size = spr->GetSize();
const auto env = Game::getEnvironment();
const auto data = (uint32_t*)minimap->GetData();
int idR = 0;
float div = 5;
const float xinc = 1.0f / (size.x_ - 1);
const float yinc = 1.0f / (size.y_ - 1);
float yVal = 1;
float xVal = 0;
for (short y = size.y_; y > 0; --y) {
for (short x = 0; x < size.x_; ++x) {
float val = env->getGroundHeightPercentScaled( xVal, yVal, div);
*(data + idR) = 0xFF003000 + unsigned(val) * 0X100;
heightMap[idR] = *(data + idR);
++idR;
xVal += xinc;
}
xVal = 0;
yVal -= yinc;
}
text->SetData(minimap);
spr->SetTexture(text);
indexPerUpdate = size.x_ * size.y_ / parts + 1;
}
void MiniMapPanel::changeValue(uint32_t* data, bool& changed, unsigned val) const {
if (*(data + indexUpdate) != val) {
changed = true;
*(data + indexUpdate) = val;
}
}
void MiniMapPanel::update() {
const auto size = spr->GetSize();
auto env = Game::getEnvironment();
auto* data = (uint32_t*)minimap->GetData();
const float xinc = 1.0f / size.x_;
const float yinc = 1.0f / size.y_;
const auto activePlayer = Game::getPlayersMan()->getActivePlayerID();
bool changed = false;
for (int partIndex = 0; partIndex < indexPerUpdate && indexUpdate < size.y_ * size.x_; ++partIndex, ++indexUpdate) {
const float yVal = 1 - yinc * (indexUpdate / size.x_);
const float xVal = 0 + xinc * (indexUpdate % size.x_);
content_info* ci = env->getContentInfo({xVal + xinc / 2, yVal - yinc / 2}, checks, activePlayer);
if (checks[2] && ci->hasBuilding) {
changeValue(data, changed, buildingColors[ci->biggestBuilding()]);
} else if (checks[1] && ci->hasResource) {
changeValue(data, changed, resourceColors[ci->biggestResource()]);
} else if ((checks[3] || checks[4]) && ci->hasUnit) {
changeValue(data, changed, unitsColors[ci->biggestUnits()]);
} else if (checks[0]) {
changeValue(data, changed, heightMap[indexUpdate]);
} else {
changeValue(data, changed, 0x00FFFFFF);
}
}
if (indexUpdate >= size.y_ * size.x_) {
indexUpdate = 0;
}
if (changed) {
text->SetData(minimap);
spr->SetTexture(text);
}
}
void MiniMapPanel::createBody() {
spr = window->CreateChild<Urho3D::Sprite>();
spr->SetEnabled(true);
const auto row = createElement<Urho3D::UIElement>(window, style, "MiniMapListRow");
for (int i = 0; i < MINI_MAP_BUTTON_NUMBER; ++i) {
const auto texture = Game::getCache()->GetResource<Urho3D::Texture2D
>("textures/hud/icon/mm/minimap" + Urho3D::String(i) + ".png");
const auto box = createElement<Urho3D::CheckBox>(row, style, "MiniMapCheckBox");
createSprite(box, texture, style, "MiniMapSprite");
box->SetVar("Num", i);
SubscribeToEvent(box, Urho3D::E_CLICK, URHO3D_HANDLER(MiniMapPanel, HandleButton));
}
auto size = spr->GetSize();
spr->SetMaxSize(size);
minimap = new Urho3D::Image(Game::getContext());
minimap->SetSize(size.x_, size.y_, 4);
text = new Urho3D::Texture2D(Game::getContext());
text->SetData(minimap);
spr->SetTexture(text);
heightMap = new unsigned[size.x_ * size.y_];
SubscribeToEvent(spr, Urho3D::E_CLICK, URHO3D_HANDLER(MiniMapPanel, HandleMiniMapClick));
}
void MiniMapPanel::HandleButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
const auto element = (Urho3D::CheckBox*)eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr();
const int id = element->GetVar("Num").GetInt();
checks[id] = element->IsChecked();
}
void MiniMapPanel::HandleMiniMapClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
const auto element = static_cast<Urho3D::Sprite*>(eventData[Urho3D::Click::P_ELEMENT].GetVoidPtr());
const auto begin = element->GetScreenPosition();
const auto size = element->GetSize();
float x = eventData[Urho3D::Click::P_X].GetInt() - begin.x_;
float y = size.y_ - (eventData[Urho3D::Click::P_Y].GetInt() - begin.y_);
Game::getCameraManager()->changePositionInPercent(x / size.x_, y / size.y_);
}
```
InGameMenuPanel.h
```#pragma once
#include "hud/window/EventPanel.h"
constexpr char IN_GAME_MENU_BUTTON_NUMBER = 5;
namespace Urho3D
{
class UIElement;
class Button;
}
class AbstractMiddlePanel;
class InGameMenuPanel : public EventPanel {
public:
explicit InGameMenuPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~InGameMenuPanel();
void setVisible(bool enable) override;
Urho3D::Button* getSaveButton() const;
private:
void toggle();
void action(short id);
void close() const;
void createBody() override;
void HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleToggle(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
bool menuVisibility = false;
Urho3D::Button* toggleButton;
AbstractMiddlePanel* additionalPanels[IN_GAME_MENU_BUTTON_NUMBER];
};
```
LevelCache.cpp
```#include "LevelCache.h"
#include <algorithm>
#include <iostream>
#include "env/GridCalculator.h"
LevelCache::LevelCache(float maxDistance, bool initCords, GridCalculator* calculator)
: maxDistance(maxDistance), invDiff(RES_SEP_DIST / maxDistance), calculator(calculator) {
levelsCache[0] = new std::vector<short>(1);
std::vector<short> temp;
for (int i = 1; i < RES_SEP_DIST; ++i) {
levelsCache[i] = getEnvIndexs(maxDistance / RES_SEP_DIST * i, levelsCache[i - 1], temp);
}
levelsCacheCords[0] = nullptr;
if (initCords) {
initCordsFn();
}
}
LevelCache::~LevelCache() {
delete levelsCache[0];
for (int i = 1; i < RES_SEP_DIST; ++i) {
if (levelsCache[i - 1] != levelsCache[i]) {
delete levelsCache[i];
}
}
if (levelsCacheCords[0] != nullptr) {
delete levelsCacheCords[0];
for (int i = 1; i < RES_SEP_DIST; ++i) {
if (levelsCacheCords[i - 1] != levelsCacheCords[i]) {
delete levelsCacheCords[i];
}
}
}
}
std::vector<short>* LevelCache::get(float radius) const {
const int index = radius * invDiff;
if (index < RES_SEP_DIST) {
return levelsCache[index];
}
return levelsCache[RES_SEP_DIST - 1];
}
std::vector<Urho3D::IntVector2>* LevelCache::getCords(float radius) const {
assert(levelsCacheCords[0] != nullptr);
const int index = radius * invDiff;
if (index < RES_SEP_DIST) {
return levelsCacheCords[index];
}
return levelsCacheCords[RES_SEP_DIST - 1];
}
std::pair<std::vector<short>*, std::vector<Urho3D::IntVector2>*> LevelCache::getBoth(float radius) const {
assert(levelsCacheCords[0] != nullptr);
const int index = radius * invDiff;
if (index < RES_SEP_DIST) {
assert(levelsCache[index]->size() == levelsCacheCords[index]->size());
return {levelsCache[index], levelsCacheCords[index]};
}
assert(levelsCache[RES_SEP_DIST - 1]->size() == levelsCacheCords[RES_SEP_DIST - 1]->size());
return {levelsCache[RES_SEP_DIST - 1], levelsCacheCords[RES_SEP_DIST - 1]};
}
void LevelCache::initCordsFn() {
if (levelsCacheCords[0] == nullptr) {
levelsCacheCords[0] = new std::vector<Urho3D::IntVector2>();
levelsCacheCords[0]->push_back(Urho3D::IntVector2::ZERO);
auto prev = levelsCacheCords[0]; //TODO perf tego nie robic dla całosci
for (int i = 1; i < RES_SEP_DIST; ++i) {
if (levelsCache[i - 1] != levelsCache[i]) {
prev = new std::vector<Urho3D::IntVector2>();
prev->reserve(levelsCache[i]->size());
for (auto value : *levelsCache[i]) {
prev->push_back(calculator->getShiftCords(value));
}
}
levelsCacheCords[i] = prev;
}
}
}
std::vector<short>* LevelCache::getEnvIndexs(float radius, std::vector<short>* prev, std::vector<short>& temp) const {
radius *= radius;
radius /= calculator->getFieldSize() * calculator->getFieldSize();
temp.clear();
temp.reserve(prev->size());
for (short i = 0; i < RES_SEP_DIST; ++i) {
const short x = i + 1;
for (short j = 0; j < RES_SEP_DIST; ++j) {
if (i * i + j * j < radius) {
const short y = j + 1;
temp.push_back(calculator->getNotSafeIndexClose(-x, y));
temp.push_back(calculator->getNotSafeIndexClose(-x, -y));
} else {
break;
}
}
//j=0
if (i * i < radius) {
temp.push_back(calculator->getNotSafeIndexClose(0, -x));
temp.push_back(calculator->getNotSafeIndexClose(-x, 0));
} else {
break;
}
}
if (temp.size() * 2 + 1 == prev->size()) {
return prev;
}
std::ranges::reverse(temp);
std::ranges::sort(temp);
temp.reserve(temp.size() * 2 + 1);
temp.push_back(0);
const auto size = temp.size() - 2;
for (int i = size; i >= 0; --i) {
temp.push_back(-temp[i]);
}
const auto indexes = new std::vector<short>();
*indexes = temp;
return indexes;
}
```
Aim.h
```#pragma once
#include <Urho3D/Math/Vector3.h>
#include <vector>
class Unit;
class Aim {
public:
virtual ~Aim() = default;
virtual Urho3D::Vector2 getDirection(Unit* unit) = 0;
virtual bool ifReach(Unit* unit) = 0;
virtual bool expired() = 0;
virtual std::vector<Urho3D::Vector3> getDebugLines(Unit* unit) const { return {}; }
};
```
SimplePanel.cpp
```#include "SimplePanel.h"
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
#include "utils/OtherUtils.h"
SimplePanel::SimplePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, Urho3D::String styleName,
std::initializer_list<GameState> active):
style(_style), styleName(std::move(styleName)), root(root) {
std::fill_n(visibleAt, magic_enum::enum_count<GameState>(), false);
for (auto a : active) {
visibleAt[cast(a)] = true;
}
}
SimplePanel::~SimplePanel() {
window->Remove();
}
void SimplePanel::createWindow() {
window = createElement<Urho3D::Window>(root, style, styleName);
createBody();
}
void SimplePanel::updateStateVisibility(GameState state) {
setVisible(visibleAt[cast(state)]);
}
void SimplePanel::setVisible(bool enable) {
window->SetVisible(enable);
}
```
GoState.h
```#pragma once
#include "../Unit.h"
#include "State.h"
class GoState : public State {
public:
GoState() : State({
UnitState::STOP, UnitState::MOVE, UnitState::DEFEND,
UnitState::DEAD, UnitState::GO, UnitState::FOLLOW,
UnitState::CHARGE
}) { }
~GoState() = default;
bool canStart(Unit* unit, const ActionParameter& parameter) override {
return parameter.aim != nullptr;
}
void onStart(Unit* unit, const ActionParameter& parameter) override {
unit->setAim(parameter.aim);
unit->thingToInteract = nullptr;
}
void onEnd(Unit* unit) override {
unit->removeCurrentAim();
}
void execute(Unit* unit, float timeStep) override {
if (!unit->aims.hasCurrent() && !unit->hasStateChangePending()) {
StateManager::toDefaultState(unit);
}
}
};
```
MainMenuClosePanel.h
```#pragma once
#include "hud/window/main_menu/MainMenuDetailsPanel.h"
namespace Urho3D {
class UIElement;
class Text;
class Button;
}
class MainMenuClosePanel : public MainMenuDetailsPanel {
public:
MainMenuClosePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuClosePanel() = default;
Urho3D::Button* getCloseButton() const;
private:
void createBody() override;
void HandleCancelClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
Urho3D::Window* miniWindow;
Urho3D::Text* text;
Urho3D::UIElement* row;
Urho3D::Button* yes;
Urho3D::Button* no;
};
```
LoadingPanel.cpp
```#include "LoadingPanel.h"
#include <Urho3D/UI/ProgressBar.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
LoadingPanel::LoadingPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : SimplePanel(root, _style, "LoadingWindow",
{GameState::LOADING, GameState::NEW_GAME}) {}
void LoadingPanel::show() {
setVisible(true);
update(0);
}
void LoadingPanel::end() {
setVisible(false);
}
void LoadingPanel::createBody() {
background = createElement<Urho3D::BorderImage>(window, style, "Background");
background->SetVisible(true);
bar = createElement<Urho3D::ProgressBar>(background, style, "LargeProgressBar");
bar->SetRange(1.f);
bar->SetValue(0.f);
bar->SetVisible(true);
}
void LoadingPanel::update(float progres) const {
bar->SetValue(progres);
}
```
LevelBuilder.cpp
```#include "LevelBuilder.h"
#include <Urho3D/Graphics/Material.h>
#include <Urho3D/Graphics/Octree.h>
#include <Urho3D/Graphics/Terrain.h>
#include "database/DatabaseCache.h"
#include "database/db_other_struct.h"
#include "hud/window/main_menu/new_game/NewGameForm.h"
#include "load/dbload_container.h"
#include "load/SceneLoader.h"
#include "objects/NodeUtils.h"
LevelBuilder::LevelBuilder() {
scene = new Urho3D::Scene(Game::getContext());
scene->CreateComponent<Urho3D::Octree>();
Game::setScene(scene);
}
LevelBuilder::~LevelBuilder() {
scene->Remove();
scene = nullptr;
Game::setScene(nullptr);
}
void LevelBuilder::createScene(SceneLoader& loader) {
loader.load();
createMap(loader.getConfig()->map, loader.getConfig()->size);
}
void LevelBuilder::createMap(int mapId, int size) {
const auto map = Game::getDatabase()->getMaps()[mapId];
if (!SIM_GLOBALS.HEADLESS) {
createNode("map/zone.xml");
createNode("map/light.xml");
}
createGround(map->xmlName, size);
}
void LevelBuilder::createScene(NewGameForm* form) {
createMap(form->map, form->size / 256.f);
}
Urho3D::Terrain* LevelBuilder::getTerrain() const {
return terrain;
}
void LevelBuilder::createGround(const Urho3D::String& xmlName, int size) {
if (!SIM_GLOBALS.FAKE_TERRAIN) {
const auto hSpacing = size / 256.f;
auto node = createNode(xmlName);
terrain = node->GetComponent<Urho3D::Terrain>();
auto s = terrain->GetSpacing();
s.x_ = hSpacing;
s.y_ *= hSpacing;
s.z_ = hSpacing;
terrain->SetSpacing(s);
terrain->GetNode()->SetRotation(Urho3D::Quaternion(-90, Urho3D::Vector3(0, 1, 0)));
if (!SIM_GLOBALS.HEADLESS) {
auto mat = terrain->GetMaterial();
mat->SetShaderParameter("DetailTiling", Urho3D::Vector2(16.f * hSpacing, 16.f * hSpacing));
mat->SetShaderParameter("GridEnable", false);
terrain->SetSmoothing(true);
node->SetVar("ground", true);
}
}
}
```
CloseIndexes.h
```#pragma once
#include <algorithm>
#include <vector>
constexpr char CLOSE_SIZE = 9;
constexpr char FROM_1_TO_2_SIZE = 16;
constexpr char CLOSE_SECOND_SIZE = 25;
class CloseIndexes {
public:
explicit CloseIndexes(short res);
CloseIndexes(const CloseIndexes& rhs) = delete;
const std::vector<short>& get(int center) const { return closeVals[getIndex(center)]; }
const std::vector<short>& getSecond(int center) const { return closeSecondVals[getSecondIndex(center)]; }
const std::vector<unsigned char>& getTabIndexes(int center) const { return tabIndexes[getIndex(center)]; }
const std::vector<unsigned char>& getTabSecondIndexes(int center) const { return tabSecondIndexes[getSecondIndex(center)]; }
short getIndexAt(unsigned char index) const { return templateVec[index]; }
short getSecondIndexAt(unsigned char index) const { return templateVecSecond[index]; }
unsigned short getResolution() const { return resolution; }
bool isInLocalArea(int center, int indexOfAim) const;
bool isInLocal2Area(int center, int indexOfAim) const;
const std::vector<short>& getPassIndexVia1LevelTo2(int startIdx, int endIdx) const;
std::pair<const std::vector<short>&, int> getPassIndexVia1LevelTo2(int startIdx,
const std::vector<int>& endIdxs) const;
private:
char getIndex(int center) const;
char getSecondIndex(int center) const;
short resolution;
int sqResolutionMinusRes;
std::vector<short> templateVec;
std::vector<short> templateVecSecond;
static const std::vector<unsigned char> tabIndexes[CLOSE_SIZE];
std::vector<short> closeVals[CLOSE_SIZE];
static const std::vector<unsigned char> tabSecondIndexes[CLOSE_SECOND_SIZE];
std::vector<short> closeSecondVals[CLOSE_SECOND_SIZE];
static const std::vector<unsigned char> passTo2From1Indexes[FROM_1_TO_2_SIZE];
std::vector<short> passTo2From1Vals[FROM_1_TO_2_SIZE];
static const std::vector<short> EMPTY;
};
inline bool isInTab(const std::vector<short>& tab, const int val) {
return std::ranges::any_of(tab, [val](short i) { return val == i; });
}
```
MySprite.cpp
```#include "MySprite.h"
#include <Urho3D/Core/Context.h>
#include <Urho3D/Graphics/Texture2D.h>
const char* blendModeNames[] =
{
"replace",
"add",
"multiply",
"alpha",
"addalpha",
"premulalpha",
"invdestalpha",
"subtract",
"subtractalpha",
0
};
const char* horizontalAlignments[] =
{
"Left",
"Center",
"Right",
"Custom",
0
};
const char* verticalAlignments[] =
{
"Top",
"Center",
"Bottom",
"Custom",
0
};
MySprite::MySprite(Urho3D::Context* context) :
Sprite(context) {
}
void MySprite::RegisterObject(Urho3D::Context* context) {
context->RegisterFactory<MySprite>();
using namespace Urho3D;
URHO3D_ATTRIBUTE("Percent HotSpot", Vector2, percentHotspot, Vector2(0.5, 0.5), Urho3D::AM_DEFAULT);
URHO3D_ATTRIBUTE("My Size", IntVector2, mySize, IntVector2::ZERO, AM_DEFAULT);
URHO3D_ACCESSOR_ATTRIBUTE("Name", GetName, SetName, String, String::EMPTY, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Position", GetPosition, SetPosition, Vector2, Vector2::ZERO, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Size", GetSize, SetSize, IntVector2, IntVector2::ZERO, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Hotspot", GetHotSpot, SetHotSpot, IntVector2, IntVector2::ZERO, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Scale", GetScale, SetScale, Vector2, Vector2::ONE, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Rotation", GetRotation, SetRotation, float, 0.0f, AM_FILE);
URHO3D_MIXED_ACCESSOR_ATTRIBUTE("Texture", GetTextureAttr, SetTextureAttr, ResourceRef,
ResourceRef(Texture2D::GetTypeStatic()), AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Image Rect", GetImageRect, SetImageRect, IntRect, IntRect::ZERO, AM_FILE);
URHO3D_ENUM_ACCESSOR_ATTRIBUTE("Blend Mode", GetBlendMode, SetBlendMode, BlendMode, blendModeNames, 0, AM_FILE);
URHO3D_ENUM_ACCESSOR_ATTRIBUTE("Horiz Alignment", GetHorizontalAlignment, SetHorizontalAlignment,
HorizontalAlignment, horizontalAlignments, HA_LEFT, AM_FILE);
URHO3D_ENUM_ACCESSOR_ATTRIBUTE("Vert Alignment", GetVerticalAlignment, SetVerticalAlignment, VerticalAlignment,
verticalAlignments, VA_TOP, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Priority", GetPriority, SetPriority, int, 0, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Opacity", GetOpacity, SetOpacity, float, 1.0f, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Color", GetColorAttr, SetColor, Color, Color::WHITE, AM_FILE);
// URHO3D_ATTRIBUTE("Top Left Color", Color, color_[0], Color::WHITE, AM_FILE);
// URHO3D_ATTRIBUTE("Top Right Color", Color, color_[1], Color::WHITE, AM_FILE);
// URHO3D_ATTRIBUTE("Bottom Left Color", Color, color_[2], Color::WHITE, AM_FILE);
// URHO3D_ATTRIBUTE("Bottom Right Color", Color, color_[3], Color::WHITE, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Is Visible", IsVisible, SetVisible, bool, true, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Use Derived Opacity", GetUseDerivedOpacity, SetUseDerivedOpacity, bool, true, AM_FILE);
URHO3D_ACCESSOR_ATTRIBUTE("Max Size", GetMaxSize, SetMaxSize, IntVector2, IntVector2::ZERO, AM_FILE);
//URHO3D_ATTRIBUTE("Variables", VariantMap, vars_, Variant::emptyVariantMap, AM_FILE);
}
```
CreationCommandList.h
```#pragma once
#include "commands/CommandList.h"
namespace Urho3D {
class Vector2;
}
class SimulationObjectManager;
class CreationCommand;
class CreationCommandList : public CommandList {
public:
explicit CreationCommandList(SimulationObjectManager* simulationObjectManager);
virtual ~CreationCommandList() = default;
CreationCommand* addUnits(int number, int id, Urho3D::Vector2& position, char player, int level) const;
CreationCommand* addBuilding(int id, Urho3D::Vector2& position, char player, int level) const;
CreationCommand* addBuildingForce(int id, Urho3D::Vector2& position, char player, int level) const;
CreationCommand* addResource(int id, Urho3D::Vector2& position, int level) const;
protected:
void setParameters(AbstractCommand* command) override;
private:
SimulationObjectManager* simulationObjectManager;
};
```
EventPanel.cpp
```#include "EventPanel.h"
#include <utility>
#include "Game.h"
EventPanel::EventPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, Urho3D::String styleName,
std::initializer_list<GameState> active)
: SimplePanel(root, _style, std::move(styleName), active),
Object(Game::getContext()) { }
```
MainMenuDetailsPanel.cpp
```#include "MainMenuDetailsPanel.h"
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
MainMenuDetailsPanel::MainMenuDetailsPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title)
: EventPanel(root, _style, "MainMenuDetailsWindow", {}) {
bodyStyle = "MainMenuMock";
msg = _title;
}
void MainMenuDetailsPanel::createBody() {
addChildText(window, "MainMenuTitle", msg, style);
body = createElement<Urho3D::UIElement>(window, style, "bodyStyle");
window->SetPriority(2);
}
```
Game.h
```#pragma once
#include <Urho3D/Scene/Scene.h>
namespace Urho3D {
class Console;
class Graphics;
class Context;
class ResourceCache;
class UI;
class Log;
class Localization;
class Engine;
}
class Environment;
class DatabaseCache;
class CameraManager;
class PlayersManager;
class ColorPaletteRepo;
class FormationManager;
class ActionCenter;
class AiInputProvider;
class Game {
public:
static void init();
static void dispose();
~Game() = default;
static Game* setCache(Urho3D::ResourceCache* _cache);
static Game* setContext(Urho3D::Context* _context);
static Game* setUI(Urho3D::UI* _ui);
static Game* setGraphics(Urho3D::Graphics* _graphics);
static Game* setScene(Urho3D::Scene* scene);
static Game* setConsole(Urho3D::Console* _console);
static Game* setLocalization(Urho3D::Localization* _localization);
static Game* setCameraManager(CameraManager* cameraManager);
static Game* setDatabaseCache(DatabaseCache* _databaseCache);
static Game* setPlayersManager(PlayersManager* _playersManager);
static Game* setEnvironment(Environment* _environment);
static Game* setFormationManager(FormationManager* _formationManager);
static Game* setColorPaletteRepo(ColorPaletteRepo* _colorPaletteRepo);
static Game* setLog(Urho3D::Log* _log);
static Game* setAiInputProvider(AiInputProvider* _aiInputProvider);
static Game* setActionCenter(ActionCenter* _actionCenter);
static void addTime(float time);
static Urho3D::Localization* getLocalization() { return instance->localization; }
static Urho3D::Scene* getScene() { return instance->scene; }
static Urho3D::Graphics* getGraphics() { return instance->graphics; }
static Urho3D::ResourceCache* getCache() { return instance->cache; }
static Urho3D::Context* getContext() { return instance->context; }
static Urho3D::Console* getConsole() { return instance->console; }
static Urho3D::Log* getLog() { return instance->log; }
static Urho3D::UI* getUI() { return instance->ui; }
static FormationManager* getFormationManager() { return instance->formationManager; }
static ColorPaletteRepo* getColorPaletteRepo() { return instance->colorPaletteRepo; }
static DatabaseCache* getDatabase() { return instance->databaseCache; }
static CameraManager* getCameraManager() { return instance->cameraManager; }
static PlayersManager* getPlayersMan() { return instance->playersManager; }
static Environment* getEnvironment() { return instance->environment; }
static AiInputProvider* getAiInputProvider() { return instance->aiInputProvider; }
static ActionCenter* getActionCenter() { return instance->actionCenter; }
static float getTime() { return instance->accumTime; }
private:
Game();
static Game* instance;
Urho3D::Scene* scene;
Urho3D::Localization* localization;
Urho3D::ResourceCache* cache;
Urho3D::Graphics* graphics;
Urho3D::Console* console;
Urho3D::Context* context;
Urho3D::Log* log;
Urho3D::UI* ui;
FormationManager* formationManager;
ColorPaletteRepo* colorPaletteRepo;
PlayersManager* playersManager;
CameraManager* cameraManager;
DatabaseCache* databaseCache;
Environment* environment;
AiInputProvider* aiInputProvider;
ActionCenter* actionCenter;
float accumTime = 0;
};
```
CloseIndexes.cpp
```#include <vector>
#include "CloseIndexes.h"
#include <cassert>
const std::vector<unsigned char> CloseIndexes::tabIndexes[CLOSE_SIZE] = {
{4, 6, 7},
{3, 4, 5, 6, 7},
{3, 5, 6},
{1, 2, 4, 6, 7},
{0, 1, 2, 3, 4, 5, 6, 7},
{0, 1, 3, 5, 6},
{1, 2, 4},
{0, 1, 2, 3, 4},
{0, 1, 3}
};
const std::vector<unsigned char> CloseIndexes::tabSecondIndexes[CLOSE_SECOND_SIZE] = {
{8, 10, 13, 14, 15},
{8, 10, 12, 13, 14, 15},
{7, 8, 9, 10, 11, 12, 13, 14, 15},
{7, 9, 11, 12, 13, 14, 15},
{7, 9, 11, 12, 13},
{6, 8, 10, 13, 14, 15},
{6, 8, 10, 12, 13, 14, 15},
{5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
{5, 7, 9, 11, 12, 13, 14},
{5, 7, 9, 11, 12, 13},
{2, 3, 4, 6, 8, 10, 13, 14, 15},
{1, 2, 3, 4, 6, 8, 10, 12, 13, 14, 15},
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
{0, 1, 2, 3, 5, 7, 9, 11, 12, 13, 14},
{0, 1, 2, 5, 7, 9, 11, 12, 13},
{2, 3, 4, 6, 8, 10},
{1, 2, 3, 4, 6, 8, 10},
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10},
{0, 1, 2, 3, 5, 7, 9},
{0, 1, 2, 5, 7, 9},
{2, 3, 4, 6, 8},
{1, 2, 3, 4, 6, 8},
{0, 1, 2, 3, 4, 5, 6, 7, 8},
{0, 1, 2, 3, 5, 7},
{0, 1, 2, 5, 7},
};
const std::vector<unsigned char> CloseIndexes::passTo2From1Indexes[FROM_1_TO_2_SIZE] = {
{0},
{0, 1},
{1, 0, 2},
{1, 2},
{2},
{0, 3},
{2, 4},
{3, 0, 5},
{4, 2, 7},
{3, 5},
{4, 7},
{5},
{5, 6},
{6, 5, 7},
{6, 7},
{7}
};
const std::vector<short> CloseIndexes::EMPTY = {};
CloseIndexes::CloseIndexes(short res)
: resolution(res), sqResolutionMinusRes(res * res - res),
templateVec{-res - 1, -res, -res + 1, -1, 1, res - 1, res, res + 1},
templateVecSecond{
-2 * res - 2, -2 * res - 1, -2 * res, -2 * res + 1, -2 * res + 2,
-res - 2, -res + 2,
- 2, +2,
res - 2, res + 2,
2 * res - 2, 2 * res - 1, 2 * res, 2 * res + 1, 2 * res + 2,
} {
for (int i = 0; i < CLOSE_SIZE; ++i) {
closeVals[i].reserve(tabIndexes[i].size());
for (auto j : tabIndexes[i]) {
closeVals[i].emplace_back(templateVec[j]);
}
}
for (int i = 0; i < CLOSE_SECOND_SIZE; ++i) {
closeSecondVals[i].reserve(tabSecondIndexes[i].size());
for (auto j : tabSecondIndexes[i]) {
closeSecondVals[i].emplace_back(templateVecSecond[j]);
}
}
for (int i = 0; i < FROM_1_TO_2_SIZE; ++i) {
passTo2From1Vals[i].reserve(passTo2From1Indexes[i].size());
for (auto j : passTo2From1Indexes[i]) {
passTo2From1Vals[i].emplace_back(templateVec[j]);
}
}
}
bool CloseIndexes::isInLocalArea(const int center, int indexOfAim) const {
if (center == indexOfAim) { return true; }
return isInTab(get(indexOfAim), indexOfAim - center); //center + value == indexOfAim
}
bool CloseIndexes::isInLocal2Area(int center, int indexOfAim) const {
return isInTab(getSecond(indexOfAim), indexOfAim - center); //center + value == indexOfAim
}
const std::vector<short>& CloseIndexes::getPassIndexVia1LevelTo2(int startIdx, int endIdx) const {
auto& tab = getTabSecondIndexes(endIdx);
const auto diff = endIdx - startIdx; //startIdx + tab[i] == endIdx
for (auto i : tab) {
auto val = getSecondIndexAt(i);
if (val == diff) {
return passTo2From1Vals[i];
}
}
assert(!isInLocal2Area(startIdx, endIdx));
return EMPTY;
}
std::pair<const std::vector<short>&, int> CloseIndexes::getPassIndexVia1LevelTo2(
int startIdx, const std::vector<int>& endIdxs) const {
for (auto endIdx : endIdxs) {
auto& tab = getTabSecondIndexes(endIdx);
const auto diff = endIdx - startIdx; //startIdx + tab[i] == endIdx
for (auto i : tab) {
auto val = getSecondIndexAt(i);
if (val == diff) {
return {passTo2From1Vals[i], endIdx};
}
}
}
return {EMPTY, -1};
}
char CloseIndexes::getIndex(int center) const {
char index = 0;
if (center < resolution) { } else if (center >= sqResolutionMinusRes) {
index += 6;
} else {
index += 3;
}
const auto mod = center % resolution;
if (mod == 0) { } else if (mod == resolution - 1) {
index += 2;
} else {
index += 1;
}
return index;
// const auto mod = center % resolution;
//
// auto a = center < resolution;
// auto b = center >= sqResolutionMinusRes;
// auto a1 = mod == 0;
// auto b1 = mod == resolution - 1;
// return !a * (b * 6 + !b * 3) +
// !a1 * (b1 * 2 + !b1 * 1);
}
char CloseIndexes::getSecondIndex(int center) const {
const bool firstRow = center < resolution;
const bool secondRow = !firstRow && center < 2 * resolution;
const bool lastRow = center >= resolution * resolution - resolution;
const bool almostLastRow = !lastRow && center >= resolution * resolution - 2 * resolution;
const bool firstColumn = center % resolution == 0;
const bool secondColumn = center % resolution == 1;
const bool lastColumn = center % resolution == resolution - 1;
const bool almostLastColumn = center % resolution == resolution - 2;
char index = 0;
if (firstRow) {} else if (secondRow) {
index += 5;
} else if (almostLastRow) {
index += 15;
} else if (lastRow) {
index += 20;
} else {
index += 10;
}
if (firstColumn) {} else if (secondColumn) {
index += 1;
} else if (almostLastColumn) {
index += 3;
} else if (lastColumn) {
index += 4;
} else { index += 2; }
return index;
}
```
LeftMenuInfoPanel.cpp
```#include "LeftMenuInfoPanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/Window.h>
#include "control/SelectedInfo.h"
#include "control/SelectedInfoType.h"
#include "database/db_other_struct.h"
#include "hud/HudData.h"
#include "hud/UiUtils.h"
#include "objects/ActionType.h"
#include "objects/NamesCache.h"
#include "objects/Physical.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "utils/NamesUtils.h"
LeftMenuInfoPanel::LeftMenuInfoPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : SimplePanel(root, _style, "LeftMenuInfoPanel", {}) {
}
void LeftMenuInfoPanel::createBody() {
text = addChildText(window, "MyText", style);
}
void LeftMenuInfoPanel::updateSelected(SelectedInfo* selectedInfo) {
if (!hoverIsOn) {
selectedIsOn = true;
if (selectedInfo->getAllNumber() == 1) {
auto optInfoTypes = selectedInfo->getOneSelectedTypeInfo();
if (optInfoTypes.has_value()) {
text->SetText(optInfoTypes.value()->getData().at(0)->getInfo());
setVisible(true);
}
} else if (selectedInfo->isSthSelected()) {
Urho3D::String msg = "";
for (const auto& selectedType : selectedInfo->getSelectedTypes()) {
auto& data = selectedType->getData();
if (!data.empty()) {
float sumHpPer = 0.f;
for (const auto physical : data) {
sumHpPer += physical->getHealthPercent();
}
sumHpPer *= 100;
sumHpPer /= data.size();
msg.Append(data.at(0)->getName())
.Append(": ").Append(Urho3D::String(data.size())).Append(" | ")
.Append(asStringF(sumHpPer, 1).c_str()).Append("%\n");
}
}
text->SetText(msg);
setVisible(true);
} else {
setVisible(false);
}
}
}
Urho3D::String LeftMenuInfoPanel::createMessage(HudData* hudData) {
const auto id = hudData->getId();
switch (hudData->getType()) {
case ActionType::UNIT_CREATE: {
const auto dbUnit = Game::getDatabase()->getUnit(id);
return stringFrom(dbUnit->name, dbUnit->costs);
}
case ActionType::UNIT_LEVEL: {
auto opt = Game::getPlayersMan()->getActivePlayer()->getNextLevelForUnit(id);
if (opt.has_value()) {
const auto dbLevel = opt.value();
return stringFrom(dbLevel->name, dbLevel->costs);
}
}
case ActionType::UNIT_UPGRADE:
return "TODO";
case ActionType::BUILDING_CREATE: {
const auto dbBuilding = Game::getDatabase()->getBuilding(id);
return stringFrom(dbBuilding->name, dbBuilding->costs);
}
case ActionType::BUILDING_LEVEL: {
auto opt = Game::getPlayersMan()->getActivePlayer()->getNextLevelForBuilding(id);
if (opt.has_value()) {
auto dbLevel = opt.value();
return stringFrom(dbLevel->name, dbLevel->costs);
}
}
case ActionType::ORDER:
return Game::getLocalization()->Get(Game::getDatabase()->getOrder(id)->name);
case ActionType::FORMATION:
case ActionType::RESOURCE:
return hudData->getText();
default: ;
}
}
void LeftMenuInfoPanel::setHoverInfo(HudData* hudData) {
Urho3D::String message = createMessage(hudData);
if (message.Length() > 0) {
text->SetText(message);
setVisible(true);
hoverIsOn = true;
} else {
removeHoverInfo();
}
}
void LeftMenuInfoPanel::removeHoverInfo() {
hoverIsOn = false;
if (!selectedIsOn) {
setVisible(false);
}
}
void LeftMenuInfoPanel::clearSelected() {
selectedIsOn = false;
if (!hoverIsOn) {
setVisible(false);
}
}
```
db_strcut.h
```#pragma once
#include <magic_enum.hpp>
#include <span>
#include <vector>
#include <valarray>
#include <Urho3D/Math/Vector2.h>
#include "objects/building/ParentBuildingType.h"
#include "objects/unit/state/UnitState.h"
#include "db_basic_struct.h"
#include "math/SpanUtils.h"
#include "player/ai/ActionMaker.h"
#include "simulation/SimGlobals.h"
#include "utils/DeleteUtils.h"
#include "utils/OtherUtils.h"
#include "utils/StringUtils.h"
struct db_unit;
struct db_unit_metric;
struct db_nation;
struct db_order;
struct db_building_level;
struct db_cost;
struct db_unit_level;
float inline safeDiv(float first, short second) {
second = second <= 0 ? 1 : second;
return first > 0.f ? first / second * FRAMES_IN_PERIOD : 0.f;
}
struct db_common_attack {
const float collect;
const float attack;
const float attackReload;
const short attackRange;
const short sqAttackRange;
db_common_attack(float collect, float attack, float attackReload, short attackRange)
: attack(attack), attackReload(attackReload), attackRange(attackRange), collect(collect),
sqAttackRange(attackRange * attackRange) {
}
bool initFlag(float val) const {
return val > 0.f;
}
};
struct db_building_attack : db_common_attack {
const bool canAttack;
db_building_attack(float collect, float attack, float attackReload, short attackRange)
: db_common_attack(collect, attack, attackReload, attackRange),
canAttack(initFlag(attack)) {
}
};
struct db_unit_attack : db_common_attack {
const float bonusInfantry;
const float bonusRange;
const float bonusCalvary;
const float bonusWorker;
const float bonusSpecial;
const float bonusMelee;
const float bonusHeavy;
const float bonusLight;
const float bonusBuilding;
db_unit_attack(float collect, float attack, float attackReload, short attackRange,
float bonusInfantry, float bonusRange, float bonusCalvary, float bonusWorker,
float bonusSpecial, float bonusMelee, float bonusHeavy, float bonusLight, float bonusBuilding)
: db_common_attack(collect, attack, attackReload, attackRange),
bonusInfantry(bonusInfantry),
bonusRange(bonusRange),
bonusCalvary(bonusCalvary),
bonusWorker(bonusWorker),
bonusSpecial(bonusSpecial),
bonusMelee(bonusMelee),
bonusHeavy(bonusHeavy),
bonusLight(bonusLight),
bonusBuilding(bonusBuilding) {
}
};
struct db_static {
const Urho3D::IntVector2 size;
explicit db_static(const Urho3D::IntVector2& size)
: size(size) {
}
};
struct db_cost {
const std::array<short, 4> values;
const short sum = 0;
db_cost(short food, short wood, short stone, short gold) : values({food, wood, stone, gold}),
sum(food + wood + stone + gold) {
}
};
struct db_with_cost {
db_cost* costs{};
unsigned short getSumCost() const {
return costs ? costs->sum : 0;
}
~db_with_cost() {
delete costs;
}
};
struct db_basic_metric {
protected:
std::valarray<float> valuesNormAsVal;
std::valarray<float> typesNormAsVal;
std::vector<float> valuesNormForSum;
void setValarray(std::valarray<float>& valarray, const std::span<unsigned char>& idxs) {
std::vector<float> temp;
temp.clear();
temp.reserve(idxs.size());
for (const unsigned char idx : idxs) {
temp.push_back(valuesNormAsVal[idx]);
}
valarray = std::valarray<float>(temp.data(), temp.size());
}
public:
//const std::vector<float>& getValuesNorm() const { return valuesNorm; }
const std::valarray<float>& getValuesNormAsVal() const { return valuesNormAsVal; }
const std::vector<float>& getValuesNormForSum() const { return valuesNormForSum; }
const std::span<const float>& getTypesVal() const {
return std::span{std::begin(typesNormAsVal), typesNormAsVal.size()};
}
};
struct db_building_metric : db_basic_metric {
std::valarray<float> otherNormAsVal;
std::valarray<float> defenceNormAsVal;
std::valarray<float> resourceNormAsVal;
std::valarray<float> techNormAsVal;
std::valarray<float> unitsNormAsVal;
db_building_metric(const std::vector<float>& newValues, const std::vector<float>& newValuesForSum,
std::span<unsigned char> otherIdxs, std::span<unsigned char> defenceIdxs,
std::span<unsigned char> resourceIdxs, std::span<unsigned char> techIdxs,
std::span<unsigned char> unitsIdxs, std::span<unsigned char> typesIdxs) {
assert(validateSpan(__LINE__, __FILE__, newValues));
assert(validateSpan(__LINE__, __FILE__, newValuesForSum));
valuesNormForSum.insert(valuesNormForSum.end(), newValuesForSum.begin(), newValuesForSum.end());
valuesNormAsVal = std::valarray(newValues.data(), newValues.size());
setValarray(otherNormAsVal, otherIdxs); //TODO bug czy to jest zainicjowane
setValarray(defenceNormAsVal, defenceIdxs);
setValarray(resourceNormAsVal, resourceIdxs);
setValarray(techNormAsVal, techIdxs);
setValarray(unitsNormAsVal, unitsIdxs);
setValarray(typesNormAsVal, typesIdxs);
}
const std::valarray<float>& getValuesNormAsValForType(ParentBuildingType type) const {
switch (type) {
case ParentBuildingType::OTHER:
return otherNormAsVal;
case ParentBuildingType::DEFENCE:
return defenceNormAsVal;
case ParentBuildingType::RESOURCE:
return resourceNormAsVal;
case ParentBuildingType::TECH:
return techNormAsVal;
case ParentBuildingType::UNITS:
return unitsNormAsVal;
default: ;
}
}
};
struct db_level {
const char level;
explicit db_level(char level)
: level(level) {
}
};
struct db_with_hp {
const unsigned short maxHp;
const float invMaxHp;
const float armor;
explicit db_with_hp(unsigned short maxHp, float armor)
: maxHp(maxHp), invMaxHp(1.f / maxHp), armor(armor) {
}
};
struct db_base : db_with_hp {
const float sightRadius;
const float sqSightRadius;
const float interestRange;
const float sqInterestRange;
db_base(unsigned short maxHp, float armor, float sightRadius)
: db_with_hp(maxHp, armor), sightRadius(sightRadius), sqSightRadius(sightRadius * sightRadius),
interestRange(sightRadius * 0.8f), sqInterestRange(interestRange * interestRange) {
}
};
struct db_with_model {
float modelHeight = -1.f;
};
struct db_build_upgrade {
short buildTime = -1;
short upgradeTime = -1;
db_build_upgrade(short buildTime, short upgradeTime)
: buildTime(buildTime), upgradeTime(upgradeTime) {
}
};
struct db_unit_metric : db_basic_metric {
db_unit_metric(const std::vector<float>& newValues, const std::vector<float>& newValuesForSum,
std::span<unsigned char> typesIdxs) {
assert(validateSpan(__LINE__, __FILE__, newValues));
assert(validateSpan(__LINE__, __FILE__, newValuesForSum));
valuesNormForSum.insert(valuesNormForSum.end(), newValuesForSum.begin(), newValuesForSum.end());
valuesNormAsVal = std::valarray(newValues.data(), newValues.size());
setValarray(typesNormAsVal, typesIdxs);
}
};
struct db_unit_level : db_with_name, db_level, db_with_cost, db_unit_attack, db_base, db_with_model,
db_build_upgrade {
const unsigned short unit;
const float minDist;
const float maxSep;
const float mass;
const float invMass;
const float maxSpeed;
const float minSpeed;
const float maxForce;
const float sqMinSpeed;
const Urho3D::String node;
db_unit_metric* dbUnitMetric = nullptr; //TODO jak to zrobic
db_unit_level(short id, short level, short unit, char* name, char* node, short buildTime, short upgradeTime,
float minDist, float mass, float minSpeed, float maxSpeed, int maxForce,
short maxHp, float armor, float sightRng, float collect, float atck, float atckRld, short atckRng,
float bI, float bR, float bC, float bW, float bS, float bM, float bH, float bL, float bB):
db_with_name(id, name), db_level(level),
db_unit_attack(collect, atck, atckRld, atckRng, bI, bR, bC, bW, bS, bM, bH, bL, bB),
db_base(maxHp, armor, sightRng), db_build_upgrade(buildTime, upgradeTime),
unit(unit),
minDist(minDist),
maxSep(1.f),
node(node),
mass(mass),
invMass(1 / mass),
maxSpeed(maxSpeed),
minSpeed(minSpeed),
maxForce(maxForce),
sqMinSpeed(minSpeed * minSpeed) {
}
void finish(const std::vector<float>& newValues, const std::vector<float>& newValuesForSum,
std::span<unsigned char> valuesUnitsTypesIdxs) {
dbUnitMetric = new db_unit_metric(newValues, newValuesForSum, valuesUnitsTypesIdxs);
}
~db_unit_level() {
delete dbUnitMetric;
}
};
struct db_unit : db_with_icon, db_with_cost {
const UnitState actionState;
const bool typeInfantry;
const bool typeRange;
const bool typeCalvary;
const bool typeWorker;
const bool typeSpecial;
const bool typeMelee;
const bool typeHeavy;
const bool typeLight;
std::vector<db_unit_level*> levels;
std::vector<db_nation*> nations;
std::vector<unsigned char> ordersIds;
bool possibleStates[magic_enum::enum_count<UnitState>()];
db_unit(short id, char* name, char* icon, char actionState, bool typeInfantry, bool typeRange,
bool typeCalvary, bool typeWorker, bool typeSpecial, bool typeMelee, bool typeHeavy, bool typeLight) :
db_with_icon(id, name, icon),
actionState(UnitState(actionState)),
typeInfantry(typeInfantry),
typeRange(typeRange),
typeCalvary(typeCalvary),
typeWorker(typeWorker),
typeSpecial(typeSpecial),
typeMelee(typeMelee),
typeHeavy(typeHeavy),
typeLight(typeLight) {
}
std::optional<db_unit_level*> getLevel(short level) {
if (levels.size() > level) {
return levels.at(level);
}
return {};
}
float getBonuses(db_unit_attack* dbLevel) const {
return typeInfantry * dbLevel->bonusInfantry +
typeRange * dbLevel->bonusRange +
typeCalvary * dbLevel->bonusCalvary +
typeWorker * dbLevel->bonusWorker +
typeSpecial * dbLevel->bonusSpecial +
typeMelee * dbLevel->bonusMelee +
typeHeavy * dbLevel->bonusHeavy +
typeLight * dbLevel->bonusLight;
}
};
struct db_building : db_with_icon, db_with_cost, db_static {
bool typeCenter;
bool typeHome;
bool typeDefence;
bool typeResourceFood;
bool typeResourceWood;
bool typeResourceStone;
bool typeResourceGold;
bool typeTechBlacksmith;
bool typeTechUniversity;
bool typeUnitBarracks;
bool typeUnitRange;
bool typeUnitCavalry;
bool typeResourceAny;
std::vector<char> resourceTypes;
bool hasResourceType[RESOURCES_SIZE];
bool parentType[magic_enum::enum_count<ParentBuildingType>()];
std::vector<db_building_level*> levels;
std::vector<db_nation*> nations;
db_building(short id, char* name, char* icon, short sizeX, short sizeZ,
bool typeCenter, bool typeHome, bool typeDefence, bool typeResourceFood, bool typeResourceWood,
bool typeResourceStone, bool typeResourceGold, bool typeTechBlacksmith, bool typeTechUniversity,
bool typeUnitBarracks, bool typeUnitRange, bool typeUnitCavalry)
: db_with_icon(id, name, icon), db_static({sizeX, sizeZ}),
typeCenter(typeCenter), typeHome(typeHome), typeDefence(typeDefence),
typeResourceFood(typeResourceFood), typeResourceWood(typeResourceWood),
typeResourceStone(typeResourceStone), typeResourceGold(typeResourceGold),
typeTechBlacksmith(typeTechBlacksmith), typeTechUniversity(typeTechUniversity),
typeUnitBarracks(typeUnitBarracks), typeUnitRange(typeUnitRange), typeUnitCavalry(typeUnitCavalry),
typeResourceAny(typeResourceFood || typeResourceWood || typeResourceStone || typeResourceGold) {
hasResourceType[0] = typeResourceFood;
hasResourceType[1] = typeResourceWood;
hasResourceType[2] = typeResourceStone;
hasResourceType[3] = typeResourceGold;
if (typeResourceFood) { resourceTypes.push_back(0); }
if (typeResourceWood) { resourceTypes.push_back(1); }
if (typeResourceStone) { resourceTypes.push_back(2); }
if (typeResourceGold) { resourceTypes.push_back(3); }
parentType[cast(ParentBuildingType::OTHER)] = typeCenter || typeHome;
parentType[cast(ParentBuildingType::DEFENCE)] = typeDefence;
parentType[cast(ParentBuildingType::RESOURCE)]
= typeResourceFood || typeResourceWood || typeResourceStone || typeResourceGold;
parentType[cast(ParentBuildingType::TECH)] = typeTechBlacksmith || typeTechUniversity;
parentType[cast(ParentBuildingType::UNITS)] = typeUnitBarracks || typeUnitRange || typeUnitCavalry;
}
std::optional<db_building_level*> getLevel(short level) {
if (levels.size() > level) {
return levels.at(level);
}
return {};
}
};
struct db_building_level : db_with_name, db_with_cost, db_level, db_base, db_building_attack,
db_with_model, db_build_upgrade {
const short building;
const short queueMaxCapacity;
const float resourceRange;
const Urho3D::String nodeName;
std::vector<db_unit*> allUnits;
std::vector<std::vector<db_unit*>*> unitsPerNation;
std::vector<std::vector<unsigned char>*> unitsPerNationIds; //TODO remember must be storted
//std::vector<db_building_metric*> dbBuildingMetricPerNation;
db_building_metric* dbBuildingMetric;
db_building_level(short id, short level, short building, char* name, char* nodeName, short queueMaxCapacity,
short buildSpeed, short upgradeSpeed, short maxHp, float armor, float sightRng,
float collect, float atckR, short atckRRld, float atckRRng, float resourceRng)
: db_with_name(id, name), db_level(level),
db_building_attack(collect, atckR, atckRRld, atckRRng),
db_base(maxHp, armor, sightRng), db_build_upgrade(buildSpeed, upgradeSpeed),
building(building), nodeName(nodeName), queueMaxCapacity(queueMaxCapacity), resourceRange(resourceRng) {
}
~db_building_level() {
clear_vector(unitsPerNation);
clear_vector(unitsPerNationIds);
delete dbBuildingMetric;
//clear_vector(dbBuildingMetricPerNation);
}
void finish(const std::vector<float>& newValues, const std::vector<float>& newValuesForSum,
std::span<unsigned char> valuesOtherIdxs, std::span<unsigned char> valuesDefenceIdxs,
std::span<unsigned char> valuesResourceIdxs, std::span<unsigned char> valuesTechIdxs,
std::span<unsigned char> valuesUnitsIdxs, std::span<unsigned char> typesIdxs) {
dbBuildingMetric = new db_building_metric(newValues, newValuesForSum, valuesOtherIdxs, valuesDefenceIdxs,
valuesResourceIdxs, valuesTechIdxs, valuesUnitsIdxs, typesIdxs);
}
};
struct db_nation : db_with_name {
std::vector<db_unit*> units;
std::vector<db_unit*> workers;
std::vector<db_building*> buildings;
std::vector<std::string> actionPrefix;
std::vector<std::string> orderPrefix;
db_nation(short id, char* name, char* actionPrefix, char* orderPrefix)
: db_with_name(id, name),
actionPrefix(split(actionPrefix, SPLIT_SIGN)),
orderPrefix(split(orderPrefix, SPLIT_SIGN)) {
}
std::vector<std::string> splitAi(std::string* param) const {
return split(split(param[id], SPLIT_SIGN_2)[SimGlobals::CURRENT_RUN], SPLIT_SIGN);
}
void refresh() {
assert(id<MAX_PLAYERS); //TODO BUG to sa troszke inne rzeczy
if (!SimGlobals::ACTION_AI_PATH[id].empty()) {
actionPrefix = splitAi(SimGlobals::ACTION_AI_PATH);
}
if (!SimGlobals::ORDER_AI_PATH[id].empty()) {
orderPrefix = splitAi(SimGlobals::ORDER_AI_PATH);
}
}
};
struct db_resource : db_with_icon, db_static, db_with_hp, db_with_model {
const short maxUsers;
const unsigned mini_map_color;
Urho3D::Vector<Urho3D::String> nodeName;
db_resource(short id, char* name, char* icon, unsigned short maxHp, char* nodeName, short sizeX,
short sizeZ, short maxUsers, unsigned mini_map_color)
: db_with_icon(id, name, icon), db_static({sizeX, sizeZ}), db_with_hp(maxHp, 0.f),
nodeName(Urho3D::String(nodeName).Split(SPLIT_SIGN)),
maxUsers(maxUsers),
mini_map_color(mini_map_color) {
}
};
```
AttackState.h
```#pragma once
#include "Game.h"
#include "database/db_strcut.h"
#include "State.h"
#include "StateManager.h"
#include "StateUtils.h"
#include "objects/unit/ActionParameter.h"
#include "objects/unit/Unit.h"
#include "UnitState.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "env/Environment.h"
class AttackState : public State {
public:
AttackState(): State({
UnitState::STOP, UnitState::DEFEND, UnitState::DEAD,
UnitState::GO, UnitState::FOLLOW, UnitState::CHARGE
}) { }
~AttackState() = default;
bool canStart(Unit* unit, const ActionParameter& parameter) override {
if (parameter.isThingAlive()) {
auto const indexesToUse = parameter.thingToInteract->getIndexesForUse(unit);
return std::ranges::find(indexesToUse, unit->getMainGridIndex()) != indexesToUse.end()
&& parameter.thingToInteract->belowCloseLimit() > 0;
}
return false;
}
void setData(Unit* unit, int found, Physical* const thing) {
setStartData(unit, found, thing);
if (thing->getType() == ObjectType::UNIT) {
setSlotData(unit, found, thing);
}
}
void onStart(Unit* unit, const ActionParameter& parameter) override {
auto const indexesToUse = parameter.thingToInteract->getIndexesForUse(unit);
const auto found = std::ranges::find(indexesToUse, unit->getMainGridIndex());
assert(found != indexesToUse.end());
unit->currentFrameState = 0;
setData(unit, *found, parameter.thingToInteract);
unit->maxSpeed = unit->dbLevel->maxSpeed / 2;
Game::getEnvironment()->updateCell(unit->getMainGridIndex(), 1, CellState::ATTACK);
}
void onEnd(Unit* unit) override {
reduce(unit, unit->thingToInteract);
unit->maxSpeed = unit->dbLevel->maxSpeed;
}
void reduce(Unit* unit, Physical* first) {
if (unit->isFirstThingAlive()) {
first->reduceClose();
first->setOccupiedIndexSlot(unit->slotToInteract, false);
}
if (unit->indexToInteract > 0) {
Game::getEnvironment()->updateCell(unit->indexToInteract, -1, CellState::NONE);
}
unit->thingToInteract = nullptr;
unit->indexToInteract = -1;
}
void execute(Unit* unit, float timeStep) override {
if (!unit->isFirstThingAlive()) {
StateManager::toDefaultState(unit);
return;
}
const auto first = unit->thingToInteract;
if (unit->indexChanged() || first->indexChanged()) {
reduce(unit, first);
auto const indexesToUse = first->getIndexesForUse(unit);
const auto found = std::ranges::find(indexesToUse, unit->getMainGridIndex());
if (found != indexesToUse.end()) {
setData(unit, *found, first);
} else {
StateManager::toDefaultState(unit);
return;
}
}
if (unit->currentFrameState >= unit->dbLevel->attackReload) {
const auto val = unit->getAttackVal(unit);
const auto [value, died] = first->absorbAttack(val);
Game::getEnvironment()->addAttack(unit->getPlayer(), first->getPosition(), value);
if (died) {
Game::getPlayersMan()->getPlayer(unit->getPlayer())->addKilled(first);
}
unit->currentFrameState = 0;
}
++unit->currentFrameState;
}
};
```
GridCalculatorProvider.cpp
```#include "GridCalculatorProvider.h"
#include "utils/DeleteUtils.h"
#include "GridCalculator.h"
std::vector<GridCalculator*> GridCalculatorProvider::calculators;
GridCalculatorProvider::~GridCalculatorProvider() {
clear_vector(calculators);
}
GridCalculator* GridCalculatorProvider::get(unsigned short resolution, float size) {
for (auto calculator : calculators) {
if (calculator->getResolution() == resolution) {
return calculator;
}
}
auto* const calculator = new GridCalculator(resolution, size);
calculators.push_back(calculator);
return calculator;
}
```
ScorePanel.cpp
```#include "ScorePanel.h"
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
#include "player/Player.h"
ScorePanel::ScorePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style)
: SimplePanel(root, _style, "ScorePanel", {
GameState::RUNNING, GameState::PAUSE
}) {}
void ScorePanel::update(const std::vector<Player*>& players) const {
Urho3D::String s = "";
for (auto player : players) {
s.Append(player->getName())
.Append(" - ")
.Append(Urho3D::String(player->getScore()))
.Append("\n");
}
text->SetText(s);
}
void ScorePanel::createBody() {
text = addChildText(window, "MyText", style);
}
```
CloseIndexesProvider.cpp
```#include "CloseIndexesProvider.h"
#include "CloseIndexes.h"
#include "utils/DeleteUtils.h"
std::vector<CloseIndexes*> CloseIndexesProvider::closeIndexeses;
CloseIndexesProvider::~CloseIndexesProvider() {
clear_vector(closeIndexeses);
}
CloseIndexes* CloseIndexesProvider::get(unsigned short resolution) {
for (auto cache : closeIndexeses) {
if (cache->getResolution() == resolution) {
return cache;
}
}
auto* const cache = new CloseIndexes(resolution);
closeIndexeses.push_back(cache);
return cache;
}
```
ColorPaletteRepo.cpp
```#include "ColorPaletteRepo.h"
#include <Urho3D/Graphics/Material.h>
#include <Urho3D/Resource/ResourceCache.h>
#include "ColorPallet.h"
#include "Game.h"
#include "database/db_strcut.h"
#include "math/MathUtils.h"
#include "objects/CellState.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "simulation/SimGlobals.h"
#include "env/Environment.h"
ColorPaletteRepo::ColorPaletteRepo() {
if (!SIM_GLOBALS.HEADLESS) {
lineMaterial = Game::getCache()->GetResource<Urho3D::Material>("Materials/line.xml");
influenceMaterial = Game::getCache()->GetResource<Urho3D::Material>("Materials/influence.xml");
for (int i = 0; i < SPECTRUM_RESOLUTION; ++i) {
basicSpectrum[i] = Urho3D::Color(0.1, i * (1.0f / SPECTRUM_RESOLUTION), 0.1, 0.5);
}
basicSpectrum[SPECTRUM_RESOLUTION] = basicSpectrum[SPECTRUM_RESOLUTION - 1];
}
}
Urho3D::Color& ColorPaletteRepo::getColor(float value, float maxValue) {
value = fixValue(value, maxValue);
const int index = value / maxValue * SPECTRUM_RESOLUTION;
return basicSpectrum[index];
}
Urho3D::Material* ColorPaletteRepo::getLineMaterial() const {
return lineMaterial;
}
Urho3D::Material* ColorPaletteRepo::getInfluenceMaterial() const {
return influenceMaterial;
}
std::tuple<bool, Urho3D::Color> ColorPaletteRepo::getInfoForGrid(CellState state) const {
switch (state) {
case CellState::NONE: return {false, Urho3D::Color(0, 0, 0, 0)};
case CellState::ATTACK: return {true, Urho3D::Color::RED};
case CellState::COLLECT: return {true, Urho3D::Color::YELLOW};
case CellState::RESOURCE: return {true, Urho3D::Color::GREEN};
case CellState::BUILDING: return {true, Urho3D::Color::BLUE};
case CellState::DEPLOY: return {true, Urho3D::Color::CYAN};
default: ;
}
}
Urho3D::Color ColorPaletteRepo::getCircleColor(db_building* dbBuilding) const {
if (dbBuilding->typeDefence) {
return Urho3D::Color::BLACK;
}
if (dbBuilding->typeResourceWood) {
return Urho3D::Color(0x00654321, Urho3D::Color::ARGB);
}
if (dbBuilding->typeResourceStone) {
return Urho3D::Color::GRAY;
}
if (dbBuilding->typeResourceGold) {
return Urho3D::Color::YELLOW;
}
return Urho3D::Color::CYAN;
}
Urho3D::Color ColorPaletteRepo::getColorForValidation(const db_building* building, Urho3D::Vector2& hitPos) const{
const Environment* env = Game::getEnvironment();
if (env->validateStatic(building->size, hitPos, true)) {
if (env->isVisible(Game::getPlayersMan()->getActivePlayerID(), hitPos)) {
if (Game::getPlayersMan()->getActivePlayer()->getResources().hasEnough(building->costs)) {
return Urho3D::Color::GREEN;
}
return Urho3D::Color(0.7, 0.4, 0.1);
}
return Urho3D::Color(0.7, 0.2, 0.1);
}
return Urho3D::Color::RED;
}
```
BucketIterator.h
```#pragma once
#include <vector>
class Grid;
class Physical;
class BucketIterator {
public:
BucketIterator() = default;
~BucketIterator() = default;
BucketIterator(const BucketIterator&) = delete;
Physical* next();
void setRange();
BucketIterator* init(std::vector<short>* _levels, int _center, Grid* _bucketGrid);
private:
std::vector<short>::const_iterator index;
std::vector<short>::const_iterator levelSize;
int center;
std::vector<short>* levels;
Grid* bucketGrid;
std::vector<Physical*>::const_iterator currentIterator;
std::vector<Physical*>::const_iterator currentEnd;
};
```
Main.h
```#pragma once
#include <span>
#include <Urho3D/Engine/Application.h>
#include "Benchmark.h"
#include "GameState.h"
#include "Loading.h"
#include "control/HealthBarProvider.h"
#include "debug/DebugManager.h"
#include "scene/load/SceneLoader.h"
#include "scene/save/SceneSaver.h"
class SimInfo;
namespace Urho3D {
class Context;
enum MouseMode;
}
enum class CameraBehaviorType : char;
struct NewGameForm;
class Controls;
class Hud;
class LevelBuilder;
class SelectedInfo;
class Simulation;
class ObjectsInfo;
class Main : public Urho3D::Application {
URHO3D_OBJECT(Main, Application)
explicit Main(Urho3D::Context* context);
void Setup() override;
void Start() override;
void Stop() override;
void HandleUpdate(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
protected:
void InitMouseMode(Urho3D::MouseMode mode);
void SetupViewport();
private:
void disposeScene();
void SetWindowTitleAndIcon();
void subscribeToUIEvents();
void subscribeToEvents();
void HandleMouseModeRequest(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleMouseModeChange(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleKeyDown(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleKeyUp(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleNewGame(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleLoadGame(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleCloseGame(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleSaveScene(Urho3D::StringHash, Urho3D::VariantMap& eventData);
void HandleLeftMenuButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleSelectedButton(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void InitLocalizationSystem() const;
SelectedInfo* control(float timeStep, SimInfo* simulationInfo);
void readParameters();
void miniReadParameters() const;
void changeCamera(CameraBehaviorType type);
void load(const Urho3D::String& saveName, NewGameForm* form);
void createEnv(unsigned short mainMapResolution) const;
void save(const Urho3D::String& name);
void running(double timeStep);
void createSimulation();
static void setSimpleManagers();
void updateProgress(Loading& progress) const;
void changeState(GameState newState);
void writeOutput(std::initializer_list<const std::function<float(Player*)>> funcs1,
std::initializer_list<const std::function<std::span<float>(Player*)>> funcs2) const;
void writeOutput() const;
void setCameraPos() const;
Simulation* simulation{};
Hud* hud{};
Controls* controls{};
LevelBuilder* levelBuilder{};
Benchmark benchmark;
SceneSaver saver;
SceneLoader loader;
Loading loadingProgress;
HealthBarProvider healthBarProvider;
DebugManager debugManager;
GameState gameState;
Urho3D::MouseMode useMouseMode_;
bool inited = false;
short coefToEdit = 0;
int timeLimit = 600;
NewGameForm* newGameForm;
Urho3D::String saveToLoad = "quicksave.db";
Urho3D::String outputName = "test.txt";
};
```
RandGen.cpp
```#include "RandGen.h"
#include <ctime>
#include <iostream>
#include <random>
#include "utils/OtherUtils.h"
RandGen* RandGen::instance = nullptr;
void RandGen::init(bool isRandom) {
if (instance == nullptr) {
instance = new RandGen();
}
resetIndexes();
std::mt19937 gen(isRandom ? time(0) : 2);
std::uniform_real_distribution disFloat(0.0, 1.0);
for (float& j : instance->dataFloat) {
j = disFloat(gen);
}
std::uniform_int_distribution disInt(0, INT32_MAX);
for (int& j : instance->dataInt) {
j = disInt(gen);
}
}
void RandGen::dispose() {
delete instance;
}
void RandGen::reset(bool isRandom) {
if (isRandom) {
init(true);
} else {
resetIndexes();
}
}
void RandGen::resetIndexes() {
std::fill_n(instance->indexesFloat, magic_enum::enum_count<RandFloatType>(), 0);
std::fill_n(instance->indexesInt, magic_enum::enum_count<RandIntType>(), 0);
}
float RandGen::nextRand(RandFloatType type, float max) {
const auto id = cast(type);
instance->indexesFloat[id]++;
instance->indexesFloat[id] = instance->indexesFloat[id] % RAND_TAB_SIZE;
return instance->dataFloat[instance->indexesFloat[id]] * max;
}
int RandGen::nextRand(RandIntType type, int max) {
const auto id = cast(type);
instance->indexesInt[id]++;
instance->indexesInt[id] = instance->indexesInt[id] % RAND_TAB_SIZE;
return instance->dataInt[instance->indexesInt[id]] % max;
}
```
MainMenuSettingsPanel.h
```#pragma once
#include "hud/window/main_menu/MainMenuDetailsPanel.h"
namespace Urho3D {
class BorderImage;
class CheckBox;
class DropDownList;
class Button;
}
constexpr char SETTINGS_ROWS_NUMBER = 9;
struct SettingsForm;
class MainMenuSettingsPanel : public MainMenuDetailsPanel {
public:
MainMenuSettingsPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title);
~MainMenuSettingsPanel();
void setValues(int graphID) const;
private:
void createBody() override;
void populateLabels(int index, const Urho3D::String& name);
void popualateForm(SettingsForm* form) const;
void HandleChangeSettings(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
void HandleSaveSettings(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData);
Urho3D::BorderImage* rows[SETTINGS_ROWS_NUMBER];
Urho3D::Button* save;
Urho3D::DropDownList* settings;
Urho3D::DropDownList* resolution;
Urho3D::CheckBox* fullScreen;
Urho3D::DropDownList* maxFps;
Urho3D::DropDownList* minFps;
Urho3D::CheckBox* vSync;
Urho3D::DropDownList* textureQuality;
Urho3D::CheckBox* shadow;
Urho3D::DropDownList* hudSize;
SettingsForm* data;
};
```
SimInfo.h
```#pragma once
struct FrameInfo;
class ObjectsInfo;
class SimInfo {
public:
SimInfo();
~SimInfo();
const ObjectsInfo* getObjectsInfo() const { return objectsInfo; }
const FrameInfo* getFrameInfo() const { return frameInfo; }
void setObjectsInfo(ObjectsInfo* objectsInfo) { this->objectsInfo = objectsInfo; }
void setIsRealFrame(bool realFrame) const;
void setFrame(unsigned char currentFrame, unsigned secondsElapsed) const;
private:
ObjectsInfo* objectsInfo;
FrameInfo* frameInfo;
};
```
Player.cpp
```#include "player/Player.h"
#include "Game.h"
#include "database/DatabaseCache.h"
#include "objects/queue/QueueActionType.h"
#include "env/Environment.h"
Player::Player(int nationId, char team, char id, int color, Urho3D::String name, bool active):
queue(new QueueManager(1)), dbNation(Game::getDatabase()->getNation(nationId)),
actionMaker(this, dbNation), orderMaker(this, dbNation),
name(std::move(name)), team(team),
color(color), id(id), active(active), possession(nationId) {
unitLevels = new char[Game::getDatabase()->getUnits().size()];
buildingLevels = new char[Game::getDatabase()->getBuildings().size()];
std::fill_n(unitLevels, Game::getDatabase()->getUnits().size(), 0);
std::fill_n(buildingLevels, Game::getDatabase()->getBuildings().size(), 0);
}
Player::~Player() {
delete[] unitLevels;
delete[] buildingLevels;
delete queue;
}
std::string Player::getValues(int precision) const {
return std::to_string(id) + ","
+ std::to_string(active) + ","
+ std::to_string(team) + ","
+ std::to_string(dbNation->id) + ",'"
+ name.CString() + "','"
+ std::to_string(color) + "'";
}
void Player::setResourceAmount(int resource, float amount) {
resources.setValue(resource, amount);
}
void Player::setResourceAmount(float amount) {
resources.init(amount);
}
char Player::upgradeLevel(QueueActionType type, int id) const {
switch (type) {
case QueueActionType::UNIT_LEVEL:
if (Game::getDatabase()->getUnit(id)->levels.size() - 1 > unitLevels[id]) {
unitLevels[id]++;
return unitLevels[id];
}
break;
case QueueActionType::BUILDING_LEVEL:
if (Game::getDatabase()->getBuilding(id)->levels.size() - 1 > buildingLevels[id]) {
buildingLevels[id]++;
return buildingLevels[id];
}
break;
case QueueActionType::UNIT_UPGRADE:
break;
default: ;
}
return -1;
}
db_unit_level* Player::getLevelForUnit(short id) const {
return Game::getDatabase()->getUnit(id)->getLevel(unitLevels[id]).value();
}
db_building_level* Player::getLevelForBuilding(short id) const {
return Game::getDatabase()->getBuilding(id)->getLevel(buildingLevels[id]).value();
}
std::optional<db_unit_level*> Player::getNextLevelForUnit(short id) const {
return Game::getDatabase()->getUnit(id)->getLevel(unitLevels[id] + 1);
}
std::optional<db_building_level*> Player::getNextLevelForBuilding(short id) const {
return Game::getDatabase()->getBuilding(id)->getLevel(buildingLevels[id] + 1);
}
void Player::addKilled(Physical* physical) {
possession.addKilled(physical);
}
void Player::resetScore() {
score = -1;
}
void Player::updateResource() const {
resources.resetStats();
}
void Player::updatePossession(const ObjectsInfo* simInfo) {
possession.updateAndClean(resources, simInfo);
}
void Player::add(Unit* unit) {
possession.add(unit);
}
void Player::add(Building* building) {
possession.add(building);
}
int Player::getScore() {
if (score < 0) {
const float visibilityPercent = Game::getEnvironment()->getVisibilityScore(id);
score = possession.getScore() + visibilityPercent * 1000.f;
}
return score;
}
int Player::getWorkersNumber() const {
return possession.getWorkersNumber();
}
QueueElement* Player::updateQueue() const {
return queue->update();
}
QueueManager* Player::getQueue() const {
return queue;
}
void Player::aiAction() {
actionMaker.action();
}
void Player::aiOrder() {
orderMaker.action();
}
```
QueuePanel.cpp
```#include "QueuePanel.h"
#include <Urho3D/Graphics/Texture2D.h>
#include <Urho3D/Input/InputEvents.h>
#include <Urho3D/Resource/ResourceCache.h>
#include <Urho3D/ui/button.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "GameState.h"
#include "QueueHudElement.h"
#include "control/SelectedInfo.h"
#include "control/SelectedInfoType.h"
#include "database/DatabaseCache.h"
#include "objects/NamesCache.h"
#include "objects/building/Building.h"
#include "objects/queue/AbstractQueueManager.h"
#include "objects/queue/QueueElement.h"
QueuePanel::QueuePanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style) : EventPanel(root, _style, "QueueWindow",
{GameState::RUNNING, GameState::PAUSE}) {
elements = new QueueHudElement*[MAX_ICON_SELECTION];
}
QueuePanel::~QueuePanel() {
clear_array(elements, MAX_ICON_SELECTION);
delete[] elements;
}
void QueuePanel::update(AbstractQueueManager* queue, short& j) const {
const short size = Urho3D::Min(queue->getSize(), MAX_ICON_SELECTION);
for (int i = 0; i < size; ++i) {
QueueElement* element = queue->getAt(i);
elements[j]->show();
auto name = getIconName(element->getType(), element->getAmount(), element->getId());
auto texture = Game::getCache()->GetResource<Urho3D::Texture2D>("textures/hud/icon/" + name);
if (element->getMaxCapacity() > 1) {
elements[j]->
setText(Urho3D::String(element->getAmount()) + "/" + Urho3D::String(element->getMaxCapacity()));
} else {
elements[j]->hideText();
}
elements[j]->setTexture(texture);
elements[j]->setProgress(element->getProgress());
elements[j]->setData(element);
++j;
}
}
void QueuePanel::show(SelectedInfo* selectedInfo) {
//TODO tu moga byc problemy przy duzej ilosci
setVisible(true);
update(selectedInfo);
}
void QueuePanel::show(AbstractQueueManager* queue) {
short j = 0;
update(queue, j);
finish(j);
}
void QueuePanel::update(SelectedInfo* selectedInfo) {
//TODO wykonuje sie nawet jeśli sie nic nie zmieniło
short j = 0;
if (window->IsVisible()) {
for (auto infoType : selectedInfo->getSelectedTypes()) {
for (Physical* physical : infoType->getData()) {
//TODO przeniesc kolejke do Physical
const auto building = dynamic_cast<Building*>(physical);
update(building->getQueue(), j);
}
}
}
finish(j);
}
void QueuePanel::finish(int from) {
for (int i = from; i < MAX_ICON_SELECTION; ++i) {
elements[i]->hide();
}
if (from == 0) {
setVisible(false);
} else {
setVisible(true);
}
}
void QueuePanel::createBody() {
for (int i = 0; i < MAX_ICON_SELECTION; ++i) {
elements[i] = new QueueHudElement(window, style);
SubscribeToEvent(elements[i]->getButton(), Urho3D::E_CLICK, URHO3D_HANDLER(QueuePanel, HandleReduce));
}
}
void QueuePanel::HandleReduce(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto qHudElement = QueueHudElement::getFromElement(eventData);
if (eventData[Urho3D::UIMouseClick::P_BUTTON].GetInt() == Urho3D::MOUSEB_LEFT) {
qHudElement->reduce(1);
} else {
qHudElement->reduce(10);
}
}
```
IndividualOrder.cpp
```#include "IndividualOrder.h"
#include "Game.h"
#include "database/db_strcut.h"
#include "objects/unit/Unit.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "env/Environment.h"
#include "objects/unit/ActionParameter.h"
IndividualOrder::IndividualOrder(Unit* unit, UnitAction action, Urho3D::Vector2& vector, bool append):
UnitOrder(static_cast<short>(action), append, vector), unit(unit) {
}
IndividualOrder::IndividualOrder(Unit* unit, UnitAction action, Physical* toUse, bool append):
UnitOrder(static_cast<short>(action), append, toUse), unit(unit) {
}
bool IndividualOrder::expired() {
return unit == nullptr
|| toUse != nullptr && !toUse->isAlive();
}
bool IndividualOrder::add() {
unit->addOrder(this);
return false;
}
short IndividualOrder::getSize() const {
return 1;
}
void IndividualOrder::addCollectAim() {
followAndAct();
}
void IndividualOrder::addTargetAim() {
unit->action(static_cast<UnitAction>(id), getTargetAim(unit->getMainGridIndex(), *vector));
//TODO execute i akajca
unit->resetFormation();
Game::getEnvironment()->invalidatePathCache();
}
void IndividualOrder::addFollowAim() {
const auto indexes = toUse->getIndexesForUse(unit);
if (indexes.empty()) {
unit->action(static_cast<UnitAction>(id), getFollowAim(unit->getMainGridIndex(), indexes));
}
}
void IndividualOrder::addChargeAim() {
unit->action(static_cast<UnitAction>(id), getChargeAim(*vector));
}
void IndividualOrder::addAttackAim() {
followAndAct();
}
void IndividualOrder::addDefendAim() {
simpleAction();
}
void IndividualOrder::addDeadAim() {
simpleAction();
}
void IndividualOrder::addStopAim() {
simpleAction();
}
void IndividualOrder::simpleAction() const {
unit->action(static_cast<UnitAction>(id));
}
void IndividualOrder::followAndAct() {
//TODO to trzeba dobrze przemuśleć
std::vector<int> indexes = getIndexesToAct();
if (!indexes.empty()) {
const auto find = std::ranges::find(indexes, unit->getMainGridIndex());
if (find == indexes.end()) {
const auto param = getFollowAim(unit->getMainGridIndex(), indexes);
if (param.aim != nullptr) {
unit->action(UnitAction::FOLLOW, param);
unit->addOrder(new IndividualOrder(unit, UnitAction(id), toUse, true));
}
} else {
unit->action(static_cast<UnitAction>(id), ActionParameter(toUse));
}
}
}
std::vector<int> IndividualOrder::getIndexesToAct() const {
//TODO to coś przemyśleć
std::vector<int> indexes;
if (static_cast<UnitAction>(id) == UnitAction::ATTACK) {
if (unit->getDbUnit()->typeRange) {
if (toUse->belowRangeLimit()) {
indexes = toUse->getIndexesForRangeUse(unit);
}
}
}
if (indexes.empty()) {
//close and collect
indexes = toUse->getIndexesForUse(unit);
}
return indexes;
}
```
ActionParameter.cpp
```#include "ActionParameter.h"
#include "aim/Aim.h"
#include "objects/Physical.h"
bool ActionParameter::isThingAlive() const {
return thingToInteract != nullptr
&& thingToInteract->isUsable();
}
void ActionParameter::reset(const ActionParameter& actionParameter, bool withDelete) {
if (aim && withDelete) {
delete aim;
}
this->aim = actionParameter.aim;
this->thingToInteract = actionParameter.thingToInteract;
}
void ActionParameter::reset(bool withDelete) {
if (aim && withDelete) {
delete aim;
}
resetUsed();
}
void ActionParameter::resetUsed() {
this->aim = nullptr;
this->thingToInteract = nullptr;
}
```
FollowAim.h
```#pragma once
#include "Aim.h"
#include <vector>
class TargetAim;
class Physical;
class FollowAim : public Aim {
public:
explicit FollowAim(Physical* physical, TargetAim* subTarget);
~FollowAim();
std::vector<Urho3D::Vector3> getDebugLines(Unit* follower) const override;
Urho3D::Vector2 getDirection(Unit* follower) override;
bool ifReach(Unit* follower) override;
bool expired() override;
private:
Physical* physical;
TargetAim* subTarget;
float radiusSq;
};
```
AbstractQueueManager.h
```#pragma once
enum class QueueActionType : char;
class QueueElement;
class AbstractQueueManager {
public:
virtual ~AbstractQueueManager() = default;
virtual void add(short number, QueueActionType type, short id, unsigned short localMaxCapacity) =0;
virtual QueueElement* update() =0;
virtual short getSize() const =0;
virtual QueueElement* getAt(short i) =0;
};
```
AbstractCommand.h
```#pragma once
class AbstractCommand {
public:
virtual ~AbstractCommand() = default;
virtual void execute() =0;
virtual bool expired() { return false; }
virtual void clean() {}
protected:
explicit AbstractCommand(char player): player(player) { }
char player;
};
```
Simulation.cpp
```#include "Simulation.h"
#include "Game.h"
#include "SimulationObjectManager.h"
#include "camera/CameraManager.h"
#include "commands/upgrade/UpgradeCommand.h"
#include "debug/DebugLineRepo.h"
#include "debug/DebugUnitType.h"
#include "env/Environment.h"
#include "hud/window/main_menu/new_game/NewGameForm.h"
#include "objects/PhysicalUtils.h"
#include "objects/building/Building.h"
#include "objects/queue/QueueActionType.h"
#include "objects/queue/QueueElement.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/unit/SimColorMode.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "player/Player.h"
#include "player/PlayersManager.h"
#include "player/ai/ActionCenter.h"
#include "scene/load/dbload_container.h"
#include "scene/load/SceneLoader.h"
#include "scene/save/SceneSaver.h"
#include "simulation/formation/FormationManager.h"
#include "PerFrameAction.h"
#include "SimInfo.h"
#include "objects/projectile/ProjectileManager.h"
#include "objects/unit/order/OrderUtils.h"
Simulation::Simulation(Environment* enviroment): enviroment(enviroment) {
simObjectManager = new SimulationObjectManager();
Game::setActionCenter(new ActionCenter(simObjectManager));
colorScheme = SimColorMode::BASIC;
units = simObjectManager->getUnits();
buildings = simObjectManager->getBuildings();
resources = simObjectManager->getResources();
simInfo = new SimInfo();
DebugLineRepo::init(DebugLineType::UNIT_LINES);
}
Simulation::~Simulation() {
delete simObjectManager;
delete simInfo;
delete Game::getActionCenter();
Game::setActionCenter(nullptr);
}
void Simulation::clearNodesWithoutDelete() {
simObjectManager->clearNodesWithoutDelete();
}
void Simulation::forceUpdateInfluenceMaps() const {
enviroment->updateInfluenceUnits1(units);
enviroment->updateInfluenceUnits2(units);
enviroment->updateInfluenceResources(resources);
enviroment->updateInfluenceOther(buildings, units);
enviroment->updateQuadOther();
enviroment->updateVisibility(buildings, units, resources);
}
void Simulation::updateInfluenceMaps() const {
if (PER_FRAME_ACTION.get(PerFrameAction::INFLUENCE_UNITS_1, currentFrame, secondsElapsed)) {
enviroment->updateInfluenceUnits1(units);
}
if (PER_FRAME_ACTION.get(PerFrameAction::INFLUENCE_UNITS_2, currentFrame, secondsElapsed)) {
enviroment->updateInfluenceUnits2(units);
}
if (PER_FRAME_ACTION.get(PerFrameAction::INFLUENCE_RESOURCES, currentFrame, secondsElapsed)) {
enviroment->updateInfluenceResources(resources);
}
if (PER_FRAME_ACTION.get(PerFrameAction::INFLUENCE_OTHER, currentFrame, secondsElapsed)) {
enviroment->updateInfluenceOther(buildings, units);
}
if (PER_FRAME_ACTION.get(PerFrameAction::INFLUENCE_QUAD_OTHER, currentFrame, secondsElapsed)) {
enviroment->updateQuadOther();
}
if (PER_FRAME_ACTION.get(PerFrameAction::VISIBILITY, currentFrame, secondsElapsed)) {
enviroment->updateVisibility(buildings, units, resources);
}
}
SimInfo* Simulation::update(float timeStep) {
accumulateTime += updateTime(timeStep);
simInfo->setIsRealFrame(false);
while (accumulateTime >= TIME_PER_UPDATE) {
//simObjectManager->dispose();
//TODO bug a co jesli kilka razy sie wykona, moga być błędy jezeli cos umrze to poza petlą
simInfo->setFrame(currentFrame, secondsElapsed);
Game::getActionCenter()->executeLists();
selfAI();
aiPlayers();
Game::getActionCenter()->executeActions();
calculateForces();
applyForce(); //zmiany stanu
moveUnitsAndCheck(TIME_PER_UPDATE); //zmiany stanu
ProjectileManager::update(TIME_PER_UPDATE); //TODO czy to dobre miejsce? mogą tu ginać
performStateAction(TIME_PER_UPDATE); //tutaj moga umierac w tym zmiany stanu
executeStateTransition();
updateQueues();
updateInfluenceMaps(); //TODO odtad dalej mozna zrobic forka ?
simObjectManager->dispose();
simObjectManager->findToDispose();
simInfo->setObjectsInfo(simObjectManager->getInfo());
Game::getPlayersMan()->update(simInfo->getObjectsInfo());
Game::getFormationManager()->update();
accumulateTime -= TIME_PER_UPDATE;
countFrame();
}
return simInfo;
}
void Simulation::selfAI() const {
const bool ifSelfAction = PER_FRAME_ACTION.get(PerFrameAction::SELF_AI, currentFrame);
if (ifSelfAction) {
for (const auto unit : *units) {
if (isFree(unit)) {
if (StateManager::canChangeState(unit, unit->getActionState())) {
switch (unit->getActionState()) {
case UnitState::ATTACK:
case UnitState::SHOT:
tryToAttack(unit, getCondition(unit->getDbUnit()));
break;
case UnitState::COLLECT:
tryToCollect(unit);
break;
}
}
}
}
}
for (const auto building : *buildings) {
building->updateAi(ifSelfAction);
}
}
std::function<bool(Physical*)> Simulation::getCondition(db_unit* dbUnit) const {
if (dbUnit->typeRange) {
if (dbUnit->typeMelee) {
return belowCloseOrRange; //TODO bug? teraz to sie wyklucza?
}
return belowRange;
}
if (dbUnit->typeMelee) {
return belowClose;
}
return alwaysFalse;
}
void Simulation::loadEntities(SceneLoader& loader) const {
for (const auto unit : *loader.getData()->units) {
simObjectManager->load(unit);
}
for (const auto resource : *loader.getData()->resource_entities) {
simObjectManager->load(resource);
}
for (const auto building : *loader.getData()->buildings) {
simObjectManager->load(building);
}
}
void Simulation::addTestEntities() const {
if constexpr (UNITS_NUMBER > 0) {
//auto b = Urho3D::Vector2(0, 50);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 0.1f, 0, Urho3D::Vector2(0, 100), 0);
//Game::getActionCenter()->addUnits(60, 1, Urho3D::Vector2(-5, 25), 0);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 0.1f, 2, Urho3D::Vector2(0, 70), 1);
//Game::getActionCenter()->addUnits(30, 0, Urho3D::Vector2(0, 100), 0);
//Game::getActionCenter()->addUnits(10, 2, Urho3D::Vector2(0, 70), 1);
//Game::getActionCenter()->addBuilding(1, b, 1, true);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 0.5f, 1, Urho3D::Vector2(300, 212), 0);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 0.2f, 1, Urho3D::Vector2(290, 210), 0);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 10, 4, Urho3D::Vector2(10, 240), 1);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 300, 0, Urho3D::Vector2(10, 250), 1);
//Game::getActionCenter()->addUnits(UNITS_NUMBER*10, 4, Urho3D::Vector2(-20, -200), 1);
//Game::getActionCenter()->addUnits(UNITS_NUMBER * 5, 0, Urho3D::Vector2(-20, -20), 0);
//Game::getActionCenter()->addResource(1, b);
}
}
void Simulation::loadEntities(NewGameForm* form) const {
for (const auto& player : form->players) {
auto fejkPost = Urho3D::Vector2(); //TODO trzeba inne
simObjectManager->addUnits(10, 1, fejkPost, player.id, 0);
}
}
float Simulation::updateTime(float timeStep) const {
if (SIM_GLOBALS.BENCHMARK_MODE) {
return TIME_PER_UPDATE;
}
return timeStep;
}
void Simulation::countFrame() {
++currentFrame;
if (currentFrame >= FRAMES_IN_PERIOD) {
currentFrame = 0;
++secondsElapsed;
}
}
void Simulation::applyForce() const {
for (auto unit : *units) {
unit->applyForce(TIME_PER_UPDATE);
auto pos = unit->getPosition();
//TODO to przeniesc do mova? to moze byc [rpblem gdy jest przesuwanie poza klatką
const float y = enviroment->getGroundHeightAt(pos);
unit->updateHeight(y, TIME_PER_UPDATE);
}
}
void Simulation::levelUp(QueueElement* done, char player) const {
Game::getActionCenter()->add(new UpgradeCommand(
player,
done->getId(),
done->getType()
));
}
void Simulation::updateBuildingQueues() const {
for (const auto build : *buildings) {
const auto done = build->updateQueue();
if (done) {
switch (done->getType()) {
case QueueActionType::UNIT_CREATE: {
const auto center = enviroment->getCenter(build->getDeploy().value());
Game::getActionCenter()->addUnits(done->getAmount(),
done->getId(), center,
build->getPlayer());
}
break;
case QueueActionType::UNIT_LEVEL:
case QueueActionType::BUILDING_LEVEL:
case QueueActionType::UNIT_UPGRADE:
levelUp(done, build->getPlayer());
break;
case QueueActionType::BUILDING_CREATE:
build->complete();
}
delete done;
}
}
}
void Simulation::updateQueues() const {
updateBuildingQueues();
for (auto player : Game::getPlayersMan()->getAllPlayers()) {
const auto done = player->updateQueue();
if (done) {
switch (done->getType()) {
case QueueActionType::BUILDING_LEVEL:
levelUp(done, player->getId());
break;
}
delete done;
}
}
}
void Simulation::save(SceneSaver& saver) const {
saver.saveUnits(units);
saver.saveBuildings(buildings);
saver.saveResourceEntities(resources);
}
void Simulation::changeCoef(int i, int wheel) {
force.changeCoef(i, wheel);
}
void Simulation::changeColorMode(SimColorMode _colorMode) {
colorSchemeChanged = true;
colorScheme = _colorMode;
}
void Simulation::performStateAction(float timeStep) const {
for (auto unit : *units) {
StateManager::execute(unit, timeStep);
}
}
void Simulation::executeStateTransition() const {
StateManager::executeChange(units);
StateManager::executeChange(buildings);
StateManager::executeChange(resources);
}
void Simulation::initScene(SceneLoader& loader) const {
loadEntities(loader);
addTestEntities();
Game::getActionCenter()->executeLists();
}
void Simulation::initScene(NewGameForm* form) const {
loadEntities(form);
//addTestEntities();
Game::getActionCenter()->executeLists();
}
void Simulation::aiPlayers() const {
if (SIM_GLOBALS.NO_PLAYER_AI) { return; }
if (PER_FRAME_ACTION.get(PerFrameAction::AI_ACTION, currentFrame)) {
for (auto player : Game::getPlayersMan()->getAllPlayers()) {
if (SIM_GLOBALS.ALL_PLAYER_AI || Game::getPlayersMan()->getActivePlayer() != player) {
player->aiAction();
}
}
}
if (PER_FRAME_ACTION.get(PerFrameAction::AI_ORDER, currentFrame)) {
for (auto player : Game::getPlayersMan()->getAllPlayers()) {
if (SIM_GLOBALS.ALL_PLAYER_AI || Game::getPlayersMan()->getActivePlayer() != player) {
player->aiOrder();
}
}
}
}
void Simulation::moveUnitsAndCheck(const float timeStep) {
const auto camInfo = Game::getCameraManager()->getCamInfo(UPDATE_DRAW_DISTANCE);
for (auto unit : *units) {
const bool hasMoved = unit->move(timeStep, camInfo);
unit->checkAim();
if (hasMoved) {
enviroment->update(unit);
} else { unit->setBucket(-1); }
}
enviroment->invalidateCaches();
if (colorSchemeChanged || colorScheme != SimColorMode::BASIC) {
for (auto unit : *units) {
unit->changeColor(colorScheme);
}
colorSchemeChanged = false;
}
}
void Simulation::calculateForces() {
DebugLineRepo::clear(DebugLineType::UNIT_LINES);
DebugLineRepo::beginGeometry(DebugLineType::UNIT_LINES);
for (const auto unit : *units) {
auto& stats = force.stats();
if (!SIM_GLOBALS.HEADLESS) {
stats.vectorReset();
}
Urho3D::Vector2 newForce;
switch (unit->getState()) {
case UnitState::COLLECT:
force.inCell(newForce, unit);
break;
case UnitState::ATTACK: {
//TODO improve getMaxSeparationDistance powino sie dodac jeszcze minimal dist
const auto neighbours = enviroment->getNeighboursWithCache(unit, unit->getMaxSeparationDistance());
force.separationUnits(newForce, unit, neighbours);
force.inCell(newForce, unit);
}
break;
default: {
//TODO improve getMaxSeparationDistance powino sie dodac jeszcze minimal dist
const auto neighbours = enviroment->getNeighboursWithCache(unit, unit->getMaxSeparationDistance());
force.separationUnits(newForce, unit, neighbours);
force.separationObstacle(newForce, unit);
force.escapeFromInvalidPosition(newForce, unit);
force.destOrFormation(newForce, unit);
}
}
stats.result();
unit->setAcceleration(newForce);
if(!SIM_GLOBALS.HEADLESS) {
unit->debug(DebugUnitType::AIM, stats); //TODO przeniesc do Controls
}
}
DebugLineRepo::commit(DebugLineType::UNIT_LINES);
}
```
LevelCacheProvider.cpp
```#include "LevelCacheProvider.h"
#include "LevelCache.h"
#include "utils/DeleteUtils.h"
std::vector<LevelCache*> LevelCacheProvider::caches;
LevelCacheProvider::~LevelCacheProvider() {
clear_vector(caches);
}
LevelCache* LevelCacheProvider::get(unsigned short resolution, bool initCords, float maxDistance, GridCalculator* calculator) {
for (const auto cache : caches) {
if (cache->getResolution() == resolution && cache->getMaxDistance() == maxDistance) {
if (initCords) {
cache->initCordsFn();
}
return cache;
}
}
auto* const toReturn = new LevelCache(maxDistance, initCords, calculator);
caches.push_back(toReturn);
return toReturn;
}
```
FreeCameraBehave.cpp
```#include "FreeCameraBehave.h"
#include <Urho3D/Scene/Node.h>
#include <Urho3D/Input/Input.h>
FreeCameraBehave::FreeCameraBehave(): CameraBehave(Urho3D::Vector3(0.f, 50.f, -50.f), 3, "FreeCam") {
coefs[0] = 4.f;
coefs[1] = 1.f;
coefs[2] = 3.f;
coefs[3] = 3.f;
}
bool FreeCameraBehave::translate(bool cameraKeys[], int wheel, float timeStep, float min) {
return translateInternal(cameraKeys, timeStep, 1);
}
bool FreeCameraBehave::rotate(const Urho3D::IntVector2& mouseMove, const float mouse_sensitivity) {
if (mouseMove != Urho3D::IntVector2::ZERO) {
yaw += mouse_sensitivity * mouseMove.x_;
pitch += mouse_sensitivity * mouseMove.y_;
//pitch_ = Clamp(pitch_, -90.0f, 90.0f);
cameraNode->SetRotation(Urho3D::Quaternion(pitch, yaw, 0.0f));
return true;
}
return false;
}
Urho3D::MouseMode FreeCameraBehave::getMouseMode() {
return Urho3D::MM_RELATIVE;
}
```
GroupOrder.h
```#pragma once
#include <vector>
#include "UnitOrder.h"
enum class UnitActionType : char;
enum class UnitAction : char;
class Unit;
class GroupOrder : public UnitOrder {
public:
void addUnits(const std::vector<Physical*>& entities);
GroupOrder(const std::vector<Physical*>& entities, UnitActionType actionType, short id,
Physical* toUse, bool append = false);
GroupOrder(const std::vector<Physical*>& entities, UnitActionType actionType, short id,
Urho3D::Vector2 vector, bool append = false);
GroupOrder(std::vector<Unit*> entities, UnitActionType actionType, short id,
Urho3D::Vector2 vector, bool append = false);
GroupOrder(std::vector<Unit*> entities, UnitActionType actionType, short id,
Physical* toUse, bool append = false);
~GroupOrder() = default;
bool add() override;
bool expired() override;
short getSize() const override;
private:
std::vector<Unit*> units;
//TODO to trzeba kopiowac, ale wtedy trzeba sprawdzac przed wykonaniem
//czy cos sie nie zepsulo ale i tak cos takiego robie w formacji
const UnitActionType actionType;
//bool shouldDivide = false;
void addCollectAim() override;
void addTargetAim() override;
void addFollowAim() override;
void addChargeAim() override;
void addAttackAim() override;
void addDefendAim() override;
void addDeadAim() override;
void addStopAim() override;
void simpleAction(ActionParameter& parameter) const;
void simpleAction() const;
void actOnFormation(std::vector<Unit*>& group) const;
void transformToFormationOrder() const;
};
```
IndividualOrder.h
```#pragma once
#include "UnitOrder.h"
class Unit;
enum class UnitAction : char;
class IndividualOrder : public UnitOrder {
public:
IndividualOrder(Unit* unit, UnitAction action, Urho3D::Vector2& vector, bool append = false);
IndividualOrder(Unit* unit, UnitAction action, Physical* toUse, bool append = false);
~IndividualOrder() = default;
bool expired() override;
bool add() override;
short getSize() const override;
private:
void addCollectAim() override;
void addTargetAim() override;
void addFollowAim() override;
void addChargeAim() override;
void addAttackAim() override;
void addDefendAim() override;
void addDeadAim() override;
void addStopAim() override;
void simpleAction() const;
void followAndAct();
std::vector<int> getIndexesToAct() const;
Unit* unit;
};
```
CameraBehave.h
```#pragma once
#include <Urho3D/Graphics/Camera.h>
namespace Urho3D {
class Quaternion;
class IntVector2;
class String;
class Vector3;
enum MouseMode;
}
class CameraBehave {
public:
CameraBehave(const Urho3D::Vector3& pos, float minY, Urho3D::String name);
virtual ~CameraBehave();
virtual bool translate(bool cameraKeys[], int wheel, float timeStep, float min) = 0;
virtual bool rotate(const Urho3D::IntVector2& mouseMove, float mouse_sensitivity) { return false; }
virtual void setRotation(const Urho3D::Quaternion& rotation) {}
Urho3D::Camera* getComponent() const;
Urho3D::String getInfo() const;
virtual Urho3D::MouseMode getMouseMode() = 0;
const Urho3D::Vector3& getPosition() const;
void changeTargetInPercent(float percentX, float percentY) const;
void changeTarget(float x, float z) const;
void setPos(const Urho3D::Vector3& newPos) const;
virtual Urho3D::Vector2 getTargetPos() const;
protected:
void translateCam(float timeStep, float diff, Urho3D::Vector3 dir) const;
bool translateInternal(const bool* cameraKeys, float timeStep, float diff);
Urho3D::Node* cameraNode;
Urho3D::Camera* camera;
Urho3D::String name;
float minY;
float coefs[4];
};
```
MainMenuHelpPanel.cpp
```#include "MainMenuHelpPanel.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/ListView.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
MainMenuHelpPanel::
MainMenuHelpPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): MainMenuDetailsPanel(root, _style, _title) {
bodyStyle = "MainMenuHelpMock";
}
void MainMenuHelpPanel::createBody() {
MainMenuDetailsPanel::createBody();
list = createElement<Urho3D::ListView>(window, style, "HelpList");
for (int i = 0; i < HELP_ITEMS; ++i) {
auto button = simpleButton(style, "HelpListButton");
addChildText(button, "HelpListText", Game::getLocalization()->Get("help_key_" + Urho3D::String(i)), style);
list->AddItem(button);
button->SetVar("Num", i);
SubscribeToEvent(button, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuHelpPanel, HandleButtonClick));
}
content = createElement<Urho3D::ScrollView>(window, style, "HelpContent");
contentText = addChildText(content, "HelpContentText", Game::getLocalization()->Get("mock"), style);
contentText->SetWidth(content->GetWidth() * 0.9);
}
void MainMenuHelpPanel::action(short id) const {
contentText->SetText(Game::getLocalization()->Get("help_value_" + Urho3D::String(id)));
contentText->SetWidth(content->GetWidth() * 0.9);
}
void MainMenuHelpPanel::HandleButtonClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
auto element = static_cast<Urho3D::UIElement*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
int id = element->GetVar("Num").GetInt();
action(id);
}
```
InfluenceMapHistory.h
```#pragma once
#include "InfluenceMapFloat.h"
class InfluenceMapHistory : public InfluenceMapFloat {
public:
InfluenceMapHistory(unsigned short resolution, float size, float coef, char level, float minimalThreshold,
float vanishCoef, float valueThresholdDebug);
virtual ~InfluenceMapHistory() = default;
void reset() override;
private:
float minimalThreshold;
float vanishCoef;
};
```
ShotState.h
```#pragma once
#include "math/MathUtils.h"
#include "objects/projectile/ProjectileManager.h"
#include "objects/unit/state/State.h"
class ShotState : public State {
public:
ShotState() : State({
UnitState::STOP, UnitState::DEFEND, UnitState::DEAD, UnitState::GO, UnitState::FOLLOW, UnitState::CHARGE
}) {
}
~ShotState() = default;
void shot(Unit* unit) {
ProjectileManager::shoot(unit, unit->thingToInteract, 7, unit->getPlayer());
unit->currentFrameState = 0;
}
bool canStart(Unit* unit, const ActionParameter& parameter) override {
assert(unit->getDbUnit()->typeRange);
if (parameter.isThingAlive()) {
auto const indexesToUse = parameter.thingToInteract->getIndexesForRangeUse(unit);
return std::ranges::find(indexesToUse, unit->getMainGridIndex()) != indexesToUse.end()
&& parameter.thingToInteract->belowRangeLimit() > 0;
}
return false;
}
void onStart(Unit* unit, const ActionParameter& parameter) override {
unit->thingToInteract = parameter.thingToInteract;
//shot(unit);// TODO bug a co to tu robi?
unit->thingToInteract->upRange();
unit->currentFrameState = 0;
}
void onEnd(Unit* unit) override {
if (unit->isFirstThingAlive()) {
unit->thingToInteract->reduceRange();
unit->thingToInteract = nullptr;
}
}
bool closeEnough(Unit* unit) const {
return sqDist(unit->getPosition(), unit->thingToInteract->getPosition()) < unit->dbLevel->sqAttackRange;
}
void execute(Unit* unit, float timeStep) override {
//unit->velocity = Urho3D::Vector2::ZERO;
if (!unit->thingToInteract || !unit->thingToInteract->isAlive()) {
StateManager::toDefaultState(unit);
} else if (unit->currentFrameState >= unit->dbLevel->attackReload) {
if (closeEnough(unit)) {
//TODO tu cos innego
shot(unit);
} else {
StateManager::toDefaultState(unit);
}
}
++unit->currentFrameState;
}
};
```
CameraManager.h
```#pragma once
#include <Urho3D/Math/Vector4.h>
#include "CameraInfo.h"
namespace Urho3D {
class IntVector2;
class Vector2;
class Input;
class Camera;
class String;
enum MouseMode;
}
enum class CameraBehaviorType : char;
class CameraBehave;
class CameraManager {
public:
CameraManager();
~CameraManager();
void setCameraBehave(CameraBehaviorType _type);
Urho3D::Camera* getComponent() const;
void translate(const Urho3D::IntVector2& cursorPos, Urho3D::Input* input, float timeStep);
const Urho3D::String& getPosInfo() const;
Urho3D::MouseMode getMouseMode() const;
void changePositionInPercent(float x, float y);
void changePosition(float x, float y);
const Urho3D::Vector2 getTargetPos() const;
const CameraInfo* getCamInfo(float radius);
private:
void createCameraKeys(Urho3D::Input* input, bool cameraKeys[4], const Urho3D::IntVector2& cursorPos) const;
CameraBehave* cameraBehaves[3] = {nullptr, nullptr, nullptr};
CameraBehave* activeBehave;
CameraInfo* camInfo;
const float MOUSE_SENSITIVITY = 0.1f;
float MOVE_SPEED = 20;
unsigned short widthEdge;
unsigned short heightEdge;
unsigned short widthEdgeMax;
unsigned short heightEdgeMax;
bool hasMoved = true;
};
```
DeleteUtils.h
```#pragma once
#include <vector>
template <typename T>
void clear_vector(std::vector<T*>* container) {
for (T* obj : *container) {
delete obj;
}
container->clear();
}
template <typename T, size_t SIZE>
void clear_array(std::array<T*, SIZE>& container) {
for (T* obj : container) {
delete obj;
}
}
template <typename T>
void clear_vector(std::vector<T*>& container) {
for (T* obj : container) {
delete obj;
}
container.clear();
}
template <typename T>
void clear_vector_array(std::vector<T*>& container) {
for (T* obj : container) {
delete[] obj;
}
container.clear();
}
template <typename T>
void clear_and_delete_vector(std::vector<T*>* container) {
for (int i = container->size() - 1; i >= 0; --i) {
delete container->at(i);
}
container->clear();
delete container;
}
template <typename T>
void clear_delete_null_vector(std::vector<T*>** container) {
for (T* obj : **container) {
delete obj;
}
(*container)->clear();
delete container;
container = nullptr;
}
template <typename T>
void clear_array(T** tab, int size) {
for (int i = 0; i < size; ++i) {
delete tab[i];
}
}
```
TargetAim.cpp
```#include "TargetAim.h"
#include <utility>
#include "../Unit.h"
#include "Game.h"
#include "math/MathUtils.h"
#include "env/Environment.h"
TargetAim::TargetAim(std::vector<int> _path) :
path(std::move(_path)), current(0) {
currentTarget = Game::getEnvironment()->getCenter(path[current]);
}
std::vector<Urho3D::Vector3> TargetAim::getDebugLines(Unit* unit) const {
std::vector<Urho3D::Vector3> points;
points.emplace_back(unit->getPosition());
const auto env = Game::getEnvironment();
for (short i = current; i < path.size(); ++i) {
auto center = env->getPosWithHeightAt(path[i]);
points.emplace_back(center);
}
return points;
}
Urho3D::Vector2 TargetAim::getDirection(Unit* unit) {
return dirTo(unit->getPosition(), currentTarget);
}
bool TargetAim::ifReach(Unit* unit) {
if (path[current] == unit->getMainGridIndex()) {
++current;
if (current >= path.size()) {
return true;
}
currentTarget = Game::getEnvironment()->getCenter(path[current]);
}
return false;
}
bool TargetAim::expired() {
return false;
}
```
HudData.h
```#pragma once
#include <Urho3D/Core/Variant.h>
namespace Urho3D {
class String;
class UIElement;
}
enum class ActionType : char;
class HudData {
public:
explicit HudData(Urho3D::UIElement* _uiParent);
~HudData() = default;
void set(short _id, ActionType _type, Urho3D::String _text);
static HudData* getFromElement(Urho3D::VariantMap& eventData);
Urho3D::String& getText() { return text; }
Urho3D::UIElement* getUIParent() const { return parent; }
ActionType getType() const { return type; }
short getId() const { return id; }
private:
Urho3D::UIElement* parent;
Urho3D::String text;
short id;
ActionType type;
};
```
MouseButton.h
```#pragma once
#include <Urho3D/Math/Vector3.h>
#include <utility>
#include "Game.h"
struct MouseButton {
MouseButton() = default;
MouseButton(const MouseButton&) = delete;
~MouseButton() { clean(); }
void clean() {
if (held.first) {
delete held.first;
held.first = nullptr;
}
if (held.second) {
delete held.second;
held.second = nullptr;
}
isHeld = false;
}
void setFirst(Urho3D::Vector3& hitPos) {
if (held.first != nullptr) {
delete held.first;
held.first = nullptr;
}
held.first = new Urho3D::Vector3(hitPos);
lastDown = Game::getTime();
isHeld = true;
}
void setSecond(Urho3D::Vector3& hitPos) {
if (held.second != nullptr) {
delete held.second;
held.second = nullptr;
}
held.second = new Urho3D::Vector3(hitPos);
isHeld = false;
lastUp = Game::getTime();
}
void markHeld() {
isHeld = true;
}
void markIfNotHeld() {
if (!isHeld) {
isHeld = true;
}
}
bool isHeld = false;
std::pair<Urho3D::Vector3*, Urho3D::Vector3*> held;
float lastUp = -1;
float lastDown = -1;
};
```
BuildingFactory.h
```#pragma once
namespace Urho3D {
class IntVector2;
class Vector2;
}
struct dbload_building;
class Building;
class BuildingFactory {
public:
BuildingFactory() = default;
~BuildingFactory() = default;
Building* create(int id, const Urho3D::IntVector2& bucketCords, int level, int player) const;
Building* load(dbload_building* building) const;
};
```
ProjectileManager.h
```#pragma once
#include <vector>
struct ProjectileBase;
class Physical;
namespace Urho3D {
class Vector3;
class Node;
}
class ProjectileManager {
public:
static void update(float timeStep);
static void shoot(Physical* shooter, Physical* aim, float speed, char player);
static ProjectileBase* findNext();
static void init();
static void dispose();
static void reset();
private:
ProjectileManager() = default;
~ProjectileManager();
static ProjectileManager* instance;
std::vector<ProjectileBase*> projectiles;
};
```
SimulationObjectManager.h
```#pragma once
#include <functional>
#include <vector>
#include "objects/building/BuildingFactory.h"
#include "objects/resource/ResourceFactory.h"
#include "objects/unit/UnitFactory.h"
class Physical;
class ObjectsInfo;
class SimulationObjectManager {
public:
SimulationObjectManager();
~SimulationObjectManager();
void clearNodesWithoutDelete();
std::vector<Unit*>* getUnits() const { return units; }
std::vector<Building*>* getBuildings() const { return buildings; }
std::vector<ResourceEntity*>* getResources() const { return resources; }
void addUnits(unsigned number, int id, Urho3D::Vector2& center, char level, char player);
void addBuilding(int id, const Urho3D::IntVector2& _bucketCords, char level, char player) const;
void addResource(int id, const Urho3D::IntVector2& _bucketCords, char level) const;
void findToDispose();
void dispose();
void load(dbload_unit* unit);
void load(dbload_building* building);
void load(dbload_resource_entities* resource) const;
ObjectsInfo* getInfo() const { return simulationInfo; }
private:
void addUnits(std::vector<Unit*>& temp) const;
void addBuilding(Building* building) const;
void addResource(ResourceEntity* resource, bool bulkAdd) const;
void findToDisposeUnits();
void findToDisposeBuildings();
void findToDisposeResources();
void refreshResBonuses();
UnitFactory unitFactory;
BuildingFactory buildingFactory;
ResourceFactory resourceFactory;
ObjectsInfo* simulationInfo;
std::vector<Unit*>* units;
std::vector<Building*>* buildings;
std::vector<ResourceEntity*>* resources;
std::vector<Unit*> unitsToDispose;
std::vector<Building*> buildingsToDispose;
std::vector<ResourceEntity*> resourcesToDispose;
};
```
BucketIterator.cpp
```#include "BucketIterator.h"
#include "Grid.h"
Physical* BucketIterator::next() {
while (currentIterator == currentEnd) {
++index;
if (index == levelSize) { return nullptr; }
setRange();
}
return *(currentIterator++);
}
BucketIterator* BucketIterator::init(std::vector<short>* _levels, int _center, Grid* _bucketGrid) {
levels = _levels;
index = levels->begin();
levelSize = levels->end();
center = _center;
bucketGrid = _bucketGrid;
setRange();
return this;
}
void BucketIterator::setRange() {
const auto& content = bucketGrid->getContentAt((*index) + center);
//TODO bug może brać z drugiego konca jezeli index jest niepoprawny
currentIterator = content.begin();
currentEnd = content.end();
}
```
DatabaseCache.h
```#pragma once
#include <string>
#include <vector>
#include "db_container.h"
class sqlite3;
struct db_unit;
struct db_building;
struct db_nation;
struct db_resource;
struct db_order;
struct db_player_colors;
class DatabaseCache {
public:
explicit DatabaseCache(std::string postfix);
~DatabaseCache();
void loadBasic(const std::string& name);
void loadData(const std::string& name);
void loadMaps(const std::string& name);
void execute(const std::string& sql, int (* load)(void*, int, char**, char**)) const;
bool openDatabase(const std::string& name);
std::vector<db_hud_size*>& getHudSizes() const { return dbContainer->hudSizes; }
std::vector<db_hud_vars*>& getHudVars() const { return dbContainer->hudVars; }
std::vector<db_graph_settings*>& getGraphSettings() const { return dbContainer->graphSettings; }
db_settings* getSettings() const { return dbContainer->settings[0]; }
db_resolution* getResolution(int id) const { return dbContainer->resolutions[id]; }
std::vector<db_resolution*>& getResolutions() const { return dbContainer->resolutions; }
std::vector<db_map*>& getMaps() const { return dbContainer->maps; }
db_unit* getUnit(int i) const { return dbContainer->units[i]; }
std::vector<db_unit*>& getUnits() const { return dbContainer->units; }
db_building* getBuilding(int i) const { return dbContainer->buildings[i]; }
std::vector<db_building*>& getBuildings() const { return dbContainer->buildings; }
std::vector<db_nation*>& getNations() const { return dbContainer->nations; }
db_nation* getNation(int i) const { return dbContainer->nations[i]; }
db_resource* getResource(int i) const { return dbContainer->resources[i]; }
db_order* getOrder(int i) const { return dbContainer->orders[i]; }
std::vector<db_player_colors*>& getPlayerColors() const { return dbContainer->playerColors; }
db_player_colors* getPlayerColor(int i) const { return dbContainer->playerColors[i]; }
const std::vector<db_unit_level*>& getUnitLevels() const { return dbContainer->unitsLevels; }
const std::vector<db_building_level*>& getBuildingLevels() const { return dbContainer->buildingsLevels; }
void executeSingleBasic(const std::string& name, const char* sql);
void setGraphSettings(int i, db_graph_settings* graphSettings);
void setSettings(int i, db_settings* settings);
void refreshAfterParametersRead() const;
private:
db_container* dbContainer;
sqlite3* database;
std::string pathStr;
};
```
FreeCameraBehave.h
```#pragma once
#include "camera/CameraBehave.h"
class FreeCameraBehave : public CameraBehave {
public:
FreeCameraBehave();
virtual ~FreeCameraBehave() = default;
bool translate(bool cameraKeys[], int wheel, float timeStep, float min) override;
bool rotate(const Urho3D::IntVector2& mouseMove, float mouse_sensitivity) override;
Urho3D::MouseMode getMouseMode() override;
private:
float yaw = 0.f;
float pitch = 0.f;
};
```
LeftMenuInfoPanel.h
```#pragma once
#include "hud/window/SimplePanel.h"
namespace Urho3D {
class Text;
class XMLFile;
}
class SelectedInfo;
class HudData;
class LeftMenuInfoPanel : public SimplePanel {
public:
explicit LeftMenuInfoPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style);
~LeftMenuInfoPanel() = default;
void updateSelected(SelectedInfo* selectedInfo);
void setHoverInfo(HudData* hudData);
void removeHoverInfo();
void clearSelected();
private:
Urho3D::String createMessage(HudData* hudData);
void createBody() override;
Urho3D::Text* text;
bool hoverIsOn = false;
bool selectedIsOn = false;
};
```
StopState.h
```#pragma once
#include "State.h"
class StopState : public State {
public:
StopState(): State({
UnitState::DEFEND, UnitState::DEAD, UnitState::GO, UnitState::FOLLOW, UnitState::ATTACK,
UnitState::COLLECT, UnitState::SHOT, UnitState::MOVE, UnitState::CHARGE
}) {
}
~StopState() override = default;
};
```
QueueElement.h
```#pragma once
enum class QueueActionType : char;
enum class ActionType : char;
class QueueElement {
public:
QueueElement(QueueActionType type, short id, short maxCapacity, short initialTicksToComplete,
short ticksToCompletePerInstance);
~QueueElement() = default;
bool checkType(QueueActionType _type, short _id) const;
short add(short value);
void reduce(short value);
bool update();
QueueActionType getType() const { return type; }
short getId() const { return id; }
short getAmount() const { return amount; }
short getMaxCapacity() const { return maxCapacity; }
float getProgress() const { return ((float)elapsedTicks) / ticksToComplete; }
private:
QueueActionType type;
short id;
short maxCapacity;
short amount;
short ticksToComplete;
short elapsedTicks;
short ticksToCompletePerInstance;
};
```
QueueManager.h
```#pragma once
#include <vector>
#include "AbstractQueueManager.h"
enum class QueueActionType : char;
class QueueElement;
class QueueManager : public AbstractQueueManager {
public:
explicit QueueManager(unsigned short maxCapacity);
virtual ~QueueManager();
void add(short number, QueueActionType type, short id, unsigned short localMaxCapacity) override;
QueueElement* update() override;
short getSize() const override;
QueueElement* getAt(short i) override;
private:
std::vector<QueueElement*> queue;
unsigned short maxCapacity;
};
```
Force.cpp
```#include "Force.h"
#include <Urho3D/IO/Log.h>
#include "Game.h"
#include "database/db_strcut.h"
#include "math/MathUtils.h"
#include "math/RandGen.h"
#include "objects/unit/Unit.h"
#include "env/Environment.h"
#include "simulation/formation/FormationManager.h"
constexpr float CLOSEST_DIST = 0.00005f;
void Force::separationObstacle(Urho3D::Vector2& newForce, Unit* unit) {
auto force = Game::getEnvironment()->repulseObstacle(unit);
if (force == Urho3D::Vector2::ZERO) {
return;
}
const auto distance = force.Length();
const auto minimalDistance = unit->getMinimalDistance() * 3;
const auto coef = calculateCoef(distance, minimalDistance);
force *= coef / distance;
force *= boostCoef * sepCoef;
forceStats.addSepObst(force);
newForce += force;
}
void Force::randSepForce(Urho3D::Vector2& diff) const {
diff.x_ = RandGen::nextRand(RandFloatType::COLLISION_FORCE, 1.f) - 0.5f;
diff.y_ = RandGen::nextRand(RandFloatType::COLLISION_FORCE, 1.f) - 0.5f;
diff.Normalize();
diff *= CLOSEST_DIST;
}
void Force::separationUnits(Urho3D::Vector2& newForce, Unit* unit, std::vector<Physical*>* neights) {
if (neights->empty()) {
return;
}
Urho3D::Vector2 force;
const bool isLeader = Game::getFormationManager()->isLeader(unit);
const std::span<Unit*> neights2 = std::span((Unit**)neights->data(), neights->size());
for (auto neight : neights2) {
// for (auto physical : *neights) {
// auto neight = dynamic_cast<Unit*>(physical);
float sqSepDist = unit->getMaxSeparationDistance() + neight->getMinimalDistance();
sqSepDist *= sqSepDist;
auto diff = dirTo(neight->getPosition(), unit->getPosition());
float sqDistance = diff.LengthSquared();
if (sqDistance > sqSepDist //jezeli za dalko lub jest liderem a sasiad jest z tego samego
|| (isLeader && unit->getFormation() == neight->getFormation())) { continue; }
if (sqDistance == 0.f) {
randSepForce(diff);
sqDistance = diff.LengthSquared();
}
const float distance = sqrt(sqDistance);
const float minimalDistance = unit->getMinimalDistance() + neight->getMinimalDistance();
const float coef = calculateCoef(distance, minimalDistance);
diff *= coef / distance;
force += diff;
}
force *= boostCoef * sepCoef;
forceStats.addSepUnit(force);
newForce += force;
}
void Force::destOrFormation(Urho3D::Vector2& newForce, Unit* unit) {
if (unit->getFormation() < 0) {
destination(newForce, unit, 1.f);
} else if (Game::getFormationManager()->isLeader(unit)) {
if (Game::getFormationManager()->isMoving(unit)) {
destination(newForce, unit, 1.0f);
} else {
destination(newForce, unit, 0.05f);
}
} else {
formation(newForce, unit);
}
}
void Force::turnIfAreOpposite(Urho3D::Vector2& newForce, Urho3D::Vector2& force) const {
if (!force.Equals(Urho3D::Vector2::ZERO) && (force.Normalized() + newForce.Normalized()).Equals(Urho3D::Vector2::ZERO)) {
force += force.Length() * 0.1f * Urho3D::Vector2(force.y_, -force.x_);
}
}
void Force::destination(Urho3D::Vector2& newForce, Unit* unit, float factor) {
auto force = unit->getDestination(boostCoef, aimCoef * factor);
turnIfAreOpposite(newForce, force);
forceStats.addDest(force);
newForce += force;
}
void Force::formation(Urho3D::Vector2& newForce, Unit* unit) {
assert(!unit->hasAim());
if (unit->hasAim()) {
Game::getLog()->Write(3, "ERROR unit still has aims");
}
const auto formMng = Game::getFormationManager();
auto posOpt = formMng->getPositionFor(unit); //TODO czasem jest niepassable
if (posOpt.has_value()) {
const float priority = formMng->getPriority(unit);
if (priority > 0) {
auto pos = posOpt.value();
const auto env = Game::getEnvironment();
const auto aimIndex = env->getIndex(pos);
Urho3D::Vector2 force;
if (env->isInLocalArea(unit->getMainGridIndex(), aimIndex)) {
force = dirTo(unit->getPosition(), pos);
} else {
int nextIndex = formMng->getCachePath(unit, aimIndex);
if (nextIndex >= 0) {
force = dirTo(unit->getPosition(), env->getCenter(nextIndex));
} else if (nextIndex == -1) {
auto* const path = env->findPath(unit->getMainGridIndex(), aimIndex, 64);
if (!path->empty()) {
formMng->addCachePath(unit, aimIndex, path->at(0));
auto center = env->getCenter(path->at(0));
force = dirTo(unit->getPosition(), center);
} else {
formMng->addCachePath(unit, aimIndex, -2);
Game::getLog()->Write(0, "brak drogi w formacji");
}
} else {
Game::getLog()->Write(0, "brak drogi w formacji");
}
}
force *= formationCoef * boostCoef * priority;
turnIfAreOpposite(newForce, force);
forceStats.addForm(force);
newForce += force;
}
}
}
void Force::escapeFromInvalidPosition(Urho3D::Vector2& newForce, Unit* unit) {
const auto opt = Game::getEnvironment()->validatePosition(unit->getMainGridIndex(), unit->getPosition());
if (opt.has_value()) {
auto force = opt.value() * escapeCoef * boostCoef;
forceStats.addEscp(force);
newForce += force;
}
}
void Force::inCell(Urho3D::Vector2& newForce, Unit* unit) const {
const auto aim = Game::getEnvironment()->getPositionInBucket(unit);
auto force = dirTo(unit->getPosition(), aim);
//TODO czy to normalizacja?
force *= inCellCoef * boostCoef;
newForce += force;
}
ForceStats& Force::stats() {
return forceStats;
}
void Force::changeCoef(int i, int wheel) {
switch (i) {
case 0: sepCoef += wheel * 0.2;
std::cout << "Sep" << sepCoef << std::endl;
break;
case 1: aimCoef += wheel * 0.2;
std::cout << "Aim " << aimCoef << std::endl;
break;
case 2: formationCoef += wheel * 0.2;
std::cout << "Form " << formationCoef << std::endl;
break;
case 3: escapeCoef += wheel * 0.2;
std::cout << "Esc " << escapeCoef << std::endl;
break;
default:
break;
}
}
float Force::calculateCoef(const float distance, const float minDist) const {
float parameter = distance - minDist / 2;
if (parameter <= CLOSEST_DIST) {
parameter = CLOSEST_DIST;
}
return 1 / parameter;
}
//float Force::calculateCoef(const float distance, const float minDist) const {
// return exp(minDist / (distance + 0.05)) - 1;
//}
//float Force::calculateCoef(const float distance, const float minDist) const {
// double parameter = distance - minDist/2;
// if (parameter <= 0.05) {
// parameter = 0.05;
// }
// return exp(1 / parameter) - 1;
//}
```
Controls.cpp
```#include "Controls.h"
#include <Urho3D/Input/Input.h>
#include <Urho3D/IO/Log.h>
#include "ControlsUtils.h"
#include "SelectedInfo.h"
#include "colors/ColorPaletteRepo.h"
#include "commands/action/BuildingActionCommand.h"
#include "commands/action/BuildingActionType.h"
#include "commands/action/GeneralActionCommand.h"
#include "commands/action/GeneralActionType.h"
#include "commands/action/ResourceActionCommand.h"
#include "database/DatabaseCache.h"
#include "database/db_strcut.h"
#include "hud/HudData.h"
#include "math/MathUtils.h"
#include "objects/NodeUtils.h"
#include "objects/building/Building.h"
#include "objects/unit/Unit.h"
#include "objects/unit/order/GroupOrder.h"
#include "objects/unit/order/IndividualOrder.h"
#include "objects/unit/order/enums/UnitActionType.h"
#include "player/PlayersManager.h"
#include "player/ai/ActionCenter.h"
#include "simulation/ObjectsInfo.h"
#include "env/Environment.h"
#include "objects/ActionType.h"
#include "objects/PhysicalUtils.h"
#include "player/Player.h"
#include "simulation/FrameInfo.h"
#include "simulation/SimInfo.h"
#include "utils/OtherUtils.h"
constexpr char CIRCLE_NUMBER = 5;
Controls::Controls(Urho3D::Input* _input): input(_input), typeToCreate(ObjectType::NONE) {
if (!SIM_GLOBALS.HEADLESS) {
selectedInfo = new SelectedInfo();
selected.reserve(5000);
arrowNode = createNode("Objects/additional/arrowNode.xml");
tempBuildingNode = Game::getScene()->CreateChild();
tempBuildingNode->SetEnabled(false);
selectedInfo->setSelectedType(ObjectType::NONE);
for (int i = 0; i < MAX_DEPLOY_MARK_NUMBER; ++i) {
deployMark[i] = createNode("Objects/buildings/additional/banner.xml");
}
}
}
Controls::~Controls() {
delete selectedInfo;
if (!SIM_GLOBALS.HEADLESS) {
arrowNode->Remove();
for (auto mark : deployMark) {
mark->Remove();
}
}
}
void Controls::updateAdditionalInfo() const {
switch (selectedInfo->getSelectedType()) {
case ObjectType::BUILDING: {
int min = Urho3D::Min(MAX_DEPLOY_MARK_NUMBER, selected.size());
for (int i = 0; i < min; ++i) {
deployMark[i]->SetEnabled(true);
auto deployIndex = static_cast<Building*>(selected.at(i))->getDeploy().value();
deployMark[i]->SetPosition(Game::getEnvironment()->getPosWithHeightAt(deployIndex));
}
for (int i = min; i < MAX_DEPLOY_MARK_NUMBER; ++i) {
deployMark[i]->SetEnabled(false);
}
}
break;
default:
for (const auto mark : deployMark) {
mark->SetEnabled(false);
}
}
}
void Controls::setCircle(int i, Urho3D::Vector4 val) const {
Game::getEnvironment()->setTerrainShaderParam("RangeData" + Urho3D::String(i), val);
}
void Controls::resetCircles() const {
for (int i = 0; i < CIRCLE_NUMBER; ++i) {
setCircle(i, Urho3D::Vector4());
}
}
void Controls::setCircleSight(int i, const Urho3D::Vector3& position, float radius, Urho3D::Color color) const {
color.a_ = 0;
setCircle(i, Urho3D::Vector4(position.x_, position.z_, radius, float(color.ToUInt())));
}
void Controls::unSelectAll() {
for (const auto& phy : selected) {
phy->unSelect();
}
selected.clear();
selectedInfo->setSelectedType(ObjectType::NONE);
selectedInfo->reset();
resetCircles();
}
void Controls::selectOne(Physical* entity, char player) {
const auto entityType = entity->getType();
if(!entity->isNodeEnabled()) {
return;
}
if (entity == nullptr || entityType != selectedInfo->getSelectedType()) {
unSelectAll();
}
if (!entity->isSelected() && entity->isAlive()
&& (entity->getPlayer() < 0 || entity->getPlayer() == player)) {
entity->select();
selected.push_back(entity);
selectedInfo->setSelectedType(entityType);
selectedInfo->setAllNumber(selected.size());
selectedInfo->select(entity);
}
}
void Controls::select(const std::vector<Physical*>* entities) {
auto player = Game::getPlayersMan()->getActivePlayerID();
for (auto physical : *entities) {
selectOne(physical, player);
}
updateAdditionalInfo();
}
void Controls::leftClick(hit_data& hitData) {
if (!input->GetKeyDown(Urho3D::KEY_CTRL)) {
unSelectAll();
}
if (hitData.isGround) {
unSelectAll();
} else {
selectOne(hitData.clicked, Game::getPlayersMan()->getActivePlayerID());
}
updateAdditionalInfo();
}
void Controls::leftDoubleClick(hit_data& hitData) {
if (!input->GetKeyDown(Urho3D::KEY_CTRL)) {
unSelectAll();
}
select(Game::getEnvironment()->getNeighboursSimilarAs(hitData.clicked));
}
void Controls::leftClickBuild(hit_data& hitData) {
unSelectAll();
createBuilding({hitData.position.x_, hitData.position.z_});
}
UnitOrder* Controls::vectorOrder(UnitAction order, Urho3D::Vector2* vector, const bool shiftPressed,
const std::vector<Physical*>& vec) const {
if (vec.size() == 1) {
return new IndividualOrder(static_cast<Unit*>(vec.at(0)), order, *vector, shiftPressed);
}
return new GroupOrder(vec, UnitActionType::ORDER, static_cast<short>(order), *vector, shiftPressed);
}
UnitOrder* Controls::thingOrder(UnitAction order, Physical* toUse, const bool shiftPressed,
const std::vector<Physical*>& vec) const {
if (vec.size() == 1) {
return new IndividualOrder(static_cast<Unit*>(vec.at(0)), order, toUse, shiftPressed);
}
return new GroupOrder(vec, UnitActionType::ORDER, static_cast<short>(order), toUse, shiftPressed);
}
UnitAction Controls::chooseAction(hit_data& hitData) const {
return hitData.clicked->getTeam() == selected.at(0)->getTeam()
? UnitAction::FOLLOW
: UnitAction::ATTACK;
}
UnitOrder* Controls::createUnitOrder(hit_data& hitData) const {
const bool shiftPressed = input->GetKeyDown(Urho3D::KEY_SHIFT);
switch (hitData.getType()) {
case ObjectType::NONE:
return vectorOrder(UnitAction::GO, new Urho3D::Vector2(hitData.position.x_, hitData.position.z_), shiftPressed,
selected);
case ObjectType::UNIT:
case ObjectType::BUILDING:
return thingOrder(chooseAction(hitData), hitData.clicked, shiftPressed, selected);
case ObjectType::RESOURCE:
return thingOrder(UnitAction::COLLECT, hitData.clicked, shiftPressed, selected);
default: ;
}
}
void Controls::rightClick(hit_data& hitData) const {
Game::getActionCenter()->addUnitAction(createUnitOrder(hitData), Game::getPlayersMan()->getActivePlayerID());
}
void Controls::leftHold(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& held) {
if (!input->GetKeyDown(Urho3D::KEY_CTRL)) {
unSelectAll();
}
select(Game::getEnvironment()->getNeighbours(held, Game::getPlayersMan()->getActivePlayerID()));
}
void Controls::rightHold(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& held) const {
GroupOrder* first = new GroupOrder(selected, UnitActionType::ORDER, cast(UnitAction::GO),
Urho3D::Vector2(held.first->x_, held.first->z_));
GroupOrder* second;
if (input->GetKeyDown(Urho3D::KEY_SHIFT)) {
second = new GroupOrder(selected, UnitActionType::ORDER, cast(UnitAction::GO),
Urho3D::Vector2(held.second->x_, held.second->z_), true);
} else {
second = new GroupOrder(selected, UnitActionType::ORDER, cast(UnitAction::CHARGE),
Urho3D::Vector2(held.second->x_ - held.first->x_,
held.second->z_ - held.first->z_), true); //TODO buf append nie działa
}
Game::getActionCenter()->addUnitAction(first, second, Game::getPlayersMan()->getActivePlayerID());
}
void Controls::releaseLeft() {
hit_data hitData;
if (raycast(hitData)) {
const auto lastClicked = left.lastUp;
left.setSecond(hitData.position);
const float dist = sqDist(left.held.first, left.held.second);
if (left.lastUp - lastClicked < 0.2f && dist < clickDistance) {
leftDoubleClick(hitData);
} else if (dist > clickDistance) {
leftHold(left.held);
} else if (hitData.isSth()) {
leftClick(hitData);
}
}
Game::getEnvironment()->setTerrainShaderParam("SelectionEnable", false);
left.clean();
}
void Controls::releaseRight() {
hit_data hitData;
if (selectedInfo->getSelectedType() == ObjectType::UNIT && raycast(hitData)) {
right.setSecond(hitData.position);
if (sqDist(right.held.first, right.held.second) > clickDistance) {
rightHold(right.held);
} else if (hitData.isSth()) {
rightClick(hitData);
}
}
arrowNode->SetEnabled(false);
right.clean();
}
void Controls::releaseBuildLeft() {
hit_data hitData;
if (raycastGround(hitData)) {
leftClickBuild(hitData);
if (input->GetKeyDown(Urho3D::KEY_CTRL)) {
cleanMouse();
} else {
toDefault();
}
}
}
bool Controls::orderAction() const {
hit_data hitData;
//if (raycast(hitData) && hitData.clicked) {
if (raycast(hitData)) {
rightClick(hitData);
return true;
}
return false;
}
void Controls::toBuild(HudData* hud) {
state = ControlsState::BUILD;
typeToCreate = ObjectType::BUILDING;
idToCreate = hud->getId();
tempBuildingNode->SetEnabled(false);
resetCircles();
}
BuildingActionType Controls::getBuildingActionType(ActionType type) {
switch (type) {
case ActionType::UNIT_CREATE:
return BuildingActionType::UNIT_CREATE;
case ActionType::UNIT_LEVEL:
return BuildingActionType::UNIT_LEVEL;
case ActionType::UNIT_UPGRADE:
return BuildingActionType::UNIT_UPGRADE;
default: ;
}
}
void Controls::order(short id, ActionType type) {
switch (selectedInfo->getSelectedType()) {
case ObjectType::NONE:
return Game::getActionCenter()->add(
new GeneralActionCommand(id, GeneralActionType::BUILDING_LEVEL,
Game::getPlayersMan()->getActivePlayerID()));
case ObjectType::UNIT:
return actionUnit(id, type);
case ObjectType::BUILDING:
return executeOnBuildings(getBuildingActionType(type), id);
case ObjectType::RESOURCE:
return executeOnResources(ResourceActionType(id));
}
}
void Controls::executeOnUnits(short id) const {
Game::getActionCenter()->addUnitAction(
new GroupOrder(selected, UnitActionType::ORDER, id, nullptr, false),
Game::getPlayersMan()->getActivePlayerID());
}
void Controls::executeOnResources(ResourceActionType action) const {
Game::getActionCenter()->add(
new ResourceActionCommand(selected, action, Game::getPlayersMan()->getActivePlayerID()));
}
void Controls::executeOnBuildings(BuildingActionType action, short id) const {
Game::getActionCenter()->add(
new BuildingActionCommand(selected, action, id, Game::getPlayersMan()->getActivePlayerID()));
}
bool Controls::clickDown(MouseButton& var) const {
hit_data hitData;
if (raycast(hitData)) {
var.setFirst(hitData.position);
return true;
}
return false;
}
void Controls::createBuilding(Urho3D::Vector2 pos) const {
if (idToCreate >= 0) {
auto player = Game::getPlayersMan()->getActivePlayerID();
Game::getActionCenter()->addBuilding(idToCreate, pos, player, false);
}
}
void Controls::cleanMouse() {
left.clean();
right.clean();
arrowNode->SetEnabled(false);
Game::getEnvironment()->setTerrainShaderParam("SelectionEnable", false);
}
void Controls::deactivate() {
if (active) {
active = false;
cleanMouse();
}
}
void Controls::activate() {
if (!active) {
active = true;
cleanMouse();
}
}
void Controls::unitOrder(short id) {
const auto type = UnitAction(id);
switch (type) {
case UnitAction::GO:
case UnitAction::CHARGE:
case UnitAction::ATTACK:
case UnitAction::FOLLOW:
state = ControlsState::ORDER;
unitOrderType = type;
break;
case UnitAction::STOP:
case UnitAction::DEFEND:
case UnitAction::DEAD:
executeOnUnits(id);
break;
default: ;
}
}
void Controls::actionUnit(short id, ActionType type) {
switch (type) {
case ActionType::ORDER:
return unitOrder(id);
case ActionType::FORMATION:
return unitFormation(id);
}
}
void Controls::refreshSelected() {
const int sizeBefore = selected.size();
selected.erase(
std::remove_if(
selected.begin(), selected.end(),
[](Physical* physical) {
if (!physical->isAlive()) {
physical->unSelect();
return true;
}
return false;
}),
selected.end());
if (sizeBefore != selected.size()) {
//TODO perf nie koniecznie resetowac całość
selectedInfo->refresh(selected);
}
}
bool Controls::conditionToClean(const SimInfo* simulationInfo) const {
if (!simulationInfo->getFrameInfo()->isRealFrame()) {
return false;
}
switch (selectedInfo->getSelectedType()) {
case ObjectType::UNIT:
return simulationInfo->getObjectsInfo()->ifUnitDied();
case ObjectType::BUILDING:
return simulationInfo->getObjectsInfo()->ifBuildingDied();
case ObjectType::RESOURCE:
return simulationInfo->getObjectsInfo()->ifResourceDied();
}
return false;
}
void Controls::cleanAndUpdate(const SimInfo* simulationInfo) {
if (conditionToClean(simulationInfo)) {
refreshSelected();
}
switch (selectedInfo->getSelectedType()) {
case ObjectType::UNIT:
for (int i = 0; i < Urho3D::Min(selected.size(), 5); ++i) {
const auto ent = selected.at(i);
setCircleSight(i, ent->getPosition(), ent->getSightRadius(), Urho3D::Color::MAGENTA);
}
break;
case ObjectType::RESOURCE:
break;
case ObjectType::BUILDING:
for (int i = 0; i < Urho3D::Min(selected.size(), 5); ++i) {
const Building* build = (Building*)selected.at(i);
setCircleSight(i, build->getPosition(), getCircleSize(build->getDbBuilding(), build->getLevel()),
Game::getColorPaletteRepo()->getCircleColor(build->getDbBuilding()));
}
}
}
void Controls::updateSelection() const {
hit_data hitData;
if (raycastGround(hitData)) {
const float xScale = left.held.first->x_ - hitData.position.x_;
const float zScale = left.held.first->z_ - hitData.position.z_;
if ((xScale * xScale > clickDistance || zScale * zScale > clickDistance)
&& Game::getTime() - left.lastDown > 0.3f) {
Game::getEnvironment()->setTerrainShaderParam("SelectionEnable", true);
std::pair<float, float> x = std::minmax(left.held.first->x_, hitData.position.x_);
std::pair<float, float> z = std::minmax(left.held.first->z_, hitData.position.z_);
Game::getEnvironment()->setTerrainShaderParam("SelectionRect",
Urho3D::Vector4(x.first, z.first, x.second, z.second));
} else {
Game::getEnvironment()->setTerrainShaderParam("SelectionEnable", false);
}
}
}
void Controls::updateArrow() const {
hit_data hitData;
if (selectedInfo->getSelectedType() == ObjectType::UNIT && raycastGround(hitData)) {
auto dir = *right.held.first - hitData.position;
const float length = dir.Length();
if (length * length > clickDistance && Game::getTime() - right.lastDown > 0.3f) {
if (!arrowNode->IsEnabled()) {
arrowNode->SetEnabled(true);
}
arrowNode->SetScale({length, 1, length / 3});
arrowNode->SetDirection({-dir.z_, 0, dir.x_});
arrowNode->SetPosition(*right.held.first);
} else if (arrowNode->IsEnabled()) {
arrowNode->SetEnabled(false);
}
} else if (arrowNode->IsEnabled()) {
arrowNode->SetEnabled(false);
}
}
void Controls::toDefault() {
state = ControlsState::DEFAULT;
cleanMouse();
idToCreate = -1;
tempBuildingNode->SetEnabled(false);
resetCircles();
}
void Controls::unitFormation(short id) const {
Game::getActionCenter()->addUnitAction(
new GroupOrder(selected, UnitActionType::FORMATION, id, nullptr), Game::getPlayersMan()->getActivePlayerID());
}
void Controls::control() {
switch (state) {
case ControlsState::DEFAULT:
return defaultControl(); //TODO bug gdy zaznaczony jest resource to probuje storzyc formacje przy chargfe
case ControlsState::BUILD:
return buildControl();
case ControlsState::ORDER:
return orderControl();
}
}
void Controls::defaultControl() {
if (input->GetMouseButtonDown(Urho3D::MOUSEB_LEFT)) {
if (!left.isHeld) {
clickDown(left);
} else {
updateSelection();
}
} else if (left.isHeld) {
releaseLeft();
}
if (input->GetMouseButtonDown(Urho3D::MOUSEB_RIGHT)) {
if (!right.isHeld) {
clickDown(right);
} else {
updateArrow();
}
} else if (right.isHeld) {
releaseRight();
}
if (input->GetMouseButtonPress(Urho3D::MOUSEB_MIDDLE)) {
hit_data hitData;
if (raycast(hitData)) {
if (hitData.clicked) {
Game::getLog()->Write(3, hitData.clicked->getInfo());
}
Game::getLog()->Write(3, hitData.position.ToString());
}
}
}
void Controls::buildControl() {
if (!input->GetMouseButtonDown(Urho3D::MOUSEB_LEFT) && !input->GetMouseButtonDown(Urho3D::MOUSEB_RIGHT)) {
hit_data hitData;
if (raycastGround(hitData)) {
//TODO perf nie robic tego co klatkę
auto env = Game::getEnvironment();
const auto building = Game::getDatabase()->getBuilding(idToCreate);
auto hitPos = Urho3D::Vector2(hitData.position.x_, hitData.position.z_);
const auto validPos = env->getValidPosition(building->size, hitPos);
auto level = Game::getPlayersMan()->getActivePlayer()->getLevelForBuilding(idToCreate);
tempBuildingNode->SetPosition(env->getPosWithHeightAt(validPos.x_, validPos.y_));
if (!tempBuildingNode->IsEnabled()) {
tempBuildingNode->LoadXML(Game::getCache()
->GetResource<Urho3D::XMLFile>("Objects/buildings/" + level->nodeName)
->GetRoot());
const auto model = tempBuildingNode->GetComponent<Urho3D::StaticModel>();
for (int i = 0; i < model->GetNumGeometries(); ++i) {
model->SetMaterial(i, model->GetMaterial(i)->Clone());
}
tempBuildingNode->SetEnabled(true);
}
setCircleSight(0, tempBuildingNode->GetPosition(), getCircleSize(building, level),
Game::getColorPaletteRepo()->getCircleColor(building));
setShaderParam(tempBuildingNode, "MatDiffColor",
Game::getColorPaletteRepo()->getColorForValidation(building, hitPos));
}
}
if (input->GetMouseButtonDown(Urho3D::MOUSEB_LEFT)) {
left.markIfNotHeld();
} else if (left.isHeld) {
releaseBuildLeft();
}
if (input->GetMouseButtonDown(Urho3D::MOUSEB_RIGHT)) {
toDefault();
}
}
void Controls::orderControl() {
if (input->GetMouseButtonDown(Urho3D::MOUSEB_LEFT)) {
left.markIfNotHeld();
} else if (left.isHeld) {
switch (unitOrderType) {
case UnitAction::GO:
case UnitAction::ATTACK:
case UnitAction::FOLLOW:
if (orderAction()) {
toDefault();
}
break;
case UnitAction::CHARGE:
break;
default: ;
}
left.clean();
}
if (input->GetMouseButtonDown(Urho3D::MOUSEB_RIGHT)) {
right.markIfNotHeld();
} else if (right.isHeld) {
toDefault();
}
}
```
InfluenceMapInt.cpp
```#include "InfluenceMapInt.h"
#include <algorithm>
#include <numeric>
#include "objects/Physical.h"
InfluenceMapInt::InfluenceMapInt(unsigned short resolution, float size, float valueThresholdDebug): InfluenceMap(
resolution, size, valueThresholdDebug) {
values = new unsigned char[arraySize];
reset();
}
InfluenceMapInt::~InfluenceMapInt() {
delete[] values;
}
void InfluenceMapInt::update(Physical* thing, float value) {
const int index = calculator->indexFromPosition(thing->getPosition());
values[index] += round(value);
}
void InfluenceMapInt::updateInt(Physical* thing, int value) {
updateInt(calculator->indexFromPosition(thing->getPosition()), value);
}
void InfluenceMapInt::updateInt(int index, int value) const {
values[index] += value;
}
void InfluenceMapInt::reset() {
std::fill_n(values, arraySize, 0);
minMaxInited = false;
}
char InfluenceMapInt::getValueAt(const Urho3D::Vector2& pos) const {
auto index = calculator->indexFromPosition(pos);
return getValueAt(index);
}
float InfluenceMapInt::getValueAsPercent(const Urho3D::Vector2& pos) const {
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(pos) - min) / diff;
}
return 0.5f;
}
float InfluenceMapInt::getValueAsPercent(const int index) const {
const float diff = max - min;
if (diff != 0.f) {
return (getValueAt(index) - min) / diff;
}
return 0.5f;
}
float InfluenceMapInt::getValueAt(int index) const {
return values[index];
}
void InfluenceMapInt::ensureReady() {
computeMinMax();
}
int InfluenceMapInt::getMaxIdx() {
computeMinMax();
return maxIdx;
}
void InfluenceMapInt::computeMinMax() {
if (!minMaxInited) {
const auto [minPtr, maxPtr] = std::minmax_element(values, values + arraySize);
min = *minPtr;
max = *maxPtr;
minIdx = std::distance(values, minPtr);
maxIdx = std::distance(values, maxPtr);
minMaxInited = true;
}
}
```
FollowAim.cpp
```#include "FollowAim.h"
#include "../Unit.h"
#include "math/MathUtils.h"
#include "TargetAim.h"
FollowAim::FollowAim(Physical* physical, TargetAim* subTarget): physical(physical), subTarget(subTarget) {
radiusSq = 1 * 1;
}
FollowAim::~FollowAim() {
delete subTarget;
}
std::vector<Urho3D::Vector3> FollowAim::getDebugLines(Unit* follower) const {
if (subTarget) {
return subTarget->getDebugLines(follower);
}
auto position = follower->getPosition();
std::vector<Urho3D::Vector3> points;
const auto optPos = physical->getPosToUseBy(follower);
if (optPos.has_value()) {
auto pos = optPos.value();
points.emplace_back(position);
points.emplace_back(pos.x_, position.y_, pos.y_);
}
return points;
}
Urho3D::Vector2 FollowAim::getDirection(Unit* follower) {
if (subTarget) {
return subTarget->getDirection(follower);
}
const auto opt = physical->getPosToUseBy(follower);
if (opt.has_value()) {
return dirTo(follower->getPosition(), opt.value());
}
return {};
}
bool FollowAim::ifReach(Unit* follower) {
if (subTarget) {
return subTarget->ifReach(follower);
}
const auto opt = physical->getPosToUseBy(follower);
if (opt.has_value()) {
return sqDist(follower->getPosition(), opt.value()) < radiusSq;
}
return true;
}
bool FollowAim::expired() {
return !physical->isAlive() || physical->indexChanged();// || haspostToUSe?
}
```
Benchmark.h
```#pragma once
#include <fstream>
constexpr int BENCH_LENGTH = 120;
constexpr int PERCENT = 12;
constexpr int PERCENT2 = 108;
constexpr bool BENCH_SAVE = false;
class Benchmark {
public:
Benchmark();
~Benchmark();
void add(float fps);
void save();
float getAvgLowest() const { return avgLowest; }
float getAvgMiddle() const { return avgMiddle; }
float getAvgHighest() const { return avgHighest; }
private:
float data[BENCH_LENGTH]{};
short index = 0;
float avgLowest = 0;
float avgMiddle = 0;
float avgHighest = 0;
std::ofstream output;
};
```
StateManager.h
```#pragma once
#include <initializer_list>
#include <magic_enum.hpp>
#include <vector>
#include "objects/unit/order/enums/UnitAction.h"
#include "objects/unit/state/UnitState.h"
class ResourceEntity;
class Building;
struct ActionParameter;
class Unit;
class State;
class Static;
enum class StaticState : char;
class StateManager {
public:
static bool changeState(Unit* unit, UnitState stateTo, const ActionParameter& actionParameter);
static bool changeState(Unit* unit, UnitState stateTo);
static bool toDefaultState(Unit* unit);
static bool canStartState(Unit* unit, UnitState stateTo, const ActionParameter& actionParameter, State* stateFrom,
State* toState);
static bool canChangeState(Unit* unit, UnitState stateTo);
static void execute(Unit* unit, float timeStamp);
static void executeChange(std::vector<Unit*>* units);
static bool changeState(Static* obj, StaticState stateTo);
static void executeChange(Static* obj);
static void executeChange(std::vector<Building*>* buildings);
static void executeChange(std::vector<ResourceEntity*>* resources);
static bool isBuildingToDispose();
static void setBuildingToDispose(bool value);
static bool isResourceToDispose();
static void setResourceToDispose(bool value);
static void init();
static void dispose();
private:
void initOrders(std::initializer_list<UnitAction> states) const; //TODO move to level
void initStates(std::initializer_list<UnitState> states) const; //TODO move to level
StateManager();
~StateManager();
static State* getState(Unit* unit);
State* states[magic_enum::enum_count<UnitState>()]{};
static StateManager* instance;
bool unitHasChanged = false;
bool buildingHasChanged = false;
bool resourceHasChanged = false;
bool buildingIsToDispose = false;
bool resourceIsToDispose = false;
};
inline bool isInStates(UnitState state, std::initializer_list<UnitState> states) {
for (auto s : states) {
if (state == s) {
return true;
}
}
return false;
}
inline bool isInFreeState(UnitState state) {
return isInStates(state, {UnitState::STOP, UnitState::MOVE});
}
```
EventPanel.h
```#pragma once
#include "SimplePanel.h"
#include "Urho3D/Core/Object.h"
class EventPanel : public SimplePanel, public Urho3D::Object {
URHO3D_OBJECT(EventPanel, Object)
public:
EventPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, Urho3D::String styleName,
std::initializer_list<GameState> active);
virtual ~EventPanel() = default;
};
```
ResourceEntity.cpp
```#include "ResourceEntity.h"
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/Scene/Node.h>
#include "Game.h"
#include "commands/action/ResourceActionType.h"
#include "database/DatabaseCache.h"
#include "math/RandGen.h"
#include "objects/PhysicalUtils.h"
#include "objects/unit/Unit.h"
#include "objects/unit/order/enums/UnitAction.h"
#include "objects/unit/state/StateManager.h"
#include "scene/load/dbload_container.h"
#include "env/Environment.h"
#include "player/PlayersManager.h"
ResourceEntity::ResourceEntity(Urho3D::Vector3 _position, int id, int level, int indexInGrid, bool withNode)
: Static(_position, indexInGrid, withNode) {
dbResource = Game::getDatabase()->getResource(id);
loadXml("Objects/resources/" + dbResource->nodeName[RandGen::nextRand(
RandIntType::RESOURCE_NODE, dbResource->nodeName.Size())]);
if (withNode) {
node->SetRotation(Urho3D::Quaternion(0, RandGen::nextRand(RandFloatType::RESOURCE_ROTATION, 360.f), 0.0f));
}
}
const Urho3D::IntVector2 ResourceEntity::getGridSize() const {
return dbResource->size;
}
void ResourceEntity::populate() {
Static::populate();
invMaxHp = dbResource->invMaxHp;
hp = dbResource->maxHp;
id = dbResource->id;
}
unsigned short ResourceEntity::getMaxHpBarSize() const {
return 1;
}
Urho3D::String ResourceEntity::getInfo() const {
const auto l10n = Game::getLocalization();
const auto bonus = Game::getEnvironment()->getBonuses(Game::getPlayersMan()->getActivePlayerID(), this);
return Urho3D::String(dbResource->name)
.AppendWithFormat(l10n->Get("info_resource").CString(),
(int)hp, dbResource->maxHp, asStringF(bonus, 1).c_str(),
closeUsers, getMaxCloseUsers());
}
const Urho3D::String& ResourceEntity::getName() const {
return dbResource->name;
}
std::string ResourceEntity::getValues(int precision) {
return Static::getValues(precision);
}
unsigned char ResourceEntity::getMaxCloseUsers() const {
return dbResource->maxUsers;
}
void ResourceEntity::action(ResourceActionType type, char player) {
switch (type) {
case ResourceActionType::COLLECT: {
if (hasAnyFreeSpace()) {
const auto neights = Game::getEnvironment()->getNeighboursFromSparseSamePlayer(this, 24, player);
int k = 0;
const char limit = belowCloseLimit();
for (auto neight : *neights) {
if (k < limit) {
auto unit = static_cast<Unit*>(neight);
if (isFreeWorker(unit)) {
//TODO findPath?
unit->toAction(this, UnitAction::COLLECT);
//TODO add order?
++k;
}
} else {
break;
}
}
}
}
break;
case ResourceActionType::CANCEL:
StateManager::changeState(this, StaticState::FREE);
break;
}
}
bool ResourceEntity::canUse(int index) const {
return Game::getEnvironment()->cellIsCollectable(index);
}
float ResourceEntity::getModelHeight() const {
return dbResource->modelHeight;
}
void ResourceEntity::setModelData(float modelHeight) const {
dbResource->modelHeight = modelHeight;
}
std::pair<float, bool> ResourceEntity::absorbAttack(float collectSpeed) {
if (hp - collectSpeed >= 0) {
hp -= collectSpeed;
return {collectSpeed, false};
}
const float toReturn = hp;
hp = 0.f;
StateManager::changeState(this, StaticState::DEAD);
return {toReturn, false};
}
ResourceEntity* ResourceEntity::load(dbload_resource_entities* resource) {
Static::load(resource);
return this;
}
```
Bucket.h
```#pragma once
#include <span>
#include <vector>
class Unit;
struct content_info;
class Physical;
class Bucket {
public:
Bucket() = default;
~Bucket() = default;
Bucket(const Bucket&) = delete;
int getSize() const;
void reserve(int i);
const std::vector<Physical*>& getContent() const { return content; }
//const std::span<Unit*>& getContentAsUnit() const {
// return std::span((Unit**)content.data(), content.size());
//}
void add(Physical* entity);
void add(const std::vector<Physical*>& things);
void remove(Physical* entity);
private:
std::vector<Physical*> content;
};
```
SelectedInfo.cpp
```#include "SelectedInfo.h"
#include "Game.h"
#include "SelectedInfoType.h"
#include "database/DatabaseCache.h"
#include "objects/Physical.h"
#include "utils/DeleteUtils.h"
SelectedInfo::SelectedInfo() {
allNumber = 0;
allSubTypeNumber = 0;
const auto db = Game::getDatabase();
const auto size = Urho3D::Max(db->getUnits().size(), db->getBuildings().size());
selectedByType.reserve(size);
for (int i = 0; i < size; ++i) {
selectedByType.push_back(new SelectedInfoType(i));
}
}
SelectedInfo::~SelectedInfo() {
clear_vector(selectedByType);
}
void SelectedInfo::setAllNumber(int allNumber) {
this->allNumber = allNumber;
changed = true;
}
void SelectedInfo::setSelectedType(ObjectType selectedType) {
this->selectedType = selectedType;
changed = true;
}
void SelectedInfo::reset() {
changed = true;
allNumber = 0;
allSubTypeNumber = 0;
for (auto element : selectedByType) {
element->clear();
}
}
void SelectedInfo::select(Physical* entity) {
if (entity->getId() >= 0) {
selectedByType.at(entity->getId())->add(entity);
if (selectedByType.at(entity->getId())->getData().size() == 1) {
++allSubTypeNumber;
}
}
changed = true;
}
void SelectedInfo::hasBeenUpdatedDrawn() {
changed = false;
}
std::optional<SelectedInfoType*> SelectedInfo::getOneSelectedTypeInfo() const {
for (auto info : selectedByType) {
if (!info->getData().empty()) {
return info;
}
}
return {};
}
bool SelectedInfo::isSthSelected() const {
return allNumber > 0 && selectedType != ObjectType::NONE;
}
void SelectedInfo::refresh(const std::vector<Physical*>& selected) {
reset();
for (auto physical : selected) {
select(physical);
}
}
```
MainMenuLoadPanel.cpp
```#include "MainMenuLoadPanel.h"
#include <Urho3D/IO/FileSystem.h>
#include <Urho3D/Resource/Localization.h>
#include <Urho3D/UI/ListView.h>
#include <Urho3D/UI/UIEvents.h>
#include <Urho3D/UI/Window.h>
#include "hud/UiUtils.h"
MainMenuLoadPanel::
MainMenuLoadPanel(Urho3D::UIElement* root, Urho3D::XMLFile* _style, const Urho3D::String& _title): MainMenuDetailsPanel(root, _style, _title) {
bodyStyle = "MainMenuLoadMock";
}
void MainMenuLoadPanel::createBody() {
MainMenuDetailsPanel::createBody();
leftMock = createElement<Urho3D::UIElement>(window, style,"LoadLeftMock");
list = createElement<Urho3D::ListView>(window, style,"LoadList");
Urho3D::Vector<Urho3D::String> files;
GetSubsystem<Urho3D::FileSystem>()->ScanDir(files, "saves", "*.db", Urho3D::SCAN_FILES, false);
for (const auto& name : files) {
auto button = simpleButton(style, "LoadListButton");
addChildText(button, "LoadListText", name, style);
list->AddItem(button);
SubscribeToEvent(button, Urho3D::E_CLICK, URHO3D_HANDLER(MainMenuLoadPanel, HandleLoadClick));
}
content = createElement<Urho3D::ScrollView>(window, style,"LoadContent");
loadButton = createElement<Urho3D::Button>(leftMock, style,"LoadButton");
addChildText(loadButton, "LoadButtonText", Game::getLocalization()->Get("load"), style);
}
void MainMenuLoadPanel::action(const Urho3D::String& saveName) {
}
void MainMenuLoadPanel::HandleLoadClick(Urho3D::StringHash eventType, Urho3D::VariantMap& eventData) {
const auto element = static_cast<Urho3D::Button*>(eventData[Urho3D::UIMouseClick::P_ELEMENT].GetVoidPtr());
const auto text = dynamic_cast<Urho3D::Text*>(element->GetChild(0));
loadButton->SetVar("LoadFileName", text->GetText());
action(text->GetText());
}
Urho3D::Button* MainMenuLoadPanel::getLoadButton() const {
return loadButton;
}
```
Environment.cpp
```#include "Environment.h"
#include <Urho3D/Graphics/Material.h>
#include <Urho3D/Graphics/Terrain.h>
#include "EnvConsts.h"
#include "GridCalculator.h"
#include "GridCalculatorProvider.h"
#include "database/db_strcut.h"
#include "math/MathUtils.h"
#include "objects/building/Building.h"
#include "objects/resource/ResourceEntity.h"
#include "objects/unit/Unit.h"
#include "utils/consts.h"
#include "utils/OtherUtils.h"
Environment::Environment(Urho3D::Terrain* terrain, unsigned short mainMapResolution):
mapSize(mainMapResolution * BUCKET_GRID_FIELD_SIZE),
mainGrid(mainMapResolution, mapSize, 24),
buildingGrid(mapSize / BUCKET_GRID_FIELD_SIZE_BUILD, mapSize, false, 256.f),
resourceStaticGrid(mapSize / BUCKET_GRID_FIELD_SIZE_RESOURCE, mapSize, {64.f, 128.f, 256.f}),
sparseUnitGrid((short)(mapSize / BUCKET_GRID_FIELD_SIZE_ENEMY), mapSize, false, 256.f),
terrain(terrain), influenceManager(MAX_PLAYERS, mapSize, terrain),
calculator(GridCalculatorProvider::get(mainMapResolution, mapSize)) {
neights = new std::vector<Physical*>();
auto a = {160, 192, 256, 320, 384, 512};
assert(std::ranges::any_of(a, [mainMapResolution](int i) {return mainMapResolution == i; }));
}
Environment::~Environment() {
delete neights;
}
std::vector<Physical*>* Environment::getNeighboursFromSparseSamePlayer(Physical* physical, const float radius,
char player) {
return getNeighbours(physical, sparseUnitGrid, radius,
[player](const Physical* thing) { return thing->getPlayer() == player && thing->isAlive(); });
}
std::vector<Physical*>* Environment::getNeighboursFromTeamNotEq(Physical* physical, const float radius) {
auto player = physical->getPlayer();
return getNeighbours(physical, sparseUnitGrid, radius,
[player](const Physical* thing) { return thing->getPlayer() != player && thing->isAlive(); });
}
bool Environment::isVisible(char player, const Urho3D::Vector2& pos) const {
return influenceManager.isVisible(player, pos);
}
float Environment::getVisibilityScore(char player) const {
return influenceManager.getVisibilityScore(player);
}
std::vector<int> Environment::getIndexesInRange(const Urho3D::Vector3& center, float range) const {
return mainGrid.getIndexesInRange(center, range);
}
void Environment::setTerrainShaderParam(const Urho3D::String& name, const Urho3D::Variant& value) const {
if (terrain && !SIM_GLOBALS.HEADLESS) {
terrain->GetMaterial()->SetShaderParameter(name, value);
}
}
void Environment::flipTerrainShaderParam(const Urho3D::String& name) const {
if (terrain && !SIM_GLOBALS.HEADLESS) {
auto mat = terrain->GetMaterial();
mat->SetShaderParameter(name, !mat->GetShaderParameter(name).GetBool());
}
}
void Environment::nextVisibilityType() {
influenceManager.nextVisibilityType();
}
void Environment::reAddBonuses(std::vector<Building*>* buildings, char player, char resId) const {
mainGrid.reAddBonuses(buildings, player, resId);
}
float Environment::getBonuses(char player, const ResourceEntity* resource) const {
return mainGrid.getBonuses(player, resource);
}
std::vector<Physical*>* Environment::getNeighbours(Physical* physical, Grid& bucketGrid, float radius,
const std::function<bool(Physical*)>& condition) const {
neights->clear();
BucketIterator& bucketIterator = bucketGrid.getArrayNeight(physical->getPosition(), radius);
const float sqRadius = radius * radius;
while (Physical* neight = bucketIterator.next()) {
addIfInRange(physical, neight, sqRadius, condition);
}
return neights;
}
void Environment::addIfInRange(Physical* physical, Physical* neight, const float sqRadius,
const std::function<bool(Physical*)>& condition) const {
if (physical != neight && condition(neight)
&& sqDistAs2D(physical->getPosition(), neight->getPosition()) < sqRadius) {
neights->push_back(neight);
}
}
std::vector<Physical*>* Environment::getNeighboursWithCache(Unit* unit, float radius) {
const auto currentIdx = unit->getMainGridIndex();
assert(currentIdx>=0);
if (mainGrid.onlyOneInside(currentIdx)) {
return getNeighbours(unit, mainGrid, radius, [](Physical* physical) { return true; });
}
const auto simpleNeght = mainGrid.getAllFromCache(currentIdx, radius);
const float sqRadius = radius * radius;
neights->clear();
auto pred = [sqRadius,unit](Physical* neight) {
return (unit != neight && sqDistAs2D(unit->getPosition(), neight->getPosition()) < sqRadius);
};
std::ranges::copy_if(*simpleNeght, std::back_inserter(*neights), pred);
return neights;
}
std::vector<Physical*>* Environment::getNeighbours(const Urho3D::Vector3& center, Grid& bucketGrid, int id,
float radius,
float prevRadius) const {
neights->clear();
BucketIterator& bucketIterator = bucketGrid.getArrayNeight(center, radius);
const float sqRadius = radius * radius;
const float sqPrevRadius = prevRadius < 0.f ? prevRadius : prevRadius * prevRadius;
while (Physical* neight = bucketIterator.next()) {
if (id == -1 || id == neight->getId()) {
auto dist = sqDistAs2D(center, neight->getPosition());
if (dist <= sqRadius && dist > sqPrevRadius) {
neights->push_back(neight);
}
}
}
return neights;
}
const std::vector<Physical*>* Environment::getNeighboursSimilarAs(Physical* clicked) const {
if (!clicked) {
return &Consts::EMPTY_PHYSICAL;
}
return grids[cast(clicked->getType())]->getArrayNeightSimilarAs(clicked, 20.f);
}
std::vector<Physical*>*
Environment::getResources(const Urho3D::Vector3& center, int id, float radius, float prevRadius) {
//return getNeighbours(center, resourceStaticGrid, id, radius, prevRadius);//TODO perf? czy to moze jedna szybsze?
const float sqRadius = radius * radius;
const float sqPrevRadius = prevRadius < 0.f ? prevRadius : prevRadius * prevRadius;
neights->clear();
for (auto neight : resourceStaticGrid.get(center, radius)) {
if (id == -1 || id == neight->getId()) {
auto dist = sqDistAs2D(center, neight->getPosition());
if (dist <= sqRadius && dist > sqPrevRadius) {
neights->push_back(neight);
}
}
}
return neights;
}
std::vector<Physical*>* Environment::getResources(const Urho3D::Vector3& center, int id, float radius) {
return getNeighbours(center, resourceStaticGrid, id, radius, -1);
}
std::vector<Physical*>*
Environment::getBuildingsFromTeamNotEq(Physical* physical, int id, float radius) {
auto team = physical->getTeam();
auto condition = [id, team](const Physical* physical) {
return (id < 0 || physical->getId() == id) && (physical->getTeam() != team || team < 0);
};
return getNeighbours(physical, buildingGrid, radius, condition);
}
void Environment::updateInfluenceUnits1(std::vector<Unit*>* units) const {
influenceManager.update(units);
}
void Environment::updateInfluenceUnits2(std::vector<Unit*>* units) const {
influenceManager.updateQuadUnits(units);
}
void Environment::updateInfluenceResources(std::vector<ResourceEntity*>* resources) const {
influenceManager.update(resources);
}
void Environment::updateInfluenceOther(std::vector<Building*>* buildings, std::vector<Unit*>* units) const {
influenceManager.update(buildings);
influenceManager.updateWithHistory();
influenceManager.updateNotInBonus(units);
}
void Environment::updateQuadOther() const {
influenceManager.updateQuadOther();
}
void Environment::updateVisibility(std::vector<Building*>* buildings, std::vector<Unit*>* units,
std::vector<ResourceEntity*>* resources) const {
influenceManager.updateVisibility(buildings, units, resources);
}
void Environment::update(Unit* unit) const {
unit->setBucket(mainGrid.update(unit, unit->getMainGridIndex()));
unit->setSparseIndex(sparseUnitGrid.update(unit, unit->getSparseIndex()));
}
void Environment::addNew(const std::vector<Unit*>& units) {
for (const auto unit : units) {
assert(unit->getMainGridIndex() == -1);
unit->setBucket(mainGrid.updateNew(unit));
unit->setSparseIndex(sparseUnitGrid.updateNew(unit));
}
invalidateCaches();
}
void Environment::invalidateCaches() {
mainGrid.invalidateCache();
sparseUnitGrid.invalidateCache();
}
void Environment::addNew(Building* building) {
mainGrid.addStatic(building);
mainGrid.addResourceBonuses(building);
buildingGrid.updateNew(building);
building->setIndexInInfluence(influenceManager.getIndex(building->getPosition()));
for (const auto cell : building->getSurroundCells()) {
if (mainGrid.isBuildable(cell)) {
building->setDeploy(cell);
break;
}
}
assert(building->getDeploy().has_value());
mainGrid.addDeploy(building);
}
void Environment::addNew(ResourceEntity* resource, bool bulkAdd) {
mainGrid.addStatic(resource);
resource->setIndexInInfluence(influenceManager.getIndex(resource->getPosition()));
resourceStaticGrid.updateStatic(resource, bulkAdd);
}
Urho3D::Vector2 Environment::repulseObstacle(Unit* unit) const {
return mainGrid.repulseObstacle(unit);
}
std::optional<Urho3D::Vector2> Environment::validatePosition(int index, const Urho3D::Vector3& position) const {
return mainGrid.getDirectionFrom(index, position);
}
const std::vector<Physical*>* Environment::getNeighbours(std::pair<Urho3D::Vector3*, Urho3D::Vector3*>& pair,
char player) {
for (const auto grid : grids) {
const auto result = grid->getArrayNeight(pair, player);
if (!result->empty()) {
return result;
}
}
return &Consts::EMPTY_PHYSICAL;
}
float Environment::getGroundHeightAt(float x, float z) const {
const auto vec = Urho3D::Vector3(x, 0, z);
return getGroundHeightAt(vec);
}
float Environment::getGroundHeightAt(const Urho3D::Vector3& pos) const {
if (terrain != nullptr) {
return terrain->GetHeight(pos);
}
return 0.f;
}
Urho3D::Vector3 Environment::getPosWithHeightAt(float x, float z) const {
return Urho3D::Vector3(x, getGroundHeightAt(x, z), z);
}
Urho3D::Vector3 Environment::getPosWithHeightAt(int index) const {
const auto center = calculator->getCenter(index);
return getPosWithHeightAt(center.x_, center.y_);
}
float Environment::getGroundHeightPercentScaled(float x, float z, float div) const {
if (terrain != nullptr) {
return getGroundHeightAt(getPosFromPercent(x), getPosFromPercent(z)) / terrain->GetSpacing().y_ / div;
}
return 0.f;
}
bool Environment::validateStatic(const Urho3D::IntVector2& size, Urho3D::Vector2& pos, bool isBuilding) const {
return mainGrid.validateAdd(size, {calculator->getIndex(pos.x_), calculator->getIndex(pos.y_)}, isBuilding);
}
bool Environment::validateStatic(const Urho3D::IntVector2& size, const Urho3D::IntVector2 bucketCords,
bool isBuilding) const {
return mainGrid.validateAdd(size, bucketCords, isBuilding);
}
Urho3D::Vector2 Environment::getCenter(int index) const {
return calculator->getCenter(index);
}
Urho3D::Vector2 Environment::getCenter(short x, short z) const {
return getCenter(calculator->getIndex(x, z));
}
Urho3D::Vector2 Environment::getPositionInBucket(Unit* unit) const {
return mainGrid.getPositionInBucket(unit);
}
void Environment::invalidatePathCache() {
mainGrid.invalidatePathCache();
}
bool Environment::cellInState(int index, CellState state) const {
return mainGrid.cellInState(index, state);
}
void Environment::updateCell(int index, char val, CellState cellState) const {
mainGrid.updateCell(index, val, cellState);
}
void Environment::removeFromGrids(const std::vector<Unit*>& units) const {
for (const auto unit : units) {
mainGrid.removeAt(unit->getMainGridIndex(), unit);
sparseUnitGrid.removeAt(unit->getSparseIndex(), unit);
}
}
void Environment::removeFromGrids(const std::vector<Building*>& buildingsToDispose,
const std::vector<ResourceEntity*>& resourceToDispose) const {
for (const auto building : buildingsToDispose) {
mainGrid.removeStatic(building);
mainGrid.removeDeploy(building);
buildingGrid.remove(building);
}
for (const auto resource : resourceToDispose) {
mainGrid.removeStatic(resource);
resourceStaticGrid.remove(resource);
}
}
unsigned char Environment::getRevertCloseIndex(int center, int gridIndex) const {
return mainGrid.getRevertCloseIndex(center, gridIndex);
}
void Environment::drawDebug(EnvironmentDebugMode environmentDebugMode, char index) {
if (environmentDebugMode == EnvironmentDebugMode::MAIN_GRID) {
mainGrid.drawDebug(GridDebugType(index % magic_enum::enum_count<GridDebugType>()));
}
influenceManager.draw(ENV_TO_INF_MAP[cast(environmentDebugMode)], index);
}
const std::vector<short>& Environment::getCloseIndexs(int center) const {
return mainGrid.getCloseIndexes(center);
}
const std::vector<unsigned char>& Environment::getCloseTabIndexes(int center) const {
return mainGrid.getCloseTabIndexes(center);
}
std::array<float, 5>& Environment::getInfluenceDataAt(char player, const Urho3D::Vector2& pos) {
return influenceManager.getInfluenceDataAt(player, pos);
}
std::optional<Urho3D::Vector2> Environment::getPosFromIndexes(db_building* building, char player,
const std::vector<int>* indexes) {
const float ratio = influenceManager.getFieldSize() / mainGrid.getFieldSize();
for (const auto centerIndex : *indexes) {
Urho3D::Vector2 center = influenceManager.getCenter(centerIndex);
for (const auto index : mainGrid.getCloseCenters(center, ratio)) {
//ten index jest widoczny
auto gridCenter = calculator->getCenter(index);
if (validateStatic(building->size, gridCenter, true) && influenceManager.isVisible(player, gridCenter)) {
return gridCenter;
}
}
}
return {};
}
std::optional<Urho3D::Vector2> Environment::getPosToCreate(const std::span<float> result, ParentBuildingType type,
db_building* building,
char player) {
const std::vector<int>* indexes = influenceManager.getAreas(result, type, player);
return getPosFromIndexes(building, player, indexes);
}
std::optional<Urho3D::Vector2> Environment::getPosToCreateResBonus(db_building* building, char player) {
std::vector<int> allIndexes;
for (const char id : building->resourceTypes) {
const std::vector<int>* indexes = influenceManager.getAreasResBonus(id, player);
allIndexes.insert(allIndexes.end(), indexes->begin(), indexes->end());
}
return getPosFromIndexes(building, player, &allIndexes);
}
std::vector<Urho3D::Vector2> Environment::getAreas(char player, const std::span<float> result, int min) {
return influenceManager.getAreasIterative(result, player, 0.1, min);
}
void Environment::addCollect(Unit* unit, char resId, float value) {
influenceManager.addCollect(unit, resId, value);
}
void Environment::addAttack(char player, const Urho3D::Vector3& position, float value) {
influenceManager.addAttack(player, position, value);
}
void Environment::drawInfluence() {
influenceManager.drawAll();
mainGrid.drawAll();
}
bool Environment::cellIsPassable(int index) const {
return mainGrid.isPassable(index);
}
bool Environment::cellIsCollectable(int index) const {
return mainGrid.cellIsCollectable(index);
}
bool Environment::cellIsAttackable(int index) const {
return mainGrid.cellIsAttackable(index);
}
std::optional<Urho3D::Vector2> Environment::getCenterOf(CenterType type, char player) {
return influenceManager.getCenterOf(type, player);
}
float Environment::getDiffOfCenters(CenterType type1, char id1, CenterType type2, char id2, float dfVal) {
const auto optCenter1 = getCenterOf(type1, id1);
if (!optCenter1.has_value()) { return dfVal; }
const auto optCenter2 = getCenterOf(type2, id2);
if (!optCenter2.has_value()) { return dfVal; }
return (optCenter1.value() - optCenter2.value()).Length()
/ (calculator->getFieldSize() * calculator->getResolution());
}
bool Environment::anyCloseEnough(std::vector<int> const& indexes, int center, float distThreshold) const {
return mainGrid.anyCloseEnough(indexes, center, distThreshold);
}
bool Environment::isInLocalArea(int getMainCell, int aimIndex) const {
return mainGrid.isInLocalArea(getMainCell, aimIndex);
}
bool Environment::isInLocal1and2Area(int getMainCell, int aimIndex) const {
return mainGrid.isInLocal1and2Area(getMainCell, aimIndex);
}
int Environment::closestPassableCell(int posIndex) const {
return mainGrid.closestPassableCell(posIndex);
}
Urho3D::Vector2 Environment::getValidPosition(const Urho3D::IntVector2& size, const Urho3D::Vector2& pos) const {
return mainGrid.getValidPosition(size, pos);
}
Urho3D::Vector2 Environment::getValidPosition(const Urho3D::IntVector2& size,
const Urho3D::IntVector2& bucketCords) const {
return mainGrid.getValidPosition(size, getCenter(calculator->getIndex(bucketCords.x_, bucketCords.y_)));
}
const std::vector<int>* Environment::findPath(int startIdx, const Urho3D::Vector2& aim) {
auto end = calculator->indexFromPosition(aim);
auto dist = calculator->getBiggestDiff(startIdx, end);
dist = dist < 9 ? 9 : dist;
return mainGrid.findPath(startIdx, end, dist * sqrt(dist));
}
const std::vector<int>* Environment::findPath(int startIdx, const std::vector<int>& endIdxs) {
auto dist = calculator->getBiggestDiff(startIdx, endIdxs);
dist = dist < 9 ? 9 : dist;
return mainGrid.findPath(startIdx, endIdxs, dist * sqrt(dist));
}
const std::vector<int>* Environment::findPath(int startIdx, int endIdx, int limit) {
return mainGrid.findPath(startIdx, endIdx, limit);
}
void Environment::prepareGridToFind() const {
mainGrid.prepareGridToFind();
}
content_info* Environment::getContentInfo(Urho3D::Vector2 centerPercent, bool checks[], int activePlayer) {
const float x = getPosFromPercent(centerPercent.x_);
const float z = getPosFromPercent(centerPercent.y_);
const CellState state = mainGrid.getCellAt(x, z);
const int addInfo = mainGrid.getAdditionalInfoAt(x, z);
return influenceManager.getContentInfo({x, z}, state, addInfo, checks, activePlayer);
}
float Environment::getPosFromPercent(float value) const {
return mapSize * (value - 0.5);
}
Urho3D::Vector2 Environment::getPosFromPercent(float x, float z) const {
return {getPosFromPercent(x), getPosFromPercent(z)};
}
Physical* Environment::closestPhysical(Unit* unit, const std::vector<Physical*>* things,
const std::function<bool(Physical*)>& condition, int limit) {
if (things->empty()) {
return nullptr;
}
std::vector<int> allIndexes;
std::unordered_map<int, Physical*> idxToPhysical;
for (const auto entity : *things) {
if (entity->isAlive() && condition(entity)) {
auto const idxs = entity->getIndexesForUse(unit);
allIndexes.insert(allIndexes.end(), idxs.begin(), idxs.end());
for (auto idx : idxs) {
idxToPhysical[idx] = entity;
}
}
}
if (!allIndexes.empty()) {
const auto path = mainGrid.findPath(unit->getMainGridIndex(), allIndexes, limit);
if (!path->empty()) {
return idxToPhysical[path->back()];
}
}
return nullptr;
}
Physical* Environment::closestPhysicalSimple(const Physical* physical, const std::vector<Physical*>* things,
float range) const {
if (things->empty()) {
return nullptr;
}
range *= range;
float closestDist = 9999999;
Physical* closest = nullptr;
const auto center = physical->getPosition();
for (const auto entity : *things) {
const float dist = sqDistAs2D(center, entity->getPosition());
if (dist < closestDist && dist <= range) {
closestDist = dist;
closest = entity;
}
}
return closest;
}
```
OtherUtils.h
```#pragma once
template <typename T>
char cast(T type) {
return static_cast<char>(type);
}
inline size_t key(int i, int j) { return (size_t)i << 32 | (unsigned int)j; }```
HealthBarProvider.h
```#pragma once
enum class ObjectType : char;
namespace Urho3D {
class UIElement;
class ProgressBar;
class String;
}
class HealthBarProvider {
public:
HealthBarProvider() = default;
HealthBarProvider(const HealthBarProvider& rhs) = delete;
~HealthBarProvider();
void init();
void reset(int size, ObjectType type);
void hide(Urho3D::ProgressBar* bar);
Urho3D::ProgressBar* createNew(const Urho3D::String& style);
Urho3D::ProgressBar* getNext(ObjectType type);
private:
Urho3D::ProgressBar** createSet(int size) const;
Urho3D::ProgressBar** resourceBars{};
Urho3D::ProgressBar** playerBars{};
Urho3D::UIElement* root;
int playerIdx = 0;
int resIdx = 0;
};
```
GroupUtils.h
```#pragma once
#include <vector>
#include <objects/unit/Unit.h>
#include <Game.h>
#include "env/Environment.h"
inline bool addToGroup(std::vector<std::vector<int>>& groupedIndexes, int current) {
for (auto& groupedIndex : groupedIndexes) {
const auto isNear = std::ranges::any_of(groupedIndex, [current](int index) {
return Game::getEnvironment()->isInLocal1and2Area(current, index);
});
if (isNear) {
groupedIndex.push_back(current);
return true;
}
}
return false;
}
inline std::vector<std::vector<Unit*>> divide(const std::vector<Unit*>& units) {
std::vector<int> allIndexes;
allIndexes.reserve(units.size());
for (auto* unit : units) {
allIndexes.push_back(unit->getMainGridIndex());
}
std::ranges::sort(allIndexes);
allIndexes.erase(std::unique(allIndexes.begin(), allIndexes.end()), allIndexes.end());
std::vector<std::vector<int>> groupedIndexes;
for (int current : allIndexes) {
const bool added = addToGroup(groupedIndexes, current);
if (!added) {
std::vector<int> temp;
temp.push_back(current);
groupedIndexes.push_back(temp);
}
}
//merge
std::vector<std::vector<int>> newGroupedIndexes;
for (int i = 0; i < groupedIndexes.size(); ++i) {
const auto& current = groupedIndexes[i];
if (current.empty()) { continue; }
std::vector<int> merged = current;
for (int j = i + 1; j < groupedIndexes.size(); ++j) {
auto& next = groupedIndexes[j];
for (auto value : current) {
const auto isNear = std::ranges::any_of(next, [value](int index) {
return Game::getEnvironment()->isInLocal1and2Area(value, index);
});
if (isNear) {
merged.insert(merged.end(), next.begin(), next.end());
next.clear();
}
}
}
newGroupedIndexes.push_back(merged);
}
groupedIndexes = newGroupedIndexes;
std::vector<std::vector<Unit*>> result;
result.reserve(groupedIndexes.size());
for (auto& groupedIndex : groupedIndexes) {
std::vector<Unit*> temp;
//temp.reserve()
for (auto index : groupedIndex) {
for (auto value : units) {
if (value->getMainGridIndex() == index) {
temp.push_back(value);
}
}
}
result.push_back(temp);
}
return result;
}
inline Urho3D::Vector2 computeLocalCenter(const std::vector<Unit*>& units) {
auto localCenter = Urho3D::Vector2::ZERO;
for (auto* unit : units) {
const auto pos = unit->getPosition();
localCenter.x_ += pos.x_;
localCenter.y_ += pos.z_;
}
localCenter /= units.size();
return localCenter;
}
```
MapsUtils.h
```#pragma once
#include <vector>
constexpr char MAX_DEBUG_PARTS_INFLUENCE = 32;
constexpr char INF_LEVEL = 4;
constexpr short INF_GRID_FIELD_SIZE = 8.f;
constexpr short VISIBILITY_GRID_FIELD_SIZE = INF_GRID_FIELD_SIZE / 2;
namespace MapsUtils {
template <typename T>
void resetMaps(const std::vector<T*>& maps) {
for (auto map : maps) {
map->reset();
}
}
template <typename T>
void finalize(const std::vector<T*>& maps) {
for (auto map : maps) {
map->updateFromTemp();
}
}
template <typename T>
void drawAll(const std::vector<T*>& maps, Urho3D::String name) {
for (int i = 0; i < maps.size(); ++i) {
maps[i]->print(name + "_" + Urho3D::String(i) + "_");
}
}
template <typename T>
void drawMap(short currentDebugBatch, char index, const std::vector<T*>& maps) {
index = index % maps.size();
maps[index]->draw(currentDebugBatch, MAX_DEBUG_PARTS_INFLUENCE);
}
}```
DebugLineRepo.h
```#pragma once
#include <magic_enum.hpp>
#include <vector>
#include <Urho3D/Math/Color.h>
namespace Urho3D {
class Vector3;
class CustomGeometry;
}
enum class CellState : char;
enum class DebugLineType : char {
UNIT_LINES,
MAIN_GRID,
INFLUENCE
};
class DebugLineRepo {
public:
~DebugLineRepo();
static void commit(DebugLineType type, short batch = 0);
static void beginGeometry(DebugLineType type, short batch = 0);
static void clear(DebugLineType type, short batch = 0);
static void drawLine(DebugLineType type, const Urho3D::Vector3& first, const Urho3D::Vector3& second,
const Urho3D::Color& color = Urho3D::Color::WHITE, short batch = 0);
static void drawTriangle(DebugLineType type, const Urho3D::Vector3& first, const Urho3D::Vector3& second,
const Urho3D::Vector3& third, const Urho3D::Color& color = Urho3D::Color::WHITE, short batch =0);
static void init(DebugLineType type);
static void init(DebugLineType type, short batches);
static void dispose();
private:
DebugLineRepo() = default;
static std::vector<Urho3D::CustomGeometry*> geometry[magic_enum::enum_count<DebugLineType>()];
};
```
Loading.h
```#pragma once
#include <chrono>
#include <string>
#include <iostream>
#include <utility>
struct Loading {
Loading(unsigned char stages, bool ifPrint = true): stagesNumber(stages), ifPrint(ifPrint) {
reset();
}
Loading(const Loading&) = delete;
~Loading() = default;
float getProgress() const {
return currentStage / (float)stagesNumber;
}
void reset() {
currentStage = 0;
start = std::chrono::system_clock::now();
}
void reset(std::string _msg) {
msg = std::move(_msg);
reset();
}
void inc(std::string _msg) {
if (ifPrint) {
auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(
std::chrono::system_clock::now() - start);
std::cout << (int)currentStage << " completed (" << msg.c_str() << ") at " << duration.count() << " ms" <<
std::endl;
start = std::chrono::system_clock::now();
msg = std::move(_msg);
}
inc();
}
void inc() {
++currentStage;
}
unsigned char currentStage;
private:
const unsigned char stagesNumber;
const bool ifPrint;
std::string msg = "";
std::chrono::system_clock::time_point start;
};
```
LevelBuilder.h
```#pragma once
#include <Urho3D/Container/Ptr.h>
namespace Urho3D
{
class Material;
class Scene;
class Terrain;
}
class SceneLoader;
struct NewGameForm;
class LevelBuilder {
public:
LevelBuilder();
~LevelBuilder();
void createScene(SceneLoader& loader);
void createMap(int mapId, int size);
void createScene(NewGameForm* form);
Urho3D::Terrain* getTerrain() const;
private:
Urho3D::Scene * scene;
void createGround(const Urho3D::String& xmlName, int size);
Urho3D::Terrain* terrain{};
Urho3D::SharedPtr<Urho3D::Material> darkMat;
Urho3D::SharedPtr<Urho3D::Material> extraDarkMat;
};
```
|
zumod/kingslabs-tinyMCE
|
zumod/kingslabs-tinyMCE
user.sql
```-- phpMyAdmin SQL Dump
-- version 5.0.2
-- https://www.phpmyadmin.net/
--
-- Host: 127.0.0.1
-- Generation Time: Jun 28, 2020 at 06:18 PM
-- Server version: 10.4.13-MariaDB
-- PHP Version: 7.4.7
SET SQL_MODE = "NO_AUTO_VALUE_ON_ZERO";
START TRANSACTION;
SET time_zone = "+00:00";
/*!40101 SET @OLD_CHARACTER_SET_CLIENT=@@CHARACTER_SET_CLIENT */;
/*!40101 SET @OLD_CHARACTER_SET_RESULTS=@@CHARACTER_SET_RESULTS */;
/*!40101 SET @OLD_COLLATION_CONNECTION=@@COLLATION_CONNECTION */;
/*!40101 SET NAMES utf8mb4 */;
--
-- Database: `demo`
--
-- --------------------------------------------------------
--
-- Table structure for table `user`
--
CREATE TABLE `user` (
`id` int(100) NOT NULL,
`name` varchar(10000) NOT NULL
) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4;
--
-- Dumping data for table `user`
--
INSERT INTO `user` (`id`, `name`) VALUES
(2, '<p>yegyewgygiygdi</p>'),
(3, '<p>bhbhbhbhb</p>'),
(4, '<p>hhhbhjhjhg<strong>nbbjhbkh<em>jkjkjhkjhjjjj</em></strong></p>'),
(5, '<p>hrbhgfshrfgsuyfifuvsgiuygisfdu</p>'),
(6, '<p style=\"text-align: justify; padding-left: 200px;\">ifdjndih<strong>jscldkjlnji<em>dljkljaLSDwkejwd'),
(7, '<p style=\"text-align: justify; padding-left: 200px;\">ifdjndih<strong>jscldkjlnji<em>dljkljaLSDwkejwdejwJHDNSIHDOISUSKAnlisii</em></strong></p>'),
(8, '<table style=\"border-collapse: collapse; width: 100%;\" border=\"1\">\r\n<tbody>\r\n<tr>\r\n<td style=\"width: 25%;\">uyguyg</td>\r\n<td style=\"width: 25%;\">jhj</td>\r\n<td style=\"width: 25%;\">hbhjb</td>\r\n<td style=\"width: 25%;\">jhkjhk</td>\r\n</tr>\r\n<tr>\r\n<td style=\"width: 25%;\">hkhgkjh</td>\r\n<td style=\"width: 25%;\">hghjghj</td>\r\n<td style=\"width: 25%;\">ghyghyg</td>\r\n<td style=\"width: 25%;\">bb</td>\r\n</tr>\r\n</tbody>\r\n</table>'),
(9, '<table style=\"border-collapse: collapse; width: 100%;\" border=\"1\">\r\n<tbody>\r\n<tr>\r\n<td style=\"width: 20%;\">jijiju</td>\r\n<td style=\"width: 20%;\">njnjnjn</td>\r\n<td style=\"width: 20%;\">hhbhbh</td>\r\n<td style=\"width: 20%;\">vbv</td>\r\n<td style=\"width: 20%;\">jkjbkhjb</td>\r\n</tr>\r\n<tr>\r\n<td style=\"width: 20%;\">jjnjjn</td>\r\n<td style=\"width: 20%;\">jnjnjn</td>\r\n<td style=\"width: 20%;\">klkjnljn</td>\r\n<td style=\"width: 20%;\">jnkjnjn</td>\r\n<td style=\"width: 20%;\">iuihuih</td>\r\n</tr>\r\n<tr>\r\n<td style=\"width: 20%;\">ijuhjuh</td>\r\n<td style=\"width: 20%;\">jj</td>\r\n<td style=\"width: 20%;\">jj</td>\r\n<td style=\"width: 20%;\">n</td>\r\n<td style=\"width: 20%;\">jjj</td>\r\n</tr>\r\n</tbody>\r\n</table>'),
(10, '<p>jivgnnguhrukjnjh</p>\r\n<p>njnh</p>\r\n<p>kmkml</p>\r\n<table style=\"border-collapse: collapse; width: 100%; height: 42px;\" border=\"1\">\r\n<tbody>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n</tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n<td style=\"width: 25%; height: 21px;\">g</td>\r\n</tr>\r\n</tbody>\r\n</table>');
--
-- Indexes for dumped tables
--
--
-- Indexes for table `user`
--
ALTER TABLE `user`
ADD PRIMARY KEY (`id`);
--
-- AUTO_INCREMENT for dumped tables
--
--
-- AUTO_INCREMENT for table `user`
--
ALTER TABLE `user`
MODIFY `id` int(100) NOT NULL AUTO_INCREMENT, AUTO_INCREMENT=11;
COMMIT;
/*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */;
/*!40101 SET CHARACTER_SET_RESULTS=@OLD_CHARACTER_SET_RESULTS */;
/*!40101 SET COLLATION_CONNECTION=@OLD_COLLATION_CONNECTION */;
```
index.php
```<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title>demo</title>
<meta content="width=device-width, initial-scale=1, maximum-scale=1, user-scalable=no" name="viewport">
<link rel="stylesheet" href="../bower_components/bootstrap/dist/css/bootstrap.min.css">
<script src="https://cdn.tiny.cloud/1/no-api-key/tinymce/5/tinymce.min.js" referrerpolicy="origin"></script>
<script>
tinymce.init({
selector: '#mytextarea',
plugins: "table",
menubar: "table",
toolbar: "table tabledelete | tableprops tablerowprops tablecellprops | tableinsertrowbefore tableinsertrowafter tabledeleterow | tableinsertcolbefore tableinsertcolafter tabledeletecol"
});
</script>
</head>
<?php
include'connection.php';
if (isset($_POST['submit']))
{
$name=$_POST['name'];
if ($name==NULL)
{
$link_ad1='index.php';
echo "<h2><strong>Nothing to save.. Please enter something</strong></h2><br/><br/><a href='". $link_ad1."''>Back</a>";
}
else
{
$ins= "insert into user values('','$name')";
mysqli_query( $mysqli,$ins);
echo "<h2><strong>Data successfully stored in the database</strong></h2><br/><br/>";
$link_ad2='index.php';
echo "<a href='". $link_ad2 ."'> back</a> ";
}
}
else
{
?>
<body>
<div class="wrapper">
<section class="content">
<br>
<center>
<h1> <u><strong>Text Editor</strong></u></h1>
<form method="post" action="index.php" autocomplete="off">
<div class="row">
<div class="col-md-4">
<textarea id="mytextarea" name="name" placeholder="your content here"></textarea>
<table id="table"></table>
</div>
<br><br/><br/>
<div class="col-md-2 pull-right">
<input type="submit" name="submit" value="Submit" class="btn checkbox-inline btn-primary " />
</div>
</form>
</section>
</div>
<?php
}
?>
</body>
</html>
```
|
zunda/gist
|
zunda/gist
gist-cat.rb
```#!/usr/bin/env ruby
# gist-cat.rb - a small command line tool to handle data to/from gist
#
# Copyright (c) 2009 zunda
#
# Permission is granted for use, copying, modification, distribution,
# and distribution of modified versions of this work as long as the
# above copyright notice is included.
#
require 'net/http'
Net::HTTP.version_1_2
require 'uri'
class Gist
class Error < Exception; end
def Gist.proxy
(proxy = ENV['http_proxy']) ? URI.parse(proxy) : nil
end
class Push
def Push.auth
user = `git config github.user`.strip
raise Gist::Error, 'github.user is not set' if user.empty?
token = `git config github.token`.strip
raise Gist::Error, 'github.token is not set' if token.empty?
return {'login' => user, 'token' => token}
end
def Push.url
return URI.parse('http://gist.github.com/gists')
end
attr_reader :url
def initialize(private = false, anonymous = false)
@contents = Array.new
@private = private
@anonymous = anonymous
end
def add(data, path = nil)
@contents.push([data, path])
end
def form
raise Gist::Error, 'No input is specified' if @contents.empty?
h = Hash.new
@contents.each_with_index do |content, idx|
data, path = content
h["file_ext[gistfile#{idx+1}]"] = nil
h["file_name[gistfile#{idx+1}]"] = path ? File.basename(path) : nil
h["file_contents[gistfile#{idx+1}]"] = data
end
h['private'] = 'on' if @private
h.merge!(Push.auth) unless @anonymous
return h
end
def post!
res = Net::HTTP::Proxy(Gist.proxy).post_form(Push.url, form)
case res
when Net::HTTPFound
@url = res['location']
return self
else
raise Gist::Error, "#{res.code} #{res.message}"
end
return nil
end
end
end
if __FILE__ == $0
require 'optparse'
opt = OptionParser.new
opt.banner = "Usage: #{File.basename($0)} [options] [file(s)]\nPosts stdin or file(s) to gist.github.com"
is_anon = false
is_priv = false
is_dry = false
opt.on('-a', '--anonymous', 'Posts gist as anonymous'){is_anon = true}
opt.on('-p', '--private', 'Makes gist private'){is_priv = true}
opt.on('-n', '--dryrun', 'Does not post. Prints data to be sent.'){is_dry = true}
opt.on('-h', '--help', 'Prints this message and quit'){
puts opt.help
exit 0
}
begin
opt.parse!
rescue OptionParser::InvalidOption
$stderr.puts $!
$stderr.puts opt.help
exit 1
end
begin
gist = Gist::Push.new(is_priv, is_anon)
unless ARGV.empty?
ARGV.each do |src|
File.open(src) do |f|
gist.add(f.read, src)
end
end
else
gist.add($stdin.read)
end
unless is_dry
gist.post!
puts gist.url
else
require 'pp'
pp gist.form
end
rescue Gist::Error
$stderr.puts $!
exit 1
end
end
```
|
zuojihong/QuoteReader
|
zuojihong/QuoteReader
quoteReader.js
```var http = require('http');
var mongoose = require('mongoose');
var buffer = '';
var options = {
host : 'hq.sinajs.cn',
port : 80,
path : '/list=sh000001',
method : 'GET'
};
var dbName = 'stock_db';
var addr = process.env.MONGO_PORT_27017_TCP_ADDR || 'silverreef.chinacloudapp.cn';
var uri = 'mongodb://' + addr + ':27017/' + dbName;
console.info('mongodb uri: ' + uri);
mongoose.connect(uri, function(err) {
console.info('connection status: ' + (err ? err.message : 'ok'));
});
var db = mongoose.connection;
db.on('error', function(err) {
console.error('failed to connect to mongo db: ' + err.message);
});
db.once('open', function() {
console.info('succeed to connect to mongo db');
});
var Schema = mongoose.Schema;
var QuoteSchema = new Schema({
code: String,
time: Number,
price: Number
});
exports.fetchStockData = function() {
var quoteReq = http.get(options, function(quoteRes) {
console.log('res statusCode: ' + quoteRes.statusCode);
var quoteData = null;
quoteRes.on('data', function(chunk) {
buffer += chunk.toString();
});
quoteRes.on('end', function() {
quoteData = extractData();
buffer = '';
if (quoteData != null) {
storeData(quoteData.code, quoteData.price, quoteData.time);
} else {
console.error("failed to fetch data from sina: quoteData is null");
}
});
});
quoteReq.on('error', function(err) {
console.error('request to fetch data failed' + err.message);
});
quoteReq.end();
}
function extractData() {
console.log('extractData: ' + buffer);
var quoteStr = buffer.substring(buffer.indexOf('\"') + 1, buffer.lastIndexOf('\"'));
var paramArr = quoteStr.split(',');
var curPrice = paramArr[3];
var dateArr = paramArr[30].split('-');
var timeArr = paramArr[31].split(':');
var date = new Date(parseInt(dateArr[0]), parseInt(dateArr[1])-1, parseInt(dateArr[2]),
parseInt(timeArr[0]), parseInt(timeArr[1]), parseInt(timeArr[2]));
date.setTime(date.getTime() + getUtcDiff());
console.log('price=' + curPrice + ', date=' + date.toString());
return {code: 'sh000001', price: curPrice, time: date.getTime()};
}
function getUtcDiff() {
var d = new Date();
return (-8) * 3600000;
}
function storeData(code, price, time) {
console.log('\nstoreData: code=' + code + ', price=' + price + ', date=' + time);
var model = mongoose.model('Quote', QuoteSchema, 'stocks');
var quoteExisted = model
.find({code : code})
.where('time').equals(time)
.exec(function(err, quotes) {
var quoteExisted = false;
if (err) {
console.error("failed to query data from mongodb: " + err.message);
}
if (quotes != null && quotes.length > 0) {
quoteExisted = true;
console.log('quote already existed. Wont insert data');
}
if (quoteExisted == false) {
console.log('try to insert new quote to mongodb');
var quote = new model({code: code, time: time, price: price});
quote.save(function(err) {
if (err) console.error(err);
else console.log('data inserted to mongodb');
});
}
else {
console.log('Quote data not inserted: quote at time ' + time + ' already existed in db');
}
});
}
```
README.md
```# QuoteReader
```
server.js
```var http = require('http');
var quoteReader = require('./quoteReader');
var port = process.env.port || 8886;
setInterval(quoteReader.fetchStockData, 5000);
http.createServer(function (req, res) {
res.writeHead(200, { 'Content-Type': 'text/plain' });
res.end('QuoteReader Started\n');
}).listen(port);```
|
zuoliguang/thinkphp5-main
|
zuoliguang/thinkphp5-main
MYModel.php
```<?php
namespace app\core;
use think\Model;
use think\Db;
use think\Config;
class MYModel extends Model
{
function __construct()
{
parent::__construct();
$this->DB = Db::connect(Config::get('database.db_local')); // 链接 db_local 配置的数据库
}
}```
MYController.php
```<?php
namespace app\core;
use think\Controller;
class MYController extends Controller
{
function __construct()
{
parent::__construct();
}
}```
Test.php
```<?php
namespace app\model;
use app\core\MYModel; // 自定义类
class Test extends MYModel
{
function __construct() {
parent::__construct();
}
protected $table = 'tttt';
public static function get_defult_user()
{
return ['id'=>1223,'name'=>'zuoliguang'];
}
// 增加
public function add($test)
{
// 单个添加
$this->DB->table('tttt')->insert($test);
return $this->DB->table('tttt')->getLastInsID();
}
public function add_batch($data)
{
// 批量添加
return $this->DB->table('tttt')->insertAll($data);
}
// 查找
public function get_by_id($id)
{
// return $this->DB->query("SELECT * FROM tttt WHERE id = :id", ['id'=>$id]);
return $this->DB->table('tttt')->where('id', $id)->find();
}
public function getAll()
{
return $this->DB->query("SELECT * FROM tttt");
}
// 更新
public function edite($id, $test)
{
// 更新1
return $this->DB->table('tttt')->where('id', $id)->update($test);
// 更新2
// $test['id'] = $id; // 含有主键
// return $this->DB->table('tttt')->update($test);
// 更新某个字段的值
// return $this->DB->table('tttt')->where('id',1)->setField('string', 'thinkphp');
// 自增或自减一个字段的值
// return $this->DB->table('tttt')->where('id', 1)->setInc('count', 10); // count 字段加 10
// return $this->DB->table('tttt')->where('id', 2)->setInc('count', 10); // count 字段加 10
// return $this->DB->table('tttt')->where('id', 6)->setDec('count', 10); // count 字段减 10
// return $this->DB->table('tttt')->where('id', 7)->setDec('count', 10); // count 字段减 10
// 快捷更新
// return $this->DB->table('tttt')->where('id',3)->inc('count',8)->exp('string','UPPER(string)')->update();
}
// 删除 返回删除的条数
public function del($id, $condition='')
{
// 根据主键删除
if (!is_array($id) && empty($condition)) {
return $this->DB->table('tttt')->delete($id); // 单个 1
// return $this->DB->table('tttt')->where('id', $id)->delete(); // 单个 2
} elseif (is_array($id) && empty($condition)) {
return $this->DB->table('tttt')->delete($id); // 批量
} elseif (!is_array($id) && !empty($condition)) {
// 条件删除
return $this->DB->table('tttt')->where('id', $condition, $id)->delete();
} else {
return false;
}
}
}```
Index.php
```<?php
namespace app\study\controller;
use app\core\MYController; // 自定义类
use think\Config;
use think\Request;
use app\model\Test;
class Index extends MYController
{
function __construct() {
parent::__construct();
// Request::instance()->user = ['id'=>1223,'name'=>'zuoliguang']; // 手动注入用户的信息 1
Request::instance()->bind('user', \app\model\Test::get_defult_user()); // 手动注入用户的信息 2
}
// 首页展示
public function index()
{
return 'Hello World!';
// 数据输出友好
// return json(['a'=>1,'b'=>2]);
// return xml(['a'=>1,'b'=>2]);
}
// 跳转
public function test_redirect()
{
$this->success('测试跳转成功', 'study/index/index');
// $this->error('新增失败');
}
// 当有空操作时
public function _empty($name)
{
return '空操作:'.$name;
}
// 查看当前访问地址元素信息
public function test_pinfo(Request $request)
{
$module = $request->module(); // 模块
$controller = $request->controller(); // 控制器
$action = $request->action(); // 函数
$langset = $request->langset(); // 语言
$header = $request->header(); // 头信息
$user = $request->user; // 获取初始化时注入的用户信息
var_dump($module);
var_dump($controller);
var_dump($action);
var_dump($langset);
var_dump($header);
var_dump($user);
}
public function test_model()
{
$test = new Test();
var_dump($test);
}
public function test_db()
{
$test = new Test();
// $id = 1;
// $data = $test->get_by_id($id); //查询
// return json($data);
// $data = $test->getAll(); //获取所有
// return json($data);
// $insertId = $test->add(['count'=>99,'string'=>'this is an shenqideguodu! 中国话！']); // 新增
// var_dump($insertId);
// $data = [
// ['count'=>5],
// ['count'=>4]
// ];
// $res = $test->add_batch($data); // 批量新增
// var_dump($res);
// $id = 6;
// $updateData = ['count'=>100,'string'=>'更新测试！jjj']; // 更新
// $res = $test->edite($id, $updateData);
// var_dump($res);
// $res = $test->del(1); // 删除
// $res = $test->del([4,5]);
// $res = $test->del(8, ">=");
// var_dump($res);
}
public function test_view()
{
$data = [
'name'=>'zuoliguang'
];
return $this->fetch('study/index', $data);
}
public function test_ext()
{
}
public function test_comm()
{
}
public function test_nosql()
{
}
public function test_hook()
{
}
}
```
|
zuones/GreedySnake
|
zuones/GreedySnake
TouchMoveView.java
```package com.zhjaid.GreedySnake;
import android.content.Context;
import android.util.AttributeSet;
import android.view.MotionEvent;
import android.view.View;
import android.widget.Toast;
import androidx.annotation.Nullable;
/**
* from:zhjaid
* email:zhjaid@163.com
*/
public class TouchMoveView extends View {
public TouchMoveView(Context context, @Nullable AttributeSet attrs) {
super(context, attrs);
}
public TouchMoveView(Context context, @Nullable AttributeSet attrs, int defStyleAttr) {
super(context, attrs, defStyleAttr);
}
int mX, mY;
int yX, yY;
@Override
public boolean onTouchEvent(MotionEvent event) {
int y = (int) event.getY();
int x = (int) event.getX();
int action = event.getAction();
if (action == MotionEvent.ACTION_DOWN) {
mX = x;
mY = y;
}
if (action == MotionEvent.ACTION_MOVE) {
}
if (action == MotionEvent.ACTION_UP) {
yX = x;
yY = y;
if (mY - yY > 555) {
Toast.makeText(getContext(), "向上", Toast.LENGTH_LONG).show();
return true;
}
if (yY - mY > 555) {
Toast.makeText(getContext(), "向下", Toast.LENGTH_LONG).show();
return true;
}
if (mX - yX > 300) {
Toast.makeText(getContext(), "向左", Toast.LENGTH_LONG).show();
return true;
}
if (yX - mX > 300) {
Toast.makeText(getContext(), "向右", Toast.LENGTH_LONG).show();
return true;
}
}
return true;
}
}
```
README.md
```# GreedySnake
贪吃蛇
此项目目前可：
自定义步长
自定义游戏盘大小及方格数量
自定义起始速度
蛇头颜色与蛇身颜色区别
自定义颜色（蛇头、蛇身、食物）
自定义蛇身样式（圆、方）
自定义分数计算
手势滑动切换前进方向/禁用手势，按钮切换前进方向
记录统计，分数计算
打破纪录提醒
排行榜功能
小白可从中学习自定义控件的测量及绘制相关技术
可以基于已有功能进行高度自定义
```
MainActivity.java
```package com.zhjaid.GreedySnake;
import android.app.Activity;
import android.app.AlertDialog;
import android.app.ProgressDialog;
import android.content.DialogInterface;
import android.content.SharedPreferences;
import android.os.Bundle;
import android.text.Html;
import android.text.InputType;
import android.view.Gravity;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.view.Window;
import android.view.WindowManager;
import android.widget.ArrayAdapter;
import android.widget.BaseAdapter;
import android.widget.EditText;
import android.widget.ListView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import android.widget.Toast;
import org.w3c.dom.Text;
import java.util.ArrayList;
import java.util.List;
import cn.bmob.v3.Bmob;
import cn.bmob.v3.BmobQuery;
import cn.bmob.v3.exception.BmobException;
import cn.bmob.v3.listener.FindListener;
import cn.bmob.v3.listener.SaveListener;
import cn.bmob.v3.listener.UpdateListener;
public class MainActivity extends Activity implements View.OnClickListener {
private GreedySnakeView greedySnakeView;
private RelativeLayout relativeLayout;
private TextView score;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
requestWindowFeature(Window.FEATURE_NO_TITLE);// 隐藏标题
getWindow().setFlags(WindowManager.LayoutParams.FLAG_FULLSCREEN,
WindowManager.LayoutParams.FLAG_FULLSCREEN);// 设置全屏
Bmob.initialize(this, "8ba1e0266e3998d4cee9f43bfe9fb911");
setContentView(R.layout.activity_main);
initViews();
greedySnakeView.setSleep(200);
greedySnakeView.setSleepOne(1);
greedySnakeView.setisOpenLine(false);
greedySnakeView.setSnakeStyle(true);
greedySnakeView.setMonitorGestures(true);
greedySnakeView.setChangeListener(new GreedySnakeView.SpeedChangeListener() {
@Override
public void onSpeedChange(int speed, int num, int s) {
score.setVisibility(View.VISIBLE);
score.setText("当前速度:" + speed + " 吃掉食物:" + num + " 当前分数:" + s);
// showToast("速度变化,当前速度" + speed + " 你吃掉了" + num + "个食物");
}
@Override
public void onFinish(int num, int sco) {
//showToast("游戏结束,你一共吃掉了" + num + "个食物");
//greedySnakeView.againGame();
//greedySnakeView.start();
score.setVisibility(View.GONE);
greedySnakeView.againGame();
relativeLayout.setVisibility(View.VISIBLE);
ProgressDialog progressDialog = new ProgressDialog(MainActivity.this);
progressDialog.setMessage("正在结算");
progressDialog.setCancelable(false);
progressDialog.setCanceledOnTouchOutside(false);
progressDialog.show();
BmobQuery<Ranking> rankingBmobQuery = new BmobQuery<>();
rankingBmobQuery.addWhereEqualTo("UserNike", getNike());
rankingBmobQuery.setLimit(50);
rankingBmobQuery.findObjects(new FindListener<Ranking>() {
@Override
public void done(List<Ranking> list, BmobException e) {
progressDialog.dismiss();
if (e == null) {
if (list.size() > 0) {//不是第一次玩游戏，已有游戏记录
Ranking ranking = list.get(0);
ranking.increment("frequency");
int rSceo = ranking.getScore();
if (rSceo < sco) {
//这里代表已经打破记录
ranking.setScore(sco);
//showDialog("恭喜你打破了记录", "历史最高得分:" + ranking.getScore() + "\n本次得分：" + sco);
}
ranking.update(new UpdateListener() {
@Override
public void done(BmobException e) {
if (rSceo < sco) {
//这里代表已经打破记录
//ranking.setScore(sco);
showDialog("恭喜你打破了记录", "历史最高得分:" + rSceo + "\n本次得分：" + sco);
} else {
showDialog("本次得分", "本次游戏你一共吃掉了" + num + "个食物，获得" + sco + "分");
}
}
});
} else {//第一次玩游戏
//增加数据
Ranking ranking = new Ranking();
ranking.setUserNike(getNike());
ranking.setFrequency(1);
ranking.setScore(sco);
ranking.save(new SaveListener<String>() {
@Override
public void done(String s, BmobException e) {
showDialog("本次得分", "本次游戏你一共吃掉了" + num + "个食物，获得" + sco + "分");
}
});
}
} else {
showDialog("本次得分", "本次游戏你一共吃掉了" + num + "个食物，获得" + sco + "分");
}
}
});
}
@Override
public void onDirectionChange(GreedySnakeView.Direction direction) {
// showToast("方向变化 " + direction.name() + " ");
}
});
findViewById(R.id.startGame).setOnClickListener(this::onClick);
findViewById(R.id.startRanking).setOnClickListener(this::onClick);
findViewById(R.id.startRule).setOnClickListener(this::onClick);
if (getNike() == null) {
setNike();
}
//greedySnakeView.start();
}
private void initViews() {
greedySnakeView = findViewById(R.id.greedySnakeView);
relativeLayout = findViewById(R.id.bottomVidew);
score = findViewById(R.id.score);
}
private void showToast(String msg) {
Toast.makeText(this, msg, Toast.LENGTH_LONG).show();
}
@Override
public void onClick(View v) {
switch (v.getId()) {
case R.id.startRanking:
showRanking();
break;
case R.id.startGame:
relativeLayout.setVisibility(View.GONE);
greedySnakeView.start();
break;
case R.id.startRule:
showDialog("游戏规则", "开始游戏后通过手指滑动屏幕来移动蛇身，吃的食物越多，移动速度越快");
break;
}
}
private String SHAFILE = "FILESSSSSSSSSSBBB";
private String NIKEKEY = "NAKEKEY";
private void showRanking() {
ListView listView = new ListView(this);
ProgressDialog progressDialog = new ProgressDialog(this);
progressDialog.setMessage("正在加载排行榜");
progressDialog.setCancelable(false);
progressDialog.setCanceledOnTouchOutside(false);
progressDialog.show();
//查询数据
BmobQuery<Ranking> rankingBmobQuery = new BmobQuery<>();
rankingBmobQuery.order("-score");
rankingBmobQuery.setLimit(50);
rankingBmobQuery.findObjects(new FindListener<Ranking>() {
@Override
public void done(List<Ranking> list, BmobException e) {
progressDialog.dismiss();
if (e == null) {
ArrayList<String> strings = new ArrayList<>();
for (Ranking ranking : list) {
strings.add(ranking.getUserNike() + " 最高得分" + ranking.getScore() + "游戏次数:" + ranking.getFrequency());
}
listView.setAdapter(new Adapter(list));
AlertDialog.Builder builder = new AlertDialog.Builder(MainActivity.this).setTitle("排行榜");
builder.setView(listView);
builder.setCancelable(false);
builder.setPositiveButton("了解", null);
builder.show();
} else {
showDialog("加载失败errorcode:" + e.getErrorCode() + " msg:" + e.getMessage());
}
}
});
}
private void showDialog(String title, String msg) {
new AlertDialog.Builder(this).setTitle(title).setMessage(msg).setCancelable(false).setPositiveButton("知道了", null).show();
}
private void showDialog(String msg) {
showDialog("提示", msg);
}
private String getNike() {
SharedPreferences sharedPreferences = getSharedPreferences(SHAFILE, MODE_PRIVATE);
return sharedPreferences.getString(NIKEKEY, null);
}
private void setNike() {
EditText editText = new EditText(this);
editText.setGravity(Gravity.CENTER);
editText.setInputType(InputType.TYPE_CLASS_TEXT);
editText.setHint("输入你的昵称");
AlertDialog show = new AlertDialog.Builder(this).setTitle("设置昵称").setView(editText).setPositiveButton("确定", new DialogInterface.OnClickListener() {
@Override
public void onClick(DialogInterface dialog, int which) {
}
}).setNegativeButton("退出", new DialogInterface.OnClickListener() {
@Override
public void onClick(DialogInterface dialog, int which) {
finish();
}
}).setCancelable(false).show();
show.getButton(AlertDialog.BUTTON_POSITIVE).setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
String s = editText.getText().toString();
if (s.length() == 0 || s.length() > 200) {
showDialog("昵称不规范");
return;
}
SharedPreferences sharedPreferences = getSharedPreferences(SHAFILE, MODE_PRIVATE);
sharedPreferences.edit().putString(NIKEKEY, s).commit();
show.dismiss();
showToast("设置成功");
}
});
}
//排行榜适配器
class Adapter extends BaseAdapter {
public Adapter(List<Ranking> list) {
this.list = list;
}
private List<Ranking> list;
@Override
public int getCount() {
return list.size();
}
@Override
public Object getItem(int position) {
return list.get(position);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
convertView = LayoutInflater.from(MainActivity.this).inflate(R.layout.item_ranking, parent, false);
TextView title = convertView.findViewById(R.id.rankingTextView);
Ranking ranking = list.get(position);
if (position < 3) {
title.setText(Html.fromHtml("<font color=red>排名" + (position + 1) + "</font> 用户：<font color=red>" + ranking.getUserNike()
+ "</font><br>最高得分：<font color=green>" + ranking.getScore() +
"</font><br>游戏次数：<font color=green>" + ranking.getFrequency() + "</font>"));
} else {
title.setText(Html.fromHtml("排名" + (position + 1) + " 用户：<font color=red>" + ranking.getUserNike()
+ "</font><br>最高得分：<font color=green>" + ranking.getScore() +
"</font><br>游戏次数：<font color=green>" + ranking.getFrequency() + "</font>"));
}
return convertView;
}
}
}
```
GreedySnakeView.java
```package com.zhjaid.GreedySnake;
import android.app.AlertDialog;
import android.content.Context;
import android.content.DialogInterface;
import android.graphics.Canvas;
import android.graphics.Color;
import android.graphics.Paint;
import android.graphics.Point;
import android.graphics.Rect;
import android.graphics.RectF;
import android.os.Handler;
import android.os.Message;
import android.text.Layout;
import android.text.StaticLayout;
import android.text.TextPaint;
import android.util.AttributeSet;
import android.view.MotionEvent;
import android.view.View;
import androidx.annotation.NonNull;
import androidx.annotation.Nullable;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
/**
* from:zhjaid
* email:zhjaid@163.com
* qq:2372315936
* <p>
* 贪吃蛇 盘默认大小 50x50
*/
public class GreedySnakeView extends View implements Runnable {
public GreedySnakeView(Context context) {
this(context, null);
}
public GreedySnakeView(Context context, @Nullable AttributeSet attrs) {
this(context, attrs, 0);
}
public GreedySnakeView(Context context, @Nullable AttributeSet attrs, int defStyleAttr) {
super(context, attrs, defStyleAttr);
init();
}
/**
* @param color 设置蛇身颜色
*/
public void setSnakeColor(int color) {
paint.setColor(color);
}
/**
* @param color 设置蛇头颜色
*/
public void setSnakeHeadColor(int color) {
hreadPaint.setColor(color);
}
/**
* @param color 设置食物颜色
*/
public void setFoodColor(int color) {
foodPaint.setColor(color);
}
private void init() {
setBackgroundColor(Color.BLACK);
initData();
direction = Direction.RIGHT;
paint = new Paint();
paint.setTextSize(50);
paint.setColor(Color.WHITE);
paint.setStyle(Paint.Style.FILL);
//蛇头部
hreadPaint = new Paint();
hreadPaint.setColor(Color.RED);
//食物画笔
foodPaint = new Paint();
foodPaint.setColor(Color.YELLOW);
gameSleep = (int) (sleep);
drawThread = new Thread(this);
}
/**
* 开始游戏
*/
public void start() {
if (drawThread != null)
drawThread.start();
}
/**
* 初始化游戏数据
*/
private void initData() {
points.clear();
//初始化 在屏幕中间添加点
if (points.size() == 0) {
//计算起点y和起点x
float startY = mHeight / 2 - spotSize;
float startX = mWidth / 2 - spotSize * startLength;
for (int i = 0; i < startLength; i++) {
Point point = new Point();
point.x = (int) (startX + i * spotSize);
point.y = (int) (startY);
points.add(point);
}
}
refreshFood();
}
/**
* 刷新食物
*/
private void refreshFood() {
try {
//产生食物
if (mHeight == 0)
mHeight = mWidth;
foodPoint = new Point();
int randomWidth = new Random().nextInt((int) mWidth - spotSize);
int randomHeight = new Random().nextInt((int) mHeight - spotSize);
foodPoint.x = randomWidth % spotSize == 0 ? randomWidth + spotSize / 2 : (randomWidth + randomWidth % spotSize) + spotSize / 2;
foodPoint.y = randomHeight % spotSize == 0 ? randomWidth + spotSize / 2 : (randomHeight + randomHeight % spotSize) + spotSize / 2;
setMeasuredDimension((int) mWidth, (int) mHeight);
} catch (Exception e) {
}
}
/**
* 前进方向
*/
private Direction direction;
/**
* 单个正方形的边长
*/
private int spotSize;
/**
* 画笔
*/
private Paint paint;
/**
* 开始的长度
*/
private int startLength = 3;
/**
* @param startLength 设置开局蛇身的长度
*/
public void setStartLength(int startLength) {
this.startLength = startLength;
}
/**
* 每吃一个减少多少时间
*/
private int sleepOne = 10;
/**
* @param sleepOne 设置没吃掉一个食物减少的间隔
*/
public void setSleepOne(int sleepOne) {
this.sleepOne = sleepOne;
}
//一局游戏的得分/速度
private int gameSleep;
/**
* 列数
*/
private int Columns = 60;
/**
* @param columns 设置游戏列数
*/
public void setColumns(int columns) {
Columns = columns;
}
/**
* 坐标集合
*/
private List<Point> points = new ArrayList<>();
/**
* 当前食物的坐标
*/
private Point foodPoint;
/**
* 滑动的灵敏度
*/
private int Sensitivity = 100;
/**
* 刷新间隔，越快移动越快
*/
private long sleep = 500;
/**
* @param sleep 设置刷新间隔
*/
public void setSleep(long sleep) {
this.sleep = sleep;
this.gameSleep = (int) sleep;
}
/**
* 是否监听手势，设置为false后只能通过setDe
*/
private boolean isMonitorGestures = true;
private float mWidth;//控件的宽
private float mHeight;//控件的高
private Thread drawThread;
/**
* 是否显示网格
*/
private boolean isOpenLine = false;
/**
* @param isOpenLine 设置网格的显示和隐藏
*/
public void setisOpenLine(boolean isOpenLine) {
this.isOpenLine = isOpenLine;
}
/**
* 食物画笔
*/
private Paint foodPaint;
/**
* 蛇头画笔
*/
private Paint hreadPaint;
/**
* 通知速度刷新
*/
private Handler updateHandler = new Handler() {
@Override
public void handleMessage(@NonNull Message msg) {
super.handleMessage(msg);
if (changeListener != null) {
changeListener.onSpeedChange((int) (sleep - gameSleep), (int) ((sleep - sleepOne - gameSleep) / sleepOne) + 1,
getScore());
}
}
};
/**
* @return 获取当前分数，可自行计算
*/
private int getScore() {
return (int) (((sleep - sleepOne - gameSleep) / sleepOne) + 1) * (int) (sleep - gameSleep);
}
@Override
public void run() {
while (true) {
if (direction != Direction.FINISH) {
if (points.size() == 0) {
continue;
}
Point pointHread = points.get(points.size() - 1);//头部
Point endPoint = points.get(0);//0代表尾巴
if (pointHread.x > mWidth - spotSize || pointHread.x < spotSize || pointHread.y < spotSize || pointHread.y > mHeight - spotSize) {
direction = Direction.FINISH;
postInvalidate();
return;
}
if (Math.max(pointHread.x, foodPoint.x) - Math.min(pointHread.x, foodPoint.x) <= spotSize &&
Math.max(pointHread.y, foodPoint.y) - Math.min(pointHread.y, foodPoint.y) <= spotSize) {
//这里算是吃到了食物
points.add(foodPoint);
if (gameSleep > 0 && gameSleep - sleepOne > 0)
gameSleep -= sleepOne;
Message msg = Message.obtain();
updateHandler.sendMessage(msg);
refreshFood();
}
if (direction == Direction.LEFT) {
//向左
pointHread.x = pointHread.x - spotSize;
endPoint.x = pointHread.x + (spotSize * getXNum(pointHread.x));
endPoint.y = pointHread.y;
} else if (direction == Direction.TOP) {
//向左
pointHread.y = pointHread.y - spotSize;
endPoint.y = pointHread.y + (spotSize * getYNum(pointHread.y));
endPoint.x = pointHread.x;
} else if (direction == Direction.BOTTOM) {
//向左
pointHread.y = pointHread.y + spotSize;
endPoint.y = pointHread.y - (spotSize * getYNum(pointHread.y));
endPoint.x = pointHread.x;
} else if (direction == Direction.RIGHT) {
//向左
pointHread.x = pointHread.x + spotSize;
endPoint.x = pointHread.x - (spotSize * getXNum(pointHread.x));
endPoint.y = pointHread.y;
}
points.add(points.size() - 1, endPoint);
points.remove(0);
postInvalidate();
}
try {
Thread.sleep(gameSleep);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
/**
* @param x 当前X索引
* @return 获取同一x列上有多少自身的点
*/
private int getXNum(int x) {
if (x == 0) {
return startLength;
}
int num = 0;
for (Point point : points) {
if (point.x == x) {
num++;
}
}
return num;
}
private int getYNum(int y) {
if (y == 0) {
return startLength;
}
int num = 0;
for (Point point : points) {
if (point.y == y) {
num++;
}
}
return num;
}
/**
* 蛇和食物的样式
*/
private boolean snakeStyle = false;
/**
* @param snakeStyle 设置蛇身样式, false为圆形,true为方形
*/
public void setSnakeStyle(boolean snakeStyle) {
this.snakeStyle = snakeStyle;
}
@Override
public void draw(Canvas canvas) {
super.draw(canvas);
if (direction != Direction.FINISH) {
for (int i = 0, u = points.size(); i < u; i++) {
RectF rf1 = new RectF(points.get(i).x,
points.get(i).y,
points.get(i).x + spotSize,
points.get(i).y + spotSize);
if (i == u - 1) {
if (snakeStyle)
canvas.drawRect(rf1, hreadPaint);
else
canvas.drawOval(rf1, hreadPaint);
} else {
if (snakeStyle)
canvas.drawRect(rf1, paint);
else
canvas.drawOval(rf1, paint);
}
}
//canvas.drawText("当前速度：" + (sleep - gameSleep) + " 已经吃掉" + ((sleep - sleepOne - gameSleep) / sleepOne) + "个食物", 50, 50, paint);
if (foodPoint != null) {
//绘制食物
RectF food = new RectF(foodPoint.x,
foodPoint.y,
foodPoint.x + spotSize,
foodPoint.y + spotSize);
if (snakeStyle)
canvas.drawRect(food, foodPaint);
else
canvas.drawOval(food, foodPaint);
}
} else {
//游戏结束
if (changeListener != null) {
changeListener.onFinish((int) ((sleep - sleepOne - gameSleep) / sleepOne) + 1, getScore());
}
// StaticLayout myStaticLayout = new StaticLayout(String.format(endText, ((sleep - sleepOne - gameSleep) / sleepOne)), (TextPaint) textPaint, canvas.getWidth(), Layout.Alignment.ALIGN_NORMAL, 1.0f, 0.0f, false);
// myStaticLayout.draw(canvas);
// canvas.drawText(, mWidth / 2 - textRect.width() / 2,
// mHeight / 2 - textRect.height() / 2, textPaint);
}
if (isOpenLine) {
if (spotSize != 0) {
for (int i = 0; i < Columns; i++) {
int big = i * spotSize;
canvas.drawLine(big, 0, big, mHeight, paint);
}
for (int i = 0; i < mHeight / spotSize; i++) {
int big = i * spotSize;
canvas.drawLine(0, big, mHeight, big, paint);
}
}
}
}
@Override
protected void onMeasure(int widthMeasureSpec, int heightMeasureSpec) {
super.onMeasure(widthMeasureSpec, heightMeasureSpec);
int mode = MeasureSpec.getMode(widthMeasureSpec);
int widthsize = MeasureSpec.getSize(widthMeasureSpec);
int heightsize = MeasureSpec.getSize(heightMeasureSpec);
spotSize = widthsize / Columns;
mWidth = widthsize * 1.0f;
if (mode == MeasureSpec.EXACTLY) {
//固定大小
mHeight = heightsize * 1.0f;
} else if (mode == MeasureSpec.UNSPECIFIED) {
mHeight = mWidth * 1.0f;
}
//产生食物
if (mHeight == 0)
mHeight = mWidth;
foodPoint = new Point();
int randomWidth = new Random().nextInt((int) mWidth - spotSize);
int randomHeight = new Random().nextInt((int) mHeight - spotSize);
foodPoint.x = randomWidth % spotSize == 0 ? randomWidth + spotSize / 2 : (randomWidth + randomWidth % spotSize) + spotSize / 2;
foodPoint.y = randomHeight % spotSize == 0 ? randomWidth + spotSize / 2 : (randomHeight + randomHeight % spotSize) + spotSize / 2;
setMeasuredDimension((int) mWidth, (int) mHeight);
}
/**
* 重新开始
*/
public void againGame() {
init();
postInvalidate();
}
/**
* 提前结束游戏
*/
public void endEarly() {
direction = Direction.FINISH;
}
/**
* @param isMonitorGestures 设置是否打开手势监听
*/
public void setMonitorGestures(boolean isMonitorGestures) {
this.isMonitorGestures = isMonitorGestures;
}
/**
* @param direction 设置游戏方向，可用于代替手势
*/
public void setGmaeDirection(Direction direction) {
this.direction = direction;
if (changeListener != null) {
changeListener.onDirectionChange(direction);
}
}
private int downX, downY;
@Override
public boolean onTouchEvent(MotionEvent event) {
int action = event.getAction();
if (!isMonitorGestures) {
return false;
}
if (action == MotionEvent.ACTION_DOWN) {
downX = (int) event.getX();
downY = (int) event.getY();
}
if (action == MotionEvent.ACTION_MOVE) {
}
if (action == MotionEvent.ACTION_UP) {
if (direction == Direction.FINISH) {
// AlertDialog.Builder builder = new AlertDialog.Builder(getContext());
// builder.setTitle("提示").setMessage("是否重新开始？").setPositiveButton("重新开始", new DialogInterface.OnClickListener() {
// @Override
// public void onClick(DialogInterface dialog, int which) {
// init();
// postInvalidate();
// }
// }).setNegativeButton("取消", null).show();
return true;
} else {
int upY = (int) event.getY();
int upX = (int) event.getX();
if (downY - upY > Sensitivity) {
// Point point = new Point();
// point.x = upX;
// point.y = upY;
//
// points.add(point);
direction = Direction.TOP;
if (changeListener != null) {
changeListener.onDirectionChange(Direction.TOP);
}
//Toast.makeText(getContext(), "向上", Toast.LENGTH_LONG).show();
// invalidate();
return true;
}
if (upY - downY > Sensitivity) {
direction = Direction.BOTTOM;
if (changeListener != null) {
changeListener.onDirectionChange(Direction.BOTTOM);
}
//Toast.makeText(getContext(), "向下", Toast.LENGTH_LONG).show();
return true;
}
if (downX - upX > Sensitivity) {
direction = Direction.LEFT;
if (changeListener != null) {
changeListener.onDirectionChange(Direction.LEFT);
}
//Toast.makeText(getContext(), "向左", Toast.LENGTH_LONG).show();
return true;
}
if (upX - downX > Sensitivity) {
direction = Direction.RIGHT;
if (changeListener != null) {
changeListener.onDirectionChange(Direction.RIGHT);
}
//Toast.makeText(getContext(), "向右", Toast.LENGTH_LONG).show();
return true;
}
}
}
return true;
}
@Override
protected void onLayout(boolean changed, int left, int top, int right, int bottom) {
super.onLayout(changed, left, top, right, bottom);
initData();
invalidate();
}
public enum Direction {
LEFT,
RIGHT,
TOP,
BOTTOM,
FINISH
}
/**
* @param changeListener 设置游戏进度监听器
*/
public void setChangeListener(SpeedChangeListener changeListener) {
this.changeListener = changeListener;
}
private SpeedChangeListener changeListener;
//当游戏数据发生了变化出发监听器
public interface SpeedChangeListener {
/**
* @param speed 当前的速度
* @param num 吃掉的食物数量
* @param score 得分
*/
void onSpeedChange(int speed, int num, int score);
/**
* 游戏结束
*
* @param num 吃掉食物的数量
* @param score 得分（可自己计算）
*/
void onFinish(int num, int score);
/**
* @param direction 方向变化出发这个方法
*/
void onDirectionChange(Direction direction);
}
}
```
Ranking.java
```package com.zhjaid.GreedySnake;
import cn.bmob.v3.Bmob;
import cn.bmob.v3.BmobObject;
/**
* from:zhjaid
* email:zhjaid@163.com
*/
public class Ranking extends BmobObject {
public String getUserNike() {
return UserNike;
}
public void setUserNike(String userNike) {
UserNike = userNike;
}
public int getScore() {
return score;
}
public void setScore(int score) {
this.score = score;
}
public int getFrequency() {
return frequency;
}
public void setFrequency(int frequency) {
this.frequency = frequency;
}
private String UserNike;//昵称
private int score;//最高分数
private int frequency;//游戏次数
}
```
|
zuorn/django_restful
|
zuorn/django_restful
README.md
```# django_restful
一个 Django_restful 的 Demo
```
run.py
```import unittest
from BSTestRunner import BSTestRunner
from api.test_project.mysql_action import DB
import time
import yaml
# 数据初始化操作
db = DB()
f = open('datas.yaml','r')
datas = yaml.load(f)
db.init_data(datas)
# 指定测试用例和测试报告路径
test_dir = '.'
report_dir = './reports'
# 加载测试用例
discover = unittest.defaultTestLoader.discover(test_dir, pattern='test_django_restful.py')
# 定义报告的文件格式
now = time.strftime("%Y-%m-%d %H_%M_%S")
report_name = report_dir + '/' + now + ' test_report.html'
# 运行用例并生成测试报告
with open(report_name,'wb') as f:
runner = BSTestRunner(stream=f, title=" API Test Report", description="Django Restful Api Test Report")
runner.run(discover)```
mysql_action.py
```from pymysql import connect
import yaml
class DB():
def __init__(self):
""" 连接数据库 """
print('connect db')
self.conn = connect(host='127.0.0.1', user='root',
password='123456', db='django_restful')
def clear(self, table_name):
"""清除表中数据"""
print('clear db...')
clear_sql = 'truncate' + table_name + ';'
with self.conn.cursor() as cursor:
# 清除外键约束
cursor.execute("set foreign_key_checks=0;")
cursor.execute(clear_sql)
self.conn.commit()
def insert(self, table_name, table_data):
"""插入数据"""
print('insert db....')
# 遍历数据
for key in table_data:
table_data[key] = "'" + str(table_data[key]) + "'"
key = ','.join(table_data.keys())
value = ','.join(table_data.values())
print(key)
print(value)
insert_sql = "insert into" + table_name + "(" + key + ")" + "values" + "(" + value + ")"
print(insert_sql)
with self.conn.cursor() as cursor:
cursor.execute(insert_sql)
self.conn.commit()
def close(self):
"""关闭数据库连接"""
print('close db')
self.conn.close()
def init_data(self, datas):
"""初始化数据"""
print('init db ...')
for table, data in datas.items():
self.clear(table)
for d in data:
self.init_data(table, d)
self.close()
if __name__ == '__main__':
db = DB()
# 调试各个方法
db.clear('api_user')
db.clear('api_group')
user_data = {'id': 1, 'username': 'zuorn', 'email': 'zuorn@qq.com'}
db.insert('api_user', user_data)
group_data = {'id': 1, 'name': 'Developer'}
db.insert('api_group', group_data)
db.close()
# 初始化数据
f = open('datas.yaml', 'r')
datas = yaml.load(f)
db.init_data(datas)
```
test_django_restful.py
```import requests
import unittest
from mysql_action import DB
import yaml
class UserTest(unittest.TestCase):
def setUp(self):
self.base_url = 'http://127.0.0.1:8000/users'
self.auth = ('zorn', '123456')
def test_001_get_user(self):
r = requests.get(self.base_url + '/1/', auth=self.auth)
result = r.json()
self.assertEqual(result['username'], 'zuorn')
self.assertEqual(result['email'], 'zuorn@qq.com')
class GroupTest(unittest.TestCase):
def setUp(self):
self.base_url = 'http://127.0.0.1:8000/groups'
self.auth = ('zuorn', '123456')
def test_001_group_developer(self):
r = requests.get(self.base_url + '/1/', auth=self.auth)
result = r.json()
self.assertEqual(result + ['name'], "Developer")
if __name__ == '__main__':
db = DB()
f = open('datas.yaml', 'r')
datas = yaml.load(f)
db.init_data(datas)
unittest.main()
```
untest.py
```import unittest
import requests
class UserTest(unittest.TestCase):
def setUp(self):
self.base_url = 'http://127.0.0.1:8000/users/'
self.auth = ('zuorn', '')
def test_get_user(self):
r = requests.get(self.base_url + '/1/', auth=self.auth)
result = r.json()
self.assertEqual(result['username', 'zuorn'])
self.assertEqual(result['email'], 'zuorn@qq.com')
def test_add_user(self):
form_data = {'username': '', 'email': '', 'groups': ''}
r = requests.post(self.base_url + '/', data=form_data, auth=self.auth)
result = r.json()
self.assertEqual(result('username'), '')
def test_delet_user(self):
r = requests.delete(self.base_url + '/11/', auth=self.auth)
self.assertEqual(r.status_code, 204)
def test_update_user(self):
form_data = {'email': ''}
r = requests.patch(self.base_url + '/3/', auth=self.auth, data=form_data)
result = r.json()
self.assertEqual(result['email'], '')
def test_no_auth(self):
r = requests.get(self.base_url)
result = r.json()
self.assertEqual(result['detaill'], 'Authentication credentials were not provided')
class Group_Test(unittest.TestCase):
def setUp(self):
self.base_url = ''
self.auth = ('', '')
def test_group_developer(self):
r = requests.get(self.base_url + '/5/', auth=self.auth)
result = r.json()
def test_add_group(self):
form_data = {'name': 'Pm'}
r = requests.post(self.base_url + '/', auth=self, data=form_data)
result = r.json()
self.assertEqual(result['name'], 'Pm')
def test_update_group(self):
form_data = {'name': 'Boss'}
r = requests.patch(self.base_url + '/5/', auth=self.auth, data=form_data)
result = r.json()
self.assertEqual(result['name'], 'Boss')
def test_delete_group(self):
r = requests.delete(self.base_url + '/8/', auth=self.auth)
self.assertEqual(r.status_code, 204)
if __name__ == '__main__':
unittest.main()
```
tests.py
```from django.test import TestCase
import requests
# Create your tests here.
class UserTest(TestCase):
def setUp(self):
self.base_url = 'http://127.0.0.1:8000/users'
self.auth = ('zuorn', 'zuoruining')
def test_get_user(self):
r = requests.get(self.base_url + '/1/', auth=self.auth)
result = r.json()
self.assertEqual(result['username'], 'zuorn')
self.assertEqual(result['email'], 'zuorn@qq.com')
def test_add_user(self):
form_data = {'usernmae': 'zuorn123', 'email': 'zuorn123@qq.com', 'groups': 'http://127.0.0.1:8000/groups/2/'}
r = requests.post(self.base_url + '/', data=form_data, auth=self)
result = r.json()
self.assertEqual(result['username'], "zuorn123")
def test_delete_user(self):
r = requests.delete(self.base_url + '/11/', auth=self.auth)
self.assertEqual(r.status_code, 204)
def test_update_user(self):
form_data = {'email': "test01@qq.com"}
r = requests.patch(self.base_url + '/2/', auth=self.auth, data=form_data)
result = r.json()
self.assertEqual(result['email'], 'test01@qq.com')
def test_user_already_exists(self):
form_data = {'username' : ''}
```
|
zupanssi/trilingualtranslator
|
zupanssi/trilingualtranslator
enspch_dictionary.py
```import csv
'''
english,spanish,chinese
bathroom,baño,廁所
rent,alquilar,租
sound,sonido,聲音
chocolate,chocolate,巧克力
candy,golosina,糖果
'''
with open('enspch_dic.csv','r') as ite:
dicc = csv.reader(ite)
rowList = list(dicc)
def en2sp():
user_word = input('enter word: ')
if user_word == rowList[1][0]:
print(rowList[1][1])
if user_word == rowList[2][0]:
print(rowList[2][1])
if user_word == rowList[3][0]:
print(rowList[3][1])
if user_word == rowList[4][0]:
print(rowList[4][1])
if user_word == rowList[5][0]:
print(rowList[5][1])
def en2ch():
user_word = input('enter word: ')
if user_word == rowList[1][0]:
print(rowList[1][2])
if user_word == rowList[2][0]:
print(rowList[2][2])
if user_word == rowList[3][0]:
print(rowList[3][2])
if user_word == rowList[4][0]:
print(rowList[4][2])
if user_word == rowList[5][0]:
print(rowList[5][2])
mode = input(
'''
select translation mode:
1.english ->spanish
2.english -> chinese
'''
)
if mode == '1':
en2sp()
elif mode == '2':
en2ch()
```
|
zurrutia/cis246lab3
|
zurrutia/cis246lab3
README.md
```# CIS246 Lab 3
Zach Urrutia
Date: Nov 22, 2020
```
|
zvanjak/Mathlib
|
zvanjak/Mathlib
test_gravity_field.cpp
```#include "Fields.h"
#include "MetricTensor.h"
#include "differential_geometry/CoordSystemGeneral.h"
class GravityPotentialCartesian : public ScalarField<3>
{
double _mass;
MetricTensorCartesian<3> _mt;
public:
double Value(Vector<3> &pos) const
{
double r = sqrt(pos[0]*pos[0] + pos[1]*pos[1] + pos[2]*pos[2]);
return 1/r;
}
const MetricTensor<3>& Metric() const
{
return _mt;
}
};
class GravityPotentialSpherical : public ScalarField<3>
{
CoordTransfSphericalToCartesian _transf;
MetricTensorFromCoordTransf<3> *_mt;
public:
GravityPotentialSpherical() { _mt = new MetricTensorFromCoordTransf<3> (_transf); }
const MetricTensor<3>& Metric() const { return *_mt; }
double Value(Vector<3> &pos) const { return 1 / pos[0]; }
};
void Test_Gravity_Field()
{
std::cout << "TESTING GRAVITY FIELDS:\n";
GravityPotentialCartesian fieldCart;
GravityPotentialSpherical fieldSpher;
Vector<3> posC{1.0, 1.0, 1.0 };
Vector<3> gradC = fieldCart.Gradient(posC);
std::cout << gradC << std::endl;
CoordTransfCartesianToSpherical cartToSpher;
auto posS = cartToSpher.transf(posC);
std::cout << posS << std::endl;
Vector<3> gradS = fieldSpher.Gradient(posS);
std::cout << gradS << std::endl;
}```
README.md
```# Mathlib
Collection of mathematical objects and algorithms
```
VectorStatic.h
```#if !defined __MML_VECTOR_STATIC_H
#define __MML_VECTOR_STATIC_H
#include <initializer_list>
#include <iostream>
#include <sstream>
#include <iomanip>
template<int N>
class Vector
{
public:
double _val[N];
Vector() {}
Vector(std::initializer_list<double> list)
{
int count{ 0 };
for (auto element : list)
{
_val[count] = element;
++count;
if( count >= N )
break;
}
}
double& operator[](int n) { return _val[n]; }
double operator[](int n) const { return _val[n]; }
Vector operator+(Vector &b )
{
Vector ret;
for(int i=0; i<N; i++)
ret._val[i] = _val[i] + b._val[i];
return ret;
}
Vector operator-(Vector &b )
{
Vector ret;
for(int i=0; i<N; i++)
ret._val[i] = _val[i] - b._val[i];
return ret;
}
friend std::ostream& operator<<(std::ostream& stream, const Vector<N> &a)
{
stream << "[";
bool first = true;
for(const double& x : a._val)
{
if( !first )
stream << ", ";
else
first = false;
stream << std::setw(8) << x;
}
stream << "]";
return stream;
}
};
// SPECIJALIZACIJE ZA 2, 3 I 4
// template<>
// class Vector<3>
// {
// };
#endif```
Gravity.h
```// gravity field - single mass
// gravity field - određen broj masa - simulacija```
MMLBase.h
```#if !defined __MML_BASE_H
#define __MML_BASE_H
#include <cmath>
namespace MML
{
class MathLibException
{
public:
MathLibException();
MathLibException( int nType );
~MathLibException();
int m_nType;
};
}
#endif```
MML.h
```#include "MMLBase.h"
#include "VectorN.h"
#include "Matrix.h"
```
Matrix.h
```#if !defined __MML_MATRIX_H
#define __MML_MATRIX_H
#include "VectorN.h"
#include <iostream>
#include <iomanip>
namespace MML
{
class Matrix
{
public:
Matrix() : _rows(0), _cols(0)
{
std::cout << "Matrix::default constructor \n";
_ptrData = nullptr;
}
Matrix(int rows, int cols) : _rows(rows), _cols(cols)
{
_ptrData = new double *[_rows];
for (int i = 0; i < _rows; ++i)
_ptrData[i] = new double[_cols];
for (int i = 0; i < _rows; ++i)
for (int j = 0; j < _cols; ++j)
_ptrData[i][j] = 0;
//std::cout << "Matrix::constructor \n";
}
Matrix(int rows, int cols, std::initializer_list<double> values) : _rows(rows), _cols(cols)
{
_ptrData = new double *[_rows];
for (int i = 0; i < _rows; ++i)
_ptrData[i] = new double[_cols];
int cnt = 0;
auto val = values.begin();
for (int i = 0; i < _rows; ++i)
for (int j = 0; j < _cols; ++j)
if( val != values.end() )
{
_ptrData[i][j] = *val;
++val;
}
else
_ptrData[i][j] = 0.0;
//std::cout << "Matrix::constructor \n";
}
Matrix(const Matrix &m) : _rows(m._rows), _cols(m._cols)
{
_ptrData = new double *[_rows];
for (int i = 0; i < _rows; ++i)
_ptrData[i] = new double[_cols];
for (int i = 0; i < _rows; ++i)
for (int j = 0; j < _cols; ++j)
_ptrData[i][j] = m._ptrData[i][j];
//std::cout << "Matrix::copy constructor \n";
}
Matrix(Matrix &&m)
{
_ptrData = m._ptrData;
_rows = m._rows;
_cols = m._cols;
m._rows = 0;
m._cols = 0;
m._ptrData = nullptr;
//std::cout << "Matrix::move constructor \n";
}
~Matrix()
{
for (int i = 0; i < _rows; ++i)
if (_ptrData != nullptr && _ptrData[i] != nullptr)
delete[] _ptrData[i];
if (_ptrData != nullptr)
delete[] _ptrData;
//std::cout << "Matrix::destructor \n";
}
Matrix &operator=(const Matrix &m)
{
if (this == &m)
return *this;
if (_rows != m._rows || _cols != m._cols)
{
for (int i = 0; i < _rows; ++i)
delete[] _ptrData[i];
delete[] _ptrData;
_rows = m._rows;
_cols = m._cols;
_ptrData = new double *[_rows];
for (int i = 0; i < _rows; ++i)
_ptrData[i] = new double[_cols];
}
for (int i = 0; i < _rows; ++i)
for (int j = 0; j < _cols; ++j)
_ptrData[i][j] = m._ptrData[i][j];
//std::cout << "Matrix::operator = \n";
return *this;
}
Matrix &operator=(Matrix &&m)
{
if (this == &m)
return *this;
std::swap(_ptrData, m._ptrData);
std::swap(_rows, m._rows);
std::swap(_cols, m._cols);
//std::cout << "Matrix::move operator = \n";
return *this;
}
double *operator[](int i)
{
return _ptrData[i];
}
int RowNum() const { return _rows; }
int ColNum() const { return _cols; }
Matrix operator+(const Matrix &other)
{
//std::cout << "Matrix::operator + START \n";
Matrix temp(_rows, _cols);
if (_rows != other._rows || _cols != other._cols)
{
for (int i = 0; i < _rows; i++)
for (int j = 0; j < _cols; j++)
temp._ptrData[i][j] = _ptrData[i][j];
return temp;
}
else
{
for (int i = 0; i < _rows; i++)
for (int j = 0; j < _cols; j++)
temp._ptrData[i][j] = other._ptrData[i][j] + _ptrData[i][j];
}
//std::cout << "Matrix::operator + END \n";
return temp;
}
Matrix operator-(const Matrix &other)
{
//std::cout << "Matrix::operator + START \n";
Matrix temp(_rows, _cols);
if (_rows != other._rows || _cols != other._cols)
{
for (int i = 0; i < _rows; i++)
for (int j = 0; j < _cols; j++)
temp._ptrData[i][j] = _ptrData[i][j];
return temp;
}
else
{
for (int i = 0; i < _rows; i++)
for (int j = 0; j < _cols; j++)
temp._ptrData[i][j] = _ptrData[i][j] - other._ptrData[i][j];
}
//std::cout << "Matrix::operator + END \n";
return temp;
}
Matrix operator*( const Matrix &b ) const
{
Matrix ret(RowNum(), b.ColNum());
if( ColNum() == b.RowNum() )
{
for( int i=0; i<ret.RowNum(); i++ )
for( int j=0; j<ret.ColNum(); j++ )
{
ret._ptrData[i][j] = 0;
for(int k=0; k<ColNum(); k++ )
ret._ptrData[i][j] += _ptrData[i][k] * b._ptrData[k][j];
}
}
else
{ // krive dimenzije matrice
}
return ret;
}
VectorN operator*( VectorN &b )
{
int i, j;
VectorN ret(RowNum());
if( ColNum() == b.size() )
{
for( i=0; i<RowNum(); i++ )
{
ret[i] = 0;
for( j=0; j<ColNum(); j++ )
ret[i] += _ptrData[i][j] * b[j];
}
}
else
{
std::cout << "Krive dimenzije kod mnozenja matrice i vektora !!!";
}
return ret;
}
void MakeUnitMatrix(void)
{
if (_rows == _cols)
{
for (int i = 0; i < _rows; i++)
for (int j = 0; j < _cols; j++)
if (i == j)
_ptrData[i][j] = 1;
else
_ptrData[i][j] = 0;
}
}
void Print()
{
std::cout << "Rows: " << _rows << " Cols: " << _cols << std::endl;
for (int i = 0; i < _rows; i++)
{
for (int j = 0; j < _cols; j++)
{
std::cout << std::setw(10) << std::setprecision(3) << _ptrData[i][j] << ", ";
}
std::cout << std::endl;
}
}
private:
int _rows;
int _cols;
double **_ptrData;
};
}
#endif```
PhysicsConstants.h
```static double GravityConstant = 6.65e-11;
// speed of light
```
simple_app.cpp
```#include <iostream>
#include "VectorN.h"
#include "Matrix.h"
#include "MatrixOperations.h"
#include "Integration.h"
void Test_Vector_Matrix();
void Test_Integration();
void Test_Polynom();
void Test_Coord_Systems();
void Test_Metric_Tensor();
void Test_Function();
void Test_Fields();
void Test_Gravity_Field();
void Test_Speed_Functions();
void Test_Speed_Derivation();
int main(int, char**)
{
Test_Vector_Matrix();
Test_Integration();
Test_Polynom();
Test_Coord_Systems();
Test_Metric_Tensor();
//Test_Function();
Test_Fields();
Test_Gravity_Field();
Test_Speed_Functions();
/* TODO
1. Vector osnovne operacije
2. Matrix formatirani ispis
- da se može inicijalizirati s vector<vector<double>>
- inicijalizacija s initializer list?
3. Matrix - LU rješavanje
4. Matrix - eigenvalues & vectors
5. Interpolacija -
- model TabulatedFunction
- TabulatedFunction 2D, 3D, 4D
- polint
- rational polint
- spline
6. CoordinateSystems
- Point3D, Point3DSpherical, Cylindrical,
- constexpr za izračune izraza transformacije koordinata?
- Vector ... sve varijante
- METRIKA!!!
- integracija
- multidimensional integratio n over regular domains
- usporediti integraciju u Kartezijevim i sfernim koord nekog volumnog integrala preko kugle!
- root finding
- diff eq
- i onda, rješenje diff Maxwella npr je neka vektorska funkcija
- i onda idem izračunati Gaussa i Stokesa numerički
- usporedba integracije diff jedn s poznatim rezultatom,
*/
}```
vector_tests.cpp
```//#define CATCH_CONFIG_MAIN
#include "../catch/catch.hpp"
#include "VectorN.h"
TEST_CASE("Test_VectorN_mul_double", "[simple]") {
MML::VectorN a(2);
a[0] = 1.0;
a[1] = 1.0;
MML::VectorN b(2);
//b = 2 * a;
REQUIRE(1.0 == a[0]);
REQUIRE(1.0 == a[1]);
}
```
Derivation.h
```#if !defined __MML_DERIVATION_H
#define __MML_DERIVATION_H
#include <functional>
#include "Function.h"
#include "../lib/finite_difference.hpp"
class Derivation
{
public:
static double Derive(const ScalarFunction &f, double x)
{
// auto f = [](double x) { return std::exp(x); };
// double x = 1.7;
double dfdx = boost::math::differentiation::finite_difference_derivative(f, x);
return dfdx;
}
template <int N>
class HelperFunc
{
const VectorFunction<N> &_func;
Vector<N> &_x;
int _der_ind;
public:
HelperFunc(const VectorFunction<N> &inFunc, Vector<N> &x) : _func(inFunc), _x(x)
{ }
HelperFunc(const VectorFunction<N> &inFunc, Vector<N> &x, int der_ind) : _func(inFunc), _x(x), _der_ind(der_ind)
{ }
void setDerInd(int ind) { _der_ind = ind; }
double operator()(double x) const
{
Vector<N> copy{_x};
copy[_der_ind] = x;
return _func(copy);
}
};
template <int N>
static double DerivePartial(const VectorFunction<N> &f, int deriv_index, Vector<N> &point)
{
double x = point[deriv_index];
HelperFunc<N> helper{f, point, deriv_index};
double dfdx = boost::math::differentiation::finite_difference_derivative(helper, x);
return dfdx;
}
// BIG TODO - derivacija vektorskog polja PO ODREĐENOM SMJERU
// template <int N>
// static double DeriveDirectional(const VectorFunction<N> &f, Vector<N> &deriv_direction, Vector<N> &point)
// {
// double x = point[deriv_index];
// HelperFunc<N> helper{f, point, deriv_index};
// double dfdx = boost::math::differentiation::finite_difference_derivative(helper, x);
// return dfdx;
// }
template <int N>
static Vector<N> DerivePartialByAll(const VectorFunction<N> &f, Vector<N> &point)
{
Vector<N> ret;
HelperFunc<N> helper{f, point};
for (int i = 0; i < N; i++)
{
double x = point[i];
helper.setDerInd(i);
ret[i] = boost::math::differentiation::finite_difference_derivative(helper, x);
}
return ret;
}
};
#endif```
CoordSystemGeneral.h
```#if !defined __MML_COORD_SYSTEM_GENERAL_H
#define __MML_COORD_SYSTEM_GENERAL_H
#include <cmath>
#include "MetricTensor.h"
/*
- imamo DVA koordinatna sustava - polazni i cljni
*/
template<int N>
class CoordSystemTransf
{
public:
virtual Vector<N> transf(Vector<N> in) = 0;
virtual VectorFunction<N>& coordTransfFunc(int i) = 0;
};
class CoordTransfSphericalToCartesian : public CoordSystemTransf<3>
{
// q[0] = r - radial distance
// q[1] = theta - inclination
// q[2] = phi - azimuthal angle
public:
static double func1(Vector<3> q) { return q[0] * sin(q[1]) * cos(q[2]); }
static double func2(Vector<3> q) { return q[0] * sin(q[1]) * sin(q[2]); }
static double func3(Vector<3> q) { return q[0] * cos(q[1]); }
inline static VectorFunctionFromStdFunction<3> _func[3] = {
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func1}},
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func2}},
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func3}}
};
Vector<3> transf(Vector<3> q) { return Vector<3>{ func1(q), func2(q), func3(q) }; }
VectorFunction<3>& coordTransfFunc(int i) { return _func[i]; }
};
class CoordTransfCartesianToSpherical : public CoordSystemTransf<3>
{
// q[0] = x
// q[1] = y
// q[2] = z
public:
static double func1(Vector<3> q) { return sqrt(q[0]*q[0] + q[1]*q[1] + q[2]*q[2]); }
static double func2(Vector<3> q) { return atan2(sqrt(q[0]*q[0] + q[1]*q[1]), q[2]); }
static double func3(Vector<3> q) { return atan2(q[1], q[0]); }
inline static VectorFunctionFromStdFunction<3> _func[3] = {
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func1}},
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func2}},
VectorFunctionFromStdFunction<3>{std::function<double(Vector<3>)>{func3}}
};
Vector<3> transf(Vector<3> q) { return Vector<3>{ func1(q), func2(q), func3(q) }; }
VectorFunction<3>& coordTransfFunc(int i) { return _func[i]; }
};
class CoordTransfCylindricalToCartesian : public CoordSystemTransf<3>
{
// q1 = r - distance from symmetry axis
// q2 = theta - angle to symmetry axis
// q3 = z - z
public:
Vector<3> transf(Vector<3> q)
{
Vector<3> ret;
ret[0] = q[0] * cos(q[1]);
ret[1] = q[0] * sin(q[1]);
ret[2] = q[2];
return ret;
}
};
#endif```
MatrixOperations.h
```#if !defined __MML_MATRIX_OPERATIONS_H
#define __MML_MATRIX_OPERATIONS_H
#include "Matrix.h"
#include "VectorN.h"
#include <cmath>
#include <vector>
namespace MML
{
class MatrixOp
{
public:
static bool gaussj(Matrix &a, Matrix &b)
{
int i,icol,irow,j,k,l,ll;
double big,dum,pivinv;
int n=a.RowNum();
int m=b.ColNum();
std::vector<int> indxc(n),indxr(n),ipiv(n);
for (j=0;j<n;j++) ipiv[j]=0;
for (i=0;i<n;i++) {
big=0.0;
for (j=0;j<n;j++)
if (ipiv[j] != 1)
for (k=0;k<n;k++) {
if (ipiv[k] == 0) {
if (fabs(a[j][k]) >= big) {
big=fabs(a[j][k]);
irow=j;
icol=k;
}
}
}
++(ipiv[icol]);
if (irow != icol) {
for (l=0;l<n;l++) std::swap(a[irow][l],a[icol][l]);
for (l=0;l<m;l++) std::swap(b[irow][l],b[icol][l]);
}
indxr[i]=irow;
indxc[i]=icol;
if (a[icol][icol] == 0.0)
return false;
//nrerror("gaussj: Singular Matrix");
pivinv=1.0/a[icol][icol];
a[icol][icol]=1.0;
for (l=0;l<n;l++) a[icol][l] *= pivinv;
for (l=0;l<m;l++) b[icol][l] *= pivinv;
for (ll=0;ll<n;ll++)
if (ll != icol) {
dum=a[ll][icol];
a[ll][icol]=0.0;
for (l=0;l<n;l++) a[ll][l] -= a[icol][l]*dum;
for (l=0;l<m;l++) b[ll][l] -= b[icol][l]*dum;
}
}
for (l=n-1;l>=0;l--) {
if (indxr[l] != indxc[l])
for (k=0;k<n;k++)
std::swap(a[k][indxr[l]],a[k][indxc[l]]);
}
return true;
}
static bool ludcmp(Matrix &a, std::vector<int> &indx, double &d)
{
const double TINY=1.0e-20;
int i,imax,j,k;
double big,dum,sum,temp;
int n=a.RowNum();
VectorN vv(n);
d=1.0;
for (i=0;i<n;i++) {
big=0.0;
for (j=0;j<n;j++)
if ((temp=fabs(a[i][j])) > big) big=temp;
if (big == 0.0)
//nrerror("Singular matrix in routine ludcmp");
return false;
vv[i]=1.0/big;
}
for (j=0;j<n;j++) {
for (i=0;i<j;i++) {
sum=a[i][j];
for (k=0;k<i;k++) sum -= a[i][k]*a[k][j];
a[i][j]=sum;
}
big=0.0;
for (i=j;i<n;i++) {
sum=a[i][j];
for (k=0;k<j;k++) sum -= a[i][k]*a[k][j];
a[i][j]=sum;
if ((dum=vv[i]*fabs(sum)) >= big) {
big=dum;
imax=i;
}
}
if (j != imax) {
for (k=0;k<n;k++) {
dum=a[imax][k];
a[imax][k]=a[j][k];
a[j][k]=dum;
}
d = -d;
vv[imax]=vv[j];
}
indx[j]=imax;
if (a[j][j] == 0.0) a[j][j]=TINY;
if (j != n-1) {
dum=1.0/(a[j][j]);
for (i=j+1;i<n;i++) a[i][j] *= dum;
}
}
return true;
}
static void lubksb(Matrix &a, std::vector<int> &indx, VectorN &b)
{
int i,ii=0,ip,j;
double sum;
int n=a.RowNum();
for (i=0;i<n;i++) {
ip=indx[i];
sum=b[ip];
b[ip]=b[i];
if (ii != 0)
for (j=ii-1;j<i;j++) sum -= a[i][j]*b[j];
else if (sum != 0.0)
ii=i+1;
b[i]=sum;
}
for (i=n-1;i>=0;i--) {
sum=b[i];
for (j=i+1;j<n;j++) sum -= a[i][j]*b[j];
b[i]=sum/a[i][i];
}
}
static bool InvertMatrix(Matrix &a, Matrix &out)
{
int N = a.RowNum();
VectorN col(N);
std::vector<int> indx(N);
double d = 0.0;
ludcmp(a,indx,d); // Decompose the matrix just once.
for(int j=0;j<N;j++) { // Find inverse by columns.
for(int i=0;i<N;i++)
col[i]=0.0;
col[j]=1.0;
lubksb(a,indx,col);
for(int i=0;i<N;i++)
out[i][j]=col[i];
}
return true;
}
static int LUDecomp( Matrix &a, int *indx, double *d )
{
return 0;
}
static void LUBackSubst( Matrix &a, int *indx, VectorN &b )
{
}
};
}
#endif```
Manifold.h
```class Manifold
{
};
/*
Znači, u svakoj točci ima lokalni kartezije
NEMA globalnog mapiranja iz nekog skupa koordinata u svaku točku manifolda!
Sfera
- na oba pola definirati sferne .. hmmm?, jel imaju singularitet za r = 0?
- a za ostatak kartezijeve
- i onda računati geodesicse
Mobiusov strip!!!
- ali, n emogu ga deinirati programski bez da ga embedam u 3D!!!
*/```
test_coord_systems.cpp
```#include "geometry/CoordSystems3D.h"
#include "Fields.h"
#include "MetricTensor.h"
class SimpleScalarField: public ScalarFieldCartesian
{
public:
double Value(Vector3D &pos)
{
return pos.X() * pos.X() + pos.Y() * pos.Y() + pos.Z() * pos.Z();
}
};
class SimpleScalarFieldSpherical: public ScalarFieldSpherical
{
public:
double Value(Vector3DSpherical &pos)
{
Vector3D posCart = CoordTransf::SphericalToCartesian(pos);
return posCart.X() * posCart.X() + posCart.Y() * posCart.Y() + posCart.Z() * posCart.Z();
}
};
void Test_Coord_Systems()
{
std::cout << "TESTING COORDINATE SYSTEMS" << std::endl;
// odaberem točku (1, 1, 1)
Vector3D pos(1.0, 1.0, 1.0);
std::cout << "Cartesian point: " << pos << std::endl;
Vector3DSpherical posSpher = CoordTransf::CartesianToSpherical(pos);
std::cout << "Spherical point: " << posSpher << std::endl;
SimpleScalarField field;
GradientFieldCartesian fieldGrad(field);
Vector3D grad = fieldGrad.Value(pos);
std::cout << "Cartesian gradient: " << grad << std::endl;
SimpleScalarFieldSpherical fieldSpher;
Vector3DSpherical gradSpher = fieldSpher.Gradient(posSpher);
std::cout << "Spherical gradient: " << gradSpher << std::endl;
Vector3D spherGradTrans = CoordTransf::SphericalToCartesian(gradSpher);
std::cout << "Sph. grad. to Cart: " << spherGradTrans << std::endl;
std::cout << "Cartesian gradient tip point: " << pos + grad << std::endl;
std::cout << "Spherical gradient tip point: " << posSpher + gradSpher << std::endl;
Vector3D spherTipTrans = CoordTransf::SphericalToCartesian(posSpher + gradSpher);
std::cout << "Sph. grad. tip conv. to Cart: " << spherTipTrans << std::endl;
}
// TODO - dodati 2D - Cart + Polar
// TODO - sferne koordinate u dvije konvencije
/*
HMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
- krenuti SAMO od transformacijskih funkcija za koordinate???
-> odatle se može izračunati metrički tenzor u svakoj točki!!!!!
*/
// TODO - apstrakcija Polynom - QuadraticForm2D? -. potencije x i y?
// - Polynom2D - input je Vector2D?
// TODO - AUTOMATIC DIFFERENTIATORS
// - traže samo Value( X ) funkciju
// TODO - SKALARNA POLJA
// - gravitacijski potencijal (gradijent je vektor sile)
// TODO - vector field
// - konstantni po jednoj osi
// - koncentrični oko osi (dugi vodič)
// TODO - vector field primjer - laminarni flow u cilindričnoj cijevi!
```
test_metric_tensor.cpp
```#include "MetricTensor.h"
#include <iostream>
void Test_Metric_Tensor()
{
std::cout << "TESTING METRIC TENSOR:\n";
CoordTransfSphericalToCartesian transf;
MetricTensorFromCoordTransf<3> mt(transf);
Vector<3> point { 1.0, 1.0, 1.0 };
for( int i=0; i<3; i++ )
for( int j=0; j<3; j++ )
{
double a = mt.Component(i, j, point);
std::cout << "g[" << i << "," << j << "] = " << a << std::endl;
}
auto metric = mt.MetricAtPoint(point);
metric.Print();
}```
ElectromagneticTensor.h
```template<int N, int M>
class Tensor
{
};
class EMTensor : public Tensor<4, 4>
{
};
// single moving charge
// bitno je definirati koord.system u kojem se kreće
// npr - ide ravno - kartezijan
// - ili, ide u krug, sinhrotron
// beskonačni vodič
```
test_fields.cpp
```#include "Fields.h"
#include "MetricTensor.h"
#include "differential_geometry/CoordSystemGeneral.h"
class RadialScalarPotentialCartesian : public ScalarField<3>
{
MetricTensorCartesian<3> _mt;
public:
double Value(Vector<3> &pos) const
{
double r = sqrt(pos[0]*pos[0] + pos[1]*pos[1] + pos[2]*pos[2]);
return 1/r;
}
const MetricTensor<3>& Metric() const
{
return _mt;
}
};
class RadialScalarPotentialSpherical : public ScalarField<3>
{
CoordTransfSphericalToCartesian _transf;
MetricTensorFromCoordTransf<3> *_mt;
public:
RadialScalarPotentialSpherical() { _mt = new MetricTensorFromCoordTransf<3> (_transf); }
const MetricTensor<3>& Metric() const { return *_mt; }
double Value(Vector<3> &pos) const { return 1 / pos[0]; }
};
class RadialScalarPotentialSpherical_R_squared : public ScalarField<3>
{
CoordTransfSphericalToCartesian _transf;
MetricTensorFromCoordTransf<3> *_mt;
public:
RadialScalarPotentialSpherical_R_squared() { _mt = new MetricTensorFromCoordTransf<3> (_transf); }
const MetricTensor<3>& Metric() const { return *_mt; }
double Value(Vector<3> &pos) const { return pos[0] * pos[2]; }
};
void Test_Fields()
{
std::cout << "TESTING FIELDS:\n";
RadialScalarPotentialCartesian fieldCart;
RadialScalarPotentialSpherical fieldSpher;
Vector<3> posC{1.0, 1.0, 1.0 };
Vector<3> gradC = fieldCart.Gradient(posC);
std::cout << gradC << std::endl;
CoordTransfCartesianToSpherical cartToSpher;
auto posS = cartToSpher.transf(posC);
std::cout << posS << std::endl;
Vector<3> gradS = fieldSpher.Gradient(posS);
std::cout << gradS << std::endl;
}```
Fields.h
```#if !defined __MML_FIELDS_H
#define __MML_FIELDS_H
#include <cmath>
#include <numbers>
#include <iostream>
#include <iomanip>
#include "geometry/CoordSystems3D.h"
#include "VectorStatic.h"
#include "Function.h"
#include "MetricTensor.h"
template<int N>
class ScalarField : VectorFunction<N>
{
public:
virtual double Value(Vector<N> &pos) const = 0;
virtual const MetricTensor<N>& Metric() const = 0;
virtual double operator()(Vector<N> x) const
{
return Value(x);
}
Vector<N> Gradient(Vector<N> &pos) const
{
Vector<N> ret;
Vector<N> derivsAtPoint = Derivation::DerivePartialByAll(*this, pos);
const MetricTensor<N>& m = Metric();
Matrix<N,N> metricAtPoint = m.MetricAtPoint(pos);
ret = m.MetricAtPoint(pos) * derivsAtPoint;
return ret;
}
};
template<int N>
class ScalarFieldWithFunction: public ScalarField<N>
{
VectorFunction<N> &_func;
public:
virtual double Value(Vector<N> &pos) = 0;
ScalarFieldWithFunction(VectorFunction<N> &inFunc) : _func(inFunc)
{}
};
// TODO - osnovni primjer ovoga će biti vektorski potencijal A, za dugački vodič kroz koji teče struja
template<int N>
class VectorField
{
public:
// domain???
virtual Vector<N> Value(Vector<N> &pos) = 0;
};
template<int N>
class GradientField : public VectorField<N>
{
ScalarField<N> _scalarField;
public:
GradientField(ScalarField<N> &inField) : _scalarField(inField)
{}
Vector<N> Value(Vector<N> &pos)
{
return Vector<N>{};
}
};
#endif```
derivation_tests.cpp
```#include "../catch/catch.hpp"
#include "Derivation.h"
double TestSin(double x)
{
return sin(x);
}
// TODO - definirati još par vsti funkcija - member, + razno
TEST_CASE("Test_Derivative", "[simple]") {
std::function<double(double)> func = TestSin;
ScalarFunction f{func};
double c = func(1.0);
double d = f(1.0);
double der = Derivation::Derive(f, 1.0);
REQUIRE(cos(1.0) == Approx(der).epsilon(1e-10));
}
double TestScalarField(Vector<3> x)
{
return cos(x[0]) + sin(x[1]) + exp(x[2]);
}
TEST_CASE("Test_Partial_Derivative", "[simple]") {
std::function<double(Vector<3>)> func = TestScalarField;
VectorFunctionFromStdFunction<3> f{func};
Vector<3> point{1.0, 1.0, 1.0 };
double c = func(point);
double d = f(point);
// prva komponenta je cos() pa očekujemo derivaciju -sin()
double der1 = Derivation::DerivePartial(f, 0, point);
REQUIRE(-sin(1.0) == Approx(der1).epsilon(1e-10));
// druga komponenta je sin() pa očekujemo derivaciju cos()
double der2 = Derivation::DerivePartial(f, 1, point);
REQUIRE(cos(1.0) == Approx(der2).epsilon(1e-10));
// treća komponenta je exp() pa očekujemo derivaciju exp()
double der3 = Derivation::DerivePartial(f, 2, point);
REQUIRE(exp(1.0) == Approx(der3).epsilon(1e-10));
}```
test_integration.cpp
```#include "Integration.h"
#include <iostream>
/* TODO
- definirati skup testnih funkcija
-
*/
double TestFunc(double x)
{
return sin(x);
}
double TestFunc2(double x)
{
return x;
}
void Test_Integration()
{
double res = qtrap<double>(TestFunc2, 0, 1.0);
std::cout << "Integration result: " << res << std::endl;
}```
test_vector_matrix.cpp
```#include <iostream>
#include "VectorN.h"
#include "Matrix.h"
#include "MatrixOperations.h"
#include "Integration.h"
void Test_Vector_Matrix()
{
MML::VectorN vec1{1.0/3.0, 2.0, 3.0};
std::cout << vec1;
//MML::VectorN c = 2 * a;
MML::Matrix m1(2,2), m2(2,2), m3;
m1[0][0] = 1.0;
m1[0][1] = -1.0;
m1[1][0] = 1.5;
m1[1][1] = 3.0;
m2.MakeUnitMatrix();
m3 = m1 + m2;
// m1.Print();
// m2.Print();
// m3.Print();
std::cout << "SOLVING VIA GAUSS-JORDAN ELIMINATION:\n";
MML::Matrix mat1(3, 3, { 1.0, 2.0, -1.0, -1.0, 5.0, 6.0, 3.0, 1.0, 1.0 });
MML::Matrix rhs1(3, 1, {1.0, 2.0, 1.0});
MML::Matrix mat1copy(mat1);
MML::MatrixOp::gaussj(mat1copy, rhs1);
std::cout << "Initial matrix:\n";
mat1.Print();
std::cout << "Solution:\n";
rhs1.Print();
// inicijaliziramo rhs1Vec sa rješenjem
MML::VectorN rhs1Vec({rhs1[0][0], rhs1[1][0], rhs1[2][0]});
MML::VectorN res = mat1 * rhs1Vec;
std::cout << "Multiplying solution with matrix: " << res << std::endl;
std::cout << "\nSOLVING VIA LU DECOMPOSITION:\n";
MML::Matrix mat2copy(mat1);
std::cout << "Matrix: " << std::endl;
mat2copy.Print();
double d = 0.0;
std::vector<int> indx(3);
MML::MatrixOp::ludcmp(mat2copy, indx, d);
std::cout << "After LU: " << std::endl;
mat2copy.Print();
MML::VectorN vecC({1.0, 2.0, 1.0});
MML::MatrixOp::lubksb(mat2copy, indx, vecC);
std::cout << "Resulting vector: " << vecC << std::endl;
std::cout << "\nINVERTING MATRIX:\n";
MML::Matrix mat3copy(mat1), matInverted(mat1.RowNum(), mat1.ColNum());
MML::MatrixOp::InvertMatrix(mat3copy, matInverted);
std::cout << "Inverted matrix:\n";
matInverted.Print();
MML::Matrix mul = mat1 * matInverted;
mul.Print();
// std::cout << "Matrix = (" << m3[0][0] << ", " << m3[0][1] << ")" << std::endl;
// Vector eigenValues(2);
// Vector *eigenVectors;
// CalcEigenvectors(m1, eigenValues, &eigenVectors);
// std::cout << "Eigenvalues = (" << eigenValues[0] << ", " << eigenValues[1] << ")" << std::endl;
}```
VectorN.h
```#if !defined __MML_VECTORN_H
#define __MML_VECTORN_H
#include <vector>
#include <iostream>
#include <iomanip>
#include <string>
#include <initializer_list>
namespace MML
{
class VectorN
{
public:
VectorN(int n) : _elems(n) {}
VectorN(std::initializer_list<double> list) : _elems(list) { }
double& operator[](int n) { return _elems[n]; }
size_t size() const { return _elems.size(); }
std::string to_string(std::string format)
{
std::string a{"0.0"};
return a;
}
friend std::ostream& operator<<(std::ostream& stream, const VectorN &a)
{
stream << "[";
bool first = true;
for(const double& x : a._elems)
{
if( !first )
stream << ", ";
else
first = false;
stream << std::setw(8) << x;
}
stream << "]";
return stream;
}
private:
std::vector<double> _elems;
};
}
#endif```
Group.h
```class Group
{
};```
test_speed_functions.cpp
```#include <cmath>
#include <chrono>
#include <iostream>
#include <string>
#include <vector>
/*
FUNKCIJA
- exp, log, log10, log2,
- pow, sqrt, cbrt
- sin, cos, tan, asin, acos, atan
- sinh, cosh, tanh, asinh, acosh, atanh
- Error and gamma func - erf, tgamma, lgamma
- Special func - assoc_laguerre, assoc_legendre, beta, comp_ellint_1(2,3), cyl_bessel_I(j,k)
- hermite, legendre, lagurre, riemann_zeta, sph_bessel, sph_legendre
*/
// inline double eval_hermite_1(double x ) { return std::hermite(1, x); }
// inline double eval_hermite_3(double x ) { return std::hermite(3, x); }
// inline double eval_hermite_5(double x ) { return std::hermite(5, x); }
// inline double eval_hermite_10(double x ) { return std::hermite(10, x); }
// inline double eval_hermite_20(double x ) { return std::hermite(20, x); }
// inline double eval_hermite_30(double x ) { return std::hermite(30, x); }
// inline double eval_sph_bessel_3(double x ) { return std::sph_bessel(3, x); }
// esencijalno DVOPARAMETARSKE FUNKCIJE???
// pow, beta, ellint
struct FuncToEval
{
double (*_func)(double);
std::string _name;
double _low;
double _up;
};
std::vector<FuncToEval> vec_func = {
{ exp, "exp", -10, 10 },
{ log, "log", 0.0, 1e6 },
{ log10, "log10", 0.0, 1e6 },
{ sin, "sin", -3.14159, 3.14159 },
{ cos, "cos", -3.14159, 3.14159 },
{ tan, "tan", -3.14159, 3.14159 },
{ asin, "asin", -1, 1 },
{ acos, "acos", -1, 1 },
{ atan, "atan", -1e3, 1e3 },
{ std::erf, "ef", -3.14159, 3.14159 },
{ std::tgamma, "tgamma", -3.14159, 3.14159 }
// { eval_hermite_1, "Hermite 1", -1e3, 1e3 },
// { eval_hermite_3, "Hermite 3", -1e3, 1e3 },
// { eval_hermite_5, "Hermite 5", -1e3, 1e3 },
// { eval_hermite_10, "Hermite 10", -1e3, 1e3 },
// { eval_hermite_20, "Hermite 20", -1e3, 1e3 },
// { eval_hermite_30, "Hermite 30", -1e3, 1e3 },
// { eval_sph_bessel_3, "Sph Bessel 3", -1e3, 1e3 }
};
static const int num_evals = 1000000;
void Test_Speed_Functions()
{
std::cout << "TESTING SPEED OF FUNCTIONS\n";
using std::chrono::high_resolution_clock;
using std::chrono::duration_cast;
using std::chrono::duration;
using std::chrono::milliseconds;
double x = 0.0;
double y = 0.0;
for(auto f : vec_func)
{
auto t1 = high_resolution_clock::now();
for (int i = 0; i < num_evals; i++)
{
x = rand() % 1000 * (f._up - f._low) / 1000.0 + f._low;
y = f._func(x);
}
auto t2 = high_resolution_clock::now();
/* Getting number of milliseconds as a double. */
duration<double, std::milli> ms_double = t2 - t1;
std::cout << f._name << " - " << ms_double.count() << " ms\n";
}
}
```
test_polynom.cpp
```#include "Polynom.h"
void Test_Polynom()
{
}```
MatrixStatic.h
```#include <iostream>
template <int N, int M>
class Matrix
{
double _vals[N][M];
public:
double &operator()(int i, int j) { return _vals[i][j]; }
Vector<N> operator*(Vector<N> &b)
{
int i, j;
Vector<N> ret;
for (i = 0; i < N; i++)
{
ret[i] = 0;
for (j = 0; j < N; j++)
ret[i] += _vals[i][j] * b[j];
}
return ret;
}
void Print()
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < M; j++)
{
std::cout << std::setw(10) << std::setprecision(3) << _vals[i][j] << ", ";
}
std::cout << std::endl;
}
}
};
```
test_speed_derivation.cpp
```
void Test_Speed_Derivation()
{
}```
CoordSystems2D.h
```class Vector2D
{
public:
double _x, _y;
};
class Vector2DPolar
{
public:
double _r, _rho;
};```
Integration.h
```#include <cmath>
#define FUNC_INT(X) ((*func)(x))
template < class T > T trapzd( T (* func) (T), T a, T b, int n )
{
/*
Funkcija raèuna n-ti korak proširenog trapezoidalnog pravila
n - broj toèaka koji se koristi kod inteprolacije unutar intervala
*/
T x=0, tnm, sum, del;
static T s;
int it, j;
if( n == 1 )
return (s=0.5*(b-a)*(FUNC_INT(a)+FUNC_INT(b)));
else
{
for( it=1,j=1; j<n-1; j++ )
it <<=1;
tnm = it;
del = (b-a)/tnm;
x = a+0.5*del;
for( sum=0.0, j=1; j<=it; j++, x+=del )
sum +=FUNC_INT(x);
s=0.5 * (s+(b-a)*sum/tnm);
return s;
}
}
#define NINTEGR_EPS 1.0e-5f
#define JMAX 20
template < class T > T qtrap(T (* func) (T), T a, T b )
{
/*
Integrira funkciju 'func' koristeæi trapezoidalno pravilo
NINETGR_EPS - željena relativna toènost
JMAX - max. broj koraka
*/
int j;
T s, olds;
olds = T(-1.e30f);
for( j=1; j<=JMAX; j++ )
{
s = trapzd(func,a,b,j);
if( fabs(s-olds) < NINTEGR_EPS*fabs(olds) )
return s;
if( s == 0.0 && olds == 0.0 && j > 6 )
return s;
olds = s;
}
//printf("To many steps in NIntegrate !!!");
return T();
}
template double trapzd<double> ( double (*)(double), double, double, int );
template double qtrap<double> ( double (*)(double), double, double );```
MetricTensor.h
```#if !defined __MML_METRIC_TENSOR_H
#define __MML_METRIC_TENSOR_H
#include "VectorStatic.h"
#include "MatrixStatic.h"
#include "Derivation.h"
#include "differential_geometry/CoordSystemGeneral.h"
template<int N>
class MetricTensor
{
public:
virtual double Component(int i, int j, Vector<N> &pos) const = 0;
virtual Matrix<N, N> MetricAtPoint(Vector<N> &pos) const = 0;
};
template<int N>
class MetricTensorCartesian: public MetricTensor<N>
{
public:
virtual double Component(int i, int j, Vector<N> &pos) const
{
if( i == j )
return 1.0;
else
return 0.0;
}
virtual Matrix<N, N> MetricAtPoint(Vector<N> &pos) const
{
Matrix<N, N> ret;
for( int i=0; i<3; i++ )
for( int j=0; j<N; j++ )
ret(i,j) = Component(i,j, pos);
return ret;
}
};
template<int N>
class MetricTensorFromCoordTransf: public MetricTensor<N>
{
CoordSystemTransf<N> &_coordTransf;
public:
MetricTensorFromCoordTransf(CoordSystemTransf<N> &inTransf) : _coordTransf(inTransf)
{ }
virtual double Component(int i, int j, Vector<N> &pos) const
{
double g_ij = 0.0;
for(int l=0; l<3; l++)
{
g_ij += Derivation::DerivePartial(_coordTransf.coordTransfFunc(l), i, pos) * Derivation::DerivePartial(_coordTransf.coordTransfFunc(l), j, pos);
}
return g_ij;
}
virtual Matrix<N, N> MetricAtPoint(Vector<N> &pos) const
{
Matrix<N, N> ret;
for( int i=0; i<3; i++ )
for( int j=0; j<N; j++ )
ret(i,j) = Component(i,j, pos);
return ret;
}
};
#endif```
test_function.cpp
```#include "Function.h"
void Test_Function()
{
}```
CoordSystems3D.h
```#if !defined __MML_COORD_SYSTEMS_H
#define __MML_COORD_SYSTEMS_H
#include <cmath>
#include <numbers>
#include <iostream>
#include <sstream>
#include <iomanip>
/*
Kompletno modelirati sve u 3D koordinatnom sistemu
- kartezijeve, sferne i cilindrične koordinate, konkreten
- definirani i gradijenti i operatori točni
- rotacije i konkretne transformacije?
*/
class Vector3D
{
private:
double _x, _y, _z;
public:
Vector3D() : _x{0.0}, _y{0.0}, _z{0.0} {}
Vector3D(double x, double y, double z) : _x{x}, _y{y}, _z{z} {}
double &X() { return _x; }
double &Y() { return _y; }
double &Z() { return _z; }
double X() const { return _x; }
double Y() const { return _y; }
double Z() const { return _z; }
Vector3D operator+(Vector3D &b)
{
return Vector3D{X()+b.X(), Y() + b.Y(), Z() + b.Z()};
}
friend std::ostream &operator<<(std::ostream &stream, const Vector3D &a)
{
stream << "[" << std::setw(8) << a._x << ", " << a._y << ", " << a._z << "]";
return stream;
}
};
class Vector3DSpherical
{
private:
double _r, _theta, _phi;
public:
Vector3DSpherical(double r, double theta, double phi) : _r{r}, _theta{theta}, _phi{phi} {}
double &R() { return _r; }
double &Theta() { return _theta; }
double &Phi() { return _phi; }
double R() const { return _r; }
double Theta() const { return _theta; }
double Phi() const { return _phi; }
Vector3DSpherical operator+(Vector3DSpherical &b)
{
return Vector3DSpherical{R()+b.R(), Theta() + b.Theta(), Phi() + b.Phi()};
}
friend std::ostream &operator<<(std::ostream &stream, const Vector3DSpherical &a)
{
stream << "[" << std::setw(8) << a._r << ", " << a._theta << ", " << a._phi << "]";
return stream;
}
};
class CoordTransf
{
public:
static Vector3D SphericalToCartesian(const Vector3DSpherical &vec)
{
Vector3D outCart;
outCart.X() = vec.R() * sin(vec.Theta()) * cos(vec.Phi());
outCart.Y() = vec.R() * sin(vec.Theta()) * sin(vec.Phi());
outCart.Z() = vec.R() * cos(vec.Theta());
return outCart;
}
static Vector3DSpherical CartesianToSpherical(const Vector3D &cartCoords)
{
double outRadius = sqrt(cartCoords.X() * cartCoords.X() + cartCoords.Y() * cartCoords.Y() + cartCoords.Z() * cartCoords.Z());
double outTheta = acos(cartCoords.Z() / outRadius);
double outPhi = atan2(cartCoords.Y(), cartCoords.X());
return Vector3DSpherical{outRadius, outTheta, outPhi};
}
};
class Cartesian3DDomain
{
virtual bool IsInDomain(Vector3D &pos) = 0;
};
class ScalarFieldCartesian
{
public:
// domain???
virtual double Value(Vector3D &pos) = 0;
};
class VectorFieldCartesian
{
public:
// domain???
virtual Vector3D Value(Vector3D &pos) = 0;
};
class GradientFieldCartesian : public VectorFieldCartesian
{
public:
ScalarFieldCartesian &_scalarField;
public:
GradientFieldCartesian(ScalarFieldCartesian &scalarField) : _scalarField(scalarField)
{}
virtual Vector3D Value(Vector3D &pos)
{
double eps = 1e-6;
Vector3D pos_x_h1{pos.X() - eps, pos.Y(), pos.Z()};
Vector3D pos_x_h2{pos.X() + eps, pos.Y(), pos.Z()};
double val_x = (_scalarField.Value(pos_x_h2) - _scalarField.Value(pos_x_h1)) / (2 * eps);
Vector3D pos_y_h1{pos.X(), pos.Y() - eps, pos.Z()};
Vector3D pos_y_h2{pos.X(), pos.Y() + eps, pos.Z()};
double val_y = (_scalarField.Value(pos_y_h2) - _scalarField.Value(pos_y_h1)) / (2 * eps);
Vector3D pos_z_h1{pos.X(), pos.Y(), pos.Z() - eps};
Vector3D pos_z_h2{pos.X(), pos.Y(), pos.Z() + eps};
double val_z = (_scalarField.Value(pos_z_h2) - _scalarField.Value(pos_z_h1)) / (2 * eps);
return Vector3D{val_x, val_y, val_z};
}
};
class ScalarFieldSpherical
{
public:
// domain???
virtual double Value(Vector3DSpherical &pos) = 0;
virtual Vector3DSpherical Gradient(Vector3DSpherical &pos)
{
double eps = 1e-6;
Vector3DSpherical pos_r_h1{pos.R() - eps, pos.Phi(), pos.Theta()};
Vector3DSpherical pos_r_h2{pos.R() + eps, pos.Phi(), pos.Theta()};
double val_r = (Value(pos_r_h2) - Value(pos_r_h1)) / (2 * eps);
Vector3DSpherical pos_rho_h1{pos.R(), pos.Phi() - eps, pos.Theta()};
Vector3DSpherical pos_rho_h2{pos.R(), pos.Phi() + eps, pos.Theta()};
double val_rho = (Value(pos_rho_h2) - Value(pos_rho_h1)) / (2 * eps);
Vector3DSpherical pos_theta_h1{pos.R(), pos.Phi(), pos.Theta() - eps};
Vector3DSpherical pos_theta_h2{pos.R(), pos.Phi(), pos.Theta() + eps};
double val_theta = (Value(pos_theta_h2) - Value(pos_theta_h1)) / (2 * eps);
return Vector3DSpherical{val_r, val_rho, val_theta};
}
};
#endif```
BrownMotionSimulator.h
```class BrownMotionSimulator
{
/*
- identične čestice sa zadanom masom i randomiziranom (istom?) brzinom
- od N čestica odabrati M, i vidjeti kako izgleda njihov put - da li je prosječno sqrt(n)
T = 0
pomakni svaku česticu za dT
svako gibanje generira NDim-1 površinu
identificirati sve koje se sijeku
za svaku vidjeti da li je stvarno došlo do sudara (možda su se promašili)
funkcija DidCollisionOccured
- (P11), v1 i (P12) - prvo tijelo - početna točka, brzina, završna točka
- (P21), v2 i (P22) - drugo tijelo - ...
- vraća bool, i ako je true vraća točku sudara
*/
};
```
Function.h
```#if !defined __MML_FUNCTION_H
#define __MML_FUNCTION_H
#include <functional>
#include "VectorStatic.h"
// TODO
template<typename _RetType, typename _ArgType>
class FunctionTemplate
{
public:
virtual _RetType operator()(_ArgType) = 0;
};
// napraviti specijalizaciju za double, double
// odnosno nekoliko njih! - jedna je std::function, druga je Tabulated
// Function1D
class ScalarFunction
{
public:
std::function<double(double)> &_func;
ScalarFunction(std::function<double(double)> &inFunc) : _func(inFunc)
{}
double operator()(double x) const
{
return _func(x);
}
};
template<int N>
class VectorFunction
{
public:
virtual double operator()(Vector<N> x) const = 0;
};
template<int N>
class VectorFunctionFromStdFunction : public VectorFunction<N>
{
public:
std::function<double(Vector<N>)> _func;
VectorFunctionFromStdFunction(std::function<double(Vector<N>)> inFunc) : _func(inFunc)
{}
double operator()(Vector<N> x) const
{
return _func(x);
}
};
class VectorToVectorFunction
{
public:
std::function<Vector<3>(Vector<3>)> &_func;
VectorToVectorFunction(std::function<Vector<3>(Vector<3>)> &inFunc) : _func(inFunc)
{}
Vector<3> operator()(Vector<3> x) const
{
return _func(x);
}
};
// VectorFunction!!!
// može se parcijalno derivirati
// može se inicijalizirati s Vector3 Transf(Vector3)!
#endif```
|
zvanjak/TestingNeuralNetworks
|
zvanjak/TestingNeuralNetworks
README.md
```# TestingNeuralNetworks
Testing neural networks implementation
```
|
zvansom/react-films
|
zvansom/react-films
FilmRow.js
```import React, { Component } from 'react';
import FilmPoster from './FilmPoster';
export default class FilmRow extends Component {
render() {
const {poster, title} = this.props
const date = new Date(this.props.date);
return(
<div className="film-row">
<FilmPoster poster={poster} />
<div className="film-summary">
<h1>{title}</h1>
<p>{date.getFullYear()}</p>
</div>
</div>
)
}
}
```
FilmListing.js
```import React, { Component } from 'react';
import FilmRow from './FilmRow';
export default class FilmListing extends Component {
render() {
return (
<div className="film-library">
<div className="film-list">
<h1 className="section-title">FILMS</h1>
{this.props.films.map(film =>
<FilmRow
key={film.id}
poster={film.poster_path}
title={film.title}
date={film.release_date}
/>)}
</div>
</div>
)
}
}```
|
zvebbo/FlyYouFools
|
zvebbo/FlyYouFools
traveler.rb
```class Traveler < ActiveRecord::Base
belongs_to :booking
validates :name, :presence => true,
:length => { :minimum => 2 }
validates_format_of :personal_number, :with =>/[0-9]{10}/
validates_uniqueness_of :personal_number
end
```
airplanes_controller.rb
```class AirplanesController < ApplicationController
# GET /airplanes
# GET /airplanes.xml
def index
@airplanes = Airplane.all
respond_to do |format|
format.html # index.html.erb
format.xml { render :xml => @airplanes }
end
end
# GET /airplanes/1
# GET /airplanes/1.xml
def show
@airplane = Airplane.find(params[:id])
respond_to do |format|
format.html # show.html.erb
format.xml { render :xml => @airplane }
end
end
end
```
airports_controller.rb
```class AirportsController < ApplicationController
# GET /airports
# GET /airports.json
def index
@airports = Airport.all
respond_to do |format|
format.html # index.html.erb
format.json { render :json => @airports }
end
end
end
```
book_controller.rb
```class BookController < ApplicationController
def choose_destination
end
def choose_dates
end
def choose_travelers
end
def choose_payment
end
def confirmation
end
end
```
20110406085255_create_flights.rb
```class CreateFlights < ActiveRecord::Migration
def self.up
create_table :flights do |t|
t.string :flight_no
t.datetime :departure_time
t.integer :duration
t.integer :origin
t.integer :destination
t.integer :airplane_id
t.integer :price
t.timestamps
end
end
def self.down
drop_table :flights
end
end
```
travelers_controller.rb
```class TravelersController < ApplicationController
# GET /travelers
# GET /travelers.xml
def index
@travelers = Traveler.all
respond_to do |format|
format.html # index.html.erb
format.xml { render :xml => @travelers }
end
end
# GET /travelers/1
# GET /travelers/1.xml
def show
@traveler = Traveler.find(params[:id])
respond_to do |format|
format.html # show.html.erb
format.xml { render :xml => @traveler }
end
end
# GET /travelers/new
# GET /travelers/new.xml
def new
@traveler = Traveler.new
respond_to do |format|
format.html # new.html.erb
format.xml { render :xml => @traveler }
end
end
# GET /travelers/1/edit
def edit
@traveler = Traveler.find(params[:id])
end
# POST /travelers
# POST /travelers.xml
def create
@traveler = Traveler.new(params[:traveler])
respond_to do |format|
if @traveler.save
format.html { redirect_to(@traveler, :notice => 'Traveler was successfully created.') }
format.xml { render :xml => @traveler, :status => :created, :location => @traveler }
else
format.html { render :action => "new" }
format.xml { render :xml => @traveler.errors, :status => :unprocessable_entity }
end
end
end
# PUT /travelers/1
# PUT /travelers/1.xml
def update
@traveler = Traveler.find(params[:id])
respond_to do |format|
if @traveler.update_attributes(params[:traveler])
format.html { redirect_to(@traveler, :notice => 'Traveler was successfully updated.') }
format.xml { head :ok }
else
format.html { render :action => "edit" }
format.xml { render :xml => @traveler.errors, :status => :unprocessable_entity }
end
end
end
# DELETE /travelers/1
# DELETE /travelers/1.xml
def destroy
@traveler = Traveler.find(params[:id])
@traveler.destroy
respond_to do |format|
format.html { redirect_to(travelers_url) }
format.xml { head :ok }
end
end
end
```
airport.rb
```class Airport < ActiveRecord::Base
has_many :flights
validates :stad, :presence => true,
:length => { :minimum => 2 }
validates_format_of :iata, :with =>/[A-Z]{3}/
validates_uniqueness_of :iata
end
```
flight.rb
```class Flight < ActiveRecord::Base
belongs_to :airport, :foreign_key => "origin"
belongs_to :airport, :foreign_key => "destination"
belongs_to :airplane
has_many :bookings
end
```
Gemfile
```source 'http://rubygems.org'
gem 'rails', '3.0.5'
gem 'sqlite3-ruby', :require => 'sqlite3'
gem 'geokit'
gem 'geokit-rails'
group :development, :test do
gem 'ffaker'
gem 'machinist'
end
# Use unicorn as the web server
# gem 'unicorn'
# To use debugger (ruby-debug for Ruby 1.8.7+, ruby-debug19 for Ruby 1.9.2+)
# gem 'ruby-debug'
# gem 'ruby-debug19', :require => 'ruby-debug'
```
booking.rb
```class Booking < ActiveRecord::Base
has_many :flights
has_many :travelers
validates_presence_of :flight
validates_associated :flight
validates :name, :presence => true,
:length => { :minimum => 2 }
validates_format_of :personal_number, :with =>/[0-9]{10}/
validates_format_of :mail, :with =>/^([^@\s]+)@((?:[-a-z0-9]+\.)+[a-z]{2,})$/
validates :phone_number, :presence => true,
:length => { :minimum => 5 }
end
```
airplane.rb
```class Airplane < ActiveRecord::Base
has_many :flights
validates :name, :presence => true,
:length => { :minimum => 2 }
validates :max_passengers, :presence => true
end
```
book.js
```function initialize() {
var latlng = new google.maps.LatLng(39.3682, 4.9218);
var myOptions = {
zoom: 2,
center: latlng,
mapTypeId: google.maps.MapTypeId.ROADMAP,
mapTypeControl: false,
maxZoom: 10,
minZoom: 2,
overviewMapControl: false,
streetViewControl: false
};
var map = new google.maps.Map(document.getElementById("map_canvas"), myOptions);
google.maps.event.addListener(map, 'zoom_changed', function() {
alert("Zoom changed");
});
}
window.onload = initialize;
```
|
zvercodebender/UTNASAMiningClub
|
zvercodebender/UTNASAMiningClub
Form1.cs
```using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
using System.Net.Sockets;
namespace NasaRobot
{
public partial class Form1 : Form
{
System.Net.Sockets.TcpClient sock = new TcpClient();
bool addValue = true;
int motorSpeed = 64;
int actuatorSpeed = 64;
public Form1()
{
InitializeComponent();
cmbMotorSelect.SelectedIndex = 0;
cmbActuatorSelect.SelectedIndex = 0;
connectSocket();
}
private void connectSocket()
{
string board = "192.168.69.120"; //make sure to update this once IP is made static
sock.Connect(board, 23);
}
private void sendMessage(string deviceName, string command, int value)
{
NetworkStream serverStream = sock.GetStream();
//calculate actual value to pass to motor. value of 64 is stop, > 64 is forward, < 64 is backwards. range is 0-128
value = (value * ((addValue) ? 1 : -1)) + 64;
byte[] outStream = System.Text.Encoding.ASCII.GetBytes(deviceName + ", " + command + ", " + value + "\x04");
serverStream.Write(outStream, 0, outStream.Length);
serverStream.Flush();
//read back buffer. We were getting issues, so commented out for now
/*byte[] inStream = new byte[99999];
serverStream.Read(inStream, 0, (int)sock.ReceiveBufferSize);
string returnData = System.Text.Encoding.ASCII.GetString(inStream);
lblDisplay.Text = returnData;
*/
}
#region MOTOR CONTROLS
#region RADIO BUTTONS
private void rbMotorEighth_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 8;
}
private void rbMotorQuarter_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 16;
}
private void rbMotorThreeEighths_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 24;
}
private void rbMotorHalf_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 32;
}
private void rbMotorFiveEighths_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 40;
}
private void rbMotorThreeQuarters_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 48;
}
private void rbMotorSevenEighths_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 56;
}
private void rbMotorFull_CheckedChanged(object sender, EventArgs e)
{
motorSpeed = 64;
}
#endregion
#region BUTTON COMMANDS
private void btnForward_Click(object sender, EventArgs e)
{
addValue = true;
sendMessage(cmbMotorSelect.Text, "Forward", motorSpeed);
}
private void btnMotorStop_Click(object sender, EventArgs e)
{
sendMessage(cmbMotorSelect.Text, "Stop", 64);
}
private void btnReverse_Click(object sender, EventArgs e)
{
addValue = false;
sendMessage(cmbMotorSelect.Text, "Reverse", motorSpeed);
}
private void btnLeft_Click(object sender, EventArgs e)
{
sendMessage(cmbMotorSelect.Text, "Left", motorSpeed);
}
private void btnRight_Click(object sender, EventArgs e)
{
sendMessage(cmbMotorSelect.Text, "Right", motorSpeed);
}
#endregion
#endregion
#region ACTUATOR CONTROLS
#region RADIO BUTTONS
private void rbActEighth_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 8;
}
private void rbActQuarter_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 16;
}
private void rbActThreeEighths_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 24;
}
private void rbActHalf_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 32;
}
private void rbActFiveEighths_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 40;
}
private void rbThreeQuarters_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 48;
}
private void rbSevenEighths_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 56;
}
private void rbActFull_CheckedChanged(object sender, EventArgs e)
{
actuatorSpeed = 64;
}
#endregion
#region BUTTON COMMANDS
private void btnUp_Click(object sender, EventArgs e)
{
addValue = true;
sendMessage(cmbActuatorSelect.Text, "Up", actuatorSpeed);
}
private void btnActuatorStop_Click(object sender, EventArgs e)
{
sendMessage(cmbActuatorSelect.Text, "Up", actuatorSpeed);
}
private void btnDown_Click(object sender, EventArgs e)
{
addValue = false;
sendMessage(cmbActuatorSelect.Text, "Up", actuatorSpeed);
}
#endregion
#endregion
private void panel2_Paint(object sender, PaintEventArgs e)
{
}
private void cmbMotorSelect_SelectedIndexChanged(object sender, EventArgs e)
{
//cmbMotorSelect.Text = "DriveMotor";
}
private void panel3_Paint(object sender, PaintEventArgs e)
{
}
}
}
```
|
zvirdaniel/Random-Picture-Viewer
|
zvirdaniel/Random-Picture-Viewer
Direction.java
```package cz.zvir.rpv;
public enum Direction {
NEXT, PREVIOUS
}
```
README.md
```# Random Picture Viewer
## Releasing
* Use `gradle jar` command to create an executable JAR file which will contain all the necessary JavaFX dependencies
* Use [Packr](https://github.com/libgdx/packr) to create standalone self-contained applications for windows, macOS and linux
### Example Packr usage
```
java -jar packr-all-3.0.0.jar \
--platform windows64 \
--jdk openJDK-11-win64.zip \
--executable RandomPictureViewer \
--classpath RPV-1.0.jar \
--mainclass cz.zvir.rpv.Launcher \
--vmargs Xmx1G \
--output random-picture-viewer
```
```
RandomPictureViewerApp.java
```package cz.zvir.rpv;
import javafx.application.Application;
import javafx.fxml.FXMLLoader;
import javafx.scene.Scene;
import javafx.scene.image.Image;
import javafx.stage.Stage;
public class RandomPictureViewerApp extends Application {
public static void main(String[] args) {
launch(args);
}
@Override
public void start(Stage stage) throws Exception {
final FXMLLoader loader = new FXMLLoader(getClass().getResource("window.fxml"));
final Scene scene = new Scene(loader.load(), 1080, 720);
stage.setMinWidth(1080);
stage.setMinHeight(720);
stage.setScene(scene);
stage.show();
stage.getIcons().add(new Image(this.getClass().getResource("icon.png").toString()));
stage.setTitle("Random Picture Viewer");
final Controller controller = loader.getController();
controller.setFocusOnNextButton();
}
}
```
Launcher.java
```package cz.zvir.rpv;
public class Launcher {
public static void main(String[] args) {
RandomPictureViewerApp.main(args);
}
}
```
DataProvider.java
```package cz.zvir.rpv;
import javafx.scene.control.Alert;
import javafx.scene.image.Image;
import java.io.File;
import java.net.MalformedURLException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.ListIterator;
import java.util.Objects;
class DataProvider {
private static final DataProvider ourInstance = new DataProvider();
static DataProvider getInstance() {
return ourInstance;
}
private ListIterator<File> pictureIterator;
private File currentFile = null;
File getCurrentFile() {
return currentFile;
}
boolean openFolder(File inputDirectory) {
final List<String> supportedExtensions = List.of(".jpg", ".jpeg", ".png", ".gif");
final List<File> pictureFiles = new ArrayList<>();
for (final var file : Objects.requireNonNull(inputDirectory.listFiles())) {
try {
if (!file.getName().contains(".")) {
continue;
}
if (supportedExtensions.contains(file.getName().toLowerCase().substring(file.getName().lastIndexOf('.')))) {
pictureFiles.add(file);
}
} catch (Exception e) {
System.err.println("File " + file.getName() + " ignored!");
}
}
if (pictureFiles.isEmpty()) {
Controller.showAlert(Alert.AlertType.ERROR, "Error", "No files in this directory!", "Please try a different directory.");
return false;
}
Collections.shuffle(pictureFiles);
this.pictureIterator = pictureFiles.listIterator();
return true;
}
Image getImage(Direction direction, double width, double height) {
if (currentFile == null) {
currentFile = pictureIterator.next();
} else {
final File newFile;
if (direction == Direction.NEXT && pictureIterator.hasNext()) {
newFile = pictureIterator.next();
} else if (direction == Direction.PREVIOUS && pictureIterator.hasPrevious()) {
newFile = pictureIterator.previous();
} else {
System.err.println("No more pictures in that direction!");
return null;
}
if (Objects.equals(currentFile, newFile)) {
return getImage(direction, width, height);
}
currentFile = newFile;
}
Image result = null;
try {
String path = currentFile.toURI().toURL().toExternalForm();
result = new Image(path, width, height, true, false, true);
} catch (MalformedURLException e) {
System.err.println("Error on: " + currentFile.getName());
}
return result;
}
}
```
Controller.java
```package cz.zvir.rpv;
import javafx.fxml.FXML;
import javafx.scene.CacheHint;
import javafx.scene.control.Alert;
import javafx.scene.control.Button;
import javafx.scene.control.ToggleButton;
import javafx.scene.image.Image;
import javafx.scene.image.ImageView;
import javafx.scene.layout.Pane;
import javafx.scene.text.Text;
import javafx.stage.DirectoryChooser;
import javafx.stage.Window;
import java.io.File;
import java.nio.file.Paths;
import java.util.prefs.Preferences;
public class Controller {
private boolean nameShown = false;
private boolean alwaysShown = false;
@FXML // fx:id="imageView"
private ImageView imageView; // Value injected by FXMLLoader
@FXML // fx:id="buttonAlwaysShow"
private ToggleButton buttonAlwaysShow; // Value injected by FXMLLoader
@FXML // fx:id="buttonShowName"
private Button buttonShowName; // Value injected by FXMLLoader
@FXML // fx:id="textFileName"
private Text textFileName; // Value injected by FXMLLoader
@FXML // fx:id="buttonPrevious"
private Button buttonPrevious; // Value injected by FXMLLoader
@FXML // fx:id="buttonNext"
private Button buttonNext; // Value injected by FXMLLoader
@FXML
private Pane paneWithImageView;
private Preferences userPreferences;
@FXML
void handleAlwaysShow() {
if (!alwaysShown) {
textFileName.setVisible(true);
alwaysShown = true;
nameShown = true;
buttonShowName.setDisable(true);
} else {
textFileName.setVisible(false);
alwaysShown = false;
nameShown = false;
buttonShowName.setDisable(false);
}
}
@FXML
void handlePrevious() {
final Image img = DataProvider.getInstance().getImage(Direction.PREVIOUS, paneWithImageView.getWidth(), paneWithImageView.getHeight());
setImageAndText(img, Direction.PREVIOUS);
}
@FXML
void handleNext() {
final Image img = DataProvider.getInstance().getImage(Direction.NEXT, paneWithImageView.getWidth(), paneWithImageView.getHeight());
setImageAndText(img, Direction.NEXT);
}
private void setImageAndText(Image img, Direction direction) {
if (img != null) {
imageView.setImage(img);
buttonNext.setDisable(false);
buttonPrevious.setDisable(false);
} else {
showAlert(Alert.AlertType.WARNING, "Warning!", "No more files available!", "Try a different directory!");
switch (direction) {
case NEXT:
buttonNext.setDisable(true);
break;
case PREVIOUS:
buttonPrevious.setDisable(true);
break;
}
}
String name = DataProvider.getInstance().getCurrentFile().getName();
name = name.substring(0, name.lastIndexOf('.'));
textFileName.setText(name);
if (!alwaysShown) {
hideText();
}
}
static void showAlert(Alert.AlertType alertType, String title, String headerText, String contentText) {
Alert alert = new Alert(alertType);
alert.setTitle(title);
alert.setHeaderText(headerText);
alert.setContentText(contentText);
alert.setResizable(true);
alert.showAndWait();
}
@FXML
void handleOpenFolder() {
final Window parentWindow = paneWithImageView.getScene().getWindow();
final DirectoryChooser directoryChooser = new DirectoryChooser();
final File selectedDirectory = directoryChooser.showDialog(parentWindow);
if (DataProvider.getInstance().openFolder(selectedDirectory)) {
handleNext();
userPreferences.put("LAST_LOCATION", selectedDirectory.getAbsolutePath());
}
}
@FXML
void handleShowName() {
if (!nameShown) {
textFileName.setVisible(true);
nameShown = true;
} else {
hideText();
}
}
private void hideText() {
textFileName.setVisible(false);
nameShown = false;
}
@FXML
void handleOpenLastOpened() {
final String targetDirectory = userPreferences.get("LAST_LOCATION", "error");
if (targetDirectory.equals("error")) {
showAlert(Alert.AlertType.ERROR, "Error", "Last used location not found", "Ooops, there was an error somewhere!");
} else {
File selectedDirectory = Paths.get(targetDirectory).toFile();
DataProvider.getInstance().openFolder(selectedDirectory);
handleNext();
}
}
@FXML
void initialize() {
textFileName.setVisible(false);
imageView.setCache(true);
imageView.setCacheHint(CacheHint.SPEED);
imageView.fitWidthProperty().bind(paneWithImageView.widthProperty());
imageView.fitHeightProperty().bind(paneWithImageView.heightProperty());
userPreferences = Preferences.userNodeForPackage(this.getClass());
}
void setFocusOnNextButton() {
buttonNext.requestFocus();
}
}```
|
zvory/timezonebot
|
zvory/timezonebot
README.md
```## timezonebot
This is a discord bot that eases global co-ordination: give it a time and place, and it will translate that time to a variety of timezones.
### Running the bot
You'll need:
- A google maps [timezone/geocoding api key](https://developers.google.com/maps/documentation/timezone/intro).
- A discord [bot token](https://discordapp.com/developers/docs/intro).
- Node.js in some late version that supports async functions (I developed on v8.6.0). Node.js LTS is insufficient.
Clone this repository.
```bash
npm install
DISCORD_BOT_TOKEN=YOUR_DISCORD_BOT_TOKEN_HERE GOOGLE_MAPS_API_KEY=YOUR_GOOGLE_MAPS_API_KEY node bot.js
```
`npm install` might give a bunch of warnings, that's caused by `discord.js` you can probably ignore those.
Let me know if something doesn't work by making an issue or emailing me. I promise I will help you.
```
bot.js
```"use strict"
const Discord = require('discord.js');
const client = new Discord.Client();
const moment = require('moment-timezone');
const outputTimezones = [
'UTC',
'Europe/London',
'America/New_York',
'America/Chicago',
'America/Denver',
'America/Los_Angeles',
'Asia/Tokyo',
'Asia/Hong_Kong',
'Asia/Kolkata',
'Europe/Moscow',
'Europe/Berlin',];
// idk the tutorial said node wants this in here to make errors go away
process.on('unhandledRejection', (err) => {
console.error(err)
process.exit(1)
})
client.on('ready', () => {
console.log('Bot is ready!');
});
//turns the user inputted adress into a timezone location ("california" -> "America/Los_Angeles")
//this function will throw an error if the geocode lookup fails, or if the timezone lookup fails
async function locationToTimeZone (address) {
let geocodeResponse;
try{
geocodeResponse = await googleMapsClient.geocode({address}).asPromise();
} catch (e) {
console.error(e);
throw e;
}
if (geocodeResponse.json.results.length === 0 || geocodeResponse.json.status === "ZERO_RESULTS") {
throw `google maps couldn't geocode adress: ${address}`;
}
// pull out latitude and longitude object from response
const [ {geometry : {location}}] = geocodeResponse.json.results;
const milisecondsInOneSecond = 1e4;
// google expects timestamps in seconds, not milliseconds
const timestamp = Date.now() / milisecondsInOneSecond;
const queryObject = {location, timestamp};
let timezoneLookupResult;
try{
timezoneLookupResult = await googleMapsClient.timezone(queryObject).asPromise();
} catch (e) {
console.error(e);
throw (e);
}
return timezoneLookupResult.json;
}
// string -> string
// takes a time, and outputs what format the time is in
// throws an error if it's malformed
function getTimeFormat (timeFormats, timeString) {
// now we try a whole bunch of different formats, and take the ones that are valid
// note the order of the array entries matters, the meridian ("A") ones must come first
const validFormats = timeFormats.filter(format => moment(timeString, format).isValid());
if (validFormats.length == 0)
throw "No valid timeformat found";
else
return validFormats[0];
}
// takes in a string of the form "{time},{location}"
// returns a moment object
// accepts a bunch of formats, including any string that contains /now/i
async function timeAndLocationToMoment (timeString, locationString) {
if (timeString.toLowerCase().includes("now")) {
// whatever, i should remove the location->timezone id into a function
// but i want to get this done
let timeZoneId;
try {
// weird syntax is to allow object destructuring
({timeZoneId} = await locationToTimeZone(locationString));
} catch (e) {
throw `Sorry, I didn't understand your location: ${locationString}, Try things like "california", "Paris", or "San Jose, Costa Rica"`;
}
return moment.tz(Date.now(), timeZoneId);
} else {
const timeFormats = [ `h:mm A`, `h:mmA`, `h A`, `hA`,`H:mm`, `Hmm`, `H`];
let timeStringFormat;
try{
timeStringFormat = getTimeFormat(timeFormats, timeString);
} catch (e) {
const examples = timeFormats.map(format => moment().format(format)).join(", ");
throw `Sorry, I don't understand your time format. Usage: "?tz your_time_here, your_location here". Accepted timeformats are: ${examples}, and "now"`;
}
let timeZoneId;
try {
// weird syntax is to allow object destructuring
({timeZoneId} = await locationToTimeZone(locationString));
} catch (e) {
throw `Sorry, I didn't understand your location: ${locationString}, Try things like "california", "Paris", or "San Jose, Costa Rica"`;
}
return moment.tz(timeString, timeStringFormat, timeZoneId);
}
}
client.on('message', async message => {
const messageString = message.toString();
const commandString = "?tz";
if (messageString.startsWith(commandString)) {
// after command string, but before first comma
const inputTime = messageString.substring(commandString.length, messageString.indexOf(","));
// user's location is after first comma
const inputLocation = messageString.substring(messageString.indexOf(",") + 1);
let userMoment;
try {
userMoment = await timeAndLocationToMoment(inputTime, inputLocation);
} catch (e) {
console.error(e);
message.reply(e);
return;
}
const outputFormat = 'h:mm a z';
const userTimeString = userMoment.format("h:mm a z");
const convertedTimesArray = outputTimezones.map(tz =>
userMoment.clone().tz(tz).format(outputFormat));
const convertedTimesString = convertedTimesArray.join(", ");
const replyString =
`${userTimeString} in ${userMoment.tz()} is: ${convertedTimesString}`;
console.log(`Converted ${messageString}`);
message.reply(replyString);
}
});
client.on("ready", () => {
console.log("Discord client ready");
client.user.setGame(`?tz 8:32pm, london`);
});
// pull API keys from environment variables
const {DISCORD_BOT_TOKEN: discordBotToken, GOOGLE_MAPS_API_KEY: googleMapsAPIKey} = process.env;
client.login(discordBotToken);
var googleMapsClient = require('@google/maps').createClient({
key: googleMapsAPIKey,
Promise: Promise
});
// test the google maps API
googleMapsClient.geocode({
address: '1600 Amphitheatre Parkway, Mountain View, CA'
}, function(err, response) {
if (err) console.error("Google Maps API lookup failed", err);
exit(1);
});
```
|
zwade/wowza
|
zwade/wowza
autovac.ts
```import * as bl from "beautiful-log";
import { Server } from "socket.io";
import { transaction } from "./db"
import { SocketState, SocketWithState } from "./types";
import { dockerComposeCWD, sleep, spawn } from "./utils";
const log = bl.make("autovac");
export const runAutovacWorker = async (io: Server) => {
const runOnce = () =>
transaction(async (client) => {
const toKill = await client.query<{ uid: string, socket_id: string }>(`
SELECT uid, socket_id
FROM job
WHERE completed_at IS NULL
AND expires_at IS NOT NULL
AND expires_at < NOW()
LIMIT 1
FOR UPDATE SKIP LOCKED;
`);
if (toKill.rowCount === 0) {
await sleep(1000);
return;
}
const uid = toKill.rows[0].uid;
const socket = io.sockets.sockets.get(toKill.rows[0].socket_id) as SocketWithState;
await kill(uid, socket);
await client.query(`
UPDATE job
SET completed_at = NOW()
WHERE uid = $1
`, [uid]);
});
while (true) {
await runOnce();
}
}
const kill = async (jobUid: string, socket: SocketWithState) => {
try {
log(`[job ${jobUid}] Killing the instance.`);
await spawn(
"docker-compose",
["-p", `wowza_instance_${jobUid}`, "down", "-t", "0"],
{
cwd: dockerComposeCWD,
stdio: ["ignore", process.stdout, process.stderr],
env: {},
}
);
socket.state = { kind: SocketState.Kind.Waiting };
socket.emit("done");
} catch (err) {
// Guess it was already dead /shrug
}
}```
README.md
```# Wowza!
Wowza was a difficult web problem from PlaidCTF 2021. Players were tasked with using a search engine's site-management console to attack the search engine itself. The intended solution required exploiting a race condition in SQLite and a consistency bug in immutable.js. Unfortunately, a discrepency between `node-fetch` and the browser's built in `fetch` meant that the latter bug was not needed.
## Setup
First, build the docker containers for the problem
```bash
cd problem
yarn docker:all
```
Then, the easiest way to get started is to just run
```
docker-compose up -d
```
And navigate to `http://localhost:16284` and `http://localhost:16285`
Alternatively, the problem comes with a harness for running one instance per user. To set it up with the harness, run
```bash
cd ../harness
docker-compose build
docker-compose up -d
```
And navigate to `http://localhost:1064`
```
utils.ts
```import { spawn as cpSpawn } from "child_process";
import * as path from "path";
import { PoolClient } from "pg";
export const dockerComposeCWD = path.join(__dirname, "../../../problem");
export function spawn(command: string, args: string[], options: Parameters<typeof cpSpawn>[2]): Promise<void> {
return new Promise((resolve, reject) => {
const fixedOptions = {
...options,
env: {
...process.env,
...(options.env ?? {}),
},
}
const proc = cpSpawn("/usr/bin/env", [command, ...args], fixedOptions);
proc.stderr?.on("data", (d) => process.stderr.write(d))
proc.on("exit", (code) => {
if (code === 0) {
resolve();
} else {
reject(`spawn exited with non-zero exit code: ${code}`);
}
});
});
}
export function sleep(time: number) {
return new Promise((resolve) => setTimeout(resolve, time));
}
export async function countRunningJobs(client: PoolClient) {
const result = await client.query<{ count: number }>(`
SELECT count(*) as count FROM job
WHERE completed_at is NULL
AND expires_at is NOT NULL;
`);
const [{ count }] = result.rows;
return count;
}
export async function countQueuedJobs(client: PoolClient) {
const result = await client.query<{ count: number }>(`
SELECT count(*) as count FROM job
WHERE completed_at is NULL
AND expires_at is NULL;
`);
const [{ count }] = result.rows;
return count;
}```
init.sql
```CREATE EXTENSION IF NOT EXISTS "uuid-ossp";
CREATE TABLE challenge (
uid uuid PRIMARY KEY DEFAULT uuid_generate_v4(),
prefix text NOT NULL,
difficulty int NOT NULL,
deadline timestamp NOT NULL
);
CREATE TABLE job (
uid uuid PRIMARY KEY DEFAULT uuid_generate_v4(),
job json NOT NULL,
socket_id text NOT NULL,
created_at timestamp NOT NULL DEFAULT NOW(),
expires_at timestamp,
completed_at timestamp
);
CREATE TABLE port (
job_uid uuid REFERENCES job (uid),
port int UNIQUE NOT NULL,
PRIMARY KEY (job_uid, port)
);```
workers.ts
```import * as bl from "beautiful-log";
import { Server } from "socket.io";
import { randomBytes } from "crypto";
import { transaction } from "./db";
import { JobRequest, JobResponse, SocketState, SocketWithState } from "./types";
import { spawn, sleep, dockerComposeCWD, countRunningJobs } from "./utils";
const LAUNCH_DELAY = 2000;
const TIMEOUT = 15 * 60 * 1000;
const MAX_INSTANCES = 32;
const TARGET_HOST = process.env.TARGET_HOST ?? "http://localhost";
const log = bl.make("workers");
export function startWorkers(count: number, io: Server) {
for (let i = 0; i < count; i++) {
worker(i, io);
}
}
async function worker(index: number, io: Server) {
while (true) {
try {
let jobCompleted = await transaction(async (client) => {
const runningJobs = await countRunningJobs(client);
if (runningJobs >= MAX_INSTANCES) {
return false;
}
let jobResult = await client.query<{ uid: string, job: JobRequest, socket_id: string }>(`
SELECT uid, job, socket_id
FROM job
WHERE completed_at IS NULL
AND expires_at IS NULL
ORDER BY created_at
LIMIT 1
FOR UPDATE SKIP LOCKED
`);
if (jobResult.rowCount !== 1) {
return false;
}
let { uid, job, socket_id: socketId } = jobResult.rows[0];
const portResult = await client.query<{ port: number }>(`
SELECT port
FROM port
WHERE job_uid = $1
`, [uid]);
if (portResult.rowCount !== 1) {
log.error(`Port was not allocated for: ${uid}`);
return false;
}
const { port } = portResult.rows[0];
const socket = io.sockets.sockets.get(socketId) as SocketWithState;
if (!socket) {
log(`[worker ${index}] Skipping job because socket is no longer connected.`);
await client.query(`
UPDATE job
SET expires_at = NOW()
WHERE uid = $1
`, [uid]);
return true;
}
await client.query("UPDATE job SET expires_at = NOW() + interval '15 minutes' WHERE uid = $1", [uid]);
socket.once("disconnect", () =>
transaction((innerClient) =>
innerClient.query(`
UPDATE job
SET expires_at = NOW()
WHERE uid = $1
`, [uid])
)
);
try {
await doJob(uid, port, job, socket);
} catch (e) {
log.error(e);
await client.query(`
UPDATE job
SET expires_at = NOW()
WHERE uid = $1
`, [uid]);
}
return true;
});
if (!jobCompleted) {
await sleep(1000);
} else {
log(`[worker ${index}] Job started! Looking for a new job.`);
}
} catch (err) {
log.error(err);
}
}
}
async function doJob(jobUid: string, port: number, job: JobRequest, socket: SocketWithState) {
log(`[job ${jobUid}] Launching instance on port <cyan>${port}</cyan>.`);
const searchConsolePort = port;
const siteSearchPort = port + 1;
const env = {
SEARCH_CONSOLE_PORT: searchConsolePort.toString(),
SITE_SEARCH_PORT: siteSearchPort.toString(),
FLAG: process.env.FLAG
};
const searchConsoleUrl = new URL(TARGET_HOST);
searchConsoleUrl.port = searchConsolePort.toString();
const siteSearchUrl = new URL(TARGET_HOST);
siteSearchUrl.port = siteSearchPort.toString();
const response: JobResponse = {
searchConsoleUrl: searchConsoleUrl.toString(),
siteSearchUrl: siteSearchUrl.toString(),
};
socket.state = {
kind: SocketState.Kind.Accepted,
request: job,
response,
launchingAt: Date.now() + LAUNCH_DELAY
};
socket.emit("accepted", { response: socket.state.response, launchingAt: socket.state.launchingAt });
await sleep(LAUNCH_DELAY);
console.log(dockerComposeCWD)
await spawn(
"docker-compose",
["-p", `wowza_instance_${jobUid}`, "up", "-d", "--no-build"], // You MUST build the containers on the host before starting
{
cwd: dockerComposeCWD,
stdio: ["ignore", process.stdout, process.stderr],
env
}
);
socket.state = {
kind: SocketState.Kind.Processing,
request: job,
response,
until: Date.now() + TIMEOUT
};
socket.emit("processing", { response: socket.state.response, until: socket.state.until });
log(`[job ${jobUid}] Instance is up, waiting for ${TIMEOUT}ms.`);
}
```
|
zwarcola/SABREIII
|
zwarcola/SABREIII
app.py
```import PySimpleGUI as sg
from send_email import send_text, send_email
def show_gui():
sg.theme('BrightColors') # Add a touch of color
# All the stuff inside your window.
layout = [ [sg.Text('Please enter your credentials.',font=("Helvetica", 25))],
[sg.Text('TCNJ Username:', size=(16, 1)), sg.InputText()],
[sg.Text('Password', size=(16, 1)), sg.InputText('', password_char='*')],
[sg.Text('Course Subject:', size=(16, 1)), sg.Combo(['ACC', 'AAS', 'ASL', 'ANT', 'ARA', 'AAE', 'AAH', 'AAV', 'BIO', 'BME', 'BUS', 'CCS', 'CHE', 'CHI', 'CIV', 'CLS', 'COM', 'CMP', 'CSC', 'COUN', 'CWR', 'CRI', 'CURR', 'DFHH', 'DHH', 'ECE', 'ECED', 'ECO', 'EDAD', 'SED', 'EDUC', 'EDFN', 'EFN', 'EDIN', 'EPSY', 'SUPV', 'ELC', 'ELE', 'ELEM', 'ENG', 'ENGL', 'EED', 'LNG', 'ESLM', 'ESE', 'ENV', 'FIN', 'FRE', 'FSP', 'GER', 'GRE', 'HES', 'HIS', 'HED', 'HGS', 'HON', 'HSS', 'ISTG', 'IST', 'SCI', 'IMM', 'IDS', 'INB', 'INTL', 'INT', 'ITL', 'JPN', 'JPW', 'LAC', 'LAT', 'LIT', 'MGTG', 'MGT', 'MKT', 'MST', 'MAT', 'MATH', 'MTT', 'MEC', 'MSCI', 'MUS', 'NUR', 'NURS', 'PBHR', 'PBHG', 'PHL', 'PHY', 'POL', 'VCPD', 'PSY', 'PBH', 'RDLG', 'RAL', 'REGS', 'REL', 'RUS', 'SAFT', 'AMM', 'SCED', 'SOM', 'SOC', 'SPA', 'SPE','SPED','SLP', 'STA', 'TST', 'TED', 'ETE', 'VPA', 'WGS', 'WGST', 'WLC', 'WRI', 'STEM'])],
[sg.Text('Course Number:', size=(16, 1)), sg.InputText()],
[sg.Text('Semester Year:', size=(16, 1)), sg.InputText()],
[sg.Text('Semester Season:', size=(16, 1)), sg.Combo(['Fall', 'Winter', 'Spring', 'Summer'])],
[sg.Text('Phone Provider:', size=(16, 1)), sg.Combo(['AT&T', 'Verizon', 'Sprint', 'T-Mobile'])],
[sg.Text('Phone Number:', size=(16, 1)), sg.InputText()],
[sg.Text('Receiving Email:', size=(16, 1)), sg.InputText()],
[sg.Text('Notifications:', size=(16, 1)), sg.Combo(['Both', 'Email', 'Text'])],
[sg.Button('Submit'), sg.Button('Cancel')] ]
# Create the Window
window = sg.Window('SABRE III', layout, font='Helvetica 16', resizable=True)
# Event Loop to process "events" and get the "values" of the inputs
while True:
event, values = window.read()
if event in (None, 'Cancel'): # if user closes window or clicks cancel
break
credentials = {
"username": values[0],
"password": values[1],
"subject": values[2],
"class_num": values[3],
"year": values[4],
"semester": values[5],
"carrier": values[6],
"phone_num": values[7],
"email": values[8],
"notif":values[9]
}
# window.Hide()
# layout2 = [[sg.Text('SABRE III Now Running...', font=("Helvetica", 25))], # note must create a layout from scratch every time. No reuse
# [sg.Button('Exit')]]
#
# runningWindow = sg.Window('SABRE III - Running', layout2)
# while True:
# ev2, vals2 = runningWindow.Read()
# if ev2 is None or ev2 == 'Exit':
# runningWindow.Close()
# runningWindow_active = False
return credentials
window.close()
```
README.md
```# SABRE III Peoplesoft App
Super Automated Browser Requesting Enrollment or SABRE III is an application designed to give students notifications based on if a class they with to enroll in has opened up. It is common for students to miss getting in to a class during enrollment, when they do, SABRE III is here to automatically monitor the status of the availible seats in the class. If a seat is found to be availible, the user is notified via text, email, or both about the opening. An example of the program with the user info inserted is displayed below.
<div align="center">
<img src="Screenshots/SABRE_III_GUI.jpg" width="1982px"></img>
</div>
## Using on Mac
Prerequisites: brew and python3
Follow this link: https://docs.python-guide.org/starting/install3/osx/ to install brew and python3. Once they are both installed. Verify that python3 is installed by running "$ python3 --version". The command should return your python version. Next run mac_install.sh by doing "$ ./mac_install.sh requirements.txt". To run the class checker, do "$ python3 class_checker.py".
## Using on Windows
Download the source code from https://github.com/zwarcola/SABREIII, be sure to have the latest version of Python3. Once installed, run the program by executing the file "class_checker.py" by running the following command.
```
python class_checker.py
```
When opened, you will be prompted to enter your PAWS information as well as the course number. Note that this course number is the 5-digit code associated with the class name and section **NOT** the 3-digit code associated with the course type. A screenshot of where to find this code is shown below. Enter the information and click *Submit* in order to begin the program. From here, the program will check every 30 minutes if a course is availible. It is recommended to run the program on a device than can be running 24/7 so the application can always be searching.
<div align="center">
<img src="Screenshots/Course_Number_Locations.jpg" width="3191px"></img>
</div>
## Built With
* Python3 - Source Code and GUI
* Selenium
* PySimpleGUI
## Contributors
* **Jake Bezold** - *Mastermind*
* **Casey Futterman** - *Graphical User Interface*
* **Adam Varone** - *User Notification System*
* **Zachary Warcola** - *Backend Web Navigation*
```
lib.py
```import time
from selenium import webdriver
from selenium.webdriver.common.by import By
from selenium.webdriver.common.keys import Keys
from selenium.webdriver.support.ui import WebDriverWait
from selenium.webdriver.support.expected_conditions import presence_of_element_located
from selenium.webdriver.chrome.options import Options
LOGIN_REDIRECT_URL = 'https://paws.tcnj.edu/psp/paws/?cmd=login&languageCd=ENG&'
URL = 'https://paws.tcnj.edu'
def login(credentials):
#begin login process
user = credentials['username']
pwd = credentials['password']
#hide chrome browser
chrome_options = Options()
chrome_options.add_argument("--disable-extensions")
chrome_options.add_argument("--disable-gpu")
chrome_options.add_argument("--headless")
driver = webdriver.Chrome(options=chrome_options)
driver.get(URL)
#await redirect from chrome driver
while True:
time.sleep(2)
if LOGIN_REDIRECT_URL == driver.current_url:
print("Opening...")
break;
try:
print('Attempting Login...')
#get username field
loginForm = driver.find_element_by_xpath('//*[@id="userid"]')
loginForm.send_keys(user)
#get password field
passwordForm = driver.find_element_by_xpath('//*[@id="pwd"]')
passwordForm.click()
passwordForm.send_keys(pwd)
#get submit button
submit = driver.find_element_by_xpath('//*[@name="submit"]')
submit.click()
print("Logging in...")
except:
print("ERROR GETTING LOGIN FORM / LOGGING IN!!!")
return -1
html_source = driver.page_source
print('Login sucess!')
time.sleep(2)
return driver
def searchCourse(credentials, driver):
try:
print("Searching for course...")
#Navigate to Student Center
link = driver.find_element_by_link_text('Student Center')
link.click()
time.sleep(0.2)
#Open search menu
driver.switch_to.frame(driver.find_element_by_name('TargetContent'))
search = driver.find_element_by_link_text('Search') #DERIVED_SSS_SCL_SSS_GO_4$83$
search.click()
time.sleep(3)
#Uncheck "Show Open Classes Only"
closed = driver.find_element_by_name("SSR_CLSRCH_WRK_SSR_OPEN_ONLY$3")
closed.click()
time.sleep(0.2)
#select term and year
termSelect = driver.find_element_by_xpath('//*[@id="CLASS_SRCH_WRK2_STRM$35$"]')
termSelect.click()
time.sleep(0.2)
Found = False
for option in termSelect.find_elements_by_tag_name('option'):
if option.get_attribute('innerHTML') == (credentials['year'] + ' ' + credentials['semester']):
time.sleep(0.1)
Found = True
option.click()
break
if not Found:
print('ERROR FINDING YEAR AND SEMESTER')
time.sleep(0.2)
#Select the proper course subject
courseSelect = driver.find_element_by_xpath("//select[@id='SSR_CLSRCH_WRK_SUBJECT_SRCH$0']")
courseSelect.click()
time.sleep(0.2)
Found = False
for option in courseSelect.find_elements_by_tag_name('option'):
if option.get_attribute('value') == credentials['subject']:
time.sleep(0.1)
Found = True
option.click()
break
if not Found:
print('ERROR FINDING CLASS SUBJECT')
time.sleep(0.2)
#Enter course number
courseNum = driver.find_element_by_name('SSR_CLSRCH_WRK_CLASS_NBR$7')
courseNum.send_keys(credentials['class_num'])
courseNum.send_keys(Keys.RETURN)
time.sleep(2)
#open the class info
classLink = driver.find_element_by_link_text(credentials['class_num'])
classLink.click()
time.sleep(2)
print("Getting total seats...")
#get amount of availible seats
availibleSeats = driver.find_element_by_xpath('//*[@id="win0divSSR_CLS_DTL_WRK_AVAILABLE_SEATS"]')
availibleSeats = availibleSeats.find_element_by_class_name('PSEDITBOX_DISPONLY').get_attribute('innerHTML')
#get class title
classTitle = driver.find_element_by_xpath('//*[@id="DERIVED_CLSRCH_DESCR200"]')
classTitle = driver.find_element_by_class_name('PALEVEL0SECONDARY').get_attribute('innerHTML')
classTitle = classTitle.replace(" ", "")
except:
print("ERROR WHILE FINDING COURSE")
return -1
print("Done!")
#return total number
return [availibleSeats, classTitle]
```
class_checker.py
```from lib import login, searchCourse
from app import show_gui
from send_email import send_text, send_email
import time
from email.mime.text import MIMEText
from email.mime.multipart import MIMEMultipart
if __name__ == '__main__':
#get credentials from GUI
credentials = show_gui()
while(True):
#send crendentials over to bot and run
driver = login(credentials)
info = searchCourse(credentials, driver)
availibleSeats = str(info[0])
classTitle = info[1]
#print("Availible seats: " + str(availibleSeats))
time.sleep(1)
driver.close()
if (int(availibleSeats) > 0):
message = MIMEMultipart("alternative")
message["Subject"] = "Your class " + classTitle + " is open!"
text = """There are """ + availibleSeats + """ seat(s) available! Hurry and register before somebody takes your spot. \n\nThank you for using SABRE III!"""
message.attach(MIMEText(text, "plain"))
if (credentials["carrier"] == "AT&T"):
receiver = credentials["phone_num"] + "@txt.att.net"
elif (credentials["carrier"] == "Verizon"):
receiver = credentials["phone_num"] + "@vzwpix.com"
elif (credentials["carrier"] == "Sprint"):
receiver = credentials["phone_num"] + "@messaging.sprintpcs.com"
elif (credentials["carrier"] == "T-Mobile"):
receiver = credentials["phone_num"] + "@tmomail.net"
print(receiver)
if credentials["notif"] == "Email":
send_email(credentials["email"], message)
elif credentials["notif"] == "Text":
send_text(receiver, message)
else:
send_email(credentials["email"], message)
send_text(receiver, message)
#if we find the class is open, end the program??
exit()
else:
print("No class found, waiting a little while...")
time.sleep(1800) #if the class isnt found sleep for a period of time and check again
```
send_email.py
```import smtplib, ssl
port = 465 # For SSL
# Create a secure SSL context
context = ssl.create_default_context()
def send_email(receiver, msg):
with smtplib.SMTP_SSL("smtp.gmail.com", port, context=context) as server:
server.login("SABREIIIHackTCNJ2020@gmail.com", "Hacktcnj2020")
server.sendmail(
"SABREIIIHackTCNJ2020@gmail.com", receiver, msg.as_string()
)
def send_text(receiver, msg):
with smtplib.SMTP_SSL("smtp.gmail.com", port, context=context) as server:
server.login("SABREIIIHackTCNJ2020@gmail.com", "Hacktcnj2020")
server.sendmail(
"SABREIIIHackTCNJ2020@gmail.com", receiver, msg.as_string()
)
```
|
zwcoding/react_dva_umi
|
zwcoding/react_dva_umi
README.md
```# react_dva_umi
学习
```
|
zwilder/WSL_Blog
|
zwilder/WSL_Blog
2016-11-12-partying-with-jekyll.md
```---
title: "Partying With Jekyll"
date: 2016-11-12 18:15:06 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- Jekyll
- Web Programming
---
I've been wanting to fix this blog for a while now, and I decided in the process that I am **awful** at web design/programming. Haha, well, the first step to being kinda good at something is kinda sucking at something, right?
In my scouring of the internet I discovered that a lot of static blog sites used [Jekyll][jekyll] to generate their site. At first, I figured it was nothing more than another insta-blog program where you just dump
some content into a folder and it spits out a blog - but holy cow it is so much more than (and can be exactly) that. I've only scratched the surface of what it is capable of, since I don't have many skills in the web developement
category (yet).
I originally attempted to create my own [Jekyll][jekyll] theme - and successfully recreated my original blog format. Unfortunately, I remembered (after spending a good deal of time working on it) that I didn't really like the look/feel of my original blog - and trashed it. The next attempt was to find and use another, premade, theme. I wasn't really a fan of that route from the start, but I tried a few different ones - and tweaked them to my liking. The blog still didn't look/feel quite right, and didn't really seem to work well with posts that are largely text/code.
The last theme I tried was based on [hack.css][hackcss]. It was kinda neat looking, but still felt a little cluttered to me. After discovering what [hack.css][hackcss] originally was, I decided that it wouldn't be too difficult
to create my own "theme" based off the framework hack.css provided. The result is what you have in front of you.
Yeah, a few things still need tweaking - I'm not super happy with the way code blocks look for large sections of code... IE this looks fine:
{{< highlight cpp >}}
#include <iostream>
int main(int argc, char * argv[])
{
std::cout << "Hello Jekyll!\n";
return 0;
}
{{< / highlight >}}
However, looking at my previous [post]({{ site.baseurl }}/2016/07/15/fun-with-dijkstra-mapping.html)... the large chunks of code posted there look atrocious. Ah well, it's fun to tweak things and beat them into
looking like a real website.
[jekyll]: http://jekyllrb.com
[hackcss]: http://www.hackcss.com
```
2020-06-07-TestingFancybox.md
```---
draft: true
Title: "Testing Fancybox"
Author: "Zach Wilder"
Date: 2020-06-07 07:00:00 -0700
assets: "2020-06-06-RevivingTheBlog"
---
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis
nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu
fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in
culpa qui officia deserunt mollit anim id est laborum.
{{<ltbox-gallery3
src1="CapeArago_w.jpg"
src3="TrailerSketching_w.jpg"
>}}
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis
nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu
fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in
culpa qui officia deserunt mollit anim id est laborum.
{{<ltbox src="HarborLights_w.jpg">}}
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis
nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu
fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in
culpa qui officia deserunt mollit anim id est laborum.
{{<fancybox_img src="HarborLights_w.jpg">}}
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis
nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu
fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in
culpa qui officia deserunt mollit anim id est laborum.
{{<fancybox_gallery
id=1
src1="CapeArago_w.jpg"
src3="TrailerSketching_w.jpg"
>}}
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis
nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.
Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu
fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in
culpa qui officia deserunt mollit anim id est laborum.
{{<fancybox_gallery
id=2
src1="EelLake_w.jpg"
src2="IndianPipe_w.jpg"
src3="Mushrooms_w.jpg"
>}}
```
2018-06-20-The-Roguelike-Tutorial-Week1.md
```---
title: "The Roguelike Tutorial - Week 1"
date: 2018-06-20 07:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
---
Last year r/roguelikedev did a really cool thing with a weekly post where everyone followed along with a tutorial, shared ideas and problems, and motivated each other
to actually finish a project. Well [they're doing it again](https://old.reddit.com/r/roguelikedev/comments/8s5x5n/roguelikedev_does_the_complete_roguelike_tutorial/)
this year, and with the announcement last week I decided to take a look at the new and improved, [Python3 version of the tutorial](rogueliketutorials.com/libtcod1).
For those not familiar with this famous tutorial - each part covers a small chunk of building a roguelike using simple language and easy to follow code. In just 13
parts you have a working roguelike to build off of and branch out from. A really, really cool idea. I did the old Python2 version a couple years back, and it blew
my mind. After completing the last part I finally had made a game, and was pretty proud of the results. I didn't know Python when I started, and hadn't done any
coding before beginning, but was able to follow along and even add my own stuff along the way. Eventually, my lack of knowledge caught up with me and my bloated
single file Python program started to become difficult to modify and maintain. I took a step back, and decided to start relearning C and then ventured into C++.
I quickly found that I actually really enjoy more of the building of the game than the designing of the game. Which, is cool because the amount of things to build
and the resources available for building things from scratch are darn near infinite - especially with the knowledge of the internet at my fingertips. It is not, however,
conducive to finishing a project or making something playable.
As I read through the new and improved tutorial, I realized something pretty amazing: I could build this in C++. Reading each part I could think of ways (plural!)
that I could accomplish the same thing, but with my own code. So, I decided to play along with the tutorial, and force myself to follow the deadlines - a week for
each part.
I decided to start posting this to the blog **after** I had finished Parts 0 - 3, which covers weeks one and two - so I've written a brief summary
of what I've done in parts 1 and 2 of the tutorial so far.
## Part 1
So I started this project using SFML - which is a fantastic and easy to use library, with tons of features. The goal of Part 0 was to get a console screen up,
and an '@' moving around. I thought about the idea of using SFML sprites directly on a simulated grid - but decided that although this was the easiest way
to accomplish the '@' moving around, it would be beneficial to try and emulate a console much like libtcod does.
A console (defined in [console.hpp](https://github.com/zwilder/Barbarian/blob/master/include/console.hpp)) is a square grid of defined width and height, where each x,y coordinate pair is the location of a glyph. A glyph is an
integer representing a character and a foreground/background color. Color (for now) is just a simple class (defined in [color.hpp](https://github.com/zwilder/Barbarian/blob/master/include/color.hpp) with an integer representing
the r,g,b and alpha of a color.
Okay, with the console out of the way, it was time to make the 'engine' (defined in [engine.hpp](https://github.com/zwilder/Barbarian/blob/master/include/engine.hpp)). So engine does three things primarily - handle input, update the
game, and draw it to the window ([the game loop](http://gameprogrammingpatterns.com/game-loop.html)).
Handling input is easy... oh wait, the tutorial does some crazy magic with dictionaries. So, basically the idea of the dictionary is that it has a command
and a value associated with that command. Sounds to me like a job for some bit flags, which would allow me to easily test if a command has a flag turned
on and then check a value with it (The Action class - defined in [input_handlers.hpp](https://github.com/zwilder/Barbarian/blob/master/include/input_handlers.hpp)). Now, when checking keyboard input, I can just have a function
return an Action, test the flags, and do whatever with the result. If needed, this allows multiple commands to be returned with one action - which is kinda cool.
Update! Well, update doesn't do anything yet. A good chunk of the game logic will eventually go here.
Draw is where some cool stuff happens. First, I have an array of rectangles, where each rectangle is a position on the font image of a character. What's
neat here is that the array contains 256 elements - the number of glyphs represented by a CP437 font image. This means that if an entity has a symbol represented
by an '@' symbol, I can reference the position on the font image by passing '@' as the index of the array! So the draw routine basically draws everything in the
game to the console, and then reads the console and translates that to the window using the window size and sprite size to position glyphs.
With all that done, there is now an '@' symbol moving around the screen.
## Part 2
The big things in part are creating the Entity class and the GameMap class. The entity class is pretty simple so far - an entity has a glyph and a position. Nice and
easy. The GameMap is where things get fun - so I spent a bit more time on it. The tutorial uses simple booleans to check for tile values, again I decided that this
would be a good fit for bit flags - instead of checking if something blocksMovement and blocksLight and isDoor (or whatever) I could just do something simple like
{{< highlight cpp >}}
int flag = blocksMovement | blocksLight | isDoor;
if(tile->checkFlag(flag))
{
// Do something cool here!
}
...
bool checkFlag(int flag)
{
return ((tileMask_ & flag) == flag);
}
{{< / highlight >}}
GameMap (defined in [game_map.hpp](https://github.com/zwilder/Barbarian/blob/master/include/game_map.hpp)) is a grid of Tiles (defined in [tile.hpp](https://github.com/zwilder/Barbarian/blob/master/include/tile.hpp)). Easy enough. For part 2, the GameMap class generates a nice hard-coded wall for testing
Tiles and player movement.
---
Next week I'll write up a bit about my struggles with the dungeon generator - the algorithm from the tutorial worked great, but of course this is the first
of many opportunities to branch out from the tutorial and do your own thing. I'll also touch on why I ditched SFML for SDL, and some of the fun stuff I wrote
for that.
I've nicknamed this project 'Barbarian!', since the player character in this type of roguelike does very little that is like a rogue and a lot that is like a
loin-cloth wearing, great sword wielding burly barbarian. I even have some fun ideas for flavoring the project with more brute force and shiny muscles!
Here is the source code for [Parts 0-2](https://github.com/zwilder/Barbarian/tree/Part_0-2)
```
2018-07-31-The-Roguelike-Tutorial-Week5b6.md
```---
title: "The Roguelike Tutorial - Week 5b/6"
date: 2018-07-31 13:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-07-30"
---
Oh man, this has been a super exciting and productive week - this
project is starting to feel like a real game! Started off last week a
bit behind schedule, having just finished part 8. After my rant last
week about my source code files getting too long, I decided to spend a
bit of time going back over my core classes and cleaning up the code. I
also split `Engine` into multiple files - which ended up making a lot of
things a lot easier. Heck, recompiling a huge source file each time I
make a minor change was tedious, and the time savings alone was worth
splitting the files. Each of the Engine main functions now has it’s own
file, and then each of those main functions calls separate routines
depending on what `GameState` the game is in. Each of those separate,
state specific functions has its own file. Code that’s reused between
routines lives in the main function file.
I think it’s pretty cool - makes finding and changing things easier. I
also noticed that this project is now more than twice the length (lines
of code) of any project I’ve done so far. This weeks post was originally
intended to cover just part 9, but I threw 10 and 11 in as well since
they were relatively short.
## Part 9 - Targeting
I wasn’t sure when I started this part how I would go about doing it.
Style-wise, I like the way ADOM and Angband handling targeting with the
auto select target and keyboard interface. Using a mouse feels weird to
me when playing roguelikes, so I knew I didn’t want to stick to the
ideas in the Python tutorial. The game engine is already set up to
handle different game states, but targeting isn’t really a state - more
of a miniature loop with it’s own events and draw cycle.
So, I decided to make targeting exactly that - a game state that isn’t
really a state, but a miniature replica of the main game loop. When a
function (any function) calls `Engine::target()` the game saves the
current state, and starts it’s own loop. When the loop finishes, the
game returns the state to where it was, and whatever called the
targeting state can go about doing whatever it was doing. This allows
any function in the game to have the player move and set the cursor to a
desired location, and then the function can do something at that
position. Neat!
{{< highlight cpp >}}
void Engine::target()
{
// This function is called by other functions to have the player move the cursor to a desired location,
// select that location with [enter], and then the other function has access to the cursorPos via Engine::cursor();
targetSelected_ = false;
targeting_ = true;
std::string prevMsg = currentMsg_;
GameState prevState = gameState_;
advanceMsg_();
// Target is a mini-main loop - so this limits it's speed a bit
using namespace std::chrono;
const milliseconds MS_PER_FRAME = std::chrono::milliseconds(16); // 16ms = ~60fps, 33ms = ~30fps
while(targeting_)
{
milliseconds start = duration_cast<milliseconds>(system_clock::now().time_since_epoch());
handleEvents(); // moving the cursor, waiting for [enter] to set targetSelected_ to true
draw(); // Drawing the path from the player to the cursor
std::this_thread::sleep_for(milliseconds(start + MS_PER_FRAME - duration_cast<milliseconds>(system_clock::now().time_since_epoch())));
}
changeState(prevState);
addMessage(prevMsg);
advanceMsg_();
}
{{< / highlight >}}
The code looks a bit different in the actual game - just because I
wanted to reuse the targeting code for a look function. Here’s a short
video of the result!
{{< fancybox_mv src="Part9.mp4" >}}
One of the cool things here is the code to draw the line from the
character to the cursor when in "target" mode. I spent a good deal of
time trying to figure out a way to easily draw a line... and then
realized I already wrote code to do exactly that with the FOV code! It's
always neat to use code you've already written for things you didn't
originally plan for.
## Part 10 - Saving and loading
From the beginning of this project I planned to use
[Cereal](https://github.com/USCiLab/cereal) for serialization of the
game data. This header only library is phenomenally easy to use, and my
previous projects had great success incorporating it. The library only
requires that you provide a template for archiving your classes in each
class that will be archived, basically a set of instructions on what to
save and what to load back.
{{< highlight cpp >}}
template <class Archive>
void serialize(Archive & ar)
{
ar(myData_);
}
{{< / highlight >}}
That’s it! Except... crap. I wrote a ton of custom containers and
classes, so I had to figure out how to tell Cereal how to handle
serializing them! `wsl::Vector2<T>` and `wsl::Rectangle<T>` were easy
enough, but what about my glorious lists? What about all the classes
using them?
Well, I couldn’t figure out a nice way of making cereal happy, so my
solution was a little hacky. I created a couple new transition classes
(basically replacing my list with a STL vector), since cereal can handle
those just fine. Whenever the game calls save game, it makes those
transition classes and saves those instead. Loading is exactly the
reverse, the game loads the transition classes and recreates the
original. Eh, it’s not pretty, but it works and works very well. The
only classes requiring a transition class are my priority queue, double
linked list, and entity class - so thats not too shabby. What’s nice is
that the core classes are already in place - adding more to the game
shouldn’t affect save/load functionality all that much!
## Part 11 - Advancement
Adding stairs was a pretty trivial matter - looking at the core classes,
stairs should be a tile and not an entity. The player does nothing with
the stairs except use them to get to the next level, so there is no
reason to make them an entity. In addition, the stairs will NEVER have
any of the components in the entity class, whoever heard of stairs with
an inventory or health? Doors, when they’re added, will be an entity
because they’ll have an interactable component (same with treasure
chests, traps, levers, etc). Making the player go down the stairs was
likewise easy, and just for fun a quick check was added to see if there
are any monsters near the player when they move down - if there are,
they follow the player. It may be fun to add a random chance the player
is unable to go down the stairs when monsters are nearby.
Leveling up and character advancement is something that will change
dramatically when the percentile combat system is in place. So, for now,
the system is identical to what’s used in the Python tutorial.
---
With all that done, I figured I would play around in REXpaint and try
making a title screen for the game:
{{< fancybox_img src="BarbarianLogo.png" >}}
Super happy with how this turned out - I’m not much of an ASCII artist,
but I think this looks darn good. One of the things high up on my
priority list is to implement an animation system (fireballs need to
explode, arrows need to fly, blood needs to splatter, etc) - how cool
would this logo look if the blood on the right dripped down into the
puddle at the bottom?!
Here is the source code for [Part 9](https://github.com/zwilder/Barbarian/tree/Part_9), [Part 10](https://github.com/zwilder/Barbarian/tree/Part_10), and [Part 11](https://github.com/zwilder/Barbarian/tree/Part_11)!
```
2018-09-18-Explosions.md
```---
title: "Explosions in the Dungeon"
date: 2018-09-18 14:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-09-18"
---
One of the big goals for Barbarian and one of the coolest things on my
to do list was to add animations into the game. How exciting is it to
see an arrow flying toward your character, a firebolt explode in the
face of an undead horde, blood splatter flying from the wounds inflicted
by the mighty barbarian decorating the walls of the dungeon?
Obviously, the excitement added by all these visual effects is well
worth the time spent adding them in. I started thinking about how I
wanted to incorporate animations during the Tutorial Tuesday Challenge,
and started jotting implementation ideas down in my notebook almost two
months ago. For the life of me I could not find a good writeup on
creating procedural explosions on a 2d grid, and could not wrap my head
around how to make them look decent. I shared my struggles on the
[r/roguelikedev sharing Saturday post, and another dev (u/darkgnostic)
gave me some fantastic ideas about reusing my line-of-sight
code](https://www.reddit.com/r/roguelikedev/comments/9e007b/sharing_saturday_223/e5m8y55/).
So, armed with this knowledge I sat down last week and decided to
finally try some of my implementation ideas.
The idea was simple, for each frame expand outward from the origin of
the explosion to a set radius.
## The Framework
In order to test this out, I needed to actually get the animations
working. Like most bits of code that I only have a vague idea of how to
accomplish I started at the top: `Engine::update()` and `Engine::draw()`
should loop through a list of animations, updating and drawing them.
Easy enough to draw them, just need an `Animation::draw()` routine.
Update would be similar, but would need to know how much time had passed
since the last update. To get this, I needed to visit the main loop code
- something that hasn't been looked at in quite a while.
Cracked open `main.cpp`, dusted it off and examined my loop. Previously
the game was limited to 60fps by using a call to sleep the thread -
definitely gross and in need of some work. Where had I seen a beautiful,
simple game loop before? Ah - [Game Programming
Patterns](http://gameprogrammingpatterns.com/game-loop.html)! Probably
my favorite, most well worn book on my shelf of programming books. Easy
enough to modify the example given in that chapter to modern C++ using
the `std::chrono` library.
{{< highlight cpp >}}
using namespace std::chrono;
milliseconds previous = duration_cast<milliseconds>(system_clock::now().time_since_epoch());
milliseconds lag = std::chrono::milliseconds(0);
while(engine->running())
{
milliseconds current = duration_cast<milliseconds>(system_clock::now().time_since_epoch());
milliseconds elapsed = current - previous;
previous = current;
lag += elapsed;
engine->handleEvents();
engine->update(int(elapsed.count()));
engine->draw();
while(lag >= MS_PER_FRAME)
{
// Note that in the Game Programming Patterns example,
// update is placed here, and draw is placed after this
// loop. This forces draw to update less frequently since
// it is technially the most expensive function in terms
// of processing power. Not a problem in a turn based,
// non-graphics intensive game like this.
//
// Instead, this loop just holds the framerate constant at
// 60fps (MS_PER_FRAME = 17)
lag -= MS_PER_FRAME;
}
}
{{< / highlight >}}
Once all that was straightened out I knew that I needed a draw and
update function in the animation class. Also, from my doodles in my
notebook I knew that the way I wanted to approach animations was to make
each animation a collection of frames, and each frame a collection of
tiles consisting of a glyph (character, foreground/background color) and
a position. Also, I wanted to make sure that the animations would not
block input or advancement of the games update loop.
Now, for some reason these collections just would not work with my fancy
list class. I'm not sure why, and spent an insane amount of time trying
to track down what was causing horrible segfaults. I then switched over
to using a `std::vector` and realized it was because I was trying to
access parts of the list out of bounds - I literally forgot an equals
sign in a single `currentFrame > frames.size()` conditional. With
everything working I didn't feel like changing code back to using my
list class - if it isn't broken why fix it?
## Making an Explosion
I started the explosion with the basic idea given to me: expand outwards
from an origin.
{{<highlight txt>}}
// as a circle with r=2
Frame 0 1 2
2
1 212
0 101 21012
1 212
2
// as a square
Frame 0 1 2
22222
111 21112
0 101 21012
111 21112
22222
{{< / highlight>}}
Each frame is simply one expansion outward. Setting the glyph of each
animation tile to a simple red `^` made a pleasing simple looking
explosion and reminded me of the explosions in the old great roguelikes.
[Cogmind](https://www.gridsagegames.com/cogmind/) has the most beautiful
animations and tasty explosions I have seen in just about any game, and
the developer has a [fantastic blog
post](https://www.gridsagegames.com/blog/2014/04/making-particles/)
about the explosions. Playing Cogmind and seeing these explosions in
action inspired most of my desire to get animations working, and my goal
is to try and get something similar in place for Barbarian.
Watching my simple explosion moving outwards I realized that a simple
way to make the explosion procedural was to just add in a random chance
that the cell would get "lit up" by the blast. I decided to set the
chance at 75% initially each time a cell is visited to light it up, and
change just the background color of the cell to randomly
orange/yellow/red. This worked, and looked **awesome**.
{{< fancybox_mv src="Explosions.mp4" >}}
I realized after playing around with making things explode that there
should be a set of frames moving inward towards the origin as well, but
with a smaller chance of lighting up. Playing around with the numbers I
found 65%/25% to look pretty darn good. Shortened the duration by a bit
too to speed things up.
{{< fancybox_mv src="Explosions3.mp4" >}}
I also played with changing the glyph in the explosion tile to a random
character, which ended up looking sorta cool... but I'm not sure I like
it. It definitely made the explosion more chunky, and gave it some
texture.
{{< fancybox_mv src="Explosions2.mp4" >}}
The "final" code for the explosion animation looks like this:
{{< highlight cpp >}}
Animation explosion(wsl::Vector2i origin, int radius)
{
uint32_t seed = uint32_t(std::chrono::duration_cast< std::chrono::milliseconds >(std::chrono::system_clock::now().time_since_epoch()).count());
wsl::RNGState rng(123987445, seed); // Random numbers
const int ANIMATION_DURATION = 250;
Animation result;
int frameDuration = ANIMATION_DURATION / (radius * 2); // Outward explosion/Inward Explosion
//Outward explosion
for(int i = 1; i <= radius; ++i)
{
AnimationFrame frame;
for(int x = origin.x - i; x <= origin.x + i; ++x)
{
for(int y = origin.y - i; y <= origin.y + i; ++y)
{
// Without adding in an if sqrt(x^2 + y^2) <= r this just makes a square instead of a circle
// if(sqrt(pow(x, 2) + pow(y, 2)) <= radius) continue;
if(wsl::randomInt(1,100,&rng) >= 65)
{
continue;
}
wsl::Color bg = wsl::Color::Red;
switch(wsl::randomInt(1,3,&rng))
{
case 1: bg = wsl::Color::Yellow; break;
case 2: bg = wsl::Color::Orange; break;
case 3: bg = wsl::Color::Red; break;
default: break;
}
frame.tiles.push_back(AnimationTile(wsl::Glyph('.',wsl::Color::Yellow,bg), wsl::Vector2i(x,y)));
}
}
frame.duration = frameDuration;
result.frames.push_back(frame);
}
//Inward explosion
for(int i = radius; i >= 1; --i)
{
AnimationFrame frame;
for(int x = origin.x - i; x <= origin.x + i; ++x)
{
for(int y = origin.y - i; y <= origin.y + i; ++y)
{
if(wsl::randomInt(1,100,&rng) >= 25)
{
continue;
}
wsl::Color bg = wsl::Color::Red;
switch(wsl::randomInt(1,3,&rng))
{
case 1: bg = wsl::Color::Yellow; break;
case 2: bg = wsl::Color::Orange; break;
case 3: bg = wsl::Color::Red; break;
default: break;
}
frame.tiles.push_back(AnimationTile(wsl::Glyph('.',wsl::Color::Yellow,bg), wsl::Vector2i(x,y)));
}
}
frame.duration = frameDuration;
result.frames.push_back(frame);
}
result.engage(Animation::Flags::APPLY_BG | Animation::Flags::APPLY_BG | Animation::Flags::APPLY_GLYPH);
return result;
}
{{< / highlight >}}
Now, if you look closely at the above videos you may notice the
projectile launching from the player to the origin of the explosion -
those frames had to be added before the others (obviously) into the same
animation. If it was just another animation added to the list it would
be launching and exploding at the same time - not ideal.
To accomplish this I have a couple of functions, one for a projectile
animation, one for a firebolt projectile, one for the explosion, and one
for the fireball. The normal projectile animation creates a projectile
that travels from point A to B with a specialized glyph. This can now be
used for weapon throwing, arrow shooting, fireball launching, etc. The
firebolt projectile code starts off by creating a projectile, but then
modifies the glyph in each frame. I want to add some smoke trails to
this as well eventually, and this gives me a good spot to put that code.
The explosion animation is described above, and the fireball code
combines the explosion and firebolt projectile animations into one.
Neat!
---
With the way animations are made and represented in the game, I should
be able to make animations by hand with just as much ease as the
procedural animations... which means the next big animation is going to
have to be the main menu!
```
2018-08-09-The-RoguelikeTutorial-Week7.md
```---
title: "The Roguelike Tutorial - Week 7"
date: 2018-08-09 13:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-08-09"
---
I didn't do a lot of coding over the last week, but I did finish the
challenge! Had a bit of a scare after finishing part 12, I found a
horrible lurking bug in the program that caused a LOT of little errors
and I wasn't sure (at first) how to track it down. Basically, shortly
after finishing adding in some cool randomization functions I found that
some entities weren't being copied correctly, or saved correctly. Turns
out, the [C++ Rule of
3/5/0](https://en.cppreference.com/w/cpp/language/rule_of_three) is
actually a rule and not just a suggestion/guideline.
This project was the first time I attempted to use smart pointers and
write more "correct" C++ code, and apparently even when using smart
pointers to allocate memory you should write at least a copy constructor
and copy assignment function. I'm still not sure what I would put in a
custom destructor if all the memory that's allocated is done via smart
pointers, and that might be something I need to clean up now the
challenge is over.
When the `Entity` class was created with the default copy constructor
(or copy assignment), it wasn't allocating new memory for the new
entity. So, when one entity was destroyed another entity would suddenly
lose it's components! This never was a problem before part 12, because I
never tried to duplicate entities. One of the main goals in part 12 was
to intelligently place monsters, and I implemented that with a weighted
list that contained a prototype entity which was duplicated each time
one of those enemies was placed. All of a sudden, enemies suddenly
couldn't die after the first one was killed. Pathfinding spontaneously
broke. Entity names started being displayed as gibberish. I seriously
thought I was going to have to scrap the project at this point, because
I had no idea where to begin solving this problem. The answer eventually
came to me at work, and getting everything smoothed out was pretty
trivial.
## Part 12
So the theme of part 12 was to start implementing more randomization
functions. Up until this week I was using the built in STL version of
mersenne twister, and I don't think the way I was using it was the most
effective or how it was designed to be used. Searching the web for
answers, I stumbled upon a **ton** of information about pseudo random
number generators. I never really though much about it, but computers
can not generate actual random numbers. The random numbers we see
generated are the result of a bunch of math that is way (way) over my
head. There is a lot of number generators out there, and some of them
seemed like they would be pretty simple to implement. So, I decided to
write a quick simple implementation of an xorshift generator:
{{< highlight cpp >}}
class RNGState
{
public:
// These are random numbers - Literally could use anything here. I've been just seeding the first number with the system time
RNGState(uint32_t a = 123456789, uint32_t b = 362436069, uint32_t c = 521288629, uint32_t d = 88675123) : x(a), y(b), z(c), w(d) { }
uint32_t x;
uint32_t y;
uint32_t z;
uint32_t w;
};
uint32_t xor128(RNGState * rng)
{
uint32_t s = rng->w;
uint32_t t = rng->w;
t ^= t << 11;
t ^= t >> 8;
rng->w = rng->z;
rng->z = rng->y;
rng->y = rng->x;
s = rng->x;
t ^= s;
t ^= s >> 19;
rng->x = t;
return t;
}
int randomInt(int max, RNGState * rng)
{
int result = xor128(rng) % max + 1;
return result;
}
int randomInt(int min, int max, RNGState * rng)
{
if(min > max)
{
int tmp = min;
min = max;
max = tmp;
}
if(min == max)
{
return min;
}
// Finding the random number this way is what allows the xorshift function to return '0'
int range = max - min;
int result = randomInt(range + 1, rng) - 1;
return (min + result);
}
{{< / highlight >}}
The `xor128()` function uses some bitwise math and shifts the numbers
around, returning a 'new' 32 bit unsigned integer. The `randomInt()`
function takes a random number generator, calls the xorshift function,
does some modulo math, and returns the result. **This is not a very
computationally effective way to do this**, but for my purposes it's
actually super fast and works good enough. Plus, it's fun having some
idea of how the random numbers are generated. The cool thing about using
this generator is that the `RNGState` class is pretty trivial to
archive, and I can have the `GameMap` class and `Engine` class use their
own generators - which allows maps to be replayed!
A long existing glitch with my pathfinding code was that if no path
could be found - it would just enter an endless loop and freeze the
game. Thanks to be able to set the seed and play the same scenario over
and over, I was able to narrow down and squash that bug a lot easier
than I could have before.
The weighted list functions are pretty nifty too, I think. Basically
it's just a template wrapper around the `DLList` class I've been using
everywhere.
{{< highlight cpp >}}
template <typename T>
class WeightedList
{
public:
void add(T obj, int wt);
T pick(RNGState * rng);
private:
DLList<T> list_;
};
template <typename T>
void WeightedList<T>::add(T obj, int wt)
{
if(wt <=0)
{
return;
}
for(int i = 0; i < wt; ++i)
{
list_.push(obj);
}
}
template <typename T>
T WeightedList<T>::pick(RNGState * rng)
{
int index = randomInt(0, list_.size() - 1, rng);
return list_.at(index)->data;
}
{{< / highlight >}}
Eventually, when the enemies are loaded from an external file, a
weighted list will be dynamically created with all enemies that can be
found at or below a certain dungeon level. Items will be generated the
same way. I moved the item/monster/player definitions to another source
file, to begin planning for this eventual move.
## Part 13
Part 13 was another big milestone and something I haven't ever
successfully done - add equippable items. Fortunately, all the
preparation and careful building of the framework so far made this part
incredibly easy. I added another component to `Entity`, `Equipment`.
This component has the bonuses for each actor statistic (health,
defense, power) and a bitmask containing which slot the item occupies
and if the item is equipped. This makes it easy for an item to occupy
multiple slots - like our hero's two handed greatsword! An entity with
the equipment component is created by default with the item component.
The last thing needed for this to be successful was to make sure the
`Actor` component kept track of what slots it has currently occupied by
equipment. Sometime in the future when I work on the UI, I'll allow the
player to select what slot they want to equip items to - so they can use
one handed weapons in each hand like a true barbarian. For now, small
weapons like the dagger are automatically equipped to the off hand.
{{< fancybox_img src="EquippedItems.png" >}}
I also need to sort the inventory, displaying equipped items at the top.
Actually, equipped items probably won't show up in the inventory at all,
and just show up in the equipment screen of the future UI. Here's a
quick gameplay video of what I ended up with after part 13:
{{< fancybox_mv src="Part13.mp4" >}}
---
So what's next? Well, I'm stoked to finally have a project make it this
far, and be solid enough that I can build off. I've got quite the list
of "to-do" items to start tackling, and lots of ideas for fun future
implementations for this project. Here's a truncated list, stripped of
general housekeeping things, in no particular order.
* Move monster/item definitions to external text files, and write a
parser to change those to game data.
* Clean up SDL texture and sprite classes - these are pretty much
straight from the [LazyFoo SDL
tutorials](http://lazyfoo.net/tutorials/SDL/), and I think I can spruce
them up a bit/modernize them. Maybe.
* Better dungeon generators, with external text file definitions.
* Finish A-star/Dijkstra pathfinding functions - BFS works just fine,
but I still want to try and implement these.
* Fix combat - maybe do a fancy percentile based system or something!
* **Animations!** I’ve got a really good idea on how I want to do these,
so it’ll probably be one of the first things I tackle next.
* Move all "flavor" text to an external file - would make it much easier
to add things.
* Improve the UI - I’ve got some mockups made, but I’m kinda enjoying
the basic no frills look this has right now.
* Character creation/naming screen.
* Get the project to build on other operating systems! This is also high
on my priorities, along with creating prebuilt binaries for people who
don’t want to fuss with compiling.
* Re-add the timing/scheduling system.
* Properly comment and organize the core classes code. My comments are
pretty sparse, and it would probably be a good idea to do this before
the project gets any bigger. Plus, it might help explain my logic and
why I did something if anyone ever looked at my code.
* Split game display into multiple virtual consoles (log console, game
console, UI console, etc). It's all one console right now, which isn’t
bad but sometimes the log or UI can obscure the map.
Here is the source code for [Part 13](https://github.com/zwilder/Barbarian/tree/Part_13) and [Part 12](https://github.com/zwilder/Barbarian/tree/Part_12)!
```
2018-07-18-The-Roguelike-Tutorial-Week4.md
```---
title: "The Roguelike Tutorial - Week 4"
date: 2018-07-18 12:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-07-18"
---
The past week has been equal parts frustration and excitement with this project.
I ran into a pretty common design problem: entity components need to know about
the rest of the game. Well, since each entity is just a collection of components
it shouldn't be difficult to pass a pointer to the game engine. Then, the
components would have a pointer to the entity that "owns" it. Simple and
clean... or so I thought. This didn't work, at all. Individual entities could
access the engine just fine, but the components just could not access anything
about their owner. Even trying to print the address of the owner caused the game
to segfault and crash. GDB was no help, and I tried MANY things to get this to
work.
I realized that I was bashing my head against this problem, and totally stumped,
so I decided to work on something else. I changed the Engine's entity list from
a `std::vector<Entity>` to a `wsl::DLList<Entity>` (from the fancy list class I
created last week). To my surprise and delight, it worked perfectly! What's nice
about using the list I created is that it manages it's own memory - I don't have
to worry about allocations/deallocations no matter how big the list gets!
This got me thinking about best practices and clean code again. In general, I've
heard you should **always** use the Standard Template Library containers over a
custom rolled solution. However, I know my code, I know how it works, and I can
fix/change it with minimal fuss. Creating a custom wrapper for
`std::priority_queue` or `std::map`? No way, I have no idea where to even begin!
So, with this in mind I returned to my original problem. To hell with best
practice, I'm not a professional and I don't work with other programmers. My
code is written clearly and commented well, so it should be easy to figure out
why I did things the way I did. I decided that a good, bare bones, no frills
system has components that are nothing more than data containers, and entities
that are collections of components. All the logic is then moved to the entity
class, all the accessors are in the entity class, and the entity itself is
responsible for maintaining it’s components. Yeah, this does mean that a good
large chunk of the game is going to be in the entity class, and that the class
may get a bit bloated - but who cares? It works, and my original problem went
away completely. It will make serialization easier too, because I only need to
serialize Entity - Entity can destruct/construct all of it’s components from raw
data.
## Part 6
With all that nonsense out of the way, I set about implementing combat. The
first step was collecting all the data parts of the Entity class that dealt only
with actors and moved it to the new Actor component, and adding in the health
points, defense, and power data. Eventually, I’ll want to implement a better
combat system (I like the idea of a [percentile based
system](https://www.reddit.com/r/roguelikedev/comments/46i4i7/comment/d05al46)),
but for now I’ll stick with following the ideas in the tutorial. Combat was
actually really surprisingly easy to add at this point!
The minor tweaks needed were actually minor, which is nice for a change -
`GameMap::isBlocked()` for instance only returned true if the tile at the spot
blocked movement, it now also checks the entity list for an entity at that spot
that blocks movement. What’s nice is this inadvertently fixed a glitch with the
pathfinding, monsters now see other monsters as obstacles in the way of their
target. `Engine::update()` also checks if an entity is dead, to remove it from
the entity list and change the tile it occupied to a corpse. Adding a GameState
for player death was also easy, so the game actually “ends” now. I still need to
make the `Engine::newGame()` function, but that shouldn’t be difficult. All the
work put into this so far paid off, watching monsters discover, path to, and
attack the player is very exciting - I can`t wait to continue tweaking combat
and actually use the time management I wrote last week!
## Part 7
So I have an idea of how I want this game to look - eventually. However, I
decided to just drop a basic UI in the game for Part 7. The first task here was
to add a `Console::print()` function - ha, the last time I opened the console
code was **way** back when the project was first started! Fortunately it’s all
pretty simple and I tried my best to write it with modularity in mind so I can
use it on later projects. A print function has one task, display a string at a
coordinate position. Easy enough - but what if the string is longer than the
console width? Well, thats another easy fix, just advance the y part of the
coordinate pair and continue writing! Simple!
{{< highlight cpp >}}
void Console::print(int x, int y, std::string msg)
{
size_t msgLength = msg.size();
int widthAvailable = width_ - x;
int dX = 0;
int dY = y;
for(size_t i = 0; i < msgLength; ++i)
{
if(dY != y)
{
dX = x + int(i) - widthAvailable;
}
else
{
dX = x + int(i);
}
if(dX >= width_)
{
dX = 0;
dY += 1;
}
screen_[dX + (dY * width_)] = msg[i];
}
}
{{< / highlight >}}
Beautiful! Simple! It works! But wait, do you see the problem? Yeah, this splits
a string into characters instead of words! Dang it. Ah well, it’s now my next
thing to fix.
The message log is yet another good fit for the list class I wrote last week.
Engine now has a list it maintains of messages. When something needs to add a
message, the engine examines the top message on the list (head), and combines it
with the new message if the combined length is under a maximum size (the size of
the area on top of the screen for log messages). If the combined string is over
the maximum length, the message will be truncated and pushed to the list with a
new message created for the remainder. A new game state will be added shortly,
`GameState::MSG_WAIT` which will pause the game (“Press any key to continue”)
when there is more than one message in the message list. I want to limit the
amount of message noise the player sees, so hopefully this shouldn’t occur too
often. I also want to add a 6x12 font file for the UI, since square fonts are
sorta ugly to read. More stuff for the To-Do list!
Here’s a video with this week’s progress and how the game looks at the end of
Part 7:
{{< fancybox_mv src="RoughUI.mp4" >}}
Super cool, and I’m pretty stoked at this point. Next on the agenda (besides
some minor fixes listed above) is tackling items and healing potions!
Here is the source code for [Part 6](https://github.com/zwilder/Barbarian/tree/Part_6) and [Part 7](https://github.com/zwilder/Barbarian/tree/Part_7)!
```
2018-07-10-The-Roguelike-Tutorial-Week3b.md
```---
title: "The Roguelike Tutorial - Week 3b"
date: 2018-07-10T22:31:00-07:00
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
---
I originally planned for this week's blog post to cover my adaptation of
part 5 of the Python RL tutorial - but after finishing part 5 in a
matter of minutes I realized there wouldn't be much to write here! Part
5 is basically making new entities and getting the collision logic in
place before combat is added in part 6. However, before adding combat I
thought it would be beneficial to start thinking about game time - it's
far more fun when some enemies are a lot quicker than the player,
forcing the player to devise strategies for survival.
Naturally, there's a few
[articles](http://www.roguebasin.com/index.php?title=Articles#Time_management)
on roguebasin -
[one](http://www.roguebasin.com/index.php?title=An_elegant_time-management_system_for_roguelikes)
of which I've read **many** times over the years, and never understood a
word of it. Pascal is a goofy, blunt looking language and really makes
you appreciate how nice programming languages read these days. Or, maybe
I'm just dense and don't get it. I love that article though - not only
because it references my favorite roguelike
[ADOM](https://www.adom.de/home/index.html)(which, despite playing for
over a decade have never beat), but because of the word "elegant." It
just sounds so, appealing.
I sat down, notebook ready, to try and break this article in pieces and
figure out what it's saying. The very first thing it says is:
> Readers should be familiar with a linked list (next) and
> doubly-linked list (prev and next). A circular list simply means that
> the last object's "next" points to the first object; and in a
> doubly-linked circular list the first object's "prev" points to the
> last object. The advantage of a circular list over a regular list is
> that a circular list need not cater for null-references during
> insertion or deletion of objects.
Well, my severe lack of formal computer science education meant that I
had no idea what any of those things are, really, beyond the fact that
they exist and there is likely an STL implementation of those I could
find. Searching google for "linked list C++" led me to [this fantastic
site](https://www.geeksforgeeks.org/data-structures/linked-list/).
I decided to take a step back from this project at this point and learn
all about lists.
## Super Cool Lists A list is apparently nothing more than a bunch of
linked nodes, with each node containing a piece of data and a pointer to
the next element in the list. Simple enough, right? Well after reading
and writing a few simple little examples toying with creating lists, I
had the realization that this was exactly what I was missing in my
understanding of pathfinding algorithms and could easily be used for a
sort of scheduling system. If a list contained nodes whose data was just
a pointer to an entity, when that node is "popped" off the top of the
list it could be called for updating in the engine. This means that if a
list was kept as a "schedule", the entities who can act could be added
to the schedule and popped off in sequence for updating. Cool right?
So the update routine is now split into two parts: First if the schedule
is not empty, it goes through and updates each actor in the schedule by
popping them off the top. Ideally, I would be doing this in a
`while(!schedule_->isEmpty())` loop, and will probably do that once I
finish the actor update routines. A more graceful way of handling entity
updates would be to just return if the entity hasn't decided on an
action, and set the entity actions in their AI update (for the enemies)
or in the keyboard input handling (for the player). For now, since we
have to let the player have a chance to use their turn, the conditional
just returns after removing one actor from the schedule which allows the
engine to continue monitoring input.
{{< highlight cpp >}}
void Engine::update()
{
if(!schedule_->isEmpty())
{
if(curActor_ == NULL)
{
curActor_ = schedule_->popFront();
}
/*
* The next few lines will be replaced with
* if(curActor_->nextAction == Action::NONE) return;
* else curActor_->update();
* once that system is in place.
*/
if(gameState_ == GameState::PLAYERS_TURN)
{
return;
}
else
{
curActor_->update();
}
curActor_->energy() -= ACTION_COST;
curActor_ = schedule_->popFront();
return;
}
{{< / highlight >}}
Next, when the schedule is empty the game advances a "tick" and grants
each actor a set amount of energy. Currently, the actors have a base
speed that is added to their energy pool every tick. When their energy
level is greater than the cost of an action (a constant, currently set
to 100), they get added to the schedule.
{{< highlight cpp >}}
else
{
for(int i = 0; i < entityList_->size(); ++i)
{
entityList_->at(i).grantEnergy();
if(entityList_->at(i).energy() >= ACTION_COST)
{
schedule_->push(&entityList_->at(i));
}
}
player_->grantEnergy();
if(player_->energy() >= ACTION_COST)
{
schedule_->push(player_.get());
}
gameState_ = GameState::PLAYERS_TURN;
}
}
{{< / highlight >}}
Simple, right? What makes this neat is
* If the `ACTION_COST` is set to 100
* Players speed is 50
* Slug speed is 25
* Bat speed is 100
Then for every 4 turns the player takes, the bat gets 8 and the slug
gets 1. Now if the Bat is able to intelligently use hit and run
tactics...
The other cool thing about lists is that making a simple priority queue
is an easy leap from a linked list - just attach a priority to each node
and arrange them when the nodes are inserted! This made pathfinding
much, much easier, and I can finally understand and interpret the [Red
Blob Pathfinding
Guide](https://www.redblobgames.com/pathfinding/a-star/introduction.html)!
Right now I have a basic greedy best first search up and running, and
it's **quick**. Now, it's not very optimal for long paths, but the way I
figure it is the undead denizens of the ruins our burly hero is delving
will only start tracking the player once they see/sense the player -
which means they won't start hunting all the way across the map right
off. I'm still tinkering with trying to get A-Star pathfinding working,
but I'm anxious to get the enemy actors to actually start doing
something! Plus, I'm a tad bit behind the current challenge schedule.
I'm going to add this to my list of things to continue working on after
the challenge is over.
---
Up next in part 6 is combat, which should be a lot more fun now that
enemies can take turns at different rates and can intelligently move
towards the player. Hopefully, if all goes well, I'll be able to show
off a nice video with the next update that will also feature a scrolling
message log and an inventory screen (part 7)! In the meantime, the
[repository](https://github.com/zwilder/barbarian) is here - CLOC
reports 2561 lines of code written, and hopefully it's legible and easy
enough to follow.
Here is the source code for [Part
5](https://github.com/zwilder/Barbarian/tree/Part_5)!
```
2018-06-25-The-Roguelike-Tutorial-Week2.md
```---
title: "The Roguelike Tutorial - Week 2"
date: 2018-06-25T08:00:00-07:00
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-06-25"
---
So this week's goal is to finish [part 2](http://rogueliketutorials.com/libtcod/2) and [part 3](http://rogueliketutorials.com/libtcod/3) of the tutorial - I
worked ahead because I was excited to get this project going, which worked out well since shortly after finishing part 2 I switched to SDL from SFML and it gave
me some time to work on this blog.
## The Switch to SDL
So the game logic is completely divorced from the rendering system - I don't want to be tied into using a set framework if I want to change later, and I know for a
fact from previous projects this will make save files **much** easier to generate. I briefly described last week that the game has a virtual console that is written
to, and is read/translated into graphics to be
displayed by SFML. Well, the console is a grid of say, 80x50 (960px x 600px). Each cell in the grid has a glyph that needs to be translated and rendered. During
engine initialization, it loads one texture (image) as the spritesheet - in this case it's a .png image of the CP437 font.
{{< fancybox_img src="cp437_12x12.png" >}}
Now what Engine::Draw() did originally was make a new SFML sprite for each cell, with the position set to the font size multiplied by the cell x,y coordinates.
Seemed simple enough, and it worked - but that's 4000 sprites created and destroyed EVERY time Draw() is called. The next iteration created two arrays of sprites
in Engine::Init() that were persistent and lived throughout the life of the program - one sprite for each cell in an array, and one for each glyph. Then, in draw,
each cell's sprite was just changed to be the same value as the sprite representing the glyph on the console. Yep, that worked too, but it still seemed there had
to be a cleaner, better way of doing this.
I realized something shortly after finishing that, I don't need all those sprites. I could just create an array of rectangles representing the sprite location on
the texture and then change each cell's sprite location in that array! Further, doing this I didn't really need 4000 sprites (one for each cell) - couldn't I just
use one sprite, updating it's position and rectangle before drawing it, since I only clear the render surface before drawing the first time? Well, SFML just did
not like this - but that was okay, since things were working for now.
I finished part 3 of the tutorial, which created a fairly simple dungeon generator, which looked like this:
{{< fancybox_img src="Screenshot1.png" >}}
Pretty neat! However, one of the main design considerations for this game is **completely** divorcing from the rendering - and in order to do so during this part
I created two new classes [wsl::Rect](https://github.com/zwilder/Barbarian/blob/master/include/rect.hpp) and [wsl::Vector](https://github.com/zwilder/Barbarian/blob/master/include/vector.hpp). Rect is a rectangle, defined by passing an x,y coordinate and a width/height, a pretty simple class.
Vector, on the other hand, I went a tad overboard with. I like multi-use classes, because I can use them in other projects - so for Vector I brushed up on my C++
Template skills and made vector a fancy template class. Honestly, it is a **lot** of code for a simple class that's basically a glorified holder for an x,y
coordinate pair! For ease of use I liked how SFML defined Vector2<int> as Vector2i, Vector2<float> as Vector2f etc - so I
borrowed that. I'll probably make Rect into a fancy template class too - because it's fun and useful.
I realized at this point that SFML is just a little too full featured for what I have planned for this game. I had previously gone through the [LazyFoo SDL2](/)
tutorials and really liked playing with SDL2. I decided to look at some of my older SDL2 code and see if I could modify and adapt the LazyFoo texture handling
tutorial. This resulted in two more classes, [wsl::Texture](https://github.com/zwilder/Barbarian/blob/master/include/texture.hpp) and [wsl::Sprite](https://github.com/zwilder/Barbarian/blob/master/include/sprite.hpp) - I won't go into detail on those, since they are pretty straightforward
adaptations of the LazyFoo tutorials.
This brought me back to my problem with rendering, and wanting to just use one sprite as a sort of cursor to translate the console to the screen - heck, if I'm
writing the code then I'll make it work. Turns out, I didn't even need to do anything special! Everything renders quickly, cleanly, and I have the satisfaction of
having written some new code.
## BSP Dungeon Algorithm
Using binary space partitions to generate a dungeon is a pretty well documented process, but the amount of understandable or legible C++ code out there is pretty
sparse. I found a few tutorials on making a BSP dungeon in a few other languages - and put this together, following along as usual with a [roguebasin article](http://www.roguebasin.com/index.php?title=Basic_BSP_Dungeon_generation).
Basically, a binary tree is a collection of nodes, and each node can have exactly zero or two daughters. We then work our way down, splitting nodes into daughter
nodes, until a minimum node size (width/height of a rectangle) is reached. The very first node is the 'root' of the tree, and the very last nodes at the bottom are
the 'leaves' of the tree. To make this, I needed two classes, [Node and Tree](https://github.com/zwilder/Barbarian/blob/master/include/BSP.hpp).
Each Node has a few things to keep track of: it's parent, it's children, and it's siblings. The Tree needs to keep track of it's root, it's leaves, and the
rooms/corridors. The Node class contains the logic for splitting itself into children, and the Tree contains the logic for populating itself.
Now, granted, this is all pretty abstract - so let's break down the code for splitting the Node first.
{{< highlight cpp >}}
Node::Node(wsl::Rect rect, Node * parent)
{{< / highlight >}}
A Node is created by passing it a rectangle representing it's area, and a reference to it's parent. Parent can be `NULL` - since the root has no parent.
{{< highlight cpp >}}
bool Node::split()
{
bool success = false;
if(!hasSplit())
{
bool horizontalSplit = wsl::randomBool();
int width = nodeRect.w;
int height = nodeRect.h;
if((width > height) && (100 * (width / height) > 125))
{
horizontalSplit = false;
}
else if((height > width) && (100 * (height / width) > 125))
{
horizontalSplit = true;
}
{{< / highlight >}}
First step is seeing if the node has already split, because if it has we don't want to split it again. Now, theoretically this will NEVER happen, but it never
hurts to have a bit of backup in your code just to make sure. Then, we have to decide whether the Node will be split horizontally or vertically. Simple enough to
select a random boolean - but what if splitting it horizontally makes the children nodes weirdly small? The next few lines cover that by making sure that if
the width is greater than the height and the ratio of width to height is greater than 1.25 then horizontalSplit will always be false. Note that since width
and height are integers, I normalized both sides by multiplying by 100.
{{< highlight cpp >}}
int max = (horizontalSplit ? height : width) - MIN_NODE_SIZE;
if(max <= MIN_NODE_SIZE)
{
// Too small to split further
success = false;
}
else // max > MIN_NODE_SIZE
{
int split = wsl::randomInt(MIN_NODE_SIZE, max);
if(horizontalSplit)
{
splitPos_.y = split;
splitPos_.x = nodeRect.x1;
leftChild_ = new Node(wsl::Rect(nodeRect.x1, nodeRect.y1, width, split), this);
rightChild_ = new Node(wsl::Rect(nodeRect.x1, nodeRect.y1 + split, width, height - split), this);
}
else
{
splitPos_.x = split;
splitPos_.y = nodeRect.y1;
leftChild_ = new Node(wsl::Rect(nodeRect.x1, nodeRect.y1, split, height), this);
rightChild_ = new Node(wsl::Rect(nodeRect.x1 + split, nodeRect.y1, width - split, height), this);
}
leftChild_->sibling_ = rightChild_;
rightChild_->sibling_ = leftChild_;
horizontal_ = horizontalSplit;
success = true;
split_ = true;
}
}
return success;
}
{{< / highlight >}}
So most of the rest of the split function is self explanatory. The first check is to make sure that the large side of the node is greater than a constant
`MINIMUM_NODE_SIZE`. `splitPos_` is a `wsl::Vector2i` that keeps track of the position of the split (which will come in handy when I add the corridors).
`leftChild_` and `rightChild_` are named for position on the tree, not so much position in the context of the game - so if we split
horizontally the left/right child are on the left and right of the node. If it's split vertically, the left/right child become the top/bottom child.
All that is left now is to populate the tree!
{{< highlight cpp >}}
void Tree::populate(wsl::Rect rootRect)
{
root_ = Node(rootRect);
std::vector<Node *> growth;
growth.push_back(&root_);
while(!growth.empty())
{
Node * currentNode = growth.back();
if(!currentNode->hasSplit())
{
// Check if node can split, if so split it and add children to growth
if(currentNode->split())
{
growth.push_back(currentNode->leftChild());
growth.push_back(currentNode->rightChild());
}
else // if it can't split, add it to leaves
{
leaves_.push_back(currentNode);
growth.pop_back();
}
}
else // currentNode.hasSplit() == true
{
growth.pop_back();
}
}
}
{{< / highlight >}}
To populate the tree is pretty simple after having the split function taken care of. We start by creating a root node of a defined size (passed into the function).
We need to check every node as we create it, so a vector containing the current nodes `growth` is created and root is added to it. Then, while the growth vector has
Nodes in it, we check a Node, split it if possible, and if not add it to the leaves and remove it from the growth vector. This leaves us with a vector of leaves
ready to put some rooms in! Here's a picture of what a result can look like with the minimum node size set to '8' on an 80x50 console.
{{< fancybox_img src="Screenshot2.png" >}}
In each of those rectangles a smaller rectangle is then randomly placed, which gives something like this:
{{< fancybox_img src="Screenshot3.png" >}}
Unfortunately... After all this fun work, if each room is connected to the room in the sibling node working our way up the tree, it ends up with a single
path connecting the dungeon! If instead the rooms are connected Rogue style (choosing a random x,y point on each room to connect) or tutorial style (connecting
the center of the rooms) this ends up looking darn near identical to the tutorial dungeon algorithm! Shoot.
<!-- <iframe src="https://giphy.com/embed/hwIhyQDzVhn56" width="480" height="265" frameBorder="0"></iframe> -->
Well, they can't all be winners. Fortunately, roguebasin has some other awesome dungeon generation articles - I've already modified one of them for use in
another project, and will most likely modify that same one again for this project.
Here is the source code for [Part 3](https://github.com/zwilder/Barbarian/tree/Part_3)!
```
2016-11-15-commenting-system.md
```---
title: "Commenting System with Staticman!"
Author: "Zach Wilder"
date: 2016-11-15 19:18:06 -0700
Categories:
- Programming
tags:
- Jekyll
- Web Programming
---
The one bad thing about hosting a static blog is that implementing comments means you:
* Outsource, letting some other site handle it (like Disqus)
* Come up with some sort of crazy contraption to force a comment system into a static blog
* Spend hours scouring the internet to see what other people have done.
Obviously, outsourcing wasn't an option - Disqus looks nice and all, and I'm sure it would be fine for a lot of people, but it just wasn't what I wanted. I like having full control of my data. My next idea was to find a free
hosting site and write some crazy PHP and set up a SQL database to set up comments.
But this got me thinking - how did sites handle comments before all this dynamic content was commonplace? A careful google search led me to an amazing blog post by [Eduardo Boucas](https://eduardoboucas.com/blog/2016/08/10/staticman.html) on how he solved this exact problem. And holy crap does his solution work exactly like I wanted. In a quick nutshell: [Staticman](https://staticman.net) is a Github bot that pushes formatted yml (or json) files into a specified directory that can than be read as comments on the page when the site is built!
So how did I set this up in Jekyll? Read on!
Obviously, the first thing I did was read the documentation on the [Staticman](https://staticman.net/docs/) site, and followed the steps listed there. This is what was added to my `_config.yml` file for the site.
{{< highlight yml >}}
staticman:
allowedFields: ['name', 'message']
branch: master
filename: 'entry{@timestamp}'
format: yml
generatedFields:
date:
type: date
options:
format: "timestamp-seconds"
moderation: false
path: "_data/comments/{options.slug}"
requiredFields: ['name', 'message']
url: https://api.staticman.net/v1/entry/zwilder/Hack_Blog/master
{{< / highlight >}}
Now, since the blog is accessible from GitHub, and the repository is public - I removed the email field. I don't think anyone would appreciate their email being so easily accessible (something something security).
The important part of this is the path variable - this saves comments in their own folder, named after the post they were generated from.
I added the comments into their very own partial HTML page in the `_includes\` directory.
At the top of the `comments.html` page:
<figure class="highlight">
<pre>
<code class="language-html" data-lang="html">
{% capture post_slug %}{{ page.date | date: "%Y-%m-%d" }}-{{ page.title | slugify }}{% endcapture %}
</code>
</pre>
</figure>
This is what makes the name for the directory from the post name - the [Jekyll docs](https://jekyllrb.com/docs/templates/) do a much better job explaining this than I could. Really, it just shoves the 'slugified' name into a variable called 'post_slug'.
The forms were also not very complex - basic HTML forms, but the important bit is the `name="fields[]"` part. In the `_config.yml` file, notice that the fields declared are the same here.
<figure class="highlight"><pre><code class="language-html" data-lang="html"><span class="nt"><form</span> <span class="na">class=</span><span class="s">"form"</span> <span class="na">action=</span><span class="s">"{{ site.staticman.url }}"</span> <span class="na">method=</span><span class="s">"POST"</span><span class="nt">></span>
<span class="nt"><input</span> <span class="na">type=</span><span class="s">"hidden"</span> <span class="na">name=</span><span class="s">"options[slug]"</span> <span class="na">value=</span><span class="s">"{{ post_slug }}"</span><span class="nt">></span>
<span class="nt"><fieldset</span> <span class="na">class=</span><span class="s">"form-group form-success"</span><span class="nt">></span>
<span class="nt"><label</span> <span class="na">for=</span><span class="s">"username"</span><span class="nt">></span>USERNAME:<span class="nt"></label></span>
<span class="nt"><input</span> <span class="na">id=</span><span class="s">"username"</span> <span class="na">type=</span><span class="s">"text"</span> <span class="na">name=</span><span class="s">"fields[name]"</span> <span class="na">placeholder=</span><span class="s">"Anonymous"</span> <span class="na">class=</span><span class="s">"form-control"</span> <span class="na">maxlength=</span><span class="s">"15"</span><span class="nt">></span>
<span class="nt"></fieldset></span>
<span class="nt"><fieldset</span> <span class="na">class=</span><span class="s">"form-group form-textarea form-success"</span><span class="nt">></span>
<span class="nt"><label</span> <span class="na">for=</span><span class="s">"message"</span><span class="nt">></span>MESSAGE:<span class="nt"></label></span>
<span class="nt"><textarea</span> <span class="na">id=</span><span class="s">"message"</span> <span class="na">rows=</span><span class="s">"5"</span> <span class="na">name=</span><span class="s">"fields[message]"</span> <span class="na">class=</span><span class="s">"form-control"</span><span class="nt">></textarea></span>
<span class="nt"></fieldset></span>
<span class="nt"><div</span> <span class="na">class=</span><span class="s">"form-actions form-success"</span><span class="nt">></span>
<span class="nt"><button</span> <span class="na">type=</span><span class="s">"submit"</span> <span class="na">class=</span><span class="s">"btn btn-success btn-block"</span> <span class="na">value=</span><span class="s">"Send"</span><span class="nt">></span>Submit<span class="nt"></button></span>
<span class="nt"></div></span>
<span class="nt"></form></span></code></pre></figure>
Finally, for the fun part: Reading the comments into the file.
<figure class="highlight"><pre><code class="language-html" data-lang="html">
{% if site.data.comments[post_slug] %}
{% assign comments = site.data.comments[post_slug] | sort %}
{% for comment in comments %}
{% assign name = comment[1].name %}
{% assign date = comment[1].date %}
{% assign message = comment[1].message %}
<span class="nt"><div</span> <span class="na">class=</span><span class="s">"cell -3of12"</span><span class="nt">></span>
<span class="nt"><span</span> <span class="na">class=</span><span class="s">"pull-right"</span><span class="nt">></span>{{ name }}@<span class="nt"><span</span> <span class="na">style=</span><span class="s">"color: #4caf50"</span><span class="nt">></span>WSL_Guest<span class="nt"></span></span>%<span class="nt"></span><br/></span>
<span class="nt"></div></span>
<span class="nt"><div</span> <span class="na">class=</span><span class="s">"cell -9of12"</span><span class="nt">></span>
<span class="nt"><span</span> <span class="na">class=</span><span class="s">"pull-left"</span> <span class="na">style=</span><span class="s">"color: #FFF; margin-left: 5px; "</span><span class="nt">></span>[<span class="nt"><span</span> <span class="na">style=</span><span class="s">"color: #4caf50"</span><span class="nt">></span>{{ date | date: "%d%b%y : %T" }}<span class="nt"></span></span>] {{ message }}<span class="nt"></span><br</span> <span class="nt">/><br</span> <span class="nt">/></span>
<span class="nt"></div></span>
{% endfor %}
{% endif %}
</code></pre></figure>
Broken down, the code basically checks to see if there is a folder in the comments directory (the path specified in `_config.yml`) - if there is, the comments are sorted and then looped through.
For each comment, a variable is assigned for the name, date and message, and then with some fancy styling and HTML it is put into the post! Thats it!
I honestly didn't believe it would be that easy - most of what took me time was formatting the forms and laying out the comments section in a pleasing (and hopefully easy to read!) manner. I took some inspiration from my terminal window as I was working - I think it actually looks pretty cool for comments. [Staticman](https://staticman.net) is the coolest thing, and I'm gonna have to go check out the source and maybe play around with it.
Now, for some fun obstacles - typing liquid code into a markdown page for Jekyll to process as highlighted code... yeah that doesn't work. Fortunately, you can still use HTML, but then the post becomes a bit
less human readable in it's raw form. To get the HTML code to highlight I let Jekyll build the site with the liquid code processed, opened up the generated HTML file, copy-pasta'd it back into the markdown file, and changed the liquid code back to what it should be before Jekyll processed it. Kinda a pain, but definitely easier than doing all the highlighting by hand!
```
2020-06-06-RevivingTheBlog.md
```---
Title: "Reviving the Blog"
Author: "Zach Wilder"
Date: 2020-06-06 07:00:00 -0700
Categories:
- Stories
- Sketching
Tags:
- Art
- Pen and Ink
Thumb: "2020-06-06-RevivingTheBlog/TrailerSketching_w.jpg"
assets: "2020-06-06-RevivingTheBlog"
---
At the time of writing this, I'm sitting in a small camper trailer just off the
Pacific ocean in Oregon. Rain is drizzling down in intermittent bursts, pounding
on the metal roof, and when the rain stops a jay outside starts "singing" his
boisterous song.
I've recently relocated to the Pacific Northwest - my job had a position that
needed filling on the Oregon Coast, how could I turn down that opportunity? With
little time to prepare, my wife and I packed and shoved things into shipping
containers to migrate our life across the country and put our house up for sale.
I started work in OR on May 3rd, flying out ahead of my wife and daughter to
scope the place out and look for a new place to live. The house in AZ is
currently under contract, and set to close on June 15th... So I've been living in
this trailer in the woods by myself for the last month.
There really is no shortage of stuff to do up here - especially being on the
coast and with the weather so dang nice compared to AZ. One of the projects
lingering in my mind for the past year or so was starting a new blog. Something
to encompass all my hobbies, adventures, short essays on nature things and
random stories. Basically, a combination and condensation of my other blog
projects along with other things that I haven't really posted anywhere online.
A one-stop Zach shop.
So, what you'll find here, in the previous posts, is things written by myself
and a coworker on my old "Hidden Phoenix" blog, and all the posts from my
programming blog. I'll be posting new stories from Oregon here, and occasionally
write-ups of things I find interesting. You'll also be seeing posts featuring
things I've made - sewing projects, MYOG camping stuff, art, etc.
---
One thing that I've wanted to do for a while is sketch more. I want to get out
and "art" more - no real excuses for not doing it. With all my free time over
the last month, and the fact that a lot of places were shut down because of the
health crisis, I ran out of bullshit excuses and got out and did it.
I flew into Medford, Oregon on May 3rd, and spent my first week of work hanging
out with a group of new-hires in Ashland. Ashland is one seriously cool place -
definitely a great way to start this new adventure. I spent time after work
hiking around these cool trails, looking at all this new vegetation, hearing all
these strange new birds - all while carrying my sketchbook. It took me a couple
days to actually open it, definitely felt intimidated and overwhelmed by the
thought of trying to translate what I was seeing onto paper. However, I figured
that the best way to start was to just... start. One of the most conspicuous
plants around there was this cool looking, smooth reddish bark shrub with mellow
sweet smelling flowers that were pleasant to walk by.
{{<fancybox_img src="Manzanita_w.jpg">}}
I busted out my pen and started doodling - nature journal style. I packed my
sketchbook in it's case I made, loaded with an assortment of pencils, a couple
pens, and a water brush filled with ink. This being my first sketch in an
embarrassingly long time, it took a bit of internal debate over what to actually
use to put the sketch on the paper. I chose the pen because I like the
permanency of the lines - the commitment. Once something hits that paper, you're
stuck with it, for better or worse.
This sketch was done with my Lamy Safari, filled with Noodler's Bernanke Black
ink. I bought the pen and converter a while ago, and chose that ink because
waterproof sounded like a good idea for sketching outdoors. Of course, I didn't
check how much ink was in the pen before I left, so shortly after this sketch
the pen ran dry. Heck. After my first week of work, I decided to take a drive to
the coast. On my way, stopped at an art store in Medford, where I picked up a
bottle of Pelikan 4001 Brilliant Black.
The big reason I jumped on the opportunity to move up here was to live near the
ocean - so my first weekend up here I decided to hit the beach, do some
exploring, and attempt to sketch the coast.
{{<fancybox_gallery
id=1
src1="Bastendorff1_w.jpg"
src2="Bastendorff2_w.jpg"
src3="Bastendorff3_w.jpg"
>}}
My first attempts at sketching the coast made me realize a couple of things,
mostly that the chaotic nature of the waves crashing on a beach is intimidating
to sketch. I had fun though, nothing beats the sunshine, sand, and coastal air.
I went out both Saturday and Sunday with the goal of attempting to sketch waves.
The next week at work I didn't spend much time sketching or exploring at all - I
actually had to work! I doodled a bit in the sketchbook at night, but mostly
spent my time working in Roseburg. Friday rolled around and I headed west to the
coast again, and stopped at this cool "historic covered bridge" wayside along
the highway. I jumped out with my sketchbook and couldn't figure out how to
position myself to sketch the bridge, so I went exploring around it instead.
There was a cool path (overgrown with blackberry of course) that went
under the bridge.
{{<fancybox_img src="SandyCreek_w.jpg">}}
I figured out a couple things here, trying to recreate "brush strokes" with the
pen to suggest foliage works better than trying to draw foliage. Water was still
elusive, and even with the water brush loaded with dark ink I wasn't quite able
to get what I was seeing and what was in my head down on paper.
Spent the weekend driving up the coast, and stopped in Winchester Bay off the
101 to look at boats. It was raining and cold, but I was determined to sketch so
I sat in my truck and doodled these while looking through the windshield wipers at the
bay.
{{<fancybox_gallery
id=2
src1="WinchesterBay_w.jpg"
src3="CeresAndRelentless_w.jpg"
>}}
I took a trip the next day, again up the coast, with the goal of sketching waves; I was
determined to figure out what I needed to make the waves look like waves. In
retrospect, one of the greatest things to happen in the last month to my
sketching was around this point in the month - I was definitely feeling more
comfortable busting out my pen and trying to translate vision to paper. It felt
**good** to stare at the waves and study them, mimicking their flow with gentle
pushes and pulls on the paper.
{{<fancybox_gallery
id=3
src1="CarlGWashburne_w.jpg"
src3="BobsCreek_w.jpg"
>}}
During the work week I was sitting in my trailer, looking at my ocean sketches -
and I realized the values in the waves needed work. My lightest values should be
the spray and foam of the crashing waves, the waves needed to be darkest at the
top and bottoms where they are "thickest" and slightly lighter in the middle
where they are "thinnest." It's a challenge to build value scales with one
color, especially when I barely have a clue as to what a value scale is. The
internet gave me an idea though - what if I used my water brush with water on
the ink? The Pelikan ink is not waterproof, what would happen?
{{<fancybox_gallery
id=4
src1="WaveDoodle1_w.jpg"
src2="WaveDoodle2_w.jpg"
src3="WaveDoodle3_w.jpg"
>}}
Well, the ink explodes into beautiful shades of gray is what happens. Fascinated
by this development I was encouraged to go out and get some more sketching in
and see what happened when I hit it with the water brush.
{{<fancybox_gallery
id=5
src1="Yachats1_w.jpg"
src3="Yachats2_w.jpg"
>}}
I am super excited about this - I can paint with the grays in the ink, blur out
things in the background put a light grey hint in the sky for clouds. Plus it
looks (in my opinion) pretty darn cool.
{{<fancybox_gallery
id=6
src1="SealPoint_w.jpg"
src3="WaveDoodle4_w.jpg"
>}}
This sketch of Seal Point is probably my favorite thing I've ever art-ed. I was sitting on
these rocks watching waves crash and people play in the surf and there was this
dad holding hands with his daughter, just letting the surf come up and bury
their feet. The waves thundering over the rocks dramatically were amazing - and
impossible to do justice to.
I decided to go back into the woods and try some more landscape sketching - so
many trees here it really is hard to "see the forest for the trees." Trying to
balance the ink wash and steady lines and working on depth moving from
background to foreground. Also along my hike I stopped to attempt some more
nature journaling - found this bizarre plant and some cool fungi.
{{<fancybox_gallery
id=7
src1="EelLake_w.jpg"
src2="IndianPipe_w.jpg"
src3="Mushrooms_w.jpg"
>}}
The balance between the background and foreground kept bothering me, so that
night I doodled some more, trying things out with washing away the background
completely and leaving only the foreground lines. The next couple day's sketches
were attempts at this.
{{<fancybox_gallery
id=8
src1="Mystic_w.jpg"
src3="RailroadOverUmpqua_w.jpg"
>}}
After my attempt at drawing a bridge (damn you perspective!) I went back to the
harbor in Winchester Bay and did my second favorite sketch from the last
month. The shipyard in the background was a fascinating jumble of old machines,
new boats, and boat parts. A bunch of seagulls flew in right as I was about to
drive off and I knew I just had to throw a couple of them in there.
{{<fancybox_img src="HarborLights_w.jpg">}}
One of the cool things I realized over this past month of increased sketching
was how the sketchbook became a journal of the places I visited and the things I
saw - more sketching means a more detailed account! It also feels good to use up
pages in the sketchbook, even though I'm constantly having to remind myself to
not let the sketchbook become "precious" - doodle, draw, scribble, that's what
it's there for and it's neat looking at my doodles over the last month.
{{<fancybox_gallery
id=9
src1="CapeArago_w.jpg"
src3="TrailerSketching_w.jpg"
>}}
Well this officially is the longest, most photo intensive blog post I have ever
written. To whoever reads this: thank you for taking the time, I really
appreciate it! I hope to have more things up and posted here soon.
```
2019-08-09-SaltCedar.md
```---
draft: true
Title: "*Tamarix ramosissima* salt cedar"
Author: "Jennifer Brady"
Date: 2019-08-09 07:00:00 -0700
Categories:
- Trees
- Invasive Plants
Tags:
- Invasive
- Alternate
- Scale-like
- Deciduous
- Tamarix ramosissima
- Tamaricaceae
Thumb: "2019-08-09-SaltCedar/GlamourShot.jpg"
---
{{insert Glamour Shots, lol, if I can find any}}
# Background
*Tamarix ramosissima* is one of several types of salt cedar in Arizona. It is
common along river beds and riparian areas and is considered a [pioneer
species](https://en.wikipedia.org/wiki/Pioneer_species) (a hardy plant that is
first to colonize a disturbed area). Salt cedar grows in areas where native
trees and shrubs can't survive or are no longer suitable for their habitation.
These native trees, like cottonwoods and willows, have evolved to reproduce
after yearly flooding has occurred. In many areas this periodic flooding no
longer occurs and this has paved the way for salt cedars, which can produce seed
year around [(UA
News)](https://uanews.arizona.edu/story/study-finds-silver-lining-for-maligned-saltcedar).
It has long been thought that salt cedar crowds out native species. In many
areas where salt cedar has taken over, the soils have high salinity, low water
availability, and are often higher in nutrients and organic matter. Salt cedar
prefers areas where the streamflow has been altered by dams, often creating
this type of environment where salt, nutrients, and organic matter have not been
flushed out of the soil by periodic flooding. Salt cedar can be found with
sandbar willow (*Salix exigua*), Fremont cottonwood (*Populus fremontii*), and
boxelder (*Acer negundo*).
**Salt cedar is halophytic** - it is adapted to living in a saline environment
and it has the ability to sequester salt in its tissues. It can also secrete
salt from microscopic glands on the underside of the leaves:
>One winter, I was patrolling power lines near the Gila River, south of Phoenix
>and I came across an area that was thick with salt cedar and the right-of-way
>was becoming engulfed. I had to drive through the overgrown right-of-way and
>the branches grazing my truck were damp with morning dew. It was a cool morning
>and all the windows were up on my truck but once I got through the area I
>noticed a white "film" all over the windows, I had to stop and wipe/scrape it
>off because once it dried I could no longer see out! It was salty water exuded
>from the salt cedars. At one point I had to walk through the wet brush - I
>didn't really think anything of it but once my clothes dried my pants and
>jacket were covered in white residue from the salty dew. It really does pull
>salt out of the ground and secrete it through the salt glands. This was in
>December and in some areas it looked like it had just snowed because of the
>salt on top of the soil.
{{picture of Gila river salt cedar}} {{picture of salt layer}}
*Tamarix spp.* (spp. = several species) produce an abundance of seeds. One tree
can produce 500,000 seeds per year or more, and the tree flowers in its first
year. If roots or stems are cut, they will readily grow back.
{{picture of seeds}} {{picture of roots/stems}} {{picture of stump sprouts or
burned out stump}}
There are some **massive** tamarisk trees around - these are a different species
than the more invasive *T. ramosissima*. These large trees are *Tamarix aphylla*
Athel tamarisk. To make things a bit confusing - they are also called salt
cedar. The Athel tamarisk is not invasive, but it is a very fast grower when
young and can reach 60' tall with the same size canopy. The huge trunk and
branches can form a maze and the dense shade provides locals much needed relief
from the summer sun. I've come across many urban outdoorsmen who have found
respite in the shade of the Althel tamarisk.
{{picture of massive Althel tamarisk}} {{Zachs pic of leaves/flowers with pen}}
# Identification
*T. ramosissima* has very small overlapping scale-like leaves, similar to
juniper or cypress. You can barely see the leaves. When young they can have a
reddish twig. Salt cedars are deciduous but appear evergreen because of the very
small leaves. The flowers are in clusters and range from white to pink, they
have a small tuft of fuzz on the end which helps dispersal by wind. You can tell
this species apart from salt cedars because of the 5 toothed
[sepals](https://biologydictionary.net/sepal/).
{{NEED picture of leaves/twig}} {{NEED picture of flowers}}
The sturdy Athel tamarisk with its graceful and somewhat weeping habit is
noticeable from a distance. it is more common in less populated areas of the
city, where there is space for it to spread out. The bark of older trees is
deeply furrowed.
{{Zachs picture of trunk}}
Sources and further reading:
- [Invasive Species Summary Project -
Saltcedar](http://www.columbia.edu/itc/cerc/danoff-burg/invasion_bio/inv_spp_summ/Tamarix_ramosissima.html)
- [Virtural library of Phoenix Landscape Plants - Athel
tamarisk](http://www.public.asu.edu/~camartin/plants/Plant%20html%20files/tamarixaphylla.html)
- Michelle Cederborg, ["Which came first, the salt or the
saltcedar?"](http://www.coloradoriparian.org/which-came-first-the-salt-or-the-saltcedar/)
*Colorado Riparian Association* Web. Posted on April 20, 2008.
- Rudy Sookbirsingh et al. ["Salt Separation Processes in the Saltcedar *Tamarix
ramosissima*](https://www.tandfonline.com/doi/full/10.1080/00103621003734281?scroll=top&needAccess=true)
- *Communications in Soil Science and Plant Analysis* Posted May 20, 2010. 4322-
W.W. Thomson et al. ["LOCALIZATION AND SECRETION OF SALT BY THE SALT GLANDS OF
Tamarix aphylla"](https://www.ncbi.nlm.nih.gov/pmc/articles/PMC223566/) Proc
Natl Acad Sci U S A. 1969 Jun; 63(2): 310–317.
```
2017-10-15-yet-another-blog-attempt.md
```---
title: "Yet Another Blog Attempt"
date: 2017-10-16T20:55:23-07:00
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Web Programming
- Roguelike
- Hugo
---
Man, I really don't do a lot of work on this blog - maybe because I am **not** a web programmer but I can see when this blog does not look very
good.
Well, I officially gave up on web design. Yep! Turns out, I should probably leave that to the *professionals*. Oh, and I also decided to heck with
Jekyll. It was cool, and worked well - but searching for a premade Jekyll theme was a chore. Not to mention getting all the silly ruby nonsense to work.
Even tried playing around with Ruby and seeing what all the fuss was about. No thanks.
Stumbled upon Hu(go) - another static blog generator. Well, Hu(go) is blazingly fast, and has a ton of cool features that you don't have to even
try hard to get to work. Not to mention the themes are easily searched through, easily switched, easily customized/expanded, and look darn good.
So, for now, this is what the blog will look like - A theme called [Hemmingway](https://github.com/tanksuzuki/hemingway) powered by [Hugo](https://gohugo.io).
I also caved and signed up for Disqus, to handle comments. It really is so much easier using premade tools, haha.
--
In other news, I continued the process of learning C++ by programming in C++ and made a bit of progress on my rougelike attempt. I had a revelation
while working one day about how the "engine" should be structured: Everything manages its own shit and nothing else. No exceptions. But, you ask, how
will my keypresses to move the player work? Wouldn't the game engine have to interpret those key presses and then tell the game state to move the player,
and then the player respond with...
No. Doing that causes all sorts of crazy dependencies and connections that do not have to exist.
My solution?
* Engine manages a stack of states. It doesn't really know what a state is, just that it has them, and that it can add states to itself and remove states from
itself. The engine is responsible for interacting with the computer and reading user input.
* Each state manages a stack of windows. Again, the state doesn't know or care what a window contains, but is responsible for drawing the window in the correct
spot on the screen and adding/removing windows as needed.
* Each window contains a grid of cells that can contain a glyph (character, with a foreground/background color). Windows are responsible for interpreting user
input. A game window might contain a world (that has locations which has actors which have actions).
Brilliant! Extraordinary! Very minimal multitasking! But wait - from the description above each component has to interact with the others. How that is accomplished
is another fun thing: messages.
Imagine a mailcart. Like, a literal cart that has a bunch of mail. Now, each component recieves the mailcart, looks for letters addressed to it, and then passes
it on to the next component. The `update` routine now does exactly that.
So the major difference is that instead of each component directly influencing another, they now interact only through messages. Now, the engine could care less
what pressing `>` does, it just generates a message saying "Hey, this key was pressed" and sticks it in the mailcart. The state doesn't care about that message,
so whatever, sticks it back in the mailcart. The active window pulls that out of the mailcart and decides that pressing that means the player needs to move down
a flight of stairs. The window generates a message saying "Hey player, move downstairs" and puts that message in the cart. When the cart gets to the player,
the player checks to see if it is standing on stairs and if so moves down them.
Previously this would have been handled by something like
{{< highlight cpp >}}
states_[activeState]->window_[activeWindow]->world_->locations[world_->currentLocationID]->player->moveDownstairs();
{{< / highlight >}}
Yuck. Lets replace that with:
{{< highlight cpp >}}
Engine::HandleEvents()
{
...
mailbox_->push_back(Message::toState(Command::Keypress, '>');
...
}
GameWindow::ProcessMessage()
{
...
mailbox_->push_back(Message::toPlayer(Command::MoveDownStairs));
...
}
{{< / highlight >}}
Much, much more readable and less prone to accidentally breaking. So each component during the update routine recieves the mail cart, looks through each message,
processes each one that is addressed to it, and passes the mail cart to the next component.
A cool side effect of doing things this way is that you don't have to worry about the timing of events at every step! Each component determines the order and
priority of each message. To hell with micromanaging!
The best part of all this was it made working with the UI so much simpler. An inventory window could read a keypress as a selection of a certain item, the game window could read the same keypress as an action! Opening and closing windows becomes a simple manner of sending a message to the State! Its simple and quick - especially
because the only game entity that will interpret messages is the player. Everything else can generate messages, but has no need for intrepreting them.
So, I made yet another little demo to test all this out, and it worked. Flawlessly. Now, I'm beginning work rewriting the engine to use SFML (again) instead of SDL.
I learned a lot from SDL, but also feel like I have no idea what I'm doing and that there has to be a more efficient way. Conviently, since everything is decoupled
so nicely this isn't really a big deal to switch frameworks. I've also been polishing and cleaning up some of the code, and thinking about the next project: managing
locations and travel? AI? Better dungeons?
```
2016-07-15-fun-with-dijkstra-mapping.md
```---
title: "Fun With Dijkstra Mapping"
date: 2016-07-15 08:29:06 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- AI
---
Continuing in my never-ending project to make a "simple" roguelike in C++, I decided to tackle something I have never before tried: artificial intelligence. My first rough idea was to implement some sort of component-type system, and build the AI up like I built up entities. This turned out to be far too complicated, and even getting a monster to move randomly was a chore. Obviously, this wasn't going to work.
After browsing [/r/roguelikedev](http://www.reddit.com/r/roguelikedev) and [RogueBasin](http://www.roguebasin.com/) I came across a few articles on "need driven AI" - an absurdly cool concept, and so (seemingly) simple to implement I wasn't sure how I didn't stumble across this earlier. Basically, creatures in the game assign a value to things they know about (treasure, the player, exits, other monsters they are friendly with, other monsters they are terrified of, etc. etc.) and make an 'informed' decision about where to move next. A monster could desire killing the player over treasure, and would "decide" to move towards the player instead of a closer pile of gold. Maybe that monster is a pack hunter, and also strongly desires to be near it's pack - so when singled out it moves away to regroup with others. Cats could hunt mice, the undead could wander aimlessly attacking anything, golems could guard exits, archers could stay a safe distance away, and
...
Clearly, this idea has so many uses that I absolutely **had** to attempt an implementation in my game. The best [article](http://www.roguebasin.com/index.php?title=The_Incredible_Power_of_Dijkstra_Maps) I found describing what I hope to accomplish was written by the creator of the awesome Brogue, and talked about something called "Dijkstra mapping." A number on a Dijkstra map is the shortest distance from that tile to the goal. Moving from any numbered tile to any lower numbered tile adjacent will take you on the shortest path to the goal. Using this technique I could also accomplish intelligent pathfinding (another thing I've never been quite able to do on my own). So, the first step was to write up something to generate these maps.
After much confusion (I'm still not much of a C++ programmer), I ended up with a fairly simple and straightforward set of code to generate a vector of integers representing a Dijkstra map from the vector of integers representing a normal dungeon map.
_As an aside, I previously determined that a vector of integers is my favorite way of representing a 2 dimensional map. The x,y coordinates can be mathematically used to determine the index of the vector if the width or height of the map is known. A simple enumeration in my map generator class assigns each number to a tile type, making it easy to say "There is a wall at (32,16), and a floor at (5,5)."_
The result (displayed on a Cartesian grid with the goal marked in red) looked like this:
{{< highlight cpp >}}
28 27 26 25 23 22 21 20 19 18 19 20 21 22
27 26 25 24 22 21 20 19 18 17 18 19 20 21 38 37 36 35 34 33 32 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48
26 25 24 23 22 21 20 19 18 17 16 17 18 19 20 30 32 33 34 35 36 37 38 39 40 41 48
27 26 25 24 20 19 18 17 16 15 16 17 18 19 36 35 34 33 32 31 30 29 28 29 30 31 32 33 34 35 36 37 38 39 40 51 50 49 50
42 41 40 39 38 28 19 18 17 16 15 14 15 16 17 18 28 27 28 32 33 34 35 36 37 38 39 40 41 52 51 50 51
41 40 39 38 37 31 30 29 30 13 27 26 27 33 34 35 36 37 38 39 40 41 42 53 52 51 52
40 39 38 37 36 32 31 30 31 32 33 13 12 11 10 11 12 26 25 26
39 38 37 36 35 34 33 32 31 32 34 16 15 14 13 12 11 10 9 10 11 25 24 25 29 30 31 32 34 35 36 37 38 39 40
40 39 38 37 36 35 11 10 9 8 9 10 23 28 29 30 31 33 34 35 36 37 38 39
41 40 39 38 37 36 10 9 8 7 8 9 10 11 12 13 14 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
41 6 16 17 18 19 20 21 22 23 24 28 29 30 31 33 34 35 36 37 38 39
45 44 43 42 43 44 63 5 4 3 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 29 30 31 32
46 45 44 43 44 45 62 4 3 2 1 2 3 4 5 7 8 9 10 11 12 16 17 18 19 20 21 22 23 24
47 46 45 44 45 46 61 3 2 1 _@_ 1 2 3 4 5 6 7 8 9 10 11 20
59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 46 47 60 4 3 2 1 2 3 4 5 7 8 9 10 11 12 22 21 22
59 49 48 47 46 47 48 59 5 4 3 2 3 4 5 6 23 22 23
61 60 61 48 58 6 24 23 24
62 61 62 56 55 54 53 52 51 50 49 50 51 52 53 57 11 10 9 8 7 8 9 10 25 24 25
63 62 63 57 55 54 53 52 51 50 51 52 53 54 55 56 12 11 10 9 8 9 10 11 26 25 26 30 31 32 33 34 35 36 37 38 39
64 63 64 58 56 55 54 53 52 51 52 53 54 55 13 12 11 10 9 10 11 12 29 28 27 26 27 28 29 30 31 32 33 34 35 36 37 38
65 64 65 59 14 13 12 11 10 11 12 13 30 28 27 28 30 31 32 33 34 35 36 37 38 39
66 60 15 14 13 12 11 12 13 14 31
70 69 68 67 68 69 70 61 16 15 14 13 12 13 14 15
71 70 69 68 69 70 71 62 17 16 15 14 13 14 15 16
72 71 70 69 70 71 72 63 18 17 16 15 14 15 16 17
64 19 18 17 16 15 16 17 18
{{< / highlight >}}
Neat right?? Here's the code.
{{< highlight cpp >}}
#pragma once
#ifndef WSL_DIJKSTRA_HPP
#define WSL_DIJKSTRA_HPP
#include <vector>
#include <algorithm> // std::min_element
#include <iterator> // std::begin, std::end
#include "wsl_wvec.hpp"
namespace wsl
{
struct DijkstraMap
{
std::vector<int> map;
int mapWidth;
int mapHeight;
DijkstraMap() { }
};
DijkstraMap generateDijkstra(std::vector<int> inputMap, int w, int h, std::vector< WVec2<int> > goals);
DijkstraMap generateDijkstra(std::vector<int> inputMap, int w, int h, WVec2<int> goal);
DijkstraMap generateDijkstraSafety(std::vector<int> inputMap, int w, int h, std::vector< WVec2<int> > goals);
DijkstraMap generateDijkstraSafety(std::vector<int> inputMap, int w, int h, WVec2<int> goal);
void scanDijkstra(DijkstraMap & inputMap);
int getDijkstraIndex(int w, int x, int y);
int getDijkstraIndex(DijkstraMap & inputMap, int x, int y);
int getDijkstraIndex(DijkstraMap & inputMap, WVec2<int> pos);
int getDijkstraIndex(WVec2<int> dim, int x, int y);
int getDijkstraIndex(WVec2<int> dim, WVec2<int> pos);
} // namespace wsl
#endif // WSL_DIJKSTRA
{{< / highlight >}}
{{< highlight cpp >}}
#include "wsl_dijkstra.hpp"
#include <iostream>
namespace wsl
{
/*
* These two functions take an input, generally generated by one of the map functions (IE: wsl::RLDungeon) with passable tiles set to a high number,
* and not passable tiles (IE: walls, pits, etc) set to exactly 999. The width and height of the map are also passed, and another function could be
* added to pass in a specific dungeon type... but I felt it was unnecessary. The goal/goals are passed as 2 dimensional vectors (WVec2).
*
*/
DijkstraMap generateDijkstra(std::vector<int> inputMap, int w, int h, std::vector< WVec2<int> > goals)
{
DijkstraMap resultMap;
resultMap.map = inputMap;
resultMap.mapWidth = w;
resultMap.mapHeight = h;
for(int i = 0; i < goals.size(); ++i)
{
resultMap.map[getDijkstraIndex(resultMap, goals[i])] = 0;
}
scanDijkstra(resultMap);
return resultMap;
}
DijkstraMap generateDijkstra(std::vector<int> inputMap, int w, int h, WVec2<int> goal)
{
std::vector< WVec2<int> > goals;
goals.push_back(goal);
return generateDijkstra(inputMap, w, h, goals);
}
/*
* Safety maps are a neat way to invert the Dijkstra maps, so that moving to lower numbers on the map will take you AWAY from the goal.
*/
DijkstraMap generateDijkstraSafety(std::vector<int> inputMap, int w, int h, std::vector< WVec2<int> > goals)
{
DijkstraMap resultMap = generateDijkstra(inputMap, w, h, goals);
for(int i = 0; i < resultMap.map.size(); ++i)
{
if(resultMap.map[i] == 999)
{
continue;
}
resultMap.map[i] *= -7;
resultMap.map[i] /= 5;
}
scanDijkstra(resultMap);
return resultMap;
}
DijkstraMap generateDijkstraSafety(std::vector<int> inputMap, int w, int h, WVec2<int> goal)
{
std::vector< WVec2<int> > goals;
goals.push_back(goal);
return generateDijkstraSafety(inputMap, w, h, goals);
}
/*
* The scanning function, the iteration through the map tiles could most likely be improved/sped up, but this was the simplest way to do it.
* The function takes a reference to a DijkstraMap, and modifies it directly.
*/
void scanDijkstra(DijkstraMap & inputMap)
{
int impassable = 0;
int passable = 0;
int changes = 0;
std::vector< wsl::WVec2<int> > passableCoords;
for (int y = 0; y < inputMap.mapHeight; ++y)
{
for (int x = 0; x < inputMap.mapWidth; ++x)
{
int index = getDijkstraIndex(inputMap, x, y);
if(inputMap.map[index] == 999)
{
impassable++;
continue;
}
else
{
passable++;
passableCoords.push_back(wsl::WVec2<int>(x, y));
}
}
}
std::vector<bool> visited;
int target = passableCoords.size();
visited.assign(passableCoords.size(), false);
bool madeChange = true;
while(madeChange)
{
madeChange = false;
for(int j = 0; j < passableCoords.size(); ++j)
{
if(visited[j])
{
continue;
}
int x = passableCoords[j].x;
int y = passableCoords[j].y;
std::vector<int> minMaxVector;
if(getDijkstraIndex(inputMap, x, y-1) > 0)
{
minMaxVector.push_back(inputMap.map[getDijkstraIndex(inputMap, x, y-1)]);
}
if(getDijkstraIndex(inputMap, x, y+1) > 0)
{
minMaxVector.push_back(inputMap.map[getDijkstraIndex(inputMap, x, y+1)]);
}
if(getDijkstraIndex(inputMap, x-1, y) > 0);
{
minMaxVector.push_back(inputMap.map[getDijkstraIndex(inputMap, x-1, y)]);
}
if(getDijkstraIndex(inputMap, x+1, y) > 0)
{
minMaxVector.push_back(inputMap.map[getDijkstraIndex(inputMap, x+1, y)]);
}
int minimum = *(std::min_element(std::begin(minMaxVector), std::end(minMaxVector)));
int index = getDijkstraIndex(inputMap, x, y);
if((inputMap.map[index]) > (2 * minimum))
{
inputMap.map[index] = 1 + minimum;
changes++;
madeChange = true;
visited[j] = true;
}
}
}
//if(changes != passableCoords.size())
//{
// std::cout << "Changes do not equal passableCoords.size(): " << changes << " vs " << passableCoords.size() << std::endl;
//}
}
/*
* The getIndex functions will tell you the index of the DijkstraMap.map vector given an x,y coordinate.
*/
int getDijkstraIndex(int w, int x, int y)
{
int index = (x + (w * y));
if (index < 0)
{
return -1; //Error, no tile found (necessary otherwise it could point to an item in the vector from the end)
}
return index;
}
int getDijkstraIndex(DijkstraMap & inputMap, int x, int y)
{
return getDijkstraIndex(inputMap.mapWidth, x, y);
}
int getDijkstraIndex(DijkstraMap & inputMap, WVec2<int> pos)
{
return getDijkstraIndex(inputMap.mapWidth, pos.x, pos.y);
}
int getDijkstraIndex(WVec2<int> dim, int x, int y)
{
return getDijkstraIndex(dim.x, x, y);
}
int getDijkstraIndex(WVec2<int> dim, WVec2<int> pos)
{
return getDijkstraIndex(dim.x, pos.x, pos.y);
}
} // namespace wsl
{{< / highlight >}}
So it isn't perfect - I'm sure the iteration through the map cells could be optimized to run differently, and I'm not sure about making DijkstraMap a struct instead of a class. I originally tried this with a class, but the class seemed bulky and awkward to shove in to my game logic. Really, all the map should be is a vector of integers, and the only thing it needs to know about itself is the width/height of the map. Keeping the Dijkstra functions open and accessible means that they can be used anywhere, for really any reason.
From here, I decided to see just how 'easily' the maps could be used to implement things like auto-exploration of the map - turns out, it was INCREDIBLY easy. Instead of setting just one goal before generating the map, setting the goal to any unexplored area will cause the player to take the shortest possible route across the map to explore every single tile. Once all the tiles are explored, the goal is changed to the downward staircase, and the player paths quickly there.
And here's a video of the auto-explore in action (I accidently forgot about the cursor when I started recording the screen...):
{{< fancybox_mv src="AutoExplore.mp4" tag="Auto Explore Video" >}}
The next project will be actually using this in the game AI, and adding a 'desire' component for each monster. Of course, this might also be a good time to implement a time/turn tracking system... Or a health system...
```
about.md
```---
title: About Wsl
---
## Who are you?
Well, I am just some guy with a computer and some free time - and I spend that
free time making things, exploring places, and "entertaining" family and
coworkers with stories.
Professionally, I work as a consulting utility forester, and am the area safety
representative for a large group of people over 5 states in the western US. I am
an ISA Certified Arborist, with (the majority of) my degree in Ecology from the
University of Arizona, and I am a veteran of the US Navy.
## What is "Wsl"?
It's short for "weasel". Most of my ideas began as inspiration gained from watching too many cartoons, this one was from Cow and Chicken. I've used it as
an abbreviation in my code for years now, prefacing classes and objects with it. Also, hilariously, it's the abbreviation for the World Surf League - which I am 100% not affiliated with, unless they want to hook me up with a t-shirt featuring a surfing mustelid or something.
## Who built this site? How?
I'm a hobbyist programmer, and have been messing around with various little
programming projects since I was a kid borrowing books on C programming from the
local library. I think I originally started programming because as a kid I had
no way of actually buying computer games, and figured "heck, I could make
something myself!"
I built this site, using [Hugo](https://gohugo.io), a fantastic static blog
generator. The theme is a heavily modified version of
[XMin](https://github.com/yihui/hugo-xmin). The lightbox code for the images is
provided by [Fancybox](https://github.com/fancyapps/fancybox). The source for
the site is posted on [GitHub](https://github.com/zwilder/WSL_Blog). I do all my
work on an old laptop or a computer I built running [Arch
Linux](https://www.archlinux.org/), writing everything in
[Vim](https://www.vim.org). If anything is broken on the site and needs fixing
please don't hesitate to [email me](mailto:z@wsl-blog.com)!
```
2018-07-02-The-Roguelike-Tutorial-Week3.md
```---
title: "The Roguelike Tutorial - Week 3a"
date: 2018-07-02T08:00:00-07:00
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
- Barbarian!
assets: "2018-07-02"
---
I decided to split the third week into two separate posts so that I wouldn't ramble on as long as last week. Over the past week I continued fighting the BSP dungeon
generator I had attempted to write the week prior, and gave up again. I'll probably revisit the dungeon generator later, and will definitely write something about
whatever I end up doing. The artificial deadlines imposed by following along with the rest of [r/roguelikedev](https://reddit.com/r/roguelikedev/) really helps
motivate me to call something "good enough" and move on... Heck, I think I could be satisfied just tinkering with dungeon generators and never moving on to actually
making this a playable game!
I did some [reading on writing clean C++ by google](https://sites.google.com/a/chromium.org/dev/developers/coding-style/cpp-dos-and-donts), which prompted me to take
another look at the code I've already written. The big thing I gleaned from the Google article was to avoid "in-lining" things in headers, and put most of the
code in the implementation. This is something I **thought** I did already, but apparently using non-trivial types inline in headers is bad for performance. This means
stuff like this is OK:
{{< highlight cpp >}}
class Foo
{
public:
...
const int & count() { return count_; }
...
private:
int count_;
};
{{< / highlight >}}
However, doing this is not:
{{< highlight cpp >}}
class Bar
{
public:
...
Foo badFunc() { return data_; }
...
private:
Foo data_;
};
{{< / highlight >}}
Along the same lines, Google recommends not to inline constructors/destructors with non-trivial types. This is something I did in almost every header file in the
game! Fortunately, since this program is still relatively small, the changes to my code were easy enough to implement.
So the first challenge for this week was to implement a "field of view" for our dungeon delving barbarian. Two options I considered for this were following along with
the original Rogue or using Bresenham's line drawing algorithm. The original Rogue showed the entirety of whichever room the player was in, and kept track of explored
areas. Field of view using line drawing basically illuminates a radius around the player, while intelligently stopping sight from passing through walls and other
obstructions. I decided to go with the second option for [part 4](http://rogueliketutorials.com/libtcod/4).
## Bresenham's Line Drawing
The [original algorithm](https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm) was written in 1962, as a punch card program, to draw lines. Since the game
space is a Cartesian grid, we can "draw" lines using this algorithm from the player to represent how far the player can see. The end point of the line is the player's
Field of View radius. The only modification to the original algorithm is that we need to terminate the line drawing early if an object is in the way and blocks sight.
My adaptation is straightforward, and probably a bit verbose - I think that any extremely minor speed possibly lost is well worth it for the readability.
The line drawing function takes a pointer to a vector of coordinates to store the results, and a pointer to the map to check if the tiles block light. The original
map and results vector are owned by `Engine` and stored there. Also, I apologize for the abstract variable names - `xO,yO` are the x,y coordinates of the origin,
`xF,yF` are the final coordinates, `i,j` are the test coordinates for each point.
{{< highlight cpp >}}
void bhline(int xO, int yO, int xF, int yF, std::vector<wsl::Vector2i> * results, GameMap * map)
{
int dX = abs(xF - xO);
int dY = abs(yF - yO);
if(dX >= dY)
{
int e = dY - dX; // [e]rror
int j = yO;
if(xO < xF)
{
// Octants 1,2
for(int i = xO; i <= xF; ++i)
{
add(results, wsl::Vector2i(i,j));
if(map->tiles[map->index(i,j)].blocksLight())
{
break;
}
if((e >= 0) && (yF >= yO))
{
// 1
j += 1;
e -= dX;
}
else if((e >= 0) && (yF < yO))
{
// 2
j -= 1;
e -= dX;
}
e += dY;
}
}
else if(xO > xF)
{
// Octants 5,6
for(int i = xO; i >= xF; --i)
{
add(results, wsl::Vector2i(i, j));
if(map->tiles[map->index(i,j)].blocksLight())
{
break;
}
if((e >= 0) && (yF >= yO))
{
// 6
j += 1;
e -= dX;
}
else if((e >= 0) && (yF < yO))
{
// 5
j -= 1;
e -= dX;
}
e += dY;
}
}
}
else if (dX < dY)
{
int e = dX - dY; // [e]rror
int i = xO;
if(yO < yF)
{
// Octants 7,8
for(int j = yO; j <= yF; ++j)
{
add(results, wsl::Vector2i(i,j));
if(map->tiles[map->index(i,j)].blocksLight())
{
break;
}
if((e >= 0) && (xF >= xO))
{
// 8
i += 1;
e -= dY;
}
else if((e >= 0) && (xF < xO))
{
// 7
i -= 1;
e -= dY;
}
e += dX;
}
}
else if(yO > yF)
{
// Octants 3,4
for(int j = yO; j >= yF; --j)
{
add(results, wsl::Vector2i(i,j));
if(map->tiles[map->index(i,j)].blocksLight())
{
break;
}
if((e >= 0) && (xF >= xO))
{
// 3
i += 1;
e -= dY;
}
else if((e >= 0) && (xF < xO))
{
// 4
i -= 1;
e -= dY;
}
e += dX;
}
}
}
}
{{< / highlight >}}
One of the things that tripped me up in this adaptation was if `dX == dY` what happens? Well, originally the program just ignored it, which left
some interesting diagonal gaps in the corners of our hero's vision. Not really ideal when danger could be lurking around any corner! I'm not entirely sure that
I fixed this, but setting `dX >= dY` in the first conditional appeared to fix it without making anything implode. The other pitfall was figuring out where to
terminate the loop when the line encounters a tile that blocks light. Breaking the loop before adding the coordinates to the results causes walls to NEVER be visible.
Which, could work as a style choice if that's what you're going for, I guess. Breaking the loop as the very last thing after incrementing the error appeared fine at
first, but then the loop terminates too early in some cases, resulting in weird gaps (such as in corners of rooms). Through trial and error and brute force it seems
that the correct answer is to terminate right after adding the tile to the results.
After all that - here's a couple of videos!
The first video highlights the visible cells a nice light yellow color, and then shows the explored cells.
{{< fancybox_mv src="FoV_highlight.mp4" >}}
The next video shows the results without doing anything fancy, just showing explored tiles. I think this actually looks and reads better than highlighting the
"visible" cells.
{{< fancybox_mv src="FoV.mp4" >}}
After a bit of tweaking, ending up somewhere in the middle of the two previous videos ends up with this:
{{< fancybox_mv src="FoV_final.mp4" >}}
Also, you might have noticed that the range of vision looks more round in the last video - I was calculating vision as a rectangle around the player, and changed
to a circle between the two videos. Also, in addition to changing the background of the lit cells to a light yellow, I changed the foreground to a dark grey, and
removed the highlight from the walls in the visible range. A fun idea for later is to keep track of the players turn's and treat this vision radius as a torch radius
that decreases as the game moves on...
Some more tweaking, and color adjustments yields:
{{< fancybox_mv src="FoV_final2.mp4" >}}
---
The tutorial dungeon actually ends up being pretty nice to explore, and looks a bit less chaotic when not everything is visible. I'll probably continue tinkering with
the results of the FoV algorithm - as is, the player might see enemies 'randomly appear' in large rooms when the vision range of the player doesn't extend all the way
to the walls. I'm not sure if this is really cool or not yet. Speaking of enemies, this dungeon is getting a little lonely! Time to start working on some
adversaries...
Here is the source code for [Part 4](https://github.com/zwilder/Barbarian/tree/Part_4)!
```
2018-08-26-Lists.md
```---
title: "Wonderful Lists"
date: 2018-08-26 15:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Barbarian!
- Roguelike
- Tutorials
---
Over the course of the [2018 r/roguelikedev Tutorial Tuesday
Challenge](https://www.reddit.com/r/roguelikedev/wiki/python_tutorial_series)
I decided to invest some time learning some fundamental programming
concepts that I probably should have learned years ago. The fun (and
challenging) part of being a hobby programmer is that most of my
learning comes from books, and then random tutorials on the internet.
Somewhere in the course of my "education" I never learned about basic
data structures and how they can be used.
Around week three of the challenge I decided to implement a scheduling
system for Barbarian - which led me to learn about creating lists and
priority queues. STL has `std::priority_queue`, but like many STL
classes never seems to want to play nicely with my code. Again, likely a
byproduct of me learning C++ from a book and probably not the fault of
STL.
This is my very first attempt at writing a tutorial - expect some errors
and feel free to comment with any corrections. I will absolutely
guarantee that there is probably a better way of doing what I've written
here, so don't read this as gospel.
## Making a List
A list is a fantastic data structure - and is so simple
to implement I'm not sure why it was never included in the beginning
programming books I have read. A list is an ordered collection of
nodes, where each node has some data and a pointer to the next node. The
list has a head and a tail - the very first and very last nodes in the
list. That's it! That's all they are.
{{< highlight txt >}}
Head
A ---> B ---> C <- Node
1 2 3 <- Data
Tail
{{< / highlight >}}
Definining a node is simple, and using the power of C++ templates you
can make a node hold any data you can imagine!
{{< highlight cpp >}}
template <typename T>
class Node
{
public:
Node(T d) : data(d) { next = NULL; prev = NULL; }
T data;
Node * next;
Node * prev;
};
{{< / highlight >}}
Then to create the list all we need is a couple of functions - one to
add nodes and one to remove nodes.
{{< highlight cpp >}}
template <typename T>
class List
{
public:
List(); // Default constructor
List(T data); // Alternate constructor
List(const List<T> & other); // Copy constructor
List<T> operator =(const List<T> & other) // Copy assignment using copy/swap idiom
{
swap(*this, other);
return *this;
}
friend void swap(List<T> & first, List<T> & other)
{
List<T> * temp = first.head;
first.head = other.head;
other.head = temp;
}
~List(); // Custom destructor
void push(T data); // Add a node
T pop(); // Remove head
Node<T> * head;
};
{{< / highlight >}}
Now, the definition of `List<T>` has a copy constructor, copy
assignment, and custom destructor following the C++ rule of 0/3/5 - yet
another very important thing that seemed to be glossed over or missed in
the books I read. Basically, it's a good idea if you have to assign
memory (or use smart pointers) to have a custom destructor to make sure
that memory is freed appropriately. If you have a custom destructor,
the program needs a way to make a copy of your object from another
object and a way to figure out what `ListA = ListB` means. The
constructors look something like the following.
{{< highlight cpp >}}
template <typename T>
List<T>::List()
{
// Create an empty list
head = NULL;
}
template <typename T>
List<T>::List(T data)
{
// Create a list, with T data
push(data);
}
template <typename T>
List<T>::List(const List<T> & other)
{
// Copy constructor
// Iterate through the other list, adding that list's data to this list
for(Node<T> * node = other.head; node != NULL; node = node->next)
{
push(node->data);
}
}
{{< / highlight >}}
Easy enough! One cool thing to notice here is the way we iterate through
the list. The `for` loop is initialized by creating a `Node<T> *`
variable that is initialized to the head of the list, and while that
variable does not equal `NULL` we execute the following and then set the
variable to the next node.
The destructor loops through the list in a slightly different way,
removing nodes as it goes.
{{< highlight cpp >}}
template <typename T>
List<T>::~List()
{
Node<T> * node = head;
Node<T> * next;
while(node != NULL)
{
next = node->next;
delete node;
node = next;
}
}
{{< / highlight >}}
With all that settled, all that's left is adding the functions to add
and remove nodes from the list!
{{< highlight cpp >}}
template <typename T>
void List<T>::push(T data)
{
Node<T> * newNode = new Node<T>(data);
if(head != NULL)
{
newNode->next = head;
head->prev = newNode;
}
head = newNode;
}
template <typename T>
T List<T>::pop()
{
T result = T();
if(head) // if head is NULL this returns false, same as 'head != NULL'
{
result = head->data; // Get result
Node<T> * temp = head; // Store a pointer to the current (old) list head
head = head->next; // Set the list head to the next item
head->prev = NULL; // The head has no previous node
delete temp; // Delete the old list head
}
return result;
}
{{< / highlight >}}
Again, nothing too complicated - and that's all that's needed for a
basic list! As is, however, this list is not very useful... so lets add
a couple of more functions! (Don't forget to add the declarations in the
class definition)
{{< highlight cpp >}}
// It's pretty common to want to remove a specific node from the list,
// here's an idea of how that can be accomplished:
template <typename T>
void List<T>::remove(Node<T> * node)
{
// If for some silly reason this function is called with NULL
// this prevents an annoying segfault.
if(!node) return;
if(!head) return; // If there's nothing in the list, we can't remove a node from it
if(head == node)
{
// If we delete the head, we need to set the head to the next item in the list
head = node->next;
if(head) head->prev = NULL; // If head still exists, it has no previous node
}
if(node->next != NULL)
{
// The next item's previous has to point to this item's previous
// Eg: A->B->C
// Remove B, so C's previous has to be A
node->next->prev = node->prev;
}
if(node->prev != NULL)
{
// The previous item's next has to point to this item's next
// Eg:: A->B->C
// Remove B, so A's next has to be C
node->prev->next = node->next;
}
delete node;
}
// A few other common things that are pretty useful
// and simple to implement:
// - Determining the size of a list
// - Determining if the list is empty
// - Getting a specific item from a list
template <typename T>
int List<T>::size()
{
int result = 0;
for(Node<T> * node = head; node != NULL; node = node->next)
{
result++;
}
return result;
}
template <typename T>
bool List<T>::isEmpty()
{
return (head == NULL);
}
template <typename T>
Node<T> * List<T>::at(int index)
{
Node<T> * result = NULL;
int count = 0;
for(Node<T> * node = head; node != NULL; node = node->next)
{
if(count == index)
{
result = node;
break;
}
++count;
}
return result;
}
{{< / highlight >}}
With those additions you now have a nice, full featured, doubly-linked
list! You could easily change this into a circular list by making the
head node's previous point to the tail, and the tail's next point to the
head. All you would need to do is add in a function to find the tail
(ie: iterate through list, return the last node).
## How Barbarian! Uses Lists
Since learning about lists and writing a few different implementations,
I obviously tried to find any place in the code where a list would be
useful. The engine runs through a standard Events-Update-Draw loop, and
during each of these functions it's necessary to run through a list of
entities. This was stored in a `std::vector<Entity>`, but one of the
(many) shortcomings of the STL vector is that it can't arbitrarily
remove items. What happens when an entity dies? Do we just create a
whole new vector for the engine's entity list? Heck no. Using a doubly
linked list like the one above it's a simple matter to cull the entity
list of dead entities.
Another very useful place that Barbarian uses lists is in path finding -
making a list into a priority queue is a simple matter of adding a
'priority' to a node, then when pushing a new node onto the stack making
sure to add the node in the correct place according to it's priority.
Greedy breadth first search, Dijkstra, and A-star path finding all use a
priority queue.
Entity and item placement use weighted lists, which is a list whose
nodes have a weight and has a function to pick a random piece of data
from a node.
{{< highlight cpp >}}
template <typename T>
T WList<T>::pick(RNGState * rng)
{
T result = T();
int totalWt = 0;
for(WNode<T> * node = head_; node != NULL; node = node->next)
{
totalWt += node->weight;
}
int choiceWt = randomInt(0, totalWt, rng);
int runningWt = 0;
for(WNode<T> * node = head_; node != NULL; node = node->next)
{
if(runningWt + node->weight >= choiceWt)
{
result = node->data;
break;
}
runningWt += node->weight;
}
return result;
}
{{< / highlight >}}
The scheduling/time management system uses a list - it's not currently
used in the game, but the functionality is there. Basically, every time
the game updates, entities are granted some energy. When they pass a
certain energy threshold they get put on a list. Then, the game makes
sure that each entity on that list gets to take a turn before granting
energy to any other entity.
The inventory component of an entity is another great place for a list -
and one of the places where a STL vector would only work with a bunch of
trade-offs and mashing square pegs into round holes. The player has to
be able to pick up and add items to their inventory, and remove
arbitrary items by using or dropping. Using a list makes those things
easier. Heck, a priority queue could be used with each category of item
at a different priority to easily sort the inventory screen (and to be
honest, I literally just thought of that while typing this post -
definitely adding that to the 'to-do' pile).
Anywhere in the game where I need a collection of something, I try and
use a list. The fun part about that is that I've ran into times where my
list class doesn't have some functionality that I want - but it's a
piece of cake to add it.
The game map (and virtual console) could be stored as a list as well,
since it's currently stored as a one dimensional vector. Assuming a
Cartesian grid, the `(x,y)` coordinates correspond to the index of a
list by `x + (y * width)` - `map->at(x + (y*width))` for example, or if
using a simple array `map[x+(y*width)]`. I have not changed Barbarian to
use lists in this manner, but I see no reason why it would not work. The
great part about these lists is that they manage their own memory like a
STL vector but have more useful functionality.
Barbarian is a turn based game, and does not need to run at break neck
speeds and efficiency - I have no idea how these lists compare in speed
to STL offerings. They work quickly and efficiently enough on my older
hardware, so with modern systems they would work just as well.
---
Hopefully this gives an idea of how neat this simple little data
structure can be. Give them a try! See how they work in your own
project, at the very least you'll learn something useful and have the
satisfaction of having built an incredibly useful tool yourself.
```
wishlist.md
```---
title: Wishlist
---
Some websites, for some strange reason, don't let you share your wishlists from them. I created this page to have a quick wishlist for a couple of sites I love ordering from.
### From [ripstopbytheroll.com](https://www.ripstopbytheroll.com):
| Item | Quantity | Price | Description |
| :---- | :---: | :---: | :---: | ----: |
| [550 Paracord (black) 50' length](https://ripstopbytheroll.com/collections/non-spliceable-cordage/products/sterling-rope-550-type-iii-paracord-50?variant=16527203713) | 1 | $6.25/ea | Used for all sorts of stuff |
| [1/8" Amsteel (any color) 25' length](https://ripstopbytheroll.com/collections/spliceable-cordage/products/amsteel?variant=5208778497) | 2 | $7.25/ea | Hammock (gathered end, woopie slings) |
| [Posi-grip cordlock (dozen)](https://ripstopbytheroll.com/products/posi-grip-cordlock?variant=3975161025) | 1 | $3.20 | Drawstring locks, very useful |
| [#5 YKK Coil Zipper 1'](https://ripstopbytheroll.com/collections/coil-zipper/products/ykk-coil-zipper?variant=19657037249) | 25 | $0.45/ft | I love zippers |
| [#3 YKK Coil Zipper 1'](https://ripstopbytheroll.com/collections/coil-zipper/products/ykk-coil-zipper?variant=5975308673) | 25 | $0.35/ft | I've never used little zippers, but seems useful! |
| [#3 YKK Coil Slider Standard Single](https://ripstopbytheroll.com/collections/coil-sliders/products/ykk-coil-slider?variant=19657479041) | 24 | $0.25/ea | Little zipper pulls for little zippers |
| [1" Polyester Webbing (Black) 25' length](https://ripstopbytheroll.com/collections/webbing/products/1-polyester-webbing-1500-lbs-black) | 1 | $7.25 each | Used for all sorts of stuff |
| [Gutermann Mara 70 Thread (Black, lime green/spectra yellow (match silpoly below))](https://ripstopbytheroll.com/collections/thread-tools-repair/products/gutermann-mara-70?variant=1072513937) | 1 | $3.60 | Good strong thread |
| [420D Robic Ripstop Nylon (Foliage) .5 yard](https://ripstopbytheroll.com/collections/robic/products/420d-robic?variant=18632565249) | 2 | $6.00/.5yd | Strong pack fabric, a full yard can make a full pack |
| [1.1oz Silpoly (Neon Green, Blaze Yellow) yard](https://ripstopbytheroll.com/collections/tarp-shelter-fabric/products/1-1-oz-silpoly?variant=29271267981) | 7 | 5.25/yd | Waterproof, windproof fabric for tents/tarps. 7yds makes one tarp, with extra |
### From [seattlefabrics.com](https://www.seattlefabrics.com):
| Item | Quantity | Price | Description |
| :---- | :---: | :---: | :---: | ----: |
| [GP524 Cargo Shorts & Zip Legs Pattern](https://www.seattlefabrics.com/GP524-CARGO-SHORTS-ZIP-LEGS-PATTERN_p_712.html) | 1 | $8.00 | Adventure pants! |
| [YKK One-Way Separating Zipper #5 26"](https://www.seattlefabrics.com/YKKreg-One-Way-Separating-Zipper-5-Coil_p_448.html) | 2 | $3.00/ea | For GP524 |
| [YKK 7" Non-Separating Zipper #5 Coil](https://www.seattlefabrics.com/YKKreg-7-Non-Separating-Zipper-5_p_466.html) | 3 | $1.50/ea | For GP524 |
| [Nylon Sew-on Velcro Fasteners 3/4" Hook](https://www.seattlefabrics.com/Nylon-Sew-on-VELCROreg-Brand-Fasteners_p_444.html) | 3 | $1.00/yd | For GP524 |
| [Nylon Sew-on Velcro Fasteners 3/4" Loop](https://www.seattlefabrics.com/Nylon-Sew-on-VELCROreg-Brand-Fasteners_p_444.html) | 3 | $1.00/yd | For GP524 |
| [1" Heavy Weight Elastic yard](https://www.seattlefabrics.com/1-Heavy-Weight-Elastic-200-yard_p_262.html) | 2 | $2.00/yd | For GP524 |
| [56" 2-ply Hi-Count Taslan Nylon DWR yard (Khaki)](https://www.seattlefabrics.com/56-2-Ply-Hi-Count-Taslan-Nylon-DWR-895-linear-yard_p_108.html) | 2.5 | $8.95/yd | For GP524, 2.5yds makes one pants |
### From [goldspot.com](https://www.goldspot.com):
| Item | Price | Description |
| :---- | :---: | ----: |
| [Noodler's Konrad Clear Demonstrator](https://goldspot.com/products/noodlers-ink-konrad-flex-clear-demo-fountain-pen) | $20.00 | Bitchin' pen, I have this pen in Apache Tortoise and I love it. |
| [Noodler's Konrad Tiger Tortoise](https://goldspot.com/products/noodlers-ink-konrad-flex-tiger-tortoise-fountain-pen) | $20.00 | Honestly, I like this pen in most of the non-acrylic colors |
| [Noodler's Ink Apache Sunset](https://goldspot.com/products/noodlers-ink-refills-apache-sunset-bottled-ink) | $12.50 | What's the point of having sweet pens without eccentric colors?? |
| [Pelikan 4001 Bottled Ink in Royal Blue](https://goldspot.com/products/pelikan-refills-royal-blue-2-oz-bottled-ink) | $15.00 | I like the Pelikan inks for sketching because they break apart nicely in water. |
```
ReadMe.md
```# Wsl Blog
The source repository and build directory for the - dare I say, **magnificent** -
wsl blog. I'm not a web designer, by any stretch of the imagination. But, I
like to make things, and this is a thing I made.
Note to myself - when cloning this repo in the future, src/static doesn't exist
but it needs to. Copy the docs/assets and docs/images directories into a
src/static directory
```
subscribe.md
```---
title: Subscribe to Wsl
type: "special"
layout: "subscribe"
---
Thanks for your interest! This subscription form is powered by
[MailChimp](https://www.mailchimp.com) - it reads the site's RSS feed and will send you
an email whenever something new is posted!
```
2018-07-24-The-Roguelike-Tutorial-Week5a.md
```---
title: "The Roguelike Tutorial - Week 5a"
date: 2018-07-24 16:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Makefile
- Roguelike
- Barbarian!
assets: "2018-07-24"
---
Another very productive week for this project! Although I was unable to
finish last weeks goals of getting Parts 8 and 9 completed by today, I
still feel pretty darn good about what I did accomplish. Besides, Parts
10, 11, and 12 are all fairly simple - heck the code is already in
place, just needs to actually be used!
After finishing Part 7 last week I decided to try and fix/change a few
things that have been bothering me. The square, 12x12 font, looked great
for the map tiles but it was **really** ugly for text. I figured my
alternatives were to either use two fonts (like a 6x12 for text and a
12x12 for map), or just use a different font altogether. All my years
playing games in a terminal window pushed me to the second option - if
it’s good enough for the best roguelikes, it’s good enough for me! The
only difficulty with this option is that if I ever want to add graphical
tiles easily, I’d have to make the tiles in a strange size (ie 9x14
instead of 16x16). Adding graphical tiles in will be a chore anyways, so
I’ll just go ahead and not worry about it now. This is what the game
looks like now:
{{< fancybox_img src="NewFont.png" >}}
Pretty slick! After changing to a nice 9x14 font, I decided to tackle
another minor improvement that makes a huge impact: fullscreen mode!
First, I had to set the game window to a standard resolution (800x600),
and then center the console in that window. Easy enough. Conveniently
SDL has a super cool built in function to turn on fullscreen! Oddly, it
doesn’t work at all. Maybe a fault with my code, maybe a fault with SDL.
Not sure, but google showed me that a bunch of people have the same
issue - and very few people had work-arounds. The solution I chose to go
with is to make the window a bit larger than the computer desktop
resolution, and then center it. So, it’s very much a fake fullscreen,
but it works and looks darn nice. Here’s my version of this solution:
{{< highlight cpp >}}
if(fullscreen_)
{
windowWidth_ = 800;
windowHeight_ = 600;
SDL_SetWindowSize(window_, windowWidth_, windowHeight_);
SDL_SetWindowPosition(window_, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED);
fullscreen_ = false;
}
else
{
SDL_DisplayMode dm;
SDL_GetDesktopDisplayMode(0, &dm);
windowWidth_ = dm.w;
windowHeight_ = dm.h;
SDL_SetWindowSize(window_, windowWidth_ + 10, windowHeight_ + 10);
SDL_SetWindowPosition(window_, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED);
fullscreen_ = true;
}
{{< / highlight >}}
I might have to revisit this when it comes time to get this running on
MacOS and Windows, I’m not sure how those systems will respond to this
hacky sort of fix! The cool thing is I think I can scale all the sprites
when drawn in `Engine::draw()`, and then resize the window with this
sort of code... another addition to the To-Do list! (I should also add
the To-Do list to the repository)
Another thing that has always bothered me is my makefile - it really
wasn’t as efficient as it could be. One thing that always bothered me
with the way it was written is that if I changed a header file, it would
not rebuild the source files that included that header. Make is
apparently capable of tracking these things, and GCC has options for
creating a dependency file for each source file, so I tinkered around
with the makefile and ended up with this:
{{< highlight make >}}
CXX = g++
# OPTS = -std=c++17 -O2
OPTS = -std=c++17 -Og -g -Wall
LIBS = -lSDL2 -lSDL2_image
OBJ_NAME = Barbarian
FILES := color texture sprite random console input_handlers entity tile game_map pathfinding fov engine main
OBJS := $(FILES:=.o)
SRC := $(OBJS:.o=.cpp)
DEP := $(FILES:=.d)
VPATH = ./src:./include
.PHONY: clean
all: $(OBJ_NAME)
$(OBJ_NAME): $(OBJS)
$(CXX) $(OPTS) -o $(OBJ_NAME) $(OBJS) $(LIBS)
$(OBJS): %.o: %.cpp %.d
$(CXX) $(OPTS) -c $< -o $@
%.d: %.cpp
@set -e; rm -f $@; \
$(CXX) -M $(OPTS) $< > $@.$$$$; \
sed 's,\($*\)\.o[ :]*,\1.o $@ : ,g' < $@.$$$$ > $@; \
rm -f $@.$$$$
-include $(DEP)
clean:
rm *.o *.d
{{< / highlight >}}
Basically, a new rule to create dependency `%.d` files from the source
files was added. All of that magic is straight from the [GNU Make
manual](https://www.gnu.org/software/make/manual/html_node/Automatic-Prerequisites.html#Automatic-Prerequisites).
Then, the source files depend on the dependency files - so if any header
listed in the dependency file has changed, the object file for that
source is rebuilt. Make is pretty much magic, it will be fun figuring
out how to modify it to build for different systems!
## Part 8
Okay! With all that ~~super important work~~ procrastination done (no
wonder I didn’t finish Part 9), I began work on part 8. This part is all
about items and the inventory screen - possibly one of the most
important parts of any roguelike game is items and item management.
Additionally, this is yet another hurdle I’ve never effectively made it
past. Previous attempts at defining items and inventory were messy and
ineffective, especially when trying to allow monsters to pick up and
use items.
First, I had to define what an item is in the context of my code. The
core classes besides the engine so far are `GameMap`, `Tile` and
`Entity`. An item can’t be a tile, since that would be weird. It makes
sense to make an item a type of entity, and that was what I wanted to do
in the first place - following ECS ideas and defining an entity by it’s
composition of components. An item component would then track all the
relevant data of the item (does it stack, is it carried, how many are
there, etc) and then Entity would manage the logic. The one thing that
makes an item more than just it’s data is the same problem that makes an
AI unique - what type of item is it and what does it do?
To solve this, I decided that the item component would have a simple
enumeration for it’s use function that would be set on making that
entity an item. Then when the actor uses the item, a switch could be set
up to call a specific (private) use function in entity.
`GameMap` needed some changes now - `GameMap::entityAt()` needed to be
expanded to `GameMap::itemAt()` and `GameMap::actorAt()`. Each of these
functions is identical, but the item and actor functions add a separate
conditional to check the entity to see if it is an actor or an item.
Also added was a function to place items - right now place items and
place actors are two separate functions. When the next level code is
implemented, this will likely be changed to account for dungeon depth.
Picking up items was less difficult than I thought it would be, the item
just needed to be removed from the game’s entity list and added to the
player’s inventory. The inventory is a good fit for another component,
and was originally added as a `std::vector<Entity>`. I quickly realized
that this would not work - you can’t rearrange, sort, or randomly remove
parts of a vector (all things necessary for a clean inventory). However,
this is a trivial matter for the doubly linked list -
`wsl::DLList<Entity>`! That darn class has been probably the single most
useful thing I’ve learned how to do with C++ so far - I’ll probably
write a more detailed blog post on it eventually.
Displaying the inventory took some time - I made a few mockups of what I
wanted the game UI to look like in REXpaint, but thing’s didn’t really
flow as well as I wanted. I really like the detailed screens in ADOM,
and will probably move the UI to look more inspired by that later. For
now, the inventory screen is super simple, super basic, and super clean.
{{< fancybox_img src="Inventory.png" >}}
I actually really like how it looks right now, its not obtrusive and
it’s functional. Well, the UI overhaul is already on the To-Do list, so
I’ll revisit it then.
Dropping items is the opposite of picking them up - remove the item from
the player inventory list and add it to the game inventory list. Oh,
yeah, and change it’s current position. Otherwise dropping items
magically places them back to where they were picked up.
The engine already had an enumeration to track the current game state
and code to switch it, so the only real changes were to
`Engine::draw()`. The draw function checks which state the game is in
and draws the appropriate screen now. The `Input` class needed a bit of
an overhaul too, so a bunch of case statements were added to the switch
for keyboard input for each alphabet key on the keyboard. The class also
now has a simple char tracking what letter was pressed, and that is
easily checked against which item in the inventory it corresponds to:
{{< highlight cpp >}}
if (gameState_ == GameState::INVENTORY)
{
if(input.alpha() >= 'a' && input.alpha() <= 'z')
{
int index = int(input.alpha() - 97);
wsl::DLNode<Entity> * itemNode = player_->inventory()->at(index);
if(itemNode)
{
player_->use(index);
addMessage("You use the " + itemNode->data.name() + "!");
changeState(GameState::ENEMY_TURN);
}
}
}
{{< / highlight >}}
This basically checks if the player has an item in their inventory at
the index, and if it does calls `Entity::use()` and change states to the
enemy turn - which also effectively closes the inventory screen. The
code for dropping an item is similar, except it calls `Entity::drop()`
instead.
Here’s a super cool gameplay video showing all the neat things added in
the past week!
{{< fancybox_mv src="Part8.mp4" >}}
---
My goal for the next week is to finish parts 9-11. I think I will tackle
targeting the same way the classic roguelikes did - when a target needs
to be selected, switch to a different state where player input with the
move keys moves a cursor instead of the player, and then whatever is
under the cursor is selected by pressing enter. I might also add a
"look" function in at the same time, since it should be relatively easy
to add and would be a good way to test the targeting code. The saving
code is going to be fun - I've been trying to think about save files the
entire time I've been working on this project, asking "how will I
write/load this to a file" every time I add something to the core
classes. It'll be neat to see if my planning works out. Part 11 is also
going to be interesting, since most of the "next level" code is already
in place and just needs to be used.
All this coding has made me break one of my own self imposed coding
style rules - I’ve always tried to keep source files small (under 200
lines of code, if possible), and I’ve far surpassed that in the source
files for Engine and Entity. I expected to, and thought it wouldn’t
bother me - but it does. Rebuilding times are slowing down and scrolling
through tons of code is already irritating when I know where I’m going.
I have never split implementation files before, but I think that might
be something I’ll have to do shortly. `engine.cpp` could be split into
each of its functions: `engine_handleEvents.cpp`,`engine_update.cpp`,
and `engine_draw.cpp` for example, leaving the utility functions in the
core cpp file. Heck, draw could be split further into draw functions for
each game state, which might make handling the UI easier to deal with.
Really not sure if this will work, but it’s been a constant nagging in
the back of my brain every time I open a super long code file (engine is
677 lines long, and entity is already 290 lines). Maybe I’ll pull the
trigger and try this during the next week - if not it is definitely
going on the top of the To-Do ~~list~~ pile!
Here is the source code for [Part
8](https://github.com/zwilder/Barbarian/tree/Part_8)!
```
2020-09-12-18LPack.md
```---
Title: "Building a Daypack Ramblings"
Author: "Zach Wilder"
Date: 2020-09-12 07:00:00 -0700
Categories:
- MYOG
- Projects
Tags:
- Vintage Machines
- Sewing
- MYOG
- Projects
Thumb: "2020-09-12-18LPack/WearingThePack.jpg"
assets: "2020-09-12-18LPack"
---
Occasionally, I get ideas that creep into my brain and won't leave until
I fully explore them. Back in February, while still enjoying the nice
Arizona winters, I was hiking with my trusty old camelback. I'm fond of
that pack, despite it's many shortcomings. It has lots of fun places to
attach things, and carries around 2L of water. It has zero storage
capacity, although you can shove like maybe a protein bar in with the
bladder... but that's it. So, if I want to bring my sketchbook, I
usually shove the camelback in my larger Osprey daypack. The Osprey is a
nice pack, lots of little pockets, but it's aesthetically pleasing
curves really limit what I can easily pack in there. I also use the
Osprey for carrying (awkwardly) all my plein air painting gear - which,
shouldnt take up all that much space but really stretches the limit for
how much the Osprey can hold. Which, again, leaves room for maybe a
protein bar.
{{<fancybox_gallery id=0
src1="Camelback.jpg"
src2="Osprey.jpg"
>}}
Snack capacity should be a very important part of backpack design
considerations.
So the idea was born, could I design a small daypack that could carry a
few snacks, sketching stuff, and my hydration bladder **or** all of my
plein air painting stuff, tripod, and lunch?
One thing I noticed while making small practice packs for my daughter is
that all the fun little pockets in commercial packs that are barely
large enough for anything practical really eat into the total storage
capacity - keeping a pack simple greatly increases it's storage
capacity, even if it technically has the same volume designation.
Also, while curves are pleasing, they really suck for packing things.
With these ideas in mind I set out to make a prototype pack out of some
cheap ripstop.
{{<fancybox_gallery id=1
src1="Prototype_Notes.jpg"
src2="Prototype1.jpg"
src3="Prototype2.jpg"
>}}
{{<fancybox_gallery id=1
src1="Prototype3.jpg"
src2="Prototype4.jpg"
>}}
Cool flap with zippered pocket, compression ties on the side to reduce
size, daisy chains on back, drawstring collar...Fancy right? Yeah too
fancy... but the size was right. The top flap was kinda wonky on the
prototype, and honestly it was more of a hassle to deal with then it was
worth. The hydration tube exits were cool on paper - hilariously
ineffecient in real life. I was convinced the idea was solid though, and
ordered some fancy 420D Ripstop to make the next version.
Well, life got kinda crazy for everyone right around March this year,
then we relocated from AZ to OR... Unfortunately a lot of my project
ideas got put on the backburner until just recently. What's really nice
is I now have a garage with a couple [workbenches](http://www.communitygroundworks.org/sites/default/files/workbench_plans_SA1.pdf) I built - so my
projects don't take over the dining room table!
{{< fancybox_img
src="Version2_Notes.jpg"
>}}
While at work I doodled this idea for version 2 of this ~18L pack. I got
rid of the flap from the prototype, and decided to just go with either a
drawstring top or a rolltop dry-bag style closure. I made room on one
side for a little pocket with an elastic band, and the other side has
the compression ties. Funny thing I noticed with the prototype - for a
small pack you really only need to cinch down one side to reduce the
volume! I also tried to plan out the build process a bit more, since the
prototype was a pain to get everything together.
---
## Derailing the Narrative Briefly...
I have a pretty sweet setup going on in the garage now - my one bench
works great for sprawling out stuff and notes, the [sawhorses](https://jayscustomcreations.com/2013/04/saw-horses/) I built
support a scrap piece of plywood to use as a cutting table, and then I
found this excellent old Singer cabinet at a Goodwill.... it came with a
beat up 401a, a vintage Husqavarna foot controller, and a box of
assorted slant shank presser feet. The whole setup was an unbelievable
15 bucks - the table had a bunch of water stains, marker/pencil marks,
gouges, and stickers. A bit of elbow grease, sandpaper, and stain/poly
and it's better than new! I took the beat up 401a out and put my
beautiful 403a in.
{{<fancybox_gallery id=3
src1="Table1.jpg"
src2="Table2.jpg"
src3="Table3.jpg"
>}}
I should have taken before pictures - I'm pretty bad at remembering to
do that. Believe me, the table was **rough**. Please excuse the random
mess in the background - Mrs. Wilder kept asking me to clean up the
garage but I kept getting distracted with projects! (I swear it's clean
now though)
The 401a I took out will have to be a post for another time - but the
short version is I took her apart, cleaned and tuned her up, and she's
running/stitching beautifully now.
---
## Back to the Build!
When I started the build I wasn't sure how I was going to do the top -
and it did not really matter since that would be the very last thing to
sew on!
{{<fancybox_gallery id=4
src1="MessyBench.jpg"
src2="SewingTable.jpg"
>}}
I started by assembling the sides and attaching the daisy chain to the
back. one side has grosgrain loops for the cordage to go through, the
other has the elastic pocket and a covered zipper on top for quick
access and an easy hydration tube exit. The daisy chain has a loop at
the top and bottom for clipping things on easily, and the straps are
anchored into the side of the pack with these cool triangle pieces.
After attaching the sides to the body with a 1/2" seam, I stitched an
additional line at 1/4" and then covered the seam with 1/2" grosgrain
stitched at 3/8"... overkill maybe, but I'm stoked with how sturdy it
feels and nice it looks. The strap anchors got a couple of bar tacks as
well where they tuck into the seam.
{{<fancybox_gallery id=5
src1="Pieces.jpg"
src2="StrapAnchor.jpg"
src3="Grosgrain.jpg"
>}}
One of my biggest annoyances with commercial packs is the cheesegrater
shoulder strap padding on every pack - and that the bulky padding goes
the entire length of the strap! The prototype did away with all padding
and just had the 1" poly shoulder strap... which was uncomfortable under
load. So, I decided for this pack to make full straps, padded only for
the first 8" (the only part that contacts your body really) with 1/2"
closed cell foam padding (aka cheap blue sleeping pad from walmart).
The shoulder straps are slightly curved, it comes off the pack straight
across the shoulders and then in to the sides. I stitched the 1" poly
strap a few times up the top part of the strap for a place to attach
things, and maybe add a sternum strap later. I then sandwiched the foam
in the strap, stitched across top and bottom to hold it in place, and
around the edges. 1/2" grosgrain was used to clean up the raw edges, and
makes the straps look pretty nice.
I couldn't resist lacing up the side (550 paracord) and shoving a pillow
in at this point to take a few pictures.
{{<fancybox_gallery id=6
src1="ToplessStrap.jpg"
src2="ToplessLeft.jpg"
src3="ToplessRight.jpg"
>}}
{{<fancybox_gallery id=6
src1="ToplessBackDog.jpg"
src2="ToplessFront.jpg"
>}}
All that was left was the top at this point - and for that I decided to
go with a dry-bag style rolltop closure. I made the collar pretty long,
which ends up being nice if you need just a bit more space (for snacks)
on top of whatever you're carrying. The strap on the top for the rolltop
action should be just a couple inches longer than I made it - but it
still works great. I have these fun "X" buckles that I picked up on a
whim, so the closure features those. The zipper for the quick
access/hydration tube is a bit high on the side - might be better if
it's moved down a bit. The tube slides nicely into the strap daisy chain
to hold it in place, and the pack is extemely comfortable loaded up with
stuff.
{{<fancybox_gallery id=7
src1="FinishClose.jpg"
src2="FinishOpen.jpg"
src3="BuckleCloseup.jpg"
>}}
{{<fancybox_gallery id=7
src1="HydrationTube.jpg"
src2="PleinAirLoad.jpg"
src3="WearingThePack.jpg"
>}}
I'll be field testing the pack over the next couple months before
drafting version 3 - but this might be the first actually useable pack
I've made. Comfortable, durable, water resistant, and plenty of room -
for snacks.
```
2016-12-20-automata-caves.md
```---
title: "Randomly Generated Caves with Cellular Automata"
date: 2016-12-22 19:18:06 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- Roguelike
- C++
- Cellular Automata
---
So, every time I get the urge to write a blog post about whatever random bit of code I'm writing - I look at the blog and think: "Hm, this is kinda ugly." Then, I have to rewrite it until I'm mostly satisfied with
how it looks.
Recently, I've been working on writing a nice little interface for handling menus and other parts of the UI for my roguelike project. Unfortunately, like the layout of this blog, I can't seem to find a satisfactory
'look and feel' - I think I've got a good start though.
While procrastinating working on that, I've spent a lot of time thinking about the map, and my ECS system. At the risk of prematurely optimizing code, it seems like an awful waste of space to make every tile an entity. Most of a
tiles properties are simple boolean flags anyways, so why not make tiles just a bitflag and glyph to represent them? After running some halfassed tests on this idea, the size of an entire map (100x100, or 10,000 tiles) worth of tiles was a mere 24 bytes. Yeah, this idea will work just fine.
Basically, how it works now is a tile is just:
{{< highlight cpp >}}
struct Tile
{
int bitMask;
char glyph;
}
{{< / highlight >}}
And the flags:
{{< highlight cpp >}}
enum TileFlags : int
{
NONE = 0,
BLOCKS_MOVEMENT = 0x001,
BLOCKS_LIGHT = 0x002,
UP_STAIR = 0x004,
DOWN_STAIR = 0x008,
DOOR = 0x010,
FLOOR = 0x020
};
{{< / highlight >}}
I'm a pretty huge fan of bitflags, mostly because it allows me to do all sorts of cool stuff. Say for instance we added a `LIQUID` flag to `TileFlags` - liquid blocks movement (our fearless adventurer never took swim lessons, apparently) but doesn't block light, so the adventurer's field of vision would see over the murky pool of whatever liquid.
But wait! It gets better, what if our adventurer decides that, while standing next to a murky pool of water, to read a Scroll of Explosion - The game logic can now easily test to see if any of the affected tiles are also liquid, and make steam that the player CAN'T see through! Or, even ~~better~~ worse, maybe it's a pool of acid... Acid steam clouds sound pretty deadly...
And.... this got me thinking about dungeon generating. The dungeon generator I have been using was some [code I pulled off RogueBasin](http://www.roguebasin.com/index.php?title=C%2B%2B_Example_of_Dungeon-Building_Algorithm) and modified to fit my uses. The modifications I made kinda ruined the modularity of
the generator, mostly because of the tile specifications in the generator. Also, the generator was making a dungeon and then the game was taking the dungeon that it made and making the tiles from the tiles the dungeon generated. If that sounds confusing - it was. Definitely not clean and simple, so I decided I needed to fix that.
But of course, I couldnt just hack up the main generator for dungeon fun for the game - without testing the idea first on something completely different. I decided to rewrite something I wrote for the Libtcod Python Roguelike tutorial - Caves with Cellular Automata.
The whole idea is based on [Conway's Game of Life](https://en.wikipedia.org/wiki/Conway's_Game_of_Life) - just modified to make some cool, natural looking caves. The algorithm goes something like this:
* A map is created filled with floors and then each cell (x,y coordinate) is looped through, with a 45% chance of becoming a wall.
* A blank strip of floor tiles, 3 tiles wide is created going from left to right across the map and another from top to bottom. This step helps insure continuity of the caves, and reduces the chances of inaccessible spaces.
* A border around the map is added, 1 tile wide. The first time the border is added is just so that the caves can 'grow' from it.
* Next we loop through each tile twice, counting the number of wall tiles adjacent to it. If there are 5 or more wall tiles *or less than two wall tiles* in the 3x3 grid surrounding the tile, the tile becomes a wall tile. Otherwise, it becomes a floor tile. The less than two part of this run adds a little bit of random spots in the map.
* The final run through loops through the tiles ten times. If there are 5 or more wall tiles in the 3x3 grid surrounding the tile, the tile becomes a wall tile. Otherwise, it becomes a floor tile. These loops smooth out the rough edges, and make the caves look nice and organic.
* A border is readded to the map - don't want our adventurer wandering off screen!
* The up-stairs are randomly placed on a floor tile.
* A dijkstra map is created, with the upstairs as the goal, and the downstairs are placed on the last tile with the highest value (farthest distance) from the upstairs.
This generates some pretty neat looking caves:
<pre style="background: #272822; color: #f8f8f2; text-align: center;">
<code>
################################################################################
#.............####.............................................................#
#.............#####.......................................................##...#
##............######...............................####....<span style="color: #AB266D;"><</span>.............####..#
###............#####.............#####............######.................####..#
####............###.............#########.........######..................##..##
#####..........................###########........######......................##
######.........................#############.......####.......................##
#######........................##############................##..............###
#######........................################.............####.............###
########.......................###################........######..............##
########.......................####################......########.............##
########.....###................####################.....########......##....###
#########...#####...............####################.....#########....##########
#################................##################......##########..###########
##################................################......########################
###################.........................###.........########################
####################.........##.........................########################
#####################.......####.........................#######################
#########################..######................##.......######################
##################################..............####.......#####################
###################################............######.......####################
####################################..........########.......###################
#########<span style="color: #AB266D;">></span>.##########################.........#########...........##########..##
########....#########################..........#########...........######......#
########.....###############..######............########............####.......#
#########.........#######..........................####.......................##
##########...........###.....................................................###
##########...................................................................###
################################################################################
</code>
</pre>
This cave has some nice large open spaces for combat, and it's not claustrophobic enough to make exploration a chore! The idea, like a lot of my ideas, was inspired by a [post on cellular automata on RogueBasin](http://www.roguebasin.com/index.php?title=Cellular_Automata_Method_for_Generating_Random_Cave-Like_Levels).
The most current version of all my RL files is on [Github](https://github.com/zwilder/Weasel_Engine).
```
2017-01-07-gradients-and-actions.md
```---
title: "Gradients for Colors, and Actions for Actors"
date: 2017-01-07 11:45:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- C++
- Roguelike
assets: 2017-01-07-gradients-and-actions
---
Over the past couple of weeks I've been working on simplifying the code for my roguelike project - heavily inspired by one of my favorite books on my shelf,
[Game Programming Patterns](http://gameprogrammingpatterns.com).
I've seriously read this book cover to cover, multiple times - and every time find a new use for one of the 'patterns' in it. I just discovered that the
author's [blog](http://journal.stuffwithstuff.com/) has a bunch of good reads on it as well. One of the biggest problems I've had with the roguelike project was a simple way to issue commands
(which should have been a clue) from the player to the character, and from the computer AI to the enemies.
The first chapter in the book, and [this](http://journal.stuffwithstuff.com/2014/07/15/a-turn-based-game-loop/) blog post had the answer - the 'Command' pattern. I have no idea how I didn't think of this sooner - basically,
all the actions that an actor (player or enemy) can take are issued as 'commands'. A command is just a subclass of an action, and each actor when updating
gets to call it's most current action's `perform()` routine. What makes this super cool and useful is that the perform routine returns an `ActionResult`, which
has a flag stating whether or not the current action was successful, and a suggested alternate action (for use if the action was unsuccessful).
{{< highlight cpp >}}
class Action
{
public:
virtual ActionResult perform(Actor & actor) = 0;
protected:
Action() { }
};
class ActionResult
{
public:
ActionResult() { status_ = true; }
bool success() { return status_; }
void setFalse() { status_ = false; }
void setTrue() { status_ = true; }
Action * getAlternate() { return alternative_; }
void setAlternate(Action * alternate) { alternative_ = alternate; }
private:
Action * alternative_;
bool status_;
};
{{< / highlight >}}
Now, if the player moves into a square - instead of the keypress moving the player, the keypress just sets the player's next action to attack in the direction of that tile.
During the players update, the `perform()` for the attack action checks to see if there is another actor there - and if there isn't returns a move action as an alternate. If
the move action fails (because the tile is blocked or whatever), an open door action is returned. If there isn't a door at the tile (or the door is locked and the player doesn't have the key),
the action returns null and the player doesn't 'lose' their turn.
This makes logic for AI so much easier, and the game easier to play. If I press 'o' (open door), but there's only open doors around - I probably wanted to close that door. AI when pathfinding can just ignore things like doors,
since moving into them will just use their turn to open the door - if they are capable.
Another fun thing I wrote recently is some code to dynamically create color gradients. It turns out, you can just do a simple line (y=mx+b) for component (r,g,b) of a color: `m` being equal to the change in color (finish - start) divided by the number
of steps, and `b` as the start color.
{{< highlight cpp >}}
int getDeltaColor(int sC, int fC, int steps)
{
// This is the slope equation for 'm' : (finishColor - startColor) / NumberOfSteps
if(steps == 0)
{
return 0;
}
return int((fC - sC) / steps);
}
std::vector<WColor> getColorGradient(WColor startColor, WColor finishColor, int steps)
{
std::vector<WColor> result;
// First, we get the slopes for each color component
int redDelta = getDeltaColor(startColor.r, finishColor.r, steps);
int greenDelta = getDeltaColor(startColor.g, finishColor.g, steps);
int blueDelta = getDeltaColor(startColor.b, finishColor.b, steps);
int alphaDelta = getDeltaColor(startColor.a, finishColor.a, steps);
result.push_back(startColor);
for(int i = 0; i < steps; ++i)
{
WColor stepColor;
//Then at each step: stepColor = slope * stepNumber + startColor
stepColor.r = (redDelta * i) + startColor.r;
stepColor.g = (greenDelta * i) + startColor.g;
stepColor.b = (blueDelta * i) + startColor.b;
stepColor.a = (alphaDelta * i) + startColor.a;
result.push_back(stepColor);
}
result.push_back(finishColor);
return result;
}
{{< / highlight >}}
Finally, another cool thing I've been working on is playing around with Perlin noise. Inspired by [Red Blob Games's post](http://www.redblobgames.com/maps/terrain-from-noise/) on using Perlin noise to generate 2D maps I decided that I had to do something similar for my roguelike.
The code for the noise generating function is just a straight translation of Ken Perlin's [improved noise function](http://mrl.nyu.edu/~perlin/noise) which was written in Java. I have no idea the math behind most of this - but
man is it cool.
Here's what I ended up with, starting with just a picture of the noise (check out the sweet dynamically created gradient from white to red!) and then a picture of the resulting map after the terrain is applied:
{{< fancybox_gallery
id=1
src1="heatmap.png"
src2="terrain.png" >}}
Neat right? I'm not entirely happy with it yet, but it's a heck of a start! Applying the terrain to the heatmap was the tricky part. The perlin noise function returns numbers from -1 to 1, which I normalized (by dividing by two
and adding 0.5) to numbers from 0 to 1. I then took those numbers, multiplied them by 255, and forced the numbers to an integer. I then took the maximum number (highest 'elevation') and stored that, then multiplied the max elevation by 0.6 to find the waterline (so 60% of the map is underwater).
The difference between the max elevation and the waterline is divided by the number of land 'biomes' I have (six) and the terrain is divided by elevation that way. It's not great, but it works for now. I need to look at how
Dwarf Fortress's maps look again - but I can't open that game without being sucked into it for days at a time. I'd like to add rivers to the map, which I could do by just finding a mountain tile and 'rolling downhill' to get to
a water tile (dijkstra mapping!). I also need to work on placing locations, like dungeons and a town.
I also tried to use characters to represent the increase in elevation, but couldn't settle on ones I liked - and ended up just using the ones from Dwarf Fortress. Even worse than not being able to decide on characters was
deciding on colors. My first attempt (like most of my attempts with colors) failed miserably - I just used whatever approximations I could think of for what colors things should be (green trees and grass,
grey mountains, blue water - etc). I decided that I need to find a 'color palette' and use that exclusively in my roguelike. For lack of being able to come up with a better idea, I chose the ever popular [DawnBringer 16 color
palette](http://pixeljoint.com/forum/forum_posts.asp?TID=12795).
So, my basic idea for this game project is as follows: The player finds themselves in a small settlement on the coast of an island and is tasked with investigating various threats and ruins around the island. Every tile on the world
map will be able to be visited (ADOM style) and locations dynamically generated. Dungeons will also be dynamically generated, and each will have a 'theme'. The theme will determine what types of enemies the player encounters at a
location, along with the types of treasure and dungeon layout. The difficulty of the dungeons will be based on how far from the settlement town they are (dijkstra mapping to the rescue, again!). I'm not sure how quests will
fit into all this - I want the game to have a light sort of feel to it, where the story doesn't matter too much... just good ol' fashion dungeon crawling. Maybe the player will be given objectives like
vanquishing a Goblin Commander in a goblin themed cave, or finding a certain relic at the bottom of some ancient ruins populated by the undead.
```
_index.md
```---
Title: "The latest from Wsl-Blog"
---
```
2017-10-22-messing-with-web.md
```---
title: "Messing With Web Design - Again"
date: 2017-10-22 07:00:00 -0700
Author: "Zach Wilder"
Categories:
- Programming
tags:
- Web Programming
- Hugo
---
Ok, so it turns out I still can't stand using a premade theme. I decided to look again at Hugo themes, and found [XMin](https://xmin.yihui.name/). Clean, simple, and
a good basic idea of what I wanted this blog to look like. Cracked open the source code and was playing around... one thing led to another and
this is what I ended up with.
Really enjoying working with Hugo - haven't even played with any of the cool powerful features that it has, but I am very impressed with how easy it is
to modify and change things. Everything is laid out in a good, logical sense which makes it much easier to customize and play around with things.
Things that still need work:
* I'm not sure about the monospace font for the titles and headers - I like it, but that doesn't mean it looks good! Ha.
* The [Tags](/tags) page looks off. Not sure what to do with that.
* Maybe write some sort of intro thing for the home page.
Most likely I'll end up redoing this whole layout... But this was the first time I've messed around with web design stuff and had a bit of success and didn't
pull out too many hairs! Thanks Hugo!
```
|
zwjohn/rsapoc
|
zwjohn/rsapoc
README.md
```# rsapoc
POCs
```
|
zwk1277023870/-1
|
zwk1277023870/-1
README.md
```# -1
好好学习
```
|
zwl568633995/BlogPrecious
|
zwl568633995/BlogPrecious
README.md
```# blogprecious
博客记录日志
```
|
zwoman/Marilyn
|
zwoman/Marilyn
README.md
```# Marilyn
the magic of visual and compassionate communication
```
|
zwwnzb/-development_tool
|
zwwnzb/-development_tool
README.md
```# -development_tool
开发工具测试分支
```
|
zwx0001/lemon-api
|
zwx0001/lemon-api
README.md
```# lemon-api
mylemon
```
|
zx2624/zx_trans
|
zx2624/zx_trans
tcp_client.cc
```#include <ros/ros.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <sys/shm.h>
#include <iostream>
#include <deque>
#include <mutex>
#include <thread>
#include <opencv2/opencv.hpp>
#include <cv_bridge/cv_bridge.h>
#include <sensor_msgs/image_encodings.h>
#include <fstream>
#include "detection_result/detection_result_msg.h"
using namespace std;
int PORT=6668;
string IP = "192.168.10.41";
#define BUFFER_SIZE 655355
int sock_cli;
struct sockaddr_in servaddr;
std::mutex mtx_dq;
vector<string> names{"YINBIDIAN_1","YINBIDIAN_2","ZHENCHA1_1","ZHENCHA1_2","ZHENCHA2_1",
"ZHENCHA2_2","XUNLUO1_1","XUNLUO1_2","XUNLUO2_1","XUNLUO2_2","XUNLUO3_1","XUNLUO3_2","XUNLUO4_1","XUNLUO4_2"};
ofstream outfile;
string udisk_dir;
//char* SERVER_IP = "192.168.8.109";
//char* SERVER_IP = "192.168.1.131";
deque<detection_result::detection_result_msgConstPtr> msg_q;
void float_to_uchar(float b, unsigned char* sendbuf){
int a = b * 100000;
sendbuf[0] = a & 0xff;
sendbuf[1] = (a & 0xff00) >> 8;
sendbuf[2] = (a & 0xff0000) >> 16;
sendbuf[3] = (a & 0xff000000) >> 24;
}
void detetction_cb(const detection_result::detection_result_msgConstPtr& msg){
static int i =0;
mtx_dq.lock();
////////////////
msg_q.push_back(msg);
//所有收到的文件都存入本地优盘，其中yinbidian1 2 会从优盘里读取然后发送到主席台
cv::Mat image=(cv_bridge::toCvCopy(msg->imgdata,sensor_msgs::image_encodings::RGB8)->image);
stringstream str;
str<<udisk_dir<<msg->header.frame_id<<".jpg";
cv::imwrite(str.str(),image);
if(msg->header.frame_id == "ZHENCHA1_1"){
i++;
outfile<<"ZHENCHA1( "<<msg->longitude<<" "<<msg->latitude<<" "<<msg->altitude<<")"<<endl;
}
if(msg->header.frame_id == "ZHENCHA2_1"){
i++;
outfile<<"ZHENCHA2( "<<msg->longitude<<" "<<msg->latitude<<" "<<msg->altitude<<")"<<endl;
}
if(i == 2)
outfile.close();
mtx_dq.unlock();
// unsigned char sendbuf[BUFFER_SIZE];
// unsigned char rec;
// cv_bridge::CvImageConstPtr ptr;
// ptr = cv_bridge::toCvCopy(msg->imgdata, sensor_msgs::image_encodings::RGB8);
// cv::Mat image = ptr->image;
// cv::resize(image,image,cv::Size(image.rows/2,image.cols/2 ));
// cv::imshow("mine",image);
// cv::waitKey(3);
// if(!image.empty()){
// std::vector<uchar> data_encode;
// std::vector<int> quality;
// quality.push_back(CV_IMWRITE_JPEG_QUALITY);
// quality.push_back(10);//进行50%的压缩
// imencode(".jpg", image, data_encode,quality);//将图像编码
// int nSize=data_encode.size();
// cout<<"''''' "<<nSize<<endl;
// for (int i = 0; i < nSize; i++)
// {
// sendbuf[i] = data_encode[i];
// }
// send(sock_cli, sendbuf, nSize,0);
// recv(sock_cli, &rec, 1,0);
// if( abs(msg->longitude)>10){
// memset(sendbuf, 0, sizeof(sendbuf));
// float longi = msg->longitude;
// float_to_uchar(longi, sendbuf);
// float lati = msg->latitude;
// float_to_uchar(lati, sendbuf+4);
// float alti = msg->altitude;
// float_to_uchar(alti, sendbuf+8);
// send(sock_cli, sendbuf, 12,0); ///发送
// cout<<fixed<<setprecision(5)<<"the number i send is "<<longi<<" "<<lati<<" "<<alti<<endl;
// }
//// detection_pub.publish(msg_send);
// memset(sendbuf, 0, sizeof(sendbuf));
// }
}
void process(){
unsigned char flag;
unsigned char img_buf[1001];
img_buf[0] = 3;
while(ros::ok()){
if(msg_q.size()>0){
cv::Mat img;
mtx_dq.lock();
detection_result::detection_result_msgConstPtr msgptr = msg_q.front();
msg_q.pop_front();
int index = 0;
for(;index<names.size();index++){
if(msgptr->header.frame_id == names[index])
{
cout<<index<<" "<<names[index]<<" "<<msgptr->header.frame_id<<endl;
break;
}
}
cout<<msgptr->header.frame_id<<endl;
mtx_dq.unlock();
cv_bridge::CvImageConstPtr ptr;
ptr = cv_bridge::toCvCopy(msgptr->imgdata, sensor_msgs::image_encodings::RGB8);
img = ptr->image;
// imshow("Yuanshi",img);
// cv::waitKey(3);
//发送size信息
int width = img.cols;
int height = img.rows;
char size_buf[5];
size_buf[0] = 1;
size_buf[1] = width & 0xff;
size_buf[2] = (width & 0xff00) >> 8;
size_buf[3] = height& 0xff;
size_buf[4] = (height & 0xff00) >>8;
send(sock_cli,size_buf,5,0);
recv(sock_cli,&flag,1,0);
//发送经纬度
if(abs(msgptr->longitude)>5){
unsigned char longibuf[13];
memset(longibuf ,0 ,sizeof(longibuf));
longibuf[0] = 234;
if(msgptr->header.frame_id == "ZHENCHA1_1"){
longibuf[0] = 21;
}
if(msgptr->header.frame_id == "ZHENCHA2_1"){
longibuf[0] = 22;
}
float longi = msgptr->longitude;
float_to_uchar(longi, longibuf+1);
float lati = msgptr->latitude;
float_to_uchar(lati, longibuf+5);
float alti = msgptr->altitude;
// msg_send.altitude = alti;
// msg_send.latitude = lati;
// msg_send.longitude = longi;
float_to_uchar(alti, longibuf+9);
send(sock_cli, longibuf, 13,0); ///发送
recv(sock_cli,&flag,1,0);
}
//send img
int pos = 0;
int all_buf_size = 3*width*height;
while( pos < all_buf_size){
memset(img_buf,0,1001);
img_buf[0] = 3;
if(all_buf_size - pos >= 1000){
memcpy(img_buf+1, img.data+pos,1000);
send(sock_cli,img_buf,1001,0);
pos+=1000;
}else{
int size_send = all_buf_size - pos;
memcpy(img_buf+1, img.data+pos,size_send);
char a = char(index & 0xff);
img_buf[size_send+1] = a;
send(sock_cli,img_buf,size_send + 2,0);
pos += all_buf_size - pos;
}
recv(sock_cli ,&flag, 1, 0);
usleep(10);
}
}else{
sleep(1);
}
//从本地读取文件YINBIDIAN-1 和2 并发送
// string name1 = udisk_dir + "YINBIDIAN_1.jpg";
// cv::Mat yinbidian1 = cv::imread(name1);
// if(!yinbidian1.empty()){
// cv::imshow("local",yinbidian1);
// cv::waitKey();
// //发送size信息
// int width = yinbidian1.cols;
// int height = yinbidian1.rows;
// char size_buf[5];
// size_buf[0] = 1;
// size_buf[1] = width & 0xff;
// size_buf[2] = (width & 0xff00) >> 8;
// size_buf[3] = height& 0xff;
// size_buf[4] = (height & 0xff00) >>8;
// send(sock_cli,size_buf,5,0);
// recv(sock_cli,&flag,1,0);
// //发送图片
// int pos = 0;
// int all_buf_size = 3*width*height;
// while( pos < all_buf_size){
// memset(img_buf,0,1001);
// img_buf[0] = 3;
// if(all_buf_size - pos >= 1000){
// memcpy(img_buf+1, yinbidian1.data+pos,1000);
// send(sock_cli,img_buf,1001,0);
// pos+=1000;
// }else{
// int size_send = all_buf_size - pos;
// memcpy(img_buf+1, yinbidian1.data+pos,size_send);
// char a = char(0 & 0xff);
// img_buf[size_send+1] = a;
// send(sock_cli,img_buf,size_send + 2,0);
// pos += all_buf_size - pos;
// }
// recv(sock_cli ,&flag, 1, 0);
// usleep(10);
//
// }
// }
// string name2 = udisk_dir + "YINBIDIAN_2.jpg";
// cv::Mat yinbidian2 = cv::imread(name2);
// if(!yinbidian2.empty()){
// cv::imshow("local",yinbidian2);
// cv::waitKey();
// //发送size信息
// int width = yinbidian2.cols;
// int height = yinbidian2.rows;
// char size_buf[5];
// size_buf[0] = 1;
// size_buf[1] = width & 0xff;
// size_buf[2] = (width & 0xff00) >> 8;
// size_buf[3] = height& 0xff;
// size_buf[4] = (height & 0xff00) >>8;
// send(sock_cli,size_buf,5,0);
// recv(sock_cli,&flag,1,0);
// //发送图片
// int pos = 0;
// int all_buf_size = 3*width*height;
// while( pos < all_buf_size){
// memset(img_buf,0,1001);
// img_buf[0] = 3;
// if(all_buf_size - pos >= 1000){
// memcpy(img_buf+1, yinbidian2.data+pos,1000);
// send(sock_cli,img_buf,1001,0);
// pos+=1000;
// }else{
// int size_send = all_buf_size - pos;
// memcpy(img_buf+1, yinbidian2.data+pos,size_send);
// char a = char(0 & 0xff);
// img_buf[size_send+1] = a;
// send(sock_cli,img_buf,size_send + 2,0);
// pos += all_buf_size - pos;
// }
// recv(sock_cli ,&flag, 1, 0);
// usleep(10);
// }
// }
}
close(sock_cli);
}
void newcb(const sensor_msgs::ImageConstPtr& msg){
cv_bridge::CvImageConstPtr ptr;
ptr = cv_bridge::toCvCopy(msg, sensor_msgs::image_encodings::RGB8);
cv:imshow("tt",ptr->image);
cv::waitKey(3);
char *home;
home = getenv("HOME");
string hom = home;
stringstream str;
str<<hom<<"/"<<"taskfile/cpan/"<<msg->header.frame_id<<".jpg";
cout<<str.str()<<endl;
cv::imwrite(str.str(),ptr->image);
}
int main(int argc, char ** argv)
{
ros::init(argc, argv, "tcp_client");
ros::NodeHandle nh;
ros::Publisher detection_pub = nh.advertise<detection_result::detection_result_msg>("detection_result",100);
ros::param::get("ip",IP);
ros::param::get("~port",PORT);
ros::param::get("~udisk_dir",udisk_dir);
const string txt = udisk_dir + "ZUOBIAO_KYXZ2018A.txt";
cout<<"检测结果发送目标IP--"<<IP<<endl;
cout<<"检测结果发送目标端口--"<<PORT<<endl;
cout<<"检测结果u盘存储目录-- "<<txt<<endl;
outfile.open(txt,ios::out);
outfile.precision(10);
//定义sockfd
sock_cli = socket(AF_INET,SOCK_STREAM, 0);
///定义sockaddr_in
memset(&servaddr, 0, sizeof(servaddr));
servaddr.sin_family = AF_INET;
servaddr.sin_port = htons(PORT); ///服务器端口
servaddr.sin_addr.s_addr = inet_addr(IP.c_str()); ///服务器ip
printf("连接%s:%d\n",IP,PORT);
///连接服务器，成功返回0，错误返回-1
while(connect(sock_cli, (struct sockaddr *)&servaddr, sizeof(servaddr)) < 0 && ros::ok())
{
cout<<"from tcp_client node: wating server..."<<endl;
usleep(1000000);
}
printf("服务器连接成功\n");
ros::Subscriber detection_sub = nh.subscribe<detection_result::detection_result_msg>("detection_result",100,detetction_cb);
ros::Subscriber unclass_sub = nh.subscribe<sensor_msgs::Image>("/image",100, newcb);
std::thread thread1{process};
while(0){
static int i = 0;
i++;
cout<<"sending width height"<<endl;
int width = 1024;
int height = 1204;
unsigned char pic_size[4];
pic_size[0] = width & 0xff;
pic_size[1] = (width & 0xff00) >> 8;
pic_size[2] = height& 0xff;
pic_size[3] = (height & 0xff00) >>8;
char a;
send(sock_cli, pic_size, 4,0); ///发送
recv(sock_cli, &a, 1,0);
if(i>1000)
break;
usleep(1000);
}
unsigned char sendbuf[BUFFER_SIZE];
unsigned char recvbuf[BUFFER_SIZE];
while (0)//ros::ok()
{
static int i =0;
stringstream str;
str<<"/home/zx/图片/IMG/"<<i<<".jpg";
cv::Mat imgread;
imgread = cv::imread(str.str());
if(!imgread.empty()&& i<15)
{
cv::resize(imgread,imgread,cv::Size(960,640));
sensor_msgs::ImagePtr immsg ;
immsg = cv_bridge::CvImage(std_msgs::Header(), "rgb8", imgread).toImageMsg();
detection_result::detection_result_msg msg_send;
msg_send.imgdata = *immsg;
msg_send.header.frame_id = names[i-1];
cv::imshow("readimg", imgread);
cv::waitKey(3);
std::vector<uchar> data_encode;
std::vector<int> quality;
quality.push_back(CV_IMWRITE_JPEG_QUALITY);
quality.push_back(10);//进行50%的压缩
imencode(".jpg", imgread, data_encode,quality);//将图像编码
int nSize=data_encode.size();
// cout<<"size is "<<nSize<<endl;
for (int i = 0; i < nSize; i++)
{
sendbuf[i] = data_encode[i];
// cout<<i<<" "<<nSize<<endl;
}
if( i == 4 || i == 3){
float longi = 35.23456;
float_to_uchar(longi, sendbuf);
float lati = 110.16785;
float_to_uchar(lati, sendbuf+4);
float alti = 3.467;
msg_send.altitude = alti;
msg_send.latitude = lati;
msg_send.longitude = longi;
float_to_uchar(alti, sendbuf+8);
send(sock_cli, sendbuf, 12,0); ///发送
cout<<fixed<<setprecision(5)<<"the number i send is "<<longi<<" "<<lati<<" "<<alti<<endl;
}
if( i == 5 || i == 6){
float longi = 114.141414;
float_to_uchar(longi, sendbuf);
float lati = 36.363636;
float_to_uchar(lati, sendbuf+4);
float alti = 47.676767;
msg_send.altitude = alti;
msg_send.latitude = lati;
msg_send.longitude = longi;
float_to_uchar(alti, sendbuf+8);
send(sock_cli, sendbuf, 12,0); ///发送
cout<<fixed<<setprecision(5)<<"the number i send is "<<longi<<" "<<lati<<" "<<alti<<endl;
}
detection_pub.publish(msg_send);
memset(sendbuf, 0, sizeof(sendbuf));
memset(recvbuf, 0, sizeof(recvbuf));
}
i++;
usleep(1000000);
}
ros::spin();
close(sock_cli);
return 0;
}
```
vedio_send_zcy.cpp
```#include <iostream>
#include <cv_bridge/cv_bridge.h>
#include <ros/ros.h>
#include <image_transport/image_transport.h>
#include <opencv2/opencv.hpp>
#include <unistd.h>//Linux系统下网络通讯的头文件集合
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include <malloc.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/ioctl.h>
#include <stdarg.h>
#include <fcntl.h>
#include <fcntl.h>
#include <mutex>
#include <thread>
#include "detection_result/detection_result_msg.h"
#include "object_detector_msgs/laser_electronic_result.h"
#include "sensor_driver_msgs/GpswithHeading.h"
#include "control_msgs/GetECUReport.h"
#include "lanelet_map_msgs/Way.h"
#include "plan2control_msgs/Trajectory.h"
using namespace std;
using namespace cv;
int PORT = 13010;
int PORT2 = 9999;
string IP = "192.168.199.205";
int heartbeat = 0;
//std::vector<cv::Mat> srcImage;
std::mutex mtx_0;
std::mutex mtx_1;
std::mutex mtx_2;
std::mutex mtx_gps;
std::mutex mtx_status;
std::mutex mtx_path;
std::mutex mtx_local_path;
double longitude = 100, altitude = 100, latitude = 100;
float speed = 0;
unsigned char gear;
typedef struct IMGMAT{
unsigned char head1;//the angle of camera turning
unsigned char head2;
unsigned int len;
unsigned char coord[65535];
}imagemat;
vector<double> globalPos_x;
vector<double> globalPos_y;
typedef struct CamCoord{
unsigned char head1;//the angle of camera turning
unsigned char head2;
unsigned int len;
double coord[65535];
}camcoord;
sockaddr_in client;
typedef struct Data
{
//header head;
unsigned char h1;
unsigned char h2;
unsigned char type;
unsigned short len1;
char data[65535-5];
}Data;
typedef struct ControlData
{
unsigned char h1;
unsigned char h2;
unsigned char power;
unsigned char start;
unsigned char gear;
// float steer;
// float throttle;
unsigned char s1;
unsigned char s2;
unsigned char s3;
unsigned char s4;
unsigned char t1;
unsigned char t2;
unsigned char t3;
unsigned char t4;
unsigned char park;
unsigned char emergency;
unsigned char Break;
unsigned char mode;
} controlData;
typedef union
{
float fdata;
unsigned long ldata;
}FloatLongType;
double a2=6378137;
double e2= 0.0818192*0.0818192;
vector<double> localPos_x;
vector<double> localPos_y;
//套接字和对应的句柄，用udp等网络编程在linux下都需要经过套接字，当时是为了
//以不同的频率向不同的端口发送信息，所以用了两个套接字
sockaddr_in server_vedio;
int socket_vedio;
sockaddr_in socket_add_result;
int socket_result;
//为了获取笔记本摄像头图像
VideoCapture capture(0);//打开摄像头
//当时为了发送三路图像，定义了三个Mat
Mat image_0,image_1,image_2;
//图片压缩过后会有大概四万还是多少个字节来着，放到下面这个数组里
uchar encodeImg[6553555];
//这两个time应该是为了控制频率
double lasttime=-1;
double lasttime_1 = -1;
//用来接收服务器发过来的命令
unsigned char flag_channel='2';
socklen_t len;
//这个函数可以不用理会，就是当时为了调试用的
void computercam(){
while(ros::ok()){
double timenow = ros::Time::now().toSec();
//控制图片进来的频率 ，电脑摄像头频率太高，这个条件可以降低发送的频率
if(lasttime != -1 && timenow - lasttime < 0.1){
// lasttime = timenow;
capture>>image_1;
continue;
}
lasttime = timenow;
mtx_1.lock();
if(capture.isOpened())
capture>>image_1;
mtx_1.unlock();
}
}
//下面这几个callback函数只是把图像存到对应的Mat里
void probecb(const object_detector_msgs::laser_electronic_resultConstPtr& msg){
mtx_0.lock();
image_0 = (cv_bridge::toCvCopy(msg->image_data)->image).clone();
mtx_0.unlock();
}
void front_vedio_cb(const sensor_msgs::ImageConstPtr& orgmsg){
mtx_1.lock();
image_1=(cv_bridge::toCvShare(orgmsg)->image).clone();
cv::resize(image_1,image_1,cv::Size(960,640));
mtx_1.unlock();
}
void leftimageCb(const sensor_msgs::ImageConstPtr& orgmsg){
mtx_0.lock();
image_0 = (cv_bridge::toCvCopy(orgmsg)->image).clone();
mtx_0.unlock();
}
void screen_cb(const sensor_msgs::ImageConstPtr& orgmsg)
{
mtx_2.lock();
image_2 = (cv_bridge::toCvShare(orgmsg)->image).clone();
cv::resize(image_2,image_2,cv::Size(image_2.cols/2,image_2.rows/2));
mtx_2.unlock();
}
//将一个float变成四个字节，比较傻的方法
void float_to_uchar(float b, unsigned char* sendbuf){
int a = b * 100000;
sendbuf[0] = a & 0xff;
sendbuf[1] = (a & 0xff00) >> 8;
sendbuf[2] = (a & 0xff0000) >> 16;
sendbuf[3] = (a & 0xff000000) >> 24;
}
void command(){
//recv
while(ros::ok())
{
unsigned char buf[1];
//接收从服务器（遥控端）发回来的命令
int n = recvfrom(socket_vedio, buf, sizeof(buf), 1,(sockaddr *)& server_vedio, &len);//接受缓存
if (n > 0) {
if(buf[0]=='0'||buf[0]=='1'||buf[0]=='2')
{
flag_channel = buf[0];
cout << "read command from server: " << flag_channel << endl;
}
}
std::cout << "in while .." << std::endl;
}
std::cout << " command done " << std::endl;
}
void process(){
while(ros::ok()){
// std::cout << "in process --" << PORT << std::endl;
double timenow=ros::Time::now().toSec();
lasttime = timenow;
Mat imgsend;
//根据接收到的命令将imgsend指向对应的图像进行发送
// if(flag_channel == '0'){
// mtx_0.lock();
// imgsend = image_0.clone();
// mtx_0.unlock();
// }else if(flag_channel == '1'){
// mtx_1.lock();
// imgsend = image_1.clone();
// mtx_1.unlock();
// }else if(flag_channel == '2'){
// mtx_2.lock();
// imgsend = image_2.clone();
// mtx_2.unlock();
// }else{
// cout<<"wtf"<<endl;
// }
//截图
mtx_2.lock();
imgsend = image_1.clone();
mtx_2.unlock();
if(!imgsend.empty()){
imagemat screenImg;
screenImg.head1 = 0xF4;
screenImg.head2 = 0x03;
screenImg.len = localPos_x.size();
// //图像压缩
std::vector<uchar> data_encode;
std::vector<int> quality;
quality.push_back(CV_IMWRITE_JPEG_QUALITY);
quality.push_back(60);//进行50%的压缩
imencode(".jpg", imgsend, data_encode,quality);//将图像编码
screenImg.len =data_encode.size();
//cout << "image size " << screenImg.len << endl;
//图像压缩完毕
//将压缩好的图像（变成了一个个存在vector里的字节）写到buf里准备发送
for (int i = 0; i < screenImg.len; i++)
{
screenImg.coord[i] = data_encode[i];
}
//显示
// Mat image_result = imdecode(data_encode, CV_LOAD_IMAGE_COLOR);
// int u1=1;
// char imageFilePath1[200];
// sprintf(imageFilePath1, "%s%d%s", "/home/zcy/", u1++, ".png");
// imwrite(imageFilePath1, image_result);
// //发送
char *sPack = (char *) &screenImg;
sendto(socket_vedio, sPack, screenImg.len+6, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
memset(&encodeImg, 0, sizeof(encodeImg));
}
usleep(100000);
}
}
void receive(){
while(ros::ok()){
//接收任务文件
unsigned char buf[65535];
int n = recvfrom(socket_vedio, buf, sizeof(buf), 0,(sockaddr *)& server_vedio,&len);//接受缓存
std::cout << "heard somthing ---------------------------" << std::endl;
if ((buf[0] == 0xF3) && (buf[1] == 0x00)) {
controlData control;
memcpy(&control, buf, sizeof(ControlData));
// int power = buf[2], start = buf[3], gear = buf[4], park = buf[13], emergencyBreak = buf[14], Break = buf[15], mode = buf[16];
// int steer1 = buf[5], steer2 = buf[6], steer3 = buf[7], steer4 = buf[8], throttle1 = buf[9], throttle2 = buf[10], throttle3 = buf[11], throttle4 = buf[12];
cout << "电源总开关 " << (int) control.power << endl;
cout << "车辆启动 " << (int) control.start << endl;
cout << "档位 " << (int) control.gear << endl;
// cout << "转向 " << control.steer << endl;
// cout << "油门 " << control.throttle << endl;
// cout << "转向 " << hex << " " << (int) control.s1 << " " << (int) control.s2 << " " << (int) control.s3 << " " << (int) control.s4 << endl;
// cout << "油门 " << hex << " " << (int) control.t1 << " " << (int) control.t2 << " " << (int) control.t3 << " " << (int) control.t4 << endl;
FloatLongType fls;
fls.ldata=0;
fls.ldata = control.s4;
fls.ldata=(fls.ldata<<8)|control.s3;
fls.ldata=(fls.ldata<<8)|control.s2;
fls.ldata=(fls.ldata<<8)|control.s1;
float fs = fls.fdata;
cout << "转向 " << 4 * fs << endl;
FloatLongType flt;
flt.ldata=0;
flt.ldata = control.t4;
flt.ldata=(flt.ldata<<8)|control.t3;
flt.ldata=(flt.ldata<<8)|control.t2;
flt.ldata=(flt.ldata<<8)|control.t1;
float ft = flt.fdata;
cout << "油门 " << ft << endl;
cout << "驻车 " << (int) control.park << endl;
cout << "紧急停车 " << (int) control.emergency << endl;
cout << "制动 " << (int) control.Break << endl;
cout << "工作方式 " << (int) control.mode << endl;
cout << "controlling" << endl;
// cout << "电源总开关 " << power << endl;
// cout << "车辆启动 " << start << endl;
// cout << "档位 " << gear << endl;
// cout << dec << "转向 " << str << endl;
//
// cout << dec << "油门 " << tht << endl;
//
// cout << dec << "驻车 " << park << endl;
// cout << "紧急停车 " << emergencyBreak << endl;
// cout << "制动 " << Break << endl;
// cout << "工作方式 " << mode << endl;
// cout << "controlling" << endl;
}
// if ((buf[1]==0xF4)&&(buf[0]==0x04))
// {
// cout<<"got task point "<<endl;
// }
// struct header header_udp;
// memcpy(&header_udp,buf,sizeof(buf));
// memcpy(&header_udp,buf,sizeof(header_udp)+1);
else if ((buf[0] == 0xF3) && (buf[1] == 0x10)) {
Data AA;
memcpy(&AA, buf, sizeof(Data));
unsigned short length = AA.len1;
// length=length|AA.len1;
// length=length<<8;
// length=length|AA.len2;
// cout<<"length"<<length<<endl;
// unsigned short data_len=AA.len;
// cout<<sizeof(data_len)<<endl;
// cout<<data_len<<endl;
// unsigned short data=AA.data;
// cout<<sizeof(data)<<endl;
// cout<<data<<endl;
//FILE *fp = fopen("/home/zcy/taskfile/jidong.txt", "w");
// if(AA.type==0x01)
// fp = fopen("/home/zcy/taskfile/jidong", "w");
// else if(AA.type==0x02)
// fp = fopen("/home/zcy/taskfile/zhencha", "w");
// else if(AA.type==0x03)
// fp = fopen("/home/zcy/taskfile/xunluo", "w");
cout << "got task point ------zxzxzxzxzx-------- " << endl;
std::cout << "the lengh is ......" << length << std::endl;
// string s;
// s=AA.data;
std::fstream f;
f.open("/home/zx/taskfile/jidong.txt", ios::out | ios::binary);
f.write(AA.data, length - 1);
f.close();
sendto(socket_vedio, buf, 3, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
// int nwrite = fwrite(AA.data, sizeof(char), 65535, fp);
// fflush(fp);
// int duphandle;
// duphandle=dup(fileno(fp));
// close(duphandle);
// fclose(fp);
}
if ((buf[0]==0xF3)&&(buf[1]==0x11))
{
cout<<"got task command"<<endl;
std::cout << buf[2] + '0' << std::endl;
// ros::NodeHandle nodehandle_;
// ros::Publisher commandSender;
// commandSender = nodehandle_.advertise<command_msg::task>("task_command", 1);
// task_command[0]=buf_command[2];
// command_msg::task ogm_msg;
// ogm_msg.task = task_command[0];
// commandSender.publish(ogm_msg);
}
//接收任务命令
// 测试接收控制命令
// unsigned char buf_control[11];
// int c = recvfrom(socket_vedio, buf_control, sizeof(buf_control), 0,(sockaddr *)& client,&len);
usleep(10000);
}
}
void gpscallback(const sensor_driver_msgs::GpswithHeadingConstPtr& gpsmsg){
mtx_gps.lock();
latitude = gpsmsg->gps.latitude;
longitude = gpsmsg->gps.longitude;
altitude = gpsmsg->gps.altitude;
mtx_gps.unlock();
// cout<<"latitude: "<<latitude<<endl;
}
void statuscallback(const control_msgs::GetECUReportConstPtr& status_msg){
//std::cout << "got ecudata -- " << std::endl;
mtx_status.lock();
speed = (float) status_msg->speed.velocity.linear.x;
gear = (char)status_msg->shift_cur.gear;
mtx_status.unlock();
}
void pathcallback(const lanelet_map_msgs::Way &global_path_msg){
// cout<<"lanelet_map_msgs.points.size(): "<<global_path_msg.points.size()<<endl;
mtx_path.lock();
globalPos_x.clear();
globalPos_y.clear();
for(int i=0;i<global_path_msg.points.size();i++) {
globalPos_x.push_back( global_path_msg.points.at(i).point.x);
globalPos_y.push_back( global_path_msg.points.at(i).point.y);
}
mtx_path.unlock();
}
void local_pathcallback(const plan2control_msgs::Trajectory &path_msg){
// cout<<"plan2control_msgs.points.size(): "<<path_msg.points.size()<<endl;
mtx_local_path.lock();
localPos_x.clear();
localPos_y.clear();
for(int i=0;i<path_msg.points.size();i++) {
localPos_x.push_back(path_msg.points.at(i).position.x);
localPos_y.push_back(path_msg.points.at(i).position.y);
}
mtx_local_path.unlock();
}
int main(int argc, char ** argv)
{
ros::init(argc, argv, "vedio_send");
ros::NodeHandle nh;
//从launch文件里面获得需要发送到的目标Ip地址，端口等信息，这些有默认值（写在上面全局变量）
ros::param::get("ip",IP);
ros::param::get("~port",PORT);
ros::param::get("~port2",PORT2);
cout<<"========视频传输客户端IP=========="<<IP<<endl;
cout<<"========视频传输客户端PORT=========="<<PORT<<endl;
cout<<"========PORT2=========="<<PORT2<<endl;
// ImageDeal imgd(nh);
int count = 0;
//下面是发送信息前的一些准备工作，主要是把套接字跟目标的IP和端口绑定起来，
//这样信息就可以通过套接字发送到指定IP地址的电脑上的制定端口，
//接收端电脑（服务器）只需要监听自己的这个端口就可以收到信息了
if ((socket_vedio = socket(AF_INET, SOCK_DGRAM, 0)) < 0) //创建socket句柄，采用UDP协议
{
printf("create socket error: %s(errno: %d)\n", strerror(errno), errno);
return -1;
}
memset(&server_vedio, 0, sizeof(server_vedio)); //初始化结构体
server_vedio.sin_family = AF_INET; //设置通信方式
server_vedio.sin_addr.s_addr = inet_addr(IP.c_str());
server_vedio.sin_port = htons(PORT);//设置需要发送的IP和端口号
bind(socket_vedio, (sockaddr*)&server_vedio, sizeof(server_vedio));//绑定端口号
//下面这个套接字程序里面没用，因为后来程序改了，不需要发送不同频率的东西了
//所以你可以用来发送点云
if ((socket_result = socket(AF_INET, SOCK_DGRAM, 0)) < 0) //创建socket句柄，采用UDP协议
{
printf("create socket error: %s(errno: %d)\n", strerror(errno), errno);
return -1;
}
memset(&socket_add_result, 0, sizeof(socket_add_result)); //初始化结构体
socket_add_result.sin_family = AF_INET; //设置通信方式
socket_add_result.sin_addr.s_addr = inet_addr(IP.c_str());
socket_add_result.sin_port = htons(PORT2);//设置需要发送的IP和端口号
bind(socket_result, (sockaddr*)&socket_add_result, sizeof(socket_add_result));//绑定端口号
//下面是订阅的三路图像
// ros::Subscriber sub_front=nh.subscribe("/image", 1,front_vedio_cb);//前视摄像头数据
ros::Subscriber sub_screeb = nh.subscribe("screen_image_topic", 1, screen_cb);//屏幕截图
// ros::Subscriber sub_probe = nh.subscribe("realtime_video_topic", 1, probecb);//侦察视频
// ros::Subscriber sub_left = nh.subscribe("/left_image", 1, leftimageCb);//左侧相机--比赛时用他来代替侦察相机
//todo:这里可以增加一个接收点云的回调函数，接收到之后直接在该函数里发送即可
//这两个是后来添加的话题，唐波需要我发过去
ros::Subscriber sub_gps = nh.subscribe("/sensor_fusion_output", 1, gpscallback);//只用了这里面的经纬高度
ros::Subscriber sub_status = nh.subscribe("ecudatareport", 1, statuscallback);//只发送了这里面的档位和速度
//全局规划任务点 zcy0113
ros::Subscriber sub_path = nh.subscribe("/topology_global_path", 1, pathcallback);//
//局部规划任务点 zcy
ros::Subscriber sub_Localpath = nh.subscribe("/global_path/traj_plan", 1, local_pathcallback);//
//接收命令线程 -- 这个线程是用来接收服务器（或者是遥控端）发过来的命令，
//根据命令发送对应的三路图像中的一路
//std::thread thread3{command};//zcy
//整体的发送在这里面进行
std::thread thread4{process};
std::thread thread_receive{receive};
std::thread thtead_computercam{computercam};
// thread4.join();
ros::spin();
close(socket_vedio);
}
```
vedio_send.cpp
```#include <iostream>
#include <cv_bridge/cv_bridge.h>
#include <ros/ros.h>
#include <image_transport/image_transport.h>
#include <opencv2/opencv.hpp>
#include <unistd.h>//Linux系统下网络通讯的头文件集合
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include <malloc.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/ioctl.h>
#include <stdarg.h>
#include <fcntl.h>
#include <fcntl.h>
#include <mutex>
#include <thread>
#include "detection_result/detection_result_msg.h"
#include "object_detector_msgs/laser_electronic_result.h"
#include "sensor_driver_msgs/GpswithHeading.h"
#include "control_msgs/GetECUReport.h"
using namespace std;
using namespace cv;
int PORT = 6667;
int PORT2 = 9999;
string IP = "192.168.8.119";
//std::vector<cv::Mat> srcImage;
std::mutex mtx_0;
std::mutex mtx_1;
std::mutex mtx_2;
std::mutex mtx_gps;
std::mutex mtx_status;
float longitude = 0, altitude = 0, latitude = 0;
float speed = 0;
unsigned char gear;
//套接字和对应的句柄，用udp等网络编程在linux下都需要经过套接字，当时是为了
//以不同的频率向不同的端口发送信息，所以用了两个套接字
sockaddr_in server_vedio;
int socket_vedio;
sockaddr_in socket_add_result;
int socket_result;
//为了获取笔记本摄像头图像
VideoCapture capture(0);//打开摄像头
//当时为了发送三路图像，定义了三个Mat
Mat image_0,image_1,image_2;
//图片压缩过后会有大概四万还是多少个字节来着，放到下面这个数组里
uchar encodeImg[6553555];
//这两个time应该是为了控制频率
double lasttime=-1;
double lasttime_1 = -1;
//用来接收服务器发过来的命令
unsigned char flag_channel='2';
socklen_t len;
//class ImageDeal
//{
// ros::NodeHandle& _nh;
// ros::Subscriber _sub;
//
//public:
// cv::Mat _srcImage;
// ImageDeal(ros::NodeHandle& nh):_nh(nh)
// {
// _sub=_nh.subscribe("/image", 1, &ImageDeal::imageCb, this);
//
// }
// ~ImageDeal()
// {
// cv::destroyAllWindows();
// }
//
// void imageCb(const sensor_msgs::ImageConstPtr& orgmsg)
// {
// mtx.lock();
// _srcImage = (cv_bridge::toCvShare(orgmsg)->image).clone();
// mtx.unlock();
// // if(_srcImage.empty())
// // std::cout << "Can't get image!" << std::endl;
// // else
// // std::cout << "Get one image!" << std::endl;
// }
//};
//这个函数可以不用理会，就是当时为了调试用的
void computercam(){
while(ros::ok()){
double timenow = ros::Time::now().toSec();
//控制图片进来的频率 ，电脑摄像头频率太高，这个条件可以降低发送的频率
if(lasttime != -1 && timenow - lasttime < 0.1){
// lasttime = timenow;
capture>>image_1;
continue;
}
lasttime = timenow;
mtx_1.lock();
if(capture.isOpened())
capture>>image_1;
mtx_1.unlock();
}
}
//下面这几个callback函数只是把图像存到对应的Mat里
void probecb(const object_detector_msgs::laser_electronic_resultConstPtr& msg){
mtx_0.lock();
image_0 = (cv_bridge::toCvCopy(msg->image_data)->image).clone();
mtx_0.unlock();
}
void front_vedio_cb(const sensor_msgs::ImageConstPtr& orgmsg){
mtx_1.lock();
image_1=(cv_bridge::toCvShare(orgmsg)->image).clone();
cv::resize(image_1,image_1,cv::Size(960,640));
mtx_1.unlock();
}
void leftimageCb(const sensor_msgs::ImageConstPtr& orgmsg){
mtx_0.lock();
image_0 = (cv_bridge::toCvCopy(orgmsg)->image).clone();
mtx_0.unlock();
}
void screen_cb(const sensor_msgs::ImageConstPtr& orgmsg)
{
mtx_2.lock();
image_2 = (cv_bridge::toCvShare(orgmsg)->image).clone();
cv::resize(image_2,image_2,cv::Size(image_2.cols/2,image_2.rows/2));
mtx_2.unlock();
}
//将一个float变成四个字节，比较傻的方法
void float_to_uchar(float b, unsigned char* sendbuf){
int a = b * 100000;
sendbuf[0] = a & 0xff;
sendbuf[1] = (a & 0xff00) >> 8;
sendbuf[2] = (a & 0xff0000) >> 16;
sendbuf[3] = (a & 0xff000000) >> 24;
}
void command(){
//recv
while(ros::ok())
{
unsigned char buf[1];
//接收从服务器（遥控端）发回来的命令
int n = recvfrom(socket_vedio, buf, sizeof(buf), 1,(sockaddr *)& server_vedio, &len);//接受缓存
if (n > 0) {
if(buf[0]=='0'||buf[0]=='1'||buf[0]=='2')
{
flag_channel = buf[0];
cout << "read command from server: " << flag_channel << endl;
}
}
std::cout << "in while .." << std::endl;
}
std::cout << " command done " << std::endl;
}
void process(){
while(ros::ok()){
std::cout << "in process --" << std::endl;
double timenow=ros::Time::now().toSec();
lasttime = timenow;
Mat imgsend;
//根据接收到的命令将imgsend指向对应的图像进行发送
if(flag_channel == '0'){
mtx_0.lock();
imgsend = image_0.clone();
mtx_0.unlock();
}else if(flag_channel == '1'){
mtx_1.lock();
imgsend = image_1.clone();
mtx_1.unlock();
}else if(flag_channel == '2'){
mtx_2.lock();
imgsend = image_2.clone();
mtx_2.unlock();
}else{
cout<<"wtf"<<endl;
}
if(!imgsend.empty()){
//图像压缩
std::vector<uchar> data_encode;
std::vector<int> quality;
quality.push_back(CV_IMWRITE_JPEG_QUALITY);
quality.push_back(10);//进行50%的压缩
imencode(".jpg", imgsend, data_encode,quality);//将图像编码
int nSize=data_encode.size();
//图像压缩完毕
//将压缩好的图像（变成了一个个存在vector里的字节）写到buf里准备发送
for (int i = 0; i < nSize; i++)
{
encodeImg[i] = data_encode[i];
}
//发送
sendto(socket_vedio, encodeImg, nSize, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
memset(&encodeImg, 0, sizeof(encodeImg));
}else{//如果需要的图像是空的话，发送屏幕截图，通常这个不是空的，保证有图像发出去（没什么实际意义）
if(!image_2.empty()){
std::vector<uchar> data_encode;
std::vector<int> quality;
quality.push_back(CV_IMWRITE_JPEG_QUALITY);
quality.push_back(90);//进行50%的压缩
mtx_2.lock();
imencode(".jpg", image_2, data_encode,quality);//将图像编码
mtx_2.unlock();
int nSize=data_encode.size();
// cout<<"size is "<<nSize<<endl;
for (int i = 0; i < nSize; i++)
{
encodeImg[i] = data_encode[i];
// cout<<i<<" "<<nSize<<endl;
}
sendto(socket_vedio, encodeImg, nSize, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
memset(&encodeImg, 0, sizeof(encodeImg)); //初始化结构体
}
}
//这个是为了发送经纬度，当经度不是0的时候任务是有效点可以发送了
if(latitude > 10){
unsigned char send_buf_gps[12];
mtx_gps.lock();
float_to_uchar(longitude, send_buf_gps);
float_to_uchar(latitude, send_buf_gps + 4);
float_to_uchar(altitude, send_buf_gps + 8);
mtx_gps.unlock();
sendto(socket_vedio, send_buf_gps, 12, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
}
//发送车辆信息
unsigned char send_buf_status[6];
send_buf_status[0] = 231;//第一个字节==231代表传输的是状态信息
mtx_status.lock();
float_to_uchar(speed, send_buf_status + 1);
send_buf_status[5] = (unsigned char) gear;//第六个字节代表档位
mtx_status.unlock();
sendto(socket_vedio, send_buf_status, 6, 0, (const sockaddr*)& server_vedio, sizeof(server_vedio));
usleep(100000);
}
}
//这个函数没用到
void sendResult(){
while(ros::ok()){
if(!image_2.empty()){//!imgsend.empty()
std::vector<uchar> data_encode;
std::vector<int> quality;
quality.push_back(CV_IMWRITE_JPEG_QUALITY);
quality.push_back(10);//进行50%的压缩
mtx_2.lock();
imencode(".jpg", image_2, data_encode,quality);//将图像编码
mtx_2.unlock();
int nSize=data_encode.size();
// cout<<"size is "<<nSize<<endl;
for (int i = 0; i < nSize; i++)
{
encodeImg[i] = data_encode[i];
// cout<<i<<" "<<nSize<<endl;
}
sendto(socket_result, encodeImg, nSize, 0, (const sockaddr*)& socket_add_result, sizeof(socket_add_result));
memset(&encodeImg, 0, sizeof(encodeImg)); //初始化结构体
// imshow("rsult",imgsend);
// waitKey(5);
}
sleep(1);
}
}
void gpscallback(const sensor_driver_msgs::GpswithHeadingConstPtr& gpsmsg){
mtx_gps.lock();
latitude = gpsmsg->gps.latitude;
longitude = gpsmsg->gps.longitude;
altitude = gpsmsg->gps.altitude;
mtx_gps.unlock();
}
void statuscallback(const control_msgs::GetECUReportConstPtr& status_msg){
std::cout << "got ecudata -- " << std::endl;
mtx_status.lock();
speed = (float) status_msg->speed.velocity.linear.x;
gear = (char)status_msg->shift_cur.gear;
mtx_status.unlock();
}
int main(int argc, char ** argv)
{
ros::init(argc, argv, "vedio_send");
ros::NodeHandle nh;
//从launch文件里面获得需要发送到的目标Ip地址，端口等信息，这些有默认值（写在上面全局变量）
ros::param::get("ip",IP);
ros::param::get("~port",PORT);
ros::param::get("~port2",PORT2);
cout<<"========视频传输客户端IP=========="<<IP<<endl;
cout<<"========视频传输客户端PORT=========="<<PORT<<endl;
cout<<"========PORT2=========="<<PORT2<<endl;
// ImageDeal imgd(nh);
int count = 0;
//下面是发送信息前的一些准备工作，主要是把套接字跟目标的IP和端口绑定起来，
//这样信息就可以通过套接字发送到指定IP地址的电脑上的制定端口，
//接收端电脑（服务器）只需要监听自己的这个端口就可以收到信息了
if ((socket_vedio = socket(AF_INET, SOCK_DGRAM, 0)) < 0) //创建socket句柄，采用UDP协议
{
printf("create socket error: %s(errno: %d)\n", strerror(errno), errno);
return -1;
}
memset(&server_vedio, 0, sizeof(server_vedio)); //初始化结构体
server_vedio.sin_family = AF_INET; //设置通信方式
server_vedio.sin_addr.s_addr = inet_addr(IP.c_str());
server_vedio.sin_port = htons(PORT);//设置需要发送的IP和端口号
bind(socket_vedio, (sockaddr*)&server_vedio, sizeof(server_vedio));//绑定端口号
//下面这个套接字程序里面没用，因为后来程序改了，不需要发送不同频率的东西了
//所以你可以用来发送点云
if ((socket_result = socket(AF_INET, SOCK_DGRAM, 0)) < 0) //创建socket句柄，采用UDP协议
{
printf("create socket error: %s(errno: %d)\n", strerror(errno), errno);
return -1;
}
memset(&socket_add_result, 0, sizeof(socket_add_result)); //初始化结构体
socket_add_result.sin_family = AF_INET; //设置通信方式
socket_add_result.sin_addr.s_addr = inet_addr(IP.c_str());
socket_add_result.sin_port = htons(PORT2);//设置需要发送的IP和端口号
bind(socket_result, (sockaddr*)&socket_add_result, sizeof(socket_add_result));//绑定端口号
//下面是订阅的三路图像
ros::Subscriber sub_front=nh.subscribe("/image", 1,front_vedio_cb);//前视摄像头数据
ros::Subscriber sub_screeb = nh.subscribe("screen_image_topic", 1, screen_cb);//屏幕截图
// ros::Subscriber sub_probe = nh.subscribe("realtime_video_topic", 1, probecb);//侦察视频
ros::Subscriber sub_left = nh.subscribe("/left_image", 1, leftimageCb);//左侧相机--比赛时用他来代替侦察相机
//todo:这里可以增加一个接收点云的回调函数，接收到之后直接在该函数里发送即可
//这两个是后来添加的话题，唐波需要我发过去
ros::Subscriber sub_gps = nh.subscribe("/sensor_fusion_output", 1, gpscallback);//只用了这里面的经纬高度
ros::Subscriber sub_status = nh.subscribe("ecudatareport", 1, statuscallback);//只发送了这里面的档位和速度
//接收命令线程 -- 这个线程是用来接收服务器（或者是遥控端）发过来的命令，
//根据命令发送对应的三路图像中的一路
std::thread thread3{command};
//整体的发送在这里面进行
std::thread thread4{process};
thread4.join();
ros::spin();
close(socket_vedio);
}
```
toyota_sender.py
```#!/usr/bin/env python
# -*- coding=utf-8 -*-
"""
file: txtSender.py
socket client
"""
import rospy
import socket
import os
import sys
import struct
import time
import signal
import pyproj
import numpy as np
import os
def quit(signum, frame):
print ''
print 'stop fusion'
sys.exit()
def socket_client():
# try:
# s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
# #sk.connect_ex(address)
# s.connect_ex(('192.168.43.232', 6666))
# except socket.error as msg:
# print msg
# rospy.init_node("txtsender")
# port = rospy.get_param('~port')
# ip = rospy.get_param('ip')
path = os.path.expanduser('~')
s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
while s.connect_ex(("192.168.10.30 ", 6666)) != 0:
print "wating for vehicle to open server ..."
time.sleep(1)
print s.recv(1024)
while 1:
filepath = path + '/taskfile/KYXZ2018A.txt'
if os.path.isfile(filepath):
# 定义定义文件信息。128s表示文件名为128bytes长，l表示一个int或log文件类型，在此为文件大小
fileinfo_size = struct.calcsize('128sl')
# 定义文件头信息，包含文件名和文件大小
fhead = struct.pack('128sl', os.path.basename(filepath),
os.stat(filepath).st_size)
s.send(fhead)
print 'client filepath: {0}'.format(filepath)
fp = open(filepath, 'rb')
while 1:
data = fp.read(1024)
if not data:
print '{0} file send over...'.format(filepath)
break
s.send(data)
s.close()
break
sys.exit('sending over')
def readTXT(fileName):
print('#########')
points = []
with open(fileName, 'r') as f:
for line in f.readlines():
line = line.strip().split(' ')
# line[0] is task point's number, multiple 10 for adding point
# added point's name should plus 1
point = [int(line[0]), float(line[1]), float(line[2]), float(line[3]), int(line[4])]
points.append(point)
print(point)
return points
def GCS2PCS(points, standard):
print('#########')
p1 = pyproj.Proj(init="epsg:4326")
p2 = pyproj.Proj(init="epsg:3857")
print("standard point {0}".format(standard))
standard_proj = standard
standard_proj = np.array(standard_proj)
standard_proj[0], standard_proj[1] = pyproj.transform(
p1, p2, standard_proj[0], standard_proj[1])
points_new = []
count = 1
for each in points:
if each[-1] == 3:
print('find type 3')
point = [each[1], each[2]]
point = np.array(point)
point[0], point[1] = pyproj.transform(p1, p2, point[0], point[1])
dist = np.linalg.norm(point - standard_proj)
print(dist)
if dist <= 90:
point_temp1 = [count, 116.100695, 40.155812, 0.0, 2]
points_new.append(point_temp1)
count += 1
point_temp1 = [count, 116.09951102, 40.15483262, 0.0, 2]
points_new.append(point_temp1)
count += 1
point_temp1 = [count, 116.09912492, 40.15564674, 0.0, 2]
points_new.append(point_temp1)
count += 1
each[1] = standard[0]
each[2] = standard[1]
print('<=90')
each[0] = count
points_new.append(each)
count += 1
return points_new
def writeTXT():
home = os.path.expanduser('~')
fileName = home + '/taskfile/KYXZ2018A.txt'
standard = [116.099804, 40.155690]
points = readTXT(fileName)
points_new = GCS2PCS(points, standard)
print('#########')
with open(fileName, 'w') as f:
for each in points_new:
line = '%d %.8f %.8f %.8f %d\n' % (int(each[0]), float(
each[1]), float(each[2]), float(each[3]), int(each[4]))
f.write(line)
print('write done')
if __name__ == '__main__':
# fileName = home + '/taskfile/KYXZ2018A.txt'
# writeTXT()
socket_client()```
tcp_server.cc
```#include <ros/ros.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <sys/shm.h>
#include <iostream>
#include <iomanip>
#include <opencv2/opencv.hpp>
#include <fstream>
int PORT=6668;
#define QUEUE 20
#define BUFFER_SIZE 655355
using namespace std;
int count_lati =0;
unsigned char imgbuf[7000000];
vector<string> names{"YIBIDIAN_1","YINBIDIAN_2","ZHENCHA1_1","ZHENCHA1_2","ZHENCHA2_1",
"ZHENCHA2_2","XUNLUO1_1","XUNLUO1_2","XUNLUO2_1","XUNLUO2_2","XUNLUO3_1","XUNLUO3_2","XUNLUO4_1","XUNLUO4_2"};
void uchar_to_float(unsigned char* buffer, float& longi, float& lati,float& alti){
// unsigned char buffer[4];
// memcpy(buffer, buffer,4);
longi = int ( buffer[0] | buffer[1] << 8 | buffer[2] <<16 | buffer[3] << 24) * 0.00001;
// memcpy(buffer,buffer+4,4);
lati = int ( buffer[4] | buffer[5] << 8 | buffer[6] <<16 | buffer[7] << 24) * 0.00001;
// memcpy(buffer, buffer+8,4);
alti = int ( buffer[8] | buffer[9] << 8 | buffer[10] <<16 | buffer[11] << 24) * 0.00001;
}
int main(int argc, char ** argv)
{
ros::init(argc, argv, "tcp_server");
ros::NodeHandle nh;
string local_dir;
ros::param::get("~local_dir", local_dir);
ros::param::get("~port",PORT);
ofstream outfile(local_dir+"ZUOBIAO_KYXZ2018A.txt", ios::out);
outfile.precision(10);
///定义sockfd
int server_sockfd = socket(AF_INET,SOCK_STREAM, 0);
///定义sockaddr_in
struct sockaddr_in server_sockaddr;
server_sockaddr.sin_family = AF_INET;
server_sockaddr.sin_port = htons(PORT);
server_sockaddr.sin_addr.s_addr = htonl(INADDR_ANY);
///bind，成功返回0，出错返回-1
while(bind(server_sockfd,(struct sockaddr *)&server_sockaddr,sizeof(server_sockaddr))==-1)
{
perror("bind");
sleep(1);
}
printf("检测结果接收程序--监听%d端口\n",PORT);
cout<<"检测结果接收本地存储目录--"<<local_dir<<endl;
///listen，成功返回0，出错返回-1
if(listen(server_sockfd,QUEUE) == -1)
{
perror("listen");
exit(1);
}
///客户端套接字
unsigned char buffer[BUFFER_SIZE];
struct sockaddr_in client_addr;
socklen_t length = sizeof(client_addr);
printf("等待客户端连接\n");
///成功返回非负描述字，出错返回-1
int conn = accept(server_sockfd, (struct sockaddr*)&client_addr, &length);
if(conn<0)
{
perror("connect");
exit(1);
}
printf("客户端成功连接\n");
cv::Mat img_recv;
int width,height;
int pos = 0;
if(!ros::ok()){
close(conn);
close(server_sockfd);
}
while(ros::ok())
{
vector<unsigned char> decode;
memset(buffer,0,sizeof(buffer));
int n = recv(conn, buffer, sizeof(buffer),0);
if(buffer[0]==1){
width = int(buffer[1] | buffer[2] << 8);
height = int(buffer[3] | buffer[4] << 8);
cout<<"the size of pic is"<<width<<" "<<height<<endl;
img_recv.create(height,width,CV_8UC3);//(cv::Size(width,height),CV_8UC3);
cout<<"the size of pic is"<<width<<" ---------- "<<height<<endl;
}
if(buffer[0] == 21 ){
count_lati++;
float longi,lati,alti;
uchar_to_float(buffer+1, longi,lati,alti);
cout<<fixed<<setprecision(5)<<"receive "<<longi<<" "<<lati<<" "<<alti<<endl;
outfile<<"ZHENCHA1("<<longi<<" "<<lati<<" "<<alti<<")"<<endl;
}
if(buffer[0] == 22 ){
count_lati++;
float longi,lati,alti;
uchar_to_float(buffer+1, longi,lati,alti);
cout<<fixed<<setprecision(5)<<"receive "<<longi<<" "<<lati<<" "<<alti<<endl;
outfile<<"ZHENCHA2("<<longi<<" "<<lati<<" "<<alti<<")"<<endl;
}
if(count_lati == 2){
outfile.close();
}
if(buffer[0] == 3){
if(n == 1001){
// cout<<"got a full buf"<<endl;
memcpy(imgbuf+pos,buffer+1,1000);
pos+=1000;
}else{
cout<<"ending........."<<endl;
memcpy(imgbuf+pos,buffer+1,n-2);
unsigned char imgdata[3*width*height];
memcpy(imgdata, imgbuf,3*width*height);
img_recv.data = imgdata;
pos = 0;
memset(imgbuf,0,sizeof(imgbuf));
int idx = int(buffer[n-1]);
cout<<"idx "<<idx<<endl;
if(idx < 14)
{
stringstream str;
str<<local_dir<<"/"<<names[idx]<<".jpg";
cv::imwrite(str.str(),img_recv);
}
cv::imshow("got",img_recv);
cv::waitKey(3);
}
}
char y = 'i';
send(conn, &y, 1, 0);
// if(n > 12){
// static int i = 0;
// i++;
// cout<<"------------ "<<n<<endl;
// while (pos < n)
// {
// decode.push_back(buffer[pos++]);//存入vector
// }
// //客户端发送exit或者异常结束时，退出
// if( n<=0)
// break;
// cv::Mat image_result = cv::imdecode(decode, CV_LOAD_IMAGE_COLOR);
// if(!image_result.empty()){
// stringstream str;
// str<<i<<".jpg";
// cv::imwrite(str.str(),image_result);
// cv::imshow("gottcp",image_result);
// cv::waitKey(3);
// }
// }
// if(n ==12) {//接收12个字节
// count_lati++;
// float longi,lati,alti;
// uchar_to_float(buffer, longi,lati,alti);
// cout<<fixed<<setprecision(5)<<"receive "<<longi<<" "<<lati<<" "<<alti<<endl;
// outfile<<"ZHENCHA1("<<longi<<" "<<lati<<" "<<alti<<")"<<endl;
// if(count_lati == 2)
// outfile.close();
// }
// if(n == 4){
// static int i=0;
// i++;
// cout<<"before"<<int(buffer[0])<<" "<<int(buffer[1])<<" "<<int(buffer[2])<<" "<<int(buffer[3])<<endl;
// int width = int(buffer[0] | buffer[1] << 8);
// int height = int(buffer[2] | buffer[3] << 8);
// cout<<"after"<<int(buffer[0])<<" "<<int(buffer[1])<<" "<<int(buffer[2])<<" "<<int(buffer[3])<<endl;
// cout<<"the size of pic is"<<width<<" "<<height<<" "<<i<<endl;
// }
// cout<<int(buffer[0])<<" "<<int(buffer[1])<<" "<<int(buffer[2])<<" "<<int(buffer[3])<<" "<<endl;
// float b = int ( buffer[0] | buffer[1] << 8 | buffer[2] <<16 | buffer[3] << 24) * 0.00001;
// cout << "the server got "<<b<<" from client "<<endl;
// usleep(100000);
}
// ros::spin();
return 0;
}
```
6t_receiver.py
```#!/usr/bin/env python
# -*- coding=utf-8 -*-
"""
file: txtReceiver.py
socket service
"""
import rospy
import socket
import threading
import time
import sys
import os
import struct
import roslib
def socket_service():
# rospy.init_node('receiver')
# port = rospy.get_param('~port')
# ip = rospy.get_param('~selfip')
# # print path
# print "============task file receiver port=========%d" % port
# print "============local ip ===========%r" % ip
try:
s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
s.bind(("192.168.199.204", 6666))
s.listen(10)
except socket.error as msg:
print(msg)
sys.exit(1)
print('Waiting connection...')
while 1:
conn, addr = s.accept()
deal_data(conn, addr)
# t = threading.Thread(target=deal_data, args=(conn, addr))
# t.start()
def deal_data(conn, addr):
print('Accept new connection from {0}'.format(addr))
#conn.settimeout(500)
conn.send('Hi, Welcome to the server!')
path = os.path.expanduser('~')
if 1:
fileinfo_size = struct.calcsize('128sl')
buf = conn.recv(fileinfo_size)
if buf:
filename, filesize = struct.unpack('128sl', buf)
print "--------------------------------------------%d" % filesize
fn = filename.strip('\00')
# new_filename = os.path.join('./', + fn)
recvd_size = 0 # 定义已接收文件的大小
newname = path + '/taskfile/KYXZ2018A.txt'
print('file new name is {0}, filesize is {1}'.format(newname,
filesize))
fp = open(newname, 'wb')
print('start receiving...')
while not recvd_size == filesize:
if filesize - recvd_size > 1024:
data = conn.recv(1024)
recvd_size += len(data)
else:
data = conn.recv(filesize - recvd_size)
recvd_size = filesize
fp.write(data)
fp.close()
# print('end receive...')
conn.close()
sys.exit('end receive...')
# break
if __name__ == '__main__':
# rospy.init_node('receiver')
# global port
# port = 6666
# port = rospy.get_param('~port' , 347)
# print "============port=========%d" % port
socket_service()
# rospy.spin()```
get_data.py
```
#!/usr/bin/env python
# -*- coding:utf-8 -*-
import rospy
from std_msgs.msg import String
import sys
import os.path
from cv_bridge import CvBridge
import os
os.environ['TF_CPP_MIN_LOG_LEVEL'] = '2'
def callback(data):
print("-------------have successful get data:%s"%data)
def get_data():
rospy.init_node('get_data', anonymous=True)
rospy.Subscriber('road_type', String, callback)
# spin() simply keeps python from exiting until this node is stopped
rospy.spin()
if __name__ == '__main__':
print "sldkffja;ldfkjsldf"
get_data()
```
t.py
```#!/usr/bin/env python
# license removed for brevity
import sys
import rospy
import signal
import numpy as np
import cv2
# for windows, mac users
# from PIL import ImageGrab
# for linux users
import pyscreenshot as ImageGrab
import time
from sensor_msgs.msg import Image
from cv_bridge import CvBridge, CvBridgeError
def quit(signum, frame):
print ''
print 'stop fusion'
sys.exit()
def screen_cap():
rospy.init_node('listener', anonymous=True)
# cap = cv2.VideoCapture(0)
bridge = CvBridge()
publisher = rospy.Publisher('screen_image_topic', Image, queue_size=10)
i = 0
#change to the window name you need
windows = ['Blender', 'Home', 'System Settings']
lenth = len(windows)
while True:
# get the size of the first window, notice for now its just the first!!!!!!!!!!!!!!1
name = windows[0]
check_win_name(name)
rm_above(name)
add_above(name)
win_attr = get_win_attr(name)
x1 = int(win_attr[1])
y1 = int(win_attr[2])
x2 = int(win_attr[1]) + int(win_attr[3])
y2 = int(win_attr[2]) + int(win_attr[4])
area = (x1, y1, x2, y2)
# capture computer screen
img = ImageGrab.grab(bbox=area)
# img.show()
# convert image to numpy array
img_np = np.array(img)
# convert color space from BGR to RGB
frame = cv2.cvtColor(img_np, cv2.COLOR_BGR2RGB)
immsg = bridge.cv2_to_imgmsg(frame, encoding="bgr8")
try:
publisher.publish(immsg)
except CvBridgeError as e:
print(e)
# show image on OpenCV frame
# name = '~/save/%d.png' % i
# cv2.imwrite(name,frame)
i = i+1
# cv2.imshow("Screen", frame)
# write frame to video writer
time.sleep(0.1)
if cv2.waitKey(1) == 27:
break
cv2.destroyAllWindows()
# while(cap.isOpened()):
# ret, frame = cap.read()
# # cv2.imshow('WindowName', frame)
# immsg = bridge.cv2_to_imgmsg(frame, encoding="bgr8")
# try:
# publisher.publish(immsg)
# except CvBridgeError as e:
# print(e)
# if cv2.waitKey(25) & 0xFF == ord('q'):
# cap.release()
# cv2.destroyAllWindows()
# break
if __name__ == '__main__':
signal.signal(signal.SIGINT, quit)
signal.signal(signal.SIGTERM, quit)
try:
screen_cap()
except rospy.ROSInterruptException:
pass
```
get_image.py
```#!/usr/bin/env python
#-*-coding:utf-8-*-
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import rospy
from std_msgs.msg import String
from sensor_msgs.msg import Image
from cv_bridge import CvBridge
import json
from PIL import Image as IImage
import logging
import commentjson
import collections
import cv2
import numpy as np
import sys
import scipy as scp
import scipy.misc
import tensorflow as tf
from tensorflow.python.platform import gfile
import os.path
import os
os.environ['TF_CPP_MIN_LOG_LEVEL'] = '2'
def callback(data):
bridge=CvBridge()
img_raw=bridge.imgmsg_to_cv2(data,"bgr8")#图像是uint８格式
#######--------------------------------------------------------------######
#b, g, r = img_raw.split()
#image = IImage.merge("RGB", (r, g, b))
#######--------------------------------------------------------------######
#img_raw1=img_raw.astype(np.float32)
#b, g, r = img_raw1.split()
#image = IImage.merge("RGB", (r, g, b))
####----------------------------------------------------------------######
#data = np.asarray(img_raw)
#image = IImage.fromarray(np.roll(data, 1, axis=-1))
####----------------------------------------------------------------######
#data = np.asarray(img_raw)
#data1=data.astype(np.float32)
#b, g, r = data1.split()
#image = IImage.merge("RGB", (r, g, b))
####----------------------------------------------------------------######
image = cv2.cvtColor(img_raw, cv2.COLOR_BGR2RGB)
global image_dir,video_dir,videoWriter
#轉換圖像大小
#img=tf.image.resize_images(img,(480,960),0)
#image=sess.run(img)
#cv2.imshow("green_image",green_image)
global count
#new_name = name.split('_')[0] + "_road_" + name.split('_')[1]
new_name = "%s"%count + ".jpg"
save_file = os.path.join(image_dir, new_name)
scp.misc.imsave(save_file, image)
#save_file = os.path.join(raw_image_softmax, new_name)
#scp.misc.imsave(save_file, output_im)
#save_file = os.path.join(raw_image_rb, new_name)
#scp.misc.imsave(save_file, ov_image)
videoWriter.write(image)
output_string="The images and video successfully write"
count+=1
try:
pub = rospy.Publisher('get_image', String, queue_size=10)
#rospy.init_node('road_identify', anonymous=True)
rate = rospy.Rate(10) # 10hz
#while not rospy.is_shutdown():
rospy.loginfo(output_string)
pub.publish(output_string)
rate.sleep()
except rospy.ROSInterruptException:
pass
# #写入图片
# img=tf.image.convert_image_dtype(img,dtype=tf.uint8)
# img=tf.image.encode_jpeg(img)
# with tf.gfile.GFile('./trans/%s.jpg'%(i+1),'wb') as f:
# f.write(img.eval())
def main(_):
global image_dir,video_dir,videoWriter
#current_dir=os.getcwd()#当前路径,ros在/home/dzl/catkin_ws下調用concreteroad.py，當前路勁爲/home/dzl/catkin_ws
current_dir='/home/dzl/catkin_ws/src/get_data/src'
image_dir = os.path.join(current_dir,'image')
if not os.path.exists(image_dir):
os.makedirs(image_dir)
video_dir = os.path.join(current_dir,'video')
if not os.path.exists(video_dir):
os.makedirs(video_dir)
#hypes['dirs']['image_dir'] =image_dir
#hypes['dirs']['video_dir'] =video_dir
fps=15
size=(960,480)
video=os.path.join(video_dir,'raw.avi')
videoWriter = cv2.VideoWriter(video, cv2.VideoWriter_fourcc('I','4','2','0'), fps, size)
global count
count=0
rospy.init_node('get_image', anonymous=True)
rospy.Subscriber('image', Image, callback)
# spin() simply keeps python from exiting until this node is stopped
rospy.spin()
videoWriter.release()
cv2.destroyAllWindows()
if __name__ == '__main__':
tf.app.run()
```
modifyTasks.py
```#!/usr/bin/env python3
# -*- coding=utf-8 -*-
from lxml import etree
# from pykml.parser import Schema
from pykml.factory import KML_ElementMaker as KML
from pykml import parser
# from pykml.factory import GX_ElementMaker as GX
import os
def addTitle(fileName):
with open(fileName, "r+") as f:
old = f.read()
f.seek(0)
title = 'num lon lat alt attr\n'
f.write(title)
f.write(old)
print('Added title')
def readTXT(fileName):
points = []
with open(fileName, 'r') as f:
for line in f.readlines():
line = line.strip().split(' ')
# line[0] is task point's number, multiple 10 for adding point
# added point's name should plus 1
point = [int(line[0]) * 10, float(line[1]),
float(line[2]), float(line[3]), int(line[4])]
points.append(point)
print(point)
return points
def creatPlacemark(point, colorTag):
defaultView = {'lon': 116.1120793889676,
'lat': 40.15788423720766,
'alt': 0,
'range': 3108.303488980141,
'tilt': 29.76964560740583,
'heading': 0}
colorTag = '#' + colorTag
name = str(point[0])
coor = '%.8f,%.8f,%.8f' % (point[1], point[2], point[3])
placemark = KML.Placemark(
KML.name(name),
KML.Lookat(
KML.longitude(defaultView['lon']),
KML.latitude(defaultView['lat']),
KML.altitude(defaultView['alt']),
KML.range(defaultView['range']),
KML.tilt(defaultView['tilt']),
KML.heading(defaultView['heading'])
),
KML.styleUrl(colorTag),
KML.Point(
KML.coordinates(coor)
)
)
return placemark
def creatStyle(attr, urlDic):
if attr == 0:
colorTag = 'ylw'
url = urlDic[colorTag]
elif attr == 1:
colorTag = 'blue'
url = urlDic[colorTag]
elif attr == 2:
colorTag = '2'
url = urlDic[colorTag]
elif attr == 3:
colorTag = '3'
url = urlDic[colorTag]
elif attr == 4:
colorTag = '4'
url = urlDic[colorTag]
elif attr == 5:
colorTag = '5'
url = urlDic[colorTag]
else:
colorTag = 'else'
url = urlDic[colorTag]
style = KML.Style(
KML.IconStyle(
KML.scale(1.2),
KML.Icon(
KML.href(url),
),
),
id=colorTag
)
return style, colorTag
def writeKML(points, urlDic, path):
kmlDoc = KML.kml()
doc = KML.Document()
for point in points:
style, colorTag = creatStyle(point[-1], urlDic)
placemark = creatPlacemark(point, colorTag)
doc.append(style)
doc.append(placemark)
kmlDoc.append(doc)
print(etree.tostring(kmlDoc, pretty_print=True))
kmlFileName = path + '/KYXZ.kml'
txtFileName = path + '/KYXZ.txt' # for inspect
with open(kmlFileName, 'wb') as f:
f.write(etree.tostring(kmlDoc, pretty_print=True))
with open(txtFileName, 'wb') as f:
f.write(etree.tostring(kmlDoc, pretty_print=True)) # for inspect
os.system('kill $(ps -A | grep earth | awk \'{print $1}\')')
command = 'google-earth-pro ' + kmlFileName
os.system(command)
def txt2kml(fileName, urlDic):
points = readTXT(fileName)
path = os.path.dirname(fileName)
writeKML(points, urlDic, path)
def parseXML(fileName):
path = os.path.dirname(fileName)
kmlFileName = path + '/1.kml'
placemarksDic = [] # each element is a dictionaty
with open(kmlFileName, 'r') as f:
kml = parser.parse(f).getroot()
placemarks = kml.findall('.//{http://www.opengis.net/kml/2.2}Placemark')
print('File <%s> has %d placemarks.' % (kmlFileName, len(placemarks)))
for each in placemarks:
placemark = {'name': each.name,
'styleUrl': each.styleUrl,
'coor': each.Point.coordinates}
placemarksDic.append(placemark)
return placemarksDic
def kml2txt(fileName):
placemarksDic = parseXML(fileName)
placemarksDic = sorted(placemarksDic, key=lambda i: i['name'])
for each in placemarksDic:
print(each)
count = 1
points = []
for each in placemarksDic:
point = getPointWithType(each, count)
count += 1
points.append(point)
print(point)
with open(fileName, 'w') as f:
for each in points:
line = '%d %.8f %.8f %.8f %d\n' % (int(each[0]), float(each[1]),
float(each[2]), float(each[3]), int(each[4]))
f.write(line)
def getPointWithType(placemark, count):
point = []
point.append(count)
pointStr = str(placemark['coor'])
point.append(float(pointStr.split(',')[0]))
point.append(float(pointStr.split(',')[1]))
point.append(float(pointStr.split(',')[2]))
key = str(placemark['styleUrl'])[1]
if 'y' == key:
point.append(0)
elif 'b' == key:
point.append(1)
elif '2' == key:
point.append(2)
elif '3' == key:
point.append(3)
elif '4' == key:
point.append(4)
elif '5' == key:
point.append(5)
else:
print(key)
print('please checkout.')
return point
if __name__ == '__main__':
path = os.path.expanduser('~')
fileName = path + '/taskfile/KYXZ2018A.txt'
# key == type, ylw == start, blue == end
urlDic = {'ylw': 'http://maps.google.com/mapfiles/kml/pushpin/ylw-pushpin.png',
'blue': 'http://maps.google.com/mapfiles/kml/pushpin/blue-pushpin.png',
'2': 'http://maps.google.com/mapfiles/kml/paddle/2.png',
'3': 'http://maps.google.com/mapfiles/kml/paddle/3.png',
'4': 'http://maps.google.com/mapfiles/kml/paddle/4.png',
'5': 'http://maps.google.com/mapfiles/kml/paddle/5.png',
'else': 'http://maps.google.com/mapfiles/kml/shapes/placemark_circle.png'}
txt2kml(fileName, urlDic)
kml2txt(fileName)
```
|
zx444923611zx/TensorFlowTest
|
zx444923611zx/TensorFlowTest
模拟数据训练神经网络.py
```#同numpy生成模拟数据训练神经网络
import tensorflow as tf
from numpy.random import RandomState
#训练数据的batch大小
batch_size = 8
#神经网络参数
w1 = tf.Variable(tf.random_normal([2,3],stddev=1,seed=1))
w2 = tf.Variable(tf.random_normal([3,1],stddev=1,seed=1))
#输入数据占位
x = tf.placeholder(tf.float32,shape=(None,2),name='x-input')
y_ = tf.placeholder(tf.float32,shape=(None,1),name='y-input')
#神经网络传播过程
a = tf.matmul(x,w1)
y = tf.matmul(a,w2)
#定义损耗函数和反向传播算法
cross_entropy = -tf.reduce_mean(y_*tf.log(tf.clip_by_value(y,1e-10,1.0))) #y的输出值为1 ，所有不要按行求和
train_step = tf.train.AdamOptimizer(0.001).minimize(cross_entropy) #训练的模型,不同的优化器训练出来的不一样
#通过随机数生成一个模拟数据集
rdm = RandomState(1)
dataset_size = 128
X = rdm.rand(dataset_size,2)
#定义规则来给出样本的标签x1+x2<1被认为是正样例，其他的为负样例，0表示为负样例，1表示正样例
Y = [[int(x1+x2<1)] for (x1,x2) in X]
#变量初始化
with tf.Session() as sess: #Session()大写和括号
init_op = tf.global_variables_initializer()
sess.run(init_op)
# sess.close()
#训练前权值w1,w2的初始化值
print(w1)
print(sess.run(w2))
#按batch进行训练模型
train_i = 5000
for i in range(train_i):
start = (i*batch_size) % dataset_size
end = min(start+batch_size,dataset_size)
# end = (i*batch_size) % 128 + batch_size
sess.run(train_step,feed_dict={x:X[start:end],y_:Y[start:end]})
if i%1000==0:
total_cross_entropy = sess.run(cross_entropy,feed_dict={x:X,y_:Y})
print("After %d training steps,cross emtropy on all data is %g"%(i,total_cross_entropy))
#输出训练后的权值
print(sess.run(w1))
print(sess.run(w2))
```
|
zx88cvb/security-cloud-demo
|
zx88cvb/security-cloud-demo
SysUserMapper.java
```package com.security.securityclouddemo.mapper;
import com.baomidou.mybatisplus.core.mapper.BaseMapper;
import com.security.securityclouddemo.entity.SysUser;
public interface SysUserMapper extends BaseMapper<SysUser> {
}
```
security-cloud.sql
```/*
Navicat MySQL Data Transfer
Source Server : 192.168.1.104
Source Server Version : 50725
Source Host : 192.168.1.104:3306
Source Database : security-cloud
Target Server Type : MYSQL
Target Server Version : 50725
File Encoding : 65001
Date: 2019-09-24 09:41:04
*/
SET FOREIGN_KEY_CHECKS=0;
-- ----------------------------
-- Table structure for oauth_client_details
-- ----------------------------
DROP TABLE IF EXISTS `oauth_client_details`;
CREATE TABLE `oauth_client_details` (
`client_id` varchar(48) NOT NULL,
`resource_ids` varchar(256) DEFAULT NULL,
`client_secret` varchar(256) DEFAULT NULL,
`scope` varchar(256) DEFAULT NULL,
`authorized_grant_types` varchar(256) DEFAULT NULL,
`web_server_redirect_uri` varchar(256) DEFAULT NULL,
`authorities` varchar(256) DEFAULT NULL,
`access_token_validity` int(11) DEFAULT NULL,
`refresh_token_validity` int(11) DEFAULT NULL,
`additional_information` varchar(4096) DEFAULT NULL,
`autoapprove` varchar(256) DEFAULT NULL,
PRIMARY KEY (`client_id`)
) ENGINE=InnoDB DEFAULT CHARSET=utf8;
-- ----------------------------
-- Records of oauth_client_details
-- ----------------------------
INSERT INTO `oauth_client_details` VALUES ('aaa', null, 'bbb', 'server', 'password,refresh_token', null, null, null, null, null, null);
-- ----------------------------
-- Table structure for sys_permission
-- ----------------------------
DROP TABLE IF EXISTS `sys_permission`;
CREATE TABLE `sys_permission` (
`id` int(11) NOT NULL AUTO_INCREMENT COMMENT 'id',
`per_code` varchar(50) DEFAULT NULL,
`per_path` varchar(300) DEFAULT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8mb4;
-- ----------------------------
-- Records of sys_permission
-- ----------------------------
INSERT INTO `sys_permission` VALUES ('1', 'add_user', 'a');
-- ----------------------------
-- Table structure for sys_role
-- ----------------------------
DROP TABLE IF EXISTS `sys_role`;
CREATE TABLE `sys_role` (
`id` int(11) NOT NULL AUTO_INCREMENT COMMENT 'id',
`role_name` varchar(50) DEFAULT NULL,
`role_code` varchar(300) DEFAULT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8mb4;
-- ----------------------------
-- Records of sys_role
-- ----------------------------
INSERT INTO `sys_role` VALUES ('1', 'root_name', 'root01');
-- ----------------------------
-- Table structure for sys_role_permission
-- ----------------------------
DROP TABLE IF EXISTS `sys_role_permission`;
CREATE TABLE `sys_role_permission` (
`id` int(11) NOT NULL AUTO_INCREMENT COMMENT 'id',
`role_id` int(11) DEFAULT NULL,
`permission_id` int(11) DEFAULT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8mb4;
-- ----------------------------
-- Records of sys_role_permission
-- ----------------------------
INSERT INTO `sys_role_permission` VALUES ('1', '1', '1');
-- ----------------------------
-- Table structure for sys_user
-- ----------------------------
DROP TABLE IF EXISTS `sys_user`;
CREATE TABLE `sys_user` (
`id` int(11) NOT NULL AUTO_INCREMENT COMMENT 'id',
`username` varchar(50) DEFAULT NULL,
`password` varchar(300) DEFAULT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8mb4;
-- ----------------------------
-- Records of sys_user
-- ----------------------------
INSERT INTO `sys_user` VALUES ('1', 'admin', 'e10adc3949ba59abbe56e057f20f883e');
-- ----------------------------
-- Table structure for sys_user_role
-- ----------------------------
DROP TABLE IF EXISTS `sys_user_role`;
CREATE TABLE `sys_user_role` (
`id` int(11) NOT NULL AUTO_INCREMENT COMMENT 'id',
`user_id` int(11) DEFAULT NULL,
`role_id` int(11) DEFAULT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=2 DEFAULT CHARSET=utf8mb4;
-- ----------------------------
-- Records of sys_user_role
-- ----------------------------
INSERT INTO `sys_user_role` VALUES ('1', '1', '1');
```
README.md
```# security-cloud-demo
## 技术架构
* spring cloud security 2.x
* spring cloud oauth2 2.x
# 数据库
* MySQL 5.7
* sql文件在resources/db 下
```
CustomUserDetailsServiceImpl.java
```package com.security.securityclouddemo.service.impl;
import com.baomidou.mybatisplus.core.toolkit.Wrappers;
import com.baomidou.mybatisplus.extension.service.impl.ServiceImpl;
import com.security.securityclouddemo.entity.CustomUser;
import com.security.securityclouddemo.entity.SysPermission;
import com.security.securityclouddemo.entity.SysRole;
import com.security.securityclouddemo.entity.SysUser;
import com.security.securityclouddemo.mapper.SysPermissionMapper;
import com.security.securityclouddemo.mapper.SysRoleMapper;
import com.security.securityclouddemo.mapper.SysUserMapper;
import com.security.securityclouddemo.service.CustomUserDetailsService;
import lombok.extern.slf4j.Slf4j;
import org.apache.commons.lang3.StringUtils;
import org.springframework.security.core.GrantedAuthority;
import org.springframework.security.core.authority.AuthorityUtils;
import org.springframework.security.core.userdetails.UserDetails;
import org.springframework.security.core.userdetails.UsernameNotFoundException;
import org.springframework.stereotype.Service;
import javax.annotation.Resource;
import java.util.*;
import java.util.stream.Collectors;
@Slf4j
@Service
public class CustomUserDetailsServiceImpl extends ServiceImpl<SysUserMapper, SysUser> implements CustomUserDetailsService {
@Resource
private SysUserMapper sysUserMapper;
@Resource
private SysRoleMapper sysRoleMapper;
@Resource
private SysPermissionMapper sysPermissionMapper;
@Override
public UserDetails loadUserByUsername(String username) throws UsernameNotFoundException {
SysUser sysUser = sysUserMapper.selectOne(Wrappers.<SysUser>lambdaQuery()
.eq(SysUser::getUsername, username));
Set<String> permissions = new HashSet<>();
//设置角色列表 （ID）
Set<Integer> roleIds = sysRoleMapper.listRolesByUserId(sysUser.getId())
.stream()
.map(r -> {
permissions.add("ROLE_" + r.getId());
return r.getId();
})
.collect(Collectors.toSet());
//设置权限列表（menu.permission）
roleIds.forEach(roleId -> {
List<String> permissionList = sysPermissionMapper.listPremissionByRoleId(roleId)
.stream()
.filter(sysPermission -> StringUtils.isNotEmpty(sysPermission.getPerCode()))
.map(SysPermission::getPerCode)
.collect(Collectors.toList());
permissions.addAll(permissionList);
});
Collection<? extends GrantedAuthority> authorities
= AuthorityUtils.createAuthorityList(permissions.toArray(new String[0]));
return new CustomUser(sysUser.getId(), sysUser.getUsername(),
sysUser.getPassword(), true, true, true,
true, authorities);
}
}
```
Result.java
```package com.security.securityclouddemo.common;
import lombok.Data;
import java.io.Serializable;
@Data
public class Result<T> implements Serializable {
private int code = 0;
private String msg = "success";
private T data;
public Result() {
}
public Result(T data, String msg) {
this.msg = msg;
this.data = data;
}
public Result(int code, T data, String msg) {
this.code = code;
this.data = data;
this.msg = msg;
}
public Result(int code, String msg) {
this.code = code;
this.msg = msg;
}
public static <T> Result<T> ok() {
return new Result<T>(0, null, null);
}
public static <T> Result<T> ok(T data) {
return restResult(0, data, null);
}
public static <T> Result<T> ok(T data, String msg) {
return restResult(0, data, msg);
}
public static <T> Result<T> failed() {
return restResult(-1,null,null);
}
public static <T> Result<T> failed(String msg) {
return restResult(-1,null, msg);
}
private static <T> Result<T> restResult(int code, T data, String msg) {
Result<T> apiResult = new Result<T>();
apiResult.setCode(code);
apiResult.setData(data);
apiResult.setMsg(msg);
return apiResult;
}
}
```
CustomAuthEntryPoint.java
```package com.security.securityclouddemo.handler;
import com.security.securityclouddemo.common.Result;
import org.springframework.security.core.AuthenticationException;
import org.springframework.security.web.AuthenticationEntryPoint;
import org.springframework.stereotype.Component;
import javax.servlet.ServletException;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;
import java.io.IOException;
@Component
public class CustomAuthEntryPoint implements AuthenticationEntryPoint {
/**
* 自定义EntryPoint用于tokan校验失败返回信息
* @param httpServletRequest request
* @param httpServletResponse Response
* @param e e
* @throws IOException IOException
* @throws ServletException ServletException
*/
@Override
public void commence(HttpServletRequest httpServletRequest, HttpServletResponse httpServletResponse, AuthenticationException e) throws IOException, ServletException {
//返回json形式的错误信息
httpServletResponse.setCharacterEncoding("UTF-8");
httpServletResponse.setContentType("application/json");
Result result = new Result(String.valueOf(HttpServletResponse.SC_BAD_REQUEST), "token校验失败");
httpServletResponse.getWriter().print(result.toString());
httpServletResponse.getWriter().flush();
}
}
```
SecurityConfig.java
```package com.security.securityclouddemo.config;
import com.security.securityclouddemo.service.CustomUserDetailsService;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.context.annotation.Bean;
import org.springframework.context.annotation.Configuration;
import org.springframework.security.authentication.AuthenticationManager;
import org.springframework.security.authentication.AuthenticationProvider;
import org.springframework.security.authentication.dao.DaoAuthenticationProvider;
import org.springframework.security.config.annotation.authentication.builders.AuthenticationManagerBuilder;
import org.springframework.security.config.annotation.method.configuration.EnableGlobalMethodSecurity;
import org.springframework.security.config.annotation.web.builders.HttpSecurity;
import org.springframework.security.config.annotation.web.builders.WebSecurity;
import org.springframework.security.config.annotation.web.configuration.EnableWebSecurity;
import org.springframework.security.config.annotation.web.configuration.WebSecurityConfigurerAdapter;
import org.springframework.security.crypto.bcrypt.BCryptPasswordEncoder;
import org.springframework.security.crypto.factory.PasswordEncoderFactories;
import org.springframework.security.crypto.password.DelegatingPasswordEncoder;
import org.springframework.security.crypto.password.NoOpPasswordEncoder;
import org.springframework.security.crypto.password.PasswordEncoder;
import org.springframework.security.web.authentication.AuthenticationSuccessHandler;
/**
* 安全配置
*/
@Configuration
@EnableWebSecurity
@EnableGlobalMethodSecurity(prePostEnabled=true)
public class SecurityConfig extends WebSecurityConfigurerAdapter {
@Autowired
private CustomUserDetailsService customUserDetailsService;
@Override
public void configure(WebSecurity web) throws Exception {
web.ignoring().antMatchers("/css/**", "/favor.ico");
}
@Override
protected void configure(HttpSecurity http) throws Exception {
http
.formLogin()
.loginPage("/token/login")
.loginProcessingUrl("/token/form")
.and()
.authorizeRequests()
.antMatchers(
"/token/**",
"/actuator/**",
"/mobile/**").permitAll()
.anyRequest().authenticated()
.and().csrf().disable();
}
@Override
protected void configure(AuthenticationManagerBuilder auth) throws Exception {
//替换成自己验证规则
// auth.userDetailsService(customUserDetailsService).passwordEncoder(passwordEncoder());
auth.authenticationProvider(authenticationProvider());
}
@Override
@Bean
public AuthenticationManager authenticationManagerBean() throws Exception {
return super.authenticationManagerBean();
}
/*@Bean
public static BCryptPasswordEncoder passwordEncoder() {
return new BCryptPasswordEncoder();
}*/
@Bean
public static PasswordEncoder passwordEncoder( ){
DelegatingPasswordEncoder delegatingPasswordEncoder =
(DelegatingPasswordEncoder) PasswordEncoderFactories.createDelegatingPasswordEncoder();
//设置defaultPasswordEncoderForMatches为NoOpPasswordEncoder
delegatingPasswordEncoder.setDefaultPasswordEncoderForMatches(NoOpPasswordEncoder.getInstance());
return delegatingPasswordEncoder;
}
/*@Bean
public static NoOpPasswordEncoder passwordEncoder() {
return (NoOpPasswordEncoder) NoOpPasswordEncoder.getInstance();
}*/
@Bean
public AuthenticationProvider authenticationProvider() {
DaoAuthenticationProvider provider = new DaoAuthenticationProvider();
provider.setUserDetailsService(customUserDetailsService);
provider.setPasswordEncoder(passwordEncoder());
provider.setHideUserNotFoundExceptions(false);
return provider;
}
}
```
CustomAccessDeniedHandler.java
```package com.security.securityclouddemo.handler;
import com.security.securityclouddemo.common.Result;
import org.springframework.security.access.AccessDeniedException;
import org.springframework.security.web.access.AccessDeniedHandler;
import org.springframework.stereotype.Component;
import javax.servlet.ServletException;
import javax.servlet.http.HttpServletRequest;
import javax.servlet.http.HttpServletResponse;
import java.io.IOException;
@Component
public class CustomAccessDeniedHandler implements AccessDeniedHandler {
/**
* 授权失败时返回的信息
* @param httpServletRequest request
* @param httpServletResponse Response
* @param e e
* @throws IOException IOException
* @throws ServletException ServletException
*/
@Override
public void handle(HttpServletRequest httpServletRequest, HttpServletResponse httpServletResponse, AccessDeniedException e) throws IOException, ServletException {
//返回json形式的错误信息
httpServletResponse.setCharacterEncoding("UTF-8");
httpServletResponse.setContentType("application/json");
Result result = new Result(String.valueOf(HttpServletResponse.SC_UNAUTHORIZED), "未授权");
httpServletResponse.getWriter().println(result.toString());
httpServletResponse.getWriter().flush();
}
}
```
CustomUserDetailsService.java
```package com.security.securityclouddemo.service;
import com.baomidou.mybatisplus.extension.service.IService;
import com.security.securityclouddemo.entity.SysUser;
import org.springframework.security.core.userdetails.UserDetails;
import org.springframework.security.core.userdetails.UserDetailsService;
import org.springframework.security.core.userdetails.UsernameNotFoundException;
public interface CustomUserDetailsService extends UserDetailsService, IService<SysUser> {
@Override
UserDetails loadUserByUsername(String username) throws UsernameNotFoundException;
}
```
SysPermission.java
```package com.security.securityclouddemo.entity;
import lombok.Data;
import org.springframework.data.annotation.Id;
import java.io.Serializable;
@Data
public class SysPermission implements Serializable {
@Id
private Integer id;
/**
* 资源编码
*/
private String perCode;
/**
* 资源URL
*/
private String perPath;
}
```
ResourceServerConfig.java
```package com.security.securityclouddemo.config;
import com.security.securityclouddemo.handler.CustomAccessDeniedHandler;
import com.security.securityclouddemo.handler.CustomAuthEntryPoint;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.context.annotation.Configuration;
import org.springframework.security.config.annotation.web.builders.HttpSecurity;
import org.springframework.security.oauth2.config.annotation.web.configuration.EnableResourceServer;
import org.springframework.security.oauth2.config.annotation.web.configuration.ResourceServerConfigurerAdapter;
import org.springframework.security.oauth2.config.annotation.web.configurers.ResourceServerSecurityConfigurer;
/**
* 资源服务器
* 资源服务器拦截除排除自定义删除token的地址，以及替换成自定义的错误返回。
*/
@Configuration
@EnableResourceServer
public class ResourceServerConfig extends ResourceServerConfigurerAdapter {
@Autowired
private CustomAuthEntryPoint customAuthEntryPoint;
@Autowired
private CustomAccessDeniedHandler customAccessDeniedHandler;
@Override
public void configure(ResourceServerSecurityConfigurer resources) throws Exception {
super.configure(resources);
resources.authenticationEntryPoint(customAuthEntryPoint).accessDeniedHandler(customAccessDeniedHandler);
}
@Override
public void configure(HttpSecurity http) throws Exception {
http.exceptionHandling().authenticationEntryPoint(customAuthEntryPoint)
.and().authorizeRequests()
.antMatchers("/oauth/remove_token").permitAll()
.anyRequest().authenticated();
;
}
}
```
SysPermissionMapper.java
```package com.security.securityclouddemo.mapper;
import com.baomidou.mybatisplus.core.mapper.BaseMapper;
import com.security.securityclouddemo.entity.SysPermission;
import java.util.List;
public interface SysPermissionMapper extends BaseMapper<SysPermission> {
/**
* 通过角色编号查询菜单
*
* @param roleId 角色ID
* @return
*/
List<SysPermission> listPremissionByRoleId(Integer roleId);
}
```
SysRole.java
```package com.security.securityclouddemo.entity;
import lombok.Data;
import org.springframework.data.annotation.Id;
import java.io.Serializable;
import java.util.List;
@Data
public class SysRole implements Serializable {
@Id
private Integer id;
/**
* 角色名
*/
private String roleName;
/**
* 角色code
*/
private String roleCode;
/**
* 资源合集
*/
private List<SysPermission> permissions;
}
```
SysUser.java
```package com.security.securityclouddemo.entity;
import com.baomidou.mybatisplus.annotation.IdType;
import com.baomidou.mybatisplus.annotation.TableField;
import com.baomidou.mybatisplus.annotation.TableId;
import lombok.Data;
import lombok.Getter;
import lombok.NoArgsConstructor;
import org.springframework.data.annotation.Id;
import org.springframework.security.core.GrantedAuthority;
import org.springframework.security.core.userdetails.User;
import java.util.Collection;
@Data
public class SysUser {
@TableId(type = IdType.AUTO)
private Integer id;
private String username;
private String password;
/**
* 角色集合
*/
@TableField(exist = false)
private Integer[] roles;
}
```
|
zxc188/alexnet
|
zxc188/alexnet
my_layers.py
```import tensorflow as tf
from tensorflow.python.ops import init_ops
def weights_initializer_random_normal(shape,stddev):
return init_ops.truncated_normal_initializer(shape, stddev)
#---------------------------------------卷积层---------------------------------------------------------------------------------
def cnnlayer(input,output_size,stride,ksize,padding='SAME'):
#W=tf.Variable(tf.truncated_normal([5,5,input_size,output_size],stddev=0.1),name="W")
#b = tf.Variable(tf.zeros(shape=[output_size],dtype=tf.float32), name="b")
#conver2=tf.nn.conv2d(input,W,strides=[1,one,two,1],padding='SAME')
#conver2_layer=tf.nn.relu(conver2+b)
conver2_layer = tf.contrib.layers.convolution2d(
input,
# weights_regularizer=tf.contrib.layers.l2_regularizer(0.0005),
# biases_initializer=tf.constant_initializer(0.1),
normalizer_fn=tf.contrib.layers.batch_norm,
num_outputs=output_size,
kernel_size=(ksize, ksize),
activation_fn=tf.nn.relu,
stride=(stride, stride),
padding=padding
)
# tf.summary.histogram(name="W",values=W)
# tf.summary.histogram(name="b",values=b)
return conver2_layer
#---------------------------------------池化层---------------------------------------------------------------------------------
def pool(input):
return tf.contrib.layers.max_pool2d(
inputs=input,
kernel_size=[3,3],
padding='VALID')
#---------------------------------------全连接层---------------------------------------------------------------------------------
def fullylayer(input,input_size,output_size,zeros=0,action=None,drop=0):
W=tf.Variable(tf.truncated_normal([input_size,output_size],stddev=0.1),name="W")
hidden_layer_three=tf.matmul(input,W)
if zeros==1:
b = tf.Variable(tf.zeros(shape=[output_size], dtype=tf.float32), name="b")
hidden_layer_three=tf.nn.bias_add(hidden_layer_three,b)
else:
b = tf.constant(0.1,name='b')
hidden_layer_three=hidden_layer_three+b
if action!=None:
hidden_layer_three=tf.nn.relu(hidden_layer_three)
if drop!=0:
hidden_layer_three = tf.contrib.layers.dropout(hidden_layer_three, drop, is_training=True)
tf.summary.histogram('W',W)
tf.summary.histogram('b',b)
return hidden_layer_three
#---------------------------------------更改shape---------------------------------------------------------------------------------
def resahpe(input):
return tf.contrib.layers.flatten(input)```
README.md
```# alexnet
这是一个图像识别的神经网络(CNN卷积神经网络)
my_layers:神经层
alexnet: main函数
read_data:读取图片和标签进行训练
image_to_tfcode: 写入数据
由于现在的训练基本都在GPU上进行，普通的计算机训练模型可能需要 3-4天的样子才可以把模型跑出来(前提是你的内存够用，至少8G吧)，训练次数需要增加
首先对于这个模型是经典的alexnet模型，分为5个卷积层，3个全连接层。但是貌似google用卷积层代替了全连接层，而且效果还挺明显的。人家google已经实现好的模型我们就不再写一个了，我们写一个经典的alexnet模型吧。
这个模型是在alexnnet的基础上做了一定的修改，就是我们在卷积层里面加入了BN算法，这样可以快速线性回归也可以不用太担心过拟合。代码里面文档很清楚了。
```
alexnet.py
```import tensorflow as tf
from read_data import read_data
import my_layers as layer
#---------------------------------------训练结束之后的预测---------------------------------------------------------------------------------
def interfaced(X):
return tf.argmax(tf.nn.softmax(logits=X),1)
#---------------------------------------误差计算---------------------------------------------------------------------------------
def loss(X,Y):
loss=tf.reduce_mean(tf.losses.sparse_softmax_cross_entropy(labels=Y,logits=X))
tf.summary.scalar("softmax", loss)
return loss
#---------------------------------------训练减少误差---------------------------------------------------------------------------------
def train(loss_value, learning_rate):
return tf.train.AdadeltaOptimizer(learning_rate=learning_rate).minimize(loss_value)
if __name__=='__main__':
# 输入占位符
with tf.name_scope("input"):
x_input = tf.placeholder(tf.float32, [None, 250, 250, 3], name="x_input")
y_input = tf.placeholder(tf.int64, [None], name="x_input")
with tf.name_scope("placeholder"):
image_batch, lable_batch, batch_size = read_data('./tfcode/test/*.tfrecord')
with tf.name_scope("cnnlayer1"):
layer1=layer.cnnlayer(x_input,64,4,11,padding='VALID')
# with tf.name_scope("lrnlayer"):
# normal1=tf.nn.lrn(layer1,4,bias=1.0,alpha=0.001/9,beta=0.75,name="lrn1")
with tf.name_scope("maxpoll1"):
max_poll1=layer.pool(layer1)
with tf.name_scope("cnnlayer2"):
layer2=layer.cnnlayer(max_poll1,192,2,5)
# with tf.name_scope("lrnlayer"):
# normal2 = tf.nn.lrn(layer2, 4, bias=1.0, alpha=0.001 / 9, beta=0.75, name="lrn1")
with tf.name_scope("maxpoll2"):
max_poll2 = layer.pool(layer2)
with tf.name_scope("cnnlayer3"):
layer3=layer.cnnlayer(max_poll2,384,1,3)
with tf.name_scope("cnnlayer4"):
layer4=layer.cnnlayer(layer3,256,1,3)
with tf.name_scope("cnnlayer5"):
layer5=layer.cnnlayer(layer4,256,1,3)
with tf.name_scope("maxpoll2"):
max_poll3 = layer.pool(layer5)
with tf.name_scope("reshape"):
flattened = layer.resahpe(max_poll3)
with tf.name_scope("fullylayer1"):
fullylayer1=layer.fullylayer(flattened,4096,1024,action=tf.nn.relu)
with tf.name_scope("fullylayer2"):
fullylayer2=layer.fullylayer(fullylayer1,1024,1024,action=tf.nn.relu)
with tf.name_scope("fullylayer3"):
fullylayer3= layer.fullylayer(fullylayer2, 1024, 120,zeros=1)
with tf.name_scope("output"):
logits=fullylayer3
result=tf.argmax(tf.nn.softmax(logits),1,name="result")
# with tf.name_scope("learning_rate"):
# batch = tf.Variable(0, trainable=False)
# learning_rate = tf.train.exponential_decay(
# 0.1, batch * 64, 25600, 0.5, staircase=True)
# tf.summary.scalar(name="learning_rate", tensor=learning_rate)
with tf.name_scope("loss"):
loss = loss(logits, y_input)
with tf.name_scope("train"):
train = train(loss, 0.05)
with tf.name_scope("accuracy"):
accuracy=tf.reduce_mean(tf.cast(tf.equal(interfaced(logits),y_input),tf.float32))
tf.summary.scalar(name="accuracy", tensor=accuracy)
summ = tf.summary.merge_all()
writer=tf.summary.FileWriter("./log")
saver=tf.train.Saver()
sess = tf.InteractiveSession()
# # 必须同时有全局变量和局部变量的初始化，不然会报错：
# # OutOfRangeError (see above for traceback): RandomShuffleQueue '_134_shuffle_batch_8/random_shuffle_queue' is closed and has insufficient elements (requested 3, current size 0)
sess.run(tf.local_variables_initializer())
sess.run(tf.global_variables_initializer())
writer.add_graph(graph=sess.graph)
coord = tf.train.Coordinator()
threads = tf.train.start_queue_runners(sess=sess, coord=coord)
print(logits.get_shape())
# -------------------------------------------------------------------开始训练-----------------------------------------------------------------------------------------
for i in range(2000):
input_image = sess.run(image_batch)
input_lable = sess.run(lable_batch)
# print(input_lable)
l, t, summs, acc, losses = sess.run([logits, train, summ, accuracy, loss],
feed_dict={x_input: input_image, y_input: input_lable})
writer.add_summary(summary=summs, global_step=i)
if i % 10 == 0:
print('step: %d, loss: %.4f, acc: %.4f' % (i, losses, acc))
saver.save(sess, "./model/this_model/model", global_step=i)
# ------------------------------------------------------------------开始测试--------------------------------------------------------------------------------------------
coord.request_stop()
coord.join(threads=threads)
sess.close()```
image_to_tfcode.py
```import tensorflow as tf
import glob
from itertools import groupby
from collections import defaultdict
sess = tf.InteractiveSession()
#查找符合一定规则的所有文件，并将文件名以lis形式返回。
image_filenames_0 = glob.glob("./image_dog/n02*/*.jpg")
#读到的路径形式为：'./imagenet-dogs\\n02085620-Chihuahua\\n02085620_10074.jpg'，路径分隔符中除第1个之外，都是2个反斜杠，与例程不一致。这里将2个反斜杠替换为斜杠
image_filenames = list(
map(lambda image: image.replace('\\', '/'), image_filenames_0))
image_filename_with_breed = map(
lambda filename: (filename.split("/")[2], filename), image_filenames)
#用list类型初始化training和testing数据集，用defaultdict的好处是为字典中不存在的键提供默认值
training_dataset = defaultdict(list)
testing_dataset = defaultdict(list)
for dog_breed, breed_images in groupby(image_filename_with_breed,
lambda x: x[0]):
#enumerate的作用是列举breed_images中的所有元素，可同时返回索引和元素，i和breed_image
#的最后一个值分别是：168、('n02116738-African_hunting_dog', './imagenet-dogs/
#n02116738-African_hunting_dog/n02116738_9924.jpg')
for i, breed_image in enumerate(breed_images):
#因为breed_images是按类分别存储的，所以下面是将大约20%的数据作为测试集，大约80%的
#数据作为训练集。
#testing_dataset和training_dataset是两个字典，testing_dataset中
#的第一个元素是 'n02085620-Chihuahua': ['./imagenet-dogs/n02085620-Chihuahua/
#n02085620_10074.jpg', './imagenet-dogs/n02085620-Chihuahua/
#n02085620_11140.jpg',.....]
print(breed_image)
if i % 5 == 0:
testing_dataset[dog_breed].append(breed_image[1])
else:
training_dataset[dog_breed].append(breed_image[1])
def write_tfrecord(data,location,sess):
writer = None
index = 0
for whichs,filenames in data.items():
for filename in filenames:
if index%100==0:
if writer:
writer.close()
record_name="{location}-{index}.tfrecord".format(location=location,index=index)
writer=tf.python_io.TFRecordWriter(record_name)
index=index+1
image=tf.read_file(filename)
try:
image_dec=tf.image.decode_jpeg(image)
except:
continue
#调整图像的大小,不是修剪，相当于缩放
resize_image = tf.image.resize_images(images=image_dec, size=[250, 250])
image_bytes = sess.run(tf.cast(resize_image, tf.uint8)).tobytes()
image_lable = whichs.encode('utf-8')
example = tf.train.Example(features=tf.train.Features(feature={
"label": tf.train.Feature(bytes_list=tf.train.BytesList(value=[image_lable])),
'image': tf.train.Feature(bytes_list=tf.train.BytesList(value=[image_bytes]))
}))
writer.write(example.SerializeToString())
writer.close()
write_tfrecord(training_dataset,"./tfcode/train/training_image",sess)
```
read_data.py
```import tensorflow as tf
import glob
#---------------------------------------图像数据的归一化---------------------------------------------------------------------------------
def input_float(iamge_beach):
return tf.image.convert_image_dtype(iamge_beach,tf.float32)
#---------------------------------------将标签对应到 0-119 ---------------------------------------------------------------------------------
def lables(lable_batch):
# 得到标签列表
lablees = list(map(lambda c: c.split("\\")[1], glob.glob(("./image_dog\\*"))))
# 将标签变成一个以为的张量
train_lable = tf.map_fn(lambda l: tf.where(tf.equal(lablees, l))[0, 0:1][0], lable_batch, dtype=tf.int64)
return train_lable
#---------------------------------------读取数据---------------------------------------------------------------------------------
def read_data(file_path):
filename_output_queue = tf.train.string_input_producer(
tf.train.match_filenames_once(["./tfcode/train/*.tfrecord"])) # 读入流中
reader = tf.TFRecordReader()
_, serialized_example = reader.read(filename_output_queue) # 返回文件名和文件
features = tf.parse_single_example(serialized_example,
features={
'label': tf.FixedLenFeature([], tf.string),
'image': tf.FixedLenFeature([], tf.string)
}) # 取出包含image和label的feature对象
recode_image = tf.decode_raw(features['image'], tf.uint8)
real_image = tf.reshape(recode_image, shape=[250, 250, 3])
lable = tf.cast(features['label'], tf.string)
min_after_dequeue = 5000
batch_size = 60
capacity =min_after_dequeue+10*batch_size
image_batch, lable_batch = tf.train.shuffle_batch([real_image, lable],
batch_size=batch_size,
capacity=capacity,
min_after_dequeue=min_after_dequeue)
image_batch=input_float(image_batch)
lable_batch=lables(lable_batch)
return image_batch, lable_batch,batch_size
```
|
zxc888-zxc/zxc888-zxc
|
zxc888-zxc/zxc888-zxc
README.md
```- 👋 Hi, I’m @zxc888-zxc
- 👀 I’m interested in ...
- 🌱 I’m currently learning ...
- 💞️ I’m looking to collaborate on ...
- 📫 How to reach me ...
<!---
zxc888-zxc/zxc888-zxc is a ✨ special ✨ repository because its `README.md` (this file) appears on your GitHub profile.
You can click the Preview link to take a look at your changes.
--->
```
|
zxllzw/blog
|
zxllzw/blog
深入webpack系列.md
```配置 webpack 其实很简单，基础的构建可以按照以下方式来配置 webpack：
- 想让源文件加入到构建流程中去被 Webpack 控制，配置 `entry`。
- 想自定义输出文件的位置和名称，配置 `output`。
- 想自定义寻找依赖模块时的策略，配置 `resolve`。
- 想自定义解析和转换文件的策略，配置 `module`，通常是配置 `module.rules` 里的 Loader。
- 其它的大部分需求可能要通过 Plugin 去实现，配置 `plugin`。
基础的配置，这里就不再做过多的介绍，在文章结尾会给出完整配置：
当使用 webpack 进行打包，一般会出现两方面的问题：
- 打包速度过慢 => 打包时间过长 => 优化开发体验
- 包体积太大 => 影响用户体验 => 优化输出质量
## 一、优化开发体验
### 1. 优化构建速度
#### - 缩小文件搜索范围
webpack 打包时，会从配置的 `entry` 触发，解析入口文件的导入语句，再递归的解析，在遇到导入语句时 Webpack 会做两件事情：
- 根据导入语句去寻找对应的要导入的文件。例如 `require('react')` 导入语句对应的文件是 `./node_modules/react/react.js`，`require('./util')` 对应的文件是 `./util.js`。
- 根据找到的要导入文件的后缀，使用配置中的 Loader 去处理文件。例如使用 ES6 开发的 JavaScript 文件需要使用 babel-loader 去处理。
以上两件事情虽然对于处理一个文件非常快，但是当项目大了以后文件量会变的非常多，这时候构建速度慢的问题就会暴露出来。 虽然以上两件事情无法避免，但需要尽量减少以上两件事情的发生，以提高速度。
接下来一一介绍可以优化它们的途径。
- **优化 loader 配置**
使用 Loader 时可以通过 `test` 、 `include` 、 `exclude` 三个配置项来命中 Loader 要应用规则的文件
- **优化 resolve.module 配置**
`resolve.modules` 用于配置 Webpack 去哪些目录下寻找第三方模块，`resolve.modules` 的默认值是 `['node_modules']` ，含义是先去当前目录下的 `./node_modules` 目录下去找想找的模块，如果没找到就去上一级目录 `../node_modules` 中找，再没有就去 `../../node_modules` 中找，以此类推。
- **优化 resolve.alias 配置**
`resolve.alias` 配置项通过别名来把原导入路径映射成一个新的导入路径，
- **优化 resolve.extensions 配置**
在导入语句没带文件后缀时，Webpack 会根据 resolve.extension 自动带上后缀后去尝试询问文件是否存在，所以在配置 `resolve.extensions` 应尽可能注意以下几点：
- `resolve.extensions` 列表要尽可能的小，不要把项目中不可能存在的情况写到后缀尝试列表中。
- 频率出现最高的文件后缀要优先放在最前面，以做到尽快的退出寻找过程。
- 在源码中写导入语句时，要尽可能的带上后缀，从而可以避免寻找过程。
- **优化 resolve.mainFields 配置**
有一些第三方模块会针对不同环境提供几分代码。 例如分别提供采用 ES5 和 ES6 的2份代码，这2份代码的位置写在 `package.json` 文件里，如下：
```
{
"jsnext:main": "es/index.js",// 采用 ES6 语法的代码入口文件
"main": "lib/index.js" // 采用 ES5 语法的代码入口文件
}
```
Webpack 会根据 `mainFields` 的配置去决定优先采用那份代码，`mainFields` 默认如下：
```
mainFields: ['browser', 'main']
```
Webpack 会按照数组里的顺序去`package.json` 文件里寻找，只会使用找到的第一个。
假如你想优先采用 ES6 的那份代码，可以这样配置：
```
mainFields: ['jsnext:main', 'browser', 'main']
```
- **优化 module.noParse 配置**
`module.noParse` 配置项可以让 Webpack 忽略对部分没采用模块化的文件的递归解析处理，这样做的好处是能提高构建性能。 原因是一些库，例如 jQuery 、ChartJS， 它们庞大又没有采用模块化标准，让 Webpack 去解析这些文件耗时又没有意义。
```js
// 编译代码的基础配置
const clientWebpackConfig = {
// ...
module: {
// 项目中使用的 jquery 并没有采用模块化标准，webpack 忽略它
noParse: /jquery/,
rules: [
{
// 这里编译 js、jsx
// 注意：如果项目源码中没有 jsx 文件就不要写 /\.jsx?$/，提升正则表达式性能
test: /\.(js|jsx)$/,
// babel-loader 支持缓存转换出的结果，通过 cacheDirectory 选项开启
use: ['babel-loader?cacheDirectory'],
// 排除 node_modules 目录下的文件
// node_modules 目录下的文件都是采用的 ES5 语法，没必要再通过 Babel 去转换
exclude: /node_modules/,
},
]
},
resolve: {
// 设置模块导入规则，import/require时会直接在这些目录找文件
// 可以指明存放第三方模块的绝对路径，以减少寻找
modules: [
path.resolve(`${project}/client/components`),
path.resolve('h5_commonr/components'),
'node_modules'
],
// import导入时省略后缀
// 注意：尽可能的减少后缀尝试的可能性
extensions: ['.js', '.jsx', '.react.js', '.css', '.json'],
// import导入时别名，减少耗时的递归解析操作
alias: {
'@client': path.resolve(`${project}/client`),
'@h5_commonr': path.resolve('h5_commonr'),
'@noAnyDoor': path.resolve(`h5_commonr/noAnyDoor`),
'@dllAliasMap': path.resolve(`${dllConfig.buildPath}/dllAliasMap`),
'@utils': path.resolve('h5_commonr/utils/importDll'),
'@importDll': path.resolve('h5_commonr/utils/importDll'),
'@swiper': path.resolve('node_modules/swiper/dist/js/swiper.js')
}
},
};
module.exports = {
client: clientWebpackConfig
}
```
以上就是所有和缩小文件搜索范围相关的构建性能优化了，在根据自己项目的需要去按照以上方法改造后，你的构建速度一定会有所提升。
#### - 使用 HardSourceWebpackPlugin
`HardSourceWebpackPlugin` 是 webpack 的插件，为模块提供中间缓存步骤。为了查看结果，你需要使用此插件运行 webpack 打包至少两次：
- 第一次构建将花费正常的时间
- 第二次构建将显着加快（大概提升90%的构建速度）。
```js
const HardSourceWebpackPlugin = require('hard-source-webpack-plugin')
const clientWebpackConfig = {
// ...
plugins: [
new HardSourceWebpackPlugin({
// cacheDirectory是在高速缓存写入。默认情况下，将缓存存储在node_modules下的目录中
// 'node_modules/.cache/hard-source/[confighash]'
cacheDirectory: path.join(__dirname, './lib/.cache/hard-source/[confighash]'),
// configHash在启动webpack实例时转换webpack配置，
// 并用于cacheDirectory为不同的webpack配置构建不同的缓存
configHash: function(webpackConfig) {
// node-object-hash on npm can be used to build this.
return require('node-object-hash')({sort: false}).hash(webpackConfig);
},
// 当加载器、插件、其他构建时脚本或其他动态依赖项发生更改时，
// hard-source需要替换缓存以确保输出正确。
// environmentHash被用来确定这一点。如果散列与先前的构建不同，则将使用新的缓存
environmentHash: {
root: process.cwd(),
directories: [],
files: ['package-lock.json', 'yarn.lock'],
},
// An object. 控制来源
info: {
// 'none' or 'test'.
mode: 'none',
// 'debug', 'log', 'info', 'warn', or 'error'.
level: 'debug',
},
// Clean up large, old caches automatically.
cachePrune: {
// Caches younger than `maxAge` are not considered for deletion. They must
// be at least this (default: 2 days) old in milliseconds.
maxAge: 2 * 24 * 60 * 60 * 1000,
// All caches together must be larger than `sizeThreshold` before any
// caches will be deleted. Together they must be at least this
// (default: 50 MB) big in bytes.
sizeThreshold: 50 * 1024 * 1024
},
}),
new HardSourceWebpackPlugin.ExcludeModulePlugin([
{
test: /.*\.DS_Store/
}
]),
]
}
```
#### - 使用 DllPlugin
由于公司老项目的坑爹性，HardSourceWebpackPlugin 无法发挥作用，所以这里介绍一下 DllPlugin 的配置。
使用过 windows 电脑的人一般会看到 `.dll` 为后缀的文件，这些文件称为 **动态链接库** ，在 webpack 打包时，我们也可以构建项目的动态链接库，将项目中的网页基础模块、公共模块抽离出来，打包到一个个动态链接库中，当 webpack 打包时，需要导入的模块存在动态链接库中时，这个模块就不需要再被打包，直接去动态链接库中取就可以。 **注意：所有的动态链接库需要被加载** 。
webpack 已经内置了对动态链接库的支持，主要通过两个内置的插件接入：
- DllPlugin 插件：用于打包出一个个单独的动态链接库文件。
- DllReferencePlugin 插件：用于在主要配置文件中去引入 DllPlugin 插件打包好的动态链接库文件。
**步骤一：配置 webpack.dll.conf.js，构建出动态链接库文件：**
```js
/**
* 打包Dll的Webpack配置文件
*
*/
const path = require('path');
const CleanWebpackPlugin = require('clean-webpack-plugin');
const ExtractTextPlugin = require('extract-text-webpack-plugin');
const webpack = require('webpack');
const merge = require('webpack-merge');
// 编译代码的基础配置
const baseWebpackConfig = require('./webpack.base.conf');
// dll 配置文件（在下面）
const config = require('../../config');
// 这里把 styleLoaders 配置也单独独立出去了
const utils = require('../tools/utils');
const dlls = config.dlls;
// dll 版本号
const dllVersion = dlls.version;
// dll 默认配置（你也可以配置可控）
const dllConfig = dlls.dllPlugin.defaults;
// dll 入口文件
const dllEntry = dlls.dllPlugin.entry;
// dll 包出口路径
const outputPath = path.resolve(dllConfig.buildPath);
// dll 生成映射表json文件地址
const outputPathMap = path.resolve(dllConfig.buildPath, '[name].json');
const isDev = process.env.NODE_ENV === 'development';
const plugins = [
// 接入 DllPlugin
new webpack.DllPlugin({
// 动态链接库的全局变量名称，需要和 output.library 中保持一致
// 该字段的值也就是输出的 json 文件 中 name 字段的值
name: '[name]', // json文件名
// 描述动态链接库的 json 文件输出时的文件名称
path: outputPathMap //生成映射表json文件地址
}),
// 删除文件
new CleanWebpackPlugin([outputPath], {
root: process.cwd(), // 根目录
verbose: true, // 开启在控制台输出信息
dry: false // 启用删除文件
}),
]
if (isDev) {
// 将webpack生成的映射表中的数字id，替换为路径id 1---->./nodu_module/react/dist/react.js
plugins.push(new webpack.NamedModulesPlugin());
} else {
// 抽离css
plugins.push(new ExtractTextPlugin({
filename: `pa_${dllVersion}` + '.dll.css',
disable: false,
allChunks: true,
}));
}
// module.exports
module.exports = merge(baseWebpackConfig.client, {
// 上下文
context: process.cwd(),
// 执行入口文件
entry: dllEntry(),
// 调试模式
devtool: isDev ? 'eval' : false,
// 打包文件输出
output: {
// 输出的动态链接库的文件名称，[name]_${dllVersion} 代表当前动态链接库的名称，
filename: `[name]_${dllVersion}.dll.js`,
// 输出的文件都放到 outputPath 目录下
path: outputPath,
// 存放动态链接库的全局变量名称
library: '[name]',
},
// loaders
module: {
rules: utils.styleLoaders({
extract: !isDev
})
},
// webpack插件
plugins: plugins,
// 性能提示
performance: {
hints: false,
},
})
// 打包完，生成 dllAliasMap.json
process.on('exit', (err) => {
generateDllMap(outputPath, err);
});
```
**注意：在 `webpack.dll.conf.js` 文件中，DllPlugin 中的 name 参数必须和 output.library 中保持一致。 原因在于 DllPlugin 中的 name 参数会影响输出的 json 文件中 name 字段的值， 而在 `webpack.config.js` 文件中 DllReferencePlugin 会去 json 文件读取 name 字段的值，并把值的内容作为在从全局变量中获取动态链接库中内容时的全局变量名。**
在这里，我把配置单独放在配置文件 `config/dll.conf.js` 中：
```js
const path = require('path');
const utils = require('../scripts/tools/utils');
const pullAll = require('lodash/pullAll'); //数组除值
const uniq = require('lodash/uniq'); //数组去重
const glob = require('glob'); //Match files
const reactDll = {
version: '1.0.0',
dllPlugin: {
defaults: {
exclude: [
],
include: [
"babel-polyfill",
'react',
'react-dom',
'react-redux',
'redux',
'react-router',
'better-scroll'
],
// 针对开发本地调试用devPath，针对各种环境打包时用buildPath
devPath: 'h5_commonr/@react_dll/dev_dll',
buildPath: process.env.NODE_ENV === 'development' ? 'h5_commonr/@react_dll/dev_dll' : 'h5_commonr/@react_dll/prd_dll',
},
entry() {
let dependencyNames = [];
const exclude = reactDll.dllPlugin.defaults.exclude;
const include = reactDll.dllPlugin.defaults.include;
const includeDependencies = uniq([...include, ...dependencyNames]);
return {
paReactDll: pullAll(includeDependencies, exclude),
paChartDll: ['highcharts'],
paSwiperDll: ['@swiper']
};
},
},
};
module.exports = reactDll;
```
style 配置文件 tools/utils.js：
```js
const path = require('path')
const ExtractTextPlugin = require('extract-text-webpack-plugin')
exports.cssLoaders = (options = {}) => {
// generate loader string to be used with extract text plugin
const generateLoaders = loaders => {
const sourceLoader = loaders.map(loader => {
let extraParamChar
if (/\?/.test(loader)) {
loader = loader.replace(/\?/, '-loader?')
extraParamChar = '&'
} else {
loader = loader + '-loader'
extraParamChar = '?'
}
return loader + (options.sourceMap ? extraParamChar + 'sourceMap' : '')
}).join('!')
// Extract CSS when that option is specified
if (options.extract) {
if (options.publicPath) {
return ExtractTextPlugin.extract({
use: sourceLoader,
fallback: 'style-loader',
publicPath: options.publicPath
})
} else {
return ExtractTextPlugin.extract({
use: sourceLoader,
fallback: 'style-loader',
})
}
} else {
return ['style-loader', sourceLoader].join('!')
}
}
return {
css: generateLoaders(['css', 'postcss']),
postcss: generateLoaders(['css']),
less: generateLoaders(['css', 'less']),
sass: generateLoaders(['css', 'postcss', 'sass?indentedSyntax']),
scss: generateLoaders(['css', 'postcss', 'sass']),
stylus: generateLoaders(['css', 'stylus']),
styl: generateLoaders(['css', 'stylus'])
}
}
// Generate loaders for standalone style files
exports.styleLoaders = options => {
const output = []
const loaders = exports.cssLoaders(options)
for (const extension of Object.keys(loaders)) {
const loader = loaders[extension]
output.push({
test: new RegExp('\\.' + extension + '$'),
loader: loader
})
}
return output
}
```
**步骤二：使用动态链接库文件**
**webapck 打生产或测试包时，引入 DllPlugin 插件打包好的动态链接库文件**
```js
// 引入所有的 dll 动态链接库
const manifests = glob.sync(path.resolve(`${dllPath}/pa*Dll.json`));
manifests.forEach(item => {
plugins.push(new webpack.DllReferencePlugin({
context: process.cwd(),
manifest: item,
}))
})
// 对 js
glob.sync(`${dllConfig.buildPath}/paReactDll*.dll.js`).forEach((dllPath) => {
plugins.push(
new AddAssetHtmlPlugin({
filepath: dllPath,
includeSourcemap: false,
publicPath: './js',
context: process.cwd(),
outputPath: 'js',
typeOfAsset: 'js'
})
);
});
// 对 css
glob.sync(`${dllConfig.buildPath}` + '/*.dll.css').forEach((dllPath) => {
plugins.push(
new AddAssetHtmlPlugin({
filepath: dllPath,
includeSourcemap: false,
publicPath: './stylesheet',
context: process.cwd(),
outputPath: 'stylesheet',
typeOfAsset: 'css'
})
);
});
module.exports = merge(clientWebpackConfig, {
// ...
plugins: plugins
})
```
**步骤三：执行构建，并在页面中被引入**
在配置好以上的 webpack 配置文件后，需要执行构建出所有配置好的动态链接库（ `webpack --display-chunks --color --progress --config scripts/webpack/webpack.dll.conf.js` ），因为 webpack 生产或测试配置文件中定义的 DllReferencePlugin 依赖这些文件。
你可以在 html 中引入，也可以在 router 中引入：
Html:
```js
<html>
<head>
<meta charset="UTF-8">
</head>
<body>
<div id="app"></div>
<!--导入依赖的动态链接库文件-->
<script src="./dist/XX.dll.js"></script>
<script src="./dist/XXX.dll.js"></script>
<!--导入执行入口文件-->
<script src="./dist/main.js"></script>
</body>
</html>
```
或 router 中：
```js
module.exports = {
path: '/',
component: require('../app/App'),
childRoutes: [
{
path: 'ProductDetailPage',
getComponent(location, cb) {
require.ensure([], (require) => {
Promise.all([importDll('paChartDll')]).then(function() {
cb(null, require('../pages/ProductDetailPage'));
})
}, 'ProductDetailPage');
},
onEnter: () => {
setTitle({'title': productName, barBgColor: backgroundColor, textColor: '#fff'});
showNavBar();
}
}
],
}
```
#### - 使用 HappyPack
运行在 Node.js 之上的 Webpack 是单线程模式的，也就是说，webpack 打包只能逐个文件处理，当 webpack 需要打包大量文件时，打包时间就会比较漫长。
HappyPack 可利用多线程对文件进行打包(默认cpu核数-1)，对多核cpu利用率更高。HappyPack 可以让 Webpack 同一时间处理多个任务，发挥多核 CPU 的能力，将任务分解给多个子进程去并发的执行，子进程处理完后，再把结果发送给主进程。
```js
const path = require('path')
const webpack = require("webpack");
const HappyPack = require('happypack'); // 多线程loader
// node 提供的系统操作模块
const os = require('os');
// 构造出共享进程池，根据系统的内核数量，指定线程池个数，也可以其他数量
const happyThreadPool = HappyPack.ThreadPool({ size: os.cpus().length });
const createHappyPlugin = (id, loaders) => new HappyPack({
// 用唯一的标识符 id 来代表当前的 HappyPack 是用来处理一类特定的文件
id: id,
// 如何处理 .js 文件，用法和 Loader 配置中一样
loaders: loaders,
// 其它配置项(可选)
// 代表共享进程池，即多个 HappyPack 实例都使用同一个共享进程池中的子进程去处理任务，以防止资源占用过多
threadPool: happyThreadPool,
// 是否允许 HappyPack 输出日志，默认是 true
verbose: true
// threads：代表开启几个子进程去处理这一类型的文件，默认是3个，类型必须是整数
});
const clientWebpackConfig = {
// ...
module: {
rules: [
{
test: /\.(js|jsx)$/,
// 把对 .js .jsx 文件的处理转交给 id 为 happy-babel 的 HappyPack 实例
use: ["happypack/loader?id=happy-babel"],
// 排除 node_modules 目录下的文件
// node_modules 目录下的文件都是采用的 ES5 语法，没必要再通过 Babel 去转换
exclude: /node_modules/,
}
]
},
// ...
plugins: [
createHappyPlugin('happy-babel', [{
loader: 'babel-loader',
options: {
presets: ['@babel/preset-env', "@babel/preset-react"],
plugins: [
["import", { "libraryName": "antd", "style": true }],
['@babel/plugin-proposal-class-properties',{loose:true}]
],
cacheDirectory: true,
// Save disk space when time isn't as important
cacheCompression: true,
compact: true,
}
}]),
// ...
]
}
```
**注意，项目较小时，多线程打包反而会使打包速度变慢。**
#### - 使用 ParallelUglifyPlugin
前面介绍了如何利用缓存机制（最优配置、HardSourceWebpackPlugin 或 DllPlugin）提高 webpack 构建速度， 除此之外，我们知道 webpack 构建代码时，不仅仅是从入口递归解析打包，还包括压缩代码这一环节。
由于压缩 JavaScript 代码需要先把代码解析成用 Object 抽象表示的 AST 语法树，再去应用各种规则分析和处理 AST，导致这个过程计算量巨大，耗时非常多。
老版本 webpack 利用 webpack.optimize.UglifyJsPlugin 进行文件压缩，但是此插件是单线程，可利用 ParallelUglifyPlugin 插件实现多线程压缩，ParallelUglifyPlugin 则会开启多个子进程，把对多个文件的压缩工作分配给多个子进程去完成，每个子进程其实还是通过 UglifyJS 去压缩代码，但是变成了并行执行。 所以 ParallelUglifyPlugin 能更快的完成对多个文件的压缩工作。
使用 ParallelUglifyPlugin 也非常简单，把原来 Webpack 配置文件中内置的 UglifyJsPlugin 去掉后，再替换成 ParallelUglifyPlugin，相关代码如下：
```js
// ...
const ParallelUglifyPlugin = require('webpack-parallel-uglify-plugin');
module.exports = {
// ...
plugins: [
// ...
// 使用 ParallelUglifyPlugin 并行压缩输出的 JS 代码
new ParallelUglifyPlugin({
// 传递给 UglifyJS 的参数
uglifyJS: {
compress: {
// 在UglifyJs删除没有用到的代码时不输出警告
warnings: false,
drop_debugger: true,
// 删除所有的 `console` 语句，可以兼容ie浏览器
drop_console: true,
// 内嵌定义了但是只用到一次的变量
collapse_vars: true,
// 提取出出现多次但是没有定义成变量去引用的静态值
reduce_vars: true,
},
output: {
// 最紧凑的输出
beautify: false,
// 删除所有的注释
comments: false
}
}
}),
]
}
```
### 2. 优化开发体验
在开发过程中，修改代码是最常见的事情，我们不可能每次修改代码都去重新打包，刷新浏览器，所以需要配置一套自动化的解决方案，每次修改代码，都能自动化的重新打包（或增量打包），刷新浏览器。
#### - 使用自动刷新
##### 步骤一：监听文件变更
有两种方式：
- 在配置文件 `webpack.config.js` 中设置 `watch: true`
```js
// 从配置的 Entry 文件出发，递归解析出 Entry 文件所依赖的文件，
// 把这些依赖的文件加入到监听列表
// 而不是直接监听项目目录下的所有文件
module.export = {
// 只有在开启监听模式时，watchOptions 才有意义
// 默认为 false，也就是不开启
watch: true,
// 监听模式运行时的参数
// 在开启监听模式时，才有意义
watchOptions: {
// 不监听的文件或文件夹，支持正则匹配
// 默认为空
ignored: /node_modules/,
// 在 Webpack 中监听一个文件发生变化的原理是定时的不停的去获取文件的最后编辑时间，
// 每次都存下最新的最后编辑时间，如果发现当前获取的和最后一次保存的最后编辑时间不一致，
// 就认为该文件发生了变化。
// poll 就是用于控制定时检查的周期，具体含义是每隔多少毫秒检查一次
// 默认每隔1000毫秒询问一次
poll: 1000,
// 监听到文件发生变化时，webpack 并不会立刻告诉监听者，
// 而是先缓存起来，收集一段时间的变化后，再一次性告诉监听者
// aggregateTimeout 就是用于配置这个等待时间，
// 目的是防止文件更新太快导致重新编译频率太高，让程序构建卡死
// 默认为 300ms
aggregateTimeout: 300,
// 不监听的 node_modules 目录下的文件
ignored: /node_modules/,
}
}
```
- 在执行启动 Webpack 命令时，带上 `--watch` 参数，完整命令是 `webpack --watch`
##### 步骤二：控制浏览器自动刷新
###### 方式一：webpack-dev-server
在使用 webpack-dev-server 模块去启动 webpack 模块时，webpack 模块的监听模式默认会被开启。 webpack 模块会在文件发生变化时告诉 webpack-dev-server 模块。
devServer 默认（默认开启 devServer.inline ）采用往开发的网页中注入代理客户端代码，通过代理客户端去刷新整个页面的原理实现网页的自动刷新。但它会向每一个 Chunk 包都注入一个代理服务器，当项目需要输出的 Chunk 有很多个时，这会导致构建缓慢，所以，另一方面：
我们可以关闭 inline 模式，只注入一个代理客户端，此时，devServer 会采用将开发的网页装进一个 iframe 中，通过刷新 iframe 去看到最新效果的原理实现网页的自动刷新。
###### 方式二：koa + webpack-dev-middleware + webpack-hot-middleware 前后端同构
https://segmentfault.com/a/1190000004883199
#### - 开启模块热替换
通过前面的介绍，项目每次更新代码，都会刷新整个网页，需要开发人员等待网页刷新，反应不灵敏，那么如何实现在不刷新整个网页的情况下做到超灵敏的实时预览。
##### 模块热替换与自动刷新
- 相同点：往网页注入一个代理服务器的方式，连接 devServer 及 网页
- 不同点：
- 自动刷新：网页自动刷新
- 模块热替换：模块替换机制
它同样有两种配置方式：
- `webpack-dev-server —hot`
- 在配置文件 `webpack.config.js` 中:
```js
const HotModuleReplacementPlugin = require('webpack/lib/HotModuleReplacementPlugin');
module.exports = {
entry:{
// 为每个入口都注入代理客户端
main:['webpack-dev-server/client?http://localhost:8080/', 'webpack/hot/dev-server','./src/main.js'],
},
plugins: [
// 该插件的作用就是实现模块热替换，实际上当启动时带上 `--hot` 参数，会注入该插件，生成 .hot-update.json 文件。
new HotModuleReplacementPlugin(),
],
devServer:{
// 告诉 DevServer 要开启模块热替换模式
hot: true,
}
};
```
Webpack 为了让使用者在使用了模块热替换功能时能灵活地控制老模块被替换时的逻辑，可以在源码中定义一些代码去做相应的处理。所以你需要配置入口文件：
```js
import React from 'react';
import { render } from 'react-dom';
import { AppComponent } from './AppComponent';
import './main.css';
render(<AppComponent/>, window.document.getElementById('app'));
// 只有当开启了模块热替换时 module.hot 才存在
if (module.hot) {
// accept 函数的第一个参数指出当前文件接受哪些子模块的替换，这里表示只接受 ./AppComponent 这个子模块
// 第2个参数用于在新的子模块加载完毕后需要执行的逻辑
module.hot.accept(['./AppComponent'], () => {
// 新的 AppComponent 加载成功后重新执行下组建渲染逻辑
render(<AppComponent/>, window.document.getElementById('app'));
});
}
```
当子模块发生更新时，更新事件会一层层往上传递，也就是从 `AppComponent.js` 文件传递到 `main.js`文件， 直到有某层的文件接受了当前变化的模块，也就是 `main.js` 文件中定义的 `module.hot.accept(['./AppComponent'], callback)`， 这时就会调用 `callback` 函数去执行自定义逻辑。如果事件一直往上抛到最外层都没有文件接受它，就会直接刷新网页。
那为什么没有地方接受过 `.css` 文件，但是修改所有的 `.css` 文件都会触发模块热替换呢？ 原因在于 `style-loader` 会注入用于接受 CSS 的代码。
> 请不要把模块热替换技术用于线上环境，它是专门为提升开发效率生的。
关闭默认的 inline 模式手动注入代理客户端的优化方法不能用于在使用模块热替换的情况下， 原因在于模块热替换的运行依赖在每个 Chunk 中都包含代理客户端的代码。
## 二、优化输出质量
### 1. 优化首屏加载时间
#### - 区分环境
针对不同的环境，我们应对打包的要求也不一样：
- 开发环境：侧重功能的调试
- 生产环境：侧重用户的体验
同一套源码如何打包成适用不同环境的包，webpack 通过配置环境变量的值，帮我们实现了这一点：
##### 配置很简单：
**方法一：**
```js
module.exports = {
plugins: [
new webpack.DefinePlugin({
// 定义 NODE_ENV 环境变量为 production
'process.env': {
NODE_ENV: JSON.stringify('production')
}
}),
],
};
```
注意这里使用 `JSON.stringify('production')` ，而不直接使用 `'production'` ，原因是环境变量的值需要是一个由双引号包裹的字符串，而 `JSON.stringify('production')` 的值正好等于 `'"production"'` 。
或：
**方法二：**
```js
// 使用 NODE_ENV=production webpack ... 启动
module.exports = {
plugins: [
new webpack.EnvironmentPlugin(['NODE_ENV'])
],
};
```
##### 使用也很简单：
在被打包的文件中可以测试一下：
```js
if (process.env.NODE_ENV === 'production') {
console.log('你正在使用线上环境');
} else {
console.log('你正在使用开发环境');
}
```
> 注意：
>
> - 只用在项目中使用到 `process` 时，webpack 才会将 process 模块的代码打包进来，没使用则不会。
>
> - 并且打包成功的源码中
>
> ```js
> if (process.env.NODE_ENV === 'production') {
> console.log('你正在使用线上环境');
> } else {
> console.log('你正在使用开发环境');
> }
> ```
>
> 被直接替换成了
>
> ```js
> if (true) {
> console.log('你正在使用线上环境');
> } else {}
> // 这里 console.log('你正在使用开发环境') 是死代码，在 UglifyJS 压缩时被去除了
> ```
>
> 此时访问 process 的语句被替换了而没有了，Webpack 也不会打包进 process 模块
>
> - 定义的环境变量只对 Webpack 需要处理的代码有效，而不会影响 Node.js 运行时的环境变量的值。
`process.env.NODE_ENV !== 'production'` 中的 `NODE_ENV` 和 `'production'` 两个值是社区普遍的约定，很多第三方库（React）都针对此做了环境区分的优化，我们也开始使用这条判断语句在开发时区分开发环境和线上环境。
注意：在 webpack4 中 `mode: 'production'` 已经默认配置了`process.env.NODE_ENV = 'production'`
#### - 压缩代码
用户通过浏览器访问网页（JS、CSS资源），当文件体积越大时，网页的加载时间就越长，使用的流量就越大，用户的体验就越糟糕，所以我们需要对代码进行压缩。
目前比较成熟的压缩工具有两种：
- UglifyJsPlugin：通过封装 UglifyJS 实现压缩
- ParallelUglifyPlugin：多进程并行处理压缩
他们都会分析 JavaScript 代码语法树，理解代码含义，从而能做到诸如去掉无效代码、去掉日志输出代码、缩短变量名等优化，但相对于 UglifyJsPlugin 是单线程， ParallelUglifyPlugin 插件实现了多线程压缩，ParallelUglifyPlugin 会开启多个子进程，把对多个文件的压缩工作分配给多个子进程去完成，每个子进程其实还是通过 UglifyJS 去压缩代码，但是变成了并行执行。 所以 ParallelUglifyPlugin 能更快的完成对多个文件的压缩工作。
##### 压缩 Js
###### UglifyJsPlugin
```js
module.exports = {
plugins: [
// 压缩输出的 JS 代码
new webpack.optimize.UglifyJsPlugin({
compress: {
// 在UglifyJs删除没有用到的代码时不输出警告
warnings: false,
// 删除所有的 `console` 语句，可以兼容ie浏览器
drop_console: true,
// 内嵌定义了但是只用到一次的变量
collapse_vars: true,
// 提取出出现多次但是没有定义成变量去引用的静态值
reduce_vars: true,
},
output: {
// 最紧凑的输出
beautify: false,
// 删除所有的注释
comments: false,
}
}),
],
};
```
或在启动打包时加上 `--optimize-minimize` ，这样 Webpack 会自动为你注入一个带有默认配置的 UglifyJSPlugin 。
###### webpack4 中 `webpack.optimize.UglifyJsPlugin` 已被废弃
```js
module.exports = {
optimization: {
minimize: true,
},
}
```
##### 压缩 css
仅仅需要在 `css-loader` 时，加上 `'css-loader?minimize'`
#### - CDN 加速
优化用户体验不光要压缩代码文件，还要提高网络的传输速度，通过 CDN 可以实现。
> CDN：内容分发网络，通过把资源部署到世界各地，用户在访问时按照就近原则从离用户最近的服务器获取资源，从而加速资源的获取速度。 CDN 其实是通过优化物理链路层传输过程中的网速有限、丢包等问题来提升网速的，其大致原理可以如下：
因为 CDN 都有缓存，所以为了避免 CDN 缓存导致用户加载到老版本的问题，需要遵循以下规则：
- 针对 HTML 文件：不开启任何缓存，不放入 CDN
- 针对静态 JS 、CSS 、图片等文件：开启 CDN 和缓存，放入 CDN 服务器，并且给每一个文件名带入 Hash 值，避免文件重名导致访问到同名缓存废弃文件的问题
- 介于浏览器对同一时刻、同一域名的请求个数有限制的状况，请求资源过多的话，可能导致加载文件被阻塞。所以，当同一时间加载资源过多时，我们可以针对不同的文件类型放入不同的 CDN 上
所以针对以上，我们在构建中注意：
- 静态资源的导入 URL 应设置为指向 CDN 服务器的绝对路径 URL
- 静态资源的文件要加入根据内容计算出的 Hash 值，防止被缓存
- 不同资源放入不同域名的 CDN 服务器上，防止资源并并行加载导致的阻塞
```js
const path = require('path');
const ExtractTextPlugin = require('extract-text-webpack-plugin');
const {WebPlugin} = require('web-webpack-plugin');
module.exports = {
// 省略 entry 配置...
output: {
// 给输出的 JavaScript 文件名称加上 Hash 值
filename: '[name]_[chunkhash:8].js',
path: path.resolve(__dirname, './dist'),
// 指定存放 JavaScript 文件的 CDN 目录 URL
publicPath: '//js.cdn.com/id/',
},
module: {
rules: [
{
// 增加对 CSS 文件的支持
test: /\.css$/,
// 提取出 Chunk 中的 CSS 代码到单独的文件中
use: ExtractTextPlugin.extract({
// 压缩 CSS 代码
use: ['css-loader?minimize'],
// 指定存放 CSS 中导入的资源（例如图片）的 CDN 目录 URL
publicPath: '//img.cdn.com/id/'
}),
},
{
// 增加对 PNG 文件的支持
test: /\.png$/,
// 给输出的 PNG 文件名称加上 Hash 值
use: ['file-loader?name=[name]_[hash:8].[ext]'],
},
// 省略其它 Loader 配置...
]
},
plugins: [
// 使用 WebPlugin 自动生成 HTML
new WebPlugin({
// HTML 模版文件所在的文件路径
template: './template.html',
// 输出的 HTML 的文件名称
filename: 'index.html',
// 指定存放 CSS 文件的 CDN 目录 URL
stylePublicPath: '//css.cdn.com/id/',
}),
new ExtractTextPlugin({
// 给输出的 CSS 文件名称加上 Hash 值
filename: `[name]_[contenthash:8].css`,
}),
// 省略代码压缩插件配置...
],
};
```
注意：
- 但多个 CDN 域名会增加域名解析时间，是否采用多域名解析需要根据具体的情况而定。
- 我们可以在 HTML HEAD 中加入 `<link rel="dns-prefetch" href="//js.cdn.com">` 去预解析域名，降低域名解析带来的延迟
- `//cdn.com/` 的URL省略掉了前面的 `http:` 或者` https:` 前缀，在具体数据请求时，它会根据当前 HTML 的 URL 加载模式去确定是采用 HTTP 还是 HTTPS 模式。
#### - 使用 Tree Shaking
Tree Shaking 可以用来剔除 JavaScript 中用不上的死代码。但仅仅针对的是 ES6 语法的代码。这是因为 ES6 模块化语法是静态的（`import x from './util';` ：导入导出的都是静态的字符串），webpack 可以简单的分析出哪些被 `import` 或 `export` 了，如果采用 ES5 （ `require(x+y)` ），webpack 则无法分析出具体哪些可以剔除。
> 目前的 Tree Shaking 还有些的局限性，经实验发现：
>
> 1. 不会对entry入口文件做 Tree Shaking。
> 2. 不会对[异步分割](https://webpack.wuhaolin.cn/4%E4%BC%98%E5%8C%96/4-12%E6%8C%89%E9%9C%80%E5%8A%A0%E8%BD%BD.html)出去的代码做 Tree Shaking。
步骤一：配置 `.babelrc`
```js
{
"presets": [
[
"env",
{
// 关闭 Babel 的模块转换功能，保留原本的 ES6 模块化语法
"modules": false
}
]
]
}
```
并且在启动 Webpack 时带上 `--display-used-exports` 参数，以方便追踪 Tree Shaking 的工作。
注意：Webpack 只是指出了哪些函数用没用上，要剔除用不上的代码还得经过 UglifyJS 去处理一遍
步骤二：配合 UglifyJS
这里可以简单操作一下：在启动 Webpack 时带上 `--optimize-minimize` 参数，
具体的操作可以看一下 UglifyJS 模块。
#### - 提取公共代码
为什么要提取公共代码？
很多大型项目都是由多页面构成，并且所有的页面都采用同一套技术及基础库，如果每个页面单独打包、加载，就会导致每个包都包含大量的公共部分、基础库。影响用户体验：
- 相同的资源被重复加载，浪费用户的流量与服务器的成本
- 每个页面需要加载的资源过大，页面首屏加载过慢，影响用户体验
所以我们需要提取公共代码，单独打包，当用户加载多页面应用时，第一次访问的时候，公共代码将会被浏览器缓存起来，当加载其它页面时，用户不需要再重复加载公共模块，直接从缓存中获取即可。
怎么提取喃？
##### 第一步：使用 DllPlugin 来提取基础模块库，预构建依赖包
前面我们提到我们可以使用 DllPlugin 来提取基础模块库，这里不再赘述。
##### 第二步：使用 CommonsChunkPlugin 或 SplitChunksPlugin（webpack4以上） 对公共模块打包
**方式一：CommonsChunkPlugin **
Webpack 内置了专门用于提取多个 Chunk 中公共部分的插件 CommonsChunkPlugin：
```js
new webpack.optimize.CommonsChunkPlugin({
// 从哪些 Chunk 中提取
// chunks: ['a', 'b'], 不填则默认会从所有已知的 Chunk 中提取
// name: 提取出的公共部分形成一个新的 Chunk，这个新 Chunk 的名称
name: "index",
// 在传入 公共chunk(commons chunk) 之前所需要包含的最少数量的 chunks 。
// 数量必须大于等于2，或者少于等于 chunks的数量
// 传入 `Infinity` 会马上生成 公共chunk，但里面没有模块。
// 你可以传入一个 `function` ，以添加定制的逻辑（默认是 chunk 的数量）
minChunks: 2,
// 如果设置为 `true`，所有公共 chunk 的子模块都会被选择
children: true,
// 如果设置为 `true`，所有公共 chunk 的后代模块都会被选择
deepChildren: true,
})
```
**方式二：SplitChunksPlugin（webpack4以上）**
```js
new webpack.optimize.SplitChunksPlugin({
chunks: "all",
minSize: 30000,
minChunks: 1,
maxAsyncRequests: 5,
maxInitialRequests: 3,
automaticNameDelimiter: '~',
name: true,
cacheGroups: {
vendors: {
test: /[\\/]node_modules[\\/]/,
priority: -10
},
default: {
minChunks: 2,
priority: -20,
reuseExistingChunk: true
}
}
}),
```
- chunks: 表示哪些代码需要优化，有三个可选值：initial(初始块)、async(按需加载块)、all(全部块)，默认为async
- minSize: 表示在压缩前的最小模块大小，默认为30000
- minChunks: 表示被引用次数，默认为1
- maxAsyncRequests: 按需加载时候最大的并行请求数，默认为5
- maxInitialRequests: 一个入口最大的并行请求数，默认为3
- automaticNameDelimiter: 命名连接符
- name: 拆分出来块的名字，默认由块名和hash值自动生成
- test: 用于控制哪些模块被这个缓存组匹配到
- priority: 缓存组打包的先后优先级
- reuseExistingChunk: 如果当前代码块包含的模块已经有了，就不在产生一个新的代码块
- cacheGroups，缓存组。当我们不配置这个属性时，当我们import 多个库，比如jquery, lodash 时，进行代码分割，是会分别放入两个文件中的。但我们配置了cacheGroups 时，如上。它就会在打包时，先将要分割的代码缓存到vendor 组或者default 组，再一起打包成一个文件。
- priority 属性，是指，当一个文件满足两个以上的组的时候，那个组的priority 越大那么它的优先级越高，就会判断进那个组。
- reuseExistingChunk 属性，是指，当一个模块已经被打包过，那么它在其他文件中需要再次引入时，可以复用之前打包的文件。
#### - 按需加载
针对单页面应用首屏加载过慢，我们也可以采用懒加载、按需加载的方式控制首屏加载文件大小。
- 将网站划分为几个大的功能模块
- 每一块为一个 chunk，除首页 chunk 直接加载外，按需加载其余的 chunk
- 对于依赖代码量特别大的功能，也可以进行按需加载
我们知道在 ES6 中，我们使用 `import` 、`export` 静态的加载、导出文件，这里以ES6 `import()` 为例，更多可查看 [Module Methods](https://webpack.js.org/api/module-methods/#import)。
**步骤一：按需加载**
```js
export default class Routes extends React.Component {
render() {
return (
<Router path={href} history={browserHistory}>
<Switch>
<Route exact path='/' component={Splash} />
<Route path='/login' component={Login} />
<Route path='/main/' component={getAsyncComponent(
// 异步加载函数，异步地加载 main 组件
() => import(/* webpackChunkName: 'page-main' */'./page/main')
)}
/>
</Switch>
</Router>
)
}
}
/**
* 异步加载组件
* @param load 组件加载函数，load 函数会返回一个 Promise，在文件加载完成时 resolve
* @returns {AsyncComponent} 返回一个高阶组件用于封装需要异步加载的组件
*/
function getAsyncComponent(load) {
return class AsyncComponent extends React.PureComponent {
componentDidMount() {
// 在高阶组件 DidMount 时才去执行网络加载步骤
load().then(({default: component}) => {
// 代码加载成功，获取到了代码导出的值，调用 setState 通知高阶组件重新渲染子组件
this.setState({
component,
})
});
}
render() {
const {component} = this.state || {};
// component 是 React.Component 类型，需要通过 React.createElement 生产一个组件实例
return component ? React.createElement(component) : null;
}
}
}
```
**步骤二：支持 import()**
你可能遇到 `import()` 报错 `Support for the experimental syntax 'dynamicImport' isn't currently enabled` ，这是因为 `import()` 还没有被加入到 ECMAScript 标准中去，所以我们需要安装 `npm install babel-plugin-syntax-dynamic-import --save-dev` ，并且配置 ：
```js
// .babelrc 文件
{
"presets": [
// ...
],
"plugins": [
"syntax-dynamic-import"
// ...
]
}
```
并且可以在 webapck 中配置为动态加载的 Chunk 配置输出文件的名称 `chunkFilename` 。
### 2. 提升流畅度
前面分块、按需加载，都是网络加载层面的优化，下面我们主要介绍代码运行时的优化。
#### - 使用 Prepack
我们在之前 **区分环境** 中介绍过，`process.env.NODE_ENV === 'production'` 在打包时被直接替换成 `true` ，优化了源代码的运行逻辑，输出了性能更高的 JavaScript 代码。
Prepack 就是这样一个部分求值器，编译代码时，提前将运行结果放到编译后的代码中，而不是在代码运行时再去求值。
Prepack 的工作原理及流程大致如下：
- 通过 Babel 把 JavaScript 源码解析成抽象语法树（AST），以方便更细粒度地分析源码
- Prepack 实现了一个 JavaScript 解释器，用于执行源码。借助这个解释器 Prepack 才能掌握源码具体是如何执行的，并把执行过程中的结果返回到输出中
在 UglifyJS 压缩代码时，也会对这些代码进行优化，所以是否使用依据具体的项目而定，这里不做过多介绍。
#### - 开启 Scope Hoisting
Scope Hoisting（作用域提升） 可以让 webapck 打包出来的文件更小、运行更快。
假如现在有两个文件分别是 `util.js`:
```js
export default 'Hello,Webpack';
```
和入口文件 `main.js`:
```js
import str from './util.js';
console.log(str);
```
以上源码用 Webpack 打包后输出中的部分代码如下：
```js
[
(function (module, __webpack_exports__, __webpack_require__) {
var __WEBPACK_IMPORTED_MODULE_0__util_js__ = __webpack_require__(1);
console.log(__WEBPACK_IMPORTED_MODULE_0__util_js__["a"]);
}),
(function (module, __webpack_exports__, __webpack_require__) {
__webpack_exports__["a"] = ('Hello,Webpack');
})
]
```
在开启 Scope Hoisting 后，同样的源码输出的部分代码如下：
```js
[
(function (module, __webpack_exports__, __webpack_require__) {
var util = ('Hello,Webpack');
console.log(util);
})
]
```
从中可以看出开启 Scope Hoisting 后，函数申明由两个变成了一个，`util.js` 中定义的内容被直接注入到了 `main.js` 对应的模块中。 这样做的好处是：
- 代码体积更小，因为函数申明语句会产生大量代码；
- 代码在运行时因为创建的函数作用域更少了，内存开销也随之变小。
> Scope Hoisting 的实现原理其实很简单：分析出模块之间的依赖关系，尽可能的把打散的模块合并到一个函数中去，但前提是不能造成代码冗余。 因此只有那些被引用了一次的模块才能被合并。
**注意：Scope Hoisting 需要分析出模块之间的依赖关系，因此源码必须采用 ES6 模块化语句，对于采用了非 ES6 模块化语法的代码，Webpack 会降级处理不使用 Scope Hoisting 优化。**
Webpack 中使用 Scope Hoisting 很简单，只需要配置：
```js
module.exports = {
plugins: [
// 开启 Scope Hoisting
new webpack.optimize.ModuleConcatenationPlugin(),
],
resolve: {
// 针对 Npm 中的第三方模块优先采用 jsnext:main 中指向的 ES6 模块化语法的文件
mainFields: ['jsnext:main', 'browser', 'main']
},
};
```
可以在启动 Webpack 时带上 `--display-optimization-bailout` ，就可以知道 Webpack 对哪些代码做了降级处理。
### 3. 输出分析
虽然前面介绍了很多优化方法，但具体项目如何进行优化，这就要分析它的输出结果，来决定如何进行优化。
最直观的方式是分析它的输出文件，但 webpack 打包后的文件非常大且可读性差，下面就介绍几种可视化的分析工具，帮助你快速定位问题所在。
#### - webpack-bundle-analyzer
它能方便的让你知道：
- 打包出的文件中都包含了什么；
- 每个文件的尺寸在总体中的占比，一眼看出哪些文件尺寸大；
- 模块之间的包含关系；
- 每个文件的 Gzip 后的大小。
接入 webpack-bundle-analyzer 的方法很简单，步骤如下：
- 安装 webpack-bundle-analyzer 到全局，执行命令 `npm i -g webpack-bundle-analyzer`；
- 配置 webpack：
```js
var BundleAnalyzerPlugin = require('webpack-bundle-analyzer').BundleAnalyzerPlugin;
module.exports = {
plugins: [
// 开启 BundleAnalyzerPlugin
new BundleAnalyzerPlugin(),
],
};
```
#### - 官方可视化分析工具 Webapck Analyse
[Webapck Analyse](http://webpack.github.io/analyse/) 是一个在线 Web 应用。
**步骤一：生成构建文件**
在 webpack 启动时带入参数：`--profile --json > stats.json` ：
- `--profile`：记录下构建过程中的耗时信息
- `--json`：以 JSON 的格式输出构建结果，最后只输出一个 `.json` 文件，这个文件（stats.json）中包括所有构建相关的信息
- `> stats.json` ：是 UNIX/Linux 系统中的管道命令、含义是把 `webpack --profile --json` 输出的内容通过管道输出到 `stats.json` 文件中
启动后，会在项目中多出一个 `stats.json` 文件
**步骤二：Webpack Analyse**
打开 [Webapck Analyse](http://webpack.github.io/analyse/) ，上传 `stats.json`：
<img width="622" alt="upload-stats" src="https://user-images.githubusercontent.com/19721451/70489446-c5dcfe80-1b36-11ea-9f92-728e962978d4.png">
Webpack Analyse 不会把你选择的 `stats.json` 文件发达到服务器，而是在浏览器本地解析，你不用担心自己的代码为此而泄露。 选择文件后，你马上就能如下的效果图：
<img width="1344" alt="stats-analyse" src="https://user-images.githubusercontent.com/19721451/70489466-d55c4780-1b36-11ea-9a96-f77a97e6befe.png">
- **Modules**：展示所有的模块，每个模块对应一个文件。并且还包含所有模块之间的依赖关系图、模块路径、模块ID、模块所属 Chunk、模块大小；
- **Chunks**：展示所有的代码块，一个代码块中包含多个模块。并且还包含代码块的ID、名称、大小、每个代码块包含的模块数量，以及代码块之间的依赖关系图；
- **Assets**：展示所有输出的文件资源，包括 `.js`、`.css`、图片等。并且还包括文件名称、大小、该文件来自哪个代码块；
- **Warnings**：展示构建过程中出现的所有警告信息；
- **Errors**：展示构建过程中出现的所有错误信息；
- **Hints**：展示处理每个模块的过程中的耗时。
```
|
zxtariel0512/Hula-Hoop-Research-Program
|
zxtariel0512/Hula-Hoop-Research-Program
README.md
```# Hula-Hoop-Research-Program
Analytical and Numerical Study on Hula-Hoop Dynamics and Levitation Condition May 2019 - current l Constructed a model of hula hoop motion based on Lagrangian Mechanics and implemented a simulation program in Matlab to solve the problem numerically l Used high speed camera video-tracking techniques to record and capture hoop’s motion information at each millisecond, and implemented algorithms that analyzed 16050 frames to track the exact motion condition of hoop and body and to calculate the sagging angle of hoop l Implemented visualization program that recorded and reflected 25,000+ experiment video frame at real time l Concluded general conditions of hula hoop levitation in equilibrium and stability analysis in three dimension using Coriolis Force and Lagrangian optimization
```
|
zxthanhhuy/rbac-graph
|
zxthanhhuy/rbac-graph
readme.md
```This repository contains examples for using the Spring Data Graph Library,
currently the examples all use the 1.0.0.M4 release.
* HelloWorlds is a simple application showing the basic setup, annotations and usage
* Imdb is a graph based webapp for a movie - actor database using an older spring-web stack and an example for in graph indexes
* Myrestaurants-Social is a spring-roo generated and then modified restaurant - rating webapp that was extended using a social graph with ratings and recommendations
[](http://www.youtube.com/watch?v=PXj48XoMalg)
```
|
zxyc88/Roulette
|
zxyc88/Roulette
RouletteWheel.java
```package com.roulette.roulette.model;
import java.util.ArrayList;
public class RouletteWheel {
private final static ArrayList<Integer> theWheel = new ArrayList<>();
public RouletteWheel(){
theWheel.add(37);
theWheel.add(27);
theWheel.add(10);
theWheel.add(25);
theWheel.add(29);
theWheel.add(12);
theWheel.add(8);
theWheel.add(19);
theWheel.add(31);
theWheel.add(18);
theWheel.add(6);
theWheel.add(21);
theWheel.add(33);
theWheel.add(16);
theWheel.add(4);
theWheel.add(23);
theWheel.add(35);
theWheel.add(14);
theWheel.add(2);
theWheel.add(0);
theWheel.add(28);
theWheel.add(9);
theWheel.add(26);
theWheel.add(30);
theWheel.add(11);
theWheel.add(7);
theWheel.add(20);
theWheel.add(32);
theWheel.add(17);
theWheel.add(5);
theWheel.add(22);
theWheel.add(34);
theWheel.add(15);
theWheel.add(3);
theWheel.add(24);
theWheel.add(36);
theWheel.add(13);
theWheel.add(1);
}
public static ArrayList<Integer> getTheWheel() {
return theWheel;
}
public int getWheelIndex(Integer number){
return theWheel.indexOf(number);
}
public int getWheelNumber(Integer number){
return theWheel.get(number);
}
public int getWheelSize(){
return theWheel.size();
}
}
```
ViewDataRepository.java
```package com.roulette.roulette.repository;
import com.roulette.roulette.model.Dealer;
import com.roulette.roulette.model.ViewData;
import org.springframework.stereotype.Repository;
import org.springframework.data.repository.CrudRepository;
import java.util.List;
@Repository
public interface ViewDataRepository extends CrudRepository<ViewData, Long> {
List<ViewData> findByDealer(Dealer dealer);
}
```
Dealer.java
```package com.roulette.roulette.model;
import javax.persistence.Entity;
import javax.persistence.GeneratedValue;
import javax.persistence.GenerationType;
import javax.persistence.Id;
@Entity(name = "dealers")
public class Dealer {
@Id
@GeneratedValue(strategy = GenerationType.AUTO)
private long id;
private String name;
public int inTheZone() {
//Method to return the time that is best to Bet and Dealer is IN THE ZONE
//Optimal time for dealer to heat up and get in their rhythm but still far from a break or end of shift
return 0;
}
public Dealer (){
}
public Dealer (String name){
this.name = name;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
}
```
create_db_postgres.sql
```CREATE TABLE public."dealers"
(
id serial primary key,
name varchar(255) NOT NULL
);
CREATE TABLE public."view_data"
(
id serial primary key,
dealer_id integer NOT NULL REFERENCES dealers (id),
start_at numeric(5),
finish_at numeric(5),
delta double precision(10),
direction varchar(10),
sdDelta double precision(10)
);```
ViewData.java
```package com.roulette.roulette.model;
import javax.persistence.*;
@Entity(name = "view_data")
public class ViewData {
@Id
@GeneratedValue(strategy = GenerationType.AUTO)
private long id;
@ManyToOne(cascade = {CascadeType.ALL})
@JoinColumn(name = "dealer_id")
private Dealer dealer;
@Column(name="start_at")
private Integer startAt;
@Column(name="finish_at")
private Integer finishAt;
@Column(name="delta")
private Double delta;
@Column(name="direction")
private String direction;
@Column(name="sd_delta")
private Double sdDelta;
public ViewData(){}
public ViewData(Dealer dealer, Integer startAt)
{
this.dealer = dealer;
this.startAt = startAt;
}
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public Integer getStartAt() {
return startAt;
}
public void setStartAt(Integer startAt) {
this.startAt = startAt;
}
public Dealer getDealer() {
return dealer;
}
public void setDealer(Dealer dealer) {
this.dealer = dealer;
}
public Integer getFinishAt() {
return finishAt;
}
public void setFinishAt(Integer finishAt) {
this.finishAt = finishAt;
}
public Double getDelta() {
return delta;
}
public void setDelta(Double delta) {
this.delta = delta;
}
public String getDirection() {
return direction;
}
public void setDirection(String direction) {
this.direction = direction;
}
public Double getSdDelta() {
return sdDelta;
}
public void setSdDelta(Double sdDelta) {
this.sdDelta = sdDelta;
}
}
```
Colour.java
```package com.roulette.roulette.model;
public enum Colour {
RED, BLACK, GREEN;
}
```
DataService.java
```package com.roulette.roulette.service;
import com.roulette.roulette.model.*;
import com.roulette.roulette.repository.DealerRepository;
import com.roulette.roulette.repository.ViewDataRepository;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import java.util.ArrayList;
import java.util.List;
import static java.lang.Math.*;
@Service
public class DataService{
@Autowired
ViewDataRepository viewDataRepository;
@Autowired
DealerRepository dealerRepository;
private RouletteWheel rouletteWheel = new RouletteWheel();
public Information bestNumbers(String dealerName, int start){
Information information = new Information();
Dealer dealer = dealerRepository.findByName(dealerName);
if (dealer == null) {
return information;
}
List<ViewData> viewData = viewDataRepository.findByDealer(dealer);
information = getInformation(viewData);
int startIndex = rouletteWheel.getWheelIndex(start);
List<Integer> bestNumbers = new ArrayList<>();
int startingIndex = (startIndex + information.getAvgDelta() - information.getDeltaSD());
int endingIndex = startingIndex + (((2*information.getDeltaSD())+1));
for (int i = startingIndex; i < endingIndex; i++){
bestNumbers.add(rouletteWheel.getWheelNumber(i % 37));
}
information.setDealerName(dealerName);
information.setBestNumbers(bestNumbers);
return information;
}
public void addMathematics(ViewData viewData){
//This is being passed the Data (start, finish, dealer being added)
//given start/end/dealer this should full out ALL other table values we want to store
Integer startIndex = rouletteWheel.getWheelIndex(viewData.getStartAt());
Integer endingIndex = rouletteWheel.getWheelIndex(viewData.getFinishAt());
Double delta;
String deltaDirection;
if (endingIndex >= startIndex && endingIndex != null)
{
delta = (double)(endingIndex - startIndex);
deltaDirection = "Right";
}
else if (endingIndex != null)
{
delta = (double)((endingIndex - startIndex)+rouletteWheel.getWheelSize());
deltaDirection = "Right";
//The LeftDirection would be
//delta = (double)(startIndex - endingIndex)
}
else {
delta = null;
deltaDirection = "Null";
}
viewData.setDelta(delta);
viewData.setDirection(deltaDirection);
viewDataRepository.save(viewData);
List<ViewData> dataForDealer = viewDataRepository.findByDealer(viewData.getDealer());
Double sdDelta = (double) getInformation(dataForDealer).getDeltaSD();
viewData.setSdDelta(sdDelta);
viewDataRepository.save(viewData);
}
private Information getInformation(List<ViewData> viewData){
Information information = new Information();
int count = 0;
List<Double> delta = new ArrayList<>();
double deltaSum = 0;
double sdDelta;
int j = 0;
for (int i = viewData.size()-1; i >= 0 ; i--)
{
delta.add(viewData.get(i).getDelta());
deltaSum = deltaSum + delta.get(j);
count++;
j++;
if (count == 10 || j >= viewData.size())
{
break;
}
}
double runningTotal = 0;
for (int i = 0; i < delta.size(); i++) {
double calc= Math.pow((delta.get(i) - (deltaSum/count)),2);
runningTotal = runningTotal + calc;
}
sdDelta = sqrt(runningTotal / (count - 1));
information.setAvgDelta((int)ceil(deltaSum/count));
information.setRealDeltaSD((int)ceil(sdDelta));
information.setDeltaSD((int)ceil(sdDelta));
return information;
}
}
```
README.md
```### UI
1. `npm install -g @vue/cli` used to set up vue cli
2. `vue create ui` creates ui folder
3. `cd ui` moves you to ui folder
4. `vue add vuetify` adds veutify to ui
5. `npm run serve` runs the UI
6. `npm install --save vue-router`
7. `npm install --save axios`
### db schema changes
1. update the ```./schema/create_db_postgres.sql``` file with the updated schema
2. recreate the db in docker-compose ```docker-compose rm -fs``` ```docker-compose up -d``````
DealerData.java
```package com.roulette.roulette.model;
public class DealerData {
private int id;
private Dealer dealer;
private Block start;
private Block end;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public Dealer getDealer() {
return dealer;
}
public void setDealer(Dealer dealer) {
this.dealer = dealer;
}
public Block getStart() {
return start;
}
public void setStart(Block start) {
this.start = start;
}
public Block getEnd() {
return end;
}
public void setEnd(Block end) {
this.end = end;
}
}
```
DealerRepository.java
```package com.roulette.roulette.repository;
import com.roulette.roulette.model.Dealer;
import org.springframework.data.repository.CrudRepository;
import org.springframework.stereotype.Repository;
import java.util.List;
@Repository
public interface DealerRepository extends CrudRepository<Dealer, Long> {
Dealer findByName(String name);
Dealer findByNameContainingIgnoreCase(String name);
List<Dealer> findAll();
}
```
Block.java
```package com.roulette.roulette.model;
import static com.roulette.roulette.model.Colour.BLACK;
import static com.roulette.roulette.model.Colour.RED;
import static com.roulette.roulette.model.Colour.GREEN;
public class Block {
private String number;
private Colour colour;
public Block(String number){
this.number = number;
if (number.equals("2") || number.equals("4") || number.equals("6") || number.equals("8") || number.equals("10") || number.equals("11") || number.equals("13")
|| number.equals("15") || number.equals("17") || number.equals("20") || number.equals("22") || number.equals("24") || number.equals("26") || number.equals("28")
|| number.equals("29") || number.equals("31") || number.equals("33") || number.equals("35")){
this.colour = BLACK;
}
else if (number.equals("1") || number.equals("3") || number.equals("5") || number.equals("7") || number.equals("9") || number.equals("12") || number.equals("14")
|| number.equals("16") || number.equals("18") || number.equals("19") || number.equals("21") || number.equals("23") || number.equals("25") || number.equals("27")
|| number.equals("30") || number.equals("32") || number.equals("34") || number.equals("36")){
this.colour = RED;
}
else
{
this.colour = GREEN;
}
}
public Block(String number, Colour colour){
this.number = number;
this.colour = colour;
}
public String getNumber() {
return number;
}
public void setNumber(String number) {
this.number = number;
}
public Colour getColour() {
return colour;
}
public void setColour(Colour colour) {
this.colour = colour;
}
}
```
RouletteService.java
```package com.roulette.roulette.service;
import com.roulette.roulette.model.*;
import com.roulette.roulette.repository.DealerRepository;
import com.roulette.roulette.repository.ViewDataRepository;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import java.util.ArrayList;
import java.util.List;
@Service
public class RouletteService {
@Autowired
DealerRepository dealerRepository;
@Autowired
ViewDataRepository viewDataRepository;
@Autowired
DataService dataService;
public Information getData(String dealerName, int start){
return dataService.bestNumbers(dealerName,start);
}
public boolean addData(ViewData viewdata)
{
Dealer dealer = dealerRepository.findByNameContainingIgnoreCase(viewdata.getDealer().getName());
if (dealer != null) {
viewdata.setDealer(dealer);
ViewData viewData = viewDataRepository.save(viewdata);
if (viewData == null){
return false;
}
dataService.addMathematics(viewdata);
return true;
}
return false;
}
public List<Dealer> getDealers(){
return dealerRepository.findAll();
}
public List<Dealer> addDealer(Dealer dealer){
Dealer dealerInDb = dealerRepository.findByNameContainingIgnoreCase(dealer.getName());
if (dealerInDb == null){
Dealer dealerToSave = new Dealer(dealer.getName().toLowerCase());
dealerRepository.save(dealerToSave);
}
return getDealers();
}
public List<Dealer> deleteDealer(Dealer dealer){
Dealer dealerInDb = dealerRepository.findByName(dealer.getName());
if (dealerInDb != null){
List<ViewData> viewDatas = viewDataRepository.findByDealer(dealerInDb);
for (ViewData viewData : viewDatas){
viewDataRepository.delete(viewData);
}
dealerRepository.delete(dealerInDb);
}
return getDealers();
}
}
```
Information.java
```package com.roulette.roulette.model;
import java.util.List;
public class Information {
private String dealerName;
private Integer avgDelta;
private Integer deltaSD;
private Integer realDeltaSD;
private List<Integer> bestNumbers;
public String getDealerName() {
return dealerName;
}
public void setDealerName(String dealerName) {
this.dealerName = dealerName;
}
public Integer getAvgDelta() {
return avgDelta;
}
public void setAvgDelta(Integer avgDelta) {
this.avgDelta = avgDelta;
}
public Integer getDeltaSD() {
return deltaSD;
}
public Integer getRealDeltaSD() {
return realDeltaSD;
}
public void setRealDeltaSD(Integer realDeltaSD) {
this.realDeltaSD = realDeltaSD;
}
public void setDeltaSD(Integer deltaSD) {
if (deltaSD > 6){
this.deltaSD = 6;
return;
}
this.deltaSD = deltaSD;
}
public List<Integer> getBestNumbers() {
return bestNumbers;
}
public void setBestNumbers(List<Integer> bestNumbers) {
this.bestNumbers = bestNumbers;
}
}
```
RouletteController.java
```package com.roulette.roulette.controller;
import com.roulette.roulette.model.Block;
import com.roulette.roulette.model.Dealer;
import com.roulette.roulette.model.Information;
import com.roulette.roulette.model.ViewData;
import com.roulette.roulette.service.RouletteService;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Controller;
import org.springframework.web.bind.annotation.*;
import javax.swing.text.View;
import java.util.ArrayList;
import java.util.List;
@Controller
public class RouletteController {
@Autowired
private RouletteService rouletteService;
@RequestMapping(value="/addData" , method = RequestMethod.POST)
public @ResponseBody boolean addData (@RequestBody ViewData viewdata){
//Check if Start/End are Numbers between 0 and 37
return rouletteService.addData(viewdata);
}
@RequestMapping(value="/getData", method = RequestMethod.GET)
public @ResponseBody List<Information> getData(@RequestParam String dealer, @RequestParam int start){
//Check if Start Number is between 0 and 37
Information information = rouletteService.getData(dealer,start);
List<Information> informations = new ArrayList<>();
informations.add(information);
return informations;
}
@RequestMapping(value="/addDealer" , method = RequestMethod.POST)
public @ResponseBody List<Dealer> addData (@RequestBody Dealer dealer){
return rouletteService.addDealer(dealer);
}
@RequestMapping(value="/deleteDealer" , method = RequestMethod.POST)
public @ResponseBody List<Dealer> deleteDealer(@RequestBody Dealer dealer){
return rouletteService.deleteDealer(dealer);
}
@RequestMapping(value="/getDealers", method = RequestMethod.GET)
public @ResponseBody List<Dealer> getDealers ()
{
return rouletteService.getDealers();
}
}```
|
zy1256/JAVA
|
zy1256/JAVA
ConsoleInputStreamThreadBlockingMain.java
```package byte_stream;
import java.io.InputStream;
public class ConsoleInputStreamThreadBlockingMain {
public static void main(String[] args) throws Exception{
InputStream consoleIn = System.in;
System.out.println("Thread blocking...(키보드 입력시까지 무한대기)");
while (true) {
int readByte = consoleIn.read();
if(readByte == -1)break;
System.out.print((char)readByte);
}
System.out.println("Thread return...");
}
}
```
ParentChildCasting.java
```/*
객체의 형변환
1. 부모자식관계에있는 클래스들에서만 가능하다.
2. 자식객체를 부모클래스타입으로 형변환
- 자동으로 이루어진다(묵시적)
Child c = new Child();
Parent pppp = c;
3. 부모 객체를 자식클래스타입으로 형변환
- 원칙적으로는 불가능하다
- 부모의 탈을쓴 자식객체 는 가능하다.
Parent p=new Parent();
Child cccc = p;(X)
public class Parent{}
public class Child extends Parent{}
*/
public class ParentChildCasting {
public static void main(String[] args) {
Child c1 = new Child();
c1.member1 = "멤버1";
c1.member2 = "멤버2";
c1.member3 = "멤버3";
c1.member4 = "멤버4";
c1.method1();
c1.method2();
c1.method3();
c1.method4();
//2. 자식객체를 부모클래스타입으로 형변환
c1.print();//오버라이딩 메쏘드
Parent p1 = c1;
p1.member1 = "멤버1";
p1.member2 = "멤버2";
//p1.member3 = "멤버3";
//p1.member4 = "멤버4";
p1.method1();
p1.method2();
//p1.method3();
//p1.method4();
p1.print(); // 오버라이딩메쏘드
/*
3. 부모 객체를 자식클래스타입으로 형변환
- 원칙적으로는 불가능하다
- 부모의 탈을쓴 자식객체 는 가능하다.
*/
Parent p2 = new Parent();
p2.member1 = "멤버1";
p2.member2 = "멤버2";
p2.method1();
p2.method2();
System.out.println("----부모의 탈을쓴 자식객체 는 가능하다.----");
//Child c2 = p2;
Parent p3 = new Child();
Child c3 = (Child)p3;
c3.method1();
c3.method2();
c3.method3();
c3.method4();
c3.print();
}
}
```
Volume.java
```
public interface Volume {
public void up();
public void down();
}
```
DataInputOutputStreamMain.java
```package byte_stream.filter_stream;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
public class DataInputOutputStreamMain {
public static void main(String[] args) throws Exception{
FileOutputStream fos = new FileOutputStream("dataOut.txt");
DataOutputStream dos = new DataOutputStream(fos);
int writeInt = 21483647;
/*
int i1 = writeInt>>24;
int i2 = writeInt>>16;
int i3 = writeInt>>8;
int i4 = writeInt;
fos.write(i1);
fos.write(i2);
fos.write(i3);
fos.write(i4);
*/
dos.writeInt(writeInt);
dos.writeBoolean(true);
dos.writeDouble(3.14159);
dos.writeUTF("오늘도 우리반 회식날이여요!......");
fos.close();
dos.close();
DataInputStream dis = new DataInputStream( new FileInputStream("dataOut.txt"));
int readInt = dis.readInt();
System.out.println(readInt);
System.out.println(dis.readBoolean());
System.out.println(dis.readDouble());
System.out.println(dis.readUTF());
}
}
```
Overloading.java
```/*
오버로딩(다중정의)
1. 자바 다형성구현기법 중의하나이다.
2. 정의: 같은메쏘드 이름으로 여러개를 정의하는방법
- 규칙:
* 메쏘드의 이름이 같아야한다.
* 메쏘드의 인자의 숫자가 다르거나
* 메쏘드의 인자의 타입이 달라야한다.
* 메쏘드의 리턴타입,접근지정자는 상관없다.
*/
public class Overloading {
public void method(){
System.out.println("public void method()실행");
}
public void method(int i){
System.out.println("public void method(int i)실행");
}
public void method(String str){
System.out.println("public void method(String str)실행");
}
public void method(int i, int j){
System.out.println("public void method(int i, int j)실행");
}
public void method(String str1, String str2){
System.out.println("public void method(String str1, int str2)실행");
}
public void method(String str1, int str2){
System.out.println("public void method(String str1, int str2)실행");
}
}
```
DeptDaoImpl.java
```package jdbc.dept;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.Statement;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import jdbc.member.ConnectionFactory;
public class DeptDaoImpl implements DeptDao{
@Override
public void insert(Dept department) throws Exception {
Connection con = null;
PreparedStatement pstmt = null;
String insertSql = "insert into dept values(?,?,?)";
int row = 0;
try{
con = ConnectionFactory.getConnection();
pstmt = con.prepareStatement(insertSql);
pstmt.setInt(1, department.getDeptno());
pstmt.setString(2, department.getDname());
pstmt.setString(3, department.getLoc());
row = pstmt.executeUpdate();
}finally{
try{
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
System.out.println(e.getMessage());
}
}
}
@Override
public Dept selectByNo(int deptno) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
Dept department = null;
String selectSql = "select * from dept where deptno="+deptno;
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectSql);
if(rs.next()){
int no = rs.getInt("deptno");
String dname = rs.getString("dname");
String loc = rs.getString("loc");
department = new Dept(no,dname,loc);
}
}finally{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}
return department;
}
@Override
public List<Dept> selectByAll() throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
List<Dept> deptAll = new ArrayList<Dept>();
Dept dept = null;
String selectAll = "select * from dept";
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int deptno = rs.getInt("deptno");
String dname = rs.getString("dname");
String loc = rs.getString("loc");
dept = new Dept(deptno,dname,loc);
deptAll.add(dept);
}
}catch(Exception e){
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return deptAll;
}
@Override
public List<Map<String, Object>> selectEmployees() throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public void update(Dept deparment) throws Exception {
// TODO Auto-generated method stub
}
}
```
SwitchTest.java
``` /*
switch 문
- 형식
switch(변수){
case 값_1:
stmt1;
break;
case 값_2:
stmt2;
break;
case 값_n:
stmt3;
break;
default:
stmt4;
}
switch(변수) 변수값은 byte,short,int char
값이올수있다.(long 은안됨)
*/
public class SwitchTest {
public static void main(String[] args) {
/*
* level은 1~5 사이의 점수
*/
int level =10 ;
String msg="";
switch (level) {
case 1:
msg = "열실히 하세요";
break;
case 2:
msg = "좀 하시네요";
break;
case 3:
case 4:
case 5:
msg = "잘하시네요";
break;
default:
msg = "레벨은 1~5 사이의 정수입니다.";
break;
}
System.out.println(msg);
}
}
```
ExcaptionThrowMechanismMain.java
```
public class ExcaptionThrowMechanismMain {
public static void main(String[] args) throws Exception{
System.out.println("main ½ÇÇà");
First f=new First();
f.first();
System.out.println("main ¹Ýȯ");
}
}
```
AccountConstructorMain.java
```
public class AccountConstructorMain {
public static void main(String[] args) {
Account acc1 = new Account ("1111", "KIM" , 56000, 3.4f);
Account acc2 = new Account ("1211", "LEE" , 67000, 2.4f);
Account acc3 = new Account ("1131", "PARK" , 46000, 1.3f);
Account acc4 = new Account ("1114", "CHOI" , 100000, 3.6f);
Account acc5 = new Account ("5111", "SIM" , 90000, 7.8f);
acc1.ipGum(1000);
acc2.ipGum(1000);
acc3.ipGum(1000);
acc4.ipGum(1000);
acc5.ipGum(1000);
acc1.headerPrint();
acc1.print();
acc2.print();
acc3.print();
acc4.print();
acc5.print();
}
}
```
SuperClass.java
```/*
제한자(final)
1. 클래스앞에 붙일경우
상속금지
ex> public final class Test{}
2. 멤버메쏘드앞에 붙일경우
오버라이딩 금지
ex> public final void print(){}
3. 멤버변수 앞에붙일경우--> 상수
ex> public final int PORT_NUMBER=80;
상수화된다.
변경금지
*/
public class SuperClass {
public static final int PORT_NUMBER = 80;
public void method1(){
System.out.println("난 일반 method1()");
System.out.println(SuperClass.PORT_NUMBER);
}
public final void method2(){
System.out.println("난 final메쏘드 재정의하지마세요");
}
}
```
DayTimeServer.java
```package server;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.net.ServerSocket;
import java.net.Socket;
import java.util.Date;
public class DayTimeServer {
public static void main(String[] args) throws Exception{
ServerSocket serverSocket=
new ServerSocket(8000);
while(true){
System.out.println("1.클라이언트의 소켓연결요청을 대기(8000)");
Socket socket=serverSocket.accept();
System.out.println("2.클라이언트의 소켓생성:"+socket);
PrintWriter pw=
new PrintWriter(
new OutputStreamWriter(
socket.getOutputStream()));
String time= new Date().toLocaleString();
pw.println("Server Time:"+time);
pw.flush();
System.out.println("3.클라이언트에 시간전송:"+time);
pw.close();
socket.close();
System.out.println("4.클라이언트와연결된 소켓닫기");
}
}
}
```
Child.java
```
public class Child extends Parent{
/*
public String member;
public void method1(){
System.out.println("Parent.method1()");
}
*/
public String member2;
public void method2(){
System.out.println("Child.method2()"+this.member2);
}
public void print(){
System.out.println("member1 : " + this.member1);
System.out.println("member2 : " + this.member2);
}
}
```
DeptDaoMain.java
```package jdbc.dept;
import java.util.List;
import java.util.Map;
public class DeptDaoMain {
public static void main(String[] args) throws Exception{
DeptDao deptDao=new DeptDaoImpl();
/*Dept newDept=new Dept(80, "»ý»ê", "ºÎ»ê");
System.out.println("1.dept insert-----------------");
deptDao.insert(newDept);
*/
System.out.println("2.dept list-------------------");
List<Dept> deptList=deptDao.selectByAll();
for (Dept dept : deptList) {
System.out.println(dept);
}
System.out.println("3.dept-------------------------");
Dept dept=deptDao.selectByNo(80);
System.out.println(dept);
System.out.println("4.emp,dept----------------------");
}
}
```
ChatFrame.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.FlowLayout;
import java.awt.Font;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.Panel;
import java.awt.TextArea;
import java.awt.TextField;
public class ChatFrame extends Frame {
Label chatL;
TextArea chatTA;
Panel chatP;
TextField chatTF;
Button chatB;
public ChatFrame(){
setTitle("ㅋㅋ 채팅");
setFont(new Font(Font.DIALOG,Font.BOLD, 18));
chatL = new Label("ㅋㅋ 채팅",Label.CENTER);
chatL.setBackground(Color.GREEN);
chatL.setForeground(Color.PINK);
chatTA = new TextArea();
chatTA.setEnabled(false);
chatTA.setText("경호:이따만나요~~~");
chatP = new Panel();
chatTF = new TextField(28);
chatB = new Button("전송");
chatP.setLayout(new FlowLayout());
chatP.add(chatTF);
chatP.add(chatB);
setLayout(new BorderLayout());
add(chatL,BorderLayout.NORTH);
add(chatTA,BorderLayout.CENTER);
add(chatP,BorderLayout.SOUTH);
setSize(300, 400);
setVisible(true);
}
public static void main(String[] args) {
new ChatFrame();
}
}
```
ResultSetMain.java
```package jdbc.resultset;
import java.sql.Connection;
import java.sql.Date;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import jdbc.member.ConnectionFactory;
/*
* 이름 널 유형
---------- -------- -------------
ID NOT NULL NUMBER(7)
NAME VARCHAR2(50)
SHORT_DESC VARCHAR2(255)
PRICE NUMBER(10,3)
IPGO_DATE DATE
*/
public class ResultSetMain {
public static void main(String[] args) throws Exception{
Connection con = ConnectionFactory.getConnection();
PreparedStatement pstmt = con.prepareStatement("select * from s_product");
ResultSet rs = pstmt.executeQuery();
while (rs.next()) {
int id =rs.getInt("id");
String name = rs.getString("name");
String desc = rs.getString("short_desc");
double price = rs.getDouble("price");
Date date = rs.getDate("ipgo_date");
System.out.println(id+"\t\t"+name+" \t\t "+desc+"\t\t "+price+" \t "+date);
}
rs.close();
pstmt.close();
ConnectionFactory.releaseConnection(con);
}
}
```
CarEncapsulation.java
```
public class CarEncapsulation {
public static void main(String[] args) {
Car car1 = new Car();
//ÀÔÂ÷
car1.setNo("1222");
car1.setInTime(12);
//ÃâÂ÷
car1.setOutTime(19);
car1.calculateFee();
car1.print();
}
}
```
CarMethodMain.java
```
public class CarMethodMain {
public static void main(String[] args) {
//입차
Car c1 = new Car();
c1.no="1234";
c1.inTime=12;
Car c2 = new Car();
c2.no="4567";
c2.inTime=13;
//3시간후
//출차
c1.outTime = 15;
c1.calculaterFee();
c1.print();
c2.outTime = 19;
c2.calculaterFee();
c2.print();
}
}
```
WhileTest.java
```/*
반복문
stmt1;
while(조건문){
//조건문--> 논리형데이타를 반환하는 식
stmt2;
}
stmt3;
흐름 stmt1 -->조건식의 데이타가 true인동안실행--> stmt3
*/
public class WhileTest {
public static void main(String[] args) {
System.out.println("stmt0");
/*
while(true){
System.out.println("stmt1");
}
*/
System.out.println("1----------------------------");
int i=0;
boolean isAlive = true;
while (isAlive){
System.out.println("i = " + i);
i++;
if( i == 10 ){
isAlive = false;
}
System.out.println("i출력후실행코드");
}
System.out.println("2----------------------------");
i=0;
while(true){
System.out.println("i=" + i);
i++;
if(i==10){
break;
}
System.out.println("i출력후실행코드");
}
System.out.println("3----------------------------");
i=0;
while(i<10){
System.out.println("i=" +i);
i++;
}
System.out.println("stmt99");
}
}
```
NoGeneric.java
```package com.itwill.collection;
public class NoGeneric {
private Object element;
public Object getElement() {
return element;
}
public void setElement(Object element) {
this.element = element;
}
}
```
EmpDao.java
```package jdbc.emp;
import java.util.List;
import java.util.Map;
public interface EmpDao {
public int insert(Emp insertEmp) throws Exception;
public int delete(int empno) throws Exception;
public int update(Emp updateEmp) throws Exception;
public Emp findByNo (int empno) throws Exception;
public List<Emp> findByName (String ename) throws Exception;
public List<Emp> findBySal (int sal) throws Exception;
public List<Emp> findByJob (String job) throws Exception;
public List<Emp> findByHireDate (String hireDate) throws Exception;
public List<Emp> findByMgr (int mgr) throws Exception;
public List<Emp> findByComm (int comm) throws Exception;
public List<Emp> findByDept (int deptNo) throws Exception;
public List<Emp> findByAllEmp () throws Exception;
/*
* 부서이름과 위치를 포함하는 모든 사원데이타반환
*/
public List<Map<String, Object>> findAllEmpDept() throws Exception;
/*
* 부서이름과 위치를 포함하는 모든 사원1명데이타반환
*/
public Map<String, Object> findByNoEmpDept(int empno) throws Exception;
}
```
PrimitiveArrayMain.java
```/*
배열:
- 같은데이타형을 가진 변수(기억장소)여러개의 모음타입
- 배열변수의 선언형식
데이타타입[] 이름;
- 사용:
1.배열객체의생성
2.배열객체의 초기화
-특징
1.모든 배열형의 변수는 참조변수이다.
(배열은 객체다.)
2.같은타입만 정의가가능하다
3.길이가 고정되어있다.
*/
public class PrimitiveArrayMain {
public static void main(String[] args) {
int i =400;
//기본형 1차원 배열의
System.out.println("1. ---------------기본형 1차원 배열의*****");
int[] iArray = new int[5];
for (int j = 0 ; j < iArray.length; j++){
System.out.println(iArray[j] + ",");
}
System.out.println("3. 정수 대입후 출력");
iArray[0] = 1;
iArray[1] = 2;
iArray[2] = 3;
iArray[3] = 4;
iArray[4] = 5;
for (int k = 0; k < iArray.length; k++) {
}
System.out.println("iArray [0]" + iArray[0]);
System.out.println("iArray [1]" + iArray[1]);
System.out.println("iArray [2]" + iArray[2]);
System.out.println("iArray [3]" + iArray[3]);
System.out.println("iArray [4]" + iArray[4]);
System.out.println("4. 배열의 size :" + iArray.length);
for (int j = 0 ; j < iArray.length; j++){
System.out.println("iArray [" + j + "] =" + iArray [j]);
}
System.out.println("배열의생성과 초기화");
int[] iArray1 = {1,2,3,4,5,6,7,8,9,10};
for (int j = 0; j < iArray1.length; j++) {
System.out.println(iArray1[j]+ ",");
}
System.out.println();
char[] ca={'자','바','반','회','식','언','제','해','요'};
for (int j = 0; j < ca.length; j++) {
System.out.print(ca[j]);
}
System.out.println();
boolean[] ba={true,false,true,true,false,true};
int correctAnswer=0;
int inCorrectAnswer=0;
for (int j = 0; j < ba.length; j++) {
if (ba[j]==true) {
correctAnswer+=1;
}else{
inCorrectAnswer+=1;
}
}
System.out.println("정답수" + correctAnswer);
System.out.println("오답수" + inCorrectAnswer);
System.out.println("문항수" + ba.length);
/*
* Quiz 석차계산
*/
/*
System.out.println();
int[] avgArray={34,22,45,78,99,44,34,89,88,90};
int[] rankingArray = new int [10];
for (int j = 0; j< avgArray.length; j++){
int ranking = 1;
for(int k = 0; k < avgArray.length; k++){
if(avgArray[j] < avgArray[k]){
ranking+=1;
}
}
rankingArray[j] = ranking;
System.out.println(avgArray[j] + "-" + rankingArray[j]);
//System.out.println(rankingArray[j] + "-" + avgArray[j]);
}
*/
/*
* Quiz : 정렬(Sorting)
*/
int[] totArray={34,22,45,78,99,44,34,89,88,90};
int temp = 0;
for (int j = 0; j < totArray.length-1; j++) {
for (int k = 0; k < totArray.length-1-i; k++) {
if(totArray[j]>totArray[k+1]){
temp = totArray[j];
totArray[j] = totArray[k+1];
totArray[k+1] = temp;
}
}
}
for (int j = 0; j < totArray.length; j++) {
System.out.println(totArray[i] + ",");
}
}
}
```
Calculator.java
```package event;
/*
* 계산기능을 제공하는 클래스
*/
public class Calculator {
//외부에서 입력되는 인자두개를 받아서 더한후에 그결과를
//호출한 클래스(객체)에게 반환하는 기능정의
private Calculator() {
/*
* private 생성자:외부(클래스,객체)에서의 생성을 금지
*/
}
public static int add(int a,int b){
return a+b;
}
public static int sub(int a,int b){
return a-b;
}
public static int mul(int a,int b){
return a*b;
}
public static int div(int a,int b){
return a/b;
}
}
```
SalaryEmployee.java
```
public class SalaryEmployee extends Employee{
private int annualSalary;//¿¬ºÀ
public SalaryEmployee() {
}
public SalaryEmployee(int no , String name, int annualSalary) {
super(no, name);
this.annualSalary = annualSalary;
}
/*
* ÀçÁ¤ÀÇ
*/
public void calculatePay(){
int tempPay = annualSalary/12;
this.setPay(tempPay);
}
public int getAnnualSalary() {
return annualSalary;
}
public void setAnnualSalary(int annualSalary) {
this.annualSalary = annualSalary;
}
}
```
Gangsa.java
```
public class Gangsa extends Person{
public String subject;//°ú¸ñ
public Gangsa() {
// TODO Auto-generated constructor stub
}
public Gangsa(int no, String name, String subject) {
this.no=no;
this.name=name;
this.subject = subject;
}
public String getSubject() {
return subject;
}
public void setSubject(String subject) {
this.subject = subject;
}
public void gangsaPrint(){
System.out.println(no + "\t" + name + "\t" + subject);
}
}
```
MemberDaoMain.java
```package jdbc.member;
import java.util.ArrayList;
import java.util.Iterator;
public class MemberDaoMain {
public static void main(String[] args) throws Exception{
MemberDao memberDao = new MemberRdbDaoImpl();
MemberDto insertMmber = new MemberDto(10,"newm","장동건","010-5484-4731","서울");
System.out.println("1.------insert-----------");
int insertRow = memberDao.insert(insertMmber);
System.out.println("추가 : "+insertRow+"행이추가");
System.out.println("2.-------selectByNo-----");
MemberDto selectMember = memberDao.selectByNo(5);
if(selectMember==null){
System.out.println("그런멤버없다");
}else{
MemberDto.headerPrint();
System.out.println(selectMember.toString());
}
System.out.println("3.------delete---------");
int deleteRows = memberDao.delete(10);
System.out.println("3.delete : "+deleteRows+"행이삭제");
System.out.println("4.------update---------");
MemberDto updateMember = new MemberDto();
int updateRows = memberDao.update(updateMember);
System.out.println("4.delete : "+updateRows+"행이삭제");
System.out.println("5.------selectAll-------");
ArrayList<MemberDto> memberList = memberDao.selectAll();
MemberDto.headerPrint();
for (MemberDto memberDto : memberList) {
System.out.println(memberDto);
}
}
}
```
AbstractClassChild.java
```
public class AbstractClassChild extends AbstractClass{
@Override
public void method2(){
System.out.println("AbstractClass.method2ÀÇ ");
}
}
```
WhileNexted.java
```public class WhileNexted {
public static void main(String[] args) {
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
int i = 0;
while (i < 5) {
int j = 0;
while (j < 5) {
System.out.print("¡Ú["+i+","+j+"]");
j++;
}// inner while
System.out.println("");
i++;
} // outer while.
/*
¡Ù¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ù¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ù¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ù¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ù
*/
System.out.println("¡Û---------------------");
i = 0;
while (i < 5) {
int j = 0;
while (j < 5) {
if(i!=j){
System.out.print("¡Ú");
}else{
System.out.print("¡Ù");
}
j++;
}// inner while
System.out.println("");
i++;
} // outer while.
System.out.println("¡Û---------------------");
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú
¡Ú
*/
i = 5;
while (i > 0) {
int j = 0;
while (j < 5) {
if(i>j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
j++;
}// inner while
System.out.println("");
i--;
} // outer while.
System.out.println("¡Û---------------------");
/*
¡Ù¡Ù¡Ù¡Ù¡Ú
¡Ù¡Ù¡Ù¡Ú¡Ú
¡Ù¡Ù¡Ú¡Ú¡Ú
¡Ù¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
i = 4;
while (i >= 0) {
int j = 0;
while (j < 5) {
if(i<=j){
System.out.print("¡Ú");
}else{
System.out.print("¡Ù");
}
j++;
}// inner while
System.out.println("");
i--;
} // outer while.
/*
¡Ú
¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
System.out.println("¡Û---------------------");
i = 0;
while (i < 5) {
int j = 0;
while (j < 5) {
if(i>=j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
j++;
}// inner while
System.out.println("");
i++;
} // outer while.
System.out.println("¡Û---------------------");
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú
¡Ú
*/
i = 0;
while (i < 5) {
int j = 0;
while (j < 5) {
if(i==j || i<j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
j++;
}// inner while
System.out.println("");
i++;
} // outer while.
}
}
```
PrintMain.java
```
public class PrintMain {
public static void main(String[] args) {
Print p=new Print();
p.print('±è');
p.print("±è°áÈ£");
p.print(67);
p.print(2.3214);
p.print(true);
}
}
```
Encapsulation.java
```
/* OOP 의 방법
* 1. 캡슐화
* 2. 상속성
* 3. 다형성(오버로딩,오바라이딩,객체형변환)
*/
/*
* 1. 캡슐화
* - 외부클래스(객체)에서 멤버변수에 접근을 막고
* 멤버 메쏘드에만 접근할수있도록 클래스를 설계하는방법
* - 구현 : 멤버변수 의 접근제한자를 private
* 멤버메쏘드의 접근제한자는 public 으로한다.
* public ==> 어떤 외부클래스에서든지 접근가능
* private==> 어떤 외부클래스에서든지 접근불가능
*/
public class Encapsulation {
private int member1;
private String member2;
private char member3;
//setter
public void setMember1(int member1){
this.member1 = member1;
}
public void setMember2(String member2) {
this.member2 = member2;
}
public void setMember3(char member3) {
this.member3 = member3;
}
//getter
public int getMember1(){
return this.member1;
}
public String getMember2() {
return this.member2;
}
public char getMember3() {
return this.member3;
}
}
```
WebServer.java
```package web;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.net.ServerSocket;
import java.net.Socket;
public class WebServer {
public static void main(String[] args)throws Exception {
ServerSocket serverSocket=new ServerSocket(80);
while(true){
System.out.println("1. 클라이언트연결요청처리위해 대기(80)");
Socket socket=serverSocket.accept();
System.out.println("2. 접속 클라이언트:"+socket);
System.out.println("3. 클라이언트요청 분석(html,image)");
OutputStream out=socket.getOutputStream();
System.out.println("4. 클라이언트요청데이타(html,image)를 전송");
/**************html**************
PrintWriter pw=
new PrintWriter(
new OutputStreamWriter(out));
//server local file(index.html) loading
FileInputStream fis=new FileInputStream("index.html");
InputStreamReader isr=new InputStreamReader(fis);
BufferedReader br=new BufferedReader(isr);
while (true) {
String readLine=br.readLine();
if(readLine==null)break;
pw.println(readLine);
}
pw.flush();
************image**************/
FileInputStream fis=new FileInputStream("female.gif");
while (true) {
int readByte=fis.read();
if(readByte==-1)break;
out.write(readByte);
}
out.flush();
socket.close();
}//end while
}//end main
}//enc class
```
PreparedStatementMain.java
```package jdbc.statement;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.Statement;
import jdbc.member.ConnectionFactory;
public class PreparedStatementMain {
public static void main(String[] args) throws Exception {
Connection con=ConnectionFactory.getConnection();
/*
* 1.PreparedStatement 생성시 query 작성방법
* A. SQL 작성시에 ?(파라메타) 를 사용해서 나중에 외부에서 데이타를 셋팅 시킬수있게할수있다.
* B. ?(파라메타) 는 데이타이외에 테이블이름,컬럼이름,키워드등은 사용할수없다.
* ex> select * from ? (X)
* select empno,?,? from emp (X)
* C. query문의 기술순서대로 번호를 부여한다.
* ex> select * from emp where ename=? and empno=? and deptno=?
*/
String selectSql="select count(*) as cnt from emp where empno>=? and empno<=?";
//Statement stmt = con.createStatement();
/*
* 2. PreparedStatement 생성시 sql문을 인자로 넣어서 생성한다.
*/
PreparedStatement pstmt = con.prepareStatement(selectSql);
/*
* 3. 생성된 PreparedStatement에 파라메타를 바인딩시킨다.
*/
pstmt.setInt(1, 7000);
pstmt.setInt(2, 7500);
/*
* 4. query 문을 실행(sql)
*/
ResultSet rs1 = pstmt.executeQuery();
rs1.next();
int empCount = rs1.getInt("cnt");
System.out.println("1. empCount(7000~7500) : " + empCount);
pstmt.clearParameters();
pstmt.setInt(1, 7501);
pstmt.setInt(2, 7700);
ResultSet rs2=pstmt.executeQuery();
rs2.next();
empCount = rs2.getInt(1);
System.out.println("2. empCount(7501~7700)");
String selectSql2 = "select * from emp where empno>? and empno<=?";
PreparedStatement pstmt2 = con.prepareStatement(selectSql2);
System.out.println("-------------------------------------------");
System.out.println("EMP검색 APPLICATION");
System.out.println("-------------------------------------------");
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while (true){
System.out.println(">>>EMP의 검색시작번호입력");
String strNumber1 = br.readLine();
System.out.println(">>>EMP의 검색 끝번호입력");
String strNumber2 = br.readLine();
int no1 = Integer.parseInt(strNumber1);
int no2 = Integer.parseInt(strNumber2);
pstmt2.setInt(1, no1);
pstmt2.setInt(2, no2);
ResultSet rs3 = pstmt2.executeQuery();
System.out.println("------------------------------");
System.out.println("번호 \t 이름 \t 직무");
System.out.println("------------------------------");
while (rs3.next()) {
int no = rs3.getInt("empno");
String ename = rs3.getString("ename");
String job = rs3.getString("job");
System.out.println(no+"\t"+ename+"\t"+job);
}
pstmt2.clearParameters();
}
}
}
```
MemberMethodMain.java
```
public class MemberMethodMain {
public static void main(String[] args) {
MemberMethod mm = new MemberMethod(); //
/*
정의 public void method1(){
*/
/*
호출(실행)
*/
mm.method1();
/*
정의 public String method2(String str){
*/
/*
* 호출(실행)
*/
String msg = mm.method2("KIM");
System.out.println(msg);
/*
정의 : public int method3(int a,int b){
*/
int r = mm.method3(23, 45);
System.out.println(r);
}
}
```
ExceptionThrowMechanismMain.java
```
public class ExceptionThrowMechanismMain {
public static void main(String[] args) throws Exception {
System.out.println("main ½ÇÇà");
First f = new First();
f.first();
System.out.println("main ¹Ýȯ");
}
}
```
ForNexted.java
```
public class ForNexted {
public static void main(String[] args) {
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
for (int i = 0 ; i < 5 ; i++){
for (int j = 0; j < 5 ; j++){
System.out.print('¡Ú');
}
System.out.println();
}
System.out.println("1.--");
/*
¡Ù¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ù¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ù¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ù¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ù
*/
for (int i = 0 ; i < 5 ; i++){
for (int j = 0; j < 5 ; j++){
if(i == j){
System.out.print('¡Ù');
}else{
System.out.print('¡Ú');
}
}
System.out.println();
}
System.out.println("2.--");
/*
¡Ú
¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
for (int i = 0 ; i < 5 ; i++){
for (int j = 0; j < 5 ; j++){
if(i >= j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
}
System.out.println();
}
System.out.println("3.--");
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú
¡Ú
*/
for (int i = 0 ; i < 5 ; i++){
for (int j = 5; j > 0 ; j--){
if(i < j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
}
System.out.println();
}
System.out.println("4.--");
/*
¡Ù¡Ù¡Ù¡Ù¡Ú
¡Ù¡Ù¡Ù¡Ú¡Ú
¡Ù¡Ù¡Ú¡Ú¡Ú
¡Ù¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú¡Ú
*/
for (int i = 0 ; i < 5 ; i++){
for (int j = 4; j >= 0 ; j--){
if(i < j){
System.out.print("¡Ú");
}else{
System.out.print("¡Ù");
}
}
System.out.println();
}
/*
¡Ú¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú¡Ú
¡Ú¡Ú¡Ú
¡Ú¡Ú
¡Ú
*/
System.out.println("5.--");
for (int i = 0 ; i < 5 ; i++){
for (int j = 0; j < 5 ; j++){
if(i <= j){
System.out.print("¡Ú");
}else{
System.out.print(" ");
}
}
System.out.println();
}
}
}
```
PortScannerMain.java
```package client;
import java.io.IOException;
import java.net.Socket;
import java.net.UnknownHostException;
public class PortScannerMain {
public static void main(String[] args) {
for (int i = 79; i < 100; i++) {
try {
Socket socket=new Socket("www.google.com",i);
System.out.println(i+" 번 포트로 소켓연결성공");
} catch (Exception e){
System.out.println(i+" 번 포트로 소켓연결실패<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<");
}
}
}
}
```
EchoServer.java
```package server;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.net.ServerSocket;
import java.net.Socket;
public class EchoServer {
public static void main(String[] args) throws Exception {
ServerSocket serverSocket=new ServerSocket(9999);
while (true) {
System.out.println("---------------------------");
System.out.println(
"1.클라이언트의 소켓연결요청을 대기(9999)");
Socket socket=serverSocket.accept();
System.out.println("2.클라이언트 소켓생성:"+socket);
BufferedReader br=
new BufferedReader(
new InputStreamReader(
socket.getInputStream()));
PrintWriter pw=
new PrintWriter(
new OutputStreamWriter(
socket.getOutputStream()));
String readLine=br.readLine();
System.out.println("2.클라이언트 소켓으로부터 데이타읽기:"+readLine);
pw.println("Server send:"+readLine);
pw.flush();
System.out.println("3.클라이언트 소켓에 데이타쓰기:Server send:"+readLine);
br.close();
pw.close();
socket.close();
System.out.println("4.클라이언트 소켓 닫기");
System.out.println("---------------------------");
}
}
}
```
ParentChildMain.java
```
public class ParentChildMain {
public static void main(String[] args) {
Child c = new Child();
c.member1 = "¸â¹ö1";
c.member2 = "¸â¹ö2";
c.method1();
c.method2();
c.print();
}
}
```
WindowEventFrame.java
```package event;
import java.awt.Frame;
import java.awt.event.WindowEvent;
import java.awt.event.WindowListener;
public class WindowEventFrame extends Frame{
public WindowEventFrame() {
setTitle("윈도우이벤트");
//event
this.addWindowListener(new WindowsEventHandler());
setSize(300, 400);
setVisible(true);
}
public class WindowsEventHandler implements WindowListener{
@Override
public void windowOpened(WindowEvent e) {
System.out.println("windowOpened");
}
@Override
public void windowClosing(WindowEvent e) {
System.out.println("windowClosing");
}
@Override
public void windowClosed(WindowEvent e) {
System.out.println("windowClosed");
/*
* Terminates the currently running Java Virtual Machine.
* The argument serves as a status code; by convention,
* a nonzero status code indicates abnormal termination.
This method calls the exit method in class Runtime. This method never returns normally.
*/
System.exit(0);
}
@Override
public void windowIconified(WindowEvent e) {
System.out.println("windowIconified");
}
@Override
public void windowDeiconified(WindowEvent e) {
System.out.println("windowDeiconified");
}
@Override
public void windowActivated(WindowEvent e) {
System.out.println("windowActivated");
}
@Override
public void windowDeactivated(WindowEvent e) {
System.out.println("windowDeactivated");
}
}
public static void main(String[] args) {
new WindowEventFrame();
}
}
```
GajunFactoryMain.java
```
public class GajunFactoryMain {
public static void main(String[] args) {
TV tv1 = new TV();
TV tv2 = new TV();
Radio r1=new Radio();
Radio r2=new Radio();
Radio r3=new Radio();
MP3 mp1=new MP3();
MP3 mp2=new MP3();
OnOff[] gajuns = new OnOff[7];
gajuns[0]=tv1;
gajuns[1]=tv2;
gajuns[2]=r1;
gajuns[3]=r2;
gajuns[4]=r3;
gajuns[5]=mp1;
gajuns[6]=mp2;
GajunGumsa gg = new GajunGumsa();
gg.setGajuns(gajuns);
gg.gumsa();
}
}
```
MathClass.java
```package com.itwill.lang;
public class MathClass {
public static void main(String[] args) {
/*
* java.lang.Math
*/
int max = Math.max(12, 15);
System.out.println(max);
double round = Math.round(25.859*100)/100;
System.out.println(round);
int abs = Math.abs(-8951);
System.out.println(abs);
/*
* Returns the largest (closest to positive infinity) double value that is less than or equal to
* the argument and is equal to a mathematical integer. Special cases:
*/
double floor = Math.floor(12.568);
System.out.println(floor);
double ceil = Math.ceil(12.568);
System.out.println(ceil);
double d = Math.random();
System.out.println(d);
d = Math.random();
System.out.println(d);
d = Math.random();
System.out.println(d);
System.out.println("------------1~10 정수--------------");
int rNumber = (int)(Math.random()*10)+1;
System.out.println(rNumber);
rNumber = (int)(Math.random()*10)+1;
System.out.println(rNumber);
rNumber = (int)(Math.random()*10)+1;
System.out.println(rNumber);
rNumber = (int)(Math.random()*10)+1;
System.out.println(rNumber);
rNumber = (int)(Math.random()*10)+1;
System.out.println(rNumber);
/*
* 1 ~ 45
*/
System.out.println("------------1~45 정수--------------");
int lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
lottoNumber = (int)(Math.random()*45)+1;
System.out.println(lottoNumber);
System.out.println("------------1~45 정수*(for)--------------");
for (int i = 0; i < 6; i++) {
lottoNumber = (int)(Math.random()*45)+1;
System.out.print(lottoNumber + "\t");
}
}
}
```
ChatServerClientHandlerManager.java
```package chat.server;
import java.util.ArrayList;
/*
* 클라이언트 객체들의
* 추가,
* 삭제,
* 찾기,
* 모든클라이언트에데이타전송(브로드캐스팅)
* 등 모든클라이어트객체에 관련된일
*
*
*/
public class ChatServerClientHandlerManager {
/*
* 접속클라이언트객체들
*/
ArrayList<ChatServerClientHandler> clientList=
new ArrayList<ChatServerClientHandler>();
/*
* 클라이언트추가
*/
public void addClientHandler(ChatServerClientHandler newClientHandler)throws Exception{
clientList.add(newClientHandler);
sendBroadcating(">>>>>>"+newClientHandler.id+" 님 입장");
System.out.println(">>>>>>>>>"+newClientHandler.id+" 님 입장");
printClientHandlerCount();
}
private void printClientHandlerCount(){
System.out.println("ChatServerClientHandlerManager:현재접속자수:"
+clientList.size()+"명");
}
/*
*클라이언트 삭제
*/
public void removeClient(ChatServerClientHandler removeClientHandler)throws Exception{
clientList.remove(removeClientHandler);
sendBroadcating("<<<<<<<<<< "+removeClientHandler.id+" 님 퇴장");
System.out.println("<<<<<<<<<< "+removeClientHandler.id+" 님 퇴장");
printClientHandlerCount();
}
/*
* 연결된 모든클라이언트에 데이타전송
*/
public void sendBroadcating(String readData) throws Exception{
for (ChatServerClientHandler chatServerClientHandler
: clientList) {
chatServerClientHandler.send(readData);
}
}
}
```
ExtendsFrame.java
```package basic;
import java.awt.Color;
import java.awt.Dimension;
import java.awt.Frame;
public class ExtendsFrame extends Frame{
public ExtendsFrame(){
super("나의 프레임[상속]");
this.setTitle("나의프레임[상속]2");
this.setBackground(new Color(0x0000aa));
this.setSize(300,400);
this.setVisible(true);
}
}
```
ConsoleBufferedReaderMain.java
```package char_stream.filter_stream;
import java.io.BufferedReader;
import java.io.FileDescriptor;
import java.io.FileReader;
public class ConsoleBufferedReaderMain {
public static void main(String[] args) throws Exception{
//String koStr,engStr,mathStr;
String koStr = "";
String engStr = "";
String mathStr ="";
FileReader fr = new FileReader(FileDescriptor.in);
BufferedReader br =new BufferedReader(fr);
//System.out.println("readLIne : " +readLine);
while (true) {
System.out.println("국어점수입력");
koStr = br.readLine();
System.out.println("영어점수입력");
engStr = br.readLine();
System.out.println("수학점수입력");
mathStr = br.readLine();
int kor = Integer.parseInt(koStr);
int eng = Integer.parseInt(engStr);
int math = Integer.parseInt(mathStr);
int tot = kor+eng+math;
double avg = tot/3.0;
System.out.println(br.readLine());
System.out.println("-------------------");
System.out.println("국어 : " + koStr);
System.out.println("영어 : " + engStr);
System.out.println("수학 : " + mathStr);
System.out.println("총점 : " + tot);
System.out.println("평균 : " + avg);
System.out.println("--------------------");
System.out.println("계속할래요 y/n");
String yn=br.readLine();
if(!yn.equalsIgnoreCase("y")){
System.out.println("프로그램을 종료합니다.");
break;
}
}
br.close();
}
}
```
ArithmaticOperator.java
```/*
산술연산자
- 형태: +,-,*,/,%, <<
*/
public class ArithmaticOperator {
public static void main(String[] args) {
int a = 1;
int b = 2;
int result = a + b;
System.out.println("1+2= "+result);
result = a - b;
System.out.println("1-2= "+result);
result = a * b;
System.out.println("1*2= "+result);
result = a / b;
System.out.println("1/2= "+result);
double dresult = (double)a/b;
System.out.println("double" + dresult);
int year = 2014;
result = year % 4;
System.out.println("2014%4= "+result);
int c = 1;
result = c << 2;
System.out.println("1<<2 = "+result);
}
}
```
CardLayoutFrame.java
```package card.layout;
import java.awt.*;
import java.awt.event.*;
import java.awt.image.ImageObserver;
import javax.swing.JOptionPane;
import javax.swing.JTable;
import javax.swing.table.DefaultTableModel;
public class CardLayoutFrame extends Frame implements ActionListener {
LoginPanel loginP ;
ListPanel listP;
InsertPanel insertP;
private Panel cardPane;
private CardLayout cardLayout;
Panel buttonPane;
Button b1;
Button b2;
Button loginUIB;
Button insertUIB;
Button listUIB;
Button dialogB;
Button dialogsB;
Image image=Toolkit.getDefaultToolkit().getImage("koreanfood.png");
public CardLayoutFrame(String title) {
super(title);
cardLayout = new CardLayout();
cardPane = new Panel();
loginP = new LoginPanel();
listP = new ListPanel();
insertP = new InsertPanel();
buttonPane = new Panel();
b1 = new Button("이전");
b2 = new Button("다음");
loginUIB = new Button("로그인"){
@Override
public void paint(Graphics g) {
g.drawImage(image, 0,0,CardLayoutFrame.this);
}
};
insertUIB = new Button("가입");
listUIB = new Button("리스트");
dialogB=new Button("dialog");
dialogsB=new Button("dialogs");
cardPane.setLayout(cardLayout);
cardPane.add("login", loginP);
cardPane.add("list", listP);
cardPane.add("insert", insertP);
buttonPane.add(b1);
buttonPane.add(b2);
buttonPane.add(loginUIB);
buttonPane.add(insertUIB);
buttonPane.add(listUIB);
buttonPane.add(dialogB);
buttonPane.add(dialogsB);
this.add(cardPane, BorderLayout.CENTER);
this.add(buttonPane, "South");
b1.addActionListener(this);
b2.addActionListener(this);
loginUIB.addActionListener(this);
listUIB.addActionListener(this);
insertUIB.addActionListener(this);
dialogB.addActionListener(this);
dialogsB.addActionListener(this);
this.addWindowListener(new WindowAdapter() {
public void windowClosing(WindowEvent e) {
System.exit(0);
}
});
this.setSize(400, 400);
this.setVisible(true);
this.setSize(300, 410);
this.setLocation(300, 300);
Thread t=new Thread(){
public void run() {
try {
Thread.sleep(100);
loginUIB.repaint();
} catch (InterruptedException e1) {
// TODO Auto-generated catch block
e1.printStackTrace();
}
};
};
t.start();
}
public void actionPerformed(ActionEvent arg0) {
String cmd = arg0.getActionCommand();
if (cmd.equals("이전")) {
cardLayout.previous(cardPane);
} else if(cmd.equals("다음")) {
cardLayout.next(cardPane);
} else if(cmd.equals("로그인")){
cardLayout.show(cardPane, "login");
}else if(cmd.equals("가입")){
cardLayout.show(cardPane, "list");
}else if(cmd.equals("리스트")){
cardLayout.show(cardPane, "insert");
}else if(cmd.equals("dialog")){
LoginDialog loginD=new LoginDialog(this, "로귄");
loginD.setModal(true);
loginD.setVisible(true);
}else if(cmd.equals("dialogs")){
int type=JOptionPane.showConfirmDialog(this, "로그인할래요!!!");
System.out.println(type);
String name=JOptionPane.showInputDialog(this, "이름을 입력");
System.out.println(name);
JOptionPane.showMessageDialog(this, "로그인실퐤", "로그인애로", JOptionPane.WARNING_MESSAGE);
type=JOptionPane.showOptionDialog(this,
"message",
"title",
JOptionPane.OK_CANCEL_OPTION,
JOptionPane.QUESTION_MESSAGE,
null,
new String[]{"오케바리","치소"},
null);
System.out.println(type);
}
}
public static void main(String args[]) {
new CardLayoutFrame("카드레이아웃");
}
}
```
BorderLayoutFrame.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Frame;
public class BorderLayoutFrame extends Frame{
Button b1,b2,b3,b4,b5;
public BorderLayoutFrame(){
b1 = new Button("CENTER");
b2 = new Button("WEST");
b3 = new Button("EAST");
b4 = new Button("SOUTH");
b5 = new Button("NORTH");
//layout manager
BorderLayout border = new BorderLayout();
this.setLayout(border);
add(b1,BorderLayout.CENTER);
add(b2,BorderLayout.WEST);
add(b3,BorderLayout.EAST);
add(b4,BorderLayout.SOUTH);
add(b5,BorderLayout.NORTH);
this.setSize(300,180);
this.setVisible(true);
}
public static void main(String[] args) {
new BorderLayoutFrame();
}
}
```
PaintFrame.java
```package paint;
/*
<<< public void paint(Graphics g) >>>
Paints this component.
This method is called when the contents of the
component should be painted;
1.such as when the component is first being shown
2.or is damaged and in need of repair.
3.The clip rectangle in the Graphics parameter
is set to the area which needs to be painted.
Subclasses of Component
that override this method need not call super.paint(g).
*/
import java.awt.Color;
import java.awt.Frame;
import java.awt.Graphics;
import java.awt.Image;
import java.awt.Toolkit;
import java.awt.event.KeyEvent;
import java.awt.event.KeyListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
public class PaintFrame extends Frame implements KeyListener {
int pX,pY;//펭귄위치
int imageIndex;
Image[] penguins=new Image[3];
public PaintFrame() {
// event
this.addWindowListener(new WindowAdapter() {
public void windowClosing(WindowEvent e) {
System.exit(0);
}
});
this.addKeyListener(this);
setSize(300, 400);
setVisible(true);
pX=110;
pY=320;
imageIndex=0;
for (int i = 0; i < penguins.length; i++) {
penguins[i]=Toolkit.getDefaultToolkit().getImage("penguin"+(i+1)+".gif");
}
}
@Override
public void paint(Graphics g) {
// super.paint(g);
// System.out.println(Thread.currentThread().getName());
// 배경이미지
Toolkit tk1 = Toolkit.getDefaultToolkit();
Image bImage = tk1.getImage("penguin_back.jpg");
g.drawImage(bImage, 0, 0, 300, 400, this);
// String
g.drawString("페인트", 20, 50);
// 색변경
g.setColor(Color.BLUE);
// rect
g.drawRect(20, 70, 50, 50);
g.fillRect(20, 130, 50, 50);
// circle
g.setColor(Color.RED);
g.drawOval(getWidth() / 2 - 25, getHeight() / 2 - 25, 50, 50);
g.fillOval(getWidth() / 2 - 20, getHeight() / 2 - 20, 40, 40);
// image
g.drawImage(penguins[imageIndex], pX, pY, this);
}
/********** KeyListener impl메쏘드 *******/
public void keyTyped(KeyEvent e) {}
public void keyPressed(KeyEvent e) {
//System.out.println("pressed");
int keyCode = e.getKeyCode();
//System.out.println("keyCode:" + keyCode);
switch (keyCode) {
case KeyEvent.VK_RIGHT:
pX=pX+5;
break;
case KeyEvent.VK_LEFT:
pX=pX-5;
break;
}
//imageIndex++;
imageIndex=++imageIndex%3;
repaint();
}
public void keyReleased(KeyEvent e) {}
/****************************************/
public static void main(String[] args) {
new PaintFrame();
}
}
```
Member.java
```
public class Member {
public int no;
public String name;
public Member(){
}
public Member(int no, String name) {
super();
this.no = no;
this.name = name;
}
}
```
IfNexted.java
```
public class IfNexted {
public static void main(String[] args) {
int jumsu = 69;
if(jumsu<0 || jumsu>100){
System.out.println(" 유효한 점수가 아닙니다. ");
return;
}
System.out.println("평점계산");
char grade =' ';
if( jumsu >= 90 ){
grade='A';
}else{
if( jumsu>=80 ){
grade='B';
}else{
if ( jumsu>=70 ){
grade='C';
}else{
if (jumsu>=60){
grade='D';
}else{
grade='F';
}
}
}
}
System.out.println("1. 당신의 평점은 " + grade + " 입니다.");
grade= ' ';
if(jumsu>=90){
grade='A';
}else if(jumsu>=80){
grade='B';
}else if(jumsu>=70){
grade='C';
}else if(jumsu>=60){
grade='D';
}else{
grade='F';
}
System.out.println("1. 당신의 평점은 " + grade + " 입니다.");
return;
}
}
```
SocketInfo.java
```package client;
import java.net.Socket;
/*
* Socket 클래스
* TCP/IP 기반의 가상의연결
* (가상의 스트림이 생성되고 데이타 송수신이 가능하다.)
*
*/
public class SocketInfo {
public static void main(String[] args) throws Exception{
Socket socket=new Socket("125.209.222.142",80);
System.out.println("remote ip:"+socket.getInetAddress());
System.out.println("remote port:"+socket.getPort());
System.out.println("local ip:"+socket.getLocalAddress());
System.out.println("local port:"+socket.getLocalPort());
}
}
```
BufferedReaderWriterMain.java
```package char_stream.filter_stream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
public class BufferedReaderWriterMain {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new FileReader("OOP.java"));
BufferedWriter bw = new BufferedWriter(new FileWriter("OOP_LINE.java"));
//라인종결자 바로전까지의 문자열을 반환
String readLine = br.readLine();
System.out.println("1. " + readLine);
readLine = br.readLine();
System.out.println("2. " + readLine);
int lineCount=0;
while (true) {
readLine = br.readLine();
if(readLine==null)break;
//console
System.out.println(readLine+"\n");
//File
bw.write(lineCount + readLine + "\n");
}
bw.flush();
bw.close();
br.close();
}
}
```
MemberMain.java
```package file.member;
import java.io.RandomAccessFile;
import java.util.ArrayList;
public class MemberMain {
public static void main(String[] args) throws Exception{
RandomAccessFile raf = new RandomAccessFile("member.dat", "rw");
System.out.println("1.---member write--");
Member member1 = new Member(1,"김경호", 30,"경기도민");
/*
* |----------------------------------------------------------|
* |번호(4byte)|이름(10byte == 5char)|나이(4byte)|주소(60byte)|
* |----------------------------------------------------------|
*/
int recored_size = 78;
//번호
raf.seek(recored_size*0);
raf.writeInt(member1.getNo());
System.out.println("1.point : " + raf.getFilePointer());
//이름
String name = member1.getName();
for (int i = 0; i < 5; i++) {
if(i < name.length()){
raf.writeChar(name.charAt(i));
}else{
raf.writeChar(' ');
}
}
System.out.println("2.point : " + raf.getFilePointer());
//나이
raf.writeInt(member1.getAge());
System.out.println("3.point : " + raf.getFilePointer());
//주소
String address = member1.getAddress();
for (int i = 0; i < 30; i++) {
if(i < address.length()){
raf.writeChar(address.charAt(i));
}else{
raf.writeChar(' ');
}
}
System.out.println("4.point : " + raf.getFilePointer());
System.out.println("-------------------------------------------");
System.out.println("1.---member write--");
Member member2 = new Member(2,"김경미", 23,"서울시민");
//번호
raf.seek(recored_size*1);
raf.writeInt(member2.getNo());
System.out.println("1.point : " + raf.getFilePointer());
//이름
String name2 = member2.getName();
for (int i = 0; i < 5; i++) {
if(i < name2.length()){
raf.writeChar(name2.charAt(i));
}else{
raf.writeChar(' ');
}
}
System.out.println("2.point : " + raf.getFilePointer());
//나이
raf.writeInt(member2.getAge());
System.out.println("3.point : " + raf.getFilePointer());
//주소
String address2 = member2.getAddress();
for (int i = 0; i < 30; i++) {
if(i < address2.length()){
raf.writeChar(address2.charAt(i));
}else{
raf.writeChar(' ');
}
}
System.out.println("4.point : " + raf.getFilePointer());
System.out.println("전체 회원수 : " + raf.length()/recored_size);
System.out.println("2.----member find(회원번호로 찾기)----");
Member readMember = new Member();
int no=2;//회원번호
for (int i = 0; i < 2; i++) {
raf.seek(recored_size*i);
int tempNo = raf.readInt();
System.out.println(tempNo);
if(tempNo==2){
raf.seek(recored_size*i);
int tno = raf.readInt();
//이름
String tname="";
for (int j = 0; j < 5; j++) {
tname = tname + raf.readChar();
}
//나이
int tage = raf.readInt();
//주소
String taddress="";
for (int j = 0; j < 30; j++) {
taddress = taddress + raf.readChar();
}
readMember.setNo(tno);
readMember.setName(tname.trim());
readMember.setAge(tage);
readMember.setAddress(taddress.trim());
break;
}
}
System.out.println(readMember);
}
}
```
IfTest.java
```/*
제어문
1. if 문
-형식 :
stmt0;
if(조건문 ){
//조건문 --> 논리형데이타가 반환되는 연산
// 혹은 논리형데이타(리터럴),변수
stmt1;
}else{
stmt2;
}
stmt3;
조건데이타가 true인경우 stmt0-->stmt1-->stmt3;
조건데이타가 false인경우 stmt0-->stmt2-->stmt3;
*/
public class IfTest {
public static void main(String[] args) {
int x = 60;
int y = 30;
System.out.println("stmt01");
if( x > y ){
System.out.println("20 > 30");
}else{
System.out.println("20 <= 30");
}
System.out.println("stmt02");
if( x!=y ){
System.out.println("20 != 30");
}
System.out.println("stmt03");
if( x==y )
System.out.println("20 == 30");
else
System.out.println("20 != 30");
System.out.println("stmt04");
if(x<=y)
System.out.println("20 <= 30");
System.out.println("stmt05");
boolean condition = true;
if(condition){
System.out.println("condition :" + condition);
}
if(true){
System.out.println("논리형상수 : " + true);
}
if(false){
System.out.println("논리형상수 : " + false);
}
}
}
```
PackageImportMain.java
```import com.itwill.shop.ShopManager;
import com.itwill.shop.member.Member;
import com.itwill.shop.member.MemberManager;
import com.itwill.shop.product.Product;
import com.itwill.shop.product.ProductDao;
import com.itwill.shop.product.ProductManager;
//alt + shift + o └┌Á┐import
public class PackageImportMain {
public static void main(String[] args) {
Member m = new Member();
MemberManager memberManager = new MemberManager();
ProductManager pm1 = new ProductManager();
com.itwill.shop.admin.ProductManager pm2 = new com.itwill.shop.admin.ProductManager();
System.out.println(m);
System.out.println(memberManager);
System.out.println(pm1);
System.out.println(pm2);
ShopManager sm = new ShopManager();
ProductDao pd = new ProductDao();
}
}
```
First.java
```
public class First {
public void first() throws Exception{
System.out.println("First.first()½ÇÇà");
Second second=new Second();
second.second();
System.out.println("First.first()¹Ýȯ");
}
}
```
CarFactoryMain.java
```
public class CarFactoryMain {
public static void main(String[] args) {
Car.count=5;
System.out.println("1." + Car.count);
Car c1 = new Car("k3", "RED", 2000);
System.out.println("2." + Car.count);
Car c2 = new Car("k5", "BLUE", 2400);
System.out.println("3." + Car.count);
Car c3 = new Car("k7", "YELLOW", 3000);
System.out.println("4." + Car.count);
Car c4 = new Car("k9", "ORANGE", 3300);
System.out.println("all." + Car.count);
System.out.println("--------------------");
System.out.println("c1.count = " + c1.count);
System.out.println("c2.count = " + c2.count);
System.out.println("c3.count = " + c3.count);
System.out.println("c4.count = " + c4.count);
}
}
```
StudentMethodMain.java
```package com.itwill.sungjuk.method;
public class StudentMethodMain {
public static void main(String[] args) {
//切积按眉积己
Student s1 = new Student();
Student s2 = new Student();
Student s3 = new Student();
//切积单捞鸥措涝
s1.setData(4445, "全辨档", 90, 80, 70);
s1.stuSum();
s1.stuAveCalc();
s1.stuGradeCalc();
s2.setData(6652, "全", 95, 92, 91);
s2.stuSum();
s2.stuAveCalc();
s2.stuGradeCalc();
s3.setData(7823, "辫", 65, 66, 60);
s3.stuSum();
s3.stuAveCalc();
s3.stuGradeCalc();
//免仿
s1.headerPrint();
s1.print();
s2.print();
s3.print();
}
}
```
ForGuGuDan.java
```
public class ForGuGuDan {
public static void main(String[] args) {
/*
2*1=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*2=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*3=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*4=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*5=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*6=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*7=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*8=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*1=2
2*9=2 3*1=2 4*1=2 5*1=2 6*1=2 7*1=2 8*1=2 9*9=2
*/
for (int i = 0; i < 9 ; i++){
for (int j = 0; j < 8; j++){
System.out.print((j+2) + "*" + (i+1) + "=" + (j+2)*(i+1)+"\t");
}
System.out.println();
}
}
}
```
SalaryEmployee.java
```
public class SalaryEmployee extends Employee{
private int annualSalary;//¿¬ºÀ
public SalaryEmployee() {
}
public SalaryEmployee(int no,String name,int annualSalary) {
super(no, name);
this.annualSalary = annualSalary;
}
/*
* ÀçÁ¤ÀÇ
*/
public void calculatePay(){
int tempPay=annualSalary/12;
this.setPay(tempPay);
}
/*
public final void calculateIncentive(){
if(pay>=1000000){
incentive =(int)(pay*INCENTIVE_RATE);
}
}
*/
public int getAnnualSalary() {
return annualSalary;
}
public void setAnnualSalary(int annualSalary) {
this.annualSalary = annualSalary;
}
}
```
AbstractClassMain.java
```
public class AbstractClassMain {
public static void main(String[] args) {
//AbstractClass ac = new AbstractClass();
AbstractClassChild acc = new AbstractClassChild();
acc.method1();
acc.method2();
AbstractClass ac = new AbstractClassChild();
ac.method1();
ac.method2();
}
}
```
Generic.java
```package com.itwill.collection;
public class Generic<E, E1, E2> {
private E member;
public void setMember(E e){
member=e;
}
public E getMember(){
return member;
}
}
```
FileReaderWriterMain.java
```package char_stream;
import java.io.FileReader;
import java.io.FileWriter;
public class FileReaderWriterMain {
public static void main(String[] args) throws Exception{
FileWriter fw = new FileWriter("writeOut.txt");
FileReader fr = new FileReader("writeOut.txt");
fw.write(45000);
fw.write('김');
fw.write("파일라이터를 사용하기");
int count = 0;
for (int i = '김'; i < '헣'; i++) {
fw.write(i);
count++;
if(count%100 ==0){
fw.write('\n');
}
}
fw.flush();
fw.close();
System.out.println("filewrite write....");
int readChar = fr.read();
System.out.println("1. " + (char)readChar);
readChar = fr.read();
System.out.println("2. " + (char)readChar);
while (true) {
readChar = fr.read();
if(readChar == -1)break;
System.out.println((char)readChar);
}
}
}
```
PackageMain.java
```import com.itwill.shop.product.ProductManager;
/*
package
1. 관련있는(업무) 클래스의 모음(패키지)
2. 패키지의 이름은 계층적으로 큰범위부터작은범위로구성
3. 클래스의 완전한이름은 패키지를 포함한이름이다..
ex> package samson.sds.chongmu;
public class Chongmu1{
}
4.compile 방법
>javac -d . XXX.java
*/
public class PackageMain {
public static void main(String[] args) {
com.itwill.shop.member.Member m = new com.itwill.shop.member.Member();
com.itwill.shop.member.MemberManager memberManager = new com.itwill.shop.member.MemberManager();
com.itwill.shop.product.ProductManager pm1 = new com.itwill.shop.product.ProductManager();
com.itwill.shop.product.ProductManager pm2 = new com.itwill.shop.product.ProductManager();
System.out.println(m);
System.out.println(memberManager);
System.out.println(pm1);
System.out.println(pm2);
}
}
```
Constructor.java
```/*
생성자(constructor)
1. 클래스 이름과동일하며 리턴타입을 명시하지않는 메쏘드(???)
2. 하나의 클래스에는 반드시 하나이상의 생성자가 존재하여야한다
--> 생성자를 정의하지않을경우 컴파일러는 인자가하나도없는
생성자(디폴드 생성자)를 자동으로 넣어서 컴파일한다.
3. 객체생성시 단한번 호출된다.
4. 주로 객체초기화의 용도로 사용한다.
5. 객체를 생성할려면 반드시 생성자를 호출하여야한다.
-형태:
public class Test{
//생성자의 정의(선언)
public Test(){
}
}
-사용:
Test t = new Test();
클래스명 참조변수이름 = new 클래스명();
new 라는 연산자는 반드시 생성자 앞에있어야하며
이연산자에의해 객체를 생성한다.
*/
public class Constructor {
public int i;
public int j;
/*
* 인자가하나도 없는 생성자 --> 디폴트 생성자
*/
//생성자의 정의(선언)
public Constructor(){
System.out.println("Constructor() 실행");
this.i=100;
this.j=101;
}
public Constructor(int i){
System.out.println("Constructor(int i) 실행 ");
this.i=i;
this.j=102;
}
public Constructor(int i , int j){
System.out.println("Constructor(int i , int j) int");
this.i=i;
this.j=j;
}
public void print(){
System.out.println("i=" + this.i);
System.out.println("j=" + this.j);
}
}
```
RuntimeExceptionMain.java
```
public class RuntimeExceptionMain {
public static void main(String[] args) {
System.out.println("main start");
String str=null;
//System.out.println(str.length());
int[] ia=new int[2];
ia[2]=4;
System.out.println("main return");
}
}
```
ThreadSleep.java
```package thread.control;
import java.util.Calendar;
public class ThreadSleep extends Thread{
boolean isAlive = true;
/*
public void run()
*/
int count;
int finishCount;
@Override
public void run(){
while(isAlive){
try {
Thread.sleep(1000);
this.timePrint();
count++;
if(count==finishCount){
isAlive=false;
}
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
public void timePrint(){
Calendar ca = Calendar.getInstance();
int year = ca.get(Calendar.YEAR);
int month = ca.get(Calendar.MONTH)+1;
int date = ca.get(Calendar.DATE);
int hour = ca.get(Calendar.HOUR_OF_DAY);
int min = ca.get(Calendar.MINUTE);
int sec = ca.get(Calendar.SECOND);
System.out.println("현재시간 : " + year + "년 " + month + "월 " + date + "일 " + hour + "시 " + min + "분 " + sec + "초");
}
}
```
StudentArrayMain.java
```package com.itwill.sungjuk.field;
public class StudentArrayMain {
public static void main(String[] args) {
Student[] students = new Student[10];
//1.전체성적계산(석차)
//2.반전체평균
//3.학번(이름,평균,평점)으로 찾아 출력
//4.갱신(학번 2번인 학생의 성적 0점처리)
//5.학생객체 석차순으로 정렬(오름차순)
}
}
```
CustomTypeMain.java
```
public class CustomTypeMain {
public static void main(String[] args){
int i;
i = 900;
//클래스타입(참조타입) 변수 선언
CustomType cr;
//글래스로 객체를 찍어낸다
cr = new CustomType();
cr.member1 = 123;
cr.member2 = "문자열";
cr.member3 = 'A';
cr.member4 = true;
System.out.println(cr.member1);
System.out.println(cr.member2);
System.out.println(cr.member3);
System.out.println(cr.member4);
}
}
```
StringChild.java
```
public class StringChild /*extends SuperClass*/{
}
```
HourlyEmployee.java
```
public class HourlyEmployee extends Employee{
private int moneyPerHour;//시급
private int worksHour;//일한시간
public HourlyEmployee() {
}
public HourlyEmployee(int no, String name,int moneyPerHour, int worksHour) {
super(no, name);
this.moneyPerHour = moneyPerHour;
this.worksHour = worksHour;
}
@Override
public void calculatePay() {
int tempPay = moneyPerHour*worksHour;
this.setPay(tempPay);
}
public int getMoneyPerHour() {
return moneyPerHour;
}
public void setMoneyPerHour(int moneyPerHour) {
this.moneyPerHour = moneyPerHour;
}
public int worksHour() {
return worksHour;
}
public void setWorksHour(int workssHour) {
this.worksHour = workssHour;
}
}
```
GajunGumsa.java
```
public class GajunGumsa {
private OnOff[] gajuns;
public OnOff[] getGajuns() {
return gajuns;
}
public void setGajuns(OnOff[] gajuns) {
this.gajuns = gajuns;
}
public void gumsa(){
for (int i = 0; i < gajuns.length; i++) {
gajuns[i].on();
Volume tempGajun = (Volume)gajuns[i];
tempGajun.up();
tempGajun.down();
gajuns[i].off();
System.out.println("------Ãâ°í-------");
}
}
}
```
ListGenericMain.java
```package com.itwill.collection;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
public class ListGenericMain {
public static void main(String[] args) {
/***************기본형(String)********************/
ArrayList<String> pList1 = new ArrayList<String>();
ArrayList<Integer> pList2 = new ArrayList<Integer>();
System.out.println("1.list size : " + pList1.size());
pList1.add("김경호");
pList1.add("정경호");
pList1.add("고경호");
pList1.add("황경호");
pList1.add("최경호");
pList1.add("민경호");
pList1.add("심경호");
System.out.println("2.String List 구조 : " + pList1);
pList1.add(2,"구경호");
System.out.println("2.pList.add(2, \"구경호\") : " + pList1);
pList1.add(0,"공경호");
System.out.println("2.pList.add(0, \"구경호\") : " + pList1);
pList1.remove(pList1.size()-1);
System.out.println("2.pList1.size()-1 삭제 : " + pList1);
Collections.sort(pList1);
System.out.println("3.sort" + pList1);
String tStr = (String)pList1.get(3);
System.out.println("4.pList1.get(3)" + tStr);
pList2.add(56);
pList2.add(78);
pList2.add(89);
pList2.add(45);
pList2.add(88);
pList2.add(23);
pList2.add(99);
System.out.println("4.Integer List 구조 : " + pList2);
Collections.sort(pList2);
System.out.println("5.ini sort : " + pList2);
System.out.println("6.전체출력-String temp:pList1--------------");
/*for (int i = 0; i < pList1.size(); i++) {
String tempString = (String)pList1.get(i);
System.out.println(tempString);
}*/
for (String tempString : pList1) {
System.out.println(tempString);
}
System.out.println("6.전체출력-Integer int : plist2--------------");
/*for (int i = 0; i < pList2.size(); i++) {
Integer tempInteger = (Integer)pList2.get(i);
System.out.println(tempInteger);
}*/
for (Integer integer : pList2) {
System.out.println(integer);
}
/***************참조형********************/
System.out.println("***********참조형************");
ArrayList<Account> accountList = new ArrayList<Account>();
Account acc1 = new Account("8856", "KIM", 120000, 1.5f);
Account acc2 = new Account("7546", "LEE", 80000, 2.5f);
Account acc3 = new Account("8546", "PARK", 6000, 9.5f);
Account acc4 = new Account("8542", "SIM", 50000, 4.2f);
Account acc5 = new Account("4345", "KIM", 161000, 10.8f);
Account acc6 = new Account("4586", "CHIO", 125000, 3.2f);
Account acc7 = new Account("1325", "SIM", 125000, 3.2f);
Account acc8 = new Account("4588", "KIM", 125000, 3.2f);
Account acc9 = new Account("1565", "LEE", 125000, 3.2f);
accountList.add(acc1);
accountList.add(acc2);
accountList.add(acc3);
accountList.add(acc4);
accountList.add(acc5);
accountList.add(acc6);
accountList.add(acc7);
accountList.add(acc8);
accountList.add(acc9);
System.out.println("1. size : " + accountList.size());
System.out.println("2. get: ");
accountList.get(2);
Account getAccount = (Account)accountList.get(2);
System.out.println("2. get(2)" + getAccount);
System.out.println("3. remove");
Account removeAccount = (Account)accountList.remove(0);
System.out.println(removeAccount);
System.out.println("4.list구조" + accountList);
System.out.println("5.전체출력------------------");
/*for (int i = 0; i < accountList.size(); i++) {
Account tAccount = (Account)accountList.get(i);
tAccount.print();
}*/
for (Account tAccount : accountList) {
System.out.println(tAccount);
}
System.out.println("6.-------------SIM 씨 삭제-------------");
for (int i = 0; i < accountList.size(); i++) {
Account tempAccount = (Account)accountList.get(i);
if(tempAccount.getOwner().equals("SIM")){
accountList.remove(i);
if(accountList.size() !=i){
i--;
}
}
}
System.out.println("7.삭제후 전체출력------------------");
for (int i = 0; i < accountList.size(); i++) {
Account tAccount = (Account)accountList.get(i);
tAccount.print();
}
Collections.sort(accountList);
System.out.println("7.정렬후전체출력------------------");
for (int i = 0; i < accountList.size(); i++) {
Account tAccount = (Account)accountList.get(i);
tAccount.print();
}
System.out.println("9--------iteration--------------");
Iterator<Account> accountIter = accountList.iterator();
while (accountIter.hasNext()) {
Account tempAccount = accountIter.next();
tempAccount.print();
}
for (Account tempAccount : accountList) {
tempAccount.print();
}
}
}
```
InetAddressMain.java
```package client;
import java.net.InetAddress;
public class InetAddressMain {
public static void main(String[] args) throws Exception{
/*
This class represents an Internet Protocol (IP) address.
*/
System.out.println("-----InetAddress--");
InetAddress ia1=InetAddress.getByName("www.naver.com");
System.out.println("host name:"+ia1.getHostName());
System.out.println("host address:"+ia1.getHostAddress());
InetAddress ia2=InetAddress.getByName("www.google.com");
System.out.println("host name:"+ia2.getHostName());
System.out.println("host address:"+ia2.getHostAddress());
//multi address
System.out.println("-----multi address--");
InetAddress[] iaArray=InetAddress.getAllByName("www.google.com");
for (int i = 0; i < iaArray.length; i++) {
System.out.println(iaArray[i]);
}
System.out.println("----local address---");
InetAddress localAddress= InetAddress.getLocalHost();
System.out.println(localAddress);
}
}
```
CarConstructorMain.java
```
public class CarConstructorMain {
public static void main(String[] args) {
Car c1 = new Car("111",12);
Car c2 = new Car("123",13);
Car c3 = new Car("124",14);
Car c4 = new Car("125",15);
c1.setOutTime(19);
c1.calculateFee();
c2.setOutTime(19);
c2.calculateFee();
c3.setOutTime(19);
c3.calculateFee();
c4.setOutTime(19);
c4.calculateFee();
c1.print();
c2.print();
c3.print();
c4.print();
}
}
```
CastingExam.java
```/*
형변환(Casting)--> 숫자형데이타간에만 가능
- 형식 : (데이타타입)변수or데이타(리터럴);
- 자동형변환(작은데이타-->큰데이타)upcasting
byte-->short-->int-->long-->float-->double
- 강제형변환(큰데이타-->작은데이타)downcasting
double-->float-->long-->int-->short-->byte
*/
//upcasting(promotion)
public class CastingExam {
public static void main(String[] args) {
byte b = 12;
short s = 20;
int i = 300;
long l = 900;
float f = 1.14f;
double d = 3.14159;
//자동형변환(작은데이타-->큰데이타)upcasting
double d1 = i;
d1=b;
d1=s;
//강제형변환(큰데이타-->작은데이타)downcasting
int i1 = (int)d;
System.out.println("i1=1" + i1);
//연산시의 형변환
double d2 = b+s+i+l+f+d;
System.out.println(d2);
//byte, short 연산(모든함이 int casting 된후 연산)
int i2 = b+s;
System.out.println(i2);
char c1 = '김';
System.out.println(c1);
int i3 = c1;
System.out.println(i3);
char c2 = 'A' + 1;
System.out.println(c2);
int i4 = 44608;
char c3 = (char)i4;
}
}
```
CalculatorStaticMain.java
```package com.itwill.sungjuk.method;
public class CalculatorStaticMain {
public static void main(String[] args) {
int result = Calculator.add(12, 454545);
System.out.println("result : " + result);
result = Calculator.sub(12, 454545);
System.out.println("result : " + result);
result = Calculator.mul(12, 454545);
System.out.println("result : " + result);
result = Calculator.div(12, 454545);
System.out.println("result : " + result);
System.out.println("------잘못된사용---");
/*Calculator cal = new Calculator();
result = cal.add(12,123);
*/
}
}
```
Car.java
```
public class Car {
private String no; //차량번호
private int inTime; // 입차시간
private int outTime; // 출차시간
private int fee; //주차요금
//시긴당 주차요금
private static int moneyPerHour = 1000;
public Car(){
}
public Car(String no, int inTime){
this.no=no;
this.inTime=inTime;
}
//입력
//출력
public void print(){
//this : self 참조변수
System.out.println(no+ "\t" + inTime + "\t" + outTime + "\t" + fee);
}
//주차요금계산
public void calculateFee(){
this.fee=(this.outTime-this.inTime)*1000;
}
//getter,setter
public String getNo() {
return no;
}
public void setNo(String no) {
this.no = no;
}
public int getInTime() {
return inTime;
}
public void setInTime(int inTime) {
this.inTime = inTime;
}
public int getOutTime() {
return outTime;
}
public void setOutTime(int outTime) {
this.outTime = outTime;
}
public int getFee() {
return fee;
}
public void setFee(int fee) {
this.fee = fee;
}
}
```
PrintStreamMain.java
```package byte_stream.filter_stream;
import java.io.FileOutputStream;
import java.io.PrintStream;
public class PrintStreamMain {
public static void main(String[] args) throws Exception{
PrintStream ps = new PrintStream(new FileOutputStream("print.txt"));
ps.write(65);
ps.write(54);
ps.write(53);
ps.print(65);
ps.println(1);
ps.print(2.3654);
ps.write('\n');
String ds = "2.3654";
for (int i = 0; i < ds.length(); i++) {
char c = ds.charAt(i);
ps.write(c);
}
ps.println("\n오늘은 아이오를 해요~~");
System.out.println("print");
ps.close();
}
}
```
AcademyManagerImpl.java
```package com.itwill.academy.manager;
public class AcademyManagerImpl implements AcademyManager {
private Person[] personArray;
public AcademyManagerImpl() {
personArray=new Person[15];
}
public AcademyManagerImpl(int memberCount) {
personArray=new Person[memberCount];
}
@Override
public void allPrint() {
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null){
personArray[i].print();
}
}
}
@Override
public void addPerson(Person p) {
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]==null){
personArray[i]=p;
break;
}
}
}
@Override
public void deletePerson(int no) {
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null && personArray[i].getNo()==no){
personArray[i]=null;
}
}
}
@Override
public void updatePerson(Person updatePersonData) {
//1.no로 Person 객체를 찾는다.
//2.updatePersonData의 타입을 알아낸후
// Student,Staff,Gangsa casting
//3.변경
if(updatePersonData instanceof Student){
/*
* 이름 변경,반변경
*/
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null && personArray[i].getNo()==updatePersonData.getNo()){
personArray[i] = updatePersonData;
}
}
}else if(updatePersonData instanceof Staff){
/*
* 이름변경,부서변경
*/
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null && personArray[i].getNo()==updatePersonData.getNo()){
personArray[i] = updatePersonData;
}
}
}else if(updatePersonData instanceof Gangsa){
/*
* 이름변경,과목변경
*/
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null && personArray[i].getNo()==updatePersonData.getNo()){
personArray[i] = updatePersonData;
}
}
}
}
@Override
public Person findByNo(int no) {
Person tempPerson = null;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i]!=null && personArray[i].getNo()==no){
tempPerson = personArray[i];
}
}
return tempPerson;
}
@Override
public Person[] findByName(String name) {
int count = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i].getName().equals(name)){
count += 1;
}
}
Person[] tempName = new Person[count];
int temp = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i].getName().equals(name)){
tempName[temp]=personArray[i];
temp++;
}
}
return tempName;
}
@Override
public Person[] findByEtc(int etcNo, String etc) {
Person[] tempPerson = null;
switch (etcNo) {
case AcademyManager.BAN:
int count = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Student){
Student tempStudent=(Student)personArray[i];
if(tempStudent.getClazz().equals(etc)){
count++;
}
}
}
tempPerson = new Person[count];
int temp = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Student){
Student tempStudent=(Student)personArray[i];
if(tempStudent.getClazz().equals(etc)){
tempPerson[temp] = personArray[i];
temp++;
}
}
}
break;
case AcademyManager.DEPART:
count = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Staff){
Staff tempStaff=(Staff)personArray[i];
if(tempStaff.getDepart().equals(etc)){
count++;
}
}
}
tempPerson = new Person[count];
temp = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Staff){
Staff tempStaff=(Staff)personArray[i];
if(tempStaff.getDepart().equals(etc)){
tempPerson[temp] = personArray[i];
temp++;
}
}
}
break;
case AcademyManager.SUBJECT:
count = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Gangsa){
Gangsa tempGangsa=(Gangsa)personArray[i];
if(tempGangsa.getSubject().equals(etc)){
count++;
}
}
}
tempPerson = new Person[count];
temp = 0;
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Gangsa){
Gangsa tempGangsa=(Gangsa)personArray[i];
if(tempGangsa.getSubject().equals(etc)){
tempPerson[temp] = personArray[i];
temp++;
}
}
}
break;
}
return tempPerson;
}
}
```
ButtonActionEventFrame.java
```package event;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Frame;
/*
Event program방법
1. XXXEvent Source 선정(Button)(XXXEvent의 종류)--> ActionEvent
2. XXXEvent Handler 작성(클래스)-->ActionEvent Handler작성
3. Event Source 와 Event Handler를 연결해준다.
ex> EventSource객체.addXXXListener(Event Handler 객체)
<<b.addActionListener(.);>>
# XXXEvent Handler 클래스 작성방법
1.XXXEvent를 감지(처리)할수있는 XXXListener interface를 implement
(ActionEvent) (ActionListener)
2.XXXListener 추상메쏘드 구현..
(WindowListener)
*/
public class ButtonActionEventFrame extends Frame{
Button b;
public ButtonActionEventFrame(){
b = new Button("이벤트소스[]");
add(b,BorderLayout.SOUTH);
//event
b.addActionListener(new ButtonActionEventHandler(this));
setSize(300,400);
setVisible(true);
}
public static void main(String[] args) {
new ButtonActionEventFrame();
}
}
```
EmployeeMain.java
```
public class EmployeeMain {
public static void main(String[] args) {
Employee[] employees={
new SalayEmployee(1,"KIM",20000000),
new SalayEmployee(2,"LEE",24000000),
new SalayEmployee(3,"PARK",10000000),
new HourlyEmployee(4,"CHOI",10000,120),
new HourlyEmployee(5,"SIM",10000,80)
};
for (int i = 0; i < employees.length; i++) {
employees[i].calculatePay();
employees[i].calculateIncentive();
employees[i].print();
}
}
}
```
IfScoreTest.java
```
/*
옛날일....
국어,영어,수학 점수를 가지고
총점,평균,평점(A,B,C....)을 출력하시요....
- 100점이 넘는 수나 음수가 입력되면 메세지를 출력하세요
- 평균은 소수점이하 2자리수까지만 출력하세요
- 출력포맷
************************
국어: 78
영어: 56
수학: 77
총점:256
평균:78.56
평점: C
************************
*/
public class IfScoreTest
{
public static void main(String[] args)
{
int kor,eng,math;
kor=85;
eng=63;
math=82;
if(kor<0 || kor>100 || eng<0 || eng>100 || math<0 || math>100){
System.out.println(" 유효한 점수가 아닙니다. ");
return;
}
int score = kor + eng + math;
double ave = (double)score/3;
ave = ave*100;
ave = (double)((int)ave);
ave = ave /100;
char grade = ' ';
if (ave >= 90){
grade = 'A';
}else if (ave >= 80){
grade = 'B';
}else if (ave >= 70){
grade = 'C';
}else if (ave >= 60){
grade = 'D';
}else{
grade = 'F';
}
System.out.println("국어: " + kor);
System.out.println("영어: " + eng);
System.out.println("수학: " + math);
System.out.println("총점: " + score);
System.out.println("평균: " + ave);
System.out.println("평점: " + grade);
return;
}
}
```
ConnectionTransactionMain.java
```package jdbc.connection.transation;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import jdbc.member.ConnectionFactory;
public class ConnectionTransactionMain {
public static void main(String[] args) {
Connection con=null;
PreparedStatement pstmt=null;
String updateSqlA="update accountA set acc_balance = acc_balance - ? where acc_no=?";
String updateSqlB="update accountB set acc_balance = acc_balance + ? where acc_no=?";
String selectSqlA="select acc_balance from accountA where acc_no=?";
String selectSqlB="select acc_balance from accountB where acc_no=?";
try{
con=ConnectionFactory.getConnection();
con.setAutoCommit(false);
pstmt=con.prepareStatement(updateSqlA);
int acc_no = 10000;
int money = 100000;
pstmt.setInt(1, money);
pstmt.setInt(2, acc_no );
int updateRows = pstmt.executeUpdate();
pstmt.clearParameters();
System.out.println("1.accountA: "+acc_no+"번계좌에서 "+money+ "원이 출금:"+updateRows);
pstmt.close();
pstmt=null;
pstmt=con.prepareStatement(updateSqlB);
pstmt.setInt(1, money);
pstmt.setInt(2, acc_no );
updateRows=pstmt.executeUpdate();
pstmt.close();
pstmt=null;
System.out.println("2.accountB: "+acc_no+"번계좌에서 "+money+ "원이 입금:"+updateRows);
pstmt=con.prepareStatement(selectSqlA);
pstmt.setInt(1, acc_no);
ResultSet rs=pstmt.executeQuery();
int balanceA=0;
if(rs.next()){
balanceA = rs.getInt("acc_balance");
System.out.println("3.accountA 계좌잔고:"+balanceA);
}
if(balanceA < 0){
con.rollback();
System.out.println("4-1.accountA 잔고부족:rollback");
}else{
con.commit();
System.out.println("4-2.accountA 에서 accountB 이체성공:commit");
}
}catch(Exception e){
e.printStackTrace();
try {
con.rollback();
System.out.println("4-3.accountA 에서 accountB 이체중예외발생:rollback");
} catch (SQLException e1) {
e1.printStackTrace();
}
}
}
}
```
ClockFrame.java
```package thread;
import java.awt.Frame;
import java.awt.Graphics;
import java.awt.event.MouseEvent;
import java.awt.event.MouseListener;
import java.util.Date;
public class ClockFrame extends Frame implements MouseListener{
boolean isAlive;
String timeStr="0000.00.00 000";
ClockThread ct;
boolean flag;
int timeX,timeY;
public ClockFrame() {
setSize(300, 150);
setVisible(true);
//event
this.addMouseListener(this);
timeX=70;
timeY=80;
flag = true;
clockStart();
}
public void clockStart(){
ct=new ClockThread();
isAlive=true;
ct.start();
}
public void clockStop(){
isAlive=false;
ct=null;
}
@Override
public void paint(Graphics g) {
g.drawString(timeStr, timeX, timeY);
}
/*********MouserListener impl***************/
public void mouseClicked(MouseEvent e) {
int cX=e.getX();
int cY=e.getY();
timeX = cX;
timeY = cY;
repaint();
System.out.println("click:"+cX+","+cY);
if(flag){
clockStop();
}else{
clockStart();
}
flag=!flag;
setTitle(flag+"");
}
public void mousePressed(MouseEvent e) {
int cX=e.getX();
int cY=e.getY();
timeX = cX;
timeY = cY;
repaint();
System.out.println("press:"+cX+","+cY);
}
public void mouseReleased(MouseEvent e) {
int cX=e.getX();
int cY=e.getY();
System.out.println("realese:"+cX+","+cY);
}
public void mouseEntered(MouseEvent e) {
int cX=e.getX();
int cY=e.getY();
System.out.println("enter:"+cX+","+cY);
}
public void mouseExited(MouseEvent e) {
int cX=e.getX();
int cY=e.getY();
System.out.println("exit:"+cX+","+cY);
}
/***************inner class***********/
public class ClockThread extends Thread{
@Override
public void run() {
while (isAlive) {
try {
Thread.sleep(1000);
/*
public void repaint();
- this method causes a call
to this component's paint method as soon as possible.
*/
Date currentTime=new Date();
timeStr=currentTime.toLocaleString();
ClockFrame.this.repaint();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
return;
}
}
/******************************************/
public static void main(String[] args) {
new ClockFrame();
}
}
```
CenterPanel.java
```package layout;
import java.awt.Button;
import java.awt.Color;
import java.awt.GridLayout;
import java.awt.Panel;
public class CenterPanel extends Panel {
Button b1,b2,b3,b4,b5;
public CenterPanel(){
b1 = new Button("1");
b2 = new Button("2");
b3 = new Button("3");
b4 = new Button("4");
b5 = new Button("5");
setLayout(new GridLayout(0,2));
add(b1);
add(b2);
add(b3);
add(b4);
add(b5);
setBackground(Color.PINK);
}
}
```
ConsolePrintStreamMain.java
```package byte_stream.filter_stream;
import java.io.PrintStream;
public class ConsolePrintStreamMain {
public static void main(String[] args) {
System.out.println("system console.....");
System.out.write(65);
System.out.write(66);
System.out.write(67);
System.out.write(68);
System.out.write(69);
System.out.println("write");
PrintStream ps = System.out;
for (int i = 0; i < 255; i++) {
ps.write(i);
}
System.out.println();
System.out.println("-----------2 byte(ÇѱÛ) write------------");
ps.write('±è');
System.out.println("----------2 byte(ÇѱÛ) print-------------");
ps.print('±è');
ps.print("±è");
}
}
```
HC.java
```package korea.prince;
import korea.president.YS;
public class HC extends YS{
public void access(){
this.a=1;
this.b=2;
}
}
```
WhileGuGuDan.java
```
public class WhileGuGuDan {
public static void main(String[] args) {
/*
2*1=2 3*1=3 4*1=4 5*1=5 6*1=6 7*1=7 8*1=8 9*1=9
2*2=4 3*2=6 4*2=8 5*2=10 6*2=12 7*2=14 8*2=16 9*2=18
2*3=6 3*3=9 4*3=12 5*3=15 6*3=18 7*3=21 8*3=24 9*3=27
2*4=8 3*4=12 4*4=16 5*4=20 6*4=24 7*4=28 8*4=32 9*4=36
2*5=10 3*5=15 4*5=20 5*5=25 6*5=30 7*5=35 8*5=40 9*5=45
2*6=12 3*6=18 4*6=24 5*6=30 6*6=36 7*6=42 8*6=48 9*6=54
2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49 8*7=56 9*7=63
2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64 9*8=72
2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81
*/
int i=0;
while( i < 9 ){
int j=0;
while( j < 8 ){
System.out.print((j+2) + "*" + (i+1) + "=" + (j+2)*(i+1)+" \t");
j++;
}
System.out.println();
i++;
}
}
}
```
ReferenceArrayMain.java
```
public class ReferenceArrayMain {
public static void main(String[] args) {
int[] ia = new int[5];
//참조형 1차원 배열
//Account acc1 = new Account();
Account[] accountArray = new Account[5];
accountArray[0] = new Account("5555", "KIM", 53000, 2.8f);
accountArray[1] = new Account("4444", "LEE", 80000, 5.7f);
accountArray[2] = new Account("3333", "PARK", 45000, 4.8f);
accountArray[3] = new Account("2222", "CHOI", 100000, 1.2f);
accountArray[4] = new Account("1111", "SIM", 5000, 3.5f);
System.out.println("1.전체계좌출력");
accountArray[0].headerPrint();
for (int i = 0; i < accountArray.length; i++) {
accountArray[i].print();
}
Member[] members={
new Member(1,"김"),
new Member(2,"이"),
new Member(3,"박"),
new Member(4,"최"),
new Member(5,"심"),
new Member(6,"오"),
new Member(7,"임"),
new Member(8,"명"),
new Member(9,"감"),
new Member(10,"수"),
};
for (int i = 0; i < members.length; i++) {
System.out.println(members[i].no + "," + members[i].name);
}
}
}
```
ObjectCompareNullMain.java
```
public class ObjectCompareNullMain {
public static void main(String[] args) {
/*
* 기본형비교
*/
int a = 3;
if(a==3){
System.out.println("3 == 3");
}
if(a < 5){
System.out.println(" 3 < 5");
}
/*
* 객체(주소)비교
*/
Account acc1 = new Account();
Account acc2 = new Account();
Account acc3 = acc1;
if(acc1 == acc2){
System.out.println(acc1 + "==" + acc2);
}else{
System.out.println(acc1 + "!=" + acc2);
}
if(acc1 == acc3){
System.out.println(acc1 + "==" + acc3 );
}else{
System.out.println(acc1 + "!=" + acc3);
}
/*
* String 객체비교
*/
String str1 = "자바";
String str2 = new String("자바");
System.out.println("---------------------");
if(str1==str2){
System.out.println("String : str1 == str2" );
}else{
System.out.println("String : str1 != str2" );
}
System.out.println("---------------------");
if(str1=="자바"){
System.out.println("String : str1 == str2" );
}else{
System.out.println("String : str1 != str2" );
}
System.out.println("---------------------");
/*
* String객체 값비교(주소 비교는 존재하지 않음)
*/
/*
* 원형 : public boolean equals(String str);
* 문자열의값비교
*/
boolean isSame = str1.equals(str2);
System.out.println(isSame);
if("자바".equals(str1)){
System.out.println("\"자바\".equals(str1)");
}
if(str1.equals(str2)){
System.out.println("str1.equals(str2)");
}
if(str2.equals("자바")){
System.out.println("str2.equals(\"자바\")");
}
System.out.println("--------------null--------------");
/*
* null
* - 참조형리터럴
* - 주소없다 값
*/
//The local variable i may not have been initialized
//int i;
//int r=i+9;
Account acc4 = null;
if(acc4==null){
acc4=new Account("999", "KIM", 15200, 5.6f);
}
acc4.print();
if(acc4!=null){
acc4=null;
}
}
}
```
Third.java
```
public class Third {
public void third() throws Exception{
System.out.println("Third.third()실행");
//Excption 발생 던진다
boolean b=true;
if(b){
throw new Exception("나의에로사항");
}
//FileInputStream fis=new FileInputStream("a.txt");
System.out.println("Third.third()반환");
}
}
```
ParkingManagerMain.java
```package com.itwill.parking.manager;
/*
* 주차관리 클래스를 사용하여 주차
*/
public class ParkingManagerMain {
public static void main(String[] args) {
ParkingManager parkingmanager = new ParkingManager(26);
Car c1 = new Car("1111",1);
Car c2 = new Car("1562",3);
Car c3 = new Car("2345",6);
Car c4 = new Car("3485",7);
Car c5 = new Car("1456",8);
Car c6 = new Car("5318",8);
Car c7 = new Car("6786",10);
Car c8 = new Car("7831",13);
Car c9 = new Car("8135",15);
//입차(8대)
System.out.println("입차(8대)");
parkingmanager.ipCha(c1);
parkingmanager.ipCha(c2);
parkingmanager.ipCha(c3);
parkingmanager.ipCha(c4);
parkingmanager.ipCha(c5);
parkingmanager.ipCha(c6);
parkingmanager.ipCha(c7);
parkingmanager.ipCha(c8);
parkingmanager.ipCha(c9);
//전체차량 정보출력(null이아닌변수출력)
int carCount= parkingmanager.getCarCount();
System.out.println("현재주차장 주차가능대수(주차장 주차차량대수) : " + carCount);
parkingmanager.printAll();
System.out.println("-------------------------------");
System.out.println("번호로 차찾기(1대) 7831번 찾기");
Car carNo = parkingmanager.findByCarNo("7831");
Car.headerPrint();
carNo.print();
System.out.println("-------------------------------");
System.out.println("입차시간으로찾기(여러대) 8이후");
Car[] carInTime = parkingmanager.findByCarInTime(8);
Car.headerPrint();
for (int i = 0; i < carInTime.length; i++) {
carInTime[i].print();
}
System.out.println("-------------------------------");
System.out.println("1456번 차량찾기 , 현재시간셋팅,요금계산 ");
Car carOut = parkingmanager.findByCarNoandOut("1456",20);
Car.headerPrint();
carOut.carOutPrint();
System.out.println("1456번차량 삭제-------------");
String carDelete = parkingmanager.deleteByNo("1456");
System.out.println(carDelete);
parkingmanager.printAll();
/*
0.현재주차장 주차가능대수(주차장 주차차량대수)
1.입차
a.차객체생성(번호,입차시간)
b.차배열객체에 저장(null인곳에 저장)
2.전체차량 정보출력(null이아닌변수출력)
3-1.번호로 차찾기(1대)
3-2.입차시간으로찾기(여러대)
4.1456번 차량출차
a.1456번 차량찾기
b.현재시간셋팅,요금계산,영수증출력
c.1456번차량 삭제(carArray[7]=null;)
*/
}
}
```
InsertPanel.java
```package card.layout;
import java.awt.Color;
import java.awt.Panel;
public class InsertPanel extends Panel {
public InsertPanel() {
this.setBackground(Color.YELLOW);
}
}
```
AcademyManager.java
```package com.itwill.academy.manager;
public interface AcademyManager {
public static final int BAN=0;
public static final int DEPART=1;
public static final int SUBJECT=2;
public void allPrint();
public void addPerson(Person p);
public void deletePerson(int no);
public void updatePerson(Person p);
public Person findByNo(int no);
public Person[] findByName(String name);
public Person[] findByEtc(int etcNo,String etc);
}
```
EmpDaoImpl.java
```package jdbc.emp;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.Statement;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import jdbc.common.RdbDao;
import jdbc.member.ConnectionFactory;
public class EmpDaoImpl extends RdbDao implements EmpDao{
@Override
public int insert(Emp insertEmp) throws Exception {
Connection con = null;
PreparedStatement pstmt= null;
String insertSql = "insert into emp values(?,?,?,?,?,?,?,?)";
int insertRow = 0;
try{
con=getConnection();
pstmt = con.prepareStatement(insertSql);
pstmt.setInt(1, insertEmp.getEmpno());
pstmt.setString(2, insertEmp.getEname());
pstmt.setString(3, insertEmp.getJob());
pstmt.setInt(4, insertEmp.getMgr());
pstmt.setDate(5, insertEmp.getHiredate());
pstmt.setDouble(6, insertEmp.getSal());
pstmt.setDouble(7, insertEmp.getComm());
pstmt.setInt(8, insertEmp.getDeptno());
insertRow = pstmt.executeUpdate();
}finally{
if(con!=null)
releaseConnection(con);
}
return insertRow;
}
@Override
public int delete(int empno) throws Exception {
Connection con=null;
PreparedStatement pstmt=null;
String deleteSql="delete from emp where empno=?";
int deleteRows = 0;
try {
con=ConnectionFactory.getConnection();
pstmt=con.prepareStatement(deleteSql);
pstmt.setInt(1, empno);
deleteRows = pstmt.executeUpdate();
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return deleteRows;
}
@Override
public int update(Emp updateEmp) throws Exception {
// TODO Auto-generated method stub
return 0;
}
@Override
public Emp findByNo(int empno) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByName(String ename) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findBySal(int sal) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByJob(String job) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByHireDate(String hireDate) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByMgr(int mgr) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByComm(int comm) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByDept(int deptNo) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByAllEmp() throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Map<String, Object>> findAllEmpDept() throws Exception {
List<Map<String,Object>> empDeptList= new ArrayList<Map<String,Object>>();
Connection con = null;
PreparedStatement pstmt = null;
ResultSet rs = null;
String selectSql = "select empno,ename,dname,loc "
+ "from emp e join dept d "
+ "on e.deptno = d.deptno";
try{
con=getConnection();
pstmt = con.prepareStatement(selectSql);
rs = pstmt.executeQuery();
while(rs.next()){
Map<String, Object> empDeptMap = new HashMap<String, Object>();
empDeptMap.put("empno", rs.getInt("empno"));
empDeptMap.put("ename", rs.getString("ename"));
empDeptMap.put("dname", rs.getString("dname"));
empDeptMap.put("loc", rs.getString("loc"));
empDeptList.add(empDeptMap);
}
}finally{
if(con!=null)
releaseConnection(con);
}
return empDeptList;
}
@Override
public Map<String, Object> findByNoEmpDept(int empno) throws Exception {
Map<String, Object> empDeptMap = new HashMap<String, Object>();
Connection con = null;
PreparedStatement pstmt = null;
ResultSet rs = null;
String selectSql = "select empno,ename,dname,loc "
+ "from emp e join dept d "
+ "on e.deptno=d.deptno and e.empno=?";
try{
con=getConnection();
pstmt = con.prepareStatement(selectSql);
pstmt.setInt(1, empno);
rs = pstmt.executeQuery();
if(rs.next()){
empDeptMap.put("empno", rs.getInt("empno"));
empDeptMap.put("ename", rs.getString("ename"));
empDeptMap.put("dname", rs.getString("dname"));
empDeptMap.put("loc", rs.getString("loc"));
}
}finally{
if(con!=null)
releaseConnection(con);
}
return empDeptMap;
}
}
```
FinalMain.java
```
public class FinalMain {
public static void main(String[] args) {
System.out.println("SuperClass PORT_NUMBER : " + SuperClass.PORT_NUMBER);
SuperClass superClass = new SuperClass();
//superClass.PORT_NUMBER=88;
System.out.println("PORT_NUMBER : " + superClass.PORT_NUMBER);
SubClass subClass = new SubClass();
subClass.method1();
superClass.method2();
}
}
```
AcadmyCastingMain.java
```
public class AcadmyCastingMain {
public static void main(String[] args) {
Student st1 = new Student(1,"KIM","OFFICE");
Student st2 = new Student(2,"SIM","JAVA");
Student st3 = new Student(3,"LIM","WEB DESIGN");
Staff sf1 = new Staff(4, "LEE", "MARKETING");
Staff sf2 = new Staff(5, "CHOI", "EDUCATION");
Gangsa gs1 = new Gangsa(6,"PARK","LINUX");
Gangsa gs2 = new Gangsa(7,"HWANG","NETWORK");
Person[] personArray = new Person[7];
personArray[0] = st1;
personArray[1] = st2;
personArray[2] = st3;
personArray[3] = sf1;
personArray[4] = sf2;
personArray[5] = gs1;
personArray[6] = gs2;
/*
Person[] persons = {
new Student(),
new Staff(),
new Gangsa()
};
*/
System.out.println("-------------------------------");
for (int i = 0; i < personArray.length; i++) {
personArray[i].print();
}
System.out.println("-------------------------------");
/*
* 연산자 - instanceof
* - 결과는 논리형 데이터
*
* ex> boolean b = 참조변수 instanceof 클래스(type)
* boolean isStudent = st1 instanceof Student;
*/
for (int i = 0; i < personArray.length; i++) {
if(personArray[i] instanceof Student){
Student tempStudent = (Student)personArray[i];
String ban = tempStudent.getClazz();
System.out.println(tempStudent.no + "\t" + tempStudent.name + "\t" + tempStudent.clazz);
}
}
}
}
```
LottoManager.java
```package com.itwill.lotto;
public class LottoManager {
Lotto[] lottoArray;
public void generateLotto(int money) {
//Lotto 갯수 만큼 Lotto 객체생성
Lotto[] lottoArray=new Lotto[4];
lottoArray[0] = new Lotto();
lottoArray[1] = new Lotto();
lottoArray[2] = new Lotto();
lottoArray[3] = new Lotto();
lottoArray[0].generateNumber();
lottoArray[1].generateNumber();
lottoArray[2].generateNumber();
lottoArray[3].generateNumber();
print();
}
private void print(){
for (int i = 0; i < lottoArray.length; i++) {
System.out.println(lottoArray[i]);
}
}
}
```
SwitchScoreTest.java
```
/*
옛날일....
국어,영어,수학 점수를 가지고
총점,평균,평점(A,B,C....)을 출력하시요....
- 100점이 넘는 수나 음수가 입력되면 메세지를 출력하세요
- 평균은 소수점이하 2자리수까지만 출력하세요
- 출력포맷
************************
국어: 78
영어: 56
수학: 77
총점:256
평균:78.56
평점: C
************************
*/
public class SwitchScoreTest
{
public static void main(String[] args)
{
int kor,eng,math;
kor=92;
eng=95;
math=70;
if(kor<0 || kor>100 || eng<0 || eng>100 || math<0 || math>100){
System.out.println(" 유효한 점수가 아닙니다. ");
return;
}
int score = kor + eng + math;
double ave = (double)score/3;
ave = ave*100;
ave = (double)((int)ave);
ave = ave /100;
int grade = ((int)ave/10) % 10;
char msg =' ';
switch (grade) {
case 1:
case 2:
case 3:
case 4:
case 5:
msg = 'F';
break;
case 6:
msg = 'D';
break;
case 7:
msg = 'C';
break;
case 8:
msg = 'B';
break;
case 0:
case 9:
msg = 'A';
break;
}
System.out.println("국어: " + kor);
System.out.println("영어: " + eng);
System.out.println("수학: " + math);
System.out.println("총점: " + score);
System.out.println("평균: " + ave);
System.out.println("평점: " + msg);
return;
}
}
```
NullLayoutFrame.java
```package layout;
import java.awt.Button;
import java.awt.Frame;
import java.awt.Label;
import java.awt.TextField;
public class NullLayoutFrame extends Frame{
Label idL;
Label passL;
Button loginB;
Button cancelB;
TextField idTF;
TextField passTF;
public NullLayoutFrame(){
idL = new Label("아이디");
passL = new Label("패쓰워드");
loginB = new Button("로그인");
cancelB = new Button("취소");
idTF = new TextField();
passTF = new TextField();
idL.setBounds(50, 50, 60, 20);
idTF.setBounds(110, 50, 130, 20);
passL.setBounds(50,90,60,20);
passTF.setBounds(110, 90, 130, 20);
loginB.setBounds(50, 130, 80, 20);
cancelB.setBounds(160, 130, 80, 20);
this.add(idL);
this.add(idTF);
this.add(passL);
this.add(passTF);
this.add(loginB);
this.add(cancelB);
this.setLayout(null);
this.setResizable(false);
this.setSize(300,180);
this.setVisible(true);
}
public static void main(String[] args) {
NullLayoutFrame f = new NullLayoutFrame();
}
}
```
StudentMain.java
```package com.itwill.sungjuk.field;
public class StudentMain {
public static void main(String[] args) {
//학생객체생성
Student s1 = new Student();
Student s2 = new Student();
//학생데이타대입
s1.stuNo = 222;
s1.stuName = "길";
s1.stuKor = 80;
s1.stuEng = 76;
s1.stuMath = 95;
s2.stuNo = 654;
s2.stuName = "홍";
s2.stuKor = 85;
s2.stuEng = 40;
s2.stuMath = 72;
//총점,평균,평점계산후 대입
s1.stuScore = s1.stuKor + s1.stuEng + s1.stuMath;
s1.stuAve = (s1.stuScore)/3;
s1.stuGrade = ' ';
if (s1.stuAve >= 90){
s1.stuGrade = 'A';
}else if (s1.stuAve >= 80){
s1.stuGrade = 'B';
}else if (s1.stuAve >= 70){
s1.stuGrade = 'C';
}else if (s1.stuAve >= 60){
s1.stuGrade = 'D';
}else{
s1.stuGrade = 'F';
}
s2.stuScore = s2.stuKor + s2.stuEng + s2.stuMath;
s2.stuAve = (s2.stuScore)/3;
s2.stuGrade = ' ';
if (s2.stuAve >= 90){
s2.stuGrade = 'A';
}else if (s2.stuAve >= 80){
s2.stuGrade = 'B';
}else if (s2.stuAve >= 70){
s2.stuGrade = 'C';
}else if (s2.stuAve >= 60){
s2.stuGrade = 'D';
}else{
s2.stuGrade = 'F';
}
//출력
System.out.println("1--------------------");
System.out.println("학생번호 : " + s1.stuNo);
System.out.println("학생이름 : " + s1.stuName);
System.out.println("국어점수 : " + s1.stuKor);
System.out.println("영어점수 : " + s1.stuEng);
System.out.println("수학점수 : " + s1.stuMath);
System.out.println("총점 : " + s1.stuScore);
System.out.println("평균점수 : " + s1.stuAve);
System.out.println("평점 : " + s1.stuGrade);
System.out.println("2---------------------");
System.out.println("학생번호 : " + s2.stuNo);
System.out.println("학생이름 : " + s2.stuName);
System.out.println("국어점수 : " + s2.stuKor);
System.out.println("영어점수 : " + s2.stuEng);
System.out.println("수학점수 : " + s2.stuMath);
System.out.println("총점 : " + s2.stuScore);
System.out.println("평균점수 : " + s2.stuAve);
System.out.println("평점 : " + s2.stuGrade);
}
}
```
Static.java
```/*
* static 제한자(제어자,modifier)
* 1.멤버변수나,메쏘드(클래스) 앞에 부칠수있다
* 2.static 제한자가 붙어있는 변수나메쏘드는
* 객체생성 없이도 사용이가능하다.
* 3.클래스가 가지고있는 변수나메쏘드이다.
* -->클래스변수,클래스메쏘드라고도한다.
* 4.클래스로부터 생성되는 객체들이 공유하는
* 변수(메쏘드)이다.
* -->공용변수(메쏘드)라고도한다.
*
* -형식:
* 멤버변수: public static int i;
* 멤버메쏘드:public static void print(){}
*
*/
public class Static {
public int instance_variable;
public static int static_variable;
public void instance_method(){
System.out.println("instance_method() 호출");
}
public static void static_method(){
}
}
```
UpperALowerAThreadPriorityMain.java
```package thread.control;
public class UpperALowerAThreadPriorityMain {
public static void main(String[] args) {
UpperAThread ua = new UpperAThread();
LowerAThread la = new LowerAThread();
ua.setPriority(3);
la.setPriority(8);
ua.start();
la.start();
}
}
```
ResultSetMetaDataMain.java
```package jdbc.resultset;
import java.sql.Connection;
import java.sql.ResultSet;
import java.sql.ResultSetMetaData;
import java.sql.Statement;
import jdbc.member.ConnectionFactory;
public class ResultSetMetaDataMain {
public static void main(String[] args) throws Exception{
Connection con = ConnectionFactory.getConnection();
Statement stmt = con.createStatement();
String anySql = "select * from emp";
stmt.executeQuery(anySql);
ResultSet rs = stmt.executeQuery(anySql);
ResultSetMetaData rsmd = rs.getMetaData();
int columnCount = rsmd.getColumnCount();
System.out.println("column count : " + columnCount);
for(int i=1;i<=columnCount;i++){
System.out.println("--------------"+i+"번째 컬럼-------------");
System.out.println("컬럼이름 : "+rsmd.getColumnName(i));
System.out.println("컬럼DB타입 : "+rsmd.getColumnTypeName(i));
System.out.println("NULL허용여부 : "+rsmd.isNullable(i));
System.out.println("컬럼자바타입 : "+rsmd.getColumnClassName(i));
System.out.println("컬럼디스플레이사이즈 : "+rsmd.getColumnDisplaySize(i));
}
}
}
```
SetMain.java
```package com.itwill.collection;
import java.util.HashSet;
import java.util.Iterator;
public class SetMain {
public static void main(String[] args) {
Object[] oa = new Object[2];
oa[0] = new Account();
oa[1] = new Account();
for (int i = 0; i < oa.length; i++) {
Account tempAcc= (Account)oa[i];
tempAcc.print();
}
/***********기본형(Wrapper,String)******************/
HashSet pSet = new HashSet();
System.out.println("1. size" + pSet.size());
pSet.add(56);
pSet.add(61);
pSet.add(90);
pSet.add(88);
pSet.add(78);
pSet.add(new Integer(97));
boolean isAdd = pSet.add(88);
System.out.println();
System.out.println("2.size " + pSet.size());
System.out.println("3.set 구조 " + pSet.toString());
boolean isRemove = pSet.remove(56);
System.out.println("6.remove set : " + pSet);
if(pSet.contains(90)){
System.out.println("pSet.contains(90):" + pSet.contains(90));
}
Object[] objectsArray = pSet.toArray();
for (int i = 0; i < objectsArray.length; i++) {
Integer tempInt = (Integer)objectsArray[i];
int tint = tempInt.intValue();
System.out.print(tint+",");
}
System.out.println(" ");
/*************Interaction**************/
Iterator setIter = pSet.iterator();
while (setIter.hasNext()) {
Integer wi = (Integer)setIter.next();
System.out.print(wi+",");
}
System.out.println(" ");
/*************참조형******************/
HashSet rSet = new HashSet();
Account acc1 = new Account("1111", "KIM", 120000, 1.5f);
Account acc2 = new Account("2222", "LEE", 80000, 2.5f);
Account acc3 = new Account("3333", "PARK", 6000, 9.5f);
Account acc4 = new Account("4444", "MO", 50000, 4.2f);
Account acc5 = new Account("5555", "KIM", 161000, 10.8f);
Account acc6 = new Account("6666", "LEE", 125000, 3.2f);
System.out.println("1.set size " + rSet.size());
rSet.add(acc1);
rSet.add(acc2);
rSet.add(acc3);
rSet.add(acc4);
rSet.add(acc5);
rSet.add(acc6);
System.out.println("2.set size " + rSet.size());
isAdd = rSet.add(acc5);
System.out.println("3.isAdd " + isAdd);
rSet.remove(acc3);
System.out.println("4.remove set size : " + rSet.size());
System.out.println("5.set 구조" + rSet);
System.out.println("6.전체출력(iteration)");
Iterator rSetInter = rSet.iterator();
while (rSetInter.hasNext()) {
Account tAccout = (Account) rSetInter.next();
System.out.println(tAccout);
}
}
}
```
ObjectCasting.java
```/*
객체의 형변환
1. 부모자식관계에있는 클래스들에서만 가능하다.
2. 자식객체를 부모클래스타입으로 형변환
- 자동으로 이루어진다(묵시적)
Child c = new Child();
Parent pppp = c;
3. 부모 객체를 자식클래스타입으로 형변환
- 원칙적으로는 불가능하다
- 부모의 탈을쓴 자식객체 는 가능하다.
Parent p=new Parent();
Child cccc = p;(X)
public class Parent{}
public class Child extends Parent{}
*/
public class ObjectCasting {
}
```
StaticMain.java
```
public class StaticMain {
public static void main(String[] args) {
//** 정적변수, 정적메쏘드 접근(실행) **
/*
* 클래스이름, 정적멤버변수
* 클래스이름, 정적메쏘드()
*/
Static.static_variable = 777;
System.out.println("Static.static_variable : " + Static.static_variable);
Static.static_method();
// **객체변수,메쏘드 접근(실행)**
Static st =new Static();
st.instance_variable=888;
System.out.println(st.instance_variable);
st.instance_method();
Static st1 =new Static();
st1.instance_variable=999;
System.out.println(st1.instance_variable);
st1.instance_method();
System.out.println("-----------------");
}
}
```
ChatFrame.java
```package event;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.FlowLayout;
import java.awt.Font;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.Panel;
import java.awt.TextArea;
import java.awt.TextField;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import java.awt.event.WindowListener;
public class ChatFrame extends Frame {
Label chatL;
TextArea chatTA;
Panel chatP;
TextField chatTF;
Button chatB;
public ChatFrame(){
setTitle("ㅋㅋ 채팅");
setFont(new Font(Font.DIALOG,Font.BOLD, 12));
chatL = new Label("ㅋㅋ 채팅",Label.CENTER);
chatL.setBackground(Color.GREEN);
chatL.setForeground(Color.PINK);
chatTA = new TextArea();
chatTA.setEnabled(false);
chatTA.setText("경호:이따만나요~~~");
chatP = new Panel();
chatTF = new TextField(20);
chatB = new Button("전송");
chatP.setLayout(new FlowLayout());
chatP.add(chatTF);
chatP.add(chatB);
setLayout(new BorderLayout());
add(chatL,BorderLayout.NORTH);
add(chatTA,BorderLayout.CENTER);
add(chatP,BorderLayout.SOUTH);
/*
addWindowListener(new WindowListener() {
public void windowOpened(WindowEvent e) {
}
public void windowIconified(WindowEvent e) {
}
public void windowDeiconified(WindowEvent e) {
}
public void windowDeactivated(WindowEvent e) {
}
public void windowClosing(WindowEvent e) {
System.exit(0);
}
public void windowClosed(WindowEvent e) {
}
public void windowActivated(WindowEvent e) {
}
});*/
addWindowListener(new WindowAdapter() {
@Override
public void windowClosing(WindowEvent e) {
System.exit(0);
}
});
SendHandler sendHandler = new SendHandler();
chatB.addActionListener(sendHandler);
chatTF.addActionListener(sendHandler);
setSize(300, 400);
setVisible(true);
}
/***********member inner class*************/
public class SendHandler implements ActionListener{
@Override
public void actionPerformed(ActionEvent e) {
Object sourceObject = e.getSource();
if(sourceObject instanceof Button){
System.out.println("Button");
}else if(sourceObject instanceof TextField){
System.out.println("TextField");
}
String chatStr=chatTF.getText();
if(chatStr.equals("")){
return;
}
//network전송
chatTF.setText("");
chatTA.append("지수:"+chatStr+"\n");
return;
}
}
/******************************************/
public static void main(String[] args) {
new ChatFrame();
}
}
```
MemberDaoMain.java
```package file.member;
import java.util.ArrayList;
public class MemberDaoMain {
public static void main(String[] args)throws Exception {
//create
MemberDao memberDao=new MemberDao();
int isCreate = memberDao.createMember(new Member(1, "김경호", 30, "SEOUL"));
memberDao.createMember(new Member(2, "정경호", 33, "LA"));
memberDao.createMember(new Member(3, "심경호", 34, "SEOUL"));
memberDao.createMember(new Member(4, "양경호", 29, "BUSAN"));
memberDao.createMember(new Member(5, "박경호", 28, "DAEGU"));
memberDao.createMember(new Member(6, "민경호", 25, "ILSAN"));
//read
Member findMember=memberDao.findByNo(2);
System.out.println("----------findByNo(2)-------");
System.out.println(findMember);
//update
memberDao.updateMember(null);
//delete
memberDao.deleteMember(3);
System.out.println("---------전체출력-----------");
ArrayList<Member> memberList=memberDao.findByAll();
for (Member member : memberList) {
System.out.println(member);
}
}
}
```
YS.java
```package korea.president;
public class YS {
public int a;
protected int b;
int c;
private int d;
public void a(){
System.out.println("public method a();");
}
protected void b(){
System.out.println("protected method b();");
}
void c(){
System.out.println("method c();");
}
private void d(){
System.out.println("private method a();");
}
}
```
JavaPackageImportMain.java
```import java.io.File;
import java.io.InputStream;
import java.net.Socket;
public class JavaPackageImportMain {
public static void main(String[] args) {
/*
* java.lang package는 자동 import된다.
*/
String str;
System.gc();
InputStream in;
Socket s;
File f;
}
}
```
DeptDao.java
```package jdbc.dept;
import java.util.List;
import java.util.Map;
/**
* dept 테이블과 관련된 비즈니스 규약 메소드 선언
* @author
*/
public interface DeptDao {
// 부서 수정
public void update(Dept deparment) throws Exception;
// 부서 등록
public void insert(Dept deparment) throws Exception;
// 부서번호로 부서정보 반환
public Dept selectByNo(int deptno) throws Exception;
// 부서 전체목록 반환
public List<Dept> selectByAll() throws Exception;
// 사원정보(부서명포함) 전체목록 반환
public List<Map<String,Object>> selectEmployees() throws Exception;
}
```
Second.java
```
public class Second {
public void second() throws Exception{
System.out.println("Second.second()½ÇÇà");
Third t=new Third();
t.third();
System.out.println("Second.second()¹Ýȯ");
}
}
```
InsertDeleteUpdateSelectMemberTableMain.java
```package jdbc.basic;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
public class InsertDeleteUpdateSelectMemberTableMain {
public static void main(String[] args) {
String driverClass = "oracle.jdbc.driver.OracleDriver";
String url="jdbc:oracle:thin:@172.16.2.29:1521:XE";
String user="scott";
String password="tiger";
Connection con = null;
Statement stmt=null;
ResultSet rs=null;
String insertSql="insert into member(no,id,name,phone,address) "
+ "values(10,'guard10','왕경호','010-554-8437','경기도민')";
String deleteSql="delete from member where no=10";
String updateSql="update member set phone='000-000-0000' where no>5";
String selectSql="select * from member";
try{
Class.forName(driverClass);
con=DriverManager.getConnection(url,user,password);
stmt = con.createStatement();
int insertRow = stmt.executeUpdate(insertSql);
System.out.println("1.memeber insert : "+ insertRow + "행이 삽입");
int deleteRows = stmt.executeUpdate(deleteSql);
System.out.println("2.member delete : " + deleteRows + "행이 삭제");
int updateRows = stmt.executeUpdate(updateSql);
System.out.println("3.member update : " + updateRows + "행이 갱신");
rs = stmt.executeQuery(selectSql);
System.out.println("--------------------------------------------");
System.out.println("no \t id \t name \t phone \t\t address");
System.out.println("--------------------------------------------");
while(rs.next()){
int no = rs.getInt("no");
String id =rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
System.out.println(no+" \t "+id+" \t "+name+" \t "+phone+" \t\t "+address);
}
}catch(Exception e){
System.out.println("ERROR MSG : " + e.getMessage());
e.printStackTrace();
}finally{
try {
if(rs != null)
rs.close();
if(stmt != null)
stmt.close();
if(con != null)
con.close();
} catch (SQLException e) {
e.printStackTrace();
}
}
}
}
```
CreateMemberTableMain.java
```package jdbc.basic;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.Statement;
public class CreateMemberTableMain {
public static void main(String[] args) {
String driverClass = "oracle.jdbc.driver.OracleDriver";
String url="jdbc:oracle:thin:@172.16.2.29:1521:XE";
String user="scott";
String password="tiger";
Connection con = null;
Statement stmt=null;
String createSql="create table member("
+ "no number(4) primary key,"
+ "id varchar2(20),"
+ "name varchar2(20),"
+ "phone varchar2(20),"
+ "address varchar2(60))";
String dropSql="drop table member";
try{
Class.forName(driverClass);
con=DriverManager.getConnection(url,user,password);
stmt=con.createStatement();
int dropSuccess = stmt.executeUpdate(dropSql);
System.out.println("0.table drop success : " + dropSuccess);
int isSuccess = stmt.executeUpdate(createSql);
System.out.println("1.table create success : " + isSuccess);
}catch(Exception e){
System.out.println(e.getMessage());
e.printStackTrace();
}
}
}
```
SQLMinus.java
```package jdbc.sqlminus;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.sql.Connection;
import java.sql.Statement;
import jdbc.member.ConnectionFactory;
public class SQLMinus {
public static void main(String[] args) throws Exception{
Connection con = ConnectionFactory.getConnection();
Statement stmt = con.createStatement();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
while(true){
try{
System.out.print("SQL>");
String readSql = br.readLine();
boolean isRs = stmt.execute(readSql);
if(isRs){
//ResultSet
}else{
//update count
int updateCount = stmt.getUpdateCount();
System.out.println(updateCount + "ÇàÀÌ º¯°æ");
}
}catch(Exception e){
System.out.print("ERROR : " + e.getMessage());
}
}
}
}
```
DayTimeClient.java
```package client;
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.net.Socket;
public class DayTimeClient {
public static void main(String[] args) throws Exception{
//1.¿¬°á
Socket socket=new Socket("172.16.2.1",8000);
//2.Àбâ
InputStream in=socket.getInputStream();
/*
* byte stream --> Reader
* InputStreamReader: bridge stream
*/
InputStreamReader isr=new InputStreamReader(in);
BufferedReader br=new BufferedReader(isr);
String readLine=br.readLine();
System.out.println("client:"+readLine);
}
}
```
AwtTestMain.java
```package basic;
import java.awt.Color;
import java.awt.Frame;
/*
*
GUI 프로그램방법
1. 컨테이너준비(Frame,Dialog,Window)
2. 컴포넌트 준비 (Button,List,Canvas,TextArea,TextField)
3. 컨테이너에 컴포넌트를 부친다(add)
4. 컨테이너의 크기설정
5. 컨테이너 보여주기.
*/
public class AwtTestMain {
public static void main(String[] args) {
Frame f = new Frame();
f.setSize(300, 400);
f.setVisible(true);
f.setBackground(new Color(0xaa0000));
f.setTitle("나의 첫번째 프레임");
ExtendsFrame f1 = new ExtendsFrame();
ContainerFrame f2 = new ContainerFrame();
}
}
```
Student.java
```
public class Student extends Person{
public String clazz;
public Student() {
}
public Student(int no,String name, String clazz){
this.no = no;
this.name = name;
this.clazz = clazz;
}
public String getClazz() {
return clazz;
}
public void setClazz(String clazz) {
this.clazz = clazz;
}
/*public void studentPrint(){
//this.print();
System.out.println(no + "\t" + name + "\t" + clazz);
}*/
@Override
public void print(){
/*
* super : 은폐된멤버에 접근가능한 slef참조변수
*/
//super.print();
System.out.println(no + "\t" + name + "\t" + clazz);
}
}
```
ParkingManager.java
```package com.itwill.parking.manager;
/*
* 주차관리 클래스
*/
public class ParkingManager {
private Car[] parkingArray;
public ParkingManager() {
parkingArray = new Car[30];
}
public ParkingManager(int number){
parkingArray = new Car[number];
}
// 입차
public void ipCha(Car inCar) {
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]==null){
parkingArray[i]=inCar;
break;
}
}
}
public int getCarCount() {
int count = 0;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null){
count++;
}
}
return count;
}
public void printAll() {
Car.headerPrint();
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null){
parkingArray[i].print();
}
}
}
public Car findByCarNo(String no) {
Car tempNo = null;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null && parkingArray[i].getNo().equals(no)){
tempNo = parkingArray[i];
}
}
return tempNo;
}
public Car[] findByCarInTime(int intime) {
int count = 0;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null && parkingArray[i].getInTime()>=intime){
count += 1;
}
}
Car[] tempNo = new Car[count];
int temp = 0;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null && parkingArray[i].getInTime()>=intime){
tempNo[temp] = parkingArray[i];
temp++;
}
}
return tempNo;
}
public Car findByCarNoandOut(String no, int outtime) {
Car tempNo = null;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null && parkingArray[i].getNo().equals(no)){
parkingArray[i].setOutTime(outtime);
parkingArray[i].calculateFee();
tempNo = parkingArray[i];
}
}
return tempNo;
}
public String deleteByNo(String no) {
String tempNo = null;
for (int i = 0; i < parkingArray.length; i++) {
if(parkingArray[i]!=null && parkingArray[i].getNo().equals(no)){
parkingArray[i] = null;
tempNo = no + "삭제되었습니다.";
}
}
return tempNo;
}
}
```
Lotto.java
```package com.itwill.lotto;
public class Lotto {
int[] numbers = new int[6];
public void generateNumber() {
int lottoNumber = (int)(Math.random()*45)+1;
//Math.random();
for (int i = 0; i < numbers.length; i++) {
lottoNumber = (int)(Math.random()*45)+1;
numbers[i] = lottoNumber;
for (int j = 0; j < i; j++) {
if(numbers[i] == numbers[j]){
lottoNumber = (int)(Math.random()*45)+1;
numbers[i] = lottoNumber;
i = i-1;
break;
}
}
}
}
}
```
StudentManagerMain.java
```package com.itwill.sungjuk.manager;
public class StudentManagerMain {
public static void main(String[] args) {
StudentManager students = new StudentManager();
//1.전체성적계산(석차)
System.out.println("1.전체성적계산(석차)");
Student.headerPrint();
students.print();
//2.반전체평균
System.out.println("2.반전체평균" );
double stuAveAll = students.getStuAveAll();
System.out.println("반전체평균" + stuAveAll);
//3.학번(이름,평균,평점)으로찾아 출력
System.out.println("-------------------------------------------" );
System.out.println("3-1. 학생 KANG 찾아 출력" );
Student[] studentsName = students.getStudentsName("KIM");
Student.headerPrint();
for (int i = 0; i < studentsName.length; i++) {
studentsName[i].print();
}
System.out.println("3-2. 평균 74이 찾아 출력" );
Student[] studentsAve = students.getStudentsAve((double)80.0);
Student.headerPrint();
for (int i = 0; i < studentsAve.length; i++) {
studentsAve[i].print();
}
System.out.println("3-3. 평점 C 찾아 출력 ");
Student[] studentsGrade = students.getStudentsGrade('C');
Student.headerPrint();
for (int i = 0; i < studentsGrade.length; i++) {
studentsGrade[i].print();
}
//4.갱신(학번 8234번인학생의 성적 0점처리 )
System.out.println("4.갱신(학번 8234번인학생의 성적 0점처리 )");
Student studentNo = students.getStudentNo(8234,0,0,0);
Student.headerPrint();
studentNo.print();
//5.학생객체 석차순으로 정렬(오름차순)
System.out.println("5.학생객체 석차순으로 정렬(오름차순)");
Student.headerPrint();
students.rankChangePrint();
}
}
```
AnnonymousLocalInnerClass.java
```import java.awt.Color;
import java.awt.Frame;
public class AnnonymousLocalInnerClass {
Object o=new Object(){
public String toString() {
return "하하하";
};
};
public void method(){
System.out.println(o);
//MemberInnerClass mic=new MemberInnerClass();
Object ochild=new Object(){
@Override
public String toString() {
return "헤헤헤";
}
};
System.out.println(ochild);
Frame f=new Frame(){
@Override
public void setTitle(String title) {
super.setTitle("나의소중한 프레임");
}
@Override
public void setBackground(Color bgColor) {
super.setBackground(Color.RED);
}
};
f.setTitle("dfasghfgfhsdgfsd");
f.setBackground(Color.ORANGE);
f.setSize(300,400);
f.setVisible(true);
MyInterface mi=new MyInterface(){
@Override
public void test1() {
System.out.println("MyInterface.test1() implement");
}
@Override
public void test2() {
System.out.println("MyInterface.test2() implement");
}
};
mi.test1();
mi.test2();
}
//public class MemberInnerClass extends
}
```
Parent.java
```/*
* 상속(클래스의 관계):
* 부모클래스(객체)의 멤버들을 자식클래스(객체)가 물려받는것
*
* 1. 상속을 사용하는이유--> 기존에 만들어놓은 클래스의 재사용,
* 확장을위해사용한다.
* 2. 자바에서는 단일상속만이 가능하다(부모클래스가 한개만가능)
* 3. 부모클래스(super)와 자식클래스(sub)가존재한다.
* 4. 자바에서 제공되어지는 모든 클래스들은 Object 라고하는
* 최상위 클래스로부터 상속되어진다.
* 5. 사용자정의 클래스들도 Object 클래스라는 최상위클래스를
* 상속 받아야한다.
*
*/
public class Parent extends Object{
public String member1;
public void method1(){
System.out.println("Parent.method1()" + this.member1);
}
}
```
UnaryOperator.java
```/*
단항연산자
- 증가,감소연산자
ex> i++ , i-- , ++i , --i
- 자기자신의값을 정수 1만큼 증가시키거나 감소시키는
연산자
*/
public class UnaryOperator {
public static void main(String[] args) {
int i1 = 5;
int j1 = 5;
i1++; // i1=i1+1
++j1; // j1=j1+1
System.out.println("i1 = "+ i1);
System.out.println("j1 = "+ j1);
i1--; //i1=i1-1
--j1; //j1=j1-1
System.out.println("i1 = "+ i1);
System.out.println("j1 = "+ j1);
i1=5;
j1=5;
int result1,result2;
result1 = ++i1;
result2 = j1++;
System.out.println("i1 = " + i1);
System.out.println("j1 = " + j1);
System.out.println("result1 = " + result1);
System.out.println("result2 = " + result2);
}
}
```
ExtendsThread.java
```package thread.create;
public class ExtendsThread extends Thread {
@Override
public void run() {
System.out.println("A."+Thread.currentThread().getName()+" ½ÇÇà");
System.out.println("A."+Thread.currentThread().getName()+" ¹Ýȯ");
while(true){
System.out.println(Thread.currentThread().getName());
}
}
}
```
AcademyMain.java
```
public class AcademyMain {
public static void main(String[] args) {
Student st1 = new Student(1,"KIM","OFFICE");
Student st2 = new Student(2,"SIM","JAVA");
Student st3 = new Student(3,"LIM","WEB DESIGN");
Staff sf1 = new Staff(3, "LEE", "MARKETING");
Staff sf2 = new Staff(4, "CHOI", "EDUCATION");
Gangsa gs1 = new Gangsa(5,"PARK","LINUX");
Gangsa gs2 = new Gangsa(6,"HWANG","NETWORK");
Student[] students = new Student[3];
Staff[] staffs = new Staff[2];
Gangsa[] gangsas = new Gangsa[2];
students[0] = st1;
students[1] = st2;
students[2] = st3;
staffs[0] = sf1;
staffs[1] = sf2;
gangsas[0] = gs1;
gangsas[1] = gs2;
System.out.println("-----------학생-----------");
for (int i = 0; i < students.length; i++) {
students[i].studentPrint();
}
System.out.println("-----------스텝-----------");
for (int i = 0; i < staffs.length; i++) {
staffs[i].staffPrint();
}
System.out.println("-----------강사-----------");
for (int i = 0; i < gangsas.length; i++) {
gangsas[i].gangsaPrint();
}
}
}
```
Engine.java
```
public class Engine {
private String type; //엔진타입
private int cc; //엔진배기량
public Engine(){
}
public void print(){
System.out.println("엔진타입 : " + type);
System.out.println("엔진배기량 : " + cc);
}
//getter, setter
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
public int getCc() {
return cc;
}
public void setCc(int cc) {
this.cc = cc;
}
}
```
AcademyManagerMain.java
```package com.itwill.academy.manager;
public class AcademyManagerMain {
public static void main(String[] args) {
AcademyManager academyManager = new AcademyManagerImpl();
System.out.println("-----------전체출력-------------");
academyManager.addPerson(new Student(1,"KIM","JAVA"));
academyManager.addPerson(new Staff(2,"LEE","MARKERTING"));
academyManager.addPerson(new Gangsa(3,"CHOI","LINUX"));
academyManager.addPerson(new Student(4,"SIN","JAVA"));
academyManager.addPerson(new Student(5,"HONG","JAVA"));
academyManager.addPerson(new Staff(6,"KIM","LINUX"));
academyManager.addPerson(new Staff(7,"ANGEL","WINNT"));
academyManager.addPerson(new Gangsa(8,"KEN","ORACLE"));
academyManager.addPerson(new Gangsa(9,"MARK","LINUX"));
academyManager.addPerson(new Student(10,"SAM","JAVA"));
academyManager.addPerson(new Student(11,"WILL","JAVA"));
academyManager.allPrint();
System.out.println("-----------2번학생삭제----------");
academyManager.deletePerson(2);
//academyManager.allPrint();
System.out.println("---1번 KANG LINUX로 변경----");
Student studentDto=new Student(1,"KANG","LINUX");
academyManager.updatePerson(studentDto);
//academyManager.allPrint();
System.out.println("---4번 LEE 원장으로 변경-----");
Staff staffDto=new Staff(4,"LEE","원장");
academyManager.updatePerson(staffDto);
//academyManager.allPrint();
System.out.println("--자바반 학생들--");
Person[] personArray = academyManager.findByEtc(AcademyManager.BAN, "JAVA");
for (int i = 0; i < personArray.length; i++) {
personArray[i].print();
}
System.out.println("--리눅스반 강사--");
personArray = academyManager.findByEtc(AcademyManager.SUBJECT, "LINUX");
for (int i = 0; i < personArray.length; i++) {
personArray[i].print();
}
System.out.println("--부서 - 원장--");
personArray = academyManager.findByEtc(AcademyManager.DEPART, "원장");
for (int i = 0; i < personArray.length; i++) {
personArray[i].print();
}
}
}
```
CalendarMain.java
```package com.itwill.calendar;
import java.util.Calendar;
public class CalendarMain {
public static void main(String[] args) {
Calendar ca = Calendar.getInstance();
int year = ca.get(Calendar.YEAR);
int month = ca.get(Calendar.MONTH)+1;
int date = ca.get(Calendar.DATE);
int hour = ca.get(Calendar.HOUR_OF_DAY);
int min = ca.get(Calendar.MINUTE);
int sec = ca.get(Calendar.SECOND);
System.out.println("현재시간 : " + year + "년 " + month + "월 " + date + "일 " + hour + "시 " + min + "분 " + sec + "초");
}
}
```
Car.java
```
public class Car {
//차량생상대수를 저장할 공용변수
public static int count;
private String model;
private String color;
private int cc;
/*
* alt+shift+s --> r (getter,setter)
* alt+shift+s --> o (생성자)
*/
public Car(String model, String color, int cc) {
this.model = model;
this.color = color;
this.cc = cc;
Car.count++;
}
public void instance_static_access(){
System.out.println(this.model);
System.out.println(Car.count);
//System.out.println(this.count);
}
/*
* static context (method,block)내에서 this 사용불가
*/
public static void static_instance_access(){
//System.out.println(this.model);
System.out.println(Car.count);
System.out.println(count);
//System.out.println(this.count);
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
public int getCc() {
return cc;
}
public void setCc(int cc) {
this.cc = cc;
}
}
```
Student.java
```package com.itwill.sungjuk.method;
public class Student {
//멤버변수(속성)
/*
no,이름,국어,영어,수학,총점,평균,평점
*/
private int stuNo;
private String stuName;
private int stuKor;
private int stuEng;
private int stuMath;
private int stuScore;
private double stuAve;
private char stuGrade;
//data setter
public void setData(int stuNo , String stuName , int stuKor , int stuEng , int stuMath){
this.stuNo=stuNo;
this.stuName=stuName;
this.stuKor=stuKor;
this.stuEng=stuEng;
this.stuMath=stuMath;
}
//멤버메쏘드
//총점계산
public void stuSum(){
this.stuScore = this.stuKor + this.stuEng + this.stuMath;
}
//평균계산
public void stuAveCalc(){
this.stuAve = ((double)((int)(((double)stuScore/3)*100)))/100;
}
//평점계산
public void stuGradeCalc(){
this.stuGrade = ' ';
if (this.stuAve >= 90){
this.stuGrade = 'A';
}else if (this.stuAve >= 80){
this.stuGrade = 'B';
}else if (this.stuAve >= 70){
this.stuGrade = 'C';
}else if (this.stuAve >= 60){
this.stuGrade = 'D';
}else{
this.stuGrade = 'F';
}
}
//header print
public void headerPrint(){
System.out.println("-------------------------------------------------------------");
System.out.println("학번\t이름\t국어\t영어\t수학\t총점\t평균\t평점");
System.out.println("-------------------------------------------------------------");
}
//print
public void print(){
System.out.println(stuNo + "\t" + stuName + "\t" + stuKor + "\t" + stuEng + "\t" + stuMath + "\t" + stuScore + "\t" + stuAve + "\t" + stuGrade);
System.out.println("-------------------------------------------------------------");
}
//get,set
public int getStuNo() {
return stuNo;
}
public void setStuNo(int stuNo) {
this.stuNo = stuNo;
}
public String getStuName() {
return stuName;
}
public void setStuName(String stuName) {
this.stuName = stuName;
}
public int getStuKor() {
return stuKor;
}
public void setStuKor(int stuKor) {
this.stuKor = stuKor;
}
public int getStuEng() {
return stuEng;
}
public void setStuEng(int stuEng) {
this.stuEng = stuEng;
}
public int getStuMath() {
return stuMath;
}
public void setStuMath(int stuMath) {
this.stuMath = stuMath;
}
public int getStuScore() {
return stuScore;
}
public void setStuScore(int stuScore) {
this.stuScore = stuScore;
}
public double getStuAve() {
return stuAve;
}
public void setStuAve(double stuAve) {
this.stuAve = stuAve;
}
public char getStuGrade() {
return stuGrade;
}
public void setStuGrade(char stuGrade) {
this.stuGrade = stuGrade;
}
}
```
Letter.java
```package thread;
public class Letter {
String letter;
int x = 10;
int y = 50;
public Letter(String letter) {
super();
this.letter = letter;
}
}
```
FileDemo.java
```package file;
import java.io.File;
import java.io.IOException;
public class FileDemo {
public static void main(String[] args) {
System.out.println("1.File 구분자:"+File.separator);
File file1 = new File("sample"+File.separator+"01.ArithmaticOerator.txt");
File file2 = new File("sample","00.VariableDeclare.txt");
System.out.println("2.file1 path: "+file1.getPath());
System.out.println("3.file1 name: "+file1.getName());
System.out.println("4.file1 parent dir: "+file1.getParent());
System.out.println("5.file1 absolute path: " + file1.getAbsolutePath());
System.out.println("----------------------------------");
System.out.println("6.file2 path: "+file2.getPath());
System.out.println("7.file2 name: "+file2.getName());
System.out.println("8.file2 parent dir: "+file2.getParent());
System.out.println("9.file2 absolute path: " + file2.getAbsolutePath());
//directory
File dir = new File("sample");
if(dir.isDirectory()){
System.out.println("10.DIR:"+dir.getName());
}else if(dir.isFile()){
System.out.println("10.FILE:"+dir.getName());
}
System.out.println("11.디렉토리안의 파일목록");
String[] fileNames = dir.list();
for (int i = 0; i < fileNames.length; i++) {
System.out.println("\t"+fileNames[i]);
}
System.out.println("12.디렉토리안의 파일객체목록");
File[] files=dir.listFiles();
for (int i = 0; i < files.length; i++) {
if(files[i].isDirectory()){
System.out.println("[DIR]"+files[i].getName());
File[] subFiles = files[i].listFiles();
for (int j = 0; j < subFiles.length; j++) {
if(subFiles[j].isDirectory()){
//Directory
}else if(subFiles[j].isFile()){
System.out.println("\t\t[FILE]"+subFiles[j].getName());
}
}
}else if(files[i].isFile()){
System.out.println("\t[FILE]"+files[i].getName());
}
}
System.out.println("13. -------root directory-------");
File[] roots = File.listRoots();
for (int i = 0; i < roots.length; i++) {
System.out.println(roots[i].getPath());
}
File cDrive = roots[0];
System.out.println("AbsolutePath : " + cDrive.getAbsolutePath());
//c drive 파일 디렉토리의 목록
System.out.println("14.--------c: drive-----------");
File[] cFiles = cDrive.listFiles();
for (int i = 0; i < cFiles.length; i++) {
if(cFiles[i].isDirectory()){
System.out.println("["+cFiles[i].getName()+"]");
}else if(cFiles[i].isFile()){
System.out.println("FILE" + cFiles[i].getName());
}
}
//directory
File newDir1 = new File("newDir1");
File newDir2 = new File("newDir2");
File newDir3 = new File("sample","newDir3");
//생성
newDir1.mkdir();
newDir2.mkdir();
newDir3.mkdir();
System.out.println("----directory 생성-------");
//이름변경
boolean isRename = newDir2.renameTo(new File("renameDir2"));
System.out.println("----directory rename-----" + isRename);
//삭제
boolean isDelete = newDir3.delete();
System.out.println("----directory delete-----" + isDelete);
//파일
//생성
File newFile1 = new File("newDir1","newFile1.txt");
File newFile2 = new File("newDir1","newFile2.txt");
try {
boolean isCreate = newFile1.createNewFile();
System.out.println("----file1 생성여부 : " + isCreate);
isCreate = newFile2.createNewFile();
System.out.println("----file2 생성여부 : " + isCreate);
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
isRename= newFile2.renameTo(new File("newDir1","renameFile2.txt"));
System.out.println("----file rename 여부 : " + isRename);
newFile2.deleteOnExit();
System.out.println("----file deleteOnExit()---");
}
}
```
CarArrayMain.java
```package com.itwill.parking.manager;
public class CarArrayMain {
public static void main(String[] args) {
Car[] carArray={
null,null,null,null,null,
null,new Car ("2665",3),null,null,null,
null,null,null,new Car("1456",6),null,
null,new Car("8578",10),null,new Car("3688",15),null,
null,null,null,null,null,
null,null,new Car("2449",16),null,null,
};
/*
Car[] carArray = new Car[30];
carArray[7] = new Car("1456" , 3);
carArray[29] = new Car("5553" , 4);
*/
/*
0.현재주차장 주차가능대수(주차장 주차차량대수)
1.입차
a.차객체생성(번호,입차시간)
b.차배열객체에 저장(null인곳에 저장)
2.전체차량 정보출력(null이아닌변수출력)
3.1456번 차량출차
a.1456번 차량찾기
b.현재시간셋팅,요금계산,영수증출력
c.1456번차량 삭제(carArray[7]=null;)
*/
System.out.println("0.현재주차장 주차가능대수(주차장 주차차량대수)");
int parkingV = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i]==null){
parkingV += 1;
}
}
System.out.println("주차가능대수 : " + parkingV);
int parkingCar = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i]!=null){
parkingCar += 1;
}
}
System.out.println("주차차량대수 : " + parkingCar);
System.out.println("1.입차 a.차객체생성(번호,입차시간)__b.차배열객체에 저장(null인곳에 저장)");
int temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("1596",13);
temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("1236",2);
temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("5468",2);
temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("4684",2);
temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("1567",2);
temp = 0;
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] == null ){
temp = i;
}
}
carArray[temp] = new Car ("4867",2);
//carArray[temp].carInPrint();
System.out.println("2.전체차량 정보출력(null이아닌변수출력)");
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] != null){
System.out.println(carArray[i].getNo() + "," + carArray[i].getInTime());
}
}
System.out.println("3.1456번 차량출차\n a.1456번 차량찾기\n b.현재시간셋팅,요금계산,영수증출력\n c.1456번차량 삭제(carArray[7]=null;)");
System.out.println("번호\t입차\t출차\t요금");
for (int i = 0; i < carArray.length; i++) {
if(carArray[i]!=null && carArray[i].getNo().equals("1456")){
carArray[i].setOutTime(22);
carArray[i].calculateFee();
carArray[i].print();
carArray[i]=null;
}
}
for (int i = 0; i < carArray.length; i++) {
if(carArray[i] != null){
carArray[i].carInPrint();
}
}
}
}
```
ConstructorMain.java
```
public class ConstructorMain {
public static void main(String[] args) {
Constructor c1;
c1 = new Constructor();
c1.print();
Constructor c2 = new Constructor (500);
c2.print();
Constructor c3 = new Constructor (600,700);
c3.print();
Constructor c4 = new Constructor();
c4.i=888;
c4.j=999;
c4.print();
}
}
```
JDBCFlowMain.java
```package jdbc.basic;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
/*
* 1. Driver Class Loading
* 2. Connection 积己
* 3. Statement 积己
* 4. submitting query
* 5. 搬苞 勤甸傅
*/
public class JDBCFlowMain {
public static void main(String[] args) {
String driverClass = "oracle.jdbc.driver.OracleDriver";
String url="jdbc:oracle:thin:@172.16.2.29:1521:XE";
String user="scott";
String password="tiger";
try {
/*
* 1. Driver Class Loading 积己
*/
Class.forName(driverClass);
/*
* 2. Connection 积己
*/
Connection con = DriverManager.getConnection(url,user,password);
System.out.println("1.Connection: "+con);
/*
* 3.Statement 积己
*/
Statement stmt = con.createStatement();
System.out.println("2.Statement : "+stmt);
/*
* 4. submitting query
*/
String selectSql ="SELECT EMPNO,ENAME,JOB FROM EMP";
ResultSet rs = stmt.executeQuery(selectSql);
System.out.println("3-1.ResultSet: " + rs);
//boolean isExist = rs.next();
System.out.println("-----------------------------");
System.out.println("EMPNO \t ENAME \t JOB");
System.out.println("-----------------------------");
while(rs.next()){
int empno = rs.getInt("EMPNO");
String ename=rs.getString("ENAME");
String job = rs.getString("JOB");
System.out.println(empno + "\t" + ename + "\t" + job);
}
System.out.println("-----------------------------");
String deleteSql="DELETE FROM EMP WHERE EMPNO>=8000";
int rows = stmt.executeUpdate(deleteSql);
System.out.println("3-2.rows: "+rows + "青捞 昏力");
/*
* 6.close
*/
System.out.println("6.close");
rs.close();
stmt.close();
con.close();
} catch (ClassNotFoundException e) {
System.out.println(e.getMessage());
} catch(SQLException e){
System.out.println(e.getMessage());
}
}
}
```
ListPanel.java
```package card.layout;
import java.awt.Color;
import java.awt.Panel;
public class ListPanel extends Panel {
public ListPanel() {
this.setBackground(Color.BLUE);
}
}
```
ChatServer.java
```package chat.server;
import java.net.ServerSocket;
import java.net.Socket;
/*
* 무한대기하면서 클라이어트의 소켓연결요청처리
*/
public class ChatServer {
public static void main(String[] args) {
ChatServerClientHandlerManager clientHandlerManager;
ServerSocket serverSocket=null;
try{
clientHandlerManager=new ChatServerClientHandlerManager();
serverSocket=new ServerSocket(8888);
while(true){
System.out.println("1.ChatServer: accept() 8888");
Socket socket=serverSocket.accept();
System.out.println("2.ChatServer socket생성:"+socket);
//생성된소켓의 유지관리
clientHandlerManager
.addClientHandler(
new ChatServerClientHandler(socket,clientHandlerManager));
}
}catch(Exception e){
e.printStackTrace();
}
}
}
```
VariableTypes.java
```
public class VariableTypes {
public static void main(String[] args) {
//논리형(데이터:true,false)
boolean bool1;
boolean bool2;
bool1 = true;
bool2 = false;
//문자형 (데이타: 'A' , 'b' , '김' , '햏')
System.out.println("------------문자형-----------");
char munja1, munja2, munja3, munja4,munja5,munja6;
munja1 = 'A';
munja2 = 'B';
munja3 = '김';
munja4 = '햏';
munja5 = 65;
munja6 = 45123;
System.out.println(munja1);
System.out.println(munja2);
System.out.println(munja3);
System.out.println(munja4);
System.out.println(munja5);
System.out.println(munja6);
//숫자형
//정수형(데이터:12,3,4,1234)
byte b;
short s;
int i;
long l;
b = 127;
s = 32767;
i = 2147483647;
l = 2147483648L;
//실수형(데이타: 0,1,10.0,10, 3.14159)
float f;
double d;
f = 1.0f;
d = 1.0;
//문자열형(객체형)
String str1,str2;
str1="자바반 화이팅!!";
str2="쉬세요!!";
String str3 = str1+str2;
System.out.println(str3);
}
}
```
ParentChildConstructorMain.java
```
public class ParentChildConstructorMain {
public static void main(String[] args) {
Child c = new Child();
Child c1 = new Child("a","b","c");
}
}
```
InterfaceImpl.java
```
public class InterfaceImpl implements Interface1,Interface2{
@Override
public void method1() {
System.out.println("Interface1.method1()구현(재정의)");
}
@Override
public void method2() {
System.out.println("Interface1.method2()구현(재정의)");
}
@Override
public void method3() {
System.out.println("Interface1.method3()구현(재정의)");
}
@Override
public void method4() {
System.out.println("Interface1.method4()구현(재정의)");
}
}
```
WebClientMain.java
```package web;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.net.Socket;
public class WebClientMain {
public static void main(String[] args) throws Exception{
//1.연결
Socket socket=new Socket("www.naver.com",80);
//2.웹서버로 데이타요청명령전송
String requestCommand="GET /index.html HTTP/1.0\r\n\r\n";
byte[] requestCommandBytes = requestCommand.getBytes();
OutputStream out=socket.getOutputStream();
out.write(requestCommandBytes);
out.flush();
//3.웹서버로부터오는데이타바끼..
InputStream in=socket.getInputStream();
InputStreamReader isr=new InputStreamReader(in,"UTF-8");
while(true){
int readChar=isr.read();
if(readChar==-1)break;
System.out.print((char)readChar);
}
out.close();
in.close();
}
}
```
StudentManager.java
```package com.itwill.sungjuk.manager;
public class StudentManager {
Student[] students = {
new Student(1234, "KIM", 90, 92, 96),
new Student(2234, "PARK", 51, 62, 95),
new Student(3234, "LEE", 85, 83, 84),
new Student(4234, "WON", 78, 73, 90),
new Student(5234, "KANG", 82, 70, 62),
new Student(6234, "CHOI", 92, 89, 98),
new Student(7234, "KIM", 92, 86, 91),
new Student(8234, "MO", 72, 52, 99),
new Student(9234, "KIM", 95, 52, 91),
new Student(1359, "PARK", 80, 85, 10)
};
public void getResult(){
for (int i = 0; i < students.length; i++) {
students[i].stuCalAll();
}
for (int j = 0; j < students.length; j++) {
int ranking = 1;
for (int k = 0; k < students.length; k++) {
if(students[j].getStuScore() < students[k].getStuScore()){
ranking += 1;
}
}
students[j].setStuRank(ranking);
}
}
public void print(){
getResult();
for (int i = 0; i < students.length; i++) {
students[i].print();
}
}
public double getStuAveAll() {
double stuAveAll = 0.00;
for (int i = 0; i < students.length; i++) {
stuAveAll += ( students[i].getStuAve() )/students.length;
}
stuAveAll = (double)((int)(((double)stuAveAll*100)+0.5))/100;
return stuAveAll;
}
public Student[] getStudentsName(String name) {
int count = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuName().equals(name)){
count++;
}
}
Student[] studentsName = new Student[count];
int temp = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuName().equals(name)){
studentsName[temp] = students[i];
temp++;
}
}
return studentsName;
}
public Student[] getStudentsAve(double ave) {
int count = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuAve() >= ave){
count++;
}
}
Student[] studentsAve = new Student[count];
int temp = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuAve() >= ave){
studentsAve[temp] = students[i];
temp++;
}
}
return studentsAve;
}
public Student[] getStudentsGrade(char grade) {
int count = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuGrade() == grade){
count++;
}
}
Student[] studentsGrade = new Student[count];
int temp = 0;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuGrade() == grade){
studentsGrade[temp] = students[i];
temp++;
}
}
return studentsGrade;
}
public Student getStudentNo(int no, int kor, int eng, int math) {
Student tempNo = null;
for (int i = 0; i < students.length; i++) {
if(students[i].getStuNo()==no){
students[i].setStuKor(kor);
students[i].setStuEng(eng);
students[i].setStuMath(math);
tempNo = students[i];
}
}
getResult();
return tempNo;
}
public void rankChangePrint(){
for (int i = 0; i < students.length; i++) {
for (int j = i; j < students.length; j++) {
if (students[j].getStuScore() < students[i].getStuScore()) {
Student mid = students[i];
students[i] = students[j];
students[j] = mid;
}
}
}
for (int i = 0; i < students.length; i++) {
students[i].print();
}
}
}
```
ParkingManagerCollection.java
```package com.itwill.parking.manager.collection;
import java.util.ArrayList;
public class ParkingManagerCollection {
private ArrayList<Car> parkingArray;
public ParkingManagerCollection() {
parkingArray = new ArrayList<Car>();
}
// ÀÔÂ÷
public void ipCha(Car inCar) {
parkingArray.add(inCar);
}
public int getCarCount() {
int count = 0;
count = parkingArray.size();
return count;
}
public void printAll() {
Car.headerPrint();
for (int i = 0; i < parkingArray.size(); i++) {
Car temp = (Car)parkingArray.get(i);
temp.print();
}
}
public Car findByCarNo(String no) {
Car tempNo = null;
for (int i = 0; i < parkingArray.size(); i++) {
Car temp = (Car)parkingArray.get(i);
if(temp.getNo().equals(no)){
tempNo = temp;
}
}
return tempNo;
}
public ArrayList<Car> findByCarInTime(int intime) {
ArrayList<Car> temp = new ArrayList<Car>();
for (int i = 0; i < parkingArray.size(); i++) {
Car tempCar = (Car)parkingArray.get(i);
if(tempCar.getInTime() >= intime){
temp.add(tempCar) ;
}
}
return temp;
}
public Car findByCarNoandOut(String no, int outtime) {
Car tempNo = null;
for (int i = 0; i < parkingArray.size(); i++) {
Car temp = (Car)parkingArray.get(i);
if(temp.getNo().equals(no)){
tempNo = temp;
tempNo.setOutTime(outtime);
tempNo.calculateFee();
tempNo.carOutPrint();
parkingArray.remove(i);
}
}
return tempNo;
}
}
```
Car.java
```
public class Car {
private int no;//차번호
private String model;//모델
//엔진
private Engine engine;
private int wheelNumber;//바퀴수
public Car(){
}
//setter,getter
public void setEngine(Engine engine){
this.engine = engine;
}
public Engine getEngine(){
return this.engine;
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public int getWheelNumber() {
return wheelNumber;
}
public void setWheelNumber(int wheelNumber) {
this.wheelNumber = wheelNumber;
}
public void print() {
System.out.println("번호 : " + no);
System.out.println("모델 : " + model);
//System.out.println("엔진 : " + engine.type);
this.engine.print();
System.out.println("휠수 : " + wheelNumber);
}
}
```
MemberDaoImpl.java
```package jdbc.member;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
import java.util.ArrayList;
/*
* member table 에 접근해서
* INSERT,UPDATE,DELETE,SELECT 작업을 하는 DAO(Data Access Object)객체
*/
public class MemberDaoImpl implements MemberDao{
@Override
public int insert(MemberDto member) throws Exception {
Connection con=null;
Statement stmt=null;
String insertSql="insert into member values("+member.getNo()+",'"
+member.getId()+"','"
+member.getName()+"','"
+member.getPhone()+"','"
+member.getAddress()+"')";
int row=0;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
row = stmt.executeUpdate(insertSql);
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
public int pinsert(MemberDto member) throws Exception {
Connection con=null;
PreparedStatement pstmt=null;
String insertSql="insert into member values(?,?,?,?,?)";
int row=0;
try {
con=ConnectionFactory.getConnection();
pstmt=con.prepareStatement(insertSql);
pstmt.setInt(1, member.getNo());
pstmt.setString(2, member.getId());
pstmt.setString(3, member.getName());
pstmt.setString(4, member.getPhone());
pstmt.setString(5, member.getAddress());
row = pstmt.executeUpdate();
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int delete(int no) throws Exception{
Connection con=null;
Statement stmt=null;
String insertSql="delete from member where no="+no;
int row=0;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
row = stmt.executeUpdate(insertSql);
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int update(MemberDto member) {
return 0;
}
@Override
public MemberDto selectByNo(int no) throws Exception{
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
MemberDto member = null;
String selectSql="select * from member where no="+no;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
rs=stmt.executeQuery(selectSql);
if(rs.next()){
int n = rs.getInt("no");
String id = rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
member = new MemberDto(n,id,name,phone,address);
}
} finally {
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}
return member;
}
@Override
public ArrayList<MemberDto> selectAll() {
return null;
}
}
```
AccountArrayMain.java
```package com.itwill.account.manager;
/*
* 계좌 1개의 정보를 가지고 있는 클래스
*/
public class AccountArrayMain {
public static void main(String[] args) {
Account[] accounts ={
new Account("1111", "KIM", 120000, 1.5f),
new Account("2222", "LEE", 80000, 2.5f),
new Account("3333", "PARK", 6000, 9.5f),
new Account("4444", "MO", 50000, 4.2f),
new Account("5555", "KIM", 161000, 10.8f),
new Account("6666", "LEE", 125000, 3.2f),
new Account("7777", "MOON", 25000, 9.5f),
new Account("8888", "NAM", 45600, 6.8f),
new Account("9999", "NA", 52000, 2.9f),
new Account("3000", "KIM", 99000, 3.0f)
};
/*
* 1. 전체계좌출력
* 2. 총잔고
* 3. 총계좌수
* 4. 계좌번호가 1111출력
* 5. 이름이 KIM인계좌출력
* 6. 계좌잔고 50000 이상인계좌출력
* 7. 이율이 8.0 이상인계좌출력
* 8. 입금:3333 번계좌에 3000워입금
* 9. 출름:9999 번계좌에서 10000원출금
* 10.계좌정보변경 : 3000번계좌 이율 10.F.
*/
System.out.println("1. 전체계좌출력");
accounts[0].headerPrint();
int tot=0;
for (int i = 0; i < accounts.length; i++) {
accounts[i].print();
tot += accounts[i].getBalance();
}
System.out.println("2. 총잔고 : " + tot);
System.out.println("3. 총계좌수 : " + accounts.length);
System.out.println("4. 계좌번호가 6666출력");
for (int i = 0; i < accounts.length; i++) {
String tempNo = accounts[i].getNo();
if (tempNo.equals("6666")){
accounts[i].print();
break;
}
}
System.out.println("5. 이름이 KIM인계좌들출력");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getOwner().equals("KIM")){
accounts[i].print();
}
}
System.out.println("6. 계좌잔고 50000 이상인계좌들출력");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getBalance()>50000){
accounts[i].print();
}
}
System.out.println("7. 이율이 8.0 이상인계좌들출력");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getIyul()>8.0f){
accounts[i].print();
}
}
System.out.println("8. 입금:3333 번계좌에 3000원입금");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals("3333")){
accounts[i].print();
accounts[i].ipGum(3000);
accounts[i].print();
}
}
System.out.println("9. 출금:9999 번계좌에서 10000원출금");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals("9999")){
accounts[i].chulGum(10000);
accounts[i].print();
}
}
System.out.println("10.계좌정보변경 : 3000번계좌 이율 5.0F");
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals("3000")){
accounts[i].print();
accounts[i].setIyul(5.0f);
accounts[i].print();
}
}
}
}
```
EncapsulationMain.java
```
public class EncapsulationMain {
public static void main(String[] args) {
Encapsulation ec = new Encapsulation();
System.out.println("---------------set----------------");
//ec.member1=123;
ec.setMember1(123);
//ec.member2="¸â¹ö";
ec.setMember2("¸â¹ö");
//ec.member3='±è';
ec.setMember3('±è');
System.out.println("---------------get----------------");
int m1=ec.getMember1();
System.out.println("member1 : " + m1);
System.out.println("member1 : " + ec.getMember2());
System.out.println("member1 : " + ec.getMember2());
}
}
```
GameFrame.java
```package thread;
import java.awt.Frame;
import java.awt.Graphics;
import java.awt.Image;
import java.awt.Toolkit;
import java.awt.event.MouseAdapter;
import java.awt.event.MouseEvent;
import java.awt.event.MouseListener;
public class GameFrame extends Frame implements MouseListener{
final static int LEFT=0;
final static int RIGHT=1;
Image backImage;
Image planeImage;
int pX, pY;// 비행기위치
boolean isAlive;
int direction;
GameThread gt;
public GameFrame() {
backImage = Toolkit.getDefaultToolkit().getImage("game_back.jpg");
planeImage = Toolkit.getDefaultToolkit().getImage("plane3.png");
pX = 30;
pY = 30;
isAlive=false;
direction=RIGHT;
//event
this.addMouseListener(new MouseAdapter() {
@Override
public void mouseClicked(MouseEvent e) {
int cX = e.getX();
if(cX>pX){
direction=RIGHT;
}else if(cX<pX){
direction=LEFT;
}
}
});
setSize(400, 400);
setVisible(true);
startGame();
}
public void startGame(){
gt=new GameThread();
isAlive=true;
gt.start();
}
public void stopGame(){
isAlive=false;
gt=null;
}
@Override
public void paint(Graphics g) {
g.drawImage(backImage, 0, 0, getWidth(), getHeight(), this);
g.drawImage(planeImage, pX, pY, this);
}
@Override
public void update(Graphics g) {
//전체지우기
paint(g);
}
/***************inner class*************/
/************* GameThread **************/
public class GameThread extends Thread {
@Override
public void run() {
while (isAlive) {
try {
Thread.sleep(100);
switch (direction) {
case RIGHT:
pX=pX+5;
pY=pY+1;
break;
case LEFT:
pX=pX-5;
pY=pY-1;
break;
}
if(pX<-planeImage.getWidth(GameFrame.this)){
pX=400;
}
if(pY<-planeImage.getHeight(GameFrame.this)){
pY=400;
}
if(pX>400){
pX = -planeImage.getWidth(GameFrame.this);
}
if(pY>400){
pY = -planeImage.getHeight(GameFrame.this);
}
repaint();
} catch (InterruptedException e) {
e.printStackTrace();
}
}//end while
}//end run
}//end inner class
/*************************************/
public static void main(String[] args) {
new GameFrame();
}
@Override
public void mouseClicked(MouseEvent e) {
// TODO Auto-generated method stub
}
@Override
public void mousePressed(MouseEvent e) {
// TODO Auto-generated method stub
}
@Override
public void mouseReleased(MouseEvent e) {
// TODO Auto-generated method stub
}
@Override
public void mouseEntered(MouseEvent e) {
// TODO Auto-generated method stub
}
@Override
public void mouseExited(MouseEvent e) {
// TODO Auto-generated method stub
}
}
```
CalculatorFrame.java
```package event;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.Font;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.Panel;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
public class CalculatorFrame extends Frame implements ActionListener {
Label displayL;
Panel buttonP;
String[] name = {"1" , "2" , "3" , "+",
"4" , "5" , "6" , "-",
"7" , "8" , "9" , "*",
"0" , "=" , "c" ,"/"};
Button[] allButton = new Button[name.length];
public CalculatorFrame() {
setTitle("허접계산기");
displayL = new Label();
displayL.setBackground(Color.LIGHT_GRAY);
displayL.setText("0");
displayL.setAlignment(Label.RIGHT);
displayL.setFont(new Font(Font.SANS_SERIF, Font.BOLD, 14));
displayL.setForeground(Color.DARK_GRAY);
buttonP = new Panel();
buttonP.setLayout(new GridLayout(0, 4, 3, 3));
setLayout(new BorderLayout());
add(displayL, BorderLayout.NORTH);
add(buttonP, BorderLayout.CENTER);
// event
this.addWindowListener(new WindowAdapter() {
@Override
public void windowClosing(WindowEvent e) {
System.exit(0);
}
});
for (int i = 0; i < name.length; i++) {
allButton[i] = new Button(name[i]);
buttonP.add(allButton[i]);
allButton[i].addActionListener(this);
}
setSize(200, 220);
setVisible(true);
}
public final static int FIRST_STATE=0;
public final static int SECOND_STATE=1;
public final static int THIRD_STATE=2;
String first="";
char op='+';
String second="";
String result="";
int firstNumber ;
int secondNumber;
int resultNumber;
boolean state = true;
int status=FIRST_STATE;
@Override
public void actionPerformed(ActionEvent e) {
Object sourceButton=e.getSource();
String cmd=e.getActionCommand();
if(cmd.equals("c")){
displayL.setText("0");
firstNumber = 0;
state = true;
}
if(cmd.charAt(0)>='0' && cmd.charAt(0)<='9'){
if(state){
displayL.setText("");
state = false;
}
displayL.setText(displayL.getText()+cmd);
}else{
System.out.print(""+firstNumber+op+displayL.getText()+"=");
switch (op) {
case '+':
firstNumber += Integer.parseInt(displayL.getText());
break;
case '-':
firstNumber -= Integer.parseInt(displayL.getText());
break;
case '*':
firstNumber *= Integer.parseInt(displayL.getText());
break;
case '/':
firstNumber /= Integer.parseInt(displayL.getText());
break;
}
displayL.setText(""+ firstNumber);
op = cmd.charAt(0);
state=true;
}
}
public static void main(String[] args) {
new CalculatorFrame();
}
}
```
CatchExceptionMain.java
```import java.io.FileInputStream;
import java.io.FileNotFoundException;
public class CatchExceptionMain {
public static void main(String[] args) {
System.out.println("stmt1");
try {
System.out.println("stmt2");
FileInputStream fis = new FileInputStream("a.txt");
Class.forName("First");
int r = 34/0;
System.out.println("stmt3");
} catch (FileNotFoundException e) {
System.out.println("stmt4-0");
System.out.println("FileNotFoundException MSG:"+e.getMessage());
System.out.println("stmt4-1");
} catch (ClassNotFoundException e) {
System.out.println("stmt5-0");
System.out.println("ClassNotFoundException MSG:"+e.getMessage());
System.out.println("stmt5-1");
} catch(Exception e){
System.out.println("stmt6-0");
System.out.println("¸ð¸£´ÂException MSG:"+e.getMessage());
System.out.println("stmt6-1");
}
System.out.println("stmt7");
/*
try {
Class.forName("aa");
} catch (ClassNotFoundException e) {
e.printStackTrace();
}
*/
System.out.println("-------------------------");
try {
System.out.println("stmt2");
FileInputStream fis = new FileInputStream("a.txt");
Class.forName("First");
int readByte=fis.read();
System.out.println((char)readByte);
int r = 34/0;
System.out.println("stmt3");
} catch(Exception e){
System.out.println("stmt4-0");
System.out.println("Exception MSG:"+e.getMessage());
e.printStackTrace();
System.out.println("stmt4-1");
}
System.out.println("stmt7");
//Class.forName("dd");
return;
}
}
```
Staff.java
```
public class Staff extends Person{
public String depart;
public Staff() {
// TODO Auto-generated constructor stub
}
public Staff(int no , String name , String depart) {
this.no = no;
this.name =name;
this.depart = depart;
}
public String getDepart() {
return depart;
}
public void setDepart(String depart) {
this.depart = depart;
}
/*public void staffPrint(){
System.out.println(no + "\t" + name + "\t" + depart);
}*/
@Override
public void print(){
System.out.println(no + "\t" + name + "\t" + depart);
}
}
```
ProductDao.java
```package com.itwill.shop.product;
public class ProductDao {
}
```
StringMain.java
```package com.itwill.lang;
public class StringMain {
public static void main(String[] args){
//명시적생성
String str1 = new String("자바");
String str2 = new String("자바");
char[] ca = {'자','바'};
String str3 = new String(ca);
//암시적생성
String str4 = "자바";
String str5 = "자바";
String str6 = "자바";
/*
* String 비교
*
* Object
* public boolean equals (Object obj)
* - 객체의 주소 비교
*
* String
* public boolean equals(Object anObject)
* - 스트링객체의 문자열비교
*/
System.out.println("1.----------equals---------");
if(str1==str2){
System.out.println("st1주소 == str2주소");
}else{
System.out.println("st1주소 != str2주소");
}
if(str1.equals(str2)){
System.out.println("str1문자열 = str문자열");
}else{
System.out.println("str1문자열 ! str문자열");
}
/*if(str4==str5){
System.out.println("str4주소 == str5주소");
}*/
if(str1=="자바"){
System.out.println("str1주소 = \"자바\"");
}
System.out.println("2.---------compareTo--------");
int result = "고경호".compareTo("김경호");
System.out.println(result);
result = "김경호".compareTo("고경호");
System.out.println(result);
result = "김경호".compareTo("김경호");
System.out.println(result);
System.out.println("---------compareTo--------");
String[] names = {"김경호","고경호","정경호","황경호","심경호"};
System.out.println("이름을 사전순으로 정렬");
int shortestStringIndex = 0;
for(int j=0; j < names.length - 1;j++)
{
shortestStringIndex = j;
for (int i=j+1 ; i<names.length; i++)
{
if(names[i].compareTo(names[shortestStringIndex])<0)
{
shortestStringIndex = i;
}
}
if(shortestStringIndex != j)
{
String temp = names[j];
names[j] = names[shortestStringIndex];
names[shortestStringIndex] = temp;
}
}
for (int i = 0; i < names.length; i++) {
System.out.println(names[i]);
}
System.out.println("3.-----------------");
String message = "오늘은 우리반 모두가 놀아요 ㅋㅋ";
System.out.println("String length : " + message.length());
/*
* String java.lang.String.substring(int beginIndex)
Returns a new string that is a substring of this string. The substring begins with
the character at the specified index and extends to the end of this string.
Examples:
"unhappy".substring(2) returns "happy"
"Harbison".substring(3) returns "bison"
"emptiness".substring(9) returns "" (an empty string)
*/
String sf = message.substring(8, 15);
System.out.println("substring(8,15) : " + sf);
sf = message.substring(8);
System.out.println("substring(8) : " + sf);
System.out.println("4.------split-------");
String cardNo="123-545-4554";
String [] cardNoArray = cardNo.split("-");
for (int i = 0; i < cardNoArray.length; i++) {
System.out.println(">>"+cardNoArray[i]);
}
System.out.println("5.--endsWith--");
String fileName="xxx.gif";
if(fileName.endsWith(".gif")){
System.out.println(".gif 형식의 그림파일이네요");
}
System.out.println("5.--startsWith--");
String[] nameArray = {"김경호","고경호","정경호","황경호","심경호"};
for (int i = 0; i < nameArray.length; i++) {
if(nameArray[i].startsWith("김")){
System.out.println(nameArray[i]);
}
}
System.out.println("6.--trim--");
/*
* A copy of this string with leading and trailing white space removed,
* or this string if it has no leading or trailing white space.
*/
String trimStr=" aa aa ";
trimStr = trimStr.trim();
System.out.println(trimStr);
System.out.println("6.--null String--");
String nullString = "";
System.out.println("length : " + nullString.length());
if(nullString.equals("")){
System.out.println("nullString.equals(\"\"):true");
}
String trueStr = String.valueOf(true);
System.out.println(trueStr);
String numberStr = String.valueOf(93.1552);
System.out.println(numberStr);
message = "오늘은 우리반 모두가 놀아요 ㅋㅋ";
char firstChar = message.charAt(0);
System.out.println("charAt(0) : " + firstChar);
for (int i = 0; i < message.length(); i++) {
char tempChar = message.charAt(i);
System.out.print((int)tempChar+",");
}
}
}
```
TypingGameFrame.java
```package thread;
import java.awt.Frame;
import java.awt.Graphics;
import java.util.ArrayList;
public class TypingGameFrame extends Frame{
ArrayList letterList1=new ArrayList();
ArrayList letterList2=new ArrayList();
private void init(){
letterList1.add(new Letter("자바"));
letterList1.add(new Letter("JAVA"));
letterList1.add(new Letter("javA"));
letterList1.add(new Letter("자바라"));
for (int i = 0; i < letterList1.size(); i++) {
Letter letter = (Letter)letterList1.get(i);
letter.x=(int)(Math.random()*10)*50;
}
}
public TypingGameFrame() {
init();
setSize(500, 500);
setVisible(true);
new LetterThread().start();
}
@Override
public void paint(Graphics g) {
for (int i = 0; i < letterList1.size(); i++) {
Letter letter=(Letter)letterList1.get(i);
g.drawString(letter.letter,letter.x,letter.y);
}
}
/**************Thread**********/
public class LetterThread extends Thread{
@Override
public void run() {
while (true) {
try {
Thread.sleep(500);
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
for (int i = 0; i < letterList1.size(); i++) {
Letter letter=(Letter)letterList1.get(i);
letter.y=letter.y + 5;
}
repaint();
}
}
}
public static void main(String[] args) {
new TypingGameFrame();
}
}
```
ChatFrame_copy.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.Panel;
import java.awt.TextField;
public class ChatFrame_copy extends Frame {
Button bSend;
Label nameL;
TextField chatroomTF;
TextField chatTF;
Panel northP;
Panel centerP;
Panel southP;
public ChatFrame_copy(){
bSend = new Button("Àü¼Û");
nameL = new Label("È«´Ô ´ëÈÁß");
chatroomTF = new TextField();
chatTF = new TextField();
northP = new Panel();
centerP = new Panel();
southP = new Panel();
northP.setBackground(Color.LIGHT_GRAY);
northP.setLayout(new GridLayout(0,1));
northP.add(nameL);
centerP.setBackground(Color.CYAN);
centerP.setLayout(new GridLayout(0,1));
centerP.add(chatroomTF);
southP.setBackground(Color.LIGHT_GRAY);
southP.setLayout(new BorderLayout());
southP.add(chatTF,BorderLayout.CENTER);
southP.add(bSend,BorderLayout.EAST);
setLayout(new BorderLayout());
add(northP,BorderLayout.NORTH);
add(centerP,BorderLayout.CENTER);
add(southP,BorderLayout.SOUTH);
setSize(300, 400);
setVisible(true);
}
public static void main(String[] args) {
new ChatFrame_copy();
}
}
```
PanelFrame.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.FlowLayout;
import java.awt.Frame;
import java.awt.Panel;
public class PanelFrame extends Frame{
Button b1,b2,b3;
Panel southP;
CenterPanel centerP;
public PanelFrame(){
/******************/
b1 = new Button("전송");
b2 = new Button("취소");
b3 = new Button("귓속말");
southP = new Panel();
southP.setBackground(Color.ORANGE);
southP.setLayout(new FlowLayout());
southP.add(b1);
southP.add(b2);
southP.add(b3);
/**********************/
centerP = new CenterPanel();
setLayout(new BorderLayout());
add(centerP,BorderLayout.CENTER);
add(southP,BorderLayout.SOUTH);
setSize(300,400);
setVisible(true);
}
public static void main(String[] args){
new PanelFrame();
}
}
```
MyDBDriver.java
```package jdbc.basic;
import java.sql.Connection;
import java.sql.Driver;
import java.sql.DriverManager;
import java.sql.DriverPropertyInfo;
import java.sql.SQLException;
import java.sql.SQLFeatureNotSupportedException;
import java.util.Properties;
import java.util.logging.Logger;
public class MyDBDriver implements Driver{
/*
* static block
* -클래스가 로딩되면 블록안의 코드가 실행된다.
*/
static{
System.out.println("1.자기자신의 Driver객체생성");
MyDBDriver mDriver = new MyDBDriver();
System.out.println("2.DriverManager 클래스에 등록");
try {
DriverManager.registerDriver(mDriver);
} catch (SQLException e) {
e.printStackTrace();
}
}
@Override
public Connection connect(String url, Properties info) throws SQLException {
// TODO Auto-generated method stub
return null;
}
@Override
public boolean acceptsURL(String url) throws SQLException {
// TODO Auto-generated method stub
return false;
}
@Override
public DriverPropertyInfo[] getPropertyInfo(String url, Properties info)
throws SQLException {
// TODO Auto-generated method stub
return null;
}
@Override
public int getMajorVersion() {
// TODO Auto-generated method stub
return 0;
}
@Override
public int getMinorVersion() {
// TODO Auto-generated method stub
return 0;
}
@Override
public boolean jdbcCompliant() {
// TODO Auto-generated method stub
return false;
}
@Override
public Logger getParentLogger() throws SQLFeatureNotSupportedException {
// TODO Auto-generated method stub
return null;
}
}
```
LoginDialog.java
```package card.layout;
import java.awt.BorderLayout;
import java.awt.Dialog;
import java.awt.Frame;
import java.awt.event.WindowEvent;
import java.awt.event.WindowListener;
public class LoginDialog extends Dialog implements WindowListener{
public LoginDialog(Frame owner, String title) {
super(owner, title);
this.addWindowListener(this);
setLayout(new BorderLayout());
setSize(200,100);
}
@Override
public void windowOpened(WindowEvent e) {
}
@Override
public void windowClosing(WindowEvent e) {
System.out.println("exit");
Frame owner=(Frame)this.getOwner();
owner.setTitle("³ Á״´Ù");
this.dispose();
}
@Override
public void windowClosed(WindowEvent e) {
// TODO Auto-generated method stub
}
@Override
public void windowIconified(WindowEvent e) {
// TODO Auto-generated method stub
}
@Override
public void windowDeiconified(WindowEvent e) {
// TODO Auto-generated method stub
}
@Override
public void windowActivated(WindowEvent e) {
// TODO Auto-generated method stub
}
@Override
public void windowDeactivated(WindowEvent e) {
// TODO Auto-generated method stub
}
}
```
MemberDaoImplZY.java
```package jdbc.member;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
import java.util.ArrayList;
/*
* member table 에 접근해서
* INSERT,UPDATE,DELETE,SELECT 작업을 하는 DAO(Data Access Object)객체
*/
public class MemberDaoImplZY implements MemberDao{
private String driverClass = "oracle.jdbc.driver.OracleDriver";
private String url="jdbc:oracle:thin:@172.16.2.29:1521:XE";
private String user="scott";
private String password="tiger";
private Connection con = null;
private Statement stmt=null;
private ResultSet rs=null;
public int mUpdate(String member){
int countRow = 0;
try{
Class.forName(driverClass);
con=DriverManager.getConnection(url,user,password);
stmt = con.createStatement();
countRow = stmt.executeUpdate(member);
}catch(Exception e){
System.out.println("ERROR MSG : " + e.getMessage());
e.printStackTrace();
}finally{
try {
if(rs != null)
rs.close();
if(stmt != null)
stmt.close();
if(con != null)
con.close();
} catch (SQLException e) {
e.printStackTrace();
}
}return countRow;
}
public MemberDto mSelect(String str){
MemberDto member = new MemberDto();
try{
Class.forName(driverClass);
con=DriverManager.getConnection(url,user,password);
stmt = con.createStatement();
rs = stmt.executeQuery(str);
while(rs.next()){
int no = rs.getInt("no");
String id =rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
//System.out.println(no+" \t "+id+" \t "+name+" \t "+phone+" \t\t "+address);
member.setNo(no);
member.setId(id);
member.setName(name);
member.setPhone(phone);
member.setAddress(address);
}
}catch(Exception e){
System.out.println("ERROR MSG : " + e.getMessage());
e.printStackTrace();
}finally{
try {
if(rs != null)
rs.close();
if(stmt != null)
stmt.close();
if(con != null)
con.close();
} catch (SQLException e) {
e.printStackTrace();
}
}
return member;
}
@Override
public int insert(MemberDto member) {
int no = member.getNo();
String strNo = String.valueOf(no);
String id = member.getId();
String name = member.getName();
String phone = member.getPhone();
String address = member.getAddress();
int countRow = mUpdate("insert into member(no,id,name,phone,address) "
+ "values(" + strNo + ",'"+id+"','"+name+"','"+phone+"','"+address+"')");
return countRow;
}
@Override
public int delete(int no) {
String str = String.valueOf(no);
int countRow = mUpdate("delete from member where no="+str);
return countRow;
}
@Override
public int update(MemberDto member) {
return 0;
}
@Override
public MemberDto selectByNo(int selectNo) {
String strNo = String.valueOf(selectNo);
String str = "select * from member where no="+strNo;
MemberDto member = mSelect(str);
return member;
}
@Override
public ArrayList<MemberDto> selectAll() {
ArrayList<MemberDto> memberAll = new ArrayList<MemberDto>();
String str = "select * from member";
MemberDto member = null;
try{
Class.forName(driverClass);
con=DriverManager.getConnection(url,user,password);
stmt = con.createStatement();
rs = stmt.executeQuery(str);
while(rs.next()){
int no = rs.getInt("no");
String id =rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
member = new MemberDto();
member.setNo(no);
member.setId(id);
member.setName(name);
member.setPhone(phone);
member.setAddress(address);
memberAll.add(member);
}
}catch(Exception e){
System.out.println("ERROR MSG : " + e.getMessage());
e.printStackTrace();
}finally{
try {
if(rs != null)
rs.close();
if(stmt != null)
stmt.close();
if(con != null)
con.close();
} catch (SQLException e) {
e.printStackTrace();
}
}
return memberAll;
}
}
```
Child.java
```
public class Child extends Parent{
private String member3;
public Child(){
super();
/*
* 부모클래스의 기본생성자를 자동으로 호출한다.
*/
System.out.println("Child()");
}
public Child(String member1, String member2, String member3) {
super(member1, member2);
//this.member1 = member1;
//this.member2 = member2;
//this.setMember1(member1);
//this.setMember2(member2);
this.member3 = member3;
}
}
```
OuterClass.java
```
public class OuterClass {
InnerClass innerClass;
public int outer_field;
public void outer_method(){
System.out.println("OuterClass.outer_method()");
}
/*
* OuterClass에서 InnerClass의사용
*/
public void outer_inner(){
innerClass = new InnerClass();
innerClass.inner_field = 300;
innerClass.inner_method();
InnerClass innerClass2 = new InnerClass();
innerClass2.inner_field = 400;
innerClass2.inner_method();
}
//member inner class
public class InnerClass{
public int inner_field;
public void inner_method(){
System.out.println("InnerClass.inner_method()");
}
/*
* InnerClass --> OuterClass
*/
public void inner_outer(){
InnerClass.this.inner_field = 100;
InnerClass.this.inner_method();
OuterClass.this.outer_field = 100;
OuterClass.this.outer_method();
outer_field = 200;
outer_method();
}
}
}
```
GridLayoutFrame.java
```package layout;
import java.awt.Button;
import java.awt.Frame;
import java.awt.GridLayout;
public class GridLayoutFrame extends Frame{
Button b1,b2,b3,b4,b5,b6,b7,b8,b9;
public GridLayoutFrame(){
b1 = new Button("1");
b2 = new Button("2");
b3 = new Button("3");
b4 = new Button("4");
b5 = new Button("5");
b6 = new Button("6");
b7 = new Button("7");
b8 = new Button("8");
b9 = new Button("9");
GridLayout grid = new GridLayout(3,3);
setLayout(grid);
add(b1);
add(b2);
add(b3);
add(b4);
add(b5);
add(b6);
add(b7);
add(b8);
add(b9);
setSize(300, 400);
setVisible(true);
}
public static void main(String[] args) {
new GridLayoutFrame();
}
}
```
ThreadSleepMain.java
```package thread.control;
public class ThreadSleepMain {
public static void main(String[] args) throws InterruptedException {
ThreadSleep ts = new ThreadSleep();
ts.finishCount=10;
ts.start();
/*
* »ç¿ë±ÝÁö
*/
Thread.sleep(10000);
ts.stop();
}
}
```
OverridingChild.java
```
public class OverridingChild extends Overriding {
/*
public void method1(){
System.out.println("Overriding.method1()");
}
public void method2(){
System.out.println("Overriding.method2()");
}
*/
@Override
public void method2(){
System.out.println("OverridingChild애서 재정의한 method()");
}
}
```
ExtendsThreadMain.java
```package thread.create;
public class ExtendsThreadMain {
public static void main(String[] args) {
System.out.println("main start");
ExtendsThread et = new ExtendsThread();
/*
* Causes this thread to begin execution; the Java Virtual Machine calls the run method
* of this thread.
The result is that two threads are running concurrently: the current thread (which
returns from the call to the start method) and the other thread (which executes its run method).
*/
et.start();
System.out.println("2.main return");
while(true){
System.out.println("main");
}
}
}
```
CustomType.java
```
/*
* class 선언(정의)
* - 형식
* 접근제한자 class 클래스이름{
* - 접근제한자:public,protected,없는거
*
* }
* ex> public class Car{
* }
*
* -구성요소
* 1.멤버변수선언(속성)
* 접근제한자(public,proected,없는거,private) 타입 indentifier;
* ex> public String carName;
*
* 2.멤버메쏘드 선언(행위)
* 접근제한자 리턴타입 메쏘드이름(인자){
* -인자: 나를 호출한놈이 데이타를 넣어줄 통로
* -리턴타입: 나를 호출한놈에게 줄 데이타타입
* void --> 줄데이타가 없는경우
* }
* ex> public int test(int a){
*
* }
*/
public class CustomType {
/*
* 멤버변수
*/
int member1;
String member2;
char member3;
boolean member4;
}
```
WrapperClassMain.java
```package com.itwill.wrapper;
/*
- Wrapper 클래스
자바데이타형은 기본데이타형과 레퍼런스 데이타 형으로 구분됩니다.
기본데이타형으로는 int,boolean,double 등이 제공됩니다.
이런기본 데이타형을 객체로 사용할수있는 방법으로
Wrapper 클래스가 제공됩니다.
Wrapper 클래스는 각종유용한 기능들을 메서드로 제공받을수있다는
장점이있습니다.
Integer,Boolean,Double,Character,Float,Long,Byte,Short
*/
public class WrapperClassMain {
public static void main(String[] args) {
Object[] objectArray = new Object[5];
objectArray[0] = new Integer(1);
objectArray[1] = new Integer(2);
objectArray[2] = new Integer(3);
objectArray[3] = new Integer(4);
objectArray[4] = new Integer(5);
/*******boxing*****/
Integer wi1 = new Integer(10);
Integer wi2 = new Integer(20);
Integer wi3 = 10;
Integer wi4 = 20;
int x = wi1.intValue();
int y = wi2.intValue();
int z = wi3;
int w = wi4;
int result = wi1.intValue()+wi2.intValue();
System.out.println(result);
result = wi1 + wi2;
System.out.println(result);
result = wi3+10;
System.out.println(result);
if(wi2>wi1){
System.out.println("wi2>wi1");
}
if(wi3>3){
System.out.println("wi3>3");
}
/************Wrapper 비교***********/
Integer wi5 = new Integer(30);
Integer wi6 = new Integer(30);
if(wi5==30){
System.out.println("wi5==30");
}
if(wi5==wi6){
System.out.println("wi5==wi6 : 주소비교");
}else{
System.out.println("wi5!=wi6");
}
/********값비교********/
if(wi5.equals(wi6)){
System.out.println("wi5 equal wi6");
}
/**********유용한 메쏘드************/
//기본형 --> Wrapper
boolean flag = true;
Boolean bw1 = new Boolean("true");
boolean b1 = Boolean.parseBoolean("true");
Integer wi7 = 10;
Integer wi8 = new Integer("34423");
int i1 = Integer.parseInt("5645634");
System.out.println(i1);
int i2 = 2415464;
String bs = Integer.toBinaryString(i2);
System.out.println(bs);
Double wd = new Double("4532.4346546");
double d1 = wd.doubleValue();
double d2 = Double.parseDouble("3.14159");
String numStr = 3.14159+"";
//"3.14159"
//Character
Character cw = new Character('김');
char c1 = cw.charValue();
char[] ca = {'A','a','*','5','7',' ','$',')'};
for (int i = 0; i < ca.length; i++) {
int type = Character.getType(ca[i]);
if(type==Character.CURRENCY_SYMBOL){
System.out.println(ca[i]);
}
System.out.println(">>>>type" + type);
if(Character.isAlphabetic(ca[i])){
System.out.println("isAlphavetic : " + ca[i]);
}
if(Character.isDigit(ca[i])){
System.out.println("isDigit : " + ca[i]);
}
if(Character.isUpperCase(ca[i])){
System.out.println("isUpperCase : " + ca[i]);
}
if(Character.isSpaceChar(ca[i])){
System.out.println("isSpaceChar" + ca[i]);
}
}
}
}
```
CalculatorMain.java
```package com.itwill.sungjuk.method;
public class CalculatorMain {
public static void main(String[] args) {
/*
Calculator calc= new Calculator();
int a,b;
a=2000;
b=150;
int result = calc.add(a,b);
int result2 = calc.sub(a,b);
int result3 = calc.mul(a,b);
int result4 = calc.div(a,b);
System.out.println("계산결과 : " + result);
System.out.println("계산결과 : " + result2);
System.out.println("계산결과 : " + result3);
System.out.println("계산결과 : " + result4);
*/
}
}
```
MemberDao.java
```package jdbc.member;
import java.util.ArrayList;
public interface MemberDao {
public int insert(MemberDto member) throws Exception;
public int delete(int no) throws Exception;
public int update(MemberDto member);
public MemberDto selectByNo(int no) throws Exception;
public ArrayList<MemberDto> selectAll() throws Exception;
}
```
Account.java
```
/**
이클래스는 계좌객체를 추상화한 클래스 입니다.
@author KIM
@version 0.1
*/
public class Account {
private String no; //계좌번호
private String owner; //계좌주
private int balance; //잔고
private float iyul; //이율
//AccountData Setter
/**
* 계좌객체의 데이타를 셋트하는 메쏘드
*
* @param no 계좌번호
* @param owner 계좌주
* @param balance 잔고
* @param iyul 이율
*/
public void setData(String no, String owner, int balance, float iyul){
this.no=no;
this.owner=owner;
this.balance=balance;
this.iyul=iyul;
}
//입금
/**
* 입금하는메쏘드
* @param m 입금할돈
*/
public void ipGum(int m){
this.balance = this.balance+m;
}
//출금
/**
* 출금하는 메쏘드
* @param m
*/
public void chulGum(int m){
if(this.balance-m < 0){
//잔고부족
System.out.println(">>잔고부족합니다.");
return;
}
this.balance = this.balance-m;
return;
}
//header출력
public void headerPrint(){
System.out.println("------------------------------------");
System.out.println("번호\t이름\t잔고\t이율");
System.out.println("------------------------------------");
}
//출력
/**
* 계좌의 정보를 출력
*/
public void print(){
System.out.println(no+"\t"+owner+"\t"+balance+"\t"+iyul);
}
//setter,getter
public String getNo() {
return no;
}
public void setNo(String no) {
this.no = no;
}
public String getOwner() {
return owner;
}
public void setOwner(String owner) {
this.owner = owner;
}
/**
*
* @return 계좌잔고
*/
public int getBalance() {
return balance;
}
public void setBalance(int balance) {
this.balance = balance;
}
public float getIyul() {
return iyul;
}
public void setIyul(float iyul) {
this.iyul = iyul;
}
}
```
MemberRdbDaoImpl.java
```package jdbc.member;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
import java.util.ArrayList;
/*
* member table 에 접근해서
* INSERT,UPDATE,DELETE,SELECT 작업을 하는 DAO(Data Access Object)객체
*/
public class MemberRdbDaoImpl implements MemberDao{
@Override
public int insert(MemberDto member) throws Exception {
Connection con=null;
Statement stmt=null;
String insertSql="insert into member values("+member.getNo()+",'"
+member.getId()+"','"
+member.getName()+"','"
+member.getPhone()+"','"
+member.getAddress()+"')";
int row=0;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
row = stmt.executeUpdate(insertSql);
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
public int pinsert(MemberDto member) throws Exception {
Connection con=null;
PreparedStatement pstmt=null;
String insertSql="insert into member values(?,?,?,?,?)";
int row=0;
try {
con=ConnectionFactory.getConnection();
pstmt=con.prepareStatement(insertSql);
pstmt.setInt(1, member.getNo());
pstmt.setString(2, member.getId());
pstmt.setString(3, member.getName());
pstmt.setString(4, member.getPhone());
pstmt.setString(5, member.getAddress());
row = pstmt.executeUpdate();
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int delete(int no) throws Exception{
Connection con=null;
Statement stmt=null;
String insertSql="delete from member where no="+no;
int row=0;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
row = stmt.executeUpdate(insertSql);
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int update(MemberDto member) {
return 0;
}
@Override
public MemberDto selectByNo(int no) throws Exception{
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
MemberDto member = null;
String selectSql="select * from member where no="+no;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
rs=stmt.executeQuery(selectSql);
if(rs.next()){
int n = rs.getInt("no");
String id = rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
member = new MemberDto(n,id,name,phone,address);
}
} finally {
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}
return member;
}
@Override
public ArrayList<MemberDto> selectAll() throws Exception{
Connection con = null;
PreparedStatement pstmt = null;
ResultSet rs = null;
String selectSql="select * from member";
ArrayList<MemberDto> memberList = new ArrayList<MemberDto>();
try{
con = ConnectionFactory.getConnection();
pstmt = con.prepareStatement(selectSql);
rs = pstmt.executeQuery();
while(rs.next()){
int no = rs.getInt("no");
String id = rs.getString("id");
String name = rs.getString("name");
String phone = rs.getString("phone");
String address = rs.getString("address");
MemberDto member = new MemberDto(no,id,name,phone,address);
memberList.add(member);
}
}finally{
if(con!=null){
ConnectionFactory.releaseConnection(con);
}
}
return memberList;
}
}
```
MapMain.java
```package com.itwill.collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Set;
public class MapMain {
public static void main(String[] args) {
HashMap<String, Car> carMap= new HashMap<String,Car>();
System.out.println("1.map size : " + carMap.size());
carMap.put("3125", new Car("3125", 12));
carMap.put("4533", new Car("4533", 6));
carMap.put("8554", new Car("8554", 8));
carMap.put("5544", new Car("5544", 11));
carMap.put("8899", new Car("8899", 14));
carMap.put("2233", new Car("2233", 3));
System.out.println("2.put size : " + carMap.size());
System.out.println("3.map±¸Á¶ : " + carMap );
if(carMap.containsKey("8899")){
Car removeCar = carMap.remove("8899");
removeCar.print();
}
System.out.println("4.remove size :"+ carMap.size());
System.out.println("5-----iteration-----");
//Set<Entry<String,Car>> entrySet = carMap.entrySet();
//Iterator<Entry<String,Car>> entryIter = entrySet.iterator();
Set<Entry<String, Car>> entrySet = carMap.entrySet();
Iterator<Entry<String, Car>> entryIter = entrySet.iterator();
for(Entry<String,Car> entry : entrySet){
String key=entry.getKey();
Car car = entry.getValue();
System.out.println("KEY:" + key+ "-->");
car.print();
}
System.out.println("5----interation[keyset]-----");
Set<String> keySet = carMap.keySet();
Iterator<String> keyIter = keySet.iterator();
while(keyIter.hasNext()){
String keyStr = keyIter.next();
System.out.println(keyStr + "-->");
Car tempCar=carMap.get(keyStr);
tempCar.print();
}
}
}
```
Radio.java
```
public class Radio implements OnOff,Volume{
@Override
public void up() {
System.out.println("Radio.up()");
}
@Override
public void down() {
System.out.println("Radio.down()");
}
@Override
public void on() {
System.out.println("Radio.on()");
}
@Override
public void off() {
System.out.println("Radio.off()");
}
}
```
BufferedInputOutputFileCopy.java
```package byte_stream.filter_stream;
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
public class BufferedInputOutputFileCopy {
public static void main(String[] args) throws Exception{
String fileName = "ALZip928.exe"; // Car_copy.java
String copyFileName = "";
int dotIndex = fileName.lastIndexOf(".");
String fName = fileName.substring(0,dotIndex);
String fineExt = fileName.substring(dotIndex);
copyFileName = fName + "_copy" + fineExt;
System.out.println("원본파일 : " + copyFileName);
System.out.println("생성파일 : " + copyFileName);
FileInputStream fis = new FileInputStream(fileName);
BufferedInputStream bis = new BufferedInputStream(fis);
FileOutputStream fos = new FileOutputStream(copyFileName);
BufferedOutputStream bos = new BufferedOutputStream(fos);
int count = 0;
int count1 = 0;
while (true) {
int readByte = bis.read();
if(readByte == -1) break;
bos.write(readByte);
count++;
if(count%10000 ==0){
System.out.println("*");
count1++;
if(count1%50==0){
System.out.print("*");
}
}
}
fis.close();
fos.close();
}
}
```
NotePadGUI.java
```package notepad;
import java.awt.BorderLayout;
import java.awt.Color;
import java.awt.FileDialog;
import java.awt.Font;
import java.awt.Frame;
import java.awt.Label;
import java.awt.Menu;
import java.awt.MenuBar;
import java.awt.MenuItem;
import java.awt.MenuShortcut;
import java.awt.TextArea;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.KeyEvent;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
public class NotePadGUI extends Frame {
TextArea noteTA;
File readFile = null;
Label statusL = null;
//파일이름
String fileName = "";
//디렉토리
String dirPath = "";
//파일content
String content="";
public NotePadGUI() {
init();
}
private void init() {
setFont(new Font("Serif", Font.BOLD, 22));
setFont(new Font("Serif", Font.BOLD, 24));
noteTA = new TextArea();
statusL = new Label();
noteTA.setBackground(Color.PINK);
// MenuBar
MenuBar menuBar = new MenuBar();
// Menu
Menu fileMenu = new Menu("파일");
Menu editMenu = new Menu("편집");
// MenuItem
MenuItem newItem = new MenuItem("새파일", new MenuShortcut(KeyEvent.VK_N));
MenuItem openItem = new MenuItem("열기", new MenuShortcut(KeyEvent.VK_O));
MenuItem saveItem = new MenuItem("저장", new MenuShortcut(KeyEvent.VK_S));
MenuItem saveAsItem = new MenuItem("다른이름으로저장", new MenuShortcut(
KeyEvent.VK_A));
MenuItem exitItem = new MenuItem("종료", new MenuShortcut(KeyEvent.VK_E));
fileMenu.add(newItem);
fileMenu.add(openItem);
fileMenu.add(saveItem);
fileMenu.add(saveAsItem);
fileMenu.addSeparator();
fileMenu.add(exitItem);
menuBar.add(fileMenu);
menuBar.add(editMenu);
// MenuBar -->Frame에 부친다.
setMenuBar(menuBar);
add(noteTA,BorderLayout.CENTER);
add(statusL, BorderLayout.SOUTH);
// event
MenuItemHandler mh = new MenuItemHandler();
newItem.addActionListener(mh);
newItem.setActionCommand("new");
openItem.addActionListener(mh);
openItem.setActionCommand("open");
saveItem.addActionListener(mh);
saveItem.setActionCommand("save");
saveAsItem.addActionListener(mh);
saveAsItem.setActionCommand("saveAs");
exitItem.addActionListener(mh);
exitItem.setActionCommand("exit");
this.addWindowListener(new WindowExitHandler());
setSize(700, 800);
setVisible(true);
fileNew();
}
private void setMessage(String msg) {
statusL.setText(msg);
}
private void fileNew() {
/*
* 1.기존에 파일이 로딩되어있는지여부
* 2.파일로딩되어있을경우에는 원본파일데이타와 비교해서 다르면 저장할것인지여부
* 3.파일이로딩되어있지않은경우에는 텍스트에어리어 에 데이타가있는지여부검사
*/
noteTA.getText().compareTo(content);
noteTA.setText(" ");
noteTA.setText("");
NotePadGUI.this.fileName="제목없음.txt";
NotePadGUI.this.dirPath="";
setTitle(fileName);
}
/*
* 1.기존에 파일이 로딩되어있는지여부
* 2.파일로딩되어있을경우에는 원본파일데이타와 비교해서 다르면 저장할것인지여부
* 3.파일이로딩되어있지않은경우에는 텍스트에어리어 에 데이타가있는지여부검사
*/
private void loadFile(String dirPath, String fileName) {
try{
BufferedReader br = new BufferedReader(new FileReader(dirPath+fileName));
noteTA.setText("");
StringBuffer sb = new StringBuffer();
while (true) {
String readLine = br.readLine();
if(readLine==null)break;
//System.out.println(readLine);
sb.append(readLine+"\n");
}
noteTA.setText(sb.toString());
this.content=sb.toString();
}catch(Exception e){
this.setMessage(e.getMessage());
}
this.fileName = fileName;
this.dirPath = dirPath;
this.setTitle(fileName);
this.setMessage("load : " + dirPath + fileName);
}
private void saveFile(String saveDirPath, String saveFileName) {
}
/************** MenuItem Handler(ActionEvent) *******/
public class MenuItemHandler implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
e.getSource();
String actionCommand = e.getActionCommand();
//System.out.println(actionCommand);
switch (actionCommand) {
case "open":
FileDialog fd = new FileDialog(NotePadGUI.this, "열기", FileDialog.LOAD);
fd.setVisible(true);
//thread blocking
String dir = fd.getDirectory();
String file = fd.getFile();
System.out.println(dir+","+file);
if(dir == null || file==null){
return;
}
loadFile(dir, file);
break;
case "save":
/*
1.파일이 로딩된상태이면 로딩된파일에바로저장
saveFile(saveDirPath, saveFileName);
2.파일이 로딩된상태가아니면 saveAs와똑같아요...
FileDialog fd1 = new FileDialog(NotePadGUI.this, "저장",
FileDialog.SAVE);
fd1.setDirectory(dirPath);
fd1.setFile(fileName);
fd1.setVisible(true);
*/
if(fileName.equals("제목없음.txt") && dirPath.equals("")){
//파일로딩안된상태
FileDialog sd = new FileDialog(NotePadGUI.this, "저장" , FileDialog.SAVE);
sd.setVisible(true);
String dirPath = sd.getDirectory();
String fileName = sd.getFile();
if(dirPath == null || fileName == null){
return;
}
System.out.println(dirPath+fileName);
saveFile(dirPath, fileName);
}else{
saveFile(NotePadGUI.this.dirPath, NotePadGUI.this.fileName);
}
break;
case "saveAs":
//파일로딩안된상태
FileDialog sd = new FileDialog(NotePadGUI.this, "저장" , FileDialog.SAVE);
if(NotePadGUI.this.fileName.equals("제목없음.txt") && !NotePadGUI.this.dirPath.equals("")){
sd.setDirectory(NotePadGUI.this.dirPath);
sd.setFile(NotePadGUI.this.fileName);
}
sd.setVisible(true);
String dirPath = sd.getDirectory();
String fileName = sd.getFile();
if(dirPath == null || fileName == null){
return;
}
System.out.println(dirPath+fileName);
saveFile(dirPath, fileName);
break;
case "new":
fileNew();
break;
case "exit":
System.exit(0);
break;
}
}
}
/**************** WindowAdapter extends ***********/
public class WindowExitHandler extends WindowAdapter {
@Override
public void windowClosing(WindowEvent e) {
System.exit(0);
}
}
/*****************************************************/
public static void main(String[] args) {
new NotePadGUI();
}
}```
FileCopyMain.java
```package byte_stream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
public class FileCopyMain {
public static void main(String[] args) throws Exception{
String fileName = "fileOut.txt"; // Car_copy.java
String copyFileName = "";
int dotIndex = fileName.lastIndexOf(".");
String fName = fileName.substring(0,dotIndex);
String fineExt = fileName.substring(dotIndex);
copyFileName = fName + "_copy" + fineExt;
System.out.println("원본파일 : " + copyFileName);
System.out.println("생성파일 : " + copyFileName);
FileInputStream fis = new FileInputStream(fileName);
FileOutputStream fos = new FileOutputStream(copyFileName);
int count = 0;
int count1 = 0;
while (true) {
int readByte = fis.read();
if(readByte == -1) break;
fos.write(readByte);
count++;
if(count%10000 ==0){
System.out.println("*");
count1++;
if(count1%50==0){
System.out.println("*");
}
}
}
fis.close();
fos.close();
}
}
```
Staff.java
```package com.itwill.academy.manager;
public class Staff extends Person{
private String depart;
public Staff() {
// TODO Auto-generated constructor stub
}
public Staff(int no , String name , String depart) {
super(no, name);
this.depart = depart;
}
public String getDepart() {
return depart;
}
public void setDepart(String depart) {
this.depart = depart;
}
/*public void staffPrint(){
System.out.println(no + "\t" + name + "\t" + depart);
}*/
@Override
public void print(){
super.print();
System.out.println("\t" + depart);
}
}
```
StatementMain.java
```package jdbc.statement;
import java.sql.Connection;
import java.sql.ResultSet;
import java.sql.Statement;
import jdbc.member.ConnectionFactory;
public class StatementMain {
public static void main(String[] args) throws Exception{
Connection con = null;
Statement stmt=null;
ResultSet rs=null;
String selectSql="select * from member order by no desc";
String updateSql="update member set address='서울특별시' where no=1";
String anySql=updateSql;
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
int updateRows = stmt.executeUpdate(updateSql);
System.out.println("1.---------executeUpdate------------");
System.out.println(updateRows + " 행이 갱신 ");
stmt.setMaxRows(5);
rs=stmt.executeQuery(selectSql);
while (rs.next()) {
System.out.println(rs.getInt("no")+" \t "+rs.getString("id") + " \t " + rs.getString("name"));
}
boolean isRs =stmt.execute(anySql);
if(isRs){
//ResultSet
rs=stmt.getResultSet();
while (rs.next()){
System.out.println(rs.getInt("no")+" \t "+rs.getString("id") + " \t " + rs.getString("name"));
}
}else{
//update count
updateRows = stmt.getUpdateCount();
System.out.println(updateRows + " 행이 갱신 ");
}
}
}
```
CollectionMapUseMain.java
```package com.itwill.collection;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Set;
public class CollectionMapUseMain {
public static void main(String[] args) {
/*********전체학생**************/
HashMap<Integer, ArrayList<Student>> schoolMap = new HashMap<Integer,ArrayList<Student>>();
ArrayList<Student> studentList = new ArrayList<Student>();
studentList.add(new Student(1,"KIM",89,85,98));
studentList.add(new Student(2,"LEE",75,73,79));
studentList.add(new Student(3,"PARK",61,96,97));
schoolMap.put(1, studentList);
schoolMap.put(2, new ArrayList<Student>());
schoolMap.put(3, new ArrayList<Student>());
ArrayList<Student> tempStudentlist = schoolMap.get(2);
tempStudentlist.add(new Student(1, "SIM", 78, 88, 85));
tempStudentlist.add(new Student(2, "KANG", 45, 77, 90));
tempStudentlist.add(new Student(3, "HONG", 90, 44, 22));
tempStudentlist = schoolMap.get(3);
tempStudentlist.add(new Student(1, "CHOI", 90, 100, 45));
tempStudentlist.add(new Student(2, "LIM", 22, 11, 99));
tempStudentlist.add(new Student(3, "PARK", 98, 23, 53));
/*********************************************************/
ArrayList<Student> ilBan = schoolMap.get(1);
System.out.println("--1반출력---");
Student.headerPrint();
for(Student student : ilBan){
student.print();
}
Student.headerPrint();
System.out.println("--학생전체출력--");
Set<Integer> banKeyInt = schoolMap.keySet();
Iterator<Integer> banIter = banKeyInt.iterator();
while (banIter.hasNext()) {
Integer integer = (Integer) banIter.next();
ArrayList<Student> tStudentList = schoolMap.get(integer);
System.out.println("**********" + integer + "************");
for(Student student : tStudentList){
student.print();
}
}
HashMap<String, HashMap<String, Car>> parkingMap= new HashMap<String, HashMap<String,Car>>();
parkingMap.put("A", new HashMap<String,Car>());
parkingMap.put("B", new HashMap<String,Car>());
parkingMap.put("C", new HashMap<String,Car>());
//입차
parkingMap.get("A").put("1355", new Car("1355",2));
parkingMap.get("A").put("2548", new Car("2548",5));
parkingMap.get("A").put("5487", new Car("5487",10));
parkingMap.get("B").put("7896", new Car("7896",2));
parkingMap.get("B").put("4567", new Car("4567",5));
parkingMap.get("C").put("5436", new Car("5436",5));
//출차
Car exitCar = parkingMap.get("A").get("5487");
exitCar.setOutTime(12);
exitCar.calculateFee();
exitCar.print();
parkingMap.get("A").remove("5487");
Set<String> parkKeySet = parkingMap.keySet();
Iterator<String> parkKeyIter = parkKeySet.iterator();
while (parkKeyIter.hasNext()) {
String parkKeyStr = (String) parkKeyIter.next();
System.out.println("----"+ parkKeyStr + "----------");
HashMap<String, Car> tCarMap = parkingMap.get(parkKeyStr);
Set<String> carKeySet = tCarMap.keySet();
Iterator<String> CarKeyIter = carKeySet.iterator();
while (CarKeyIter.hasNext()) {
String carKey = (String) CarKeyIter.next();
tCarMap.get(carKey).print();
}
}
}
}
```
AnnonymousLocalInnerClassMain.java
```
public class AnnonymousLocalInnerClassMain {
public static void main(String[] args) {
AnnonymousLocalInnerClass aaa=new AnnonymousLocalInnerClass();
aaa.method();
}
}
```
RandomAccessFileMain.java
```package file;
import java.io.RandomAccessFile;
/*
<<RandomAccessFile>>
1. 양방향 입출력 가능
2. 임의 접근 가능
3. 자바 기본 타입별 읽고, 쓰기 가능
4. 파일 입출력에만 사용 가능한 스트림 유틸 클래스
5. 생성:
인자 - 파일명(입출력가능 양방향스트림)
- "r" 읽기만가능 "rw" 읽기쓰기 가능
ex>RandomAccessFile raf = new RandomAccessFile("raf.dat", "rw");
6. 찾기
- seek 파일포인트를 이동
ex>raf.seek(34);
- getfilepointer 포인트위치 찾기
ex>int pointer=raf.getFilePointer()
*/
public class RandomAccessFileMain {
public static void main(String[] args) throws Exception{
RandomAccessFile raf = new RandomAccessFile("raf.dat","rw");
System.out.println("-------RandomAccessFile write--------");
raf.writeBoolean(true);
System.out.println("0. 파일포인터위치 : " + raf.getFilePointer());
raf.writeByte(10);
System.out.println("1. 파일포인터위치 : " + raf.getFilePointer());
raf.writeInt(10);
System.out.println("2. 파일포인터위치 : " + raf.getFilePointer());
raf.writeChar('김');
System.out.println("3. 파일포인터위치 : " + raf.getFilePointer());
raf.writeChar('경');
System.out.println("4. 파일포인터위치 : " + raf.getFilePointer());
raf.writeChar('호');
System.out.println("5. 파일포인터위치 : " + raf.getFilePointer());
raf.writeDouble(3.14159);
System.out.println("6. 파일포인터위치 : " + raf.getFilePointer());
raf.writeUTF("랜덤액세스 파일");
System.out.println("7. 파일포인터위치 : " + raf.getFilePointer());
System.out.println("----------RandomAccessFile read----------");
System.out.println("A.위치 : " + raf.getFilePointer());
System.out.println("B.파일크리 : " + raf.length());
raf.seek(0);
System.out.println("C.위치 : " + raf.getFilePointer());
System.out.println("boolean : " + raf.readBoolean());
System.out.println("D.위치 : " + raf.getFilePointer());
System.out.println("readByte : " + raf.readByte());
System.out.println("readInt : " + raf.readInt());
System.out.println("readChar : " + raf.readChar());
System.out.println("readChar : " + raf.readChar());
System.out.println("readChar : " + raf.readChar());
System.out.println("readDouble : " + raf.readDouble());
System.out.println("readUTF : " + raf.readUTF());
raf.seek(6);
System.out.println(raf.readChar());
raf.readChar();
System.out.println(raf.readChar());
}
}
```
CarFactoryMain.java
```
public class CarFactoryMain {
public static void main(String[] args) {
Car c1 = new Car();
c1.setNo(4);
c1.setModel("K7");
Engine k7e = new Engine();
k7e.setType("A");
k7e.setCc(2800);
c1.setEngine(k7e);
c1.print();
/************************************************/
Car car1 = new Car();
car1.setNo(9999);
Car car2;
car2=car1;
Car car3 = car2;
System.out.println("car1.getNo() -->" + car1.getNo());
System.out.println("car2.getNo() -->" + car2.getNo());
System.out.println("car3.getNo() -->" + car3.getNo());
}
}
```
FileInputStreamMain.java
```package byte_stream;
import java.io.FileInputStream;
/*
* Input(출력)
*
* 1.데이타쏘쓰선정(File)
* 2.스트림생성(FileInputStream)
* 3.한바이트씩 읽는다.
*/
public class FileInputStreamMain {
public static void main(String[] args) throws Exception{
FileInputStream fis=new FileInputStream("fileOut.txt");
/*
* public abstract int read() throws IOException
- Reads the next byte of data from the input stream.
- The value byte is returned as an int in the range 0 to 255.
- If no byte is available because
the end of the stream has been reached,
the value -1 is returned.
- This method blocks until input data is available,
the end of the stream is detected,
or an exception is thrown.
- A subclass must provide an implementation of this method.
*/
int readByte = fis.read();
System.out.println("1." + Integer.toBinaryString(readByte));
readByte = fis.read();
System.out.println("2." + Integer.toBinaryString(readByte));
readByte= fis.read();
System.out.println("3." + Integer.toBinaryString(readByte));
while (true) {
readByte = fis.read();
if(readByte == -1){
break;
}
//System.out.println(Integer.toBinaryString(readByte));
System.out.println((char)readByte);
}
}
}
```
FileOutputStreamMain.java
```package byte_stream;
import java.io.FileOutputStream;
/*
* Output(출력)
*
* 1.데이타타겟선정(File)
* 2.스트림생성(FileOutputStream)
* 3.한바이트씩 쓴다.
*/
public class FileOutputStreamMain {
public static void main(String[] args) throws Exception{
FileOutputStream fis=new FileOutputStream("fileOut.txt");
/*
<< OutputStream >>
public abstract void write(int b) throws IOException
- Writes the specified byte to this output stream.
- The general contract for write is that
one byte is written to the output stream.
The byte to be written is the eight low-order bits of the argument b.
The 24 high-order bits of b are ignored.
- Subclasses of OutputStream must provide
an implementation for this method.
*/
fis.write(65);
fis.write('A');
fis.write(66);
fis.write(67);
fis.write(2147483647);
fis.write('호');
for (int i = 0; i < 256; i++) {
fis.write(i);
}
System.out.println("file output");
}
}
```
AccountManagerMain.java
```package com.itwill.account.manager.collection;
public class AccountManagerMain {
public static void main(String[] args) {
AccountManagerCollection accountManager=new AccountManagerCollection();
System.out.println("1.AccountManager야 전체계좌출력");
accountManager.print();
System.out.println("2.AccountManager야 총잔고 주세요");
int totBalance=accountManager.getTotalBalance();
System.out.println("총잔고:"+ totBalance);
System.out.println("3.AccountManager야 총계좌수 주세요:");
int allAccountCount = accountManager.allAccountCount();
System.out.println("총계좌수 : " + allAccountCount);
System.out.println("4.AccountManager야 계좌번호줄께(6666) 계좌객체 주소주세요(1개)");
Account findAccount= accountManager.findByAccountNo("6666");
//accountManager.findByAccountNo("2222");
findAccount.headerPrint();
findAccount.print();
System.out.println("5.AccountManager야 이름이 KIM 인계좌들 주세요");
Account[] findAccounts=accountManager.findByAccountName("KIM");
findAccounts[0].headerPrint();
for (int i = 0; i < findAccounts.length; i++) {
findAccounts[i].print();
}
System.out.println("6.AccountManager야 계좌잔고 50000 이상인계좌들 주세요");
Account[] findBalance = accountManager.findByAccountBalance(50000);
//findBalance[0].headerPrint();
for (int i = 0; i < findBalance.length; i++) {
findBalance[i].print();
}
System.out.println("7.AccountManager야 이율이 8.0 이상인계좌들 주세요");
Account[] findIyul = accountManager.findByIyul(8.0f);
findIyul[0].headerPrint();
for (int i = 0; i < findIyul.length; i++) {
findIyul[i].print();
}
System.out.println("8.AccountManager야 입금:3333번계좌에 3000원입금해주세요");
Account depositBalance = accountManager.depositByBalance("3333",3000);
depositBalance.headerPrint();
depositBalance.print();
System.out.println("9.AccountManager야 출금:9999번계좌에서 10000원출금해주세요");
Account withdrawBalance = accountManager.withdrawBalance("9999",10000);
withdrawBalance.headerPrint();
withdrawBalance.print();
System.out.println("10.AccountManager야 계좌정보변경: 3000번계좌 이율 5.0로변경해주세요");
Account changeIyul = accountManager.changeIyul("3000",5.0f);
changeIyul.headerPrint();
changeIyul.print();
}
}
```
AccountMain.java
```
public class AccountMain {
public static void main(String[] args) {
Account acc1 = new Account();
acc1.setNo("1234");
acc1.setOwner("KIM");
acc1.setBalance(50000);
acc1.setIyul(2.5f);
acc1.ipGum(3000);
Account acc2 = new Account();
acc2.setData("3333","CHOI", 89000,2.3f);
acc2.chulGum(4000);
acc1.headerPrint();
acc1.print();
acc2.print();
}
}
```
DJ.java
```package korea.president;
import america.persident.Bush;
public class DJ {
public int a;
protected int b;
int c;
private int d;
public void a(){
System.out.println("public method a();");
}
protected void b(){
System.out.println("protected method b();");
}
void c(){
System.out.println("method c();");
}
private void d(){
System.out.println("private method a();");
}
public void access(){
/****같은 패키지의 경우*****/
YS ys = new YS();
ys.a = 1;
ys.b = 2;
ys.c = 3;
//ys.d = 4;
ys.a();
ys.b();
ys.c();
//ys.d();
/******다른 패키지*******/
Bush bs = new Bush();
bs.a=1;
//bs.b=2;
//bs.c=3;
//bs.d=4;
bs.a();
//bs.b();
//bs.c();
//bs.d();
}
}
```
Car.java
```/**
* 주차장에서 사용하는 차객체를 추상화한 클래스
* @author Administrator
*
*/
public class Car {
/**
* 차량번호
*/
public String no; //차량번호
/**
* 입차시간
*/
public int inTime; // 입차시간
/**
* 출차시간
*/
public int outTime; // 출차시간
/**
* 주차요금
*/
public int fee; //주차요금
//멤버메쏘드(행위)
//입력
//출력
/**
* 출력
*/
public void print(){
//this : self 참조변수
System.out.println("----------------------");
System.out.println("차량번호 : " + this.no);
System.out.println("입차시간 : " + this.inTime);
System.out.println("출차시간 : " + this.outTime);
System.out.println("주차요금 : " + this.fee);
System.out.println("-----------------");
}
//주차요금계산
public void calculaterFee(){
this.fee=(this.outTime-this.inTime)*1000;
}
}
```
ChatServerClientHandler.java
```package chat.server;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.net.Socket;
/*
* - 클라이언트 정보를 가지고있는 객체(id,socket,stream)
* - 클라이언트 소켓을 포함하고있는 쓰레드 클래스
* - 클라이언트당 1개씩생성
* - 클라이언트와의 통신을담당
*/
public class ChatServerClientHandler extends Thread{
String id;// 클라이언트ID
Socket socket;
DataInputStream dataIn;
DataOutputStream dataOut;
ChatServerClientHandlerManager clientHandlerManager;
public ChatServerClientHandler(Socket socket,
ChatServerClientHandlerManager clientHandlerManager) {
try {
this.clientHandlerManager=clientHandlerManager;
this.socket = socket;
this.dataIn = new DataInputStream(socket.getInputStream());
this.dataOut = new DataOutputStream(socket.getOutputStream());
this.id=socket.getInetAddress().getHostAddress()
+"["+socket.getPort()+"]";
} catch (Exception e) {
try {
if (dataIn != null) {
dataIn.close();
}
if (dataOut != null) {
dataOut.close();
}
if (socket != null) {
socket.close();
}
} catch (Exception e1) {
e1.printStackTrace();
}
}
this.setName(id);
this.start();
}
@Override
public void run() {
try{
while(true){
System.out.println(
"1.ChatServerClientHandler:클라이언트데이타를읽기위해무한대기:"+Thread.currentThread().getName());
String readData=dataIn.readUTF();
System.out.println(
"2.ChatServerClientHandler:클라이언트가 전송한데이타읽음:"+readData);
System.out.println(
"3.ChatServerClientHandler:연결된모든 클라이언트에브로드캐스팅");
//매니져님모든 클라이언트에브로드캐스팅 해주세요
clientHandlerManager.sendBroadcating(id+":"+readData);
}
}catch(Exception e){
//매니져님 Client 리스트에서 나를제거
try {
clientHandlerManager.removeClient(this);
} catch (Exception e1) {
e1.printStackTrace();
}
}
}
public void send(String readData) throws Exception {
dataOut.writeUTF(readData);
}
}
```
MemberDaoFileImpl.java
```package jdbc.member;
import java.util.ArrayList;
public class MemberDaoFileImpl implements MemberDao{
@Override
public int insert(MemberDto member) throws Exception {
// TODO Auto-generated method stub
return 0;
}
@Override
public int delete(int no) throws Exception {
// TODO Auto-generated method stub
return 0;
}
@Override
public int update(MemberDto member) {
// TODO Auto-generated method stub
return 0;
}
@Override
public MemberDto selectByNo(int no) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public ArrayList<MemberDto> selectAll() {
// TODO Auto-generated method stub
return null;
}
}
```
CalculatorFrame.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.Font;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Label;
import java.awt.Panel;
import java.awt.TextField;
public class CalculatorFrame extends Frame {
Label displayL;
Panel buttonP;
Button b1,b2,b3,b4,b5,b6,b7,b8,b9,b0,equalB,plusB,minusB,divB,mulB,clearB;
public CalculatorFrame(){
setTitle("°è»ê±â");
displayL = new Label();
displayL.setBackground(Color.LIGHT_GRAY);
displayL.setText("0");
displayL.setFont(new Font(Font.SANS_SERIF, Font.BOLD , 14));
displayL.setForeground(Color.DARK_GRAY);
buttonP = new Panel();
b1 = new Button("1");
b2 = new Button("2");
b3 = new Button("3");
b4 = new Button("4");
b5 = new Button("5");
b6 = new Button("6");
b7 = new Button("7");
b8 = new Button("8");
b9 = new Button("9");
b0 = new Button("0");
equalB = new Button("=");
plusB = new Button("+");
minusB = new Button("-");
divB = new Button("/");
mulB = new Button("*");
clearB = new Button("c");
buttonP.setLayout(new GridLayout(0,4,3,3));
buttonP.add(b1);buttonP.add(b2);buttonP.add(b3);buttonP.add(plusB);
buttonP.add(b4);buttonP.add(b5);buttonP.add(b6);buttonP.add(minusB);
buttonP.add(b7);buttonP.add(b8);buttonP.add(b9);buttonP.add(divB);
buttonP.add(b0);buttonP.add(equalB);buttonP.add(clearB);buttonP.add(mulB);
setLayout(new BorderLayout());
add(displayL,BorderLayout.NORTH);
add(buttonP,BorderLayout.CENTER);
setSize(200,220);
setVisible(true);
}
public static void main(String[] args) {
new CalculatorFrame();
}
}
```
LogicalOperator.java
```/*
논리연산자
- 형태: ||(Logical OR) , && (Logical AND) ( |,& )
- 좌우측의항이 논리형데이타이다.
- 결과도 논리형데이타이다.
ex> true || false, false && false
*/
public class LogicalOperator {
public static void main(String[] args) {
boolean b1 = false;
boolean b2 = false;
/*
* LOGICAL OR(논리합) ||
*/
boolean result = b1 || b2;
System.out.println("false || false = " + result);
/*
* LOGICAL AND (논리합) &&
*/
b1=true;
b2=true;
result = b1 && b2;
System.out.println("true && true = " + result);
int kor = 88;
boolean isValid;
isValid = (kor >= 0) && (kor<=100);
System.out.println(kor + "은 유효한점수인가요" + isValid);
int age = 23;
char gender = 'F';
boolean isPass;
isPass = !((age >= 30) || (gender == 'M'));
System.out.println("30세이하이거나 남자인경우 입장불가" + isPass);
boolean isTurn =false;
System.out.println("1. "+isTurn);
isTurn = !isTurn;
System.out.println("2. !(false)-->"+isTurn);
isTurn = !isTurn;
System.out.println("3. !(true)-->"+isTurn);
}
}
```
Employee.java
```
public abstract class Employee {
/*
* 인센티브율(10%)
*/
public static final double INCENTIVE_RATE = 0.1;
private int no; //사번
private String name; // 사원이름
private int pay; // 급여
private int incentive; //인센티브
public Employee() {
}
public Employee(int no, String name) {
super();
this.no = no;
this.name = name;
}
/*
* 월급계산
* 모든Employee에서 재정의 해야하는메쏘드
*/
public abstract void calculatePay();
/*
* 인센티브계산
* 급여가 100만원이 넘으면 지급
* 모든 Employee 에서 그대로 사용 해야하는메쏘드
*/
public final void calculateIncentive(){
if(pay>=1000000){
incentive = (int)(pay*INCENTIVE_RATE);
}
}
public void print(){
System.out.println(no + "\t" + name +"\t" + pay + "\t" + incentive);
}
//setter,getter
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getPay() {
return pay;
}
public void setPay(int pay) {
this.pay = pay;
}
public int getIncentive() {
return incentive;
}
public void setIncentive(int incentive) {
this.incentive = incentive;
}
}
```
EmpDaoMain.java
```package jdbc.emp;
import java.sql.Date;
import java.util.List;
import java.util.Map;
public class EmpDaoMain {
public static void main(String[] args) throws Exception {
EmpDao empDao = new EmpDaoImpl();
System.out.println("1.추가--------------------");
Emp insertEmp = new Emp(9999,"명시기","MANAGER",7902,new Date(System.currentTimeMillis()),7000.0,300.0,20);
int insertRow = empDao.insert(insertEmp);
System.out.println("1-1.insert : " + insertRow + "행이 추가");
System.out.println("2.삭제--------------------");
int deleteRow = empDao.delete(9999);
System.out.println("2-1.delete(9999) : " + deleteRow + "행이 삭제");
/*Emp updateEmp = new Emp(7839,"KING","PRESIDENT",-1,new Date(System.currentTimeMillis()),4999,-1,10);
empDao.update(updateEmp);*/
System.out.println("3.emp-dept(empno 7839)-------------------");
Map<String,Object> empDeptMap = empDao.findByNoEmpDept(7839);
int empno = (Integer)empDeptMap.get("empno");
String ename = (String)empDeptMap.get("ename");
String dname = (String)empDeptMap.get("dname");
String loc = (String)empDeptMap.get("loc");
System.out.println(empno+"\t"+ename+"\t"+dname+"\t"+loc);
System.out.println("4.emp-dept-------------------");
List<Map<String,Object>> empDeptList = empDao.findAllEmpDept();
for (Map<String, Object> map : empDeptList) {
empno = (Integer)map.get("empno");
ename = (String)map.get("ename");
dname = (String)map.get("dname");
loc = (String)map.get("loc");
System.out.println(empno+" \t "+ename+" \t "+dname+" \t "+loc);
}
/*System.out.println("3.번호로 검색---------------");
Emp findbyNo = empDao.findByNo(7566);
System.out.println(findbyNo);
System.out.println("-------------------------");
System.out.println("4.이름으로 검색---------------");
List<Emp> empfindByName = empDao.findByName("ALLEN");
for (Emp emp : empfindByName) {
System.out.println(emp);
}
System.out.println("-------------------------");
System.out.println("5.sal로 검색(2000이상)---------");
List<Emp> empFindBySal = empDao.findBySal(2000);
for (Emp emp : empFindBySal) {
System.out.println(emp);
}
System.out.println("-------------------------");
System.out.println("6.job로검색(salesman)---------");
List<Emp> empFindByJob = empDao.findByJob("SALESMAN");
for (Emp emp : empFindByJob) {
System.out.println(emp);
}
System.out.println("-------------------------");
System.out.println("7.hiredate로검색(1981/11/17)---------");
List<Emp> empFindByHiredate = empDao.findByHireDate("1981/11/17");
for (Emp emp : empFindByHiredate) {
System.out.println(emp);
}
System.out.println("-------------------------");
List<Emp> empAll = empDao.findByAllEmp();
for (Emp emp : empAll) {
System.out.println(emp);
}*/
}
}
```
MainThreadCalled.java
```package thread.create;
public class MainThreadCalled {
public void mainThreadCalledMethod(){
String threadMain = Thread.currentThread().getName();
System.out.println("A.현재쓰레드이름 " + threadMain);
System.out.println("B.현재쓰레드이름 " + threadMain);
return;
}
}
```
ForTest.java
```/*
for문
-형식:
for(1;2;3){
//1.반복변수(선언,초기화가능)
//2.반복변수의 조건검사(논리형데이타)
//3.반복변수증,감(++,--)
//4.문장실행
}
1-->
2(true)-->4-->3-->
2(true)-->4-->3-->
2(true)-->4-->3-->
2(false)
ex>
for(int i=0;i<10;i++){
stmt1;
}
ex>무한루프
for(;;){
}
*/
public class ForTest {
public static void main(String[] args) {
System.out.println("1.~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
for (int i = 0 ; i < 5 ; i++){
System.out.println("i = " + i);
}
System.out.println("2.~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
for (int i = 5 ; i > 0 ; i--){
System.out.println("i = " + i);
}
System.out.println("3. 1~10사이의 정수에서 짝수 출력");
for (int i = 0; i < 10 ; i++){
int temp = i+1;
if(temp%2==0){
System.out.println(temp + "," );
}
}
System.out.println("3.1 continue");
for (int i = 0; i < 10 ; i++){
int temp = i+1;
if(temp%2==1){
continue;
}
System.out.println(temp + "," );
}
System.out.println("4. 1~100 사이의 정수중 4의 배수 출력");
int count = 0;
for (int i = 0; i < 100 ; i++){
int temp = i+1;
if (temp%4!=0){
continue;
}
count++;
System.out.print(temp + "\t" );
if(count%5==0){
System.out.println();
}
}
System.out.println("5. 한글출력");
count=0;
for (char c = '가'; c <= '햏' ; c++){
System.out.print(c);
count++;
if(count%40==0){
System.out.println();
}
}
}
}
```
LoginPanel.java
```package card.layout;
import java.awt.Color;
import java.awt.Graphics;
import java.awt.Image;
import java.awt.Panel;
import java.awt.Toolkit;
public class LoginPanel extends Panel {
@Override
public void paint(Graphics g) {
Image image=Toolkit.getDefaultToolkit().getImage("koreanfood.png");
g.drawImage(image, 0,0,getWidth(),getHeight(),this);
}
public LoginPanel() {
this.setBackground(Color.RED);
}
}
```
MemberDto.java
```package jdbc.member;
/*
* member table 의 각 컬럼에 해당하는 멤버를 가지고 있는
* DTO(Data Transfer Object),VO(value object)클래스
* member table 의 1개의 row data가 mapping(R-R mapping)되어있다.
*/
public class MemberDto {
private int no;
private String id;
private String name;
private String phone;
private String address;
public MemberDto() {
// TODO Auto-generated constructor stub
}
public MemberDto(int no, String id, String name, String phone,
String address) {
super();
this.no = no;
this.id = id;
this.name = name;
this.phone = phone;
this.address = address;
}
public static void headerPrint(){
System.out.println("no \t id \t\t name \t phone \t\t address");
}
public void print(){
System.out.println(no + " \t " + id + " \t " + name + " \t " + phone + " \t\t " + address);
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getId() {
return id;
}
public void setId(String id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getPhone() {
return phone;
}
public void setPhone(String phone) {
this.phone = phone;
}
public String getAddress() {
return address;
}
public void setAddress(String address) {
this.address = address;
}
@Override
public String toString() {
return no+" \t "+id+" \t "+name+" \t "+phone+" \t "+address;
}
}
```
IfLeafYear.java
```
public class IfLeafYear {
public static void main(String[] args) {
// 연도를 입력받아서 윤년여부 출력
int year =2012;
if (((year%4==0) && !(year %100 ==0)) || year% 400 ==0){
System.out.println(year + " 는 윤년 입니다.");
}else{
System.out.println(year + " 는 윤년 아닙니다.");
}
}
}
```
UpperLowerSyncMain.java
```package thread.sync;
public class UpperLowerSyncMain {
public static void main(String[] args) {
Object m = new Object();
UpperThread ut = new UpperThread(m);
LowerThread lt = new LowerThread(m);
ut.start();
lt.start();
}
}
```
OOP_LINE.java
```0 /*
0 * 객체지향 프로그래밍(Object Oriented Programming)
0 * 우리 일상에서이루어지고있는 업무를 객체(Object)를 사용해서
0 * 프로그래밍하는방법
0 *
0 * 1. 실제 주차장관리 업무파악
0 * (객체를 도출하고 그객체들의 관계에의한 업무파악)
0 * 2. 프로그램으로 작성
0 * (1번에서 파악된업무를 메모리상에서 그대로구현)
0 *
0 * ex> 주차관리 프로그램
0 *
0 *
0 * - 객체(업무):실제이루어지고있는 업무(주차장)에서 보여지고
0 * 구체화되어있는 사물(차)
0 *
0 * - 객체(프로그램):실제이루어지고있는 업무(주차장)에서 보여지고
0 * 구체화되어있는 사물을 메모리의 데이타로
0 * 표현한것(차의데이타)
0 *
0 *
0 *
0 *
0 *
0 */
0
0
0}
```
Student.java
```package com.itwill.sungjuk.field;
public class Student {
//멤버변수(속성)
/*
no,이름,국어,영어,수학,총점,평균,평점,석차
*/
public int stuNo;
public String stuName;
public int stuKor;
public int stuEng;
public int stuMath;
public int stuScore;
public double stuAve;
public char stuGrade;
//멤버메쏘드
}
```
EchoClient.java
```package client;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.net.Socket;
public class EchoClient {
public static void main(String[] args) throws Exception {
Socket socket=new Socket("172.16.2.1",9999);
PrintWriter pw=
new PrintWriter(
new OutputStreamWriter(
socket.getOutputStream()));
BufferedReader br=
new BufferedReader(
new InputStreamReader(
socket.getInputStream()));
pw.println("¾È³çÇÏ»ï");
pw.flush();
String readLine=br.readLine();
System.out.println(readLine);
}
}
```
StudentArrayMain.java
```package com.itwill.sungjuk.manager;
public class StudentArrayMain {
public static void main(String[] args) {
Student[] students = {
new Student(1234, "KIM", 90, 92, 96),
new Student(2234, "PARK", 50, 62, 95),
new Student(3234, "LEE", 85, 83, 84),
new Student(4234, "WON", 78, 72, 90),
new Student(5234, "KANG", 82, 70, 62),
new Student(6234, "CHOI", 92, 89, 98),
new Student(7234, "HAN", 92, 85, 90),
new Student(8234, "MO", 72, 52, 99),
new Student(9234, "SUN", 95, 32, 34),
new Student(0234, "PARK", 80, 85, 10)
};
//1.전체성적계산(석차)
System.out.println("1.전체성적계산(석차)");
students[0].headerPrint();
double stuAveAll = 0;
for (int i = 0; i < students.length; i++) {
students[i].stuCalAll();
}
for (int j = 0; j < students.length; j++) {
int ranking = 1;
for (int k = 0; k < students.length; k++) {
if(students[j].getStuScore() < students[k].getStuScore()){
ranking += 1;
}
}
students[j].setStuRank(ranking);
}
for (int i = 0; i < students.length; i++) {
stuAveAll += (students[i].getStuAve())/students.length;
System.out.println(students[i].getStuNo() + "\t" + students[i].getStuName() + "\t" + students[i].getStuKor() + "\t" + students[i].getStuEng() + "\t" + students[i].getStuMath() + "\t" + students[i].getStuScore() + "\t" + students[i].getStuAve() + "\t" + students[i].getStuGrade() + "\t" + students[i].getStuRank());
System.out.println("-------------------------------------------------------------");
}
//2.반전체평균
System.out.println("2.반전체평균");
System.out.println(((double)((int)(((double)stuAveAll)*100)))/100);
//3.학번(이름,평균,평점)으로 찾아 출력
System.out.println("3.학번(이름,평균,평점)으로 찾아 출력");
System.out.println("3.1 이름");
students[0].headerPrint();
for (int i = 0; i < students.length; i++) {
if(students[i].getStuName().equals("PARK")){
students[i].print();
}
}
System.out.println("3.2 평균");
students[0].headerPrint();
for (int i = 0; i < students.length; i++) {
if(students[i].getStuAve()>90){
students[i].print();
}
}
System.out.println("3.3 평점");
students[0].headerPrint();
for (int i = 0; i < students.length; i++) {
if(students[i].getStuGrade()=='C'){
students[i].print();
}
}
//4.갱신(학번 2번인 학생의 성적 0점처리)
System.out.println("4.갱신(학번 2번인 학생의 성적 0점처리) ");
students[0].headerPrint();
students[1].print();
students[1].setStuEng(0);
students[1].setStuKor(0);
students[1].setStuMath(0);
students[1].stuCalAll();
students[1].print();
//5.학생객체 석차순으로 정렬(오름차순)
System.out.println("5.학생객체 석차순으로 정렬(오름차순) ");
students[0].headerPrint();
for (int i = 0; i < students.length; i++) {
for (int j = i; j < students.length; j++) {
if (students[j].getStuScore() < students[i].getStuScore()) {
Student mid = students[i];
students[i] = students[j];
students[j] = mid;
}
}
}
for (int i = 0; i < students.length; i++) {
students[i].print();
}
}
}
```
AccountManager.java
```package com.itwill.account.manager;
/*
*Account 객체들을 관리하는객체
*/
public class AccountManager {
private Account[] accounts={
new Account("1111", "KIM", 80000, 3.0f),
new Account("2222", "LEE", 40000, 7.9f),
new Account("3333", "PARK", 50000, 4.4f),
new Account("4444", "MO", 30000, 8.3f),
new Account("5555", "KIM", 49000, 3.5f),
new Account("6666", "LEE", 51000, 8.5f),
new Account("7777", "MOON", 110000, 5.4f),
new Account("8888", "NAM", 50200, 8.0f),
new Account("9999", "NA", 520000, 8.1f),
new Account("3000", "KIM", 50000, 7.2f)
};
/*
* 총잔고계산후반환
*/
public int getTotalBalance(){
int tot=0;
for (int i = 0; i < accounts.length; i++) {
tot+=accounts[i].getBalance();
}
return tot;
}
/*
* 전제계좌출력
*/
public void print(){
accounts[0].headerPrint();
for (int i = 0; i < accounts.length; i++) {
accounts[i].print();
}
}
public int allAccountCount(){
int all = 0;
for (int i = 0; i < accounts.length; i++) {
all += 1;
}
return all;
}
/*
* 계좌번호를 인자로받아서 계좌객체반환
*/
public Account findByAccountNo(String no){
Account tempNo = null;
for (int i = 0; i < accounts.length; i++) {
if (accounts[i].getNo().equals(no)){
tempNo = accounts[i];
break;
}
}
return tempNo;
}
/*
* 이름을 인자로받아서 계좌객체들반환
*/
public Account[] findByAccountName(String name){
int count = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getOwner().equals(name)){
count += 1;
}
}
Account[] tempName = new Account[count];
int temp = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getOwner().equals(name)){
tempName[temp] = accounts[i];
temp++;
}
}
return tempName;
}
public Account[] findByAccountBalance(int balance) {
int count = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getBalance() >= balance){
count += 1;
}
}
Account[] tempBalance = new Account[count];
int temp = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getBalance() >= balance){
tempBalance[temp] = accounts[i];
temp++;
}
}
return tempBalance;
}
public Account[] findByIyul(float iyul) {
int count = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getIyul() >= iyul){
count += 1;
}
}
Account[] tempIyul = new Account[count];
int temp = 0;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getIyul() >= iyul){
tempIyul[temp] = accounts[i];
temp++;
}
}
return tempIyul;
}
public Account depositByBalance(String no, int balance) {
Account tempBa = null;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals(no)){
accounts[i].ipGum(balance);
tempBa = accounts[i];
break;
}
}
return tempBa;
}
public Account withdrawBalance(String no, int balancei) {
Account tempBa = null;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals(no)){
accounts[i].chulGum(balancei);
tempBa = accounts[i];
break;
}
}
return tempBa;
}
public Account changeIyul(String no, float iyul) {
Account tempBa = null;
for (int i = 0; i < accounts.length; i++) {
if(accounts[i].getNo().equals(no)){
accounts[i].setIyul(iyul);
tempBa = accounts[i];
break;
}
}
return tempBa;
}
}
```
ServerSocketMain.java
```package server;
import java.io.IOException;
import java.net.ServerSocket;
import java.net.Socket;
public class ServerSocketMain {
public static void main(String[] args) throws Exception{
/*
<< ServerSocket class >>
A server socket waits for requests to come in over the network.
*/
ServerSocket serverSocket=new ServerSocket(8888);
System.out.println("ServerSocket port:"+serverSocket.getLocalPort());
System.out.println("ServerSocket IP:"+serverSocket.getInetAddress());
/*
<< ServerSocket class >>
public Socket accept() throws IOException;
- Listens for a connection to be made
to this socket and accepts it.
- The method blocks until a connection is made.
*/
while(true){
System.out.println("1.클라이언트의 소켓연결요청처리하기위해 대기");
Socket socket=serverSocket.accept();
System.out.println("2.클라이언트의 소켓생성:"+socket);
System.out.println("3.클라이언트의 소켓으로 읽고쓰기");
}
}
}
```
WhileOneToTen.java
```
public class WhileOneToTen {
public static void main(String[] args) {
int i=0;
System.out.println("1~10");
while (i<10) {
System.out.print(i+1+",");
i++;
}
System.out.println();
System.out.println("1~10 정수중홀수");
i=0;
int tot=0;
while (i<10){
int temp= i+1;
if(temp%2==1){
System.out.print(temp + ",");
tot += temp;
}
i++;
}
System.out.println("홀수합:" + tot);
System.out.println();
System.out.println("4. 알파벳대문자출력");
char c='A';
int count = 0;
while ( c <= 'Z' ) {
System.out.print(c + " ");
count++;
if (count%4==0){
System.out.println();
}
c++;
}
}
}
```
ParkingManagerMain.java
```package com.itwill.parking.manager.collection;
import java.util.ArrayList;
/*
* 주차관리 클래스를 사용하여 주차
*/
public class ParkingManagerMain {
public static void main(String[] args) {
ParkingManagerCollection parkingmanager = new ParkingManagerCollection();
Car c1 = new Car("1111",5);
Car c2 = new Car("1562",3);
Car c3 = new Car("2345",9);
Car c4 = new Car("3485",7);
Car c5 = new Car("1456",12);
Car c6 = new Car("5318",8);
Car c7 = new Car("6786",6);
Car c8 = new Car("7831",11);
Car c9 = new Car("8135",6);
//입차(9대)
System.out.println("입차(8대)");
parkingmanager.ipCha(c1);
parkingmanager.ipCha(c2);
parkingmanager.ipCha(c3);
parkingmanager.ipCha(c4);
parkingmanager.ipCha(c5);
parkingmanager.ipCha(c6);
parkingmanager.ipCha(c7);
parkingmanager.ipCha(c8);
parkingmanager.ipCha(c9);
//전체차량 정보출력(null이아닌변수출력)
int carCount= parkingmanager.getCarCount();
System.out.println("현재주차장 주차가능대수(주차장 주차차량대수) : " + carCount);
parkingmanager.printAll();
System.out.println("-------------------------------");
System.out.println("번호로 차찾기(1대) 7831번 찾기");
Car carNo = parkingmanager.findByCarNo("7831");
Car.headerPrint();
carNo.print();
System.out.println("-------------------------------");
System.out.println("입차시간으로찾기(여러대) 8이후");
ArrayList<Car> carInTime = parkingmanager.findByCarInTime(8);
Car.headerPrint();
for (Car car : carInTime) {
car.print();
}
System.out.println("-------------------------------");
System.out.println("1456번 차량찾기 , 현재시간셋팅,요금계산-- 1456번차량 삭제");
Car.headerPrint();
Car carOut = parkingmanager.findByCarNoandOut("1456",20);
//parkingmanager.printAll();
/*
0.현재주차장 주차가능대수(주차장 주차차량대수)
1.입차
a.차객체생성(번호,입차시간)
b.차배열객체에 저장(null인곳에 저장)
2.전체차량 정보출력(null이아닌변수출력)
3-1.번호로 차찾기(1대)
3-2.입차시간으로찾기(여러대)
4.1456번 차량출차
a.1456번 차량찾기
b.현재시간셋팅,요금계산,영수증출력
c.1456번차량 삭제(carArray[7]=null;)
*/
}
}
```
MemberDao.java
```package file.member;
import java.io.RandomAccessFile;
import java.util.ArrayList;
/*
* DAO(Data Access Object)
*
* 멤버데이타를 저장하고있는 데이타원본(테이블,파일)에 접근해서
* 멤버쓰기(create),멤버읽기(read),멤버수정(update),멤버삭제(delete)
* 를 할수있는 단위기능(메쏘드)를 제공하는 클래스(객체)
*/
public class MemberDao {
/*
*
* ----------------------------------------------- |memberCount(4)
* |번호(4byte)|이름(10byte)|나이(4)|주소(60byte)|
* |번호(4byte)|이름(10byte)|나이(4)|주소(60byte)|
* |번호(4byte)|이름(10byte)|나이(4)|주소(60byte)|
* |번호(4byte)|이름(10byte)|나이(4)|주소(60byte)|
* |번호(4byte)|이름(10byte)|나이(4)|주소(60byte)|
*/
private RandomAccessFile raf;
// 등록된레코드수(멤버수)
private int recordCount;
// 1개 멤버레코드의 총바이트수
public static final int RECORD_LENGTH = 78;
// 등록된레코드수(멤버수) 저장 사이즈
public static final int RECORD_COUNT_LENGTH = 4;
public MemberDao() throws Exception {
raf = new RandomAccessFile("memberDao.dat", "rw");
if (raf.length() != 0) {
recordCount = raf.readInt();
System.out.println(recordCount + " 명 멤버");
} else {
/*
* 파일생성,등록된멤버없음
*/
System.out.println(recordCount + " 명 멤버(파일생성시)");
}
}
private boolean isDuplicateNo(int no){
Member member = new Member();
return true;
}
// 회원저장
public int createMember(Member member) {
/*
* 성공:0
* 실패(아이디중복):1
* 실패(모르는애로):2
*/
int isCreate=2;
try {
// 번호중복체크??
if(isDuplicateNo(member.getNo())){
isCreate=1;
return isCreate;
}
// 1.파일의 마지막 포인터로이동
raf.seek((recordCount * RECORD_LENGTH) + RECORD_COUNT_LENGTH);
// 2.새로운멤버 저장
int no = member.getNo();// 4
String name = member.getName();// 10
int age = member.getAge();// 4
String address = member.getAddress();// 60
// 번호
raf.writeInt(no);
// 이름
int charCount = name.length();
for (int i = 0; i < 5; i++) {
if (i < charCount) {
raf.writeChar(name.charAt(i));
} else {
raf.writeChar(' ');
}
}
// 나이
raf.writeInt(age);
// 주소
for (int i = 0; i < 30; i++) {
if (i < address.length()) {
raf.writeChar(address.charAt(i));
} else {
raf.writeChar(' ');
}
}
// 레코드 추가후에 포인터를 처음으로이동시켜 레코드수증가
raf.seek(0);
raf.writeInt(++recordCount);
isCreate=0;
} catch (Exception e) {
isCreate =2;
}
return isCreate;
}
// 회원찾기(번호)
public Member findByNo(int no) throws Exception {
Member member = null;
String name = "";
int age = 0;
String address = "";
for (int i = 0; i < recordCount; i++) {
raf.seek((i * RECORD_LENGTH) + RECORD_COUNT_LENGTH);
int tempNo = raf.readInt();
//System.out.println(tempNo);
if (tempNo != no) {
continue;
}else if (tempNo == no){
raf.seek((i * RECORD_LENGTH) + RECORD_COUNT_LENGTH);
no = raf.readInt();
for (int j = 0; j < 5; j++) {
name += raf.readChar();
}
age = raf.readInt();
for (int j = 0; j < 30; j++) {
address += raf.readChar();
}
member = new Member();
member.setNo(no);
member.setName(name.trim());
member.setAge(age);
member.setAddress(address.trim());
break;
}
}
return member;
}
// 회원찾기(이름)
public ArrayList<Member> findByName(String name) {
return null;
}
// 회원전체찾기
public ArrayList<Member> findByAll() throws Exception {
ArrayList<Member> memberList = new ArrayList<Member>();
for (int i = 0; i < recordCount; i++) {
Member member = findByIndex(i);
memberList.add(member);
}
return memberList;
}
// 회원 index로찾기
private Member findByIndex(int index) throws Exception {
Member member = null;
int no = 0;
String name = "";
int age = 0;
String address = "";
raf.seek((index * RECORD_LENGTH) + RECORD_COUNT_LENGTH);
no = raf.readInt();
for (int j = 0; j < 5; j++) {
name += raf.readChar();
}
age = raf.readInt();
for (int j = 0; j < 30; j++) {
address += raf.readChar();
}
member = new Member();
member.setNo(no);
member.setName(name.trim());
member.setAge(age);
member.setAddress(address.trim());
return member;
}
// 회원수정
public void updateMember(Member member) {
}
// 회원삭제
public void deleteMember(int no) {
}
}
```
OverloadingMain.java
```
public class OverloadingMain {
public static void main(String[] args) {
Overloading ol = new Overloading();
ol.method();
ol.method(100);
ol.method(100,200);
ol.method("문자열");
ol.method("문자열1","문자열2");
ol.method("문자열",8888);
}
}
```
Child.java
```
public class Child extends Parent {
public String member3;
public String member4;
public void method3(){
System.out.println("Child.method3()");
}
public void method4(){
System.out.println("Child.method4()");
}
public void print(){
System.out.println(member1 + "," + member2 + "," + member3 + "," + member4);
}
}
```
LottoManagerMain.java
```package com.itwill.lotto;
public class LottoManagerMain {
public static void main(String[] args) {
LottoManager lm = new LottoManager();
/*
* 로또 3000원어차 주세요.
*/
lm.generateLotto(3000);
}
}
```
Parent.java
```
public class Parent extends Object{
private String member1;
private String member2;
public Parent(){
super();
/*
* 부모클래스의 기본생성자를 자동으로 호출한다.
*/
System.out.println("Parent()");
}
public Parent(String member1, String member2) {
this.member1 = member1;
this.member2 = member2;
}
public String getMember1() {
return member1;
}
public void setMember1(String member1) {
this.member1 = member1;
}
public String getMember2() {
return member2;
}
public void setMember2(String member2) {
this.member2 = member2;
}
}
```
Member.java
```package file.member;
/*
* 멤버 1명의 데이타를 가지고 있는 객체
* - DatBase table 1개의 row데이타를 맵핑할객체
* - RandomAccess File 1개의 레코드를 맵핑할객체
* - Value Object(VO) , Data Transfer Object(DTO) 라고도함
*
* 번호는 중복되지않는다.
*
*/
public class Member {
private int no;
private String name;
private int age;
private String address;
public Member() {
// TODO Auto-generated constructor stub
}
public Member(int no, String name, int age, String address) {
this.no = no;
this.name = name;
this.age = age;
this.address = address;
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public String getAddress() {
return address;
}
public void setAddress(String address) {
this.address = address;
}
@Override
public String toString() {
return no+ "\t" + name + "\t" + age + "\t" + address;
}
}
```
PrintWriterBufferredReaderMain.java
```package char_stream.filter_stream;
import java.io.BufferedReader;
import java.io.FileDescriptor;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
public class PrintWriterBufferredReaderMain {
public static void main(String[] args) throws Exception{
FileReader fr=new FileReader(FileDescriptor.in);
BufferedReader br=new BufferedReader(fr);
PrintWriter pw= new PrintWriter(new FileWriter("consoleFile.txt"));
while (true) {
//Console
String readLine=br.readLine();
if(readLine==null){
break;
}
pw.println(readLine);
pw.flush();
}
}
}
```
VariableDeclare.java
``` /*
변수의선언
- 의미:JVM 에게메모리를할당해달라고
요청하는작업
- 형태:
데이타타입 이름;
ex> int number;
- 변수식별자규직(클래스이름,변수이름,메쏘드이름)
- 영문이나,한글로시작
- 특수문자사용불가(_,$)
- 키워드 사용금지
*/
public class VariableDeclare {
public static void main(String[] args) {
// 단문주석
/*
장문주석1
장문주석2
*/
int score;
score = 100;
int score1 = 200;
int _score = 300;
//int 2score = 400;
int 스코어 = 500;
System.out.println("score = " + score);
System.out.println("score = " + score1);
System.out.println("score = " + _score);
System.out.println("score = " + 스코어);
// 1 line copy(ctrl+alt+down arrow)
}
}
```
CarMain.java
```
public class CarMain {
public static void main(String[] args) {
//입차
Car c1 = new Car();
c1.no="1234";
c1.inTime=12;
Car c2 = new Car();
c2.no="4567";
c2.inTime=13;
//3시간후
//출차
c1.outTime = 15;
c1.fee = (c1.outTime - c1.inTime)*1000;
System.out.println("-----------------");
System.out.println("차량번호 : " + c1.no);
System.out.println("입차시간 : " + c1.inTime);
System.out.println("출차시간 : " + c1.outTime);
System.out.println("주차요금 : " + c1.fee);
System.out.println("-----------------");
c2.outTime = 19;
c2.fee = (c2.outTime - c2.inTime)*1000;
System.out.println("-----------------");
System.out.println("차량번호 : " + c2.no);
System.out.println("입차시간 : " + c2.inTime);
System.out.println("출차시간 : " + c2.outTime);
System.out.println("주차요금 : " + c2.fee);
System.out.println("-----------------");
}
}
```
SubClass.java
```
public class SubClass extends SuperClass {
public void method1(){
System.out.println("³ SuperClass method1 ÀçÁ¤ÀÇ");
}
/*
public void method2(){
Cannot override the final method from SuperClass
}
*/
}
```
EmpDaoImplzy.java
```package jdbc.emp;
import java.sql.Connection;
import java.sql.Date;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.Statement;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import jdbc.common.RdbDao;
import jdbc.member.ConnectionFactory;
import jdbc.member.MemberDto;
public class EmpDaoImplzy extends RdbDao implements EmpDao{
@Override
public int insert(Emp insertEmp) throws Exception {
Connection con = null;
PreparedStatement pstmt = null;
String insertSql = "insert into emp values(?,?,?,?,?,?,?,?)";
int row = 0;
try{
con = ConnectionFactory.getConnection();
pstmt = con.prepareStatement(insertSql);
pstmt.setInt(1, insertEmp.getEmpno());
pstmt.setString(2, insertEmp.getEname());
pstmt.setString(3, insertEmp.getJob());
pstmt.setInt(4, insertEmp.getMgr());
pstmt.setDate(5, insertEmp.getHiredate());
pstmt.setDouble(6, insertEmp.getSal());
pstmt.setDouble(7, insertEmp.getComm());
pstmt.setInt(8, insertEmp.getDeptno());
row = pstmt.executeUpdate();
}finally{
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int delete(int empno) throws Exception {
Connection con=null;
Statement stmt=null;
String deleteSql="delete from emp where empno="+empno;
int row = 0;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
row = stmt.executeUpdate(deleteSql);
} finally {
try {
ConnectionFactory.releaseConnection(con);
} catch (Exception e) {
}
}
return row;
}
@Override
public int update(Emp updateEmp) throws Exception {
// TODO Auto-generated method stub
return 0;
}
@Override
public Emp findByNo(int empno) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
Emp empM = null;
String findSql = "select * from emp where empno="+empno;
try {
con=ConnectionFactory.getConnection();
stmt=con.createStatement();
rs=stmt.executeQuery(findSql);
if(rs.next()){
int no = rs.getInt("empno");
String ename = rs.getString("ename");
String job = rs.getString("job");
int mgr = rs.getInt("mgr");
Date hiredate = rs.getDate("hiredate");
double sal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
empM = new Emp(no,ename,job,mgr,hiredate,sal,comm,deptno);
}
} finally {
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}
return empM;
}
@Override
public List<Emp> findByName(String ename) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
List<Emp> empAll = new ArrayList<Emp>();
Emp emp = null;
String selectAll = "select * from emp where ename='"+ename+"'";
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int empno = rs.getInt("empno");
String name = rs.getString("ename");
String job = rs.getString("job");
int mgr = rs.getInt("mgr");
Date hiredate = rs.getDate("hiredate");
double sal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
emp = new Emp(empno,name,job,mgr,hiredate,sal,comm,deptno);
empAll.add(emp);
}
}catch(Exception e){
System.out.println("찾을수없습니다.");
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return empAll;
}
@Override
public List<Emp> findBySal(int sal) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
List<Emp> empAll = new ArrayList<Emp>();
Emp emp = null;
String selectAll = "select * from emp where sal>="+sal;
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int empno = rs.getInt("empno");
String name = rs.getString("ename");
String job = rs.getString("job");
int mgr = rs.getInt("mgr");
Date hiredate = rs.getDate("hiredate");
double empsal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
emp = new Emp(empno,name,job,mgr,hiredate,empsal,comm,deptno);
empAll.add(emp);
}
}catch(Exception e){
System.out.println("찾을수없습니다.");
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return empAll;
}
@Override
public List<Emp> findByJob(String job) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
List<Emp> empAll = new ArrayList<Emp>();
Emp emp = null;
String selectAll = "select * from emp where job='"+job+"'";
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int empno = rs.getInt("empno");
String name = rs.getString("ename");
String empjob = rs.getString("job");
int mgr = rs.getInt("mgr");
Date hiredate = rs.getDate("hiredate");
double sal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
emp = new Emp(empno,name,empjob,mgr,hiredate,sal,comm,deptno);
empAll.add(emp);
}
}catch(Exception e){
System.out.println("찾을수없습니다.");
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return empAll;
}
@Override
public List<Emp> findByHireDate(String hireDate) throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
List<Emp> empAll = new ArrayList<Emp>();
Emp emp = null;
String selectAll = "select * from emp where hiredate='"+hireDate+"'";
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int empno = rs.getInt("empno");
String name = rs.getString("ename");
String empjob = rs.getString("job");
int mgr = rs.getInt("mgr");
Date emphiredate = rs.getDate("hiredate");
double sal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
emp = new Emp(empno,name,empjob,mgr,emphiredate,sal,comm,deptno);
empAll.add(emp);
}
}catch(Exception e){
System.out.println("찾을수없습니다.");
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return empAll;
}
@Override
public List<Emp> findByMgr(int mgr) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByComm(int comm) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByDept(int deptNo) throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public List<Emp> findByAllEmp() throws Exception {
Connection con = null;
Statement stmt = null;
ResultSet rs = null;
//DateFormat sdFormat = new SimpleDateFormat("YYYY/MM/DD");
List<Emp> empAll = new ArrayList<Emp>();
Emp emp = null;
String selectAll = "select * from emp";
try{
con = ConnectionFactory.getConnection();
stmt = con.createStatement();
rs = stmt.executeQuery(selectAll);
while(rs.next()){
int empno = rs.getInt("empno");
String ename = rs.getString("ename");
String job = rs.getString("job");
int mgr = rs.getInt("mgr");
//Date hdate = rs.getDate("hiredate");
//String hiredate = sdFormat.format(hdate);
Date hiredate = rs.getDate("hiredate");
double sal = rs.getInt("sal");
double comm = rs.getInt("comm");
int deptno = rs.getInt("deptno");
emp = new Emp(empno,ename,job,mgr,hiredate,sal,comm,deptno);
empAll.add(emp);
}
}catch(Exception e){
System.out.println("ERROR MSG :" + e.getMessage());
e.printStackTrace();
}finally{
try{
if(rs!=null)
rs.close();
if(stmt!=null)
stmt.close();
ConnectionFactory.releaseConnection(con);
}catch(Exception e){
e.printStackTrace();
}
}
return empAll;
}
@Override
public List<Map<String, Object>> findAllEmpDept() throws Exception {
// TODO Auto-generated method stub
return null;
}
@Override
public Map<String, Object> findByNoEmpDept(int empno) throws Exception {
// TODO Auto-generated method stub
return null;
}
}
```
ScrollableResultSetMain.java
```package jdbc.resultset;
import java.sql.Connection;
import java.sql.Date;
import java.sql.ResultSet;
import java.sql.Statement;
import java.util.Random;
import jdbc.member.ConnectionFactory;
public class ScrollableResultSetMain {
public static void main(String[] args) throws Exception{
Connection con = ConnectionFactory.getConnection();
Statement stmt = con.createStatement(ResultSet.TYPE_SCROLL_SENSITIVE, ResultSet.CONCUR_UPDATABLE);
ResultSet rs = stmt.executeQuery("select empno,ename,job,mgr,hiredate,sal,comm,deptno from emp order by empno asc");
rs.afterLast();
System.out.println("---------------afterLast------------------");
while (rs.previous()) {
int empno=rs.getInt(1);
String ename = rs.getString(2);
String job = rs.getString(3);
Date hireDate = rs.getDate(5);
System.out.println(empno+" \t "+ename+" \t "+job+" \t "+hireDate);
}
System.out.println("----------------rs.next()-----------------");
while (rs.next()) {
int empno=rs.getInt(1);
String ename = rs.getString(2);
String job = rs.getString(3);
Date hireDate = rs.getDate(5);
System.out.println(empno+" \t "+ename+" \t "+job+" \t "+hireDate);
}
System.out.println("------------------first---------------------");
rs.first();
System.out.println(rs.getInt("empno")+" \t "+rs.getString("ename"));
System.out.println("------------------last---------------------");
rs.last();
System.out.println(rs.getInt("empno")+" \t "+rs.getString("ename"));
int rowCount = rs.getRow();
System.out.println("rowCount : " + rowCount);
System.out.println("------------------absolute-----------------");
rs.absolute(3);
System.out.println(rs.getInt("empno")+" \t "+rs.getString("ename"));
System.out.println("-------------------relative--------------------");
rs.relative(1);//rs.relative(-1);
System.out.println(rs.getInt("empno")+" \t "+rs.getString("ename"));
System.out.println("---------------update resultset---------------------");
System.out.println("---------------1.update---------------------");
rs.first();
rs.updateString(2, "KIM");
rs.updateRow();
System.out.println(rs.getInt("empno")+" \t "+rs.getString("ename"));
System.out.println("---------------2.delete---------------------");
rs.last();
rs.deleteRow();
System.out.println("---------------2.insert---------------------");
rs.moveToInsertRow();
rs.updateInt(1, 9800);
rs.updateString(2, "±è°æÈ£");
rs.updateString(3, "CLERK");
rs.updateInt(4, 7900);
rs.updateDate(5, new Date(System.currentTimeMillis()));
rs.updateDouble(6, 3000.67);
rs.updateFloat(7, 200f);
rs.updateInt(8, 10);
rs.insertRow();
System.out.println("------------select---------------");
rs.beforeFirst();
while(rs.next()){
int empno=rs.getInt(1);
String ename = rs.getString(2);
String job = rs.getString(3);
Date hireDate = rs.getDate(5);
System.out.println(empno+" \t "+ename+" \t "+job+" \t "+hireDate);
}
rs.last();
}
}
```
CalculatorFrame_copy.java
```package layout;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.Frame;
import java.awt.GridLayout;
import java.awt.Panel;
import java.awt.TextField;
public class CalculatorFrame_copy extends Frame {
Button b1,b2,b3,b4,b5,b6,b7,b8,b9,b0,bAdd,bSub,bMul,bDiv,bDot,bEql,bClean;
TextField inputTF;
TextField outputTF;
Panel northP;
Panel centerP;
public CalculatorFrame_copy(){
b1 = new Button("1");
b2 = new Button("2");
b3 = new Button("3");
b4 = new Button("4");
b5 = new Button("5");
b6 = new Button("6");
b7 = new Button("7");
b8 = new Button("8");
b9 = new Button("9");
b0 = new Button("0");
bAdd = new Button("+");
bSub = new Button("-");
bMul = new Button("*");
bDiv = new Button("/");
bDot = new Button(".");
bEql = new Button("=");
bClean = new Button("C");
inputTF = new TextField();
outputTF = new TextField();
northP = new Panel();
northP.setBackground(new Color (251,255,250));
northP.setLayout(new GridLayout(0,1));
northP.add(inputTF);
northP.add(outputTF);
centerP = new Panel();
centerP.setLayout(new GridLayout(0,4,5,5));
centerP.add(b7);
centerP.add(b8);
centerP.add(b9);
centerP.add(bDiv);
centerP.add(b4);
centerP.add(b5);
centerP.add(b6);
centerP.add(bMul);
centerP.add(b1);
centerP.add(b2);
centerP.add(b3);
centerP.add(bSub);
centerP.add(bEql);
centerP.add(b0);
centerP.add(bClean);
centerP.add(bAdd);
setTitle("°è»ê±â");
setLayout(new BorderLayout());
add(northP,BorderLayout.NORTH);
add(centerP,BorderLayout.CENTER);
setSize(300,400);
setVisible(true);
}
public static void main(String[] args) {
new CalculatorFrame_copy();
}
}
```
ButtonActionEventHandler.java
```package event;
import java.awt.Color;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
public class ButtonActionEventHandler implements ActionListener{
ButtonActionEventFrame f;
public ButtonActionEventHandler(ButtonActionEventFrame f) {
this.f = f;
}
int count;
@Override
public void actionPerformed(ActionEvent e) {
System.out.println(e.toString());
f.setTitle(count + ",");
int r = (int) (Math.random()*255);
int g = (int) (Math.random()*255);
int b = (int) (Math.random()*255);
f.setBackground(new Color(r,g,b));
}
}
```
ButtonActionEventFrameInnerClass.java
```package event;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.Frame;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
/*
Event program방법
1. XXXEvent Source 선정(Button)(XXXEvent의 종류)--> ActionEvent
2. XXXEvent Handler 작성(클래스)-->ActionEvent Handler작성
3. Event Source 와 Event Handler를 연결해준다.
ex> EventSource객체.addXXXListener(Event Handler 객체)
<<b.addActionListener(.);>>
# XXXEvent Handler 클래스 작성방법
1.XXXEvent를 감지(처리)할수있는 XXXListener interface를 implement
(ActionEvent) (ActionListener)
2.XXXListener 추상메쏘드 구현..
(WindowListener)
*/
public class ButtonActionEventFrameInnerClass extends Frame{
Button b;
public ButtonActionEventFrameInnerClass(){
b = new Button("이벤트소스[]");
add(b,BorderLayout.SOUTH);
//event
b.addActionListener(new ButtonActionEventHandlerInnerClass());
setSize(300,400);
setVisible(true);
}
/***************************member inner class*******************************/
public class ButtonActionEventHandlerInnerClass implements ActionListener{
int count;
@Override
public void actionPerformed(ActionEvent e) {
System.out.println(e.toString());
setTitle(count + ",");
int r = (int) (Math.random()*255);
int g = (int) (Math.random()*255);
int b = (int) (Math.random()*255);
setBackground(new Color(r,g,b));
}
}
/****************************************************************************/
public static void main(String[] args) {
new ButtonActionEventFrameInnerClass();
}
}
```
ContainerFrame.java
```package basic;
import java.awt.Color;
import java.awt.Frame;
public class ContainerFrame {
Frame f;
public ContainerFrame() {
f = new Frame();
f.setBackground(Color.cyan);
f.setSize(300, 400);
f.setVisible(true);
}
}
```
NoGenricMain.java
```package com.itwill.collection;
public class NoGenricMain {
public static void main(String[] args) {
NoGeneric ng = new NoGeneric();
ng.setElement(new Account("1234","KIM", 34000, 4.5f));
//ng.setElement(new Car("1111", 12));
Account getAccount = (Account)ng.getElement();
System.out.println(getAccount);
//Generic<Account> g = new Generic<Account>();
//g.setMember(new Account("1325", "CHOI", 50000, 2.8f));
//g.setMember(new Car("1524", 12));
//Account getAccount1 = g.getMember();
//System.out.println(getAccount1);
}
}
```
MemberMethod.java
```
public class MemberMethod {
public void method1(){
System.out.println("MemberMethod.method1()실행");
return;
}
public String method2(String str){
System.out.println("method2()실행");
String helloStr="안녕";
return helloStr;
}
public int method3(int a,int b){
System.out.println("method3()실행");
int result = a+b;
return result;
}
}
```
InterfaceImplMain.java
```
public class InterfaceImplMain {
public static void main(String[] args) {
InterfaceImpl ii1 = new InterfaceImpl();
ii1.method1();
ii1.method2();
ii1.method3();
ii1.method4();
Interface1 i1 = ii1;
i1.method1();
i1.method2();
//i1.method3();
//i1.method4();
Interface2 i2 = ii1;
//i2.method1();
//i2.method2();
i2.method3();
i2.method4();
Interface1 i11 = new InterfaceImpl();
i11.method1();
i11.method2();
Interface2 i22 = (Interface2)i11;
i22.method3();
i22.method4();
}
}
```
ChatFrame.java
```package chat.client;
import java.awt.BorderLayout;
import java.awt.Button;
import java.awt.Color;
import java.awt.FlowLayout;
import java.awt.Font;
import java.awt.Frame;
import java.awt.Label;
import java.awt.Panel;
import java.awt.TextArea;
import java.awt.TextField;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.IOException;
import java.net.Socket;
import java.net.UnknownHostException;
import javax.swing.JOptionPane;
public class ChatFrame extends Frame{
Label chatL;
TextArea chatTA;
Panel chatP;
TextField chatTF;
Button chatB;
ChatClientHandler clientHandler;
public ChatFrame() {
setTitle("ㅋㅋ 채팅");
setFont(new Font(Font.DIALOG, Font.BOLD, 17));
chatL=new Label("ㅋㅋ 채팅",Label.CENTER);
chatL.setBackground(Color.GREEN);
chatL.setForeground(Color.PINK);
chatTA=new TextArea();
chatTA.setEnabled(false);
chatTA.setText("경호:이따만나요~~~~\n");
chatP=new Panel();
chatTF=new TextField(20);
chatB=new Button("전송");
chatP.setLayout(new FlowLayout());
chatP.add(chatTF);
chatP.add(chatB);
setLayout(new BorderLayout());
add(chatL,BorderLayout.NORTH);
add(chatTA,BorderLayout.CENTER);
add(chatP,BorderLayout.SOUTH);
this.addWindowListener(new WindowAdapter() {
@Override
public void windowClosing(WindowEvent e) {
try {
clientHandler.close();
} catch (Exception e1) {
e1.printStackTrace();
}
System.exit(0);
}
});
SendHandler sendHandler=new SendHandler();
chatB.addActionListener(sendHandler);
chatTF.addActionListener(sendHandler);
setSize(300, 400);
setVisible(true);
/**************/
clientHandler=new ChatClientHandler();
try{
clientHandler.connect();
clientHandler.start();
}catch(Exception e){
//dialog..
e.printStackTrace();
}
}
/**************************************************
서버와의 송수신을 담당하는 Thread객체
서버에서 오는 데이타를 받기위해 무한대기
/**************************************************/
public class ChatClientHandler extends Thread{
Socket socket;
DataInputStream dataIn;
DataOutputStream dataOut;
String id;
public void connect() throws Exception{
this.socket=new Socket("172.16.2.1",8888);
this.dataIn=new DataInputStream(socket.getInputStream());
this.dataOut=new DataOutputStream(socket.getOutputStream());
id = socket.getLocalAddress().getHostAddress()
+"["+socket.getLocalPort()+"]";
setTitle(id);
}
@Override
public void run() {
try{
while(true){
System.out.println(
"1.ChatClientHandler:서버에서전송한 데이타를 읽기위해대기");
String readData=dataIn.readUTF();
System.out.println(
"2.ChatClientHandler:읽은데이타를 TextArea에보여준다.");
chatTA.append(readData+"\n");
}
}catch(Exception e){
try {
this.close();
} catch (Exception e1) {
e1.printStackTrace();
}
}
}//end run
private void close() throws Exception{
if(dataIn!=null)
dataIn.close();
if(dataOut!=null)
dataOut.close();
if(socket!=null)
socket.close();
}
public void send(String chatStr)throws Exception{
dataOut.writeUTF(chatStr);
}
}
/************member inner class*********************/
public class SendHandler implements ActionListener{
@Override
public void actionPerformed(ActionEvent e) {
Object sourceObject=e.getSource();
if(sourceObject instanceof Button){
System.out.println("Button");
}else if(sourceObject instanceof TextField){
System.out.println("TextField");
}
String chatStr=chatTF.getText();
if(chatStr.equals("")){
return;
}
//network전송
try {
clientHandler.send(chatStr);
} catch (Exception e1) {
e1.printStackTrace();
}
chatTF.setText("");
//chatTA.append("지수:"+chatStr+"\n");
return;
}
}
/*************************************************/
public static void main(String[] args) {
new ChatFrame();
}
}```
|
zyadelhady/snack-game
|
zyadelhady/snack-game
index.ts
```const canvas = document.getElementById('gameCanvas') as HTMLCanvasElement;
const canvasContext = canvas.getContext('2d')!;
const yourScore = document.getElementById('score')! as HTMLHeadingElement;
let playerScore = 0;
let isIntersected = false;
let dx = 10;
let dy = 0;
let snake = [
{ x: 150, y: 150 },
{ x: 140, y: 150 },
{ x: 130, y: 150 },
{ x: 120, y: 150 },
{ x: 110, y: 150 },
{ x: 100, y: 150 },
];
const food = {
x: randomTen(0, canvas.width - 10),
y: randomTen(0, canvas.height - 10),
};
const draw = (
color: string,
x: number,
y: number,
width: number,
height: number
) => {
canvasContext.fillStyle = color;
canvasContext.fillRect(x, y, width, height);
};
function randomTen(min: number, max: number) {
return Math.round((Math.random() * (max - min) + min) / 10) * 10;
}
const drawFood = (x: number, y: number) => {
draw('darkred', x, y, 10, 10);
};
let moveSnake = (e: KeyboardEvent) => {
if (e.key === 'ArrowDown' && dy != -10) {
dx = 0;
dy = 10;
} else if (e.key === 'ArrowUp' && dy != 10) {
dx = 0;
dy = -10;
} else if (e.key === 'ArrowRight' && dx != -10) {
dx = 10;
dy = 0;
} else if (e.key === 'ArrowLeft' && dx != 10) {
dx = -10;
dy = 0;
}
};
const intersect = () => {
for (let i = 1; i < snake.length - 1; i++) {
if (snake[0].x === snake[i].x && snake[0].y === snake[i].y) {
isIntersected = true;
}
}
};
const eat = () => {
if (
snake[0].x >= food.x &&
snake[0].x <= food.x + 10 &&
snake[0].y >= food.y &&
snake[0].y <= food.y + 10
) {
playerScore++;
food.x = randomTen(0, canvas.width - 10);
food.y = randomTen(0, canvas.height - 10);
snake.push({
x: snake[snake.length - 1].x - 10,
y: snake[snake.length - 1].y,
});
}
};
const SnakeMovment = (dx = 0, dy = 0) => {
const head = { x: snake[0].x + dx, y: snake[0].y + dy };
snake.unshift(head);
snake.pop();
};
setInterval(() => {
draw('black', 0, 0, canvas.width, canvas.height);
if (isIntersected) {
canvasContext.fillStyle = 'white';
canvasContext.font = '50px VT323';
canvasContext.textAlign = 'center';
canvasContext.fillText('GAME OVER', canvas.width / 2, canvas.height / 2);
canvasContext.fillText(
'CLICK TO CONTINUE',
canvas.width / 2,
canvas.height / 2 + 100
);
snake = [
{ x: 150, y: 150 },
{ x: 140, y: 150 },
{ x: 130, y: 150 },
{ x: 120, y: 150 },
{ x: 110, y: 150 },
{ x: 100, y: 150 },
];
playerScore = 0;
canvas.addEventListener('click', () => {
isIntersected = false;
});
} else {
for (let i = 0; i < snake.length; i++) {
if (snake[i].x < 0) {
snake[i].x = canvas.width;
}
if (snake[i].x > canvas.width) {
snake[i].x = 1;
}
if (snake[i].y > canvas.height) {
snake[i].y = 1;
}
if (snake[i].y < 0) {
snake[i].y = canvas.height;
}
}
intersect();
document.addEventListener('keydown', moveSnake, { once: true });
drawFood(food.x, food.y);
eat();
SnakeMovment(dx, dy);
for (let i = 0; i < snake.length; i++) {
if (i === 0) {
draw('blue', snake[i].x, snake[i].y, 10, 10);
} else if (i === snake.length - 1) {
draw('green', snake[i].x, snake[i].y, 10, 10);
} else {
draw('white', snake[i].x, snake[i].y, 10, 10);
}
}
yourScore.textContent = playerScore.toString();
}
}, 100);
```
index.js
```"use strict";
const canvas = document.getElementById('gameCanvas');
const canvasContext = canvas.getContext('2d');
const yourScore = document.getElementById('score');
let playerScore = 0;
let isIntersected = false;
let dx = 10;
let dy = 0;
let snake = [
{ x: 150, y: 150 },
{ x: 140, y: 150 },
{ x: 130, y: 150 },
{ x: 120, y: 150 },
{ x: 110, y: 150 },
{ x: 100, y: 150 },
];
const food = {
x: randomTen(0, canvas.width - 10),
y: randomTen(0, canvas.height - 10),
};
const draw = (color, x, y, width, height) => {
canvasContext.fillStyle = color;
canvasContext.fillRect(x, y, width, height);
};
function randomTen(min, max) {
return Math.round((Math.random() * (max - min) + min) / 10) * 10;
}
const drawFood = (x, y) => {
draw('darkred', x, y, 10, 10);
};
let moveSnake = (e) => {
if (e.key === 'ArrowDown' && dy != -10) {
dx = 0;
dy = 10;
}
else if (e.key === 'ArrowUp' && dy != 10) {
dx = 0;
dy = -10;
}
else if (e.key === 'ArrowRight' && dx != -10) {
dx = 10;
dy = 0;
}
else if (e.key === 'ArrowLeft' && dx != 10) {
dx = -10;
dy = 0;
}
};
const intersect = () => {
for (let i = 1; i < snake.length - 1; i++) {
if (snake[0].x === snake[i].x && snake[0].y === snake[i].y) {
isIntersected = true;
}
}
};
const eat = () => {
if (snake[0].x >= food.x &&
snake[0].x <= food.x + 10 &&
snake[0].y >= food.y &&
snake[0].y <= food.y + 10) {
playerScore++;
food.x = randomTen(0, canvas.width - 10);
food.y = randomTen(0, canvas.height - 10);
snake.push({
x: snake[snake.length - 1].x - 10,
y: snake[snake.length - 1].y,
});
}
};
const SnakeMovment = (dx = 0, dy = 0) => {
const head = { x: snake[0].x + dx, y: snake[0].y + dy };
snake.unshift(head);
snake.pop();
};
setInterval(() => {
draw('black', 0, 0, canvas.width, canvas.height);
if (isIntersected) {
canvasContext.fillStyle = 'white';
canvasContext.font = '50px VT323';
canvasContext.textAlign = 'center';
canvasContext.fillText('GAME OVER', canvas.width / 2, canvas.height / 2);
canvasContext.fillText('CLICK TO CONTINUE', canvas.width / 2, canvas.height / 2 + 100);
snake = [
{ x: 150, y: 150 },
{ x: 140, y: 150 },
{ x: 130, y: 150 },
{ x: 120, y: 150 },
{ x: 110, y: 150 },
{ x: 100, y: 150 },
];
playerScore = 0;
canvas.addEventListener('click', () => {
isIntersected = false;
});
}
else {
for (let i = 0; i < snake.length; i++) {
if (snake[i].x < 0) {
snake[i].x = canvas.width;
}
if (snake[i].x > canvas.width) {
snake[i].x = 1;
}
if (snake[i].y > canvas.height) {
snake[i].y = 1;
}
if (snake[i].y < 0) {
snake[i].y = canvas.height;
}
}
intersect();
document.addEventListener('keydown', moveSnake, { once: true });
drawFood(food.x, food.y);
eat();
SnakeMovment(dx, dy);
for (let i = 0; i < snake.length; i++) {
if (i === 0) {
draw('blue', snake[i].x, snake[i].y, 10, 10);
}
else if (i === snake.length - 1) {
draw('green', snake[i].x, snake[i].y, 10, 10);
}
else {
draw('white', snake[i].x, snake[i].y, 10, 10);
}
}
yourScore.textContent = playerScore.toString();
}
}, 100);
```
README.md
```# snack-game
[DEMO](https://snack-game.vercel.app/)
```
|
zycode1561/JavaCrawler
|
zycode1561/JavaCrawler
JobProcessor.java
```package com.zycode.job.task;
import com.zycode.job.pojo.JobInfo;
import org.jsoup.Jsoup;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.scheduling.annotation.Scheduled;
import org.springframework.stereotype.Component;
import us.codecraft.webmagic.Page;
import us.codecraft.webmagic.Site;
import us.codecraft.webmagic.Spider;
import us.codecraft.webmagic.processor.PageProcessor;
import us.codecraft.webmagic.scheduler.BloomFilterDuplicateRemover;
import us.codecraft.webmagic.scheduler.QueueScheduler;
import us.codecraft.webmagic.selector.Html;
import us.codecraft.webmagic.selector.Selectable;
import java.util.List;
@Component
public class JobProcessor implements PageProcessor {
private String url = "https://search.51job.com/list/170600,000000,0000,00,9,99,%2B,2,1.html?lang=c&postchannel=0000&workyear=99&cotype=99°reefrom=99&jobterm=99&companysize=99&ord_field=0&dibiaoid=0&line=&welfare=";
@Override
public void process(Page page) {
//解析页面，获取招聘信息详情的url地址
List<Selectable> list = page.getHtml().css("div#resultList div.el").nodes();
//判断获取到的集合是否为空，
if(list.size()==0) {
//如果为空，表示这是招聘详情页,解析页面，获取招聘详情，保存数据
this.saveJobInfo(page);
}else {
//如果不为空，表示这是列表页,解析出详情页的url地址，放到队列中
for (Selectable selectable : list) {
//获取url地址
String jobInfoUrl = selectable.links().toString();
//把获取到的url地址放入任务队列中
page.addTargetRequest(jobInfoUrl);
}
//获取下一页的url
String bkUrl = page.getHtml().css("div.p_in li.bk").nodes().get(1).links().toString();
//把url放入任务队列中
page.addTargetRequest(bkUrl);
}
String html = page.getHtml().toString();
}
//解析页面，获取招聘详情,保存数据
private void saveJobInfo(Page page) {
//创建招聘详情对象
JobInfo jobInfo = new JobInfo();
//解析页面
Html html = page.getHtml();
//获取数据，封装到对象中
String text = Jsoup.parse(html.css("p.msg").toString()).text();
String companyAddr = text.substring(0,text.indexOf("|"));
jobInfo.setCompanyName(html.css("div.cn p.cname a","text").toString());
jobInfo.setCompanyAddr(companyAddr.trim());
jobInfo.setCompanyInfo(Jsoup.parse(html.css("div.tmsg").toString()).text());
jobInfo.setJobName(html.css("div.cn h1","text").toString());
jobInfo.setJobAddr(Jsoup.parse(html.css("div.bmsg").nodes().get(1).toString()).text());
jobInfo.setJobInfo(Jsoup.parse(html.css("div.job_msg").toString()).text());
jobInfo.setUrl(page.getUrl().toString());
jobInfo.setSalary(html.css("div.cn strong","text").toString());
// jobInfo.setSalaryMin();
// jobInfo.setSalaryMax();
// String time = text.substring(text.lastIndexOf("|"));
String[] strings = text.split("[|]");
for (String string : strings) {
if(string.contains("发布")){
jobInfo.setTime(string.replace("发布",""));
// System.out.println(string.charAt(0));
}
}
//把结果保存起来
page.putField("jobInfo",jobInfo);
}
private Site site = Site.me()
.setCharset("gbk")//设置编码
.setTimeOut(10*1000)//设置超时时间
.setRetrySleepTime(3000)//设置重试的间隔时间
.setRetryTimes(3)//设置重试次数
.setUserAgent("Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:50.0) Gecko/20100101 Firefox/50.0");//设置浏览器代理
@Override
public Site getSite() {
return site;
}
@Autowired
private SpringDataPipeline springDataPipeline;
//initialDelay：任务启动后等待多久启动方法
//fixedDelay：每隔多久执行方法
@Scheduled(initialDelay = 2000,fixedDelay = 10*1000)
public void process(){
Spider.create(new JobProcessor())
.addUrl(url)
.setScheduler(new QueueScheduler().setDuplicateRemover(new BloomFilterDuplicateRemover(100000)))
.thread(10)
.addPipeline(springDataPipeline)
.run();
}
}
```
README.md
```# JavaCrawler
Java爬虫练习响应代码
含有WebMagic核心包
```
JobInfoService.java
```package com.zycode.job.service;
import com.zycode.job.pojo.JobInfo;
import java.util.List;
public interface JobInfoService {
/**
* 保存工作信息
* @param jobInfo
*/
public void save(JobInfo jobInfo);
public List<JobInfo> findJobInfo(JobInfo jobInfo);
}
```
TaskController.java
```package com.zycode.demo.controller;
import com.zycode.demo.task.ItemTask;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Controller;
import org.springframework.web.bind.annotation.GetMapping;
import org.springframework.web.bind.annotation.RequestMapping;
import org.springframework.web.bind.annotation.RestController;
@RestController
public class TaskController {
@Autowired
private ItemTask itemTask;
@RequestMapping("/doTask")
public void doTask() throws Exception {
itemTask.itemTask();
}
}
```
job.sql
```CREATE TABLE `job_info` (
`id` bigint(20) NOT NULL AUTO_INCREMENT COMMENT '主键id',
`compony_name` varchar(100) DEFAULT NULL COMMENT '公司名称',
`company_addr` varchar(200) DEFAULT NULL COMMENT '公司联系方式',
`company_info` text COMMENT '公司信息',
`job_name` varchar(100) DEFAULT NULL COMMENT '职位名称',
`job_addr` varchar(50) DEFAULT NULL COMMENT '工作地点',
`job_info` text COMMENT '职位信息',
`salary_min` int(10) DEFAULT NULL COMMENT '薪资范围，最小',
`salary_max` int(10) DEFAULT NULL COMMENT '薪资范围，最大',
`url` varchar(150) DEFAULT NULL COMMENT '招聘信息详情页',
`time` varchar(10) DEFAULT NULL COMMENT '职位最近发布时间',
PRIMARY KEY (`id`)
) ENGINE=InnoDB DEFAULT CHARSET=utf8 COMMENT='招聘信息';```
ItemService.java
```package com.zycode.demo.service;
import com.zycode.demo.pojo.Item;
import org.springframework.stereotype.Service;
import java.util.List;
public interface ItemService {
/**
* 保存商品
* @param item
*/
public void save(Item item);
/**
* 根据条件查询商品
* @param item
* @return
*/
public List<Item> findAll(Item item);
}
```
ItemDao.java
```package com.zycode.demo.dao;
import com.zycode.demo.pojo.Item;
import org.springframework.data.jpa.repository.JpaRepository;
public interface ItemDao extends JpaRepository<Item,Long> {
}
```
JobInfo.java
```package com.zycode.job.pojo;
import lombok.Data;
import javax.persistence.*;
@Entity
@Table(name="job_info")
@Data
public class JobInfo {
@Id
@GeneratedValue(strategy = GenerationType.IDENTITY)
private Long id;
private String companyName;
private String companyAddr;
private String companyInfo;
private String jobName;
private String jobAddr;
private String jobInfo;
private String salary;
private String url;
private String time;
}
```
JobProcessor.java
```package com.zycode.webmagic.test;
import us.codecraft.webmagic.Page;
import us.codecraft.webmagic.Site;
import us.codecraft.webmagic.Spider;
import us.codecraft.webmagic.processor.PageProcessor;
import us.codecraft.webmagic.scheduler.BloomFilterDuplicateRemover;
import us.codecraft.webmagic.scheduler.QueueScheduler;
import us.codecraft.webmagic.scheduler.Scheduler;
public class JobProcessor implements PageProcessor {
/**
* 负责解析页面
* @param page page 发起请求组获取到的数据
*/
@Override
public void process(Page page) {
//解析返回数据Page，并把解析的结果放到ResultItem中
page.putField("title",page.getHtml().css("title"));
}
private Site site = Site.me()
.setCharset("utf8") //设置编码格式
.setTimeOut(10*1000) //设置超时时间，单位是ms
.setRetrySleepTime(3000) //设置重试的间隔时间
.setSleepTime(3) //设置重试次数
;
@Override
public Site getSite() {
return site;
}
//主函数，执行爬虫
public static void main(String[] args) {
Spider spider = Spider.create(new JobProcessor())
.addUrl("https://www.jd.com/")//设置爬取数据的页面
.thread(5)
.setScheduler(new QueueScheduler().setDuplicateRemover(new BloomFilterDuplicateRemover(10000000)));
Scheduler scheduler = spider.getScheduler();
//执行爬虫
spider.run();
}
}
```
HttpUtils.java
```package com.zycode.demo.utils;
import org.apache.http.client.config.RequestConfig;
import org.apache.http.client.methods.CloseableHttpResponse;
import org.apache.http.client.methods.HttpGet;
import org.apache.http.impl.client.CloseableHttpClient;
import org.apache.http.impl.client.HttpClients;
import org.apache.http.impl.conn.PoolingHttpClientConnectionManager;
import org.apache.http.util.EntityUtils;
import org.springframework.stereotype.Component;
import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStream;
import java.util.UUID;
@Component
public class HttpUtils {
private PoolingHttpClientConnectionManager cm;
public HttpUtils() {
this.cm = new PoolingHttpClientConnectionManager();
//设置最大连接数
this.cm.setMaxTotal(100);
//设置每个主机的最大连接数
this.cm.setDefaultMaxPerRoute(10);
}
/**
* 很具请求地址下载页面数据
*
* @param url
* @return
*/
public String doGetHtml(String url) {
//获取HttpClient对象
CloseableHttpClient httpClient = HttpClients.custom().setConnectionManager(this.cm).build();
//创建HttpGet请求对象，设置URL
HttpGet httpGet = new HttpGet(url);
//设置请求信息
httpGet.setConfig(this.getConfig());
//模拟浏览器
httpGet.setHeader("User-Agent", "Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:50.0) Gecko/20100101 Firefox/50.0");
CloseableHttpResponse response = null;
try {
//使用HttpClient发起请求，获取响应
response = httpClient.execute(httpGet);
//解析响应。返回结果
if (response.getStatusLine().getStatusCode() == 200) {
//判断响应体Entity是否不为空，如果不为空就可以使用EntityUtils
if (response.getEntity() != null) {
String content = EntityUtils.toString(response.getEntity(), "utf8");
return content;
} else {
return "";
}
}
} catch (IOException e) {
e.printStackTrace();
} finally {
if (response != null) {
try {
response.close();
} catch (IOException e) {
e.printStackTrace();
}
}
}
return "";
}
/**
* 下载图片
*
* @param url
* @return 图片名称
*/
public String doGetImage(String url) {
//获取HttpClient对象
CloseableHttpClient httpClient = HttpClients.custom().setConnectionManager(this.cm).build();
//创建HttpGet请求对象，设置URL
HttpGet httpGet = new HttpGet(url);
//设置请求信息
httpGet.setConfig(this.getConfig());
CloseableHttpResponse response = null;
try {
//使用HttpClient发起请求，获取响应
response = httpClient.execute(httpGet);
//解析响应。返回结果
if (response.getStatusLine().getStatusCode() == 200) {
//判断响应体Entity是否不为空，如果不为空就可以使用EntityUtils
if (response.getEntity() != null) {
//下载图片
//获取图片的后缀
String extName = url.substring(url.lastIndexOf("."));
//创建一个图片名，重命名图片
String picName = UUID.randomUUID().toString()+extName;
//下载图片
//声明OutPutStream
OutputStream outputStream = new FileOutputStream(new File("/Users/zhangyun/Desktop/javaTest/image/"+picName));
response.getEntity().writeTo(outputStream);
//返回图片名称
return picName;
} else {
return "";
}
}
} catch (IOException e) {
e.printStackTrace();
} finally {
if (response != null) {
try {
response.close();
} catch (IOException e) {
e.printStackTrace();
}
}
}
return "";
}
/**
* 设置请求信息
*
* @return
*/
private RequestConfig getConfig() {
RequestConfig config = RequestConfig.custom()
.setConnectTimeout(2000) //创建连接的最长时间
.setConnectionRequestTimeout(500)//获取连接的最长时间
.setSocketTimeout(10 * 1000)//数据传输的最长时间
.build();
return config;
}
}
```
CrawlerFirst.java
```package com.zycode.crawler.test;
import org.apache.http.HttpEntity;
import org.apache.http.client.methods.CloseableHttpResponse;
import org.apache.http.client.methods.HttpGet;
import org.apache.http.impl.client.CloseableHttpClient;
import org.apache.http.impl.client.HttpClients;
import org.apache.http.util.EntityUtils;
import java.io.IOException;
public class CrawlerFirst {
public static void main(String[] args) throws IOException {
CloseableHttpClient client = HttpClients.custom().build();
HttpGet httpGet = new HttpGet("https://www.jianshu.com/");
CloseableHttpResponse response = client.execute(httpGet);
if(response.getStatusLine().getStatusCode() == 200){
HttpEntity entity = response.getEntity();
String content = EntityUtils.toString(entity, "utf8");
System.out.println(content.length());
}
}
}
```
JsoupFirstTest.java
```package jsoup;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.junit.Test;
import java.net.URL;
public class JsoupFirstTest {
@Test
public void testUrl() throws Exception{
//解析url地址，第一个参数是访问的url，第二个参数，是我们访问时候的超时时间
Document doc = Jsoup.parse(new URL("http://www.itcast.cn"), 2000);
//使用标签选择器，获取title标签中的内容
String title = doc.getElementsByTag("title").first().text();
//print
System.out.println(title);
}
}
```
|
zyd0183795/hello-world
|
zyd0183795/hello-world
README.md
```# hello-world
Just another repository
Hello, I'm Zaid Fraij,an Industrial enngineering student at JU.
```
|
zydft111/xianyun
|
zydft111/xianyun
create.js
```export const state = () => {
return {
posts: []
}
}
export const mutations = {
postSave (state, data) {
state.posts.unshift(data);
if (state.posts.length > 5) {
state.posts.length = 5;
}
}
}```
|
zygzagZ/LAB2
|
zygzagZ/LAB2
strset.cc
```#include "strsetconst.h"
#include "strset.h"
#include <cassert>
#include <string>
#include <set>
#include <unordered_map>
namespace {
#ifndef NDEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
using strset_set = std::set<std::string>;
using strset_map = std::unordered_map<unsigned long, strset_set>;
strset_map& zbior() {
static strset_map zbior;
return zbior;
}
unsigned long lastId = 0;
}
namespace jnp1 {
/*Tworzy nowy zbiór i zwraca jego identyfikator.*/
unsigned long strset_new() {
if(debug) {
std::cerr << "strset_new -> " << lastId << std::endl;
}
zbior().emplace(lastId, strset_set());
return lastId++;
}
/*Jeżeli istnieje zbiór o identyfikatorze id, usuwa go, a w przeciwnym
przypadku nie robi nic.*/
void strset_delete(unsigned long id) {
if (id == strset42()) {
if(debug) {
std::cerr << "strset_delete " << id << " is const" << std::endl;
}
return;
}
auto it = zbior().find(id);
if (it == zbior().end()) {
if(debug) {
std::cerr << "strset_delete " << id << " doesn't exist" << std::endl;
}
return;
}
if(debug) {
std::cerr << "strset_delete " << id << std::endl;
}
zbior().erase(it);
if(debug) {
std::cerr << "strset_delete " << id << " success" << std::endl;
}
}
/*Jeżeli istnieje zbiór o identyfikatorze id, zwraca liczbę jego elementów,
a w przeciwnym przypadku zwraca 0.*/
size_t strset_size(unsigned long id) {
auto it = zbior().find(id);
auto ret = it != zbior().end() ? it->second.size() : 0;
if(debug) {
std::cerr << "strset_size " << id << " -> " << ret << std::endl;
}
return ret;
}
/*Jeżeli istnieje zbiór o identyfikatorze id i element value nie należy do
tego zbioru, to dodaje element do zbioru, a w przeciwnym przypadku nie
robi nic.*/
void strset_insert(unsigned long id, const char* value) {
if(value == nullptr) {
if(debug) {
std::cerr << "strset_insert " << id
<< " invalid value (NULL)" << std::endl;
}
return;
}
std::string strvalue = std::string(value);
if ((strset_size(id) || (strvalue != "42")) && id == strset42()) {
if(debug) {
std::cerr << "strset_insert " << id << " is const" << std::endl;
}
return;
}
auto it = zbior().find(id);
if (it == zbior().end()) {
if(debug) {
std::cerr << "strset_insert " << id << " doesn't exist" << std::endl;
}
return;
}
auto sit = it->second.find(strvalue);
if (sit != it->second.end()) {
if(debug) {
std::cerr << "strset_insert " << id
<< " has value " << value << std::endl;
}
return;
}
if(debug) {
std::cerr << "strset_insert " << id
<< " inserted " << value << std::endl;
}
it->second.insert(strvalue);
}
/*Jeżeli istnieje zbiór o identyfikatorze id i element value należy do tego
zbioru, to usuwa element ze zbioru, a w przeciwnym przypadku nie robi nic.*/
void strset_remove(unsigned long id, const char* value) {
if(value == nullptr) {
if(debug) {
std::cerr << "strset_remove " << id
<< " invalid value (NULL)" << std::endl;
}
return;
}
std::string strvalue = std::string(value);
if (id == strset42()) {
if(debug) {
std::cerr << "strset_remove " << id << " is const" << std::endl;
}
return;
}
auto it = zbior().find(id);
if (it == zbior().end()) {
if(debug) {
std::cerr << "strset_remove " << id << " doesn't exist" << std::endl;
}
return;
}
auto sit = it->second.find(strvalue);
if (sit == it->second.end()) {
if(debug) {
std::cerr << "strset_remove " << id
<< " doesn't have value " << value << std::endl;
}
return;
}
if(debug) {
std::cerr << "strset_remove " << id
<< " removed " << value << std::endl;
}
it->second.erase(sit);
}
/*Jeżeli istnieje zbiór o identyfikatorze id i element value należy do tego
zbioru, to zwraca 1, a w przeciwnym przypadku 0.*/
int strset_test(unsigned long id, const char* value) {
if(value == nullptr) {
return 0;
}
std::string strvalue = std::string(value);
auto it = zbior().find(id);
if (it == zbior().end()) {
if(debug) {
std::cerr << "strset_test " << id << " doesn't exist" << std::endl;
}
return 0;
}
auto sit = it->second.find(strvalue);
auto ret = sit != it->second.end();
if(debug) {
std::cerr << "strset_test " << id << " -> " << ret << std::endl;
}
return ret;
}
/*Jeżeli istnieje zbiór o identyfikatorze id, usuwa wszystkie jego elementy,
a w przeciwnym przypadku nie robi nic.*/
void strset_clear(unsigned long id) {
if (id == strset42()) {
if(debug) {
std::cerr << "strset_clear " << id << " is const" << std::endl;
}
return;
}
auto it = zbior().find(id);
if (it == zbior().end()) {
if(debug) {
std::cerr << "strset_clear " << id << " doesn't exist" << std::endl;
}
return;
}
if(debug) {
std::cerr << "strset_clear " << id << std::endl;
}
it->second.clear();
if(debug) {
std::cerr << "strset_clear " << id << " success" << std::endl;
}
}
/*Porównuje zbiory o identyfikatorach id1 i id2. Niech sorted(id) oznacza
posortowany leksykograficznie zbiór o identyfikatorze id. Takie ciągi już
porównujemy naturalnie: pierwsze miejsce, na którym się różnią, decyduje
o relacji większości. Jeśli jeden ciąg jest prefiksem drugiego, to ten
będący prefiks jest mniejszy. Funkcja strset_comp(id1, id2) powinna zwrócić
-1, gdy sorted(id1) < sorted(id2),
0, gdy sorted(id1) = sorted(id2),
1, gdy sorted(id1) > sorted(id2).
Jeżeli zbiór o którymś z identyfikatorów nie istnieje, to jest traktowany
jako równy zbiorowi pustemu.*/
int strset_comp(unsigned long id1, unsigned long id2) {
size_t size1 = strset_size(id1),
size2 = strset_size(id2);
if (!size1 || !size2) {
auto ret = size1 ? 1 : size2 ? -1 : 0;
if(debug) {
std::cerr << "strset_comp " << id1 << " " << id2
<< " at least one set is empty -> " << ret << std::endl;
}
return ret;
}
auto it1 = zbior().find(id1), it2 = zbior().find(id2);
auto el1 = it1->second.begin(), el2 = it2->second.begin();
if(debug) {
std::cerr << "strset_comp " << id1 << " " << id2 << std::endl;
std::cerr << "set1: ";
for (auto i : it1->second) {
std::cerr << i << ", ";
}
std::cerr << std::endl << "set2: ";
for (auto i : it2->second) {
std::cerr << i << ", ";
}
std::cerr << std::endl;
}
while (el1 != it1->second.end() && el2 != it2->second.end()) {
int cmp = (*el1).compare(*el2);
if (cmp) {
if(debug) {
std::cerr << "strset_comp " << id1 << " " << id2 << " completed on " << *el1 << " / " << *el2 << " -> " << cmp << std::endl;
}
return cmp < 0 ? -1 : cmp ? 1 : 0;
}
el1++;
el2++;
}
auto ret = el1 != it1->second.end() ? 1 : el2 != it2->second.end() ? -1 : 0;
if(debug) {
std::cerr << "strset_comp " << id1 << " " << id2 << " -> " << ret << std::endl;
}
return ret;
}
}
```
m
```#!/bin/bash
gcc -g -Wall -Wextra -O2 -std=c11 -c strset_test1.c -o strset_test1.o
g++ -g -Wall -Wextra -O2 -std=c++17 -c strset.cc -o strset.o
g++ -g -Wall -Wextra -O2 -std=c++17 -c strsetconst.cc -o strsetconst.o
g++ -g strset_test1.o strsetconst.o strset.o -o strset1
g++ -g -Wall -Wextra -O2 -std=c++17 -c strset_test2a.cc -o strset_test2a.o
g++ -g -Wall -Wextra -O2 -std=c++17 -c strset_test2b.cc -o strset_test2b.o
g++ -g strset_test2a.o strsetconst.o strset.o -o strset2a
g++ -g strset_test2b.o strsetconst.o strset.o -o strset2b
```
strsetconst.cc
```#include "strset.h"
#include "strsetconst.h"
namespace {
#ifndef NDEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
unsigned long init_strset42() {
if(debug) {
std::cerr << "strsetconst init invoked" << std::endl;
}
auto id = jnp1::strset_new();
jnp1::strset_insert(id, "42");
return id;
}
}
namespace jnp1 {
unsigned long strset42() {
static unsigned long constId = init_strset42();
return constId;
}
}```
strsetconst.h
```#ifndef __STRSETCONST_H__
#define __STRSETCONST_H__
#ifdef __cplusplus
#include <iostream>
namespace jnp1 {
extern "C" {
#endif
/*Zwraca identyfikator zbioru, którego nie można modyfikować i który zawiera
jeden element: napis "42". Zbiór jest tworzony przy pierwszym wywołaniu tej
funkcji i wtedy zostaje ustalony jego numer.*/
unsigned long strset42();
#ifdef __cplusplus
}
}
#endif
#endif /*__STRSETCONST_H__*/```
|
zyla/javarewrite2016
|
zyla/javarewrite2016
bf.java
```// A simple Brainfuck program to compute 3*5 and obtain 15.
class BF {
int compute_3x5 = run_bf(
// put 3 in cell 0
PLUS ^ PLUS ^ PLUS
// put 5 in cell 1
^ RIGHT ^ PLUS ^ PLUS ^ PLUS ^ PLUS ^ PLUS
// while cell 0 is not empty
^ LEFT
^ LOOP(
// decrement cell 0
MINUS
// add cell 1 to cells 2 and 3
^ RIGHT
^ LOOP(
MINUS
^ RIGHT ^ PLUS
^ RIGHT ^ PLUS
^ LEFT ^ LEFT
)
// move cell 3 back to cell 1
^ RIGHT ^ RIGHT
^ LOOP(
MINUS
^ LEFT ^ LEFT
^ PLUS
^ RIGHT ^ RIGHT
)
^ LEFT ^ LEFT ^ LEFT
)
^ RIGHT ^ RIGHT // cell 2 contains the result (15)
^ nil);
}
```
test.java
```class Test {
void foo() {
if(1 == 1 && true) {
return 10 + (-10);
}
if(1 == 1 && (false && true)) {
return 5 * ((false && true) == false ? 5 : 6);
}
}
}
```
dokumentacja.md
```---
title: "JL.W1: Inspekcja kodu Java"
author:
- Maciej Bielecki
- Przemysław Kopański
- Mateusz Forc
---
## Zadanie
_(cytat z <https://studia.elka.pw.edu.pl/file/16Z/PSZT.A/priv/PSZT-projekt-16Z.pdf>)_
Napisać program, który wykorzystując jeden z dostępnych parserów kodu Java
wykona inspekcje kodu i wykona przekształcenia upraszczające kod. Program ma
przekształcać zadany plik Java wykorzystując zdefiniowane reguły wnioskowania,
np:
```java
System.println(“To jest” + “ “ + “kot”);
System.println(“który jest rudy”);
```
Reguły:
```java
String($a) + String($b) -> String($a$b)
println($a); println($b); -> String($a\n$b)
```
Wynik:
```java
System.println(“To jest kot\nktóry jest rudy”);
```
## Instrukcja obsługi
Aplikacja jest napisana przy użyciu języka Haskell, zatem do jej uruchomienia
potrzebny jest program Stack dodany do zmiennej środowiskowej `PATH`.
Aby zbudować projekt wykorzystując narzędzie Stack należy w katalogu projektu
uruchomić:
```bash
$ stack setup # jeśli nie ma w systemie zainstalowanego GHC 8.0.1
$ stack build
```
Aby uruchomić projekt, należy po zbudowaniu:
```bash
$ stack exec javarewrite2016 -- rules.txt test.java
```
gdzie
- `rules.txt` - plik zawierający reguły przekształcania kodu zapisane zgodnie
ze składnią omówioną poniżej w sekcji Reguły
- `test.java` - Plik źródłowy w języku Java, który zostanie poddany przekształceniom
## Reguły
Reguła składa się ze _zbioru metazmiennych_, _wyrażenia wzorca_ (dalej: LHS) i _wyrażenia
podstawianego_ (dalej RHS), w następującej składni:
```
forall a b c. lhs -> rhs
```
Składnia jest zainspirowana funkcją `RULES` kompilatora GHC[^ghc-rules].
Zbiór metazmiennych jest to zbiór identyfikatorów, które w RHS mają być
traktowane jako metazmienne (zamiast rozróżnienia składniowego typu poprzedzenie
identyfikatora znakiem dolara).
Przykład:
```java
forall a. a + b -> b + a
```
`a` jest tutaj metazmienną, natomiast `b` jest zmienną języka Java. Reguła
pasuje do wyrażenia `3 * 5 + b`, dając w wyniku `b + 3 * 5`, ale nie do
`a + 17`.
Metazmienne mogą dodatkowo mieć określony _typ wyrażenia_ jaki akceptują. W
obecnej wersji programu są to różne rodzaje literałów.
Na przykład wzorzec:
```java
forall (s : StringLiteral). s
```
pasuje do wyrażenia `"EiTI"`, ale nie do `17` lub `new Object().toString()`.
[^ghc-rules]: "Playing by the rules: rewriting as a practical optimisation
technique in GHC". Simon Peyton Jones, Andrew Tolmach and Tony Hoare; Haskell
workshop 2001.
<http://research.microsoft.com/en-us/um/people/simonpj/Papers/rules.htm>
### Kolejność stosowania reguł
Reguły są stosowane w następującej kolejności (do każdego wyrażenia w pliku które nie jest podwyrażeniem innego wyrażenia):
1. Dopóki któraś z reguł pasuje, jest ona aplikowana do wyrażenia po czym wykonywany jest constant folding.
2. Procedura jest aplikowana do każdego podwyrażenia w wyniku powyższej transformacji.
Powyższa procedura jest powtarzana aż żadna z reguł nie zostanie zaaplikowana w pełnym przebiegu.
### Constant folding
Po wykonaniu każdej reguły każde wyrażenie w postaci `constant_fold(...)` jest wyliczane.
`constant_fold(e)` jest zamieniane na wynik operacji wyrażenia _e_, jeśli składa się tylko ze stałych operacji arytmetycznych i łączenia stringów, np:
```
forall (a : StringLiteral) (b : StringLiteral).
a + b -> constant_fold(a + b)
```
### Semantyka reguł
Podstawową operacją wykonywaną na wzorcach jest _dopasowanie wzorca do
wyrażenia_. Jej wynikiem jest _podstawienie_ - przypisanie metazmiennym wzorca
konkretnych wyrażeń, lub porażka w przypadku gdy wyrażenie nie pasuje do wzorca.
Jest to szczególny przypadek _unifikacji_, gdzie tylko jedna strona zawiera
metazmienne.
_Dopasowanie wzorca *e* do wyrażenia *p*_ jest zdefiniowane następująco:
- Jeśli _p_ jest metazmienną wzorca bez określonego typu i _e_ jest wyrażeniem,
_e_ pasuje do _p_ z podstawieniem `p ~> e`.
- Jeśli _p_ jest metazmienną wzorca o typie wyrażenia _t_ i _e_ jest wyrażeniem
pasującym do typu _t_, _e_ pasuje do _p_ z podstawieniem `p ~> e`.
- Jeśli _p_ i _e_ są wyrażeniami tego samego rodzaju, ich _części stałe_
są równe, a każde z podwyrażeń _e_ pasuje do kolejnych podwyrażeń _p_ i
wszystkie podstawienia wynikające z dopasowania podwyrażeń zgadzają się ze
sobą, _e_ pasuje do _p_ z podstawieniem równym sumie podstawień podwyrażeń.
- W przeciwnym przypadku _e_ nie pasuje do _p_.
Podstawienia _zgadzają się ze sobą_, jeśli dla każdej wspólnej metazmiennej
wyrażenia, które przypisują tej metazmiennej są sobie równe.
Z powyższej semantyki wynika, że obsługiwane są wzorce _nieliniowe_, czyli
takie, w których metazmienna może występować więcej niż jeden raz. Przy
dopasowywaniu wszystkie wystąpienia metazmiennej muszą zostać dopasowane do
takiego samego wyrażenia.
Kolejną ważną operacją jest _zastosowanie podstawienia do wyrażenia_ - zamiana
wszystkich wystąpień metazmiennych na odpowiadające im wyrażenia.
_Zastosowanie reguły do wyrażenia_ polega na dopasowaniu wzorca reguły do tego
wyrażenia i zastosowania wynikowego podstawienia do RHS reguły w przypadku
sukcesu.
### Gramatyka języka reguł
```
Rules:
[ Rule { ";;" Rule } ]
Rule:
Pattern "->" Expression
Pattern:
[ "forall" Metavariables "." ] Expression
Metavariables:
Metavariable { Metavariable }
Metavariable:
Identifier
"(" Identifier ":" ExpressionType ")"
ExpressionType:
"IntLiteral"
"WordLiteral"
"FloatLiteral"
"DoubleLiteral"
"BooleanLiteral"
"CharLiteral"
"StringLiteral"
"NullLiteral"
```
Konwencja zapisu gramatyki, jak i symbole nieterminalne `Expression` i `Identifier`
są zdefiniowane w _Java Language Specification, 2. Grammars_[^jls-grammars], z
tą różnicą, że terminale są zawarte w znakach "`"`".
[^jls-grammars]: <https://docs.oracle.com/javase/specs/jls/se8/html/jls-2.html>
## Implementacja
Program został zaimplementowany w języku [Haskell][].
Do konwersji pomiędzy tekstem a AST Javy została wykorzystana biblioteka
`language-java`, dostępna na repozytorium Hackage[^language-java]. Wykorzystanie w tej
bibliotece parserów utworzonych za pomocą kombinatorów (_parser combinators_)
pozwoliło łatwo zdefiniować parser reguł używając fragmentów gramatyki języka
Java (moduł `JavaRewrite.RuleParser`). Biblioteka nie jest jednak w pełni
dopracowana, więc w celu jej użycia było konieczne poprawienie niektórych
defektów[^bug-ClassFieldAccess][^bug-precedence][^bug-QualInstanceCreation].
### Testowanie programu
Do najważniejszych funkcji programu zostały napisane testy jednostkowe (_test/Spec.hs_). Niektóre właściwości zostały sprawdzone za pomocą _QuickCheck_.
[haskell]: https://www.haskell.org/
[^language-java]: <https://hackage.haskell.org/package/language-java>
[^bug-ClassFieldAccess]: `Fix pretty-printing for ClassFieldAccess`
<https://github.com/zyla/language-java/commit/98a8c092b900bed665c5e932a8dec4c8b63024e7>
[^bug-precedence]: `Parser: fix operator precedence`
<https://github.com/zyla/language-java/commit/2369019638881d8ea4c564cd1f3eb3b41149769b>
[^bug-QualInstanceCreation]: `Make ExpName a primary expression`
<https://github.com/zyla/language-java/commit/8baf42b35aa918c6102515c60bf0d1dde77eb90f>
## Struktura działania programu
Klasycznie start działania programu zaczyna się od funkcji Main.
Pierwszym krokiem działania programu jest wczytanie plików biorących udział
w działaniu algorytmu :
1. Plik źródłowy Java
2. Plik zawierający reguły przekształceń kodu
Następnie rozpoczyna pracę głowny algorytm zajmujący się przetwarzaniem kodu.
Przekształcenie kodu przebiega z użyciem rozpoznawania wzorców w kodzie na podstawie
prawie wszystkich elementów języka (nie wszystkie rodzaje wyrażeń są obsługiwane).
## Organizacja plików
_main/Main.hs_ - W tym pliku znajduje się główne ciało programu wywołujące funkcje
odpowiedzialne za parsowanie danych wejściowych
_JavaRewrite/ApplySubst.hs_ - Odnajdziemy tutaj funkcję odpowiedzialną za zamianę odpowiednich wyrażeń
_JavaRewrite/ConstantFold.hs_ - Moduł odpowiedzialny za obliczanie stałych wyrażeń (jak np. 2 + 3)
_JavaRewrite/Match.hs_ - Zawiera definicje funkcji match oraz matchPattern
_JavaRewrite/MatchResult.hs_ - Moduł zawierający abstrakcje do przechowywania wyniku po sprawdzeniu, czy dany szablon(pattern) pasuje to wyrażenia Javowego
_JavaRewrite/Rewrite.hs_ - Odnajdziemy tutaj funkcje stosowane podczas przepisywania kodu np. applyRulesTopDown
_JavaRewrite/RuleParser.hs_ - Plik zawierający funkcje odpowiedizalne za parsowane regułek
_JavaRewrite/Rulse.hs_ - Zawiera definicje typów algebraicznych Pettern oraz Rule
_JavaRewrite/Syntax.hs_ - Znajduje się tu pare pomocniczych funkcji do pracy ze składnią Javową
_JavaRewrite/Traversals.hs_ - Moduł zawierający funkcje umożliwiające przechodzenie przez AST i aplikowanie przekształceń na znajdujących się w drzewie wyrażeń
## Wnioski dotyczące osiągniętych rezultatów
W wyniku naszego projektu, jesteśmy w stanie przekształcać kod na poziomie reguł dotyczących wyrażeń (Expression) w języku Java. Składa się na to:
1. Wyrażenia będące nazwami klas, interfejsów, prymitywów, itp.
2. Post/pre inkrementacja
3. Post/pre dekrementacja
4. Operacje dodawania i odejmowania
5. Rzutowania
6. Operacje bitowe
7. Operator `instanceof`
8. Instrukcje warunkowe
9. Referencje do metod
10. Obliczanie wyrażen na podstawie stałych znanych w czasie kompilacji (constant folding)
Niestety w Javie można wyrazić niewiele użytecznych reguł za pomocą tego języka. Istniała wręcz obawa, że niniejszy program okaże się bezużyteczny. Okazało się jednak że może on zostać użyty jako bardzo niewygodny w użyciu i niezwykle mało wydajny funkcyjny język programawania. Przykładowo - _examples/bf.[txt|java]_ - implementuje interpreter języka Brainfuck.
Dodanie do naszego programu funkcjonalności obsługi instrukcji (Statement) w sposób niewielki zwiększyłoby jego realną użyteczność. W celu optymalizacji należałoby wykroczyć poza mechanizm reguł - przez transformacje niemożliwe do wyrażenia za pomocą języka reguł (np. inlining, propagracja stałych, wyciąganie niezmienników pętli).
## Ograniczenia
Nie wszystkie elementy języka zostały pokryte w naszym projekcie, w wyniku czego przeprowadzanie części przekształceń nie jest możliwe.
Nie została zaimplementowana obsługa pełnych instrukcji (Statement) oraz niektóre rodzaje wyrażeń:
1. Przypisanie wyniku wyrażenia do zmiennej
2. Wyrażenia Lambda
3. Referencje do metod oraz wywołania metod
4. Odwołania do tablic oraz ich tworzenie
Nie została zaimplementowana również obsługa na poziomie całych bloków zawierających w sobie instrukcje oraz wyrażenia.
Na autorze reguł spoczywa obowiązek sprawdzenia, czy zestaw reguł jest confluenty i zapewnia, że przekształcenia zakończą się.
Automatyczne sprawdzanie reguł jest niemożliwe:
Dowód nie wprost:
Załóżmy, że istnieje algorytm sprawdzający, czy dla danego zestawu reguł i kodu w Javie program się zakończy.
Podajemy algortmowi program w brainfucku.
On stwierdza, czy program się zakończy.
W ten sposób uzyskaliśmy procedure sprawdzenia, czy dowolny program napisany w Brainfucku się zakończy. Język ten jest Turing-complete, więc taka procedura nie może istnieć => sprzeczność.
```
PeanoNat.java
```class PeanoNum {
int x = plus(S(S(S(Z))), S(S(Z)));
}
```
README.md
```Try it:
```
stack build && stack exec javarewrite2016 -- rules.txt test.java
```
```
|
zymrtest/Close-By
|
zymrtest/Close-By
README.md
```# Close-By
Close-By
```
|
zyphermc/jabilesyuscode
|
zyphermc/jabilesyuscode
README.md
```<div>
<h3 align="center">To-do App</h3>
<p align="center">
A basic website to list your tasks.
<br />
</p>
</div>
### Built With
- [Vue.js](https://vuejs.org/)
- [Axios](https://github.com/axios/axios)
- [Bootstrap](https://getbootstrap.com)
### Installation
1. Clone the repo
```sh
git clone -b <branch> <remote_repo>
example: git clone -b dev https://github.com/username/project.git
```
2. Install NPM packages
```sh
npm install
```
3. Setup your PHP backend or use Apache
```sh
php -S localhost:portNumber (e.g. 3000)
```
4. Enter your PHP server URL in `HomePage.vue`
```js
const PHP_SERVER_URL = "ENTER YOUR URL";
```
5. Run Node server with vue-cli.
```sh
npm run serve
```
```
|
zysim/twitch-plays
|
zysim/twitch-plays
keymap.py
```import win32con
import game
keymap = {
# Directions
'up': {
'key': win32con.VK_UP,
},
'down': {
'key': win32con.VK_DOWN,
},
'left': {
'key': win32con.VK_LEFT,
'duration': 2 * game.DEFAULT_DURATION,
},
'right': {
'key': win32con.VK_RIGHT,
'duration': 2 * game.DEFAULT_DURATION,
},
# Actions
'item': {
'key': 0x57, # W
},
'hit': {
'key': 0x53, # S
},
'whack': {
'key': 0x53, # S (alias)
},
'jump': {
'key': 0x41, # A
},
'bow': {
'key': 0x44, # D
},
'roll': {
'key': 0x51, # Q
},
'switch': {
'key': 0x45, # E
},
'map': {
'key': win32con.VK_TAB,
},
'menu': {
'key': win32con.VK_SHIFT,
},
# 👸
'ry': {
'key': [0x41, 0x51], # [A, Q]
},
}```
README.md
```Twitch Plays
============
Clone of [Twitch Plays Pokemon](http://twitch.tv/twitch_plays_pokemon).
Installation
============
You're going to need to have [pywin32](http://sourceforge.net/projects/pywin32/) installed. If you run into any errors try running this with Python [2.7.x](http://www.python.org/download/releases/2.7/).
Rename `config/config_dist.py` to `config/config.py`, and replace the username/password there with your Twitch username and [OAuth token](http://www.twitchapps.com/tmi/). Feel free to modify the start throttle here aswell.
In your VBA/Emulator, set the controls to the following -
```
Up: 0
Down: 1
Left: 2
Right: 3
Button A: 4
Button B: 5
Start: 6
Select: 7
```
After you've set that up, open up your terminal and type `python serve.py`. If your username/password is wrong you will be notified.
Whilst the script is running make sure you have your emulator in focus as your primary window. If you click onto another window, the script won't work. If you're not able to stay focused on one window as you need to do other things with your computer, you could try running all of this from within a virtual machine.
--
If you have any question or need help, feel free to [message me on Twitch](http://www.twitch.tv/message/compose?to=aidraj_) or send an email to `aidraj0 at gmail dot com`.
You'll need to have VBA in focus for this to work, so your best bet would be to run all of this
from within a VM.
```
game.py
```import win32api
import win32con
import time
import keymap
# 🍁
DEFAULT_DURATION = .15
class Game:
def get_valid_buttons(self):
return [button for button in keymap.keys()]
def is_valid_button(self, button):
return button in keymap.keys()
def button_to_key(self, button):
return keymap[button]
def push_button(self, button):
self._handle(button, 0)
time.sleep(button['duration'] if 'duration' in button else DEFAULT_DURATION)
self._handle(button, win32con.KEYEVENTF_KEYUP)
def _handle(self, button, event):
if isinstance(button['key'], list):
for b in button['key']:
win32api.keybd_event(self.button_to_key(b), 0, event, 0)
else:
win32api.keybd_event(self.button_to_key(button['key']), 0, event, 0)
```
serve.py
```#!/usr/bin/env python
from sys import exit
from config.config import config
import lib.bot as bot
# Twitch Plays
# Inpsired by http://twitch.tv/twitchplayspokemon
# Written by Aidan Thomson - <aidraj0 at gmail dot com>
try:
bot.Bot().run()
except KeyboardInterrupt:
exit()
```
|
zysong/NectarMicrobiota
|
zysong/NectarMicrobiota
README.md
```# NectarMicrobiota
We study how nectar microbes, in particular, bacteria and yeast, moderate the interactions between flowers and pollinators, in the context of climate change.
This a project integrating field survey, field experiments, mathematical modeling and numerical simulation. In this directory, codes for simulations and ploting can be found.
```
|
zyt520ham/vue-draggable-resizable-ts
|
zyt520ham/vue-draggable-resizable-ts
README.md
```## Vue3 + typescript Component for draggable and resizable elements, with no dependencies.
## Install and basic usage
```bash
$ npm install --save vue-draggable-resizable-ts
```
Register the component
```js
import { createApp } from 'vue'
import App from './App.vue'
import vueDraggableResizableTs from 'vue-draggable-resizable-ts'
import 'vue-draggable-resizable-ts/dist/VueDraggableResizableTs.css'
const app = createApp(App)
app.component('vue-draggable-resizable-ts', vueDraggableResizableTs)
app.mount('#app')
```
```js
<vue-draggable-resizable-ts style="background-color:green">
test
</vue-draggable-resizable-ts>
```
```
|
zyueek/C_based-program
|
zyueek/C_based-program
students information managment system.cpp
```#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct student
{
char name[20];
char grade[2];
char math[3];
char chinese[3];
};
struct Node
{
struct student data;
struct Node* next;
};
struct Node* createnode()
{
struct Node* head = (struct Node*)malloc(sizeof(struct Node));
head->next = NULL;
return head;
}
struct Node* createnode(struct student data)
{
struct Node* newnode = (struct Node*)malloc(sizeof(struct Node));
newnode->data = data;
newnode->next = NULL;
return newnode;
}
void insert(struct Node* head, struct student data)
{
struct Node* newnode = createnode(data);
newnode->next = head->next;
head->next = newnode;
}
void deletenode(struct Node* head, char *name)
{
struct Node* dnode = head->next; //dnode为删除节点,fnode为删除节点的前节点
struct Node* fnode = head;
if (dnode == NULL)
{
printf("数据为空\n");
return;
}
while (strcmp(dnode->data.name, name))
{
fnode = dnode;
dnode = fnode->next;
if (dnode == NULL)
{
printf("未找到该数据\n");
return;
}
fnode->next = dnode->next;
free(dnode);
}
}
struct Node* findnode(struct Node* head, char *name)
{
struct Node* move = head->next;
if (strcmp(move->data.name, name) != 0)
{
return NULL;
}
while (strcmp(move->data.name, name))
{
move = move->next;
}
return move;
}
void printlist(struct Node* head)
{
struct Node* move = head->next;
printf("姓名\t年级\t数学\t语文\n");
while (move)
{
printf("%s\t%s\t%s\t%s\n", move->data.name,move->data.grade,move->data.math,move->data.chinese);
move = move->next;
}
}
void menu()
{
printf("*****************学生信息管理系统******************\n");
printf(" 1.录入信息\n");
printf(" 2.信息显示\n");
printf(" 3.信息修改\n");
printf(" 4.信息删除\n");
printf(" 5.信息搜寻\n");
printf(" 6.退出系统\n");
printf("***************************************************\n");
}
struct Node* list = createnode();
struct Node* move = NULL;
void search()
{
int choice = 1;
struct student data;
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("----------------------录入信息---------------------\n");
printf("请输入学生姓名,年级,数学成绩,语文成绩\n");
fflush(stdin);
scanf("%s%s%s%s", data.name, data.grade, data.math, data.chinese);
insert(list, data);
break;
case 2:
printf("----------------------信息显示---------------------\n");
printlist(list);
break;
case 3:
printf("----------------------信息修改---------------------\n");
printf("请输入修改的学生姓名:");
scanf("%s", data.name);
move = findnode(list, data.name);
if (move == NULL)
{
printf("无此姓名,请重新输入\n");
system("pause");
}
else
{
printf("请输入修改后的信息\n");
scanf("%s%s%s%s",move->data.name,move->data.grade,move->data.math,move->data.chinese);
}
break;
case 4:
printf("----------------------信息删除---------------------\n");
printf("请输入删除的学生姓名:");
scanf("%s", data.name);
deletenode(list, data.name);
break;
case 5:
printf("----------------------信息搜寻---------------------\n");
printf("请输入搜寻的学生姓名:");
scanf("%s", data.name);
move = findnode(list, data.name);
if (move == NULL)
{
printf("无此姓名,请重新输入\n");
system("pause");
}
else
{
printf("姓名\t年级\t数学\t语文\n");
printf("%s\t%s\t%s\t%s\n", move->data.name,move->data.grade,move->data.math,move->data.chinese);
}
break;
case 6:
printf("exit!\n");
system("pause");
exit(0);
break;
default:
break;
}
}
int main()
{
while (1)
{
menu();
search();
system("pause");
system("cls");
}
system("pause");
return 0;
}```
|
zyuzhen/-
|
zyuzhen/-
README.md
```# -
俄罗斯方块游戏源程序
```
|
zyx88615/mapping
|
zyx88615/mapping
README.md
```# Unit 17 | Assignment - Visualizing Data with Leaflet
## Background
click earthquake layer for general INFO
click magnitude layer for mag info
```
config.js
```// API key
const API_KEY = "pk.eyJ1Ijoienl4ODg2MTUiLCJhIjoiY2p3dHpwZDk1MDY2NzRhcXJudDZrdHZidSJ9.OvjTXNUTFWYNA2LsJUdAhQ"
```
|
zyxjs/crypto
|
zyxjs/crypto
BlockChain.java
```import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
// Block Chain should maintain only limited block nodes to satisfy the functions
// You should not have all the blocks added to the block chain in memory
// as it would cause a memory overflow.
public class BlockChain {
public static final int CUT_OFF_AGE = 10;
private ArrayList<ArrayList<Block>> chain;
private Map<byte[], UTXOPool> utxoPools;
private TransactionPool txPool;
/**
* create an empty block chain with just a genesis block. Assume
* {@code genesisBlock} is a valid block
*/
public BlockChain(Block genesisBlock) {
// IMPLEMENT THIS
ArrayList<Block> genesisBlockSet = new ArrayList<>();
genesisBlockSet.add(genesisBlock);
chain = new ArrayList<>();
chain.add(genesisBlockSet);
utxoPools = new HashMap<>();
utxoPools.put(genesisBlock.getHash(), new UTXOPool());
handleBlockTxs(genesisBlock, new TxHandler(utxoPools.get(genesisBlock.getHash())));
handleCoinbase(genesisBlock);
txPool = new TransactionPool();
}
/** Get the maximum height block */
public Block getMaxHeightBlock() {
// IMPLEMENT THIS
// genesis block guaranteed
return chain.get(chain.size() - 1).get(0);
}
/** Get the UTXOPool for mining a new block on top of max height block */
public UTXOPool getMaxHeightUTXOPool() {
// IMPLEMENT THIS
return utxoPools.get(getMaxHeightBlock().getHash());
}
/** Get the transaction pool to mine a new block */
public TransactionPool getTransactionPool() {
// IMPLEMENT THIS
return txPool;
}
/**
* Add {@code block} to the block chain if it is valid. For validity, all
* transactions should be valid and block should be at
* {@code height > (maxHeight - CUT_OFF_AGE)}.
*
* <p>
* For example, you can try creating a new block over the genesis block (block
* height 2) if the block chain height is {@code <=
* CUT_OFF_AGE + 1}. As soon as {@code height > CUT_OFF_AGE + 1}, you cannot
* create a new block at height 2.
*
* @return true if block is successfully added
*/
public boolean addBlock(Block block) {
// IMPLEMENT THIS
// genesis block won't be mined
if (block.getPrevBlockHash() == null) {
return false;
}
// parent not found (culled by CUT_OFF_AGE)
int parentHeight = getParentBlockHeight(block);
if (parentHeight < 0) {
return false;
}
// validate block transactions
TxHandler handler = new TxHandler(utxoPools.get(block.getPrevBlockHash()));
if (!handleBlockTxs(block, handler)) {
return false;
}
// set UTXO pool for new block
utxoPools.put(block.getHash(), handler.getUTXOPool());
// process coinbase tx
handleCoinbase(block);
// add block
if (parentHeight + 1 >= chain.size()) {
// new longest chain
ArrayList<Block> maxHeightBlockList = new ArrayList<>();
maxHeightBlockList.add(block);
chain.add(maxHeightBlockList);
} else {
// add to set for blocks in existing height
chain.get(parentHeight + 1).add(block);
}
// remove block txs from pool
for (Transaction t : block.getTransactions()) {
txPool.removeTransaction(t.getHash());
}
// remove old blocks
if (chain.size() > CUT_OFF_AGE + 1) {
ArrayList<Block> removedBlocks = chain.remove(0);
for (Block removedBlock : removedBlocks) {
utxoPools.remove(removedBlock.getHash());
}
}
return true;
}
/** Add a transaction to the transaction pool */
public void addTransaction(Transaction tx) {
// IMPLEMENT THIS
txPool.addTransaction(tx);
}
private int getParentBlockHeight(Block block) {
for (int i = chain.size() - 1; i >= 0; --i) {
for (Block b : chain.get(i)) {
if (block.getPrevBlockHash() == b.getHash()) {
return i;
}
}
}
return -1;
}
// pre: utxopool is set for block in utxoPools
private void handleCoinbase(Block block) {
UTXOPool uPool = utxoPools.get(block.getHash());
Transaction coinbase = block.getCoinbase();
for (int c = 0; c < coinbase.numOutputs(); ++c) {
uPool.addUTXO(new UTXO(coinbase.getHash(), c), coinbase.getOutput(c));
}
}
private boolean handleBlockTxs(Block block, TxHandler handler) {
Transaction[] validTxs = handler.handleTxs(block.getTransactions().toArray(new Transaction[0]));
return validTxs.length == block.getTransactions().size();
}
}```
TxHandler.java
```import java.util.*;
public class TxHandler {
private UTXOPool utPool;
/**
* Creates a public ledger whose current UTXOPool (collection of unspent transaction outputs) is
* {@code utxoPool}. This should make a copy of utxoPool by using the UTXOPool(UTXOPool uPool)
* constructor.
*/
public TxHandler(UTXOPool utxoPool) {
// IMPLEMENT THIS
utPool = new UTXOPool(utxoPool);
}
/**
* @return true if:
* DONE (1) all outputs claimed by {@code tx} are in the current UTXO pool,
* DONE (2) the signatures on each input of {@code tx} are valid,
* DONE (3) no UTXO is claimed multiple times by {@code tx},
* DONE (4) all of {@code tx}s output values are non-negative, and
* DONE (5) the sum of {@code tx}s input values is greater than or equal to the sum of its output
* values; and false otherwise.
*/
public boolean isValidTx(Transaction tx) {
// IMPLEMENT THIS
Set<UTXO> claimedUTXO = new HashSet<UTXO>();
double totalInputValue = 0.0;
for (int i=0; i<tx.numInputs(); ++i) {
Transaction.Input input = tx.getInput(i);
UTXO u = new UTXO(input.prevTxHash, input.outputIndex);
if (!utPool.contains(u))
return false;
if (claimedUTXO.contains(u))
return false;
Transaction.Output o = utPool.getTxOutput(u);
if (!Crypto.verifySignature(o.address, tx.getRawDataToSign(i), input.signature))
return false;
claimedUTXO.add(u);
totalInputValue += o.value;
}
double totalOutputValue = 0.0;
for (Transaction.Output o : tx.getOutputs()) {
if (o.value < 0.0)
return false;
totalOutputValue += o.value;
}
if (totalInputValue < totalOutputValue)
return false;
return true;
}
/**
* Handles each epoch by receiving an unordered array of proposed transactions, checking each
* transaction for correctness, returning a mutually valid array of accepted transactions, and
* updating the current UTXO pool as appropriate.
*/
public Transaction[] handleTxs(Transaction[] possibleTxs) {
// IMPLEMENT THIS
ArrayList<Transaction> validTxs = new ArrayList<>();
for (Transaction t : possibleTxs) {
if (isValidTx(t)) {
for (Transaction.Input i : t.getInputs()) {
UTXO u = new UTXO(i.prevTxHash, i.outputIndex);
utPool.removeUTXO(u);
}
for (int i=0; i<t.numOutputs(); ++i) {
UTXO u = new UTXO(t.getHash(), i);
utPool.addUTXO(u, t.getOutput(i));
}
validTxs.add(t);
}
}
return validTxs.toArray(new Transaction[0]);
}
}
```
README.md
```# scroogecoin
https://www.coursera.org/learn/cryptocurrency/programming/KOo3V/scrooge-coin
```
TxHandler.java
```// From a1 - scroogecoin
import java.util.*;
public class TxHandler {
private UTXOPool utPool;
/**
* Creates a public ledger whose current UTXOPool (collection of unspent
* transaction outputs) is {@code utxoPool}. This should make a copy of utxoPool
* by using the UTXOPool(UTXOPool uPool) constructor.
*/
public TxHandler(UTXOPool utxoPool) {
// IMPLEMENT THIS
utPool = new UTXOPool(utxoPool);
}
public UTXOPool getUTXOPool() {
return utPool;
}
/**
* @return true if: DONE (1) all outputs claimed by {@code tx} are in the
* current UTXO pool, DONE (2) the signatures on each input of
* {@code tx} are valid, DONE (3) no UTXO is claimed multiple times by
* {@code tx}, DONE (4) all of {@code tx}s output values are
* non-negative, and DONE (5) the sum of {@code tx}s input values is
* greater than or equal to the sum of its output values; and false
* otherwise.
*/
public boolean isValidTx(Transaction tx) {
// IMPLEMENT THIS
Set<UTXO> claimedUTXO = new HashSet<UTXO>();
double totalInputValue = 0.0;
for (int i = 0; i < tx.numInputs(); ++i) {
Transaction.Input input = tx.getInput(i);
UTXO u = new UTXO(input.prevTxHash, input.outputIndex);
if (!utPool.contains(u))
return false;
if (claimedUTXO.contains(u))
return false;
Transaction.Output o = utPool.getTxOutput(u);
if (!Crypto.verifySignature(o.address, tx.getRawDataToSign(i), input.signature))
return false;
claimedUTXO.add(u);
totalInputValue += o.value;
}
double totalOutputValue = 0.0;
for (Transaction.Output o : tx.getOutputs()) {
if (o.value < 0.0)
return false;
totalOutputValue += o.value;
}
if (totalInputValue < totalOutputValue)
return false;
return true;
}
/**
* Handles each epoch by receiving an unordered array of proposed transactions,
* checking each transaction for correctness, returning a mutually valid array
* of accepted transactions, and updating the current UTXO pool as appropriate.
*/
public Transaction[] handleTxs(Transaction[] possibleTxs) {
// IMPLEMENT THIS
ArrayList<Transaction> validTxs = new ArrayList<>();
for (Transaction t : possibleTxs) {
if (isValidTx(t)) {
for (Transaction.Input i : t.getInputs()) {
UTXO u = new UTXO(i.prevTxHash, i.outputIndex);
utPool.removeUTXO(u);
}
for (int i = 0; i < t.numOutputs(); ++i) {
UTXO u = new UTXO(t.getHash(), i);
utPool.addUTXO(u, t.getOutput(i));
}
validTxs.add(t);
}
}
return validTxs.toArray(new Transaction[0]);
}
}
```
CompliantNode.java
```import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
/* CompliantNode refers to a node that follows the rules (not malicious)*/
public class CompliantNode implements Node {
private int currRound;
private Set<Integer> trustedNodes;
private Map<Integer, Integer> followeeScores;
private Set<Transaction> transactions;
public CompliantNode(double p_graph, double p_malicious, double p_txDistribution, int numRounds) {
// IMPLEMENT THIS
currRound = 0;
transactions = new HashSet<>();
followeeScores = new HashMap<>();
trustedNodes = new HashSet<>();
}
public void setFollowees(boolean[] followees) {
// IMPLEMENT THIS
for (int i = 0; i < followees.length; ++i) {
if (followees[i]) {
this.followeeScores.put(i, 0);
}
}
}
public void setPendingTransaction(Set<Transaction> pendingTransactions) {
// IMPLEMENT THIS
transactions = pendingTransactions;
}
public Set<Transaction> sendToFollowers() {
// IMPLEMENT THIS
++currRound;
if (currRound == 1) {
// handshake round
Set<Transaction> txs = new HashSet<>();
Iterator<Transaction> i = transactions.iterator();
if (i.hasNext()) {
txs.add(i.next());
}
return txs;
} else if (currRound == 2) {
// identify compliant nodes via handshake
for (Map.Entry<Integer, Integer> f : followeeScores.entrySet()) {
if (f.getValue() == 1) {
trustedNodes.add(f.getKey());
}
}
}
return transactions;
// more realistic but results in grader out of mem
// if (currRound == numRounds) {
// // all rounds have been processed, this call is for final eval
// // cull transaction that are probabilistically malicious
// int numFollowees = followees.size();
// Set<Transaction> txSet = new HashSet<>();
// for (Transaction t : transactions.keySet()) {
// if (transactions.get(t).size() > numFollowees * pMalicious) {
// txSet.add(t);
// }
// }
// return txSet;
// }
// ++currRound;
// return transactions.keySet();
}
public void receiveFromFollowees(Set<Candidate> candidates) {
// IMPLEMENT THIS
for (Candidate c : candidates) {
if (currRound == 1) {
if (followeeScores.get(c.sender) != null) {
followeeScores.put(c.sender, followeeScores.get(c.sender) + 1);
} else {
followeeScores.put(c.sender, 1);
}
} else {
if (trustedNodes.contains(c.sender)) {
transactions.add(c.tx);
}
}
}
// more realistic but results in grader out of mem
// for (Candidate c : candidates) {
// followeeScores.put(c.sender, followeeScores.get(c.sender) + 1);
// Set<Integer> txNodes = transactions.get(c.tx);
// if (txNodes != null) {
// txNodes.add(c.sender);
// } else {
// transactions.put(c.tx, new HashSet<>(Arrays.asList(c.sender)));
// }
// }
}
}
```
|
zyxsachin/zyxsachin.github.io
|
zyxsachin/zyxsachin.github.io
script.js
```
/*
var x = document.getElementById("geoloc");
var y = document.getElementById("dist");
var wd = document.getElementById("wdist");
var bd = document.getElementById("bdist");
var id = document.getElementById("idist");
var sd = document.getElementById("sdist");
var jd = document.getElementById("jdist");
*/
var lat;
var lon;
var latlon;
var wdistance;
var bdistance;
var idistance;
var sdistance;
var jdistance;
var wlat = -24.003813 * Math.PI / 180;
var wlon = 31.523483 * Math.PI / 180;
var blat = -18.855611 * Math.PI / 180;
var blon = 16.329277 * Math.PI / 180;
var ilat = 26.604285 * Math.PI / 180;
var ilon = 93.388778 * Math.PI / 180;
var slat = -4.919436 * Math.PI / 180;
var slon = 105.753611 * Math.PI / 180;
var jlat = -6.784571 * Math.PI / 180;
var jlon = 105.380081 * Math.PI / 180;
var r = 6371;
var lati;
var longi;
function changeColor(linkId) {
// Then show the section with the ID the user selected from the menu.
if (linkID == 0) {
document.getElementById("a1").style.color="red";
} else if (linkID == 1) {
document.getElementById("b1").style.color="red";
} else if (linkID == 2) {
document.getElementById("c1").style.color="red";
} else if (linkID == 3) {
document.getElementById("d1").style.color="red";
} else if (linkID == 4) {
document.getElementById("e1").style.color="red";
}
}
function selectSection(linkID) {
// First, hide all sections.
document.getElementById("quickPeek").style.display='none';
document.getElementById("species").style.display='none';
document.getElementById("location").style.display='none';
document.getElementById("poaching").style.display='none';
document.getElementById("about").style.display='none';
// Then show the section with the ID the user selected from the menu.
if (linkID == 0) {
document.getElementById("quickPeek").style.display='block';
} else if (linkID == 1) {
document.getElementById("species").style.display='block';
} else if (linkID == 2) {
document.getElementById("location").style.display='block';
} else if (linkID == 3) {
document.getElementById("poaching").style.display='block';
} else if (linkID == 4) {
document.getElementById("about").style.display='block';
}
}
function selectLocation(linkID) {
// First, hide all sections.
document.getElementById("whiteLocation").style.display='none';
document.getElementById("blackLocation").style.display='none';
document.getElementById("indiaLocation").style.display='none';
document.getElementById("sumatraLocation").style.display='none';
document.getElementById("javaLocation").style.display='none';
document.getElementById("yourLocation").style.display='none';
// Then show the section with the ID the user selected from the menu.
if (linkID == 0) {
document.getElementById("whiteLocation").style.display='block';
} else if (linkID == 1) {
document.getElementById("blackLocation").style.display='block';
} else if (linkID == 2) {
document.getElementById("indiaLocation").style.display='block';
} else if (linkID == 3) {
document.getElementById("sumatraLocation").style.display='block';
} else if (linkID == 4) {
document.getElementById("javaLocation").style.display='block';
} else if (linkID == 5) {
// document.getElementById("yourLocation").style.display='block';
if (lat == null || lon == null) {
x.innerHTML = "Geolocation not used yet.";
} else {
document.getElementById("yourLocation").style.display='block';
document.getElementById("yourLocation").src ="https://www.google.com/maps/embed/v1/place?key=AIzaSyAZyyisWD6opTg7vkOCUs0ODo3auLqosFU&q=" + lati + "," + longi + "&zoom=4";
}
}
}
function getLocation() {
if (navigator.geolocation) {
navigator.geolocation.getCurrentPosition(showPosition, showError);
} else {
x.innerHTML = "Geolocation is not supported by this browser.";
}
}
function showPosition(position) {
lat = position.coords.latitude * Math.PI / 180 /** 111000*/;
lon = position.coords.longitude * Math.PI / 180 /** 111000*/;
lati = position.coords.latitude;
longi = position.coords.longitude;
// latlon = lat + "," + lon;
x.innerHTML = "Latitude: " + position.coords.latitude.toFixed(5) +
"<br>Longitude: " + position.coords.longitude.toFixed(5);;
calcDistance();
}
function showError(error) {
switch(error.code) {
case error.PERMISSION_DENIED:
x.innerHTML = "User denied the request for Geolocation."
break;
case error.POSITION_UNAVAILABLE:
x.innerHTML = "Location information is unavailable."
break;
case error.TIMEOUT:
x.innerHTML = "The request to get user location timed out."
break;
case error.UNKNOWN_ERROR:
x.innerHTML = "An unknown error occurred."
break;
}
}
function distance(lat1,lat2,lon1,lon2) {
var dlat = (lat2 - lat1)/2;
var dlon = (lon2 - lon1)/2;
var temp = Math.pow(Math.sin(dlat), 2) + (Math.cos(lat1) *
Math.cos(lat2) * Math.pow(Math.sin(dlon), 2));
return 2 * r * Math.asin(Math.sqrt(temp));
}
function calcDistance() {
wdistance = distance(lat,wlat,lon,wlon);
bdistance = distance(lat,blat,lon,blon);
idistance = distance(lat,ilat,lon,ilon);
sdistance = distance(lat,slat,lon,slon);
jdistance = distance(lat,jlat,lon,jlon);
/*
y.innerHTML = "Distances: " + wdistance + " " + bdistance + " " + idistance + " " + sdistance + " " + jdistance + " " ;
*/
wd.innerHTML = wdistance.toFixed(2);
bd.innerHTML = bdistance.toFixed(2);
id.innerHTML = idistance.toFixed(2);
sd.innerHTML = sdistance.toFixed(2);
jd.innerHTML = jdistance.toFixed(2);
}
```
|
zyylele123/earth-frost
|
zyylele123/earth-frost
RedisRegistry.java
```package vip.justlive.frost.core.registry;
import java.util.concurrent.TimeUnit;
import org.redisson.api.RSemaphore;
import org.redisson.api.RedissonClient;
import lombok.extern.slf4j.Slf4j;
import vip.justlive.frost.api.model.JobExecutor;
import vip.justlive.frost.api.model.JobGroup;
import vip.justlive.frost.core.config.JobConfig;
import vip.justlive.oxygen.core.ioc.BeanStore;
/**
* redis注册实现类
*
* @author wubo
*
*/
@Slf4j
public class RedisRegistry implements Registry {
private final RedissonClient redissonClient;
private final JobExecutor jobExecutor;
public RedisRegistry() {
this.redissonClient = BeanStore.getBean(RedissonClient.class);
this.jobExecutor = JobConfig.getJobExecutor();
}
@Override
public void register() {
// 注册job执行器
for (JobGroup jobGroup : jobExecutor.getGroups()) {
String key = String.join(JobConfig.SEPERATOR, JobConfig.JOB_GROUP_PREFIX,
jobGroup.getGroupKey(), jobGroup.getJobKey());
log.info("register job [{}]", key);
redissonClient.getExecutorService(key).registerWorkers(JobConfig.getParallel());
}
// script执行器
if (JobConfig.getExecutor().getScriptJobEnabled()) {
redissonClient.getExecutorService(JobConfig.JOB_SCRIPT_PREFIX)
.registerWorkers(JobConfig.getParallel());
redissonClient
.getExecutorService(
String.join(JobConfig.SEPERATOR, JobConfig.JOB_SCRIPT_PREFIX, jobExecutor.getKey()))
.registerWorkers(JobConfig.getParallel());
}
// 订阅worker
redissonClient.<String>getTopic(
String.join(JobConfig.SEPERATOR, JobConfig.EXECUTOR_PREFIX, JobConfig.JOB_REGIST_PREFIX))
.addListener((channel, uuid) -> {
redissonClient
.getMapCache(String.join(JobConfig.SEPERATOR, JobConfig.EXECUTOR_PREFIX,
JobExecutor.class.getName(), uuid))
.put(jobExecutor.getId(), jobExecutor, 20, TimeUnit.SECONDS);
redissonClient.getSemaphore(String.join(JobConfig.SEPERATOR, JobConfig.EXECUTOR_PREFIX,
JobExecutor.class.getName(), RSemaphore.class.getSimpleName(), uuid)).release();
});
}
@Override
public void unregister() {}
}
```
RedisEventPublisherImpl.java
```package vip.justlive.frost.core.notify;
import org.redisson.Redisson;
import org.redisson.api.RScheduledExecutorService;
import org.redisson.api.RedissonClient;
import vip.justlive.frost.core.config.JobConfig;
import vip.justlive.oxygen.core.ioc.Bean;
import vip.justlive.oxygen.core.ioc.Inject;
/**
* redis实现的事件发布
*
* @author wubo
*
*/
@Bean
public class RedisEventPublisherImpl implements EventPublisher {
private final RedissonClient redissonClient;
@Inject
public RedisEventPublisherImpl(Redisson redissonClient) {
this.redissonClient = redissonClient;
}
@Override
public void publish(Event event) {
RScheduledExecutorService executor = redissonClient.getExecutorService(
String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX, EventPublisher.class.getName()));
executor.execute(new EventExecuteWrapper(event));
}
}
```
ChildrenJobEventNotifier.java
```package vip.justlive.frost.center.notifier;
import java.util.Objects;
import vip.justlive.frost.api.model.JobInfo;
import vip.justlive.frost.core.job.JobSchedule;
import vip.justlive.frost.core.notify.Event;
import vip.justlive.frost.core.persistence.JobRepository;
import vip.justlive.oxygen.core.ioc.BeanStore;
/**
* 子任务事件通知器
*
* @author wubo
*
*/
public class ChildrenJobEventNotifier extends AbstractEventNotifier {
@Override
protected boolean shouldNotify(Event event) {
JobInfo jobInfo =
BeanStore.getBean(JobRepository.class).findJobInfoById(event.getData().getJobId());
return jobInfo != null && Objects.equals(event.getType(), Event.TYPE.EXECUTE_SUCCESS.name())
&& jobInfo.getChildJobIds() != null && jobInfo.getChildJobIds().length > 0;
}
@Override
protected void doNotify(Event event) {
JobInfo jobInfo =
BeanStore.getBean(JobRepository.class).findJobInfoById(event.getData().getJobId());
if (jobInfo.getChildJobIds() != null) {
for (String jobId : jobInfo.getChildJobIds()) {
BeanStore.getBean(JobSchedule.class).triggerChildJob(jobId, event.getData().getLoggerId());
}
}
}
}
```
RedisJobLoggerImpl.java
```package vip.justlive.frost.core.job;
import java.time.ZonedDateTime;
import java.time.format.DateTimeFormatter;
import java.util.List;
import java.util.Objects;
import java.util.UUID;
import org.redisson.Redisson;
import org.redisson.api.RAtomicLong;
import org.redisson.api.RListMultimap;
import org.redisson.api.RMap;
import org.redisson.api.RedissonClient;
import vip.justlive.frost.core.config.JobConfig;
import vip.justlive.oxygen.core.ioc.Bean;
import vip.justlive.oxygen.core.ioc.Inject;
/**
* redis实现
*
* @author wubo
*
*/
@Bean
public class RedisJobLoggerImpl implements JobLogger {
private final RedissonClient redissonClient;
@Inject
public RedisJobLoggerImpl(Redisson redissonClient) {
this.redissonClient = redissonClient;
}
@Override
public String bindLog(String jobId) {
String id = UUID.randomUUID().toString();
RMap<String, String> map = redissonClient.getMap(
String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX, JobLogger.class.getName()));
RListMultimap<String, String> listmap =
redissonClient.getListMultimap(String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX,
JobLogger.class.getName(), RListMultimap.class.getSimpleName()));
map.put(id, jobId);
listmap.put(jobId, id);
return id;
}
@Override
public void removeLogger(String jobId) {
RMap<String, String> map = redissonClient.getMap(
String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX, JobLogger.class.getName()));
RListMultimap<String, String> listmap =
redissonClient.getListMultimap(String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX,
JobLogger.class.getName(), RListMultimap.class.getSimpleName()));
List<String> list = listmap.removeAll(jobId);
for (String id : list) {
map.remove(id);
}
}
@Override
public void enter(String loggerId, String type) {
// 运行中 ++
RAtomicLong atomic =
redissonClient.getAtomicLong(String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX,
JobConfig.CENTER_STATISTICS, type, JobConfig.CENTER_STATISTICS_RUNNING));
atomic.incrementAndGet();
}
@Override
public void leave(String loggerId, String type, boolean success) {
// 运行中 --
if (Objects.equals(JobConfig.CENTER_STATISTICS_EXECUTE, type)) {
redissonClient
.getAtomicLong(String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX,
JobConfig.CENTER_STATISTICS, type, JobConfig.CENTER_STATISTICS_RUNNING))
.decrementAndGet();
}
String key;
if (success) {
key = JobConfig.CENTER_STATISTICS_SUCCESS;
} else {
key = JobConfig.CENTER_STATISTICS_FAIL;
}
redissonClient
.getAtomicLong(
String.join(JobConfig.SEPERATOR, JobConfig.CENTER_PREFIX, JobConfig.CENTER_STATISTICS,
type, key, DateTimeFormatter.ISO_LOCAL_DATE.format(ZonedDateTime.now())))
.incrementAndGet();
}
}
```
|
zyzisyz/flow_sre
|
zyzisyz/flow_sre
README.md
```# flow_sre
## Dependency and work ENV
1. install `pytorch-gpu`
2. `pip3 install -r requrements.txt`
## Data Preparation
`tools/ark2npz.py` transfers kaldi `feats.ark` to numpy `feats.npz` (`utt2spk` file is also required)
```bash
# convert ark to npz
python -u tools/ark2npz.py \
--src_file data/feats.ark \
--dest_file data/feats.npz \
--utt2spk data/utt2spk
```
When we finish data preparation process, we can get a `feats.npz` file, which contain audio Mel-features and its labels
Each frame has 72 dimension vector and two labels: `spker_label` and `utt_label`.
`spker_label` is for pytorch `HDA_Gaussion_log_likehood` training and `utt_label` is for kaldi ark data infering
What's more, `ark2npz.py` also convert the string label to int label, and the label of the first speaker is 0.
```bash
.
├── feats.ark
├── feats.scp
├── spk2utt
├── utt2num_frames
├── utt2spk
└── feats.npz (new file)
```
`data_loader.py` will load the `feats.npz` while pytorch training
## Train a model and infer data from x space to z space
### Train-scheme
`class_mean` will be initialized or updated at the begining of each training epoch.
**epoch_0**: initialize `class_mean` from x space (orignal dataset)
**epoch_n**: (n>0) update `class_meean` from epoch_n-1 's `class_mean` and epoch_n z space `class_mean`, `args.u_shift` determine the `class_mean` update shift weight.
```python
self.class_mean = class_mean.to(self.device)*args.u_shift + self.class_mean*(1.0-args.u_shift)
```
`var_j` `var_0` `u_0` are fixed
### Loss function
Loss: HDA Gaussion Log-likehood (HDA, `class_meean` and `all_mean` matrix are recombination ordered by `c_dim`)
```python
# convert data from x space to z space
z, logdet = self.model(data)
mean_j = torch.index_select(self.class_mean, 0, label)
# compute hda Gaussion log-likehood
log_det_sigma = torch.log(
var_global+1e-15).sum(-1, keepdim=True).to(self.device)
log_probs = -0.5 * ((torch.pow((z-mean_j), 2) / (var_global+1e-15) + torch.log(
2 * pi)).sum(-1, keepdim=True) + log_det_sigma).to(self.device)
loss = -(log_probs + logdet).mean()
```
### Run
```bash
# check and modify shell config
vim run.sh
# run
bash run.sh
```
## tools
### Data Visualization
Using Embedding Projector for data visualization
1. sample same index(label) data from x space and z space, make tsv
```bash
# sample same index from x and z, make tsv
python -u comp_tsv_data_prepare.py \
--pre_npz ../data/feats.npz \
--infered_npz ../test.npz \
--class_num 30 \
--sample_num 300 \
--tsv_dir ./tsv
```
2. download Embedding Projector in you onw computer
```bash
git clone https://github.com/tensorflow/embedding-projector-standalone.git
```
3. open `index.html`, upload the tsv file to the web page
```bash
├ label.tsv
├ x_data.tsv
└ z_data.tsv
```
### numpy npz & kaldi ark
1. `tools/ark2npz.py` transfers kaldi `feats.ark` to numpy `feats.npz` (`utt2spk` file is also required)
2. `tools/npz2ark.py` transfers numpy `feats.npz` to numpy `feats.ark`
### Tensorboard
```bash
tensorboard --logdir runs/*
```
```
data_preparation.sh
```#!/bin/bash
#*************************************************************************
# > File Name: data_preparation.sh
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Wed 05 Feb 2020 01:03:22 PM CST
# ************************************************************************/
# convert ark to npz
python -u tools/ark2npz.py \
--src_file data/feats.ark \
--dest_file data/feats.npz \
--utt2spk data/utt2spk
```
run.sh
```#!/bin/bash
#*************************************************************************
# > File Name: run.sh
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Sat 01 Feb 2020 08:00:01 PM CST
# ************************************************************************/
#./data_preparation.sh
##################################################################
# stage0: Model Parameter Config
##################################################################
flow=maf
train_data_npz=./data/feats.npz
test_data_npz=./data/feats.npz
epochs=11
batch_size=20000
num_blocks=10
num_hidden=512
lr=0.001
v_c=0.1
v_0=1.0
c_dim=36
u_0=1.0
u_shift=0.75
model_name=${flow}_block_${num_blocks}_hidden_${num_hidden}_cd_${c_dim}_vc_${v_c}_v0_${v_0}_u0_${u_0}
ckpt_dir=ckpt/${model_name}
ckpt_save_interval=1
device=0
infer_data_dir=infered_data/${model_name}
log_dir=log_data/${model_name}
infer_job_num=4
##################################################################
# stage1: pytorch training
##################################################################
echo "start to train"
python -u main.py \
--flow $flow \
--epochs $epochs \
--batch_size $batch_size \
--train_data_npz $train_data_npz \
--lr $lr \
--model_name $model_name \
--num_blocks $num_blocks \
--num_hidden $num_hidden \
--device $device \
--v_c $v_c \
--v_0 $v_0 \
--u_0 $u_0 \
--u_shift $u_shift \
--c_dim $c_dim \
--ckpt_dir $ckpt_dir \
--ckpt_save_interval $ckpt_save_interval
# tensorboard --logdir runs/*
##################################################################
# stage3: infer data from x space to z space and save to numpy npz
##################################################################
echo "start to infer data from x space to z space and store to numpy npz"
for ((infer_epoch=0;infer_epoch<${epochs};infer_epoch=infer_epoch+ckpt_save_interval))
do
np_dir=$infer_data_dir/$infer_epoch
python -u main.py \
--eval \
--test_data_npz $test_data_npz \
--flow $flow \
--num_blocks $num_blocks \
--num_hidden $num_hidden \
--infer_epoch $infer_epoch \
--device $device \
--ckpt_dir $ckpt_dir \
--np_dir $np_dir
done
##################################################################
# stage4: parallel transfer numpy npz to kaldi ark
##################################################################
tempfifo="temp_fifo"
mkfifo ${tempfifo}
exec 6<>${tempfifo}
rm -f ${tempfifo}
for ((i=1;i<=${infer_job_num};i++))
do
{
echo
}
done >&6
for ((infer_epoch=0;infer_epoch<${epochs};infer_epoch=infer_epoch+ckpt_save_interval))
do
read -u6
{
np_file=$infer_data_dir/$infer_epoch/feats.npz
ark_dir=$infer_data_dir/$infer_epoch
python -u tools/npz2ark.py \
--src_file $np_file \
--dest_dir $ark_dir
echo "" >&6
} &
done
# close fd6 pipline (fifo)
exec 6>&-
```
init_model.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: _init_model.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Mon 20 Jan 2020 11:19:38 PM CST
# ************************************************************************/
import flows as fnn
import math
import os
import numpy as np
import torch
import torch.nn as nn
import torch.nn.functional as F
def init_model(args, num_inputs=72):
args.cuda = not args.no_cuda and torch.cuda.is_available()
if args.cuda:
os.environ["CUDA_VISIBLE_DEVICES"] = args.device
device = torch.device("cuda:" + args.device)
else:
device = torch.device("cpu")
# network structure
num_hidden = args.num_hidden
num_cond_inputs = None
act = 'relu'
assert act in ['relu', 'sigmoid', 'tanh']
modules = []
# normalization flow
assert args.flow in ['maf', 'realnvp', 'glow']
if args.flow == 'glow':
mask = torch.arange(0, num_inputs) % 2
mask = mask.to(device).float()
print("Warning: Results for GLOW are not as good as for MAF yet.")
for _ in range(args.num_blocks):
modules += [
fnn.BatchNormFlow(num_inputs),
fnn.LUInvertibleMM(num_inputs),
fnn.CouplingLayer(
num_inputs, num_hidden, mask, num_cond_inputs,
s_act='tanh', t_act='relu')
]
mask = 1 - mask
elif args.flow == 'realnvp':
mask = torch.arange(0, num_inputs) % 2
mask = mask.to(device).float()
for _ in range(args.num_blocks):
modules += [
fnn.CouplingLayer(
num_inputs, num_hidden, mask, num_cond_inputs,
s_act='tanh', t_act='relu'),
fnn.BatchNormFlow(num_inputs)
]
mask = 1 - mask
elif args.flow == 'maf':
for _ in range(args.num_blocks):
modules += [
fnn.MADE(num_inputs, num_hidden, num_cond_inputs, act=act),
fnn.BatchNormFlow(num_inputs),
fnn.Reverse(num_inputs)
]
model = fnn.FlowSequential(*modules)
for module in model.modules():
if isinstance(module, nn.Linear):
nn.init.orthogonal_(module.weight)
if hasattr(module, 'bias') and module.bias is not None:
module.bias.data.fill_(0)
return model
```
test.sh
```#!/bin/bash
#*************************************************************************
# > File Name: test.sh
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Thu 30 Jan 2020 01:48:57 PM CST
# ************************************************************************/
# sample same index from x and z, make tsv
python -u comp_tsv_data_prepare.py \
--pre_npz ../data/feats.npz \
--infered_npz ../data/feats.npz \
--class_num 30 \
--sample_num 300 \
--tsv_dir ./tsv
```
mat_cat.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: mat_cat.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Sat 01 Feb 2020 01:45:30 PM CST
# ************************************************************************/
import numpy as np
def class_mean(data, label):
"u_j and var_j"
assert np.shape(data)[0] == np.shape(label)[0]
data_class = np.unique(label)
contain = []
for i in range(len(data_class)):
contain.append([])
for i in range(len(label)):
class_index = label[i]
contain[class_index].append(data[i])
class_dataset = []
for it in contain:
class_dataset.append(np.array(it))
class_mean = np.zeros((len(class_dataset), np.shape(data)[1]))
for i in range(len(class_dataset)):
it = class_dataset[i]
class_mean[i] = it.mean(axis=0)
return class_mean
def all_mean(data, label):
'''compute the all mean and var'''
all_mean = np.ones((len(np.unique(label)), np.shape(data)[1]), dtype=float)
all_mean_1d = data.mean(axis=0)
all_mean = all_mean*all_mean_1d
return all_mean
if __name__ == "__main__":
import torch
data = [
[1, 1, 1],
[1, 1, 1],
[0, 0, 0]
]
label = [1, 0, 1]
data = np.array(data)
class_mean = class_mean(data, label)
class_mean = torch.from_numpy(class_mean)
print(class_mean)
all_mean = all_mean(data, label)
all_mean = torch.from_numpy(all_mean)
print(all_mean)
# split and cat
c_dim = 2
class_mean = class_mean[:, :c_dim]
all_mean = all_mean[:, c_dim:]
class_mean = torch.cat((class_mean, all_mean), 1)
print(class_mean)
```
guassion_sample.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: guassion_sample.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Sat 22 Feb 2020 07:22:40 PM CST
# ************************************************************************/
import numpy as np
mean = np.zeros(5, dtype=float)
conv = np.identity(5, dtype=float) * 0.1
size = 10
val = np.random.multivariate_normal(mean=mean, cov=conv, size=size)
print("mean", np.shape(mean))
print(mean)
print("conv", np.shape(conv))
print(conv)
print("val", np.shape(val))
print(val)
```
mean.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: mean.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Wed 05 Feb 2020 03:24:32 PM CST
# ************************************************************************/
import torch
import numpy as np
def get_class_mean(data, label):
assert np.shape(data)[0] == np.shape(label)[0]
data_class = np.unique(label)
contain = []
for i in range(len(data_class)):
contain.append([])
for i in range(len(label)):
class_index = label[i]
contain[class_index].append(data[i])
class_dataset = []
for it in contain:
class_dataset.append(np.array(it))
class_mean = np.zeros((len(class_dataset), np.shape(data)[1]))
for i in range(len(class_dataset)):
it = class_dataset[i]
class_mean[i] = it.mean(axis=0)
return class_mean
def get_all_mean(data, label):
'''compute the all mean and var'''
all_mean = np.ones((len(np.unique(label)), np.shape(data)[1]), dtype=float)
all_mean_1d = data.mean(axis=0)
all_mean = all_mean*all_mean_1d
return all_mean
```
main.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: main.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Mon 20 Jan 2020 10:42:06 PM CST
# ************************************************************************/
from utils import get_args
from trainer import trainer
if __name__ == "__main__":
args = get_args()
flow_trainer = trainer(args)
if not args.eval:
flow_trainer.train()
else:
if not args.ark:
flow_trainer.generate_z_np()
else:
flow_trainer.generate_z_kaidl()
```
args.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: args.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Mon 20 Jan 2020 10:44:10 PM CST
# ************************************************************************/
import argparse
def get_args():
parser = argparse.ArgumentParser(description='PyTorch Flows for sre')
parser.add_argument(
'--batch_size',
type=int,
default=20000,
help='input batch size for training (default: 20000)')
parser.add_argument(
'--epochs',
type=int,
default=10,
help='number of epochs to train (default: 100)')
parser.add_argument(
'--infer_epoch',
type=int,
default=-1,
help='index of ckpt epoch to infer (default: 100)')
parser.add_argument(
'--num_hidden',
type=int,
default=256,
help='number of hidden of model')
parser.add_argument(
'--lr', type=float, default=0.001, help='learning rate (default: 0.001)')
parser.add_argument(
'--flow', default='maf', help='flow to use: maf | realnvp | glow')
parser.add_argument(
'--no_cuda',
action='store_true',
default=False,
help='disables CUDA training')
parser.add_argument(
'--ark',
action='store_true',
default=False,
help='infer kaldi or numpy data')
parser.add_argument(
'--num_blocks',
type=int,
default=10,
help='number of invertible blocks (default: 10)')
parser.add_argument(
'--seed', type=int, default=1, help='random seed (default: 1)')
parser.add_argument(
'--device',
default='0',
help='cuda visible devices (default: 0)')
parser.add_argument(
'--log',
default='log',
help='log status')
parser.add_argument(
'--ark_dir',
default='infer_ark_data',
help='kaldi ark data dir')
parser.add_argument(
'--train_data_npz',
default='./data/feats.npz',
help='train data npz path')
parser.add_argument(
'--model_name',
default='flow',
help='model_name')
parser.add_argument(
'--dataset_name',
default='voxceleb1',
help='dataset name')
parser.add_argument(
'--np_dir',
default='./np_data',
help='infer data npz dir')
parser.add_argument(
'--test_data_npz',
default='./data/feats.npz',
help='infer data npz path')
parser.add_argument(
'--ckpt_save_interval',
type=int,
default=1,
help='how many epochs to wait before saving models')
parser.add_argument(
'--ckpt_dir',
default='ckpt',
help='dir to save check points')
parser.add_argument(
'--eval',
action='store_true',
default=False,
help='disables CUDA training')
parser.add_argument('--v_c', type=float, default=0.1, help='variance of the class space (default: 0.1)')
parser.add_argument('--v_0', type=float, default=1.0, help='variance of the result space (default: 2.0)')
parser.add_argument('--c_dim', type=int, default=36, help='hda p dim (default: 36)')
parser.add_argument('--u_0', type=float, default=1.0, help='mean of the result space (default: 1.0)')
parser.add_argument('--u_shift', type=float, default=0.5, help='class_mean shift')
args = parser.parse_args()
return args
```
data_loader.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: data_loader.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Mon 20 Jan 2020 06:18:35 PM CST
# ************************************************************************/
import torch
import torch.utils.data as data
import os
import numpy as np
import copy
import random
class feats_data_loader(data.Dataset):
def __init__(self, npz_path="data/feats.npz", dataset_name="voxceleb1"):
assert os.path.exists(npz_path) == True
print("hi")
self.dataset_name = dataset_name
feat_data = np.load(npz_path)['feats']
spker_label = np.load(npz_path)['spker_label'] # spker label for pytorch train
utt_label = np.load(npz_path)['utt_label'] # utt label for kaili test
self.feat_data = feat_data
self.spker_label = spker_label
self.utt_label = utt_label
print("dataset: {}".format(dataset_name))
print("feats shape: ", np.shape(feat_data))
print("spker label shape: ", np.shape(spker_label))
print("num of spker: ", np.shape(np.unique(spker_label)))
print("utt label shape: ", np.shape(utt_label))
print("num of utt: ", np.shape(np.unique(utt_label)))
def get_utt_data(self):
'''for kaldi test'''
utt_class = np.unique(self.utt_label)
utt_data = {}
for i in utt_class:
utt_data[i] = []
for i in range(len(self.data)):
key = self.utt_label[i]
utt_data[key].append(self.data[i])
return utt_data
def __len__(self):
return len(self.spker_label)
def __getitem__(self, index):
return self.feat_data[index], self.spker_label[index]
@property
def data(self):
return self.feat_data
@property
def label(self):
'''default label is spker_label'''
return self.spker_label
if __name__ == "__main__":
# test
train_data = feats_data_loader(
npz_path="./data/feats.npz", dataset_name="vox")
print(train_data.data[1])
print(train_data.label[1])
print(train_data.utt_label[1])
```
trainer.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: trainer.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Mon 20 Jan 2020 10:52:14 PM CST
# ************************************************************************/
from init_model import *
import os
import torch
from data_loader import *
import torch.optim as optim
from utils import *
import torch.nn.functional as F
import kaldi_io
from tqdm import tqdm
from tensorboardX import SummaryWriter
pi = torch.from_numpy(np.array(np.pi))
class trainer(object):
def __init__(self, args):
self.args = args
# init model
self.model = init_model(args)
# init optimizer
self.optimizer = optim.Adam(self.model.parameters(), lr=args.lr)
# init work env
args.cuda = not args.no_cuda and torch.cuda.is_available()
if args.cuda:
os.environ["CUDA_VISIBLE_DEVICES"] = args.device
self.device = torch.device("cuda:" + args.device)
else:
self.device = torch.device("cpu")
print("torch device: {}".format(self.device))
# tensorboardX
self.writer = SummaryWriter(comment=args.model_name)
self.global_step = 0
def train(self):
args = self.args
kwargs = {'num_workers': 7, 'pin_memory': True}
# init dataloader
self.dataset = feats_data_loader(
npz_path=args.train_data_npz, dataset_name=args.dataset_name)
self.train_loader = torch.utils.data.DataLoader(
self.dataset, batch_size=self.args.batch_size, shuffle=True, **kwargs)
self.reload_checkpoint()
self.model.to(self.device)
c_dim = args.c_dim # hda p dim (default: 36)
v_c = args.v_c # variance of the class space (default: 0.1)
v_0 = args.v_0 # variance of the result space (default: 2.0)
u_0 = args.u_0 # mean of the result space (default: 1.0)
DATA_DIM = np.shape(self.dataset.data)[1]
# init var_global
var_c = torch.ones(c_dim, device=self.device) * v_c
var_0 = torch.ones((DATA_DIM-c_dim), device=self.device) * v_0
var_global = torch.cat((var_c, var_0), 0).unsqueeze(0)
var_global.to(self.device)
# init all_mean
self.all_mean = torch.ones((len(np.unique(self.dataset.label)), DATA_DIM), dtype=float) * u_0
# main to train
start_epoch = self.epoch_idx
if start_epoch >= args.epochs:
print("training is down!")
return
for idx in range(start_epoch, args.epochs): # epochs
self.epoch_idx = idx
train_loss = 0
train_avg_loss = AverageMeter()
# init class mean from x space
if idx == 0:
self.init_class_mean()
# init contain
self.contain = []
for i in range(self.class_mean.shape[0]):
self.contain.append([])
pbar = tqdm(total=len(self.train_loader.dataset))
for batch_idx, (data, label) in enumerate(self.train_loader): # batchs
data = data.to(self.device)
label = label.to(self.device)
self.optimizer.zero_grad()
mean_j = torch.index_select(self.class_mean, 0, label).to(self.device)
'''NOTE: if you want to change loss function, z must be returned to update contain and class mean'''
# compute hda Gaussion log-likehood
loss, z = self.model.HDA_Gaussion_log_likehood(data, mean_j, var_global)
# loss
loss.backward()
cur_loss = loss.item()
# loss logging
self.writer.add_scalar('LogLL', loss.item(), self.global_step)
self.global_step += 1
train_loss += cur_loss
train_avg_loss.update(loss.item(), data.size(0))
self.optimizer.step()
# update contain
z = z.cpu().detach().numpy()
for i in range(len(label)):
self.contain[label[i]].append(z[i])
pbar.update(data.size(0))
pbar.set_description('[Epoch: {}] HDA Gaussion log-likehood = {:.6f}'.format(idx, train_avg_loss.val))
pbar.close()
print('====> Epoch: {} Average loss: {:.6f}'.format(idx, train_avg_loss.avg))
print("Batch Norm...")
for module in self.model.modules():
if isinstance(module, fnn.BatchNormFlow):
module.momentum = 0
# this step need allocate lots of memory...
print("this step need allocate lots of memory...")
with torch.no_grad():
tmp = torch.from_numpy(self.dataset.data[:10000, ]).to(self.device)
self.model(tmp)
for module in self.model.modules():
if isinstance(module, fnn.BatchNormFlow):
module.momentum = 1
# update class mean afer epoch training
self.update_class_mean()
if self.epoch_idx % args.ckpt_save_interval == 0:
self.save_checkpoint()
self.save_checkpoint()
print("training is down")
def init_class_mean(self):
args = self.args
DATA_DIM = len(self.dataset.data[0])
# init class mean from x space at the start of epoch 0
label_num = len(np.unique(self.dataset.label))
print('epoch 0: init class_mean by sampling from N~(0, {})'.format(args.v_0))
mean = np.zeros(DATA_DIM)
conv = np.identity(DATA_DIM) * args.v_0
class_mean = np.random.multivariate_normal(mean=mean, cov=conv, size=label_num)
class_mean = torch.from_numpy(class_mean)
# split data
class_mean = class_mean[:, :args.c_dim]
all_mean = self.all_mean[:, args.c_dim:]
# cat data
class_mean = torch.cat((class_mean, all_mean), 1)
# epoch 0 no u_shift
self.class_mean = class_mean.to(self.device)
def update_class_mean(self):
args = self.args
DATA_DIM = len(self.dataset.data[0])
# update class mean from z space at the start of epoch x > 0 (contain)
if self.contain != None:
print('update class_mean from z space and args.u_shift is {}'.format(args.u_shift))
class_dataset = []
for it in self.contain:
class_dataset.append(np.array(it))
class_mean = np.zeros((len(class_dataset), DATA_DIM))
for i in range(len(class_dataset)):
it = class_dataset[i]
class_mean[i] = it.mean(axis=0)
class_mean = torch.from_numpy(class_mean)
# split data
class_mean = class_mean[:, :args.c_dim]
all_mean = self.all_mean[:, args.c_dim:]
# cat data
class_mean = torch.cat((class_mean, all_mean), 1)
# shift from last epoch class_mean
self.class_mean = class_mean.to(self.device)*args.u_shift + self.class_mean*(1.0-args.u_shift)
else:
raise Exception("contain error")
def generate_z_ark(self):
args = self.args
c_dim = self.args.c_dim
# init model
if args.infer_epoch == -1:
self.reload_checkpoint()
else:
ckpt_path = '{}/ckpt_epoch{}.pt'.format(args.ckpt_dir, args.infer_epoch)
assert os.path.exists(ckpt_path) == True
checkpoint_dict = torch.load(ckpt_path, map_location=self.device)
self.model.load_state_dict(checkpoint_dict['model'])
print("successfully reload {} [model] to infer".format(ckpt_path))
self.model.to(self.device)
self.model.eval()
# init data x
dataset = feats_data_loader(
npz_path=self.args.test_data_npz, dataset_name=self.args.dataset_name)
utt_data = dataset.get_utt_data()
ark_dir = args.ark_dir
if not os.path.exists(ark_dir):
os.makedirs(ark_dir)
ark_path = args.ark_dir + os.sep + 'feats.ark'
pbar = tqdm(total=len(utt_data))
with open(ark_path,'wb') as f:
for utt, data in utt_data.items():
data = np.array(data)
data = torch.from_numpy(data)
data = data.to(self.device)
data, _ = self.model(data)
data = data.cpu().detach().numpy()
# split data
data = data[:, :c_dim]
kaldi_io.write_mat(f, data, utt)
pbar.update(1)
pbar.set_description('generate utter {} of frames {}'.format(
utt, data.shape[0]))
pbar.close()
print("successfully save kaldi ark in {}".format(ark_path))
def generate_z_np(self):
args = self.args
c_dim = self.args.c_dim
# init model
if args.infer_epoch == -1:
self.reload_checkpoint()
else:
ckpt_path = '{}/ckpt_epoch{}.pt'.format(args.ckpt_dir, args.infer_epoch)
assert os.path.exists(ckpt_path) == True
checkpoint_dict = torch.load(ckpt_path, map_location=self.device)
self.model.load_state_dict(checkpoint_dict['model'])
print("successfully reload {} [model] to infer".format(ckpt_path))
self.model.to(self.device)
self.model.eval()
# init data x
dataset = feats_data_loader(
npz_path=self.args.test_data_npz, dataset_name=self.args.dataset_name)
kwargs = {'num_workers': 6, 'pin_memory': True}
test_loader = torch.utils.data.DataLoader(
dataset, batch_size=25000, shuffle=False, **kwargs)
pbar = tqdm()
for batch_idx, (data, label) in enumerate(test_loader): # batchs
data = data.to(self.device)
z, _ = self.model(data)
z = z.cpu().detach().numpy()
if batch_idx == 0:
feats = z
else:
feats = np.vstack((feats, z))
shape = np.shape(feats)
pbar.set_description('feats.npz generateing: {:.2f}%\t{}'.format(shape[0]/len(dataset.label)*100, shape))
pbar.close()
feats = feats[:, :c_dim]
print(np.shape(feats))
print("saving...")
np_dir = args.np_dir
if not os.path.exists(np_dir):
os.makedirs(np_dir)
npz_path = np_dir + os.sep + 'feats.npz'
np.savez(npz_path, feats=feats, spker_label=dataset.spker_label, utt_label=dataset.utt_label)
print("sucessfully saved in {}".format(npz_path))
def reload_checkpoint(self):
'''check if checkpoint file exists and reload the checkpoint'''
args = self.args
self.epoch_idx = 0
if not os.path.exists(args.ckpt_dir):
os.makedirs(args.ckpt_dir)
print("can not find ckpt dir, and creat {} dir".format(args.ckpt_dir))
print("start to train fron epoch 0...")
else:
files = os.listdir(args.ckpt_dir)
ckpts = []
for f in files:
if(f.endswith(".pt")):
ckpts.append(f)
if(len(ckpts)):
import re
for ckpt in ckpts:
ckpt_epoch = int(re.findall(r"\d+", ckpt)[0])
if ckpt_epoch > self.epoch_idx:
self.epoch_idx = ckpt_epoch
checkpoint_dict = torch.load(
'{}/ckpt_epoch{}.pt'.format(args.ckpt_dir, self.epoch_idx), map_location=self.device)
self.optimizer.load_state_dict(checkpoint_dict['optimizer'])
print("sucessfully reload mdl_epoch{}.pt [optimizer]".format(self.epoch_idx))
# NOTE: this maybe a bug in pytorch
for state in self.optimizer.state.values():
for k, v in state.items():
if torch.is_tensor(v):
state[k] = v.cuda()
self.model.load_state_dict(checkpoint_dict['model'])
print("sucessfully reload mdl_epoch{}.pt [model]".format(self.epoch_idx))
self.class_mean = checkpoint_dict['class_mean']
print("sucessfully reload mdl_epoch{}.pt [class_mean]".format(self.epoch_idx))
print("sucessfully reload mdl_epoch{}.pt all".format(self.epoch_idx))
self.epoch_idx += 1
self.contain = None
else:
print("start to train fron epoch 0...")
def save_checkpoint(self):
'''save the checkpoint, including model and optimizer, and model index is epoch'''
args = self.args
if not os.path.exists(args.ckpt_dir):
os.makedirs(args.ckpt_dir)
print("can not find ckpt dir, and creat {} dir".format(args.ckpt_dir))
PATH = '{}/ckpt_epoch{}.pt'.format(args.ckpt_dir, self.epoch_idx)
torch.save({
'model': self.model.state_dict(),
'optimizer': self.optimizer.state_dict(),
'class_mean': self.class_mean
}, PATH)
if __name__ == "__main__":
pass
```
matrix_helper.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: matrix_helper.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Sat 01 Feb 2020 01:18:09 PM CST
# ************************************************************************/
import numpy as np
import torch
def mat_1d_combination(u_j, u_0):
return torch.cat((u_j, u_0))
def square_mat_diag_combination(var_j, var_0):
"""
input:
two square matrix, pytorch tensor
(n*n) A = [[1, 2],
[2, 1]]
(m*m) B = [[1, 1]
[1, 1]]
output:
get a sequare matrix
(m+n)*(m+n) C = [[A, 0],
[0, B]]
"""
var_j_shape = var_j.shape
var_0_shape = var_0.shape
# square matrix check
assert(var_j_shape[0]==var_j_shape[1])
assert(var_0_shape[0]==var_0_shape[1])
assert(var_j.dtype == var_0.dtype)
n = var_j_shape[0]
m = var_0_shape[0]
dtype = var_j.dtype
zeros = torch.zeros((m, n), dtype=dtype)
left = torch.cat((var_j, zeros))
zeros = torch.zeros((n, m), dtype=dtype)
right = torch.cat((zeros, var_0))
return torch.cat((left, right), 1)
if __name__ == "__main__":
'''test'''
u_j = torch.from_numpy(np.array([1. ,1.]))
u_0 = torch.from_numpy(np.array([0. ,0.]))
print(u_j)
print(u_0)
print(mat_1d_combination(u_j, u_0))
var_j = np.array([[1, 2],
[2, 1]], dtype=float)
var_j = torch.from_numpy(var_j)
var_0 = np.array([[1, 1, 1],
[1, 1, 1],
[1, 1, 1]], dtype=float)
var_0 = torch.from_numpy(var_0)
print(var_j)
print(var_0)
print(square_mat_diag_combination(var_j, var_0))
```
comp_tsv_data_prepare.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: tsv_data_prepare.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Tue 21 Jan 2020 04:12:58 PM CST
# ************************************************************************/
import os
import numpy as np
import random
def save_label_tsv(path, x):
y = x.flatten()
n = len(y)
with open(path, 'w') as f:
for i in range(n):
v = y[i]
f.write('%s\n' % (str(v)))
print("successfully saved in {}".format(path))
def save_tensor_tsv(path, feats):
with open(path, 'w') as f:
num, dim = feats.shape
for line in range(num):
for d in range(dim):
if d > 0:
f.write('\t')
v = str(feats[line][d])
f.write(v)
f.write('\n')
print("successfully saved in {}".format(path))
def write_tsv_embeddings(prefix, feats, labels=None, dirs=None):
'''
Write a tensor (or meta) to a tsv file for the `Embedding Project` tool
:param prefix: output file prefix
:param feats: embedding tensor NxDim
:param labels: meta data
:return: None
'''
if dirs!=None:
if os.path.exists(dirs) == False:
os.makedirs(dirs)
prefix = dirs + '/' + prefix
feat_path = prefix + '_data.tsv'
save_tensor_tsv(feat_path, feats)
if labels is None:
return
dims = len(labels.shape)
label_path = dirs + '/' 'label.tsv'
if dims == 1:
save_label_tsv(label_path, labels)
else:
save_tensor_tsv(label_path, labels)
def sample(pre_npz, infered_npz, sample_class=50, sample_num=500, dirs=None):
'''
:param npz_path: npz file path which stores the datesets
:param prefix: out_put tsv file name prefix
:param sample_class: number of sample classes / number of spkers
:param sample_num: sample number of each spkers
:return: None
'''
print("loading data...")
pre_data = np.load(pre_npz)['feats']
pre_label = np.load(pre_npz)['spker_label']
infer_data = np.load(infered_npz)['feats']
infer_label = np.load(infered_npz)['spker_label']
assert pre_label.any() == infer_label.any() # check
'''random shuffle data and lable'''
index = [i for i in range(len(pre_label))]
random.shuffle(index)
pre_data = pre_data[index]
infer_data = infer_data[index]
pre_label = pre_label[index]
print("start to sample...")
sample_index = []
while(len(sample_index) < sample_class):
idx = np.random.randint(0, len(np.unique(pre_label))-1)
if idx not in sample_index:
sample_index.append(idx)
sample_pre_data = []
sample_infer_data = []
sample_label = []
print("total label: ", len(pre_label))
print("unique label: ", len(np.unique(pre_label)))
print("sample data...")
print("sample class: {}, sample num: {}".format(sample_class, sample_num))
for idx in sample_index:
counter = 0
print("sample idx", idx)
for i in range(len(pre_label)):
if(idx == pre_label[i]):
if(counter < sample_num):
counter += 1
sample_label.append(idx)
sample_pre_data.append(pre_data[idx])
sample_infer_data.append(infer_data[idx])
else:
break
x1 = np.array(sample_pre_data)
x2 = np.array(sample_infer_data)
y = []
table = {}
counter = 0
for it in sample_label:
if it not in table:
table[it] = counter
y.append(counter)
counter += 1
else:
idx = table[it]
y.append(idx)
y = np.array(y)
write_tsv_embeddings(prefix="x", feats=x1, labels=y, dirs=dirs)
write_tsv_embeddings(prefix="z", feats=x2, labels=y, dirs=dirs)
if __name__ == "__main__":
import argparse
parser = argparse.ArgumentParser(
description='a apple a day, keep doctor away')
parser.add_argument('--pre_npz', type=str,
default="./data/feats.npz", help='load the npz data')
parser.add_argument('--infered_npz', type=str,
default="./data/feats.npz", help='load the npz data')
parser.add_argument('--class_num', type=int, default=30,
help='class num / spker num')
parser.add_argument('--sample_num', type=int, default=300,
help='sample num of each spker')
parser.add_argument('--tsv_dir', type=str,
default="./tsv", help='tsv dir')
args = parser.parse_args()
# sample, data preparetion and make tsv file
sample(args.pre_npz, args.infered_npz, args.class_num, args.sample_num, args.tsv_dir)
```
npz2ark.py
```#!/usr/bin/env python
# coding=utf-8
# *************************************************************************
# > File Name: npz2ark.py
# > Author: Yang Zhang
# > Mail: zyziszy@foxmail.com
# > Created Time: Tue 04 Feb 2020 04:07:38 PM CST
# ************************************************************************/
import numpy as np
import kaldi_io
from tqdm import tqdm
import os
def npz2ark(npz_path, kaldi_dir):
print("loading...")
feats = np.load(npz_path)['feats']
utt_label = np.load(npz_path)['utt_label']
utt_class = np.unique(utt_label)
utt_data = {}
for i in utt_class:
utt_data[i] = []
for i in range(len(feats)):
key = utt_label[i]
utt_data[key].append(feats[i])
if not os.path.exists(kaldi_dir):
os.makedirs(kaldi_dir)
ark_path = kaldi_dir + os.sep + 'feats.ark'
print("ark writing...")
pbar = tqdm(total=len(utt_data))
with open(ark_path,'wb') as f:
for utt, data in utt_data.items():
data = np.array(data)
kaldi_io.write_mat(f, data, utt)
pbar.update(1)
pbar.set_description('generate utter {} of frames {}'.format(utt, data.shape[0]))
pbar.close()
print("successfully save kaldi ark in {}".format(ark_path))
if __name__ == "__main__":
import argparse
parser = argparse.ArgumentParser()
parser.add_argument('--src_file', default="feats.npz", help='src file of feats.(npz)')
parser.add_argument('--dest_dir', default="./", help='dest dir of feats.(npz)')
args = parser.parse_args()
npz2ark(args.src_file, args.dest_dir)
```
|
zz5414/jekyll-now
|
zz5414/jekyll-now
2018-09-02-Hello-World.md
```---
layout: post
title: Hello World
---
### new Start
Hi I'm Heejin
## 시작
안녕
```
|
zzarrafa/reacjts
|
zzarrafa/reacjts
ContactList.js
```import React from 'react';
import ContactCard from './ContactCard';
const ContactList = (props) => {
const renderContatList = props.contacts.map((contact) => {
return <ContactCard> contact={contact}</ContactCard>;
});
return (
<div className="ui celled list">{renderContatList}
</div>
);
}
export default ContactList;```
|
zzctommy/public-source-code
|
zzctommy/public-source-code
P2467 [SDOI2010]地精部落(oeis).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 4500
int n,mod;
map<int,int>A;
vector<int>ans;
signed main(){
n=read(),mod=read();
ans.pb(1),A[-1]=0,A[0]=2;
int k=0,e=1;
for(int i=0;i<=n;++i){
int am=0;A[k+e]=0,e=-e;
for(int j=0;j<=i;++j)(am+=A[k])%=mod,A[k]=am,k+=e;
if(i>1)i%2==0?ans.pb(A[-i/2]):ans.pb(A[i/2]);
}
printf("%d\n",ans[n-1]);
}```
P5837 [USACO19DEC]Milk Pumping G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 1009
#define inf (0x3f3f3f3f)
int n,m;
struct egde {
int nxt,to,c,f;
}e[N<<1];
struct node {
int fr,to,c,f;
node(){fr=to=c=f=0;}
node(int x,int y,int z,int w){fr=x,to=y,c=z,f=w;}
}a[N];
struct dd {
int dis,u;
inline bool operator < (const dd&rhs)const{return dis>rhs.dis;}
dd(int a,int b){u=a,dis=b;}
};
int head[N],num_edge,dis[N],vis[N];
double ans;
void addedge(int fr,int to,int c,int f) {
++num_edge;
e[num_edge].c=c;
e[num_edge].f=f;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
int dij(int lim) {
for(int i=1;i<=n;++i)dis[i]=inf,vis[i]=0;
dis[1]=0;
priority_queue<dd>q;
q.push(dd(1,0));
while(!q.empty()) {
dd now=q.top();q.pop();
int u=now.u;
if(vis[u])continue;
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(e[i].f<lim)continue;
if(dis[v]>dis[u]+e[i].c) {
dis[v]=dis[u]+e[i].c;
if(!vis[v])q.push(dd(v,dis[v]));
}
}
}
return dis[n];
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd(),c=rd(),f=rd();
addedge(x,y,c,f),addedge(y,x,c,f);
a[i]=node(x,y,c,f);
}
for(int i=1;i<=m;++i)ans=max(ans,1.*a[i].f/dij(a[i].f));
printf("%d\n",(int)(1000000*ans));
return 0;
}```
P1505 [国家集训队]旅游.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
const int N=400005;
const int M=N<<1;
const int T=N<<2;
const int inf=0x3f3f3f3f;
int n,cnt,a[M],FR[N],TO[N],V[N],MD[N];
int fa[M],top[M],dfn[M],rev[M],tmr,siz[M],son[M],dep[M];
int mxv[T],miv[T],sum[T],tag[T];
struct edge{
int nxt,to;
}e[M<<1];
int head[M],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void adde(int fr,int to){addedge(fr,to),addedge(to,fr);}
void dfs1(int u,int ft){
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v],fa[v]=u;
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
dfn[u]=++tmr,rev[tmr]=u,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v!=fa[u]&&v!=son[u])dfs2(v,v);
}
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){
mxv[p]=max(mxv[lc],mxv[rc]);
miv[p]=min(miv[lc],miv[rc]);
sum[p]=sum[lc]+sum[rc];
}
void build(int l,int r,int p=1){
sum[p]=0,miv[p]=inf,mxv[p]=-inf;
if(l==r){
if(a[rev[l]]!=inf)sum[p]=miv[p]=mxv[p]=a[rev[l]];
return;
}
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void addtag(int p){sum[p]=-sum[p],swap(mxv[p],miv[p]),mxv[p]=-mxv[p],miv[p]=-miv[p],tag[p]^=1;}
void pushdown(int p){if(tag[p])addtag(lc),addtag(rc),tag[p]=0;}
void update(int ql,int qr,int l=1,int r=cnt,int p=1){
if(ql<=l&&r<=qr)return addtag(p),void();
pushdown(p);
int mid=(l+r)>>1;
if(mid<ql)update(ql,qr,mid+1,r,rc);
else if(qr<=mid)update(ql,qr,l,mid,lc);
else update(ql,qr,l,mid,lc),update(ql,qr,mid+1,r,rc);
pushup(p);
}
void change(int pos,int k,int l=1,int r=cnt,int p=1){
if(l==r)return sum[p]=miv[p]=mxv[p]=k,void();
pushdown(p);
int mid=(l+r)>>1;
if(pos<=mid)change(pos,k,l,mid,lc);
else change(pos,k,mid+1,r,rc);
pushup(p);
}
int query_sum(int ql,int qr,int l=1,int r=cnt,int p=1){
if(ql<=l&&r<=qr)return sum[p];
pushdown(p);
int mid=(l+r)>>1;
if(mid<ql)return query_sum(ql,qr,mid+1,r,rc);
else if(qr<=mid)return query_sum(ql,qr,l,mid,lc);
else return query_sum(ql,qr,l,mid,lc)+query_sum(ql,qr,mid+1,r,rc);
}
int query_max(int ql,int qr,int l=1,int r=cnt,int p=1){
if(ql<=l&&r<=qr)return mxv[p];
pushdown(p);
int mid=(l+r)>>1;
if(mid<ql)return query_max(ql,qr,mid+1,r,rc);
else if(qr<=mid)return query_max(ql,qr,l,mid,lc);
else return max(query_max(ql,qr,l,mid,lc),query_max(ql,qr,mid+1,r,rc));
}
int query_min(int ql,int qr,int l=1,int r=cnt,int p=1){
if(ql<=l&&r<=qr)return miv[p];
pushdown(p);
int mid=(l+r)>>1;
if(mid<ql)return query_min(ql,qr,mid+1,r,rc);
else if(qr<=mid)return query_min(ql,qr,l,mid,lc);
else return min(query_min(ql,qr,l,mid,lc),query_min(ql,qr,mid+1,r,rc));
}
int ask_sum(int x,int y){
int res=0;
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res+=query_sum(dfn[top[x]],dfn[x]),x=fa[top[x]];
// std::cout<<dfn[top[x]]<<' '<<dfn[x]<<' '<<query_sum(dfn[top[x]],dfn[x])<<'\n';
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
// std::cout<<dfn[x]<<' '<<dfn[y]<<' '<<query_sum(dfn[x],dfn[y])<<'\n';
return res+query_sum(dfn[x],dfn[y]);
}
int ask_max(int x,int y){
int res=-inf;
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res=max(res,query_max(dfn[top[x]],dfn[x])),x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
return max(res,query_max(dfn[x],dfn[y]));
}
int ask_min(int x,int y){
// cout<<x<<' '<<y<<endl;
int res=inf;
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res=min(res,query_min(dfn[top[x]],dfn[x])),x=fa[top[x]];
// cout<<dfn[top[x]]<<' '<<dfn[x]<<' '<<query_min(dfn[top[x]],dfn[x])<<endl;
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
// cout<<dfn[x]<<' '<<dfn[y]<<' '<<query_min(dfn[x],dfn[y])<<endl;
return min(res,query_min(dfn[x],dfn[y]));
}
void upd(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
update(dfn[top[x]],dfn[x]),x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
update(dfn[x],dfn[y]);
}
signed main(){
n=read(),cnt=n;
memset(a,0x3f,sizeof(a));
for(int i=1;i<n;++i){
FR[i]=read()+1,TO[i]=read()+1,V[i]=read();
MD[i]=++cnt,adde(FR[i],MD[i]),a[MD[i]]=V[i],adde(MD[i],TO[i]);
}
dfs1(1,0),dfs2(1,1),build(1,cnt);
char opt[10];
for(int q=read();q;--q){
scanf("%s",opt);int x=read()+1,y=read()+1;
if(opt[0]=='C')change(dfn[MD[--x]],--y);
else if(opt[0]=='N')upd(x,y);
else if(opt[0]=='S')printf("%d\n",ask_sum(x,y));
else if(opt[1]=='A')printf("%d\n",ask_max(x,y));
else if(opt[1]=='I')printf("%d\n",ask_min(x,y));
else puts("cynAKIOI!!!");
}
return 0;
}```
CF1111E Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
#define zky 1000000007
int n,q,num[N],tr[N],a[N],dp[N],ans;
int fa[N],top[N],dep[N],son[N],dfn[N],siz[N],timer;
vector<int>g[N];
void add(int x,int d) {
for(int i=x;i<=n;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)(res+=tr[i])%=zky;
return res;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(int v:g[u]) {
if(v==ft)continue;
dep[v]=dep[u]+1,fa[v]=u;
dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
dfn[u]=++timer,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int v:g[u]) {
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int query(int x,int y) {
int res=0;
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res+=ask(dfn[x])-ask(dfn[top[x]]-1);
x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
res+=ask(dfn[y])-ask(dfn[x]-1);
return res;
}
signed main() {
n=rd(),q=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].pb(y),g[y].pb(x);
}
dfs1(1,0),dfs2(1,1);
while(q--) {
int k=rd(),m=rd(),r=rd();
for(int i=1;i<=k;++i)a[i]=rd(),add(dfn[a[i]],1);
for(int i=1;i<=k;++i)num[i]=query(r,a[i])-1,dp[i]=0;
dp[0]=1,ans=0;
sort(num+1,num+k+1);
for(int i=1;i<=k;++i) {
for(int j=min(m,i);j>=0;--j) {
if(j<=num[i])dp[j]=0;
if(!j)break;
dp[j]=(dp[j-1]+1ll*dp[j]*(j-num[i])%zky)%zky;
//dp[i][j]=dp[i-1][j-1]+dp[i-1][j]*(j-num[i])
}
}
for(int i=1;i<=k;++i)ans=(ans+dp[i])%zky;
printf("%d\n",ans);
for(int i=1;i<=k;++i)add(dfn[a[i]],-1);
}
return 0;
}```
CF780F Axel and Marston in Bitland.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,m;
LL ans;
const int N=502;
bitset<N>bz[N][61][2],nw;
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read(),z=read();
bz[x][0][z].set(y);
}
rep(i,1,60){
static bitset<N>bt0,bt1;
rep(j,1,n){
bt0.reset(),bt1.reset();
rep(k,1,n){
if(bz[j][i-1][0][k])bt0|=bz[k][i-1][1];
if(bz[j][i-1][1][k])bt1|=bz[k][i-1][0];
}
bz[j][i][0]=bt0,bz[j][i][1]=bt1;
}
}
rep(i,1,n)nw.set(i);
int t=0;
per(i,60,0){
static bitset<N>nx;
nx.reset();
for(int j=1;j<=n;++j)if(nw[j])nx|=bz[j][i][t];
if(nx.any())nw=nx,ans|=1ll<<i,t^=1;
}
if(ans>1e18)cout<<-1<<'\n';
else cout<<ans<<'\n';
}```
CF471D MUH and Cube Walls.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=200006;
int n,m,a[N],b[N],p[N],x[N],y[N],ans;
int main() {
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)scanf("%d",&x[i]);
for(int i=1;i<=m;++i)scanf("%d",&y[i]);
for(int i=1;i<=n;++i)a[i]=x[i]-x[i+1];
for(int i=1;i<m;++i)b[i]=y[i]-y[i+1];
--m;
int j=0;
for(int i=2;i<=m;++i) {
while(j&&b[j+1]!=b[i])j=p[j];
if(b[j+1]==b[i])++j;
p[i]=j;
}
j=0;
for(int i=1;i<=n;++i) {
while(j&&b[j+1]!=a[i])j=p[j];
if(b[j+1]==a[i])++j;
if(j==m)++ans,j=p[j];
}
printf("%d\n",ans);
return 0;
}```
P5495 Dirichlet 前缀和.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define uint unsigned int
uint seed;
inline uint getnext(){
seed^=seed<<13;
seed^=seed>>17;
seed^=seed<<5;
return seed;
}
const int N=20000005;
uint n,a[N],pri[N/10],pct,ans;
bool vis[N];
signed main(){
cin>>n>>seed;
rep(i,1,n)a[i]=getnext();
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
for(int i=1;i<=pct;++i)
for(int j=1;j*pri[i]<=n;++j)
a[j*pri[i]]+=a[j];
for(int i=1;i<=n;++i)ans=ans^a[i];
cout<<ans<<'\n';
return 0;
}```
CF1329C Drazil Likes Heap.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 2100005
int h,g,n,m,a[N],ans[N],tot;
LL sum;
#define lc (p<<1)
#define rc (p<<1|1)
int find(int p){
if(!a[lc]&&!a[rc])return p;
if(a[lc]>a[rc])return find(lc);
else return find(rc);
}
void f(int p){
if(!a[lc]&&!a[rc])return a[p]=0,void();
if(a[lc]>a[rc])a[p]=a[lc],f(lc);
else a[p]=a[rc],f(rc);
}
void Main(){
n=(1<<(h=read()))-1,m=(1<<(g=read()))-1;
tot=sum=0,fill(a,a+(n*2)+2,0);
for(int i=1;i<=n;++i)a[i]=read(),sum+=a[i];
for(int i=1;i<=m;++i)
while(find(i)>m)ans[++tot]=i,sum-=a[i],f(i);
printf("%lld\n",sum);
for(int i=1;i<=tot;++i)printf("%d ",ans[i]);
puts("");
}
signed main(){for(int T=read();T;--T)Main();}```
P6835 [Cnoi2020]线形生物.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 1000005;
const int zky = 998244353;
int n, m, s[N];
vector<int>g[N];
signed main() {
read(), n = read(), m = read();
for (int i = 1; i <= m; ++ i) {
int u = read(), v = read();
g[u].pb(v);
}
for (int i = 1; i <= n; ++ i) {
int sum = 1;
for (int j : g[i]) (sum += s[i - 1] - s[j - 1] + 1) %= zky;
s[i] = (s[i - 1] + sum) % zky;
}
printf("%lld\n", (s[n] + zky) % zky);
return 0;
}
```
P4234 最小差值生成树.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50010;
const int M=200010;
const int T=N+M;
const int inf=2e9+10;
int n,m,ans=inf;
int cnt;
struct edge {int u,v,d;}e[M];
bool cmp(const edge &a,const edge &b) {return a.d<b.d;}
int ch[T][2],fa[T],val[T],id[T],rev[T],st[T];
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x) {
id[x]=x;
if(ch[x][0]&&val[id[ch[x][0]]]<val[id[x]])id[x]=id[ch[x][0]];
if(ch[x][1]&&val[id[ch[x][1]]]<val[id[x]])id[x]=id[ch[x][1]];
}
void pushdown(int x) {
if(!rev[x])return;
swap(ch[x][0],ch[x][1]),rev[x]^=1,rev[ch[x][0]]^=1,rev[ch[x][1]]^=1;
}
void rotate(int x) {
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;fa[y]=x,fa[x]=z;
pushup(y);
}
void splay(int x) {
int y=x,z,top=0;st[++top]=x;
while(nroot(y))st[++top]=y=fa[y];
while(top)pushdown(st[top--]);
while(nroot(x)) {
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[y][1]==x)^(ch[z][1]==y)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x) {
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){access(x),splay(x),rev[x]^=1;}
void split(int x,int y){makeroot(x),access(y),splay(y);}
void link(int x,int y){makeroot(x),fa[x]=y;}
void cut(int x,int y){split(x,y),fa[x]=ch[y][0]=0,pushup(y);}
multiset<int>s;
int F[N];
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i)e[i].u=rd(),e[i].v=rd(),e[i].d=rd();
sort(e+1,e+m+1,cmp);
for(int i=0;i<=n;++i)val[i]=inf,F[i]=i;
for(int i=1;i<=m;++i)val[i+n]=e[i].d;
for(int i=1;i<=m;++i) {
int u=e[i].u,v=e[i].v;
if(u==v)continue;
s.insert(e[i].d);
if(find(u)!=find(v))link(u,i+n),link(i+n,v),++cnt,F[find(u)]=find(v);
else {
split(u,v);int t=id[v],k=val[t];
cut(e[t-n].u,t),cut(e[t-n].v,t),s.erase(s.find(k));
link(u,i+n),link(i+n,v);
}
if(cnt==n-1)ans=min(ans,e[i].d-*s.begin());
}
printf("%d\n",ans);
return 0;
}```
CF1257D Yet Another Monster Killing Problem.cpp
```#include<bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
typedef long long LL;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,m,a[N],mx[N],ans,p[N],s[N];
void Main(){
n=read(),ans=0;
for(int i=1;i<=n;++i)a[i]=read(),mx[i]=0;
m=read();
for(int i=1;i<=m;++i)p[i]=read(),s[i]=read(),mx[s[i]]=max(p[i],mx[s[i]]);
for(int i=n-1;i>=1;--i)mx[i]=max(mx[i+1],mx[i]);
for(int i=1,cnt=0,now=0;i<=n;++i){
if(a[i]>mx[1])return puts("-1"),void();
++cnt,now=max(now,a[i]);
if(mx[cnt]<now)++ans,cnt=1,now=a[i];
}
printf("%d\n",ans+1);
}
signed main(){
for(int T=read();T;--T)Main();
}
```
CF896C Willem, Chtholly and Seniorious.cpp
```#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN=100005;
int n,m,seed,vmax,a[MAXN];
int rnd()
{
int ret=seed;
seed=(seed*7+13)%1000000007;
return ret;
}
int ksm(int n,int k,int p)
{
int base=n%p,ans=1;
while(k)
{
if(k&1)ans=ans*base%p;
k>>=1;
base=base*base%p;
}
return ans%p;
}
struct node{
int ll,rr;
mutable int val;
node(int L,int R=-1,int V=0):ll(L),rr(R),val(V){}
bool operator < (const node & rhs)const{return ll<rhs.ll;}
};
set<node>s;
#define it set<node>::iterator
it split(int pos)
{
it iter=s.lower_bound(node(pos));
if(iter!=s.end()&&iter->ll==pos)return iter;
--iter;
int l=iter->ll,r=iter->rr,v=iter->val;
s.erase(iter);
s.insert(node(l,pos-1,v));
return s.insert(node(pos,r,v)).first;
}
void assign(int l,int r,int v)
{
it itr=split(r+1),itl=split(l);
s.erase(itl,itr);
s.insert(node(l,r,v));
}
int querysum(int l,int r)
{
it itr=split(r+1),itl=split(l);
int res=0;
for(;itl!=itr;itl++)res=res+(itl->rr-itl->ll+1)*itl->val;
return res;
}
int kth(int l,int r,int k)
{
vector<pair<int,int> >v;
it itr=split(r+1),itl=split(l);
for(;itl!=itr;itl++)v.push_back(pair<int,int>(itl->val,itl->rr-itl->ll+1));
sort(v.begin(),v.end());
for(vector<pair<int,int> >::iterator iter=v.begin();iter!=v.end();iter++)
{
k-=iter->second;
if(k<=0)return iter->first;
}
return -1;
}
void add(int l,int r,int k)
{
it itr=split(r+1),itl=split(l);
for(;itl!=itr;itl++)
itl->val+=k;
}
int querypow(int l,int r,int k,int mod)
{
it itr=split(r+1),itl=split(l);
int res=0;
for(;itl!=itr;itl++)
res=(res+ksm(itl->val,k,mod)*((itl->rr-itl->ll+1)%mod)%mod)%mod;
return res;
}
signed main() {
scanf("%lld%lld%lld%lld",&n,&m,&seed,&vmax);
for(int i=1;i<=n;i++)
{
a[i]=(rnd()%vmax)+1;
s.insert(node(i,i,a[i]));
}
for(int i=1;i<=m;i++)
{
int opt=(rnd()%4)+1;
int l=(rnd()%n)+1;
int r=(rnd()%n)+1;
if(l>r)swap(l,r);
int x,y;
if(opt==3)x=(rnd()%(r-l+1))+1;
else x=(rnd()%vmax)+1;
if(opt==4)y=(rnd()%vmax)+1;
if(opt==1)add(l,r,x);
if(opt==2)assign(l,r,x);
if(opt==3)printf("%lld\n",kth(l,r,x));
if(opt==4)printf("%lld\n",querypow(l,r,x,y));
}
return 0;
}```
P2051 [AHOI2009]中国象棋.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
#define mod 9999973
int n,m,dp[N][N][N],ans;
void fmod(int&x){x-=mod,x+=x>>31&mod;}
signed main(){
n=read(),m=read();
dp[0][m][0]=1;
rep(i,0,n-1){
rep(j,0,m){
rep(k,0,m){
fmod(dp[i+1][j][k]+=dp[i][j][k]);//0
if(j>0)fmod(dp[i+1][j-1][k+1]+=1ll*j*dp[i][j][k]%mod);//1
if(k>0)fmod(dp[i+1][j][k-1]+=1ll*k*dp[i][j][k]%mod);//1
if(j>1)fmod(dp[i+1][j-2][k+2]+=1ll*j*(j-1)/2*dp[i][j][k]%mod);//2
if(k>1)fmod(dp[i+1][j][k-2]+=1ll*k*(k-1)/2*dp[i][j][k]%mod);//2
if(j>0&&k>0)fmod(dp[i+1][j-1][k]+=1ll*j*k*dp[i][j][k]%mod);//2
}
}
}
rep(i,0,m)rep(j,0,m)fmod(ans+=dp[n][i][j]);
printf("%d\n",ans);
return 0;
}```
P2580 于是他错误的点名开始了.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
// #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
int n,m;
map<string,int>mp;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;string str;
for(int i=1;i<=n;++i)cin>>str,mp[str]=1;
cin>>m;
for(int i=1;i<=m;++i) {
cin>>str;
int t=mp[str];
if(t==0)puts("WRONG");
else if(t==1)puts("OK"),++mp[str];
else puts("REPEAT");
}
return 0;
}```
P7244 章节划分.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int T=N<<2;
int n,k,a[N],MAX_A,dp[N],d[N],stk[N],top,pre[N],mxv[T];
#define lc (p<<1)
#define rc (p<<1|1)
void change(int pos,int k,int l=1,int r=n,int p=1){
ckmax(mxv[p],k);
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)change(pos,k,l,mid,lc);
else change(pos,k,mid+1,r,rc);
}
int query_max(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return mxv[p];
int mid=(l+r)>>1;
if(qr<=mid)return query_max(ql,qr,l,mid,lc);
if(mid<ql)return query_max(ql,qr,mid+1,r,rc);
return max(query_max(ql,qr,l,mid,lc),query_max(ql,qr,mid+1,r,rc));
}
bool check(int x){
memset(dp,-0x3f,(n+1)<<2),dp[0]=0,memset(mxv,-0x3f,sizeof(mxv));
for(int i=1;i<=n;++i){
if(pre[i]||a[i]%x==0)dp[i]=dp[pre[i]];
if(a[i]%x==0){
if(i==1)dp[i]=1;
else {
ckmax(dp[i],query_max(max(1,pre[i]),i-1)+1);
if(!pre[i])ckmax(dp[i],1);
}
}
change(i,dp[i]);
}
return dp[n]>=k;
}
signed main(){
n=read(),k=read();
rep(i,1,n)ckmax(MAX_A,a[i]=read());
for(int i=1;i<=n;++i){
while(top&&a[stk[top]]<=a[i])--top;
pre[i]=stk[top],stk[++top]=i;
}
for(int i=1;i*i<=MAX_A;++i){
if(MAX_A%i)continue;
d[++d[0]]=i;
if(i*i!=MAX_A)d[++d[0]]=MAX_A/i;
}
sort(d+1,d+d[0]+1,greater<int>());
for(int i=1;i<=d[0];++i)if(check(d[i]))return printf("%d\n",d[i]),0;
cout<<-1;
return 0;
}```
P4094 [HEOI2016 TJOI2016]字符串.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n, m;
char str[N];
namespace seg{
#define T ((N << 1) * 23)
int val[T], ls[T], rs[T], tot;
void update(int&p, int pos, int k, int l = 1, int r = n) {
if (!p) p = ++ tot;
if (l == r) return val[p] += k, void();
int mid = (l + r) >> 1;
if (pos <= mid) update(ls[p], pos, k, l, mid);
else update(rs[p], pos, k, mid + 1, r);
val[p] = val[ls[p]] + val[rs[p]];
}
int merge(int x, int y, int l = 1, int r = n) {
if (!x || !y) return x | y;
if (l == r) return val[x] += val[y], x;
int mid = (l + r) >> 1, p = ++ tot;
ls[p] = merge(ls[x], ls[y], l, mid);
rs[p] = merge(rs[x], rs[y], mid + 1, r);
return val[p] = val[ls[p]] + val[rs[p]], p;
}
int query(int p, int ql, int qr, int l = 1, int r = n) {
if (!p) return 0;
if (ql <= l && r <= qr) return val[p];
int mid = (l + r) >> 1;
if (ql <= mid && query(ls[p], ql, qr, l, mid)) return 1;
if (mid < qr && query(rs[p], ql, qr, mid + 1, r)) return 1;
return 0;
}
#undef T
}
namespace sam{
#define S (N<<1)
int q[S], t[S], rt[S];
int mxlen[S], tot = 1, trans[S][26], fa[20][S], to[N], link[S];
int extend(int c, int lst, int id) {
int p = lst, np = ++ tot; mxlen[np] = mxlen[p] + 1;
for (; p && !trans[p][c]; p = link[p]) trans[p][c] = np;
if (!p) link[np] = 1;
else{
int q = trans[p][c];
if (mxlen[p] + 1 == mxlen[q]) link[np] = q;
else {
int nq = ++ tot; mxlen[nq] = mxlen[p] + 1;
for (int i = 0; i < 26; ++ i) trans[nq][i] = trans[q][i];
link[nq] = link[q], link[q] = link[np] = nq;
for (; p && trans[p][c] == q; p = link[p]) trans[p][c] = nq;
}
}
return seg::update(rt[np], id, 1), np;
}
void insert(char*str, int n) {
for (int i = 1, lst = 1; i <= n; ++ i) to[i] = lst = extend(str[i] - 'a', lst, i);
// for (int i = 1; i <= tot; ++ i) cerr<<link[i] << ' ' << i << '\n';
// for (int i = 1; i <= tot; ++ i) cerr<<mxlen[i] << ' '; cerr << '\n';
}
void work() {
for (int i = 1; i <= tot; ++ i) ++ t[mxlen[i]];
for (int i = 1; i <= n; ++ i) t[i] += t[i - 1];
for (int i = 1; i <= tot; ++ i) q[t[mxlen[i]] --] = i;
for (int i = tot; i > 1; -- i) rt[link[q[i]]] = seg::merge(rt[link[q[i]]], rt[q[i]]), fa[0][i] = link[i];
for (int i = 1; 1 << i <= tot; ++ i)
for (int j = 1; j <= tot; ++ j)
fa[i][j] = fa[i - 1][fa[i - 1][j]];
}
int jump(int pos, int len){
int u = to[pos];
for(int i = 19; i >= 0; -- i) if(fa[i][u] && mxlen[fa[i][u]] >= len) u = fa[i][u];
// cerr<<"jumped" << to[pos] << ' ' << len << ' ' << u << '\n';
return u;
}
#undef S
}
signed main() {
scanf("%d%d%s", &n, &m, str + 1), reverse(str + 1, str + n + 1);
sam::insert(str, n), sam::work();
while(m--){
int b = n - read() + 1, a = n - read() + 1, d = n - read() + 1, c = n - read() + 1;
// cerr<<"ask"<<a<<' '<<b<<' '<<c<<' '<<d<<'\n';
int l = 1, r = min(d - c + 1, b - a + 1), res = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (seg::query(sam::rt[sam::jump(d, mid)], a + mid - 1, b)) res = mid, l = mid + 1;
else r = mid - 1;
}
printf("%d\n", res);
}
return 0;
}
/*
5 5
aaaaa
1 1 1 5
1 5 1 1
2 3 2 3
2 4 2 3
2 3 2 4
*/```
P4381 [IOI2008]Island.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 1000005
int n, H, T, id[N << 1], valp[N];
LL val[N << 1], sum[N << 1], Mxd, Mxlen, ans;
LL f[N], g[N], fa[N], dfn[N], tmr, loop[N], cnt, len[N];
bool onlp[N];
struct edge{
int nxt, to, val;
}e[N << 1];
int head[N], num_edge;
void addedge(int fr, int to, int val) {
++ num_edge;
e[num_edge].val = val;
e[num_edge].to = to;
e[num_edge].nxt = head[fr];
head[fr] = num_edge;
}
void dfs(int u, int ft){
dfn[u] = ++ tmr;
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == ft) continue;
if (dfn[v]) {
if (dfn[v] < dfn[u]) continue;
loop[++ cnt] = v, onlp[v] = 1, valp[cnt] = e[i].val;
while (v != u) loop[++ cnt] = fa[v], onlp[fa[v]] = 1, valp[cnt] = len[v], v = fa[v];
}
else fa[v] = u, len[v] = e[i].val, dfs(v, u);
}
}
void getd(int u, int ft) {
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == ft || onlp[v]) continue;
getd(v, u);
if (f[v] + e[i].val > f[u]) g[u] = f[u], f[u] = f[v] + e[i].val;
else if (f[v] + e[i].val > g[u]) g[u] = f[v] + e[i].val;
}
Mxd = max(Mxd, f[u] + g[u]);
}
void solve(int rt){
Mxd = Mxlen = 0;
cnt = 0, dfs(rt, 0);
for (int i = 1; i <= cnt; ++ i) getd(loop[i], 0), loop[i + cnt] = loop[i], valp[i + cnt] = valp[i];
for (int i = 1; i <= cnt << 1; ++ i) sum[i] = sum[i - 1] + valp[i];
H = 1, T = 0;
for (int i = 1; i <= cnt << 1; ++ i) {
while (H <= T && id[H] <= i - cnt) ++ H;
if (H <= T) Mxlen = max(Mxlen, val[H] + f[loop[i]] + sum[i]);
LL w = f[loop[i]] - sum[i];
while(H <= T && val[T] < w) -- T;
++T, val[T] = w, id[T] = i;
}
ans += max(Mxlen, Mxd);
}
signed main() {
n = read();
for (int i = 1; i <= n; ++ i) {
int x = i, y = read(), z = read();
addedge(x, y, z), addedge(y, x, z);
}
for (int i = 1; i <= n; ++ i) if (!dfn[i]) solve(i);
printf("%lld\n", ans);
return 0;
}```
P4717 【模板】快速沃尔什变换 (FWT).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=18;
int m,n;
const int mod=998244353;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
struct mint{
int x;
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
mint(LL v=0){x=v%mod,x<0?x+=mod:0;}
mint& operator += (const mint&t){fmod(x=x+t.x);return *this;}
mint& operator -= (const mint&t){fmod(x=x-t.x);return *this;}
mint& operator *= (const mint&t){x=1ll*x*t.x%mod;return *this;}
mint& operator /= (const mint&t){x=1ll*x*qpow(t.x,mod-2)%mod;return *this;}
friend mint operator + (const mint&a,const mint&b){return mint(a)+=b;}
friend mint operator - (const mint&a,const mint&b){return mint(a)-=b;}
friend mint operator * (const mint&a,const mint&b){return mint(a)*=b;}
friend mint operator / (const mint&a,const mint&b){return mint(a)/=b;}
mint operator -(){return !x?0:mod-x;}
mint operator == (const mint&t){return x==t.x;}
mint operator != (const mint&t){return x!=t.x;}
mint operator < (const mint&t){return x<t.x;}
mint operator > (const mint&t){return x>t.x;}
mint operator <= (const mint&t){return x<=t.x;}
mint operator >= (const mint&t){return x>=t.x;}
friend ostream& operator << (ostream&stream,const mint&v){return stream<<v.x;}
friend istream& operator >> (istream&stream,mint&v){return stream>>v.x;}
explicit operator int() const{return x;}
}a[1<<N],b[1<<N],A[1<<N],B[1<<N];
void OR(mint*a,mint op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j)
a[i+j+k]+=a[i+j]*op;
}
void AND(mint*a,mint op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j)
a[i+j]+=a[i+j+k]*op;
}
void XOR(mint*a,mint op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j){
int x=int(a[i+j]),y=int(a[i+j+k]);
a[i+j]=(x+y)*op,a[i+j+k]=(x-y)*op;
}
}
signed main(){
n=1<<(m=read());
for(int i=0;i<n;++i)A[i]=read();
for(int i=0;i<n;++i)B[i]=read();
for(int i=0;i<n;++i)a[i]=A[i];
for(int i=0;i<n;++i)b[i]=B[i];
OR(a,1),OR(b,1);
for(int i=0;i<n;++i)a[i]*=b[i];
OR(a,-1);
for(int i=0;i<n;++i)printf("%d ",int(a[i]));puts("");
for(int i=0;i<n;++i)a[i]=A[i];
for(int i=0;i<n;++i)b[i]=B[i];
AND(a,1),AND(b,1);
for(int i=0;i<n;++i)a[i]*=b[i];
AND(a,-1);
for(int i=0;i<n;++i)printf("%d ",int(a[i]));puts("");
for(int i=0;i<n;++i)a[i]=A[i];
for(int i=0;i<n;++i)b[i]=B[i];
XOR(a,1),XOR(b,1);
for(int i=0;i<n;++i)a[i]*=b[i];
XOR(a,mint((mod+1)>>1));
for(int i=0;i<n;++i)printf("%d ",int(a[i]));puts("");
return 0;
}```
CF923E Perpetual Subtraction.cpp
```// Problem: CF923E Perpetual Subtraction
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/CF923E
// Memory Limit: 250 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=N<<2;
#define mod 998244353
namespace math{
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int fac[N],ifc[N],inv[N];
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using math::qpow;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:math::inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*a[i+j+k]*w0%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X+mod-Y)%mod;
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
}
int n,p[N],A[M],B[M],g[M],f[M];
LL m;
signed main(){
math::initmath();scanf("%d%lld",&n,&m);
for(int i=0;i<=n;++i)p[i]=read();
for(int i=0;i<=n;++i)A[i]=1ll*math::fac[i]*p[i]%mod;
for(int i=0;i<=n;++i)B[i]=math::ifc[n-i];
poly::poly_mul(A,B,A,n+1,n+1);
for(int i=0;i<=n;++i)g[i]=1ll*A[n+i]*math::ifc[i]%mod;
m%=mod-1;
for(int i=0;i<=n;++i)g[i]=1ll*g[i]*qpow(math::inv[i+1],m)%mod;
for(int i=0;i<=n;++i)A[i]=1ll*math::fac[i]*g[i]%mod*(i&1?mod-1:1)%mod;
for(int i=0;i<=n;++i)B[i]=math::ifc[n-i];
poly::poly_mul(A,B,A,n+1,n+1);
for(int i=0;i<=n;++i)f[i]=1ll*A[n+i]*(i&1?mod-math::ifc[i]:math::ifc[i])%mod;
for(int i=0;i<=n;++i)printf("%d ",f[i]);
return 0;
}```
P4827 [国家集训队] Crash 的文明世界.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=50005;
const int K=152;
#define mod 10007
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,k,f[N][K],g[N][K],S[K][K];
int hed[N],et;
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
f[u][0]=1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u);
rep(j,0,k){
if(j>0)fmod(f[u][j]+=f[v][j-1]);
fmod(f[u][j]+=f[v][j]);
}
}
}
void dfs2(int u,int ft){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
rep(j,0,k){
g[v][j]=f[v][j];
g[v][j]=(g[v][j]+g[u][j]-f[v][j])%mod;
if(j>0){
g[v][j]=(g[v][j]+mod-f[v][j-1])%mod;
g[v][j]=(g[v][j]+g[u][j-1]-f[v][j-1]+mod)%mod;
if(j>1)g[v][j]=(g[v][j]+mod-f[v][j-2])%mod;
}
}
dfs2(v,u);
}
}
signed main(){
n=read(),k=read();
rep(i,2,n){int x=read(),y=read();adde(x,y),adde(y,x);}
S[1][1]=1;
rep(i,2,k)rep(j,1,k)S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%mod;
dfs1(1,0);
rep(i,0,k)g[1][i]=f[1][i];
dfs2(1,0);
for(int i=1;i<=n;++i){
int res=0;
for(int j=0,fac=1;j<=k;++j,fac=1ll*fac*j%mod)fmod(res+=1ll*S[k][j]*fac%mod*g[i][j]%mod);
printf("%d\n",res);
}
return 0;
}```
CF1200E Compress Words.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=2010010;
int n,m,p[N],len,Len;
char s[N],t[N],ans[N];
signed main() {
n=rd();
for(rint T=1;T<=n;++T) {
scanf("%s",t+1),len=strlen(t+1);t[++len]='|';
int top=0;
for(rint i=1;i<=len;++i)s[++top]=t[i];
int tmp=min(len,Len);
for(rint i=Len-tmp+1;i<=Len;++i)s[++top]=ans[i];
//for(rint i=1;i<=top;++i)cout<<s[i];cout<<endl;
for(rint i=2,j=0;i<=top;++i) {
while(j&&s[j+1]!=s[i])j=p[j];
if(s[j+1]==s[i])++j;p[i]=j;
}
for(rint i=p[top]+1;i<len;++i)ans[++Len]=t[i];
}
for(rint i=1;i<=Len;++i)putchar(ans[i]);
return 0;
}```
P4854 MloVtry的咸鱼树.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=15;
const int M=N*(N+10);
const int inf=0x3f3f3f3f;
int n,m,dp[1<<N],U[M],V[M],S[M],L[M];
signed main(){
n=read(),m=read();
memset(dp,0x3f,sizeof(dp));
for(int i=0;i<n;++i)dp[1<<i]=0;
for(int i=0;i<m;++i)U[i]=read()-1,V[i]=read()-1,S[i]=read(),L[i]=read();
for(int msk=0;msk<1<<n;++msk){
for(int j=0;j<m;++j){
if((S[j]|msk)==msk&&(msk>>U[j]&1||msk>>V[j]&1))dp[msk|(1<<U[j])|(1<<V[j])]=min(dp[msk|(1<<U[j])|(1<<V[j])],dp[msk]+L[j]);
}
}
printf("%d\n",dp[(1<<n)-1]==inf?-1:dp[(1<<n)-1]);
return 0;
}```
P4438 [HNOI AHOI2018]道路.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=20010;
int g[N][2];
int n,a[N],b[N],c[N];
int dep[N];
LL dp[N<<1][41][41];
void dfs(int u,int dep) {
if(u>n) {
for(int i=0;i<=dep;++i)
for(int j=0;j<=dep-i;++j)
dp[u][i][j]=1ll*c[u-n]*(a[u-n]+i)*(b[u-n]+j);
return;
}
for(int i=0;i<2;++i)dfs(g[u][i],dep+1);
for(int i=0;i<=dep;++i)
for(int j=0;j<=dep-i;++j)
dp[u][i][j]=min(dp[g[u][0]][i+1][j]+dp[g[u][1]][i][j],dp[g[u][0]][i][j]+dp[g[u][1]][i][j+1]);
}
signed main() {
n=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
if(x>0)g[i][0]=x;
else g[i][0]=n-x;
if(y>0)g[i][1]=y;
else g[i][1]=n-y;
}
for(int i=1;i<=n;++i)a[i]=rd(),b[i]=rd(),c[i]=rd();
dfs(1,0);
printf("%lld\n",dp[1][0][0]);
return 0;
}```
P5104 红包发红包.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=1e9+7;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
int w,n,k;
signed main(){
std::cin>>w>>n>>k;
printf("%lld\n",1ll*w*qpow(qpow(2,k),mod-2)%mod);
return 0;
}```
P4101 [HEOI2014]人人尽说江南好.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,m;
void Main() {
n=rd(),m=rd();
puts((n-((n-1)/m+1))&1?"0":"1");
}
signed main() {
for(int T=rd();T;--T)Main();
}```
CF1013B And.cpp
```#include<bits/stdc++.h>
using namespace std;
int n,x,a[100005],b[100005],ans=3;
unordered_map<int,int>mp;
int main()
{
scanf("%d%d",&n,&x);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),b[i]=a[i]&x;
for(int i=1;i<=n;++i)
if(!mp[a[i]])mp[a[i]]=1;
else{printf("0\n");return 0;}
for(int i=1;i<=n;++i)
if(mp[b[i]]&&a[i]^b[i])ans=min(ans,mp[b[i]]);
else if(!mp[b[i]])mp[b[i]]=2;
if(ans!=3)printf("%d\n",ans);
else printf("-1\n");
return 0;
}```
P3958 奶酪.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
typedef long long LL;
#define N 1009
int n,h,r,F[N],x[N],y[N],z[N];
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
LL dis(int i,int j){return 1ll*(x[i]-x[j])*(x[i]-x[j])+1ll*(y[i]-y[j])*(y[i]-y[j])+1ll*(z[i]-z[j])*(z[i]-z[j]);}
void Main() {
n=rd(),h=rd(),r=rd();
for(int i=1;i<=n+2;++i)F[i]=i;
for(int i=1;i<=n;++i) {
x[i]=rd(),y[i]=rd(),z[i]=rd();
if(z[i]<=r)F[find(i)]=find(n+1);
if(h<=z[i]+r)F[find(i)]=find(n+2);
}
for(int i=1;i<=n;++i)
for(int j=1;j<i;++j)
if(dis(i,j)<=4ll*r*r)F[find(i)]=find(j);
puts(find(n+1)==find(n+2)?"Yes":"No");
}
signed main() {
for(int T=rd();T;--T)Main();
}```
P1602 Sramoc问题.cpp
```#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1; char c = getchar();
while (!isdigit(c)) { if (c == '-') f = 0; c = getchar();}
while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
return f ? x : -x;
}
#define N 1000005
#define M 5000005
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
bool vis[N];
int k,m;
int trie[M][10],fa[M],tot;
void print(int u){
static int d[M];
d[0]=0;
while(u){
for(int i=0;i<k;++i)if(trie[fa[u]][i]==u){d[++d[0]]=i;break;}
u=fa[u];
}
for(int i=d[0];i>=1;--i)printf("%d",d[i]);
puts("");
}
void bfs(){
queue<pair<int,int> >q;
for(int i=1;i<k;++i){
int c=i%m;
if(vis[c])continue;
vis[c]=1,trie[0][i]=++tot,fa[tot]=0;
if(!c)return print(tot),void();
q.push(mkp(c,tot));
}
while(!q.empty()){
pair<int,int>u=q.front();q.pop();
for(int i=0;i<k;++i){
int c=(u.fi*10+i)%m;
if(vis[c])continue;
vis[c]=1,trie[u.se][i]=++tot,fa[tot]=u.se;
if(!c)return print(tot),void();
q.push(mkp(c,tot));
}
}
}
signed main(){
scanf("%d%d",&k,&m);
bfs();
}```
CF1292B Aroma's Search.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int inf=1e16+20;
int ax,ay,bx,by,t,sx,sy;
int x[70],y[70],cnt,ans;
int dis(int xx,int yy,int xxx,int yyy) {
return abs(xx-xxx)+abs(yy-yyy);
}
int f(int i,int j) {
if(i>j)return 0;
int res=0;
for(rint k=i+1;k<=j;++k)res+=dis(x[k-1],y[k-1],x[k],y[k]);
return res;
}
signed main() {
scanf("%lld%lld%lld%lld%lld%lld%lld%lld%lld",&x[1],&y[1],&ax,&ay,&bx,&by,&sx,&sy,&t);cnt=1;
while(1) {
++cnt,x[cnt]=ax*x[cnt-1]+bx,y[cnt]=ay*y[cnt-1]+by;
if(x[cnt]>inf||y[cnt]>inf) {break;}
}
for(rint i=1;i<=cnt;++i) {
int tmp=0,j,sum=0;
tmp+=dis(x[i],y[i],sx,sy);
if(tmp>t)continue;
for(j=1;j<=i;++j)if(f(j,i)+tmp<=t)break;
tmp+=f(j,i);
sum=i-j+1;
ans=max(sum,ans);
// cout<<i<<' '<<j<<' ';
if(j==1) {
tmp+=f(1,i);
if(tmp>t)continue;
for(j=i+1;j<=cnt;++j)if(tmp+f(i,j)>t)break;
--j;
sum+=j-i;
ans=max(ans,sum);
}
// cout<<j<<endl;
// printf("%lld\n",ans);
}
printf("%lld\n",ans);
return 0;
}```
P5047 [Ynoi2019模拟赛]Yuno loves sqrt technology II.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int S=320;
const int B=N/S+5;
int n,m,num,a[N],pre[N],suf[N],L[B],R[B],bel[N];
LL sp[N],ss[N],res[N<<1];
LL ans[N];
int lsh[N],len;
int tr[N];
int tol,tor;
struct QUE{
int l,r,id;
inline bool operator< (const QUE&t)const{return bel[l]!=bel[t.l]?l<t.l:bel[l]&1?r<t.r:r>t.r;}
}q[N];
struct ASK{
int pos,l,r,id;
inline bool operator < (const ASK&t)const{return pos<t.pos;}
}ql[N],qr[N];
namespace BLOCK1{
int sum[N],tag[B];
void update(int x,int d){
for(int i=1;i<bel[x];++i)tag[i]+=d;
for(int i=L[bel[x]];i<=x;++i)sum[i]+=d;
}
int query(int x){
return sum[x]+tag[bel[x]];
}
}
namespace BLOCK2{
int sum[N],tag[B];
void update(int x,int d){
for(int i=num;i>bel[x];--i)tag[i]+=d;
for(int i=x;i<=R[bel[x]];++i)sum[i]+=d;
}
int query(int x){
return sum[x]+tag[bel[x]];
}
}
signed main(){
n=read(),m=read(),num=(n-1)/S+1;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=n;
rep(i,1,num)rep(j,L[i],R[i])bel[j]=i;
rep(i,1,n)a[i]=lsh[i]=read();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
rep(i,1,n)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
rep(i,1,n){
int res=0;
for(int j=a[i]+1;j<=n;j+=j&-j)res+=tr[j];
pre[i]=res;
for(int j=a[i];j>0;j-=j&-j)++tr[j];
}
fill(tr,tr+n+1,0);
per(i,n,1){
int res=0;
for(int j=a[i]-1;j>0;j-=j&-j)res+=tr[j];
suf[i]=res;
for(int j=a[i];j<=n;j+=j&-j)++tr[j];
}
rep(i,1,m)q[i].id=i,q[i].l=read(),q[i].r=read();
sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i){
if(l>q[i].l)ql[++tol].pos=r+1,ql[tol].l=q[i].l,ql[tol].r=l-1,ql[tol].id=q[i].id<<1,l=q[i].l;
if(r<q[i].r)qr[++tor].pos=l-1,qr[tor].l=r+1,qr[tor].r=q[i].r,qr[tor].id=q[i].id<<1|1,r=q[i].r;
if(l<q[i].l)ql[++tol].pos=r+1,ql[tol].l=l,ql[tol].r=q[i].l-1,ql[tol].id=q[i].id<<1,l=q[i].l;
if(r>q[i].r)qr[++tor].pos=l-1,qr[tor].l=q[i].r+1,qr[tor].r=r,qr[tor].id=q[i].id<<1|1,r=q[i].r;
}
sort(ql+1,ql+tol+1),sort(qr+1,qr+tor+1);
for(int i=1,j=1;i<=n;++i){
while(j<=tor&&qr[j].pos<i)++j;
BLOCK1::update(a[i],1),sp[i]=sp[i-1]+pre[i];
for(;j<=tor&&qr[j].pos==i;++j){
for(int k=qr[j].l;k<=qr[j].r;++k)
res[qr[j].id]+=BLOCK1::query(a[k]+1);
}
}
for(int i=n,j=tol;i>=1;--i){
while(j>=1&&ql[j].pos>i)--j;
BLOCK2::update(a[i],1),ss[i]=ss[i+1]+suf[i];
for(;j>=1&&ql[j].pos==i;--j){
for(int k=ql[j].l;k<=ql[j].r;++k)
res[ql[j].id]+=BLOCK2::query(a[k]-1);
}
}
LL now=0;
for(int i=1,l=1,r=0;i<=m;++i){
if(l>q[i].l)now+=ss[q[i].l]-ss[l]-res[q[i].id<<1],l=q[i].l;
if(r<q[i].r)now+=sp[q[i].r]-sp[r]-res[q[i].id<<1|1],r=q[i].r;
if(l<q[i].l)now-=ss[l]-ss[q[i].l]-res[q[i].id<<1],l=q[i].l;
if(r>q[i].r)now-=sp[r]-sp[q[i].r]-res[q[i].id<<1|1],r=q[i].r;
ans[q[i].id]=now;
}
rep(i,1,m)printf("%lld\n",ans[i]);
return 0;
}```
CF755G PolandBall and Many Other Balls.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1<<15;
const int M=N<<2;
int n,k,f[3][M];
namespace poly{
#define mod 998244353
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
int g=op?3:qpow(3,mod-2);
for(int i=1;i<lim;i<<=1){
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*ilim*a[i]%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void mul(const int&n){
static int A[M],B[M],C[M],D[M],E[M];
NTT(f[0],1),NTT(f[1],1),NTT(f[2],1);
for(int i=0;i<lim;++i)
A[i]=1ll*f[0][i]*f[0][i]%mod,
B[i]=1ll*f[1][i]*f[1][i]%mod,
C[i]=1ll*f[0][i]*f[1][i]%mod,
D[i]=1ll*f[2][i]*f[1][i]%mod,
E[i]=1ll*f[2][i]*f[2][i]%mod;
NTT(A,0),NTT(B,0),NTT(C,0),NTT(D,0),NTT(E,0);
clr(f[0],lim),clr(f[1],lim),clr(f[2],lim);
for(int i=0;i<=n;++i)
fmod(f[0][i]=A[i]+(i?B[i-1]:0)),
fmod(f[1][i]=C[i]+(i?D[i-1]:0)),
fmod(f[2][i]=B[i]+(i?E[i-1]:0));
}
void add(const int&n){
cpy(f[2],f[1],n+1),cpy(f[1],f[0],n+1),f[0][0]=1;
for(int i=1;i<=n;++i)f[0][i]=((f[1][i]+f[1][i-1])%mod+f[2][i-1])%mod;
}
}
signed main(){
n=read(),k=read();
f[1][0]=1;
f[0][0]=f[0][1]=1;
poly::init_poly(k<<1);
for(int i=log2(n)-1;i>=0;--i){
poly::mul(k);
if(n>>i&1)poly::add(k);
}
for(int i=1;i<=k;++i)printf("%d ",f[0][i]);puts("");
return 0;
}```
CF1419D2 Sage's Birthday (hard version).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n, a[N];
vector<int>t;
bool check(int m) {
int i = 1, j = n - m, res = 0;
for (int k = 1; k <= n; ++ k) t[k] = 0;
for (int k = 1; k <= m; ++ k) t[2 * k] = a[i ++];
// for (int k = 1; k <= n; ++ k) printf("%d ", t[k]);puts("");
for (int k = 1; k <= m + 1; ++ k) t[2 * k - 1] = a[j ++];
// for (int k = 1; k <= n; ++ k) printf("%d ", t[k]);puts("");
for (int k = 2 * m + 2; k <= n; ++ k) t[k] = a[i ++];
// for (int k = 1; k <= n; ++ k) printf("%d ", t[k]);puts("");
for (int k = 2; k < n; ++ k)res += t[k] < t[k - 1] && t[k] < t[k + 1];
return res >= m;
}
signed main() {
n = read(), t.resize(n+1);
for (int i = 1; i <= n; ++ i) a[i] = read();
sort(a + 1, a + n + 1);
int l = 0, r = (n - 1) >> 1, res = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if(check(mid))l = mid + 1, res = mid;
else r = mid - 1;
}
printf("%d\n", res), check(res);
for (int i = 1; i <= n; ++i) printf("%d ", t[i]);
return 0;
}
```
P4931 [MtOI2018]情侣？给我烧了！（加强版）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
#define N 5000005
int T,n,k;
int pw2[N],fac[N],ifc[N],f[N];
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void init(){
int up=N-5;
pw2[0]=fac[0]=1;
for(int i=1;i<=up;++i)fac[i]=1ll*fac[i-1]*i%mod,pw2[i]=(pw2[i-1]<<1)%mod;
ifc[up]=qpow(fac[up],mod-2);
for(int i=up-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
f[0]=1,f[1]=0;
for(int i=2;i<=up;++i)f[i]=4ll*i*(i-1)%mod*(2ll*(i-1)*f[i-2]%mod+f[i-1])%mod;
}
int A(int n,int m){return 1ll*fac[n]*ifc[n-m]%mod;}
int C(int n,int m){return 1ll*fac[n]*ifc[n-m]%mod*ifc[m]%mod;}
signed main(){
init();
for(int T=read();T;--T)
n=read(),k=read(),printf("%lld\n",1ll*A(n,k)*C(n,k)%mod*pw2[k]%mod*f[n-k]%mod);
}
```
CF1280C Jeremy Bearimy.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
struct edge {
int to,nxt,val;
}e[N<<1];
int head[N],num_edge,n,T,ans1,ans2,siz[N];
void addedge(int from,int to,int val) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
head[from]=num_edge;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs1(v,u);
siz[u]+=siz[v];
if(siz[v]&1)ans1+=e[i].val;
}
}
void dfs2(int u,int ft) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs2(v,u);
ans2+=e[i].val*min(siz[v],n-siz[v]);
}
}
signed main() {
T=rd();
while(T--) {
n=rd(),n<<=1;ans1=0,ans2=0;
memset(head,0,sizeof(head));
num_edge=0;
for(rint i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
dfs1(1,0),dfs2(1,0);
printf("%lld %lld\n",ans1,ans2);
}
return 0;
}```
P4849 寻找宝藏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
void fmod(int&x){x-=mod,x+=x>>31&mod;}
const int N=80005;
int n_,n,len,lsh[N],ans2,cnt[N];
LL ans1,val[N];
struct node{
int a,b,c,d,op,g;
LL w,f;
node(){a=b=c=d=w=f=g=op=0;}
inline bool operator == (const node&t)const{return a==t.a&&b==t.b&&c==t.c&&d==t.d;}
}a[N],b[N];
inline bool cmp1(const node&a,const node&b){return a.a!=b.a?a.a<b.a:a.b!=b.b?a.b<b.b:a.c!=b.c?a.c<b.c:a.d<b.d;}
inline bool cmp2(const node&a,const node&b){return a.b!=b.b?a.b<b.b:a.a!=b.a?a.a<b.a:a.c!=b.c?a.c<b.c:a.d<b.d;}
inline bool cmp3(const node&a,const node&b){return a.c<b.c;}
void add(int x,LL f,int g){
for(int i=x;i<=n;i+=i&-i)
if(ckmax(val[i],f))cnt[i]=g;
else if(val[i]==f)fmod(cnt[i]+=g);
}
pair<LL,int>ask(int x){
pair<LL,int>res=mkp(0,0);
for(int i=x;i>0;i-=i&-i)
if(ckmax(res.fi,val[i]))res.se=cnt[i];
else if(res.fi==val[i])fmod(res.se+=cnt[i]);
return res;
}
void clr(int x){for(int i=x;i<=n;i+=i&-i)val[i]=cnt[i]=0;}
void cdq2(int l,int r){
if(l==r)return;
int mid=(l+r)>>1,i,j;
cdq2(l,mid),sort(a+l,a+mid+1,cmp3),sort(a+mid+1,a+r+1,cmp3);
for(i=mid+1,j=l;i<=r;++i){
for(;a[j].c<=a[i].c&&j<=mid;++j)if(a[j].op)add(a[j].d,a[j].f,a[j].g);
if(!a[i].op){
pair<LL,int>tmp=ask(a[i].d);tmp.fi+=a[i].w;
if(!tmp.se)continue;
if(ckmax(a[i].f,tmp.fi))a[i].g=tmp.se;
else if(a[i].f==tmp.fi)fmod(a[i].g+=tmp.se);
}
}
for(--j;j>=l;--j)clr(a[j].d);
sort(a+mid+1,a+r+1,cmp2);
cdq2(mid+1,r);
}
void cdq1(int l,int r){
if(l==r)return;
int mid=(l+r)>>1;
cdq1(l,mid);
for(int i=l;i<=r;++i)a[i].op=i<=mid;
sort(a+l,a+r+1,cmp2);
cdq2(l,r);
sort(a+l,a+r+1,cmp1);
cdq1(mid+1,r);
}
signed main(){
n_=read(),read();
for(int i=1;i<=n_;++i)b[i].a=read(),b[i].b=read(),b[i].c=read(),b[i].d=lsh[++len]=read(),b[i].w=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
for(int i=1;i<=n_;++i)b[i].d=lower_bound(lsh+1,lsh+len+1,b[i].d)-lsh;
sort(b+1,b+n_+1,cmp1);
for(int i=1,j=i;i<=n_;i=++j){
a[++n]=b[i],a[n].g=1;
while(j<n_&&b[j+1]==b[i])a[n].w+=b[++j].w;
a[n].f=a[n].w;
}
cdq1(1,n);
for(int i=1;i<=n;++i)
if(ckmax(ans1,a[i].f))ans2=a[i].g;
else if(ans1==a[i].f)fmod(ans2+=a[i].g);
printf("%lld\n%d\n",ans1,ans2);
return 0;
}```
P2233 [HNOI2002]公交车路线.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000
struct Matrix{
int a[8][8];
Matrix(){ memset(a, 0, sizeof(a)); }
inline void e(){ rep(i, 0, 7) rep(j, 0, 7) a[i][j] = i == j; }
int* operator[](const int &k){ return a[k]; }
inline Matrix operator * (const Matrix&t) const {
Matrix res;
rep(i,0,7)rep(j,0,7)rep(k,0,7)(res.a[i][j] += a[i][k] * t.a[k][j]) %= mod;
return res;
}
friend Matrix Matrix_qpow(Matrix a, int k) {
Matrix res; res.e();
for(;k;k>>=1,a=a*a)
if(k&1)res=res*a;
return res;
}
} A, B;
signed main(){
int n = read();
A[0][0] = 1;
B[1][0] = B[7][0] = 1;
B[0][1] = B[2][1] = 1;
B[1][2] = B[3][2] = 1;
B[2][3] = 1;
B[3][4] = B[5][4] = 1;
B[6][5] = 1;
B[5][6] = B[7][6] = 1;
B[0][7] = B[6][7] = 1;
B = Matrix_qpow(B, n);
A = A * B;
printf("%d\n", A[0][4]);
return 0;
}```
CF321D Ciel and Flipboard.cpp
```#include<bits/stdc++.h>
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=35;
int n,m,v[N][N],r[N][N],ans=-114514;
#define get(x,y) (r[x][y]?-v[x][y]:v[x][y])
int h(int x,int y,int d){
r[x][y]=d;
r[x+m][y]=r[m][y]^d;
r[x][y+m]=r[x][m]^d;
r[x+m][y+m]=r[m][y+m]^r[x][y+m];
return get(x,y)+get(x+m,y)+get(x,y+m)+get(x+m,y+m);
}
int g(int y,int d){
int res=0;
r[m][y]=d;
r[m][y+m]=r[m][m]^d;
res+=get(m,y)+get(m,y+m);
for(int i=1;i<m;++i)res+=std::max(h(i,y,0),h(i,y,1));
return res;
}
int f(int msk){
for(int i=0;i<m;++i)r[i+1][m]=msk>>i&1;
for(int i=1;i<m;++i)r[i+m][m]=r[m][m]^r[i][m];
int res=0;
for(int i=1;i<=n;++i)res+=get(i,m);
for(int i=1;i<m;++i)res+=std::max(g(i,0),g(i,1));
return res;
}
signed main(){
n=read(),m=(n+1)/2;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
v[i][j]=read();
for(int msk=0;msk<1<<m;++msk)ans=std::max(ans,f(msk));
printf("%d\n",ans);
}```
CF1097D Makoto and a Blackboard.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int mod=1e9+7;
LL n;int k,ans,dp[70],inv[70];
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void solve(int cnt,int zaky){
memset(dp,0,sizeof(dp));
dp[cnt]=1;
for(int i=1;i<=k;++i){
for(int j=0;j<=cnt;++j){
dp[j]=1ll*dp[j]*inv[j+1]%mod;
for(int l=j+1;l<=cnt;++l)fmod(dp[j]+=1ll*inv[l+1]*dp[l]%mod);
}
}
int res=0;
for(int i=0,j=1;i<=cnt;++i)fmod(res+=1ll*dp[i]*j%mod),j=1ll*j*zaky%mod;
ans=1ll*ans*res%mod;
}
signed main(){
std::cin>>n>>k,ans=1,inv[1]=1;
for(int i=2;i<=69;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
for(LL i=2;i*i<=n;++i){
if(n%i==0){
int cnt=0;
while(n%i==0)n/=i,++cnt;
solve(cnt,i%mod);
}
}
if(n>1)solve(1,n%mod);
std::cout<<ans<<'\n';
}```
CF1288F Red-Blue Graph.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=410;
const int M=3000;
const int inf=1<<28;
int head[N],num_edge=1;
int n1,n2,m,r,b;
int s,t,S,T,SS,TT,Begin,Final;
int maxflow,sumflow,cost,ans;
int dta[N],inq[N],dst[N],cur[N];
bool vis[N];
char str[N];
struct edge {
int nxt,to,val,w;
}e[M];
void addedge(int from,int to,int val,int w) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
e[num_edge].w=w;
head[from]=num_edge;
}
void addedge(int from,int to,int l,int r,int w) {
addedge(from,to,r-l,w),addedge(to,from,0,-w);
dta[from]-=l,dta[to]+=l;
}
bool spfa() {
for(rint i=1;i<=TT;++i)cur[i]=head[i],inq[i]=0,dst[i]=inf;
queue<int>q;q.push(s);dst[s]=0;
while(!q.empty()) {
int u=q.front();inq[u]=0,q.pop();
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(e[i].val&&dst[v]>dst[u]+e[i].w) {
dst[v]=dst[u]+e[i].w;
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return dst[t]!=inf;
}
int dfs(int u,int flow) {
vis[u]=1;
if(u==t){maxflow+=flow;return flow;}
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
int v=e[i].to;cur[u]=i;
if(dst[v]==dst[u]+e[i].w&&e[i].val&&(v==t||!vis[v])) {
rlow=dfs(v,min(e[i].val,flow-used));
if(rlow) {
e[i].val-=rlow;
e[i^1].val+=rlow;
cost+=rlow*e[i].w;
used+=rlow;
if(used==flow)break;
}
}
}
return used;
}
void MCMF() {
while(spfa()) {
vis[t]=1;
while(vis[t]){memset(vis,0,sizeof(vis)),dfs(s,inf);}
}
}
signed main() {
n1=rd(),n2=rd(),m=rd(),r=rd(),b=rd();
S=n1+n2+1,T=S+1,SS=T+1,TT=SS+1;
scanf("%s",str+1);
for(rint i=1;i<=n1;++i) {
if(str[i]=='R')addedge(S,i,1,inf,0);
else if(str[i]=='B')addedge(i,T,1,inf,0);
else addedge(S,i,0,inf,0),addedge(i,T,0,inf,0);
}
scanf("%s",str+1);
for(rint i=1;i<=n2;++i) {
if(str[i]=='B')addedge(S,i+n1,1,inf,0);
else if(str[i]=='R')addedge(i+n1,T,1,inf,0);
else addedge(S,i+n1,0,inf,0),addedge(i+n1,T,0,inf,0);
}
Begin=num_edge+1;
for(rint i=1;i<=m;++i) {
int x=rd(),y=rd();
addedge(x,y+n1,0,1,r),addedge(y+n1,x,0,1,b);
}
Final=num_edge;
addedge(T,S,0,inf,0);
for(rint i=1;i<=T;++i)
if(dta[i]>0)addedge(SS,i,0,dta[i],0),sumflow+=dta[i];
else addedge(i,TT,0,-dta[i],0);
s=SS,t=TT,MCMF();
if(maxflow!=sumflow)return puts("-1"),0;
printf("%d\n",cost);
for(rint i=Begin;i<=Final;i+=4) {
if(!e[i].val)putchar('R');
else if(!e[i+2].val)putchar('B');
else putchar('U');
}
return 0;
}
```
RMQLCA.cpp
```const int N=500010;
struct edge{int nxt,v;}e[N<<1];
int n,m,S;
int mi[20][N<<1],id[20][N<<1],lg[N<<1],dfn[N],pw2[30],timer;
int hed[N],et;
void adde(int u,int v){++et,e[et].nxt=hed[u],e[et].v=v,hed[u]=et;}
void dfs(int u,int dep){
dfn[u]=++timer,mi[0][timer]=dep,id[0][timer]=u;
for(int i=hed[u];i;i=e[i].nxt){
int v=e[i].v;
if(dfn[v])continue;
dfs(v,dep+1),++timer,mi[0][timer]=dep,id[0][timer]=u;
}
}
void init_ST(){
lg[0]=-1,pw2[0]=1;
for(int i=1;i<=(n<<1);++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=21;++i)pw2[i]=pw2[i-1]<<1;
for(int i=1;i<=lg[n<<1];++i)
for(int j=1;j<=(n<<1)-pw2[i]+1;++j){
int t=j+pw2[i-1];
if(mi[i-1][j]<mi[i-1][t])mi[i][j]=mi[i-1][j],id[i][j]=id[i-1][j];
else mi[i][j]=mi[i-1][t],id[i][j]=id[i-1][t];
}
}
int ask(int x,int y){
int l=dfn[x],r=dfn[y];
if(l>r)l^=r^=l^=r;
int k=lg[r-l+1],t=r-pw2[k]+1;
if(mi[k][l]<mi[k][t])return id[k][l];
else return id[k][t];
}```
AT3957 [AGC023F] 01 on Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,F[N],p[N],v[N],c[N][2];
LL ans;
struct node{
int c[2],id;
node(){c[0]=c[1]=id=0;}
node(int c0,int c1,int id_){c[0]=c0,c[1]=c1,id=id_;}
inline bool operator < (const node&t)const{
if(1ll*c[0]*t.c[1]==1ll*c[1]*t.c[0])return id<t.id;
return 1ll*c[0]*t.c[1]>1ll*c[1]*t.c[0];
}
inline bool operator == (const node&t)const{
return c[0]==t.c[0]&&c[1]==t.c[1]&&id==t.id;
}
};
set<node>s;
inline int anc(int x){return x==F[x]?x:F[x]=anc(F[x]);}
bool vis[N];
signed main(){
n=read();
rep(i,2,n)p[i]=read();
rep(i,1,n)v[i]=read(),c[i][v[i]]=1,F[i]=i;
rep(i,2,n)s.insert(node(c[i][0],c[i][1],i));
rep(t,2,n){
node now=*s.begin();s.erase(s.begin());
int x=now.id,f=anc(p[x]);
assert(!vis[x]),vis[x]=1;
if(f!=1)s.erase(s.find(node(c[f][0],c[f][1],f)));
ans+=1ll*c[f][1]*now.c[0];
c[f][0]+=now.c[0],c[f][1]+=now.c[1];
if(f!=1)s.insert(node(c[f][0],c[f][1],f));
F[x]=f;
}
cout<<ans<<'\n';
}
/*
23255672
*/```
P4127 [AHOI2009]同类分布.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int long long
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
LL a,b,dp[20][20*9][20*9];
int tot,num[20],mod;
LL dfs(int pos,int limit,int sum,int rem) {
if(sum>mod||sum+9*pos<mod)return 0;
if(!pos)return sum==mod&&!rem;
if(!limit&&~dp[pos][sum][rem])return dp[pos][sum][rem];
int up=limit?num[pos]:9;LL res=0;
for(int i=0;i<=up;++i)
res+=dfs(pos-1,limit&&i==up,sum+i,(rem*10+i)%mod);
if(!limit)dp[pos][sum][rem]=res;
return res;
}
LL solve(LL x) {
tot=0;
LL res=0;
while(x)num[++tot]=x%10,x/=10;
for(mod=1;mod<=9*tot;++mod) {
memset(dp,-1,sizeof(dp));
res+=dfs(tot,1,0,0);
}
return res;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
memset(dp,-1,sizeof(dp));
cin>>a>>b;
cout<<(solve(b)-solve(a-1))<<'\n';
return 0;
}```
CF1336A Linova and Kingdom.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define pb push_back
const int N=2e5+10;
int n,k;
LL ans;
struct node {
int siz,dep;
}a[N];
vector<int>g[N];
void dfs(int u,int ft) {
a[u].siz=1;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
a[v].dep=a[u].dep+1;
dfs(v,u);
a[u].siz+=a[v].siz;
}
}
bool cmp(const node &a,const node &b) {
return a.dep-a.siz>b.dep-b.siz;
}
signed main() {
n=rd(),k=rd();
for(rint i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].pb(y),g[y].pb(x);
}
dfs(1,0);
sort(a+1,a+n+1,cmp);
for(rint i=1;i<=k;++i)
ans+=a[i].dep-a[i].siz+1;
printf("%lld\n",ans);
return 0;
}```
CF1421B Putting Bricks in the Wall.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdc() {
char ch=getchar();
while(ch!='0'&&ch!='1'&&ch!='S'&&ch!='F')ch=getchar();
if(ch=='0')return 0;
if(ch=='1')return 1;
return -1;
}
const int N=205;
int n,mp[N][N];
void Main(){
n=read();
vector<int>X,Y;
int cnt[2][2];
cnt[0][1]=cnt[0][0]=cnt[1][1]=cnt[1][0]=0;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
mp[i][j]=rdc();
++cnt[0][mp[1][2]],++cnt[0][mp[2][1]],++cnt[1][mp[n][n-1]],++cnt[1][mp[n-1][n]];
if(2-cnt[0][1]+2-cnt[1][0]<=2){
if(mp[1][2]!=1)X.push_back(1),Y.push_back(2);
if(mp[2][1]!=1)X.push_back(2),Y.push_back(1);
if(mp[n-1][n]!=0)X.push_back(n-1),Y.push_back(n);
if(mp[n][n-1]!=0)X.push_back(n),Y.push_back(n-1);
} else{
if(mp[1][2]!=0)X.push_back(1),Y.push_back(2);
if(mp[2][1]!=0)X.push_back(2),Y.push_back(1);
if(mp[n-1][n]!=1)X.push_back(n-1),Y.push_back(n);
if(mp[n][n-1]!=1)X.push_back(n),Y.push_back(n-1);
}
printf("%d\n",(int)X.size());
for(int i=0;i<X.size();++i)printf("%d %d\n",X[i],Y[i]);
}
signed main(){
for(int T=read();T;--T)Main();
}
/*
3
4
S010
0001
1000
111F
3
S10
101
01F
5
S0101
00000
01111
11111
0001F
*/```
手写哈希表.cpp
```//调用手写随机数
struct Hash{
static const int O=1001000;
int mod,hed[O],tot,to[O],cnt[O],nxt[O],tag[O],id;
Hash(){
static const int Mod[8]={1000003,1000033,1000037,1000039,1000081,1000099,1000117,1000121};
static Rand maker;
mod=Mod[maker.rand()&7];
tot=0,id=1;
memset(hed,0,sizeof(hed));
memset(tag,0,sizeof(tag));
}
void clear(){++id,tot=0;}
void insert(int t,int val=1){
int x=t%mod;
if(tag[x]!=id){
tag[x]=id,to[++tot]=t,nxt[tot]=0,hed[x]=tot,cnt[tot]=val;
return;
}
for(int i=hed[x];i;i=nxt[i])
if(to[i]==t){cnt[i]+=val;return;}
to[++tot]=t,nxt[tot]=hed[x],hed[x]=tot,cnt[tot]=val;
}
int query(int t){
int x=t%mod;
if(tag[x]!=id)return 0;
for(int i=hed[x];i;i=nxt[i])
if(to[i]==t)return cnt[i];
return 0;
}
};```
CF1191A Tokitsukaze and Enhancement.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,ans1,ans2;
char r[]={'D','A','C','B'};
signed main() {
cin>>n;
ans1=n,ans2=r[n%4];
++n;
if(r[n%4]<ans2)ans1=n,ans2=r[n%4];
++n;
if(r[n%4]<ans2)ans1=n,ans2=r[n%4];
n-=2;
printf("%lld %c\n",ans1-n,ans2);
return 0;
}```
CF1178C Tiles.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=998244353;
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod,k>>=1;
}
return res;
}
signed main() {
printf("%lld\n",qpow(2,rd()+rd()));
}```
CF1348E Phoenix and Berries.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=505;
int n,a[N],b[N],k,sa,sb,ans;
bool dp[N][N];
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read(),b[i]=read(),sa+=a[i],sb+=b[i];
ans=sa/k+sb/k;
if(ans==(sa+sb)/k)return cout<<ans<<'\n',0;
sa%=k,sb%=k,dp[0][0]=1;
rep(i,0,n-1){
rep(j,0,k)if(dp[i][j]){
dp[i+1][j]=1;
rep(l,0,k)if(l<=a[i+1]&&k-l<=b[i+1])
dp[i+1][(j+l)%k]=1;
}
rep(j,k-sb,sa)if(dp[i+1][j])return cout<<ans+1<<'\n',0;
}
cout<<ans<<'\n';
}```
P5666 树的重心.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
int T;
int n;
LL ans;
int mx[N],root,siz[N];
int head[N],num_edge;
int A,B,in[N],f[N];
struct edge {
int to,nxt;
}e[N<<1];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
struct BIT {
int n;LL tr[N];
void init(int x) {
n=x+1;
fill(tr+1,tr+n+1,0);
}
void add(int x,int d) {
for(rint i=++x;i<=n;i+=i&-i)
tr[i]+=d;
}
LL ask(int x) {
int res=0;
for(rint i=++x;i>0;i-=i&-i)
res+=tr[i];
return res;
}
LL ask(int l,int r) {
return ask(r)-ask(l-1);
}
}t[2];
void clear() {
num_edge=0;
fill(head+1,head+n+1,0);
fill(in+1,in+n+1,0);
t[0].init(n),t[1].init(n);
mx[root=0]=n;
A=B=0;
ans=0;
}
void getroot(int u,int ft) {
siz[u]=1,mx[u]=f[u]=0;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
getroot(v,u);
siz[u]+=siz[v];
mx[u]=max(mx[u],siz[v]);
}
f[u]=mx[u];
mx[u]=max(mx[u],n-siz[u]);
if(mx[u]<mx[root])root=u;
}
void solve(int u,int ft) {
t[0].add(siz[ft],-1),t[0].add(n-siz[u],1);
if(u!=root) {
ans+=1ll*u*t[0].ask(n-(siz[u]<<1),n-(f[u]<<1));
ans+=1ll*u*t[1].ask(n-(siz[u]<<1),n-(f[u]<<1));
in[u]|=in[ft];
if(siz[u]<=n-(siz[in[u]?B:A]<<1))ans+=root;
}
t[1].add(siz[u],1);
for(rint i=head[u];i;i=e[i].nxt)
if(e[i].to!=ft)solve(e[i].to,u);
t[0].add(siz[ft],1),t[0].add(n-siz[u],-1);
if(u!=root)
ans-=1ll*u*t[1].ask(n-(siz[u]<<1),n-(f[u]<<1));
}
void Main() {
n=rd();
clear();
for(rint i=1;i<n;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
getroot(1,0),getroot(root,0);
for(rint i=head[root];i;i=e[i].nxt) {
int v=e[i].to;
if(siz[v]>=siz[A])B=A,A=v;
else if(siz[v]>siz[B])B=v;
}
for(rint i=0;i<=n;++i)t[0].add(siz[i],1);
in[A]=1,solve(root,0);
printf("%lld\n",ans);
}
signed main() {
for(T=rd();T;--T)Main();
return 0;
}
```
CF616C The Labyrinth.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int F[N*N],siz[N*N],n,m;
char mp[N][N];
inline int id(int x,int y){return (x-1)*m+y;}
inline int anc(int x){return x==F[x]?x:F[x]=anc(F[x]);}
void merge(int x,int y){
x=anc(x),y=anc(y);
if(x==y)return;
F[x]=y,siz[y]+=siz[x];
}
signed main(){
n=read(),m=read();
rep(i,1,n)scanf("%s",mp[i]+1);
rep(i,1,n)rep(j,1,m)
siz[id(i,j)]=mp[i][j]=='.',F[id(i,j)]=id(i,j);
rep(i,1,n)rep(j,1,m){
if(mp[i][j]=='*')continue;
if(i>1&&mp[i-1][j]=='.')merge(id(i,j),id(i-1,j));
if(i<n&&mp[i+1][j]=='.')merge(id(i,j),id(i+1,j));
if(j>1&&mp[i][j-1]=='.')merge(id(i,j),id(i,j-1));
if(j<m&&mp[i][j+1]=='.')merge(id(i,j),id(i,j+1));
}
rep(i,1,n){
rep(j,1,m){
if(mp[i][j]=='.'){
putchar('.');
continue;
}
int ans=0;
vector<int>vc;
if(i>1)vc.pb(anc(id(i-1,j)));
if(i<n)vc.pb(anc(id(i+1,j)));
if(j>1)vc.pb(anc(id(i,j-1)));
if(j<m)vc.pb(anc(id(i,j+1)));
sort(vc.begin(),vc.end());
vc.resize(unique(vc.begin(),vc.end())-vc.begin());
for(int k:vc)ans+=siz[k];
putchar('0'+(ans+1)%10);
}
puts("");
}
}```
CF1280B Beingawesomeism.cpp
``` #include<bits/stdc++.h>
using namespace std;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
char rdc() {
char ch=getchar();
while(ch!='P'&&ch!='A')ch=getchar();
return ch=='A';
}
const int N=70;
int T,r,c,a[N][N];
bool pdn() {
int res=0;
for(rint i=1;i<=r;++i)
for(rint j=1;j<=c;++j)
res+=a[i][j];
return res==0;
}
bool pdy() {
int res=0;
for(rint i=1;i<=r;++i)
for(rint j=1;j<=c;++j)
res+=a[i][j];
return res==r*c;
}
bool pd1() {
int res;
res=0;for(rint i=1;i<=c;++i)res+=a[1][i];if(res==c)return 1;
res=0;for(rint i=1;i<=c;++i)res+=a[r][i];if(res==c)return 1;
res=0;for(rint i=1;i<=r;++i)res+=a[i][1];if(res==r)return 1;
res=0;for(rint i=1;i<=r;++i)res+=a[i][c];if(res==r)return 1;
return 0;
}
bool pd2() {
if(a[1][c]||a[r][c]||a[r][1]||a[1][1])return 1;
for(rint i=2;i<r;++i) {
int res=0;
for(rint j=1;j<=c;++j)res+=a[i][j];
if(res==c)return 1;
}
for(rint j=2;j<c;++j) {
int res=0;
for(rint i=1;i<=r;++i)res+=a[i][j];
if(res==r)return 1;
}
return 0;
}
bool pd3() {
int res=0;
for(rint i=2;i<c;++i)res+=a[1][i];
for(rint i=2;i<c;++i)res+=a[r][i];
for(rint i=2;i<r;++i)res+=a[i][1];
for(rint i=2;i<r;++i)res+=a[i][c];
return res>0;
}
signed main() {
T=rd();
while(T--) {
r=rd(),c=rd();
for(rint i=1;i<=r;++i)
for(rint j=1;j<=c;++j)
a[i][j]=rdc();
if(pdy())puts("0");
else if(pdn())puts("MORTAL");
else if(pd1())puts("1");
else if(pd2())puts("2");
else if(pd3())puts("3");
else puts("4");
}
return 0;
}
```
CF1236E Alice and the Unfair Game.cpp
```#include<bits/stdc++.h>
using namespace std;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
#define rint register int
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,m,a[N],l[N],r[N],tmp[N];
LL ans;
map<int,int>mp;
signed main() {
n=rd(),m=rd();
if(n==1)return puts("0"),0;
for(rint i=1;i<=m;++i)a[i]=rd();
for(rint i=m;i>=1;--i)
tmp[i]=a[i]+i,mp[tmp[i]]=mp[tmp[i]+1]+1;
for(rint i=1;i<=n;++i)
l[i]=max(i-m-1+mp[i],1);
mp.clear();
for(rint i=m;i>=1;--i)
tmp[i]=a[i]-i,mp[tmp[i]]=mp[tmp[i]-1]+1;
for(rint i=1;i<=n;++i)
r[i]=min(m+i+1-mp[i],n);
for(rint i=1;i<=n;++i)
ans+=r[i]-l[i]+1;
printf("%lld\n",ans);
return 0;
}```
P2260 [清华集训2012]模积和.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int mod=19940417;
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,m,ans,inv[7];
int f(int n){
int res=0;
for(int l=1,r,t;l<=n;l=r+1)
r=n/(n/l),t=1ll*(r-l+1)*(l+r)/2%mod,res=(res+1ll*t*(n/l)%mod)%mod;
return (res+mod)%mod;
}
int h(int n){
return 1ll*n*(n+1)%mod*(n+n+1)%mod*inv[6]%mod;
}
int g(int n,int m){
int res=1ll*n*m%mod*n%mod;
res=(res-1ll*m*f(n)%mod)%mod;
int tmp=0;
for(int l=1,r,t;l<=n;l=r+1)
r=std::min(n,m/(m/l)),t=1ll*(l+r)*(r-l+1)/2%mod,tmp=(tmp+1ll*t*(m/l)%mod)%mod;
res=(res-1ll*tmp*n%mod)%mod;
for(int l=1,r;l<=n;l=r+1)
r=std::min(n/(n/l),m/(m/l)),res=(res+1ll*(h(r)-h(l-1))*(n/l)%mod*(m/l)%mod)%mod;
return (res+mod)%mod;
}
signed main(){
inv[1]=1;
for(int i=2;i<=6;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
n=read(),m=read();
if(n>m)std::swap(n,m);
printf("%lld\n",(1ll*(1ll*n*n%mod-f(n)+mod)*(1ll*m*m%mod-f(m)+mod)%mod-g(n,m)+mod)%mod);
}```
P3704 [SDOI2017]数字表格.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod = 1e9 + 7;
int T, n, m;
const int N = 1e6 + 5;
int ivb[N], mu[N], fib[N], pri[N], cnt, f[N];
bool vis[N];
int qpow(int n, int k, int res = 1) {
for(;k; k >>= 1, n = 1ll * n * n % mod)
if (k & 1)res = 1ll * res * n % mod;
return res;
}
int power(int n, int k){
if (k == -1) return ivb[n];
if (k == 0) return 1;
if (k == 1) return fib[n];
}
void init(const int&N) {
fib[1] = 1, mu[1] = 1, ivb[1] = 1;
for (int i = 2; i <= N; ++ i) fib[i] = (fib[i - 1] + fib[i - 2]) % mod, ivb[i] = qpow(fib[i], mod - 2);
for (int i = 2; i <= N; ++ i) {
if(!vis[i]) pri[++ cnt] = i, mu[i] = -1;
for (int j = 1; j <= cnt && i * pri[j] <= N; ++ j) {
vis[i * pri[j]] = 1;
if (i % pri[j] == 0) break;
mu[i * pri[j]] = - mu[i];
}
}
for (int i = 0; i <= N; ++ i) f[i] = 1;
for (int i = 1; i <= N; ++ i)
for (int j = 1; i * j <= N; ++ j)
f[i * j] = 1ll * f[i * j] * power(i, mu[j]) % mod;
// for(int i=1;i<=10;++i)cout<<fib[i]<<' ';cout<<'\n';
// for(int i=1;i<=10;++i)cout<<ivb[i]<<' ';cout<<'\n';
// for(int i=1;i<=10;++i)cout<<mu[i]<<' ';cout<<'\n';
// for(int i=1;i<=10;++i)cout<<f[i]<<' ';cout<<'\n';
for (int i = 1; i <= N; ++ i) f[i] = 1ll * f[i] * f[i - 1] % mod;
}
int query(int n, int m){
if(n > m) n ^= m ^= n ^= m;
int res = 1;
for(int l = 1, r;l <= n; l = r + 1) {
r = min(n / (n / l), m / (m / l));
res = 1ll * res * qpow(1ll * f[r] * qpow(f[l - 1], mod - 2) % mod, 1ll * (n / l) * (m / l) % (mod - 1)) % mod;
}
return res;
}
signed main() {
init(N - 5);
T = read();
while(T --) {
n = read(), m = read();
printf("%d\n",query(n,m));
}
}```
P4268 [USACO18FEB]Directory Traversal G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 100009
int n,h[N],val[N],lef[N],numlef;
LL dp[N],f[N],ans=1e15;
vector<int>g[N];
char s[30];
void dfs1(int u) {
if(lef[u])h[u]=1;
for(int v:g[u])dfs1(v),h[u]+=h[v],f[u]+=f[v]+h[v]*val[v];
}
void dfs2(int u) {
for(int v:g[u]) {
dp[v]=dp[u]-h[v]*val[v]+3*(numlef-h[v]);
dfs2(v);
}
}
signed main() {
n=rd();
for(int i=1,j,k;i<=n;++i) {
scanf("%s",s);
val[i]=strlen(s)+1;
for(j=rd(),k=1;k<=j;++k)g[i].pb(rd());
if(!j)lef[i]=1,++numlef;
}
dfs1(1),dp[1]=f[1],dfs2(1);
for(int i=1;i<=n;++i)ans=min(ans,dp[i]);
printf("%lld\n",ans-numlef);
return 0;
}```
CF1363B Subsequence Hate.cpp
```#include<bits/stdc++.h>
using namespace std;
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1009
int n,s0[N],s1[N],ans;
char s[N];
void Main() {
scanf("%s",s+1),n=strlen(s+1);
for(int i=1;i<=n;++i)
s0[i]=s0[i-1]+(s[i]=='0'),s1[i]=s1[i-1]+(s[i]=='1');
ans=min(s0[n],s1[n]);
for(int i=1;i<=n;++i)
ans=min(ans,min(s0[i-1]+(s1[n]-s1[i]),s1[i-1]+(s0[n]-s0[i])));
printf("%d\n",ans);
}
signed main() {
for(int T=rd();T;--T)Main();
}```
CF747D Winter Is Coming.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,k,a[N],num,b[N],lst,tot,cnt,ano;
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read()<0,num+=a[i];
if(num>k)return puts("-1"),0;
k-=num;
rep(i,1,n)if(a[i]!=a[i-1])++cnt;
rep(i,1,n)if(a[i]){
if(lst&&a[i]!=a[i-1])b[++tot]=i-1-lst;
lst=i;
}
if(!a[n])ano=n-lst;
else ano=1919810;
// rep(i,1,tot)cerr<<b[i]<<' ';cerr<<'\n';
// cerr<<ano<<'\n';
sort(b+1,b+tot+1);
for(int i=1;i<=tot;++i)if(k>=b[i])k-=b[i],cnt-=2;else break;
if(k>=ano&&lst)--cnt;
printf("%d\n",cnt);
return 0;
}```
P6829 [IOI2020]植物比较.cpp
```#include"plants.h"
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define sz(v) (int)(v).size()
template<class T>inline bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>inline bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
typedef long long LL;
const int N=200005;
const int T=N<<2;
const int inf=0x3f3f3f3f;
int n,a[N],tpn[N],tpo,len;
int L[20][N],R[20][N];
LL dl[20][N],dr[20][N];
vector<int>v0;
namespace sg1{
int miv[T],tag[T],id[T];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){
miv[p]=inf,id[p]=0;
if(ckmin(miv[p],miv[lc]))id[p]=id[lc];
if(ckmin(miv[p],miv[rc]))id[p]=id[rc];
}
void build(int l,int r,int p,int*a){
tag[p]=0,miv[p]=inf;
if(l==r)return miv[p]=a[l],id[p]=l,void();
int mid=(l+r)>>1;
build(l,mid,lc,a),build(mid+1,r,rc,a);
pushup(p);
}
void pushdown(int p){
if(tag[p]){
tag[lc]+=tag[p],miv[lc]+=tag[p];
tag[rc]+=tag[p],miv[rc]+=tag[p];
tag[p]=0;
}
}
void get0(int p,int l,int r){
if(l==r)return v0.pb(l),void();
pushdown(p);
int mid=(l+r)>>1;
if(!miv[lc])get0(lc,l,mid);
if(!miv[rc])get0(rc,mid+1,r);
}
void update(int ql,int qr,int d,int l=1,int r=n,int p=1){
if(ql>qr)return;
if(ql<=l&&r<=qr){
miv[p]+=d,tag[p]+=d;
if(!miv[p])get0(p,l,r);
return;
}
pushdown(p);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,d,l,mid,lc);
if(mid<qr)update(ql,qr,d,mid+1,r,rc);
pushup(p);
}
void change(int pos,int d,int l=1,int r=n,int p=1){
if(l==r)return miv[p]=d,void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,d,l,mid,lc);
else change(pos,d,mid+1,r,rc);
pushup(p);
}
pair<int,int>query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql>qr)return mkp(inf,inf);
if(ql<=l&&r<=qr)return mkp(miv[p],id[p]);
int mid=(l+r)>>1;pair<int,int>res=mkp(inf,inf);
if(ql<=mid)ckmin(res,query(ql,qr,l,mid,lc));
if(mid<qr)ckmin(res,query(ql,qr,mid+1,r,rc));
return res;
}
#undef lc
#undef rc
}
namespace sg2{
#define lc (p<<1)
#define rc (p<<1|1)
int sv[T],sl[T],sr[T];
void pushup(int p){
if(sl[lc])sl[p]=sl[lc];
else sl[p]=sl[rc];
if(sr[rc])sr[p]=sr[rc];
else sr[p]=sr[lc];
sv[p]=max(sv[lc],sv[rc]);
if(sl[rc]&&sr[lc])ckmax(sv[p],sl[rc]-sr[lc]);
}
void change(int pos,int k,int l=1,int r=n,int p=1){
if(l==r){
sl[p]=sr[p]=k?l:0;
return;
}
int mid=(l+r)>>1;
if(pos<=mid)change(pos,k,l,mid,lc);
else change(pos,k,mid+1,r,rc);
pushup(p);
}
int query(int l=1,int r=n,int p=1){
if(l==r)return l;
int mid=(l+r)>>1;
if(!sl[rc])return query(l,mid,lc);
if(!sl[lc])return query(mid+1,r,rc);
if(sv[rc]<len&&sl[rc]-sr[lc]<len)return query(l,mid,lc);
return query(mid+1,r,rc);
}
#undef lc
#undef rc
}
int dis(int x,int y){
return x<=y?y-x:y+n-x;
}
int compare_plants(int a,int b){
++a,++b;
int flg=1;
if(tpn[a]>tpn[b])flg=-1,swap(a,b);
LL dst=0;int u=a;
for(int i=19;i>=0;--i)
if(L[i][u]&&tpn[L[i][u]]<=tpn[b])dst+=dl[i][u],u=L[i][u];
if(dst>=dis(b,a))return flg;
dst=0,u=a;
for(int i=19;i>=0;--i)
if(R[i][u]&&tpn[R[i][u]]<=tpn[b])dst+=dr[i][u],u=R[i][u];
if(dst>=dis(a,b))return flg;
return 0;
}
inline bool cmp(const int&a,const int&b){
return tpn[a]>tpn[b];
}
void init(int k,std::vector<int>r){
len=k,n=r.size(),tpo=0;
for(int i=0;i<n;++i)a[i+1]=r[i];
sg1::build(1,n,1,a);
for(int i=1;i<=n;++i)if(!a[i])sg2::change(i,1);
for(int i=1;i<=n;++i){
int x=sg1::id[1];
if(x-k+1<1){
pair<int,int>tmp=sg1::query(n+x-k+1,n);
if(!tmp.fi)x=sg2::query();
}
tpn[x]=++tpo;
sg1::change(x,inf),sg2::change(x,0);
v0.clear();
sg1::update(max(1,x-k+1),x,-1);
if(x-k+1<1)sg1::update(n+x-k+1,n,-1);
for(int j:v0)sg2::change(j,1);
}
for(int i=1;i<=n;++i)a[i]=inf;
sg1::build(1,n,1,a);
for(int i=1;i<=n;++i)a[i]=i;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i){
int x=a[i],le=0,ri=0;
pair<int,int>tl=sg1::query(max(1,x-k+1),x);
if(tl.fi<inf)le=tl.se;
if(x-k+1<1){
pair<int,int>ttl=sg1::query(n+x-k+1,n);
if(tl.fi>ttl.fi)le=ttl.se;
}
pair<int,int>tr=sg1::query(x,min(x+k-1,n));
if(tr.fi<inf)ri=tr.se;
if(x+k-1>n){
pair<int,int>ttr=sg1::query(1,x+k-1-n);
if(tr.fi>ttr.fi)ri=ttr.se;
}
sg1::change(x,tpn[x]);
L[0][x]=le,R[0][x]=ri;
dl[0][x]=dis(le,x),dr[0][x]=dis(x,ri);
}
for(int i=1;i<=19;++i)
for(int j=1;j<=n;++j)
L[i][j]=L[i-1][L[i-1][j]],R[i][j]=R[i-1][R[i-1][j]],
dl[i][j]=dl[i-1][j]+dl[i-1][L[i-1][j]],
dr[i][j]=dr[i-1][j]+dr[i-1][R[i-1][j]];
}```
P5072 [Ynoi2015]盼君勿忘.cpp
```#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cmath>
#include<unordered_set>
#include<cassert>
using std::cout;
using std::endl;
using std::vector;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100009
#define S 230
#define B 500
int n,m,a[N],ans[N];
int bel[N];
int cnt[N];
long long sum[S+5];
struct ASK {
int l,r,p,id;
inline bool operator<(const ASK&rhs)const{
return bel[l]!=bel[rhs.l]?l<rhs.l:bel[l]&1?r<rhs.r:r>rhs.r;
}
}q[N];
namespace FPOW{
#define C 256//1<<8
#define D 255//(1<<8)-1
#define M 261//C+5
#define K 395//N/M+5
int p1[M],p2[K],mod;
void FastMod(int&x,const int&p) {(x>=p)&&(x-=p);}
void init(int p) {
p1[0]=p2[0]=1,mod=p;
for(int i=1;i<M;++i)p1[i]=(p1[i-1]<<1)%p;
for(int i=1;i<K;++i)p2[i]=1ll*p2[i-1]*p1[C]%p;
}
int qpow(int k) {
return 1ll*p1[k&D]*p2[k>>8]%mod;
}
}
namespace List {
int pre[N],suf[N],head;
bool vis[N];
void insert(int x) {
if(vis[x])return;
pre[head]=x,suf[x]=head;
head=x,vis[x]=1;
}
void erase(int x) {
if(!vis[x])return;
if(x==head)head=suf[x];
pre[suf[x]]=pre[x],suf[pre[x]]=suf[x];
pre[x]=suf[x]=0,vis[x]=0;
}
}
void add(int x){
if(cnt[x]<S)sum[cnt[x]]-=x;
++cnt[x];
if(cnt[x]==S)List::insert(x);
if(cnt[x]<S)sum[cnt[x]]+=x;
}
void pop(int x){
if(cnt[x]<S)sum[cnt[x]]-=x;
if(cnt[x]==S)List::erase(x);
--cnt[x];
if(cnt[x]<S)sum[cnt[x]]+=x;
}
int query(int len,int mod){
FPOW::init(mod);
int res=0,tmp=FPOW::qpow(len);
for(int i=1,mx=min(len,S);i<=mx;++i)res=(res+1ll*(sum[i]%mod)*(tmp-FPOW::qpow(len-i)+mod)%mod)%mod;
for(int i=List::head;i;i=List::suf[i])res=(res+1ll*i*(tmp-FPOW::qpow(len-cnt[i])+mod)%mod)%mod;
return res;
}
signed main(){
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd(),bel[i]=(i-1)/B+1;
for(int i=1;i<=m;++i)q[i].l=rd(),q[i].r=rd(),q[i].p=rd(),q[i].id=i;
sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i) {
while(l>q[i].l)add(a[--l]);
while(r<q[i].r)add(a[++r]);
while(l<q[i].l)pop(a[l++]);
while(r>q[i].r)pop(a[r--]);
ans[q[i].id]=query(q[i].r-q[i].l+1,q[i].p);
}
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
P2661 信息传递-2（tarjan）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=2e5+10;
int n,ans=1<<28;
int st[N],top,timer,dfn[N],low[N],scc[N],C;
int num_edge,head[N];
struct edge {
int to,nxt;
}e[N];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
void tarjan(int u) {
low[u]=dfn[u]=++timer,st[++top]=u;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]) {
scc[u]=++C;int siz=1;
while(st[top]!=u)scc[st[top--]]=C,++siz;
--top;
if(siz>1)ans=min(ans,siz);
}
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)addedge(i,rd());
for(rint i=1;i<=n;++i)if(!dfn[i])tarjan(i);
printf("%d\n",ans);
return 0;
}
```
CF1137A Skyscrapers.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1009;
int n,m,a[N][N],h[N][N],l[N][N];
signed main(){
n=rd(),m=rd();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
a[i][j]=h[i][j]=l[j][i]=rd();
for(int i=1;i<=n;++i)sort(h[i]+1,h[i]+m+1),h[i][0]=unique(h[i]+1,h[i]+m+1)-h[i]-1;
for(int i=1;i<=m;++i)sort(l[i]+1,l[i]+n+1),l[i][0]=unique(l[i]+1,l[i]+n+1)-l[i]-1;
for(int i=1;i<=n;++i) {
for(int j=1;j<=m;++j) {
int x=lower_bound(h[i]+1,h[i]+h[i][0]+1,a[i][j])-h[i];
int y=lower_bound(l[j]+1,l[j]+l[j][0]+1,a[i][j])-l[j];
printf("%d ",max(x,y)+max(h[i][0]-x,l[j][0]-y));
}
puts("");
}
return 0;
}```
P2408 不同子串个数.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
template<int L>
struct Suffix_Automation{
#define N (L+5)
#define S (N<<1)
int trans[S][26],tot,mxlen[S],link[S];
int q[S],t[S],rt[S];
int New(){++tot;memset(trans[tot],0,sizeof(trans[tot]));mxlen[tot]=link[tot]=0;return tot;}
Suffix_Automation(){tot=0,New();}
void clear(){tot=0;New();}
int extend(int c,int lst,int id,int op=0){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=New();mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void insert(char*str,int op=0){
int n=strlen(str);
for(int i=0,lst=1;i<n;++i)lst=extend(str[i]-'a',lst,i+1);
}
void rsort(){
for(int i=1;i<=tot;++i)t[i]=0;
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
}
LL distinct_substring(){
LL res=0;
for(int i=1;i<=tot;++i)res+=mxlen[i]-mxlen[link[i]];
return res;
}
#undef S
#undef N
};
Suffix_Automation<100000>sam;
signed main(){
static char str[100005];read();
scanf("%s",str),sam.insert(str),cout<<sam.distinct_substring()<<'\n';
}```
P7343 【DSOI 2021】电子跃迁.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n,a[N],b[N],m;
signed main(){
n=read(),m=read();
rep(i,1,n)a[i]=read();
rep(i,1,m)b[i]=read();
sort(b+1,b+m+1),b[m+1]=n;
rep(i,1,m+1)if(b[i-1]<b[i])sort(a+b[i-1]+1,a+b[i]+1);
rep(i,1,n)printf("%d ",a[i]);
return 0;
}```
P3175 [HAOI2015]按位或.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=20;
const int M=(1<<N)+5;
const db eps=1e-9;
int m,n,cnt[M];
db f[M],ans;
signed main(){
n=1<<(m=read());
for(int i=0;i<n;++i)scanf("%lf",&f[i]),cnt[i]=cnt[i>>1]+(i&1);
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j)
f[i+j+k]+=f[i+j];
for(int msk=0;msk<n;++msk){
db t=1-f[(n-1)^msk];
if(t>eps)ans+=((cnt[msk]&1)?1:-1)/t;
}
if(ans<eps)puts("INF");else printf("%.10lf\n",ans);
}```
P7301 [USACO21JAN] Spaced Out S.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int n,a[N][N],ans;
signed main(){
n=read();
rep(i,1,n)rep(j,1,n)a[i][j]=read();
int sum=0;
rep(j,1,n){
int s[2];s[0]=s[1]=0;
rep(i,1,n)s[i&1]+=a[i][j];
sum+=max(s[0],s[1]);
}
ckmax(ans,sum),sum=0;
rep(i,1,n){
int s[2];s[0]=s[1]=0;
rep(j,1,n)s[j&1]+=a[i][j];
sum+=max(s[0],s[1]);
}
ckmax(ans,sum),sum=0;
cout<<ans<<'\n';
}```
P4479 [BJWC2018]第k大斜率.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n;
LL k;
struct point {
int x, y;
}p[N];
bool cmp(const point&a, const point&b){
return a.x != b.x ? a.x < b.x : a.y < b.y;
}
LL tr[N];
void add(int x, int d) { for (int i = x; i <= n; i += i & -i) tr[i] += d; }
LL ask(int x) { LL res = 0; for (int i = x; i > 0 ;i -= i & -i) res += tr[i]; return res; }
#define lsh(x) (lower_bound(b + 1, b + len + 1, x) - b)
LL check(int sl) {
static LL a[N], b[N];
static int len;
for (int i = 1; i <= n; ++ i) b[i] = a[i] = 1ll * sl * p[i].x - p[i].y;
sort(b + 1, b + n + 1), len = unique(b + 1, b + n + 1) - b - 1;
for (int i = 1; i <= n; ++ i) a[i] = n - lsh(a[i]) + 1;
memset(tr, 0, sizeof(tr));
LL res = 0;
for (int i = 1; i <= n;) {
int l = i, r = i;
while (p[r + 1].x == p[l].x) ++ r;
for (int j = l; j <= r; ++ j) res += ask(a[j]);
for (int j = l; j <= r; ++ j) add(a[j], 1);
i = r + 1;
}
return res;
}
signed main(){
scanf("%d%lld",&n, &k);
for (int i = 1; i <= n; ++ i) scanf("%d%d", &p[i].x, &p[i].y);
sort(p + 1, p + n + 1, cmp);
int l = -2e8, r = 2e8, res = -1;
while (l <= r){
int mid = (l + r) >> 1;
if (check(mid) < k) r = mid - 1;//sum(slope >= mid) < k
else res = mid, l = mid + 1;
}
printf("%d\n",res);
return 0;
}
/*
4 1
-1 -1
2 1
3 3
1 4
2
4 1
1 1
2 5
3 4
4 3
5
*/```
P2561 [AHOI2002]黑白瓷砖.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
struct Bignum{
int a[300],len;
Bignum(){len=1,memset(a,0,sizeof(a));}
inline void print(char text=-1){
per(i,len,1)putchar('0'+a[i]);
if(~text)putchar(text);
}
inline void init(int n){
if(!n)a[len=1]=0;
else{
len=0;
while(n)a[++len]=n%10,n/=10;
}
}
inline Bignum operator + (const Bignum&t){
Bignum res;
int mx=max(len,t.len);
for(int i=1;i<=mx;++i){
res.a[i]+=a[i]+t.a[i];
if(res.a[i]>9)++res.a[i+1],res.a[i]-=10;
}
res.len=mx;
if(res.a[mx+1])++res.len;
return res;
}
inline Bignum operator - (const Bignum&t){
Bignum res;
int mx=max(len,t.len);
for(int i=1;i<=mx;++i){
res.a[i]+=a[i]-t.a[i];
if(res.a[i]<0)--res.a[i+1],res.a[i]+=10;
}
res.len=mx;
while(!res.a[res.len])--res.len;
return res;
}
inline Bignum operator * (const Bignum&t){
Bignum res;
for(int i=1;i<=len;++i)
for(int j=1;j<=t.len;++j)
res.a[i+j-1]+=a[i]*t.a[j];
res.len=len+t.len-1;
for(int i=1;i<=res.len;++i)
res.a[i+1]+=res.a[i]/10,res.a[i]%=10;
if(res.a[res.len+1])++res.len;
return res;
}
inline Bignum operator / (const int&t){
Bignum res;
int now=0;
for(int i=len;i>=1;--i){
now=now*10+a[i];
res.a[++res.len]=now/t,now%=t;
}
reverse(res.a+1,res.a+res.len+1);
while(!res.a[res.len])--res.len;
return res;
}
}ans,two,thr;
inline Bignum change(int x){
Bignum res;
res.init(x);
return res;
}
inline Bignum qpow(Bignum n,int k){
Bignum res;
res.init(1);
for(;k;k>>=1,n=n*n)
if(k&1)res=res*n;
return res;
}
signed main(){
two.init(2),thr.init(3);
int n=read(),m=n*(n+1)/2,p=(n+1)/2;
ans=ans+thr*qpow(two,(m-p)/2+p);
ans=ans+two*qpow(two,(m+2)/3);
ans=ans+qpow(two,m);
ans=ans/6;
ans.print();
}```
CF364A Matrix.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=4005;
unordered_map<int,int>mp;
int a,n;
LL ans;
char str[N];
signed main(){
scanf("%d%s",&a,str+1),n=strlen(str+1);
for(int i=1;i<=n;++i){
int sum=0;
for(int j=i;j<=n;++j){
sum+=str[j]-'0';
if(!a&&!sum)++mp[0];
else if(sum&&a%sum==0)++mp[sum];
}
}
for(int i=1;i<=n;++i){
int sum=0;
for(int j=i;j<=n;++j){
sum+=str[j]-'0';
if(!a&&!sum)ans+=n*(n+1)/2-mp[0];
else if(sum&&a%sum==0)ans+=mp[a/sum];
}
}
if(!a)ans+=1ll*mp[0]*mp[0];
printf("%lld\n",ans);
return 0;
}```
P7214 [JOISC2020] 治療計画.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m;
LL dis[N];
bool vis[N];
struct node{int T,L,R,C;}a[N];
inline bool cmp(const node&a,const node&b){return a.T<b.T;}
priority_queue<pair<LL,int> >pq;
struct SegmentTree{
static const int T=N<<2;
#define lc (p<<1)
#define rc (p<<1|1)
set<pair<int,int> >S[T];
void change(int pos,int val,int l=1,int r=m,int p=1){
S[p].insert(mkp(val,pos));
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)change(pos,val,l,mid,lc);
else change(pos,val,mid+1,r,rc);
}
void link(int ql,int qr,int val,LL d,int l=1,int r=m,int p=1){
if(ql<=l&&r<=qr){
while(!S[p].empty()){
set<pair<int,int> >::iterator t=S[p].begin();
if(t->fi>val)break;
if(ckmin(dis[t->se],d+a[t->se].C))pq.push(mkp(-dis[t->se],t->se));
S[p].erase(t);
}
return;
}
int mid=(l+r)>>1;
if(ql<=mid)link(ql,qr,val,d,l,mid,lc);
if(mid<qr)link(ql,qr,val,d,mid+1,r,rc);
}
}T[2];
LL Dij(){
memset(dis,0x3f,sizeof(dis)),memset(vis,0,sizeof(vis));
rep(i,1,m)T[0].change(i,a[i].L-a[i].T-1),T[1].change(i,a[i].L+a[i].T-1);
rep(i,1,m)if(a[i].L==1)pq.push(mkp(-(dis[i]=a[i].C),i));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vis[u])continue;vis[u]=1;
if(a[u].R==n)return dis[u];
if(u>1)T[0].link(1,u-1,a[u].R-a[u].T,dis[u]);
if(u<m)T[1].link(u+1,m,a[u].R+a[u].T,dis[u]);
}
return -1;
}
signed main(){
n=read(),m=read();
rep(i,1,m)a[i].T=read(),a[i].L=read(),a[i].R=read(),a[i].C=read();
sort(a+1,a+m+1,cmp),printf("%lld\n",Dij());
return 0;
}```
P1947 猜数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
extern "C" int Seniorious(int);
extern "C" int Chtholly(int n, int c) {
int l=1,r=n;
while(l<=r) {
int mid=(l+r)>>1,k=Seniorious(mid);
if(!k)return mid;
if(k<0)l=mid+1;
else if(k>0)r=mid-1;
}
}```
CF1320B Navigation System.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 200005
int n,m,p[N],k,ans1,ans2;
vector<int>g[N],e[N];
bool vis[N];
int dis[N];
void bfs(int st){
queue<int>q;
q.push(st),vis[st]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int v:e[u])
if(!vis[v])dis[v]=dis[u]+1,vis[v]=1,q.push(v);
}
}
signed main(){
n=read(),m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read();
g[x].pb(y),e[y].pb(x);
}
k=read();
for(int i=1;i<=k;++i)p[i]=read();
bfs(p[k]);
for(int i=1;i<k;++i){
int cnt=0;
if(dis[p[i+1]]+1>dis[p[i]])++ans1,++ans2;
else{
for(int v:g[p[i]])
if(dis[v]+1==dis[p[i]])++cnt;
ans2+=cnt>1;
}
}
printf("%d %d\n",ans1,ans2);
}```
CF896B Ithea Plays With Chtholly.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1010;
int n,m,c,x,a[N];
bool check() {
for(rint i=1;i<=n;++i)if(!a[i]||a[i]<a[i-1])return 0;
return 1;
}
signed main() {
scanf("%d%d%d",&n,&m,&c);
while(m--) {
scanf("%d",&x);
if(x*2<=c){for(rint i=1;i<=n;++i)if(!a[i]||a[i]>x) {printf("%d\n",i),a[i]=x;break;}}
else {for(rint i=n;i>=1;--i)if(!a[i]||a[i]<x) {printf("%d\n",i),a[i]=x;break;}}
fflush(stdout);
if(check())return 0;
}
}```
P5682 [CSPJX2019]次大值【民间数据】.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
int n,a[N],flg;
signed main() {
n=read();
for(int i=1;i<=n;++i)a[i]=read();
sort(a+1,a+n+1),n=unique(a+1,a+n+1)-a-1;
if(n<2)puts("-1");
else printf("%d\n",max(a[n]%a[n-1],a[n-2]));
return 0;
}
```
P4245 【模板】任意模数多项式乘法（三模NTT）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
const int mod[3]={469762049,998244353,1004535809};
const int N=300010;
int a[3][N],b[3][N],n,m,p,l,lim,rev[N];
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline LL qpow(LL n,LL k,LL P) {
LL res=1;for(;k;k>>=1,n=n*n%P)if(k&1)res=res*n%P;
return res;
}
inline void NTT(int *a,int P,int g) {
for(rint i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(rint i=1;i<lim;i<<=1) {
int wn=qpow(g,(P-1)/(i<<1),P);
for(rint j=0;j<lim;j+=(i<<1)) {
int w0=1;
for(rint k=0;k<i;++k,w0=1ll*w0*wn%P) {
int X=a[j+k],Y=1ll*w0*a[i+j+k]%P;
a[j+k]=(X+Y)%P;
a[i+j+k]=(X-Y+P)%P;
}
}
}
}
LL get(int i) {
LL x=a[0][i]+(a[1][i]-a[0][i]+mod[1])*qpow(mod[0],mod[1]-2,mod[1])%mod[1]*mod[0];
return (x%p+(a[2][i]-x%mod[2]+mod[2])*qpow(1ll*mod[0]*mod[1]%mod[2],mod[2]-2,mod[2])%mod[2]*mod[0]%p*mod[1]%p)%p;
}
int main() {
n=rd(),m=rd(),p=rd();
for(rint i=0;i<=n;++i)a[0][i]=a[1][i]=a[2][i]=rd()%p;
for(rint i=0;i<=m;++i)b[0][i]=b[1][i]=b[2][i]=rd()%p;
for(lim=1,l=0;lim<=n+m;lim<<=1,++l);
for(rint i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(l-1));
for(rint i=0;i<3;++i)NTT(a[i],mod[i],3);
for(rint i=0;i<3;++i)NTT(b[i],mod[i],3);
for(rint i=0;i<3;++i)
for(rint j=0;j<lim;++j)
a[i][j]=1ll*a[i][j]*b[i][j]%mod[i];
for(rint i=0;i<3;++i)NTT(a[i],mod[i],qpow(3,mod[i]-2,mod[i]));
for(rint i=0;i<3;++i) {
int inv=qpow(lim,mod[i]-2,mod[i]);
for(rint j=0;j<lim;++j)
a[i][j]=1ll*inv*a[i][j]%mod[i];
}
for(rint i=0;i<=n+m;++i)printf("%lld%c",get(i)," \n"[i==n+m]);
return 0;
}```
CF1137B Camp Schedule.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
typedef long long LL;
const int N=500009;
char s[N],t[N];
int n,m,p[N],num[2];
signed main() {
scanf("%s%s",s+1,t+1);
n=strlen(s+1),m=strlen(t+1);
if(n<m)return printf("%s\n",s+1),0;
p[1]=0;
for(int i=2,j=0;i<=m;++i) {
while(j&&t[j+1]!=t[i])j=p[j];
if(t[j+1]==t[i])++j;
p[i]=j;
}
for(int i=1;i<=n;++i)++num[s[i]-'0'];
for(int i=1;i<=m;++i)
if(num[t[i]-'0'])putchar(t[i]),--num[t[i]-'0'];
else {
while(num[0])putchar('0'),--num[0];
while(num[1])putchar('1'),--num[1];
return 0;
}
for(int i=1,flg=0;i<=n-m;++i) {
for(int j=p[m]+1;j<=m;++j)
if(num[t[j]-'0'])putchar(t[j]),--num[t[j]-'0'];
else {flg=1;break;}
if(flg){
while(num[0])putchar('0'),--num[0];
while(num[1])putchar('1'),--num[1];
return 0;
}
}
}```
CF1327D Infinite Path.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
const int inf=1000000007;
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
int T,n,p[N],c[N],ans;
vector<int>fac,a;
bool vis[N];
void getfac(int x) {
fac.clear();
for(rint i=1,mx=sqrt(x);i<=mx;++i) {
if(x%i==0) {
fac.push_back(i);
if(i*i!=x)fac.push_back(x/i);
}
}
sort(fac.begin(),fac.end());
}
void calc() {
getfac(a.size());
for(rint i=0;i<fac.size();++i) {
int k=fac[i];
for(rint j=0;j<k;++j) {
int flg=1;
for(rint l=j;l<a.size();l+=k)flg&=(a[j]==a[l]);
if(flg){ans=min(ans,k);return;}
}
}
}
signed main() {
T=rd();
while(T--) {
n=rd();ans=inf;
for(rint i=1;i<=n;++i)p[i]=rd();
for(rint i=1;i<=n;++i)c[i]=rd();
for(rint i=1;i<=n;++i)vis[i]=0;
for(rint i=1;i<=n;++i) {
if(!vis[i]) {
a.clear();
a.push_back(c[i]);vis[i]=1;
for(rint j=p[i];j!=i;j=p[j])
a.push_back(c[j]),vis[j]=1;
calc();
}
}
printf("%d\n",ans);
}
return 0;
}```
CF1363A Odd Selection.cpp
```#include<bits/stdc++.h>
using namespace std;
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1009
int n,x,s[2];
void Main() {
n=rd(),x=rd();
s[0]=s[1]=0;
for(int i=1;i<=n;++i)++s[rd()%2];
if(x==n)puts(s[1]%2==1?"Yes":"No");
else if(s[1]&&s[0])puts("Yes");
else if(s[1]&&!s[0])puts(x&1?"Yes":"No");
else if(!s[1]&&s[0])puts("No");
}
signed main() {
for(int T=rd();T;--T)Main();
}```
CF145E Lucky Queries.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 1000009
int n,m,a[N];
char s[N];
int tag[N<<2],val[N<<2][4];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {
val[p][0]=val[lc][0]+val[rc][0];//0
val[p][1]=val[lc][1]+val[rc][1];//1
val[p][2]=max(max(val[lc][0],val[lc][2])+val[rc][1],max(val[rc][1],val[rc][2])+val[lc][0]);//0->1
val[p][3]=max(max(val[lc][1],val[lc][3])+val[rc][0],max(val[rc][0],val[rc][3])+val[lc][1]);//1->0
}
void build(int l,int r,int p) {
if(l==r)return val[p][a[l]]=val[p][2]=val[p][3]=1,void();
int mid=(l+r)>>1;build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void addtag(int p) {
tag[p]^=1,swap(val[p][0],val[p][1]),swap(val[p][2],val[p][3]);
}
void pushdown(int p,int l,int r) {
if(tag[p])addtag(lc),addtag(rc),tag[p]^=1;
}
void update(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return addtag(p),void();
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,lc);
if(qr>mid)update(ql,qr,mid+1,r,rc);
pushup(p);
}
signed main() {
n=rd(),m=rd(),scanf("%s",s+1);
for(int i=1;i<=n;++i)a[i]=s[i]=='7';
build(1,n,1);
while(m--) {
scanf("%s",s);
int opt=s[0]=='s',x,y;
if(opt)x=rd(),y=rd(),update(x,y,1,n,1);
else printf("%d\n",val[1][2]);
}
return 0;
}```
CF1197D Yet Another Subarray Problem.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define mod 998244353
typedef std::pair<int,int> pii;
inline int upd(const int x){return x+(x>>31&mod);}
inline void reduce(int&x){x-=mod,x+=x>>31&mod;}
inline void add(int&x,const int y){x=upd((x+y)%mod);}
const int N = 300005;
const int T = N << 2;
const ll inf = 0x3f3f3f3f3f3f3f3f;
int a[N], n, m, k;
ll s[N], ans, t[20];
int main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0), std::cout.tie(0);
std::cin >> n >> m >> k;
for (int i = 1; i <= n; ++i)
std::cin >> a[i], s[i] = s[i - 1] + a[i];
memset(t, 0x3f, sizeof(t));
t[0] = k;
for (int i = 1; i <= n; ++i) {
ll mi = inf;
for (int j = 0; j < m; ++j) mi = std::min(mi, t[j]);
ans = std::max(ans, s[i] - mi);
int bl = i % m;
t[bl] = std::min(t[bl], s[i]) + k;
}
printf("%lld\n", ans);
return 0;
}```
P2402 奶牛隐藏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=410;
const int M=N*N*2;
const LL inf=4e18;
int n,m;
LL s[N],p[N],mp[N][N],mf,sum;
int dis[N],et=1,hed[N],S,T,cur[N];
struct edge{int nx,to;LL fl;}e[M];
void addedge(int u,int v,LL fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,LL fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
LL dfs(int u,LL fl){
if(u==T)return fl;
LL used=0,rl;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(fl-used,e[i].fl));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
bool check(LL o){
memset(hed,0,sizeof(hed)),et=1,mf=0;
rep(i,1,n)adde(S,i,s[i]),adde(i+n,T,p[i]);
rep(i,1,n)rep(j,1,n)if(mp[i][j]<=o)adde(i,j+n,inf);
while(bfs(S,T))mf+=dfs(S,inf);
return mf==sum;
}
signed main(){
scanf("%d%d",&n,&m),S=n*2+1,T=S+1;
rep(i,1,n)scanf("%lld%lld",&s[i],&p[i]),sum+=s[i];
memset(mp,0x3f,sizeof(mp));
rep(i,1,n)mp[i][i]=0;
rep(i,1,m){
int x,y;LL z;scanf("%d%d%lld",&x,&y,&z);
ckmin(mp[x][y],z),ckmin(mp[y][x],z);
}
rep(k,1,n)rep(i,1,n)rep(j,1,n)ckmin(mp[i][j],mp[i][k]+mp[k][j]);
LL l=1,r=1e18,res=-1;
check(842);
while(l<=r){
LL mid=(l+r)>>1;
if(check(mid))r=mid-1,res=mid;
else l=mid+1;
}
printf("%lld\n",res);
return 0;
}```
CF113B Petr#.cpp
```#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int N=2005;
const int pr=131;
ull power[N],h[N],b,e;
char t[N],sb[N],se[N];
int tx,ty,x[N],y[N],lt,lb,le,ans;
void pre() {
power[0]=1;
for(int i=1; i<=lt; ++i)
power[i]=power[i-1]*pr,h[i]=h[i-1]*pr+t[i]-'a'+1;
for(int i=1; i<=lb; ++i)b=b*pr+sb[i]-'a'+1;
for(int i=1; i<=le; ++i)e=e*pr+se[i]-'a'+1;
}
ull has(int l,int r) {
return h[r]-h[l-1]*power[r-l+1];
}
unordered_map<ull,bool>mp;
int main() {
scanf("%s%s%s",t+1,sb+1,se+1);
lt=strlen(t+1);
lb=strlen(sb+1);
le=strlen(se+1);
pre();
for(int i=1; i<=lt-lb+1; ++i)
if(has(i,i+lb-1)==b)x[++tx]=i;
for(int i=le; i<=lt; ++i)
if(has(i-le+1,i)==e)y[++ty]=i;
for(int i=1; i<=tx; ++i)
for(int j=1; j<=ty; ++j)
if(x[i]<=y[j]&&y[j]-x[i]+1>=max(le,lb))
{
ull ha=has(x[i],y[j]);
if(!mp[ha])++ans,mp[ha]=true;
}
printf("%d\n",ans);
return 0;
}```
CF1293B JOE is on TV!.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
signed main() {
double ans=0;
int n=rd();
for(rint i=1;i<=n;++i)ans+=1.0*1/i;
printf("%.8lf",ans);
return 0;
}```
Pollard-Rho.cpp
```LL mul(LL x,LL y,LL mod){
LL res=x*y-(LL)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
LL qpow(LL n,LL k,LL mod){
LL res=1;for(;k;k>>=1,n=mul(n,n,mod))if(k&1)res=mul(res,n,mod);return res;
}
LL gcd(LL x,LL y){
while(y){LL t=x%y;x=y,y=t;}
return x;
}
namespace MR{
static const int pri[10]={2,3,5,7,11,13,17,19,61,233};
bool mr(LL x,LL p){
if(x%p==0||qpow(p,x-1,x)!=1)return 0;
LL k=x-1;
while(!(k&1)){
LL t=qpow(p%x,k>>=1,x);
if(t!=1&&t!=x-1)return 0;
if(t==x-1)break;
}
return 1;
}
bool test(LL x){
for(int i=0;i<10;++i){
if(x==pri[i])return 1;
if(!mr(x,pri[i]))return 0;
}
return 1;
}
}
namespace PR{
LL ans,d[150];
int tot;
mt19937_64 rnd(673);
#define rad(l,r) (rnd()%((r)-(l)+1)+l)
LL pr(LL x,LL c){
if(x==4)return 2;
LL v0=c,v1=mul(v0,v0,x)+c,g=1;tot=0;
while(true){
g=mul(g,v1-v0,x),d[++tot]=v1-v0;
if(tot==127){if(gcd(g,x)>1)break;tot=0;}
v0=mul(v0,v0,x)+c,v1=mul(v1,v1,x)+c,v1=mul(v1,v1,x)+c;
}
for(int i=1;i<=tot;++i){g=gcd(d[i],x);if(g>1)return g;}
return x;
}
void solve(LL x){
if(x<=ans)return;
if(MR::test(x))return ckmax(ans,x),void();
LL y=x;while(y==x)y=pr(x,rad(1,x-1));
while(x%y==0)x/=y;solve(x),solve(y);
}
LL work(LL x){return ans=1,solve(x),ans;}
}```
P5445 [APIO2019]路灯（树套树）.cpp
```/*
|------- |------
| | |
| | |
| | | * |
|------ |----| --- ----- \ / ----- --- |-----| | | --- ----- | | --|--
| | | |/ \ | | \ / | | |/ \ | | | |/ \ | | | | |
| | | | ----- \ / ----- | | | | | |---- | | | |
| | | | | \ / | | | | | | | | | | |
| |----| | ----/ - ---/ | _____ | |----| | ----| |----| | --/
\ / \ / |----\ ------
\ / \ / | \ |
\ / \ / | \ |
\-/ \-/ | | ------
| | | | |
| | | / |
| | | / |
| | |----/ ------
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdopt(){
static char opt[10];
scanf("%s",opt);
return opt[0]=='t';
}
const int N=300005;
const int T=40000000;
int n,q,c[N];
char str[N];
set<pair<int,int> >s;
int rt[N],ls[T],rs[T],val[T],tot;
void update(int&p,int pos,int k,int l=1,int r=n+1){
if(!p){
p=++tot;
if(tot>=T){puts("fyy AK IOI");exit(0);}
}
val[p]+=k;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
}
int query(int p,int ql,int qr,int l=1,int r=n+1){
if(!p)return 0;
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[p],ql,qr,l,mid);
if(mid<qr)res+=query(rs[p],ql,qr,mid+1,r);
return res;
}
void add(int x,int y,int d){
if(x>n||y>n)return;
for(int i=x;i<=n+1;i+=i&-i)update(rt[i],y,d);
// a[x][y]+=d;
}
void upd(int a1,int b1,int a2,int b2,int d){
// cerr<<"upd:"<<a1<<' '<<b1<<' '<<a2<<' '<<b2<<' '<<d<<'\n';
add(a1,b1,d),add(a1,b2+1,-d),add(a2+1,b1,-d),add(a2+1,b2+1,d);
}
int ask(int x,int y){
// cerr<<"ask:"<<x<<' '<<y<<'\n';
int res=0;
for(int i=x;i>0;i-=i&-i)res+=query(rt[i],1,y);
// rep(i,1,x)rep(j,1,y)res+=a[i][j];
return res;
}
signed main(){
scanf("%d%d%s",&n,&q,str+1);
rep(i,1,n)c[i]=str[i]-'0';
for(int i=1,j;i<=n;++i){
if(!c[i])continue;
j=i;
while(j<n&&c[j+1])++j;
s.insert(mkp(i,j));
i=j;
}
// cerr<<"s:\n";for(auto i:s)cerr<<i.fi<<' '<<i.se<<'\n';
for(set<pair<int,int> >::iterator it=s.begin();it!=s.end();++it)
upd(it->fi,it->fi,it->se,it->se,q);
s.insert(mkp(N,N));
rep(t,1,q){
int opt=rdopt(),x=read(),y,a1,a2,b1,b2;
if(opt){
if(!c[x]){
set<pair<int,int> >::iterator ir=s.upper_bound(mkp(x,N)),il=ir;--il;
if(ir==s.begin()||il->se!=x-1)a1=a2=x;
else a1=il->fi,a2=x,s.erase(il);
if(ir==s.end()||ir->fi!=x+1)b1=b2=x;
else b1=x,b2=ir->se,s.erase(ir);
s.insert(mkp(a1,b2));
upd(a1,b1,a2,b2,q-t);
}
else{
set<pair<int,int> >::iterator it=s.upper_bound(mkp(x,N));--it;
// cerr<<"touggle:"<<x<<' '<<it->fi<<' '<<it->se<<'\n';
a1=it->fi,a2=x,b1=x,b2=it->se,s.erase(it);
if(a1<x)s.insert(mkp(a1,x-1));
if(b2>x)s.insert(mkp(x+1,b2));
upd(a1,b1,a2,b2,t-q);
}
c[x]^=1;
}else{
y=read()-1;
set<pair<int,int> >::iterator i1=s.upper_bound(mkp(x,N)),i2=s.upper_bound(mkp(y,N));
if(c[x]&&c[y]&&i1==i2)a1=q-t;else a1=0;
printf("%d\n",ask(x,y)-a1);
}
// cerr<<"s:\n";for(auto i:s)cerr<<i.fi<<' '<<i.se<<'\n';
}
}
/*
5 7
11011
query 1 2
query 1 2
query 1 6
query 3 4
toggle 3
query 3 4
query 1 6
10 10
0111001101
query 9 10
toggle 1
toggle 4
query 6 11
query 7 9
toggle 10
query 7 11
query 1 6
query 1 10
query 1 9
*/```
P5331 [SNOI2019]通信.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2005;
const int inf=1e8;
const LL linf=1e16;
int n,W,a[N],S,T;
int cost,cur[N];
LL dis[N];
bool vis[N],inq[N];
struct edge{
int nxt,to,val,w;
}e[(N*N+N*3)<<1];
int head[N],num_edge=1;
void addedge(int fr,int to,int val,int w){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
e[num_edge].w=w;
head[fr]=num_edge;
}
void adde(int fr,int to,int val,int w){
addedge(fr,to,val,w),addedge(to,fr,0,-w);
}
bool spfa(){
queue<int>q;
rep(i,1,T)dis[i]=linf,cur[i]=head[i],inq[i]=0;
q.push(S),dis[S]=0;
while(!q.empty()){
int u=q.front();q.pop();inq[u]=0;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(e[i].val&&dis[v]>dis[u]+e[i].w){
dis[v]=dis[u]+e[i].w;
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return dis[T]!=linf;
}
int dfs(int u,int flow){
vis[u]=1;
if(u==T)return flow;
int used=0,rlow;
for(int i=cur[u];i;i=e[i].nxt){
cur[u]=i;int v=e[i].to;
if(e[i].val&&dis[v]==dis[u]+e[i].w&&(v==T||!vis[v])){
rlow=dfs(v,min(e[i].val,flow-used));
if(rlow)e[i].val-=rlow,e[i^1].val+=rlow,cost+=rlow*e[i].w,used+=rlow;
if(used==flow)break;
}
}
return used;
}
void MCMF(){
while(spfa()){
vis[T]=1;
while(vis[T])fill(vis,vis+T+1,0),dfs(S,inf);
}
}
signed main(){
n=read(),W=read(),S=n<<1|1,T=S+1;
rep(i,1,n)a[i]=read();
rep(i,1,n)adde(S,i,1,0),adde(i+n,T,1,0),adde(S,i+n,1,W);
rep(i,1,n)rep(j,i+1,n)if(abs(a[i]-a[j])<W)adde(i,j+n,1,abs(a[i]-a[j]));
MCMF();
printf("%d\n",cost);
return 0;
}```
CF825E Minimal Labels.cpp
```// Problem: E. Minimal Labels
// Contest: Codeforces - Educational Codeforces Round 25
// URL: https://codeforces.com/contest/825/problem/E
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m;
int ans[N],tot,val[N],ind[N];
vector<int>g[N];
void topo(){
priority_queue<int>pq;
rep(i,1,n)if(!ind[i])pq.push(i);
while(!pq.empty()){
int u=pq.top();pq.pop();
ans[u]=tot--;
for(int v:g[u])if(!--ind[v])pq.push(v);
}
}
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
g[y].pb(x),++ind[x];
}
tot=n,topo();
rep(i,1,n)printf("%d ",ans[i]);
return 0;
}```
CF1111C Creative Snap.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int K=100009;
const int M=K*21;
const int inf=1e15;
int n,k,A,B,a[K],cnt[M],dp[M],ls[M],rs[M],tot,rt;
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p,int l,int r) {
cnt[p]=cnt[ls[p]]+cnt[rs[p]];
dp[p]=min(dp[ls[p]]+dp[rs[p]],cnt[p]?B*(r-l+1)*cnt[p]:A);
}
void solve(int l,int r,int &p,int pos) {
if(!p)p=++tot;
if(l==r){++cnt[p],dp[p]=cnt[p]*B;return;}
int mid=(l+r)>>1;
if(pos<=mid)solve(l,mid,ls[p],pos);
else solve(mid+1,r,rs[p],pos);
pushup(p,l,r);
}
signed main() {
n=read(),k=read(),A=read(),B=read();
dp[0]=A;
for(int i=1;i<=k;++i)solve(1,1<<n,rt,read());
printf("%lld\n",dp[1]);
return 0;
}```
CF622F The Sum of the k-th Powers.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000005;
const int mod=1e9+7;
int n,k,ans;
int pri[N/9],cnt,s[N],inv[N],fac[N],ifc[N];
bool vis[N];
int pre[N],suf[N];
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
void fmod(int&x){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
void Sieve(const int&N){
s[1]=1;
for(int i=2;i<=N;++i){
if(!vis[i])pri[++cnt]=i,s[i]=qpow(i,k);
for(int j=1;j<=cnt&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;s[i*pri[j]]=1ll*s[i]*s[pri[j]]%mod;
if(i%pri[j]==0)break;
}
}
for(int i=1;i<=N;++i)fmod(s[i]+=s[i-1]);
inv[1]=1;for(int i=2;i<=N;++i)inv[i]=1ll*inv[mod%i]*(mod-i)%mod;
fac[0]=1;for(int i=1;i<=N;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[N]=qpow(fac[N],mod-2);for(int i=N-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
pre[0]=1;for(int i=1;i<=N;++i)pre[i]=1ll*pre[i-1]*(n-i)%mod;
suf[N+1]=1;for(int i=N;i>0;--i)suf[i]=1ll*suf[i+1]*(n-i)%mod;
}
void lagrange(){
for(int i=1;i<=k+2;++i){
int A=1ll*pre[i-1]*suf[i+1]%mod;
int B=1ll*ifc[i-1]*((k+2-i)&1?-1:1)*ifc[k+2-i]%mod;
ans=(ans+1ll*s[i]*A%mod*B%mod)%mod;
}
}
signed main(){
cin>>n>>k,Sieve(k+2);
if(n<=k+2)return cout<<s[n]<<'\n',0;
lagrange(),fmod(ans),cout<<ans<<'\n';
return 0;
}```
AT2044 [AGC004D] Teleporter.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=100005;
int n,k,a[N],ans;
struct edge{int nx,to;}e[N];
int hed[N],et;
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
int dfs(int u){
int mx=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;ckmax(mx,dfs(v));
}
//cerr<<u<<' '<<mx<<'\n';
if(a[u]!=1&&mx==k-1)return ++ans,0;
return mx+1;
}
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read();
rep(i,2,n)adde(a[i],i);
if(a[1]!=1)++ans,a[1]=1;
dfs(1);
printf("%d\n",ans);
return 0;
}```
P1311 选择客栈.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int K=50;
int n,k,p,a[N],b[N];
int s[K][N];
LL ans;
signed main(){
n=read(),k=read(),p=read();
for(int i=1,lst=-1;i<=n;++i){
a[i]=read(),b[i]=read();
for(int j=0;j<k;++j)s[j][i]=s[j][i-1];
s[a[i]][i]=s[a[i]][i-1]+1;
if(b[i]<=p)lst=i,ans+=s[a[i]][i-1];
else if(~lst)ans+=s[a[i]][lst];
}
printf("%lld\n",ans);
return 0;
}```
CF932E Team Work.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1000000007;
const int N=5005;
int dp[N][N],n,k,ans,m=2;
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod;
k>>=1;
}
return res;
}
signed main() {
scanf("%lld%lld",&n,&k);
dp[0][0]=1;
for(int i=1;i<=k;++i)
for(int j=1;j<=i;++j)
dp[i][j]=(dp[i-1][j]*j+dp[i-1][j-1]*(n-j+1))%mod;
for(int i=0;i<=k;++i)
ans=(ans+1ll*dp[k][i]*qpow(qpow(2,mod-2),i))%mod;
ans=1ll*ans*qpow(2,n)%mod;
printf("%lld\n",ans);
return 0;
}```
CF778C Peterson Polyglot.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=600005;
int ch[N][26],n,cnt[N],tot,ans,id;
int merge(int x,int y){
if(!x||!y)return x|y;
int u=++tot;
rep(i,0,25)ch[u][i]=merge(ch[x][i],ch[y][i]);
return u;
}
void dfs(int u,int dep){
if(!u)return;
tot=n;int x=++tot;
rep(i,0,25)x=merge(x,ch[u][i]);
cnt[dep]+=tot-n-1;
rep(i,0,25)dfs(ch[u][i],dep+1);
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
rep(i,2,n){
char c;int x,y;
cin>>x>>y>>c,ch[x][c-'a']=y;
}
dfs(1,1),ans=N;
rep(i,1,n)if(ckmin(ans,n-cnt[i]))id=i;
cout<<ans<<'\n'<<id<<'\n';
}```
CF1363D Guess The Maximums.cpp
```#include <bits/stdc++.h>
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1009
int n,k,Max,book[N];
char s[10];
std::vector<int>v[N],ans;
void ask(int l,int r) {
printf("? %d",r-l+1);
for(int i=l;i<=r;++i)printf(" %d",i);
puts("");
fflush(stdout);
}
void ask(std::vector<int>v) {
printf("? %d",(int)v.size());
for(int i:v)printf(" %d",i);
puts("");
fflush(stdout);
}
void Main() {
n=rd(),k=rd();
for(int i=1;i<=k;++i) {
int m=rd();
for(int j=1;j<=m;++j)v[i].push_back(rd());
}
ask(1,n);
Max=rd();
int l=1,r=n,res=1;
while(l<=r) {
int mid=(l+r)>>1,k;
ask(l,mid),k=rd();
if(k<Max)l=mid+1;
else res=mid,r=mid-1;
}
for(int i=1;i<=k;++i) {
int flg=0;
for(int j:v[i])if(j==res) {
std::vector<int>tmp;
for(int l:v[i])book[l]=1;
for(int l=1;l<=n;++l)if(!book[l])tmp.push_back(l);
flg=1;ask(tmp);ans.push_back(rd());
for(int l:v[i])book[l]=0;
}
if(!flg)ans.push_back(Max);
}
printf("!");
for(int i:ans)printf(" %d",i);
puts("");
fflush(stdout);
scanf("%s",s);
for(int i=1;i<=k;++i)v[i].clear();
ans.clear();
}
signed main() {
for(int T=rd();T;--T)Main();
}```
CF1017D The Wu.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline int read2(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*2+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int s[N];
int n,m,q,w[N],tot;
int id[5005],cnt[5005];
int mem[5000][105];
void calc(int t){
id[t]=++tot;
for(int i=0;i<1<<n;++i){
if(!cnt[i])continue;
int sum=0;
rep(j,0,n-1)if((i>>j&1)==(t>>j&1))sum+=w[j];
if(sum<=100)mem[t][sum]+=cnt[i];
}
rep(i,1,100)mem[t][i]+=mem[t][i-1];
}
signed main(){
n=read(),m=read(),q=read();
per(i,n-1,0)w[i]=read();
rep(i,1,m)s[i]=read2(),++cnt[s[i]];
rep(i,1,q){
int t=read2(),k=read();
if(!id[t])calc(t);
printf("%d\n",mem[t][k]);
}
return 0;
}
/*
2 4 5
40 20
01
01
10
11
00 20
00 40
11 20
11 40
11 60
*/```
CF1190B Tokitsukaze, CSL and Stone Game.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define db double
#define N 100005
inline bool down(int&x,const int y){
return x>y?x=y,1:0;
}
int n,a[N],cnt,ans;
int main(){
std::ios::sync_with_stdio(0),std::cin.tie(0),std::cout.tie(0);
std::cin>>n;
rep(i,1,n)std::cin>>a[i];
std::sort(a+1,a+n+1);
rep(i,1,n-1)
if(a[i]==a[i+1]){
if(a[i])++cnt,--a[i];
else return std::cout<<"cslnb\n",0;
}
if(cnt>1)return std::cout<<"cslnb\n",0;
rep(i,1,n-1)if(a[i]==a[i+1])return std::cout<<"cslnb\n",0;
rep(i,1,n)cnt+=a[i]-i+1;
if(cnt&1)std::cout<<"sjfnb\n";
else std::cout<<"cslnb\n";
}```
CF1295C Obtain The String.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int T,n,m,ans;
bool flag;
const int N=100010;
char s[N],t[N];
vector<int>v[26];
int main() {
T=rd();
while(T--) {
ans=flag=0;scanf("%s%s",s+1,t+1);
n=strlen(s+1),m=strlen(t+1);
for(rint i=0;i<26;++i)v[i].clear();
for(rint i=1;i<=n;++i)v[s[i]-'a'].push_back(i);
for(rint i=1,lst=0,tmp;i<=m;++i) {
tmp=t[i]-'a';
if(v[tmp].empty()) {flag=1;break;}
if(v[tmp].back()<=lst)++ans,lst=v[tmp].front();
else lst=v[tmp][upper_bound(v[tmp].begin(),v[tmp].end(),lst)-v[tmp].begin()];
}
if(flag)puts("-1");
else printf("%d\n",ans+1);
}
return 0;
}```
P4724 【模板】三维凸包.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=2010;
const double eps=1e-9;
double randeps() {return (rand()/(double)RAND_MAX-0.5)*eps;}
struct vec {
double x,y,z;
vec(){x=y=z=0;}
vec(double x_,double y_,double z_){x=x_,y=y_,z=z_;}
void shake() {x+=randeps(),y+=randeps(),z+=randeps();}
double len() {return sqrt(x*x+y*y+z*z);}
vec operator + (const vec &t) {return vec(x+t.x,y+t.y,z+t.z);}
vec operator - (const vec &t) {return vec(x-t.x,y-t.y,z-t.z);}
}p[N];
double dot(const vec &a,const vec &b) {return a.x*b.x+a.y*b.y+a.z*b.z;}
vec crs(const vec &a,const vec &b) {return vec(a.y*b.z-a.z*b.y,a.z*b.x-a.x*b.z,a.x*b.y-a.y*b.x);}
struct face {
int v[3];
face(){v[0]=v[1]=v[2]=0;}
face(int a,int b,int c) {v[0]=a,v[1]=b,v[2]=c;}
vec normal() {return crs(p[v[1]]-p[v[0]],p[v[2]]-p[v[0]]);}
double area() {return normal().len()/2.0;}
}cv[N],h[N];
int cansee(face A,vec b) {return dot(b-p[A.v[0]],A.normal())>0;}
int n,th,cnt,vis[N][N];
double ans;
void convex() {
cnt=th=0;
cv[++cnt]=face(1,2,3);
cv[++cnt]=face(3,2,1);
for(rint i=4;i<=n;++i) {
for(rint j=1,v;j<=cnt;++j) {
if(!(v=cansee(cv[j],p[i])))h[++th]=cv[j];
for(rint k=0;k<3;++k)
vis[cv[j].v[k]][cv[j].v[k>1?0:k+1]]=v;
}
for(rint j=1;j<=cnt;++j)
for(rint k=0;k<3;++k) {
int x=cv[j].v[k],y=cv[j].v[k>1?0:k+1];
if(vis[x][y]&&!vis[y][x])h[++th]=face(x,y,i);
}
for(rint j=1;j<=th;++j)cv[j]=h[j];
cnt=th,th=0;
}
}
void calc() {for(rint i=1;i<=cnt;++i)ans+=cv[i].area();}
signed main() {
srand(time(0));
n=rd();
for(rint i=1;i<=n;++i)
scanf("%lf%lf%lf",&p[i].x,&p[i].y,&p[i].z),p[i].shake();
convex();calc();
printf("%.3lf\n",ans);
return 0;
}
```
CF987A Infinity Gauntlet.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
map<string,string>mp;
map<string,bool>mp2;
int n,m;
signed main() {
mp["purple"]="Power";
mp["green"]="Time";
mp["blue"]="Space";
mp["orange"]="Soul";
mp["red"]="Reality";
mp["yellow"]="Mind";
n=rd(),m=6;
string s;
for(int i=1;i<=n;++i)cin>>s,mp2[s]=1,--m;
cout<<m<<endl;
for(auto i:mp)if(!mp2[i.first])cout<<i.second<<endl;
return 0;
}```
CF436E Cardboard Box.cpp
```#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1; char c = getchar();
while (!isdigit(c)) { if (c == '-') f = 0; c = getchar();}
while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
return f ? x : -x;
}
#define fi first
#define se second
#define N 600005
#define inf 2000000009
int n, a[N], b[N], ans[N], w;
long long sum;
struct node {
int v, id;
node(){v = id = -1;}
node(int v_, int i_){v = v_, id = i_;}
inline bool operator < (const node&t)const{return v > t.v;}
};
priority_queue<node>pq[2];
bool vis[N];
signed main() {
n = read(), w = read();
for (int i = 1; i <= n; ++ i) {
a[i] = read(), a[i + n] = read();
pq[0].push(node(a[i], i)), pq[1].push(node(a[i + n], i));
a[i + n] -= a[i];
}
for (int i = 1; i <= w; ++ i) {
while (!pq[0].empty() && vis[pq[0].top().id]) pq[0].pop();
while (!pq[1].empty() && vis[pq[1].top().id]) pq[1].pop();
int t = pq[0].top().id; pq[0].pop();
while (!pq[0].empty() && vis[pq[0].top().id]) pq[0].pop();
if (i < w && !pq[1].empty() && a[t] + pq[0].top().v >= pq[1].top().v) pq[0].push(node(a[t], t)), t = pq[1].top().id, pq[1].pop();
if (t <= n) pq[0].push(node(a[t + n], t + n));
sum += a[t], vis[t] = 1, ++ans[(t - 1) % n + 1];
}
printf("%lld\n", sum);
for (int i = 1; i <= n; ++ i) printf("%d", ans[i]);
puts("");
}```
CF959F Mahmoud and Ehab and yet another xor task.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=1000000007;
const int N=100010;
int n,m,d[30],a[N],ans[N],sum,lst;
struct node{
int l,x,id;
}q[N];
bool cmp(const node &a,const node &b) {
return a.l<b.l;
}
void add(int x) {
for(rint i=20;i>=0;--i) {
if(x&(1<<i)) {
if(d[i])x^=d[i];
else {
d[i]=x,++sum;break;
}
}
}
}
int qpow(int n,int k,int mod) {
int res=1;
while(k) {
if(k&1)res=1ll*res*n%mod;
n=1ll*n*n%mod,k>>=1;
}
return res;
}
int query(int x) {
for(rint i=20;i>=0;--i)
if(x&(1<<i)) {
if(d[i])x^=d[i];
else return 0;
}
return qpow(2,lst-sum,mod);
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1;i<=m;++i)q[i].l=rd(),q[i].x=rd(),q[i].id=i;
sort(q+1,q+m+1,cmp);
for(rint i=1;i<=m;++i) {
while(lst<q[i].l)add(a[++lst]);
ans[q[i].id]=query(q[i].x);
}
for(rint i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
CF1336C Kaavi and Magic Spell.cpp
```//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=3010;
const int mod=998244353;
int dp[N][N];
char s[N],t[N];
int n,m,ans;
signed main() {
scanf("%s%s",s+1,t+1);
n=strlen(s+1),m=strlen(t+1);
for(rint i=1;i<=n;++i)dp[i][i]=(i>m||s[1]==t[i])?2:0;
for(rint len=2;len<=n;++len) {
for(rint l=1;l<=n;++l) {
int r=l+len-1;
if(r>n)break;
if(l>m||s[len]==t[l])dp[l][r]=(dp[l][r]+dp[l+1][r])%mod;
if(r>m||s[len]==t[r])dp[l][r]=(dp[l][r]+dp[l][r-1])%mod;
}
}
for(rint i=m;i<=n;++i)ans=(ans+dp[1][i])%mod;
printf("%d\n",ans);
return 0;
}```
P6857 梦中梦与不再有梦.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
signed main(){
for(int T=read();T;--T){
int n=read();
if(n&1)printf("%lld\n",1ll*n*(n-1)/2);
else printf("%lld\n",1ll*n*(n-1)/2-n/2+1);
}
}```
CF547E Mike and Friends.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 200005
#define Q 500005
int n,q,ans[Q],tot,ch[N][26],fail[N];
int dfn[N],ed[N],tmr,to[N],tr[N];
string str[N];
struct node{
int op,pos,id;
node(){op=pos=id=0;}
node(int o_,int p_,int i_){op=o_,pos=p_,id=i_;}
};
vector<node>v[N];
vector<int>e[N];
void insert(string str,int id){
int u=0;
for(int i=0;i<sz(str);++i){
int c=str[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
to[id]=u;
}
void build_fail(){
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=tot;++i)e[fail[i]].pb(i);
}
void dfs(int u){
dfn[u]=++tmr;
for(int v:e[u])dfs(v);
ed[u]=tmr;
}
void add(int x,int d){for(int i=x;i<=tmr;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
int ask(int l,int r){return ask(r)-ask(l-1);}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n>>q;
for(int i=1;i<=n;++i)
cin>>str[i],insert(str[i],i);
build_fail(),dfs(0);
for(int i=1;i<=q;++i){
int l,r,k;cin>>l>>r>>k;
v[l-1].pb(node(-1,k,i)),v[r].pb(node(1,k,i));
}
for(int i=1;i<=n;++i){
for(int u=0,j=0;j<sz(str[i]);++j)
u=ch[u][str[i][j]-'a'],add(dfn[u],1);
for(node j:v[i])
ans[j.id]+=j.op*ask(dfn[to[j.pos]],ed[to[j.pos]]);
}
for(int i=1;i<=q;++i)cout<<ans[i]<<'\n';
}```
CF629E Famil Door and Roads.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n, m, dis[N];
LL f[N], g[N], s[N];
int head[N], num_edge;
struct edge{int nxt, to; } e[N << 1];
void addedge(int fr, int to) {
++num_edge;
e[num_edge].nxt = head[fr];
e[num_edge].to = to;
head[fr] = num_edge;
}
namespace Tree {
int siz[N], top[N], fa[N], son[N], dep[N];
void dfs1(int u, int ft) {
siz[u] = 1;
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == ft) continue;
fa[v] = u, dep[v] = dep[u] + 1, dfs1(v, u), siz[u] += siz[v];
if (siz[v] > siz[son[u]]) son[u] = v;
}
}
void dfs2(int u, int tp) {
top[u] = tp;
if (son[u]) dfs2(son[u], tp);
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == fa[u] || v == son[u]) continue;
dfs2(v, v);
}
}
int LCA(int x, int y) {
while (top[x] != top[y]) {
if (dep[top[x]] < dep[top[y]]) x ^= y ^= x ^= y;
x = fa[top[x]];
}
return dep[x] < dep[y] ? x : y;
}
int jump(int x, int anc) {
int res = 0;
while (top[x] != top[anc]) res = top[x], x = fa[top[x]];
return x == anc? res : son[anc];
}
void init(){dfs1(1, 0), dfs2(1, 1); }
}
using Tree::siz;
void dfs1(int u, int ft) {
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == ft) continue;
dis[v] = dis[u] + 1, dfs1(v, u), f[u] += f[v] + siz[v];
}
}
void dfs2(int u, int ft) {
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to; if (v == ft) continue;
s[v] = s[u] + (n - siz[v]) - siz[v], g[v] = s[v] - f[v], dfs2(v, u);
}
}
signed main() {
n = read(), m = read();
for (int i = 1; i < n; ++ i) {
int x = read(), y = read();
addedge(x, y), addedge(y, x);
}
Tree::init(), dfs1(1, 0), s[1] = f[1], dfs2(1, 0);
while (m --) {
int x = read(), y = read(), lca = Tree::LCA(x, y);
if (Tree::dep[x] > Tree::dep[y]) x ^= y ^= x ^= y;
if (x == lca) {
int t = Tree::jump(y, x);
printf ("%.9lf\n", 1. * (f[y] * (n - siz[t]) + g[t] * siz[y])/ (1. * siz[y] * (n - siz[t]))+ 1. + dis[y] - dis[t]);
}
else printf ("%.9lf\n", 1. * (f[x] * siz[y] + f[y] * siz[x]) / (1. * siz[x] * siz[y])+ 1. + dis[x] + dis[y] - dis[lca] * 2);
}
return 0;
}```
P4003 无限之环.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 2005 * 4;
const int M = 10 * 2005 * 2;
const int inf = 0x3f3f3f3f;
int n, m, cnt;
int mf, mc, S, T, ND, hed[N], et = 1;
int dis[N], cur[N];
bool inq[N], vis[N];
vector <vector<int> >mp;
int id(int i,int j,int d) { return (d - 1) * n * m + (i - 1) * m + j; }
struct edge {int nx, to, fl, c;}e[M];
inline void addedge(int u, int v, int fl, int c) {
e[++et].nx = hed[u], e[et].to = v, e[et].fl = fl, e[et].c = c, hed[u] = et;
}
inline void adde(int u, int v, int fl, int c) {
addedge(u, v, fl, c), addedge(v, u, 0, -c);
}
bool spfa() {
queue <int> q;
for(int i = 1; i <= ND; ++i) inq[i] = 0, dis[i] = inf, cur[i] = hed[i];
q.push(S), dis[S] = 0;
while(!q.empty()) {
int u = q.front(); q.pop(), inq[u] = 0;
for(int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to;
if(e[i].fl && ckmin(dis[v], dis[u] + e[i].c)) {
if(!inq[v]) q.push(v), inq[v] = 1;
}
}
}
return dis[T] < inf;
}
int dfs(int u, int fl) {
vis[u] = 1;
if(u == T) return fl;
int rl, us = 0;
for(int i = cur[u]; i; i = e[i].nx) {
int v = e[i].to; cur[u] = i;
if(dis[v] == dis[u] + e[i].c && e[i].fl && (v == T || !vis[v])) {
rl = dfs(v, min(fl - us, e[i].fl));
if(rl) e[i].fl -= rl, e[i ^ 1].fl += rl, mc += e[i].c * rl, us += rl;
if(us == fl)break;
}
}
return us;
}
void MCMF(){
mc = mf = 0;
while(spfa()) {
vis[T] = 1;
while(vis[T])
memset(vis, 0, T + 1), mf += dfs(S, inf);
}
}
signed main() {
n = read(), m = read(), mp.resize(n + 1);
S = n * m * 4 + 1, T = S + 1, ND = T;
for(int i = 1; i <= n; ++i){
mp[i].resize(m + 1);
for(int j = 1; j <= m; ++j) mp[i][j] = read();
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if((i + j) & 1) {
if(i > 1) adde(id(i, j, 1), id(i - 1, j, 3), 1, 0);
if(j < m) adde(id(i, j, 2), id(i, j + 1, 4), 1, 0);
if(i < n) adde(id(i, j, 3), id(i + 1, j, 1), 1, 0);
if(j > 1) adde(id(i, j, 4), id(i, j - 1, 2), 1, 0);
}
if(mp[i][j] == 1) {//U
cnt += 1;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(id(i, j, 1), id(i, j, 2), 1, 1);
adde(id(i, j, 1), id(i, j, 3), 1, 2);
adde(id(i, j, 1), id(i, j, 4), 1, 1);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), id(i, j, 1), 1, 1);
adde(id(i, j, 3), id(i, j, 1), 1, 2);
adde(id(i, j, 4), id(i, j, 1), 1, 1);
}
} else if(mp[i][j] == 2) {//R
cnt += 1;
if((i + j) & 1) {
adde(S, id(i, j, 2), 1, 0);
adde(id(i, j, 2), id(i, j, 1), 1, 1);
adde(id(i, j, 2), id(i, j, 3), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 2);
} else {
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 1), id(i, j, 2), 1, 1);
adde(id(i, j, 3), id(i, j, 2), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 2);
}
} else if(mp[i][j] == 4) {//D
cnt += 1;
if((i + j) & 1) {
adde(S, id(i, j, 3), 1, 0);
adde(id(i, j, 3), id(i, j, 1), 1, 2);
adde(id(i, j, 3), id(i, j, 2), 1, 1);
adde(id(i, j, 3), id(i, j, 4), 1, 1);
} else {
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 1), id(i, j, 3), 1, 2);
adde(id(i, j, 2), id(i, j, 3), 1, 1);
adde(id(i, j, 4), id(i, j, 3), 1, 1);
}
} else if(mp[i][j] == 8) {//L
cnt += 1;
if((i + j) & 1) {
adde(S, id(i, j, 4), 1, 0);
adde(id(i, j, 4), id(i, j, 1), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 2);
adde(id(i, j, 4), id(i, j, 3), 1, 1);
} else {
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 1), id(i, j, 4), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 2);
adde(id(i, j, 3), id(i, j, 4), 1, 1);
}
} else if(mp[i][j] == 3) {//UR
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 2), 1, 0);
adde(id(i, j, 1), id(i, j, 3), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 1);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 3), id(i, j, 1), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 1);
}
} else if(mp[i][j] == 6) {//RD
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 3), 1, 0);
adde(id(i, j, 2), id(i, j, 4), 1, 1);
adde(id(i, j, 3), id(i, j, 1), 1, 1);
} else {
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), id(i, j, 2), 1, 1);
adde(id(i, j, 1), id(i, j, 3), 1, 1);
}
} else if(mp[i][j] == 12) {//DL
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 3), 1, 0);
adde(S, id(i, j, 4), 1, 0);
adde(id(i, j, 3), id(i, j, 1), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 1);
} else {
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 1), id(i, j, 3), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 1);
}
} else if(mp[i][j] == 9) {//LU
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 4), 1, 0);
adde(S, id(i, j, 1), 1, 0);
adde(id(i, j, 4), id(i, j, 2), 1, 1);
adde(id(i, j, 1), id(i, j, 3), 1, 1);
} else {
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), id(i, j, 4), 1, 1);
adde(id(i, j, 3), id(i, j, 1), 1, 1);
}
} else if(mp[i][j] == 5) {//DU
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 3), 1, 0);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j ,3), T, 1, 0);
}
} else if(mp[i][j] == 10) {//LR
cnt += 2;
if((i + j) & 1) {
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 4), 1, 0);
} else {
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
}
} else if(mp[i][j] == 7) {//URD
cnt += 3;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 3), 1, 0);
adde(id(i, j, 1), id(i, j, 4), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 2);
adde(id(i, j, 3), id(i, j, 4), 1, 1);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), id(i, j, 1), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 2);
adde(id(i, j, 4), id(i, j, 3), 1, 1);
}
} else if(mp[i][j] == 11) {//URL
cnt += 3;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 4), 1, 0);
adde(id(i, j, 1), id(i, j, 3), 1, 2);
adde(id(i, j, 2), id(i, j, 3), 1, 1);
adde(id(i, j, 4), id(i, j, 3), 1, 1);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 3), id(i, j, 1), 1, 2);
adde(id(i, j, 3), id(i, j, 2), 1, 1);
adde(id(i, j, 3), id(i, j, 4), 1, 1);
}
} else if(mp[i][j] == 13) {//UDL
cnt += 3;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 3), 1, 0);
adde(S, id(i, j, 4), 1, 0);
adde(id(i, j, 1), id(i, j, 2), 1, 1);
adde(id(i, j, 3), id(i, j, 2), 1, 1);
adde(id(i, j, 4), id(i, j, 2), 1, 2);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 2), id(i, j, 1), 1, 1);
adde(id(i, j, 2), id(i, j, 3), 1, 1);
adde(id(i, j, 2), id(i, j, 4), 1, 2);
}
} else if(mp[i][j] == 14) {//LDR
cnt += 3;
if((i + j) & 1) {
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 3), 1, 0);
adde(S, id(i, j, 4), 1, 0);
adde(id(i, j, 2), id(i, j, 1), 1, 1);
adde(id(i, j, 3), id(i, j, 1), 1, 2);
adde(id(i, j, 4), id(i, j, 1), 1, 1);
} else {
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
adde(id(i, j, 1), id(i, j, 2), 1, 1);
adde(id(i, j, 1), id(i, j, 3), 1, 2);
adde(id(i, j, 1), id(i, j, 4), 1, 1);
}
} else if(mp[i][j] == 15) {//URDL
cnt += 4;
if((i + j) & 1) {
adde(S, id(i, j, 1), 1, 0);
adde(S, id(i, j, 2), 1, 0);
adde(S, id(i, j, 3), 1, 0);
adde(S, id(i, j, 4), 1, 0);
} else {
adde(id(i, j, 1), T, 1, 0);
adde(id(i, j, 2), T, 1, 0);
adde(id(i, j, 3), T, 1, 0);
adde(id(i, j, 4), T, 1, 0);
}
}
}
}
MCMF();
if(mf * 2 != cnt) puts("-1");
else cout << mc << endl;
return 0;
}```
P2257 YY的GCD.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=10000010;
int pri[N/10],mu[N],sum[N],cnt,vis[N];
LL ans;
void Sieve() {
mu[1]=1;
for(int i=2;i<N;++i) {
if(!vis[i])pri[++cnt]=i,mu[i]=-1;
for(int j=1;j<=cnt&&i*pri[j]<N;++j) {
vis[i*pri[j]]=1;
if(i%pri[j])mu[i*pri[j]]=-mu[i];
else break;
}
}
for(int j=1;j<=cnt;++j)
for(int i=1;i*pri[j]<N;++i)
sum[i*pri[j]]+=mu[i];
for(int i=1;i<N;++i)sum[i]+=sum[i-1];
}
void solve(int n,int m) {
ans=0;
if(n>m)n^=m^=n^=m;
for(int l=1,r;l<=n;l=r+1)
r=min(n/(n/l),m/(m/l)),ans+=1ll*(n/l)*(m/l)*(sum[r]-sum[l-1]);
printf("%lld\n",ans);
}
signed main() {
Sieve();
for(int T=rd();T;--T)solve(rd(),rd());
return 0;
}```
P4606 [SDOI2018]战略游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,m,tot;
namespace Tree{
struct edge{int nx,to;}e[N<<1];
int et,hed[N];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
int bz[20][N],dep[N],dfn[N],tmr,len[N];
void dfs(int u,int ft){
dep[u]=dep[bz[0][u]=ft]+1,dfn[u]=++tmr;
for(int i=1;1<<i<=dep[u];++i)
bz[i][u]=bz[i-1][bz[i-1][u]];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
len[v]=len[u]+(v<=n),dfs(v,u);
}
}
void init(){dfs(1,0);}
int LCA(int x,int y){
if(dep[x]<dep[y])x^=y^=x^=y;
for(int i=19,dta=dep[x]-dep[y];i>=0;--i)
if(dta>>i&1)x=bz[i][x];
if(x==y)return x;
for(int i=19;i>=0;--i)
if(bz[i][x]!=bz[i][y])x=bz[i][x],y=bz[i][y];
return bz[0][x];
}
inline bool cmp(const int&a,const int&b){return dfn[a]<dfn[b];}
void solve(){
static int m,h[N],res,stk[N],top;
m=read(),res=0;
rep(i,1,m)h[i]=read();
sort(h+1,h+m+1,cmp);
stk[top=1]=h[1];
for(int i=2;i<=m;++i){
int lca=LCA(h[i],stk[top]);
while(dep[stk[top-1]]>=dep[lca])res+=len[stk[top]]-len[stk[top-1]],--top;
if(stk[top]!=lca)res+=len[stk[top]]-len[lca],stk[top]=lca;
stk[++top]=h[i];
}
while(--top)res+=len[stk[top+1]]-len[stk[top]];
res+=stk[1]<=n,res-=m;
printf("%d\n",res);
}
void clear(){
memset(hed,0,(tot+1)<<2);
memset(bz,0,sizeof(bz));
et=tmr=0;
}
}
namespace cac{
int dfn[N],low[N],tmr,stk[N],top;
struct edge{int nx,to;}e[N<<1];
int et,hed[N];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void tarjan(int u){
stk[++top]=u,dfn[u]=low[u]=++tmr;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(!dfn[v]){
tarjan(v),ckmin(low[u],low[v]);
if(low[v]==dfn[u]){
++tot,Tree::adde(tot,u),Tree::adde(u,tot);
while(stk[top+1]!=v)
Tree::adde(tot,stk[top]),Tree::adde(stk[top],tot),--top;
}
}else ckmin(low[u],dfn[v]);
}
}
void init(){tot=n,tarjan(1);}
void clear(){
memset(low,0,(n+1)<<2);
memset(dfn,0,(n+1)<<2);
memset(hed,0,(n+1)<<2);
memset(stk,0,(n+1)<<2);
top=et=tmr=0;
}
}
void Main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
cac::adde(x,y),cac::adde(y,x);
}
cac::init(),Tree::init();
for(int q=read();q;--q)Tree::solve();
cac::clear(),Tree::clear();
}
signed main(){for(int T=read();T;--T)Main();}```
CF375D Tree and Queries.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=320;
int n,m,c[N],S,lsh[N],len;
int head[N],num_edge;
int ld[N],rd[N],timer,rev[N];
int bin[N],ans[N],sum[M],a[N],L[N],R[N],bel[N],num;
struct edge{
int nxt,to;
}e[N<<1];
struct ASK {
int id,l,r,k;
inline bool operator < (const ASK&rhs)const{return bel[l]!=bel[rhs.l]?l<rhs.l:bel[l]&1?r<rhs.r:r>rhs.r;}
}q[N];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u,int ft){
ld[u]=++timer,rev[timer]=u;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==ft)continue;
dfs(v,u);
}
rd[u]=timer;
}
void upd(int x,int d){
a[x]+=d,sum[bel[x]]+=d;
}
int ask(int l,int r){
if(l>r)return 0;
int res=0;
if(bel[l]==bel[r]){
for(int i=l;i<=r;++i)res+=a[i];
return res;
}
for(int i=l;i<=R[bel[l]];++i)res+=a[i];
for(int i=L[bel[r]];i<=r;++i)res+=a[i];
for(int i=bel[l]+1;i<bel[r];++i)res+=sum[i];
return res;
}
void add(int x){upd(bin[x],-1),++bin[x],upd(bin[x],1);}
void pop(int x){upd(bin[x],-1),--bin[x],upd(bin[x],1);}
signed main() {
n=read(),m=read(),S=sqrt(n)+1,num=(n-1)/S+1;
for(int i=1;i<=n;++i)c[i]=lsh[i]=read();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
for(int i=1;i<=n;++i)c[i]=lower_bound(lsh+1,lsh+len+1,c[i])-lsh;
for(int i=1;i<=num;++i)L[i]=R[i-1]+1,R[i]=i*S;
R[num]=n;
for(int i=1;i<=num;++i)
for(int j=L[i];j<=R[i];++j)
bel[j]=i;
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
dfs(1,0);
for(int i=1;i<=m;++i) {
int u=read(),k=read();
q[i].l=ld[u],q[i].r=rd[u],q[i].k=k,q[i].id=i;
}
sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i) {
while(l>q[i].l)add(c[rev[--l]]);
while(r<q[i].r)add(c[rev[++r]]);
while(l<q[i].l)pop(c[rev[l++]]);
while(r>q[i].r)pop(c[rev[r--]]);
ans[q[i].id]=ask(q[i].k,n);
}
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}
```
CF1111B Average Superhero Gang Power.cpp
```#include<bits/stdc++.h>
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100009
int n,k,m,a[N];
typedef long long LL;
LL s[N];
typedef double db;
db ans;
signed main() {
n=rd(),k=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd();
std::sort(a+1,a+n+1),std::reverse(a+1,a+n+1);
for(int i=1;i<=n;++i)s[i]=s[i-1]+a[i];
for(int i=n;i>=1&&n-i<=m;--i)
ans=std::max(ans,1.*(s[i]+std::min(1ll*(m-(n-i)),1ll*k*i))/i);
printf("%.10lf\n",ans);
return 0;
}```
CF1307C Cow and Message.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long ll;
const int N=100010;
char s[N];
int n,sum[N][26],a[N];
ll ans;
signed main() {
scanf("%s",s+1);
n=strlen(s+1);
for(rint i=1;i<=n;++i)a[i]=s[i]-'a';
for(rint i=1;i<=n;++i) {
sum[i][a[i]]=sum[i-1][a[i]]+1;
for(rint j=0;j<26;++j)
if(j!=a[i])sum[i][j]=sum[i-1][j];
}
for(rint i=0;i<26;++i)
ans=max(ans,1ll*sum[n][i]);
for(rint i=0;i<26;++i)
for(rint j=0;j<26;++j) {
ll t=0;
for(rint k=1;k<=n;++k) {
if(a[k]==i)t+=sum[n][j]-sum[k][j];
}
ans=max(ans,t);
}
printf("%lld\n",ans);
return 0;
}```
CF1260D A Game with Traps.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int m,n,k,t,a[N];
struct node{
int l,r,d;
}s[N];
bool cmp1(const int &a,const int &b) {
return a>b;
}
bool pd(int x) {
int dif[N]={0},sum=0;
for(int i=1;i<=k;++i)
if(s[i].d>a[x])++dif[s[i].l],--dif[s[i].r+1];
for(int i=1;i<=n;++i) {
dif[i]+=dif[i-1];
if(dif[i])sum+=3;
else ++sum;
}
return sum<=t;
}
int main() {
scanf("%d%d%d%d",&m,&n,&k,&t);++n;
for(int i=1;i<=m;++i)
scanf("%d",&a[i]);
for(int i=1;i<=k;++i)
scanf("%d%d%d",&s[i].l,&s[i].r,&s[i].d);
a[0]=100000007;
sort(a+1,a+m+1,cmp1);
int l=0,r=m,res;
while(l<=r) {
int mid=(l+r)>>1;
if(pd(mid))l=mid+1,res=mid;
else r=mid-1;
}
printf("%d\n",res);
return 0;
}```
P3185 [HNOI2007]分裂游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=25;
int n,a[N],sg[N],tag[N*N];
void Main(){
int ans=0;
n=read();per(i,n,1)a[i]=read();
per(i,n,1)if(a[i]&1)ans^=sg[i];
if(!ans)puts("-1 -1 -1\n0");
else{
int sum=0,x=-1,y=-1,z=-1;
per(i,n,1)per(j,i-1,1)per(k,j,1)if((ans^sg[i]^sg[j]^sg[k])==0){
++sum;
if(!~x)x=n-i,y=n-j,z=n-k;
}
printf("%d %d %d\n%d\n",x,y,z,sum);
}
}
void init(){
sg[1]=0;
rep(i,2,21){
rep(j,1,i)rep(k,j,i-1)tag[sg[j]^sg[k]]=i;
rep(j,0,624)if(tag[j]!=i){sg[i]=j;break;}
}
}
signed main(){init();for(int T=read();T;--T)Main();}
/*
2
4
1 0 1 5000
3
0 0 1
*/```
CF896D Nephren Runs a Cinema.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
#define int long long
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,p,l,r,ans;
int pri[15],cnt,jc[N],jv[N],t[N][15];
int phi(int x) {
int res=x;
for(rint i=2;i*i<=x;++i) {
if(x%i)continue;
res-=res/i;
while(x%i==0)x/=i;
}
if(x>1)res-=res/x;
return res;
}
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=res*n%p;
n=n*n%p,k>>=1;
}
return res;
}
void init() {
int tmp=p;
for(rint i=2;i*i<=tmp;++i) {
if(tmp%i)continue;
pri[++cnt]=i;
while(tmp%i==0)tmp/=i;
}
if(tmp>1)pri[++cnt]=tmp;
jc[0]=jv[0]=jc[1]=jv[1]=1;
int P=phi(p);
for(rint i=2;i<=n;++i) {
int x=i;
for(rint j=1;j<=cnt;++j) {
t[i][j]=t[i-1][j];
while(x%pri[j]==0)++t[i][j],x/=pri[j];
}
jc[i]=jc[i-1]*x%p,jv[i]=qpow(jc[i],P-1);
}
}
int C(int n,int m) {
if(m>n||m<0)return 0;
if(m==0)return 1;
int res=jc[n]*jv[m]%p*jv[n-m]%p;
for(rint i=1;i<=cnt;++i)
res=res*qpow(pri[i],t[n][i]-t[m][i]-t[n-m][i])%p;
return res;
}
signed main() {
n=rd(),p=rd(),l=rd(),r=rd();
init();
for(rint i=0;i<=n-l;++i)
ans=(ans+C(n,i)*(C(n-i,(n-i-l)>>1)-C(n-i,(n-i-r-1)>>1)+p)%p)%p;
printf("%lld\n",ans);
return 0;
}```
P3241 [HNOI2015]开店.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=150010;
struct edge {
int nxt,to,val;
}e[N<<1];
int n,Q,A,X[N];
LL ans,ST[20][N<<1],dis[N];
int lg[N<<1],dfn[N],pw2[30],timer;
int head[N],num_edge;
int mx[N],root,siz[N],totsize,used[N],RT;
int vt[N];
struct node {
int x;LL p[3];
node(){}
node(int a,LL b=0,LL c=0,LL d=0){x=a,p[0]=b,p[1]=c,p[2]=d;}
bool operator < (const node &rhs)const{return x<rhs.x;}
node operator + (const node &rhs)const{return node(x,p[0]+rhs.p[0],p[1]+rhs.p[1],p[2]+rhs.p[2]);}
node operator - (const node &rhs)const{return node(x,p[0]-rhs.p[0],p[1]-rhs.p[1],p[2]-rhs.p[2]);}
};
vector<node>q[N];
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void dfs_ST(int u) {
dfn[u]=++timer,ST[0][timer]=dis[u];
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;if(dfn[v])continue;
dis[v]=dis[u]+e[i].val,dfs_ST(v),++timer,ST[0][timer]=dis[u];
}
}
void init_ST() {
dfs_ST(1),lg[0]=-1,pw2[0]=1;
for(int i=1;i<=(n<<1);++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=21;++i)pw2[i]=pw2[i-1]<<1;
for(int i=1;i<=lg[n<<1];++i)
for(int j=1;j<=(n<<1)-pw2[i]+1;++j)
ST[i][j]=min(ST[i-1][j],ST[i-1][j+pw2[i-1]]);
}
int Dis(int x,int y) {
if(dfn[x]>dfn[y])x^=y^=x^=y;int l=dfn[x],r=dfn[y],t=lg[r-l+1];
return dis[x]+dis[y]-(min(ST[t][l],ST[t][r-pw2[t]+1])<<1);
}
void getrt(int u,int ft) {
mx[u]=0,siz[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||used[v])continue;
getrt(v,u);
siz[u]+=siz[v],mx[u]=max(mx[u],siz[v]);
}
mx[u]=max(mx[u],totsize-siz[u]);
if(mx[u]<mx[root])root=u;
}
void dfs(int u,int ft,int rt) {
q[rt].pb(node(X[u],1,Dis(u,rt),vt[rt]?Dis(u,vt[rt]):0));
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||used[v])continue;
dfs(v,u,rt);
}
}
void divide(int u) {
used[u]=1,dfs(u,0,u),q[u].pb(node(-1));
sort(q[u].begin(),q[u].end());
for(uint i=1;i<q[u].size();++i)q[u][i]=q[u][i]+q[u][i-1];
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(used[v])continue;
totsize=siz[v],root=0;
getrt(v,u);
vt[root]=u;
divide(root);
}
}
typedef vector<node>::iterator IT;
node fyyAKIOI(int u,int l,int r) {
IT itr=upper_bound(q[u].begin(),q[u].end(),node(r));--itr;
IT itl=upper_bound(q[u].begin(),q[u].end(),node(l-1));--itl;
return *itr-*itl;
}
LL query(int u,int l,int r) {
LL res=0;
for(int p=u;p;p=vt[p]) {
node t=fyyAKIOI(p,l,r);
res+=t.p[1];
if(vt[p])res-=t.p[0]*Dis(u,vt[p])+t.p[2];
res+=t.p[0]*Dis(u,p);
}
return res;
}
signed main() {
n=rd(),Q=rd(),A=rd();
for(int i=1;i<=n;++i)X[i]=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
init_ST();
totsize=mx[root=0]=n,getrt(1,0),divide(RT=root);
while(Q--) {
int u=rd(),a=rd(),b=rd(),l=(a+ans)%A,r=(b+ans)%A;
if(l>r)l^=r^=l^=r;printf("%lld\n",ans=query(u,l,r));
}
return 0;
}
```
CF1062E Company.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
int n,q,fa[N],mi[18][N],mx[18][N],lca[18][N],lg[N],pw2[30];
int siz[N],son[N],dep[N],top[N],dfn[N],tmr;
struct edge{int nxt,to;}e[N];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs1(int u,int ft){
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int LCA(int x,int y){
if(!x||!y)return x|y;
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
int ask_min(int l,int r){
int x=lg[r-l+1],t=r-pw2[x]+1;
return dfn[mi[x][l]]<dfn[mi[x][t]]?mi[x][l]:mi[x][t];
}
int ask_max(int l,int r){
int x=lg[r-l+1],t=r-pw2[x]+1;
return dfn[mx[x][l]]<dfn[mx[x][t]]?mx[x][t]:mx[x][l];
}
int ask_LCA(int l,int r){
if(l>r)return 0;
int x=lg[r-l+1],t=r-pw2[x]+1;
return LCA(lca[x][l],lca[x][t]);
}
signed main(){
n=read(),q=read();
for(int i=2;i<=n;++i)addedge(fa[i]=read(),i);
dfs1(1,0),dfs2(1,1);
pw2[0]=1;for(int i=1;i<=20;++i)pw2[i]=pw2[i-1]<<1;
lg[0]=-1;for(int i=1;i<=n;++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=n;++i)mx[0][i]=mi[0][i]=lca[0][i]=i;
for(int i=1;i<=lg[n];++i)
for(int j=1;j+pw2[i]-1<=n;++j){
int t=j+pw2[i-1];
if(dfn[mx[i-1][j]]<dfn[mx[i-1][t]])mx[i][j]=mx[i-1][t];
else mx[i][j]=mx[i-1][j];
if(dfn[mi[i-1][j]]<dfn[mi[i-1][t]])mi[i][j]=mi[i-1][j];
else mi[i][j]=mi[i-1][t];
lca[i][j]=LCA(lca[i-1][j],lca[i-1][t]);
}
while(q--){
int l=read(),r=read(),p=lg[r-l+1],t=r-pw2[p]+1;
int idx=ask_min(l,r),idy=ask_max(l,r);
int x=LCA(ask_LCA(l,idx-1),ask_LCA(idx+1,r)),y=LCA(ask_LCA(l,idy-1),ask_LCA(idy+1,r));
dep[x]>dep[y]?printf("%d %d\n",idx,dep[x]):printf("%d %d\n",idy,dep[y]);
}
return 0;
}```
P2765 魔术球问题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int LIM=2000;
const int FYYAKKAKK=LIM+5;
const int N=(FYYAKKAKK+5)*2;
const int M=(60*FYYAKKAKK+2*FYYAKKAKK+FYYAKKAKK*sqrt(LIM))*2;
const int inf=0x3f3f3f3f;
int n,m,id[N];
int dep[N],ND,S,T,mf;
int hed[N],et=1,cur[N];
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
vector<int>vc[55];
inline bool bfs(){
queue<int>q;
for(int i=1;i<=ND;++i)cur[i]=hed[i],dep[i]=0;
q.push(S),dep[S]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dep[v])
dep[v]=dep[u]+1,q.push(v);
}
}
return dep[T]>0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int us=0,rl;
for(int i=cur[u];i&&us<fl;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dep[v]==dep[u]+1){
rl=dfs(v,min(e[i].fl,fl-us));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,us+=rl;
}
}
return us;
}
signed main(){
n=read();
S=LIM*2+1,T=S+1,ND=T;
for(int i=1,now=0;;++i){
adde(S,i,1),adde(i+LIM,T,1);
for(int j=1;j*j-i<i;++j)
if(j*j-i>0)adde(j*j-i,i+LIM,1);
while(bfs())mf+=dfs(S,inf);
if(mf==i-now){
for(int j=hed[i+LIM];j;j=e[j].nx){
if(e[j].fl&&e[j].to<=i)id[i]=id[e[j].to],vc[id[e[j].to]].pb(i);
}
}else{
++now;
if(now>n){
printf("%d\n",i-1);
break;
}
vc[now].pb(i),id[i]=now;
}
}
for(int i=1;i<=n;++i){
for(int j=0,up=sz(vc[i]);j<up;++j)printf("%d ",vc[i][j]);
puts("");
}
}```
CF896E Welcome home, Chtholly.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline int min(const int &a,const int &b) {return a<b?a:b;}
inline int max(const int &a,const int &b) {return a>b?a:b;}
const int N=100010;
const int M=330;
const int D=100000;
int n,m,a[N],b[N],l[M],r[M],len,mx[M],tag[M],blo[M][N],fa[N],bel[N],sum[N];
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
void build(int p) {
for(rint i=l[p];i<=r[p];++i)
a[i]=b[find(i)],blo[p][a[i]]=0,fa[i]=i,sum[i]=1;
for(rint i=l[p];i<=r[p];++i) {
if(!blo[p][a[i]])blo[p][a[i]]=i,b[i]=a[i];
else sum[blo[p][a[i]]]+=sum[i],fa[i]=blo[p][a[i]];
}
while(!blo[p][mx[p]])--mx[p];
}
void change(int p,int x,int y,int v) {
for(rint i=l[p];i<=r[p];++i)
a[i]=b[find(i)],blo[p][a[i]]=0;
for(rint i=x;i<=y;++i)
if(b[find(i)]-tag[p]>v)a[i]-=v;
for(rint i=l[p];i<=r[p];++i)
b[i]=a[i],fa[i]=i;
build(p);
}
void update(int L,int R,int V) {
if(bel[L]==bel[R]) {change(bel[L],L,R,V);return;}
change(bel[L],L,r[bel[L]],V);
change(bel[R],l[bel[R]],R,V);
for(rint i=bel[L]+1;i<bel[R];++i) {
if(V>=mx[i]-tag[i])continue;
if(mx[i]-tag[i]<=V*2) {
for(rint j=tag[i]+1+V;j<=mx[i];++j) {
if(blo[i][j]) {
if(!blo[i][j-V])blo[i][j-V]=blo[i][j],b[blo[i][j]]=j-V,blo[i][j]=0;
else fa[blo[i][j]]=blo[i][j-V],sum[blo[i][j-V]]+=sum[blo[i][j]],blo[i][j]=0;
}
}
while(!blo[i][mx[i]])--mx[i];
} else {
for(rint j=tag[i]+1;j<=tag[i]+V;++j) {
if(blo[i][j]) {
if(!blo[i][j+V])blo[i][j+V]=blo[i][j],b[blo[i][j]]=j+V,blo[i][j]=0;
else fa[blo[i][j]]=blo[i][j+V],sum[blo[i][j+V]]+=sum[blo[i][j]],blo[i][j]=0;
}
}
tag[i]+=V;
}
}
}
int query(int L,int R,int V) {
int res=0;
if(bel[L]==bel[R]) {
for(rint i=L;i<=R;++i)
res+=(b[find(i)]-tag[bel[i]]==V);
return res;
}
for(rint i=L;i<=r[bel[L]];++i)
res+=(b[find(i)]-tag[bel[L]]==V);
for(rint i=l[bel[R]];i<=R;++i)
res+=(b[find(i)]-tag[bel[R]]==V);
for(rint i=bel[L]+1;i<bel[R];++i)
if(tag[i]+V<=D)res+=sum[blo[i][tag[i]+V]];
return res;
}
signed main() {
n=rd(),m=rd();len=sqrt(n);
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1;i<=n;++i)
bel[i]=(i-1)/len+1,b[i]=a[i],fa[i]=i;
for(rint i=1;i<=bel[n];++i)
l[i]=(i-1)*len+1,r[i]=min(n,i*len);
for(rint i=1;i<=bel[n];++i)mx[i]=D,build(i);
while(m--) {
int opt=rd(),L=rd(),R=rd(),X=rd();
if(opt==1)update(L,R,X);
else printf("%d\n",query(L,R,X));
}
return 0;
}```
P3649 [APIO2014]回文串.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n;
LL ans;
int fail[N],tr[N][26],len[N],cnt[N],tot,las;
char str[N];
inline int getfail(int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
signed main(){
scanf("%s",str),n=strlen(str);
fail[0]=1,len[0]=0,fail[1]=0,len[1]=-1,tot=1;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=getfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[getfail(fail[f],i)][c];
tr[f][c]=tot;
len[tot]=len[f]+2;
}
las=tr[f][c],++cnt[las];
}
for(int i=tot;i>=1;--i)cnt[fail[i]]+=cnt[i];
for(int i=1;i<=tot;++i)ckmax(ans,1ll*cnt[i]*len[i]);
cout<<ans<<'\n';
}```
P2661 信息传递-1（并查集）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
int n,fa[N],dis[N],ans=1<<28;
int find(int x) {
if(x==fa[x])return x;
int fx=fa[x];
fa[x]=find(fa[x]);
dis[x]+=dis[fx];
return fa[x];
}
void merge(int x,int y) {
int fx=find(x),fy=find(y);
if(fx==fy)ans=min(ans,dis[y]+1);
else fa[fx]=fy,dis[x]=dis[y]+1;
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)fa[i]=i;
for(rint i=1;i<=n;++i)merge(i,rd());
printf("%d\n",ans);
return 0;
}
```
AT2688 [ARC080C] Young Maids.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int inf=0x3f3f3f3f;
int n,a[N],nxt[N];
int lg[N],pw[20];
void init_ST(){
lg[0]=-1;rep(i,1,n)lg[i]=lg[i>>1]+1;
pw[0]=1;rep(i,1,19)pw[i]=pw[i-1]<<1;
}
struct ST_TABLE{
ST_TABLE(){memset(ST,0x3f,sizeof(ST));}
int ST[20][N],id[20][N];
void init(){
rep(i,1,lg[n])rep(j,1,n-pw[i]+1){
const int t=j+pw[i-1];
if(ST[i-1][j]<ST[i-1][t])ST[i][j]=ST[i-1][j],id[i][j]=id[i-1][j];
else ST[i][j]=ST[i-1][t],id[i][j]=id[i-1][t];
}
}
int ask(int l,int r){
if(l>r)return 0;
const int x=lg[r-l+1],t=r-pw[x]+1;
return ST[x][l]<ST[x][t]?id[x][l]:id[x][t];
}
}ST[3];
struct node{
int l,r,v;
node(){l=r=v=0;}
node(int l_,int r_){l=l_,r=r_,v=ST[l&1].ask(l,r);}
inline bool operator < (const node&t)const{
return a[v]<a[t.v];
}
};
set<node>s;
signed main(){
n=read(),init_ST(),a[0]=inf;
rep(i,1,n)ST[i&1].ST[0][i]=ST[2].ST[0][i]=a[i]=read(),ST[i&1].id[0][i]=ST[2].id[0][i]=i;
ST[0].init(),ST[1].init(),ST[2].init();
s.insert(node(1,n));
rep(i,1,n>>1){
node now=*s.begin();s.erase(s.begin());
int l=now.l,r=now.r,id1=now.v,id2=ST[(l&1)^1].ask(id1+1,r);
printf("%d %d ",a[id1],a[id2]);
if(l<=id1-1)s.insert(node(l,id1-1));
if(id1+1<=id2-1)s.insert(node(id1+1,id2-1));
if(id2+1<=r)s.insert(node(id2+1,r));
}
return 0;
}```
P1516 青蛙的约会.cpp
```#include<bits/stdc++.h>
using namespace std;
int x,y,m,n,l,a,b,d,X,Y;
void exgcd(int a,int b,int &d,int &x,int &y) {
if(!b) {
d=a,x=1,y=0;return;
}
exgcd(b,a%b,d,y,x);
y-=a/b*x;
}
signed main() {
scanf("%d%d%d%d%d",&x,&y,&m,&n,&l);
a=x-y,b=n-m;
if(b<0)a*=-1,b*=-1;
exgcd(b,l,d,X,Y);
if(a%d)return puts("Impossible"),0;
printf("%lld\n",(1ll*X*(a/d)%(l/d)+(l/d))%(l/d));
return 0;
} ```
P6278 [USACO20OPEN]Haircut G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int n,a[N],tr[N];
LL now;
vector<int>v[N];
vector<LL>ans;
void add(int x,int d) {
for(int i=x;i<=n+2;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)v[a[i]=rd()].pb(i);
for(int i=1;i<=n;++i)now+=ask(n-a[i]+1),add(n-a[i]+2,1);
memset(tr,0,sizeof(tr));
for(int i:v[n])add(i,1);
for(int i=n-1;i>=0;--i) {
for(int j:v[i])now-=ask(j);
for(int j:v[i])add(j,1);
ans.pb(now);
}
reverse(ans.begin(),ans.end());
for(LL i:ans)printf("%lld\n",i);
return 0;
}
```
AT4144 [ARC098D] Donation.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m,A[N],B[N],C[N],F[N],rt;
LL s[N],dp[N];
bool bok[N];
pair<int,int>D[N];
vector<int>e[N],g[N];
int anc(int x){return x==F[x]?x:F[x]=anc(F[x]);}
void dfs(int u){
s[u]=B[u],dp[u]=114514114514114514;
if(!sz(g[u]))return dp[u]=max(A[u],B[u]),void();
for(int v:g[u])dfs(v),s[u]+=s[v];
for(int v:g[u])ckmin(dp[u],s[u]-s[v]+max(dp[v],(LL)C[u]));
}
signed main(){
n=read(),m=read();
rep(i,1,n)A[i]=read(),B[i]=read(),D[i]=mkp(C[i]=max(A[i]-B[i],0),i),F[i]=i;
rep(i,1,m){
int x=read(),y=read();
e[x].pb(y),e[y].pb(x);
}
sort(D+1,D+n+1);
for(int i=1;i<=n;++i){
int u=D[i].se;
bok[u]=1;
for(int v:e[u]){
if(bok[v]&&u!=anc(v)){
g[u].pb(anc(v)),F[anc(v)]=u;
}
}
}
rt=D[n].se,dfs(rt);
cout<<dp[rt]<<'\n';
return 0;
}
/*
1 0
602436426 445
*/```
P3232 [HNOI2013]游走.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=505;
int n,m,deg[N];
double G[N][N],F[N];
vector<int>g[N];
double ans,fyyAKCTS[N];
struct edge {
int u,v;
}e[N*N];
void Gauss(int n) {
for(int i=1;i<=n;++i) {
int mx=i;
for(int j=i;j<=n;++j)
if(fabs(G[j][i])>fabs(G[mx][i]))mx=j;
for(int j=1;j<=n+1;++j)swap(G[mx][j],G[i][j]);
for(int j=1;j<=n;++j) {
if(i==j)continue;
double div=G[j][i]/G[i][i];
for(int k=i+1;k<=n+1;++k)
G[j][k]-=div*G[i][k];
}
}
for(int i=1;i<=n;++i)F[i]=G[i][n+1]/G[i][i];
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
e[i].u=x,e[i].v=y,g[x].pb(y),g[y].pb(x),++deg[x],++deg[y];
}
for(int u=1;u<n;++u) {
G[u][u]=-1;
for(int v:g[u])if(v!=n)G[u][v]=1./deg[v];
}
G[1][n]=-1;
Gauss(n-1);
for(int i=1;i<=m;++i) {
int u=e[i].u,v=e[i].v;
if(u!=n)fyyAKCTS[i]+=F[u]/deg[u];
if(v!=n)fyyAKCTS[i]+=F[v]/deg[v];
}
sort(fyyAKCTS+1,fyyAKCTS+m+1);
for(int i=1,j=m;i<=m;--j,++i)ans+=1.*j*fyyAKCTS[i];
printf("%.3lf\n",ans);
return 0;
}
```
P1840 Color the Axis.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd(){
int f=1,x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int N=200009;
int n,m,F[N],now;
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
signed main() {
now=n=rd(),m=rd();
for(int i=1;i<=n;++i)F[i]=i;
while(m--) {
int l=rd(),r=find(rd());
while(l<=r) {
F[find(r)]=find(r-1),r=find(r),--now;
}
printf("%d\n",now);
}
return 0;
}```
CF1296B Food Buying.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=2005;
int T,n,ans;
int main()
{
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d",&n);
while(true)
{
int tmp=n/10;
if(!tmp)break;
n-=tmp*10;
ans+=tmp*10;
n+=tmp;
}
printf("%d\n",ans+n);
}
return 0;
} ```
P3254 圆桌问题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=450;
const int M=9e4;
const int inf=0x3f3f3f3f;
int m,n,r[N],c[N];
int hed[N],et=1,S,T,dis[N],cur[N],mf;
vector<int>ans[N];
struct edge{int nx,to,fl,id;}e[M];
void addedge(int u,int v,int fl,int id=0){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,e[et].id=id,hed[u]=et;}
void adde(int u,int v,int fl,int id=0){addedge(u,v,fl,id),addedge(v,u,0,id);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int used=0,rl;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(fl-used,e[i].fl));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
m=read(),n=read(),S=n+m+1,T=S+1;
rep(i,1,m)r[i]=read(),adde(S,i,r[i]),r[0]+=r[i];
rep(i,1,n)c[i]=read(),adde(i+m,T,c[i]);
rep(i,1,m)rep(j,1,n)adde(i,j+m,1,i);
while(bfs(S,T))mf+=dfs(S,T);
if(mf!=r[0])return puts("0"),0;
for(int i=2;i<et;i+=2)
if(e[i^1].fl&&e[i].id)ans[e[i].id].pb(e[i].to-m);
puts("1");
rep(i,1,n){
rep(j,0,r[i]-1)printf("%d ",ans[i][j]);
puts("");
}
return 0;
}```
P3959 宝藏.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=12;
const int inf=0x3f3f3f3f;
int n,m,dis[N][N],dp[N][N][1<<N],ans=inf,rev[1<<N];
signed main(){
n=read(),m=read();
memset(dp,0x3f,sizeof(dp));
memset(dis,0x3f,sizeof(dis));
for(register int i=1;i<=m;++i){
int x=read()-1,y=read()-1,z=read();
if(dis[x][y]>z)dis[x][y]=dis[y][x]=z;
}
for(register int i=0;i<n;++i)
for(register int j=0;j<n;++j)
dp[i][j][1<<i]=0;
for(register int i=0;i<n;++i)rev[1<<i]=i;
for(register int j=n-2;j>=0;--j){
for(register int msk=0;msk<1<<n;++msk){
register int t1=msk,i;
for(;t1;t1^=t1&-t1){
i=rev[t1&-t1];
for(register int mk=msk;mk;mk=(mk-1)&msk){
if(dp[i][j][msk^mk]>=dp[i][j][msk])continue;
register int t2=mk,k;
for(;t2;t2^=t2&-t2){
k=rev[t2&-t2];
if(dis[i][k]!=inf)dp[i][j][msk]=min(dp[i][j][msk],dp[k][j+1][mk]+dp[i][j][msk^mk]+dis[i][k]*(j+1));
}
}
}
}
}
for(int i=0;i<n;++i)
ans=min(ans,dp[i][0][(1<<n)-1]);
printf("%d\n",ans);
return 0;
}```
P5930 [POI1999]降水.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 105
int n,m,a[N][N],now,ans,H;
int F[N*N],siz[N*N];
#define id(x,y) ((x-1)*m+y)
vector<pair<int,int> >v[10005];
#define pb push_back
#define x first
#define y second
#define mkp make_pair
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
void merge(int x,int y){
x=find(x),y=find(y);
if(x==y)return;
if(siz[x]<siz[y])F[x]=y,siz[y]+=siz[x];
else F[y]=x,siz[x]+=siz[y];
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
v[a[i][j]=read()].pb(mkp(i,j)),H=max(H,a[i][j]);
for(int i=1,mx=n*m;i<=mx;++i)F[i]=i,siz[i]=1;
for(int i=1;i<=H;++i){
for(pair<int,int> j:v[i]){
int x=j.x,y=j.y;++now;
if(x==1||x==n||y==1||y==m)merge(id(x,y),0);
if(y>1&&a[x][y-1]<=a[x][y])merge(id(x,y),id(x,y-1));
if(x>1&&a[x-1][y]<=a[x][y])merge(id(x,y),id(x-1,y));
if(y<m&&a[x][y+1]<=a[x][y])merge(id(x,y),id(x,y+1));
if(x<n&&a[x+1][y]<=a[x][y])merge(id(x+1,y),id(x,y));
}
ans+=now-siz[find(0)];
}
printf("%d\n",ans);
return 0;
}```
CF632F Magic Matrix.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2505;
int n,a[N][N],tot;
pair<int,pair<int,int> >b[N*N];
bitset<2505>bs[2505];
signed main(){
n=read();
rep(i,1,n)rep(j,1,n)a[i][j]=read(),b[++tot]=mkp(a[i][j],mkp(i,j));
rep(i,1,n)if(a[i][i])return puts("NOT MAGIC"),0;
rep(i,1,n)rep(j,1,n)if(a[i][j]!=a[j][i])return puts("NOT MAGIC"),0;
sort(b+1,b+tot+1);
for(int i=1;i<=tot;){
int j=i;
while(b[j+1].fi==b[i].fi)++j;
rep(k,i,j){
int x=b[k].se.fi,y=b[k].se.se;
if((bs[x]&bs[y]).any())return puts("NOT MAGIC"),0;
}
rep(k,i,j){
int x=b[k].se.fi,y=b[k].se.se;
bs[x][y]=1;
}
i=j+1;
}
puts("MAGIC");
}```
P2495 [SDOI2011]消耗战.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=250000+9;
const LL inf=1145141919810;
int n,m;
struct edge {
int nxt,to,val;
}e[N<<1];
int head[N],num_edge;
int dfn[N],top[N],fa[N],son[N],dep[N],siz[N],timer;
LL miv[N];
int a[N],stk[N],Top;
bool book[N];
vector<int>g[N];
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
miv[v]=min(miv[u],1ll*e[i].val);
dep[v]=dep[u]+1,dfs1(v,u);
fa[v]=u,siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
dfn[u]=++timer,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int LCA(int x,int y) {
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
inline bool cmp(const int&a,const int&b) {
return dfn[a]<dfn[b];
}
LL dfs(int u) {
LL sum=0,res;
for(int v:g[u])sum+=dfs(v);
res=min(1ll*miv[u],book[u]?inf:sum);
book[u]=0;
vector<int>fyyAKIOI;
g[u].swap(fyyAKIOI);
return res;
}
void query() {
int k=rd();
for(int i=1;i<=k;++i)book[a[i]=rd()]=1;
sort(a+1,a+k+1,cmp);
stk[Top=1]=a[1];
for(int i=2;i<=k;++i) {
int lca=LCA(stk[Top],a[i]);
while("fyy AK IOI") {
if(dep[lca]>=dep[stk[Top-1]]) {
if(lca!=stk[Top]) {
g[lca].push_back(stk[Top]);
if(lca!=stk[Top-1])stk[Top]=lca;
else --Top;
}
break;
} else g[stk[Top-1]].push_back(stk[Top]),--Top;
}
stk[++Top]=a[i];
}
while(--Top)g[stk[Top]].push_back(stk[Top+1]);
printf("%lld\n",dfs(stk[1]));
}
signed main() {
n=rd(),miv[1]=inf;
for(int i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
dfs1(1,0),dfs2(1,0);
m=rd();
while(m--)query();
return 0;
}
```
P1022 计算器的改良.cpp
```#include <bits/stdc++.h>
using namespace std;
int main() {
char k,c;
int a=0,b=0,x=0;
double ans;
int now=1,f=1,r=0;
while(scanf("%c",&c)==1)
{
if(c==10)break;
if(c=='-')
{
b+=now*f*x;
x=0;
f=-1;
r=0;
}
if(c=='+')
{
b+=now*f*x;
f=1;
x=0;
r=0;
}
if(c=='=')
{
b+=now*f*x;
now=-1;
f=1;
x=0;
r=0;
}
if(c>='0'&&c<='9')
{
x=x*10+c-'0';
r=1;
}
if(c>='a'&&c<='z')
{
k=c;
if(r)
{
a+=now*f*x;
x=0;
}
else
{
a+=now*f;
}
}
}
b+=now*f*x;
ans=-b*1.0/a;
if(ans==-0.0)ans=0;
if(a==0&&b!=0)puts("NO SOLUTION");
else if(a==0&&b==0)puts("THE NUM OF SOLUTION IS INF");
else printf("%c=%0.3lf\n",k,ans);
return 0;
}
```
P2467 [SDOI2010]地精部落(dp).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 4500
int n,mod,ans,dp[N][N];
signed main(){
n=read(),mod=read();
dp[1][1]=1;
for(int i=2;i<=n;++i){
for(int j=1;j<=i;++j)
dp[i][j]=(dp[i][j-1]+dp[i-1][i-j+1])%mod;
}
for(int i=1;i<=n;++i)ans=(ans+dp[n][i])%mod;
printf("%d\n",ans*2%mod);
return 0;
}```
P4159 [SCOI2009] 迷路.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define F(i,l,r) for(int i=l;i<=r;++i)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline int rdc() {
char ch=getchar();
while(!isdigit(ch))ch=getchar();
return ch-'0';
}
const int mod=2009;
int n,t,m;
struct Maxtrix {
int a[99][99];
int*operator[](const int&k){return a[k];}
Maxtrix(){memset(a,0,sizeof(a));}
}mp,res,tmp;
int f(int x,int y){return x+y*n;}
signed main() {
m=(n=rd())*9,t=rd();
for(int i=1;i<=n;++i) {
for(int j=1;j<=8;++j)
mp[f(i,j)][f(i,j-1)]=1;
for(int j=1;j<=n;++j) {
int w=rdc();
if(w)mp[i][f(j,w-1)]=1;
}
}
res=mp,--t;
while(t) {
if(t&1){
F(i,1,m)F(j,1,m)tmp[i][j]=0;
F(i,1,m)F(k,1,m)F(j,1,m)tmp[i][j]=(tmp[i][j]+res[i][k]*mp[k][j])%mod;
res=tmp;
}
F(i,1,m)F(j,1,m)tmp[i][j]=0;
F(i,1,m)F(k,1,m)F(j,1,m)tmp[i][j]=(tmp[i][j]+mp[i][k]*mp[k][j])%mod;
mp=tmp;
t>>=1;
}
printf("%d\n",res[1][n]);
return 0;
}```
SP6949 CTOI10D2 - PIN.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50010;
int n,D;
LL ans[5];
char s[N][5];
signed main() {
n=rd(),D=rd();
for(rint i=1;i<=n;++i)scanf("%s",s[i]);
for(rint mask=0;mask<16;++mask) {
int cnt=0;map<int,int>mp;
LL sum=0;
for(rint j=0;j<4;++j)
if((mask>>j)&1)++cnt;
for(rint i=1;i<=n;++i) {
int h=0;
for(rint j=0;j<4;++j)
if((mask>>j)&1)h=h*131+'*';
else h=h*131+s[i][j];
sum+=mp[h],++mp[h];
}
ans[cnt]+=sum;
}
ans[1]-=ans[0];
ans[2]-=ans[0]+3*ans[1];
ans[3]-=ans[0]+3*ans[1]+2*ans[2];
ans[4]-=ans[0]+ans[1]+ans[2]+ans[3];
printf("%lld\n",ans[D]);
return 0;
}
```
CF1178B WOW Factor.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define int long long
const int N=1e6+10;
char s[N];
int sum,ans;
signed main() {
scanf("%s",s+1);int n=strlen(s+1);
s[++n]='o';
for(rint i=1,w=0;i<=n;++i) {
if(s[i]=='v')++w;
else sum+=(w>0?w-1:0),w=0;
}
for(rint i=1,w=0,now=0;i<=n;++i) {
if(s[i]=='v')++w;
else now+=(w>0?w-1:0),w=0,ans+=now*(sum-now);
}
printf("%lld\n",ans);
return 0;
}```
SP104 HIGH - Highways.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=13;
int n,m;
LL a[N][N];
LL Gauss(const int&n){
LL res=1;
rep(i,1,n){
rep(j,i+1,n){
while(a[j][i]){
LL div=a[i][i]/a[j][i];
rep(k,i,n)a[i][k]-=a[j][k]*div,swap(a[i][k],a[j][k]);
res*=-1;
}
}
if(!a[i][i])return 0;
res*=a[i][i];
}
return res;
}
void Main(){
memset(a,0,sizeof(a));
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
++a[x][x],++a[y][y],--a[x][y],--a[y][x];
}
printf("%lld\n",Gauss(n-1));
}
signed main(){for(int T=read();T;--T)Main();}```
P6154 游走.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=700005;
const int mod=998244353;
int n,m;
int sum[N],dp[N],ind[N];
struct edge{
int nxt,to;
}e[M];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void topo(){
queue<int>q;
for(int i=1;i<=n;++i)sum[i]=1;
for(int i=1;i<=n;++i)if(!ind[i])q.push(i);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
fmod(sum[v]+=sum[u]);
fmod(dp[v]+=sum[u]),fmod(dp[v]+=dp[u]);
if(!--ind[v])q.push(v);
}
}
}
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read();
addedge(x,y),++ind[y];
}
topo();
for(int i=1;i<=n;++i)fmod(sum[0]+=sum[i]),fmod(dp[0]+=dp[i]);
printf("%lld\n",1ll*dp[0]*qpow(sum[0],mod-2)%mod);
return 0;
}```
CF242E XOR on Segment.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int LOG=20;
int n,a[N];
struct SegmentTree {
#define lc (p<<1)
#define rc (p<<1|1)
int tag[N<<2],val[N<<2];
void pushup(int p) {
val[p]=val[lc]+val[rc];
}
void flip(int p,int l,int r) {
val[p]=r-l+1-val[p],tag[p]^=1;
}
void pushdown(int p,int l,int r) {
if(!tag[p])return;
int mid=(l+r)>>1;
flip(lc,l,mid),flip(rc,mid+1,r);
tag[p]=0;
}
void update(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return void(flip(p,l,r));
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,lc);
if(qr>mid)update(ql,qr,mid+1,r,rc);
pushup(p);
}
int query(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return val[p];
pushdown(p,l,r);
int mid=(l+r)>>1;LL res=0;
if(ql<=mid)res+=query(ql,qr,l,mid,lc);
if(qr>mid)res+=query(ql,qr,mid+1,r,rc);
return res;
}
}T[LOG];
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=0;i<LOG;++i)
for(int j=1;j<=n;++j)
if(a[j]>>i&1)T[i].update(j,j,1,n,1);
for(int m=rd();m;--m) {
int opt=rd(),l=rd(),r=rd();
if(opt==1) {
LL sum=0;
for(int i=0;i<LOG;++i)sum+=(1ll<<i)*T[i].query(l,r,1,n,1);
printf("%lld\n",sum);
} else {
int x=rd();
for(int i=0;i<LOG;++i)if(x>>i&1)T[i].update(l,r,1,n,1);
}
}
return 0;
}```
P3292 [SCOI2016]幸运数字.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=20010;
int n,q;
LL G[N];
int fa[19][N],dep[N];
struct xxj {
LL d[64];
xxj(){memset(d,0,sizeof(d));}
void ins(LL x) {
for(int i=60;i>=0;--i) {
if(x>>i&1) {
if(d[i])x^=d[i];
else {d[i]=x;break;}
}
}
}
LL ask_max() {
LL res=0;
for(int i=60;i>=0;--i)
if((res^d[i])>res)res^=d[i];
return res;
}
void print() {
for(int i=0;i<=60;++i)
if(d[i])printf("%lld ",d[i]);
puts("");
}
}bz[19][N];
struct edge {
int nxt,to;
}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u,int ft) {
bz[0][u].ins(G[u]);
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
fa[0][v]=u;
dep[v]=dep[u]+1;
dfs(v,u);
}
}
xxj merge(const xxj &a,const xxj &b) {
xxj res=a;
for(int i=60;i>=0;--i)
if(b.d[i])res.ins(b.d[i]);
return res;
}
void init() {
dfs(1,0);
for(int i=1;i<=18;++i)
for(int j=1;j<=n;++j)
fa[i][j]=fa[i-1][fa[i-1][j]],bz[i][j]=merge(bz[i-1][j],bz[i-1][fa[i-1][j]]);
}
LL query(int x,int y) {
xxj res;
if(dep[x]<dep[y])x^=y^=x^=y;
int delta=dep[x]-dep[y];
for(int i=18;i>=0;--i)
if(delta>>i&1)res=merge(res,bz[i][x]),x=fa[i][x];
if(x==y){res.ins(G[x]);return res.ask_max();}
for(int i=18;i>=0;--i)
if(fa[i][x]!=fa[i][y]) {
res=merge(res,bz[i][x]);
res=merge(res,bz[i][y]);
x=fa[i][x],y=fa[i][y];
}
res.ins(G[x]);
res.ins(G[y]);
res.ins(G[fa[0][x]]);
return res.ask_max();
}
signed main() {
n=rd(),q=rd();
for(int i=1;i<=n;++i)scanf("%lld",&G[i]);
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
init();
while(q--) {
int x=rd(),y=rd();
printf("%lld\n",query(x,y));
}
return 0;
}```
CF1355D Game With Array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {
if(ch=='-')f=-1;
ch=getchar();
}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000010;
int n,s;
signed main() {
n=rd(),s=rd();
int res=n<<1;
if(res>s)puts("NO");
else {
puts("YES");
for(rint i=1;i<n;++i)printf("1 ");
printf("%d\n",s-n+1);
printf("%d\n",n);
}
return 0;
}```
CF1025E Colored Cubes.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 55;
int n, m, at[N][N];
struct node {
int x, y, id;
}a[N];
vector<pair<int,int> >ans[2];
inline bool cmp(const node&a, const node&b) {
return a.x < b.x;
}
void move(int id, int i, int dx, int dy) {
int x = a[i].x, y = a[i].y, nx = x + dx, ny = y + dy;
if (at[nx][ny]) move(id, at[nx][ny], dx, dy);
ans[id].pb(mkp(x, y)), ans[id].pb(mkp(nx, ny));
swap(at[x][y], at[nx][ny]);
a[i].x += dx, a[i].y += dy;
}
signed main() {
n = read(), m = read();
for (int t = 0; t < 2; ++ t) {
memset(at, 0, sizeof(at));
for (int i = 1; i <= m; ++ i) a[i].x = read(), a[i].y = read(), a[i].id = i;
sort(a + 1, a + m + 1, cmp);
for (int i = 1; i <= m; ++ i) at[a[i].x][a[i].y] = i;
for (int i = 1; i <= m; ++ i) {
while (a[i].x < i) move(t, i, 1, 0);
while (a[i].x > i) move(t, i, -1, 0);
}
for (int i = 1; i <= m; ++ i) {
while (a[i].y < a[i].id) move(t, i, 0, 1);
while (a[i].y > a[i].id) move(t, i, 0, -1);
}
for (int i = 1; i <= m; ++ i) {
while (a[i].x < a[i].id) move(t, i, 1, 0);
while (a[i].x > a[i].id) move(t, i, -1, 0);
}
}
printf("%d\n",(ans[0].size()+ans[1].size())/2);
for (int i = 0; i < ans[0].size(); i += 2) printf ("%d %d %d %d\n", ans[0][i].first, ans[0][i].second, ans[0][i + 1].first, ans[0][i + 1].second);
reverse(ans[1].begin(),ans[1].end());
for (int i = 0; i < ans[1].size(); i += 2) printf ("%d %d %d %d\n", ans[1][i].first, ans[1][i].second, ans[1][i + 1].first, ans[1][i + 1].second);
return 0;
}
/*
50 49
1 1
1 2
1 3
1 4
1 5
1 6
1 7
2 1
2 2
2 3
2 4
2 5
2 6
2 7
3 1
3 2
3 3
3 4
3 5
3 6
3 7
4 1
4 2
4 3
4 4
4 5
4 6
4 7
5 1
5 2
5 3
5 4
5 5
5 6
5 7
6 1
6 2
6 3
6 4
6 5
6 6
6 7
7 1
7 2
7 3
7 4
7 5
7 6
7 7
50 50
50 49
50 48
50 47
50 46
50 45
50 44
49 50
49 49
49 48
49 47
49 46
49 45
49 44
48 50
48 49
48 48
48 47
48 46
48 45
48 44
47 50
47 49
47 48
47 47
47 46
47 45
47 44
46 50
46 49
46 48
46 47
46 46
46 45
46 44
45 50
45 49
45 48
45 47
45 46
45 45
45 44
44 50
44 49
44 48
44 47
44 46
44 45
44 44
*/```
P4770 [NOI2018]你的名字.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1000005
int n,q,ma[N<<1];
char str[N];
struct Merge_Segment_Tree{
#define T ((N<<1)*20)
int ls[T],rs[T],val[T],tot;
Merge_Segment_Tree(){tot=0;}
void update(int&p,int pos,int k,int l=1,int r=n){
if(!p)p=++tot;
val[p]+=k;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
}
int merge(int x,int y,int l=1,int r=n){
if(!x||!y)return x|y;
if(l==r)return val[x]+=val[y],x;
int p=++tot,mid=(l+r)>>1;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return val[p]=val[ls[p]]+val[rs[p]],p;
}
int query(int p,int ql,int qr,int l=1,int r=n){
if(!p)return 0;
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[p],ql,qr,l,mid);
if(mid<qr)res+=query(rs[p],ql,qr,mid+1,r);
return res;
}
#undef T
}seg;
struct Suffix_Automation{
#define S (N<<1)
int trans[S][26],tot,mxlen[S],link[S],mr[S];
int q[S],t[S],rt[S],to[S];
int New(){++tot;memset(trans[tot],0,sizeof(trans[tot]));mxlen[tot]=link[tot]=0;return tot;}
Suffix_Automation(){tot=0,New();}
void clear(){tot=0;New();}
int extend(int c,int lst,int id=0){
int p=lst,np=New();mxlen[np]=mxlen[p]+1,mr[np]=mxlen[np];
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1,mr[nq]=mr[q];
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
if(id)seg.update(rt[np],id,1);
return np;
}
void insert(char*str,int op=0){
int len=strlen(str);
for(int i=0,lst=1;i<len;++i)lst=extend(str[i]-'a',lst,op?i+1:0);
}
void rsort(){
for(int i=1;i<=tot;++i)t[i]=0;
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
}
void merge_endpos(){
rsort();
for(int i=tot;i>=2;--i)rt[link[q[i]]]=seg.merge(rt[link[q[i]]],rt[q[i]]);
}
LL diffrent_substring(){
LL res=0;
for(int i=1;i<=tot;++i)res+=mxlen[i]-mxlen[link[i]];
return res;
}
#undef S
}sam;
bool ckmax(int&x,int y){return x<y?x=y,1:0;}
bool ckmin(int&x,int y){return x>y?x=y,1:0;}
signed main(){
scanf("%s",str),n=strlen(str),sam.insert(str,1),sam.merge_endpos();
q=read();
for(int t=1;t<=q;++t){
static char S[N];
static int l,r,m,p,now;
static LL res;
static Suffix_Automation SAM;
scanf("%s%d%d",S+1,&l,&r),m=strlen(S+1),p=1,now=0,res=0;
SAM.clear(),SAM.insert(S+1);
for(int i=1;i<=m;++i){
int c=S[i]-'a';
while("fyytxdy"){
if(sam.trans[p][c]&&seg.query(sam.rt[sam.trans[p][c]],l+now,r)){++now,p=sam.trans[p][c];break;}
if(!now)break;
if(--now==sam.mxlen[sam.link[p]])p=sam.link[p];
}
ma[i]=now;
}
for(int i=1;i<=SAM.tot;++i)res+=max(0,SAM.mxlen[i]-max(SAM.mxlen[SAM.link[i]],ma[SAM.mr[i]]));
printf("%lld\n",res);
}
return 0;
}
/*
scbamgepe
3
smape 2 7
sbape 3 8
sgepe 1 9
P4770_2.in
*/```
P3829 [SHOI2012]信用卡凸包.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=10005;
const db eps=1e-7;
const db pi=acos(-1.0);
int n,tot,stk[N],top;
db a,b,r,ans;
struct vec{
db x,y;
vec(){x=y=0;}
vec(db x_,db y_){x=x_,y=y_;}
vec operator + (const vec&t)const{return vec(x+t.x,y+t.y);}
vec operator - (const vec&t)const{return vec(x-t.x,y-t.y);}
db operator * (const vec&t){return x*t.x+y*t.y;}
db operator & (const vec&t){return x*t.y-y*t.x;}
friend db dis(const vec&a,const vec&b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}
}p[N<<2];
inline bool cmp(const vec&a,const vec&b){
db tmp=(a-p[1])&(b-p[1]);
if(tmp>0)return 1;
if(fabs(tmp)<eps)return dis(p[0],a)<dis(p[0],b);
return 0;
}
signed main(){
scanf("%d%lf%lf%lf",&n,&a,&b,&r),a-=2*r,b-=2*r;
rep(i,1,n){
db x,y,k,X,Y;scanf("%lf%lf%lf",&x,&y,&k);
X=-b/2,Y=-a/2,p[++tot]=vec(x+X*cos(k)-Y*sin(k),y+X*sin(k)+Y*cos(k));
X=-b/2,Y=a/2,p[++tot]=vec(x+X*cos(k)-Y*sin(k),y+X*sin(k)+Y*cos(k));
X=b/2,Y=-a/2,p[++tot]=vec(x+X*cos(k)-Y*sin(k),y+X*sin(k)+Y*cos(k));
X=b/2,Y=a/2,p[++tot]=vec(x+X*cos(k)-Y*sin(k),y+X*sin(k)+Y*cos(k));
}
//rep(i,1,tot)cerr<<p[i].x<<' '<<p[i].y<<'\n';
//puts("--------------------");
int tmp=1;
rep(i,2,tot){
if(p[i].x<p[tmp].x)tmp=i;
else if(fabs(p[i].x-p[tmp].x)<eps&&p[i].y<p[tmp].y)tmp=i;
}
swap(p[1],p[tmp]),sort(p+2,p+tot+1,cmp);
for(int i=1;i<=tot;++i){
while(top>1&&((p[stk[top]]-p[stk[top-1]])&(p[i]-p[stk[top-1]]))<eps)--top;
stk[++top]=i;
}
//rep(i,1,top)cerr<<p[stk[i]].x<<' '<<p[stk[i]].y<<'\n';
ans=2*pi*r;
//cerr<<ans<<'\n';
rep(i,1,top)ans+=dis(p[stk[i]],p[stk[i%top+1]]);
printf("%.2lf\n",ans);
return 0;
}```
广义后缀自动机（带线段树合并）.cpp
```template<int L>
struct Suffix_Automation{
#define N (L+5)
struct Merge_Segment_Tree{
static const int T=N*(log(N)+1);
int ls[T],rs[T],val[T],tot;
Merge_Segment_Tree(){tot=0;}
void update(int&p,int pos,int k,int l=1,int r=L){
if(!p)p=++tot;
val[p]+=k;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
}
int merge(int x,int y,int l=1,int r=L){
if(!x||!y)return x|y;
if(l==r)return val[x]+=val[y],x;
int p=++tot,mid=(l+r)>>1;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return val[p]=val[ls[p]]+val[rs[p]],p;
}
int query(int p,int ql,int qr,int l=1,int r=L){
if(!p)return 0;
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[p],ql,qr,l,mid);
if(mid<qr)res+=query(rs[p],ql,qr,mid+1,r);
return res;
}
}seg;
#define S (N<<1)
int trans[S][26],tot,mxlen[S],link[S];
int q[S],t[S],rt[S];
int New(){++tot;memset(trans[tot],0,sizeof(trans[tot]));mxlen[tot]=link[tot]=0;return tot;}
Suffix_Automation(){tot=0,New();}
void clear(){tot=0;New();}
int extend(int c,int lst,int id,int op=0){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q]){if(op)seg.update(rt[q],id,1);return q;}
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
if(op)seg.update(rt[nq],id,1);
return nq;
}
}
int p=lst,np=New();mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
if(op)seg.update(rt[np],id,1);
return np;
}
void insert(char*str,int op=0){
int n=strlen(str);
for(int i=0,lst=1;i<n;++i)lst=extend(str[i]-'a',lst,i+1);
}
void rsort(){
for(int i=1;i<=tot;++i)t[i]=0;
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
}
void merge_endpos(){
rsort();
for(int i=tot;i>=2;--i)rt[link[q[i]]]=seg.merge(rt[link[q[i]]],rt[q[i]]);
}
LL distinct_substring(){
LL res=0;
for(int i=1;i<=tot;++i)res+=mxlen[i]-mxlen[link[i]];
return res;
}
#undef S
#undef N
};```
AT4505 [AGC029F] Construction of a tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=2*(N*2+200000);
const int inf=0x3f3f3f3f;
int n,cnt;
int dep[N],S,T,mf,ND,cur[N],mch[N],vis[N];
pair<int,int>ans[N];
vector<int>g[N];
int hed[N],et=1;
struct edge{int to,nx,fl;}e[M];
inline void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
inline void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(){
assert(ND>0);
queue<int>q;
for(int i=1;i<=ND;++i)dep[i]=0,cur[i]=hed[i];
q.push(S),dep[S]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dep[v])dep[v]=dep[u]+1,q.push(v);
}
}
return dep[T]>0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,us=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dep[v]==dep[u]+1){
rl=dfs(v,min(fl-us,e[i].fl));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,us+=rl;
if(us==fl)break;
}
}
return us;
}
void bfs2(){
queue<int>q;
rep(u,2,n){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(!e[i].fl&&v!=S)mch[v]=u;
}
}
q.push(1);
while(!q.empty()){
int u=q.front();q.pop();
for(int v:g[u]){
if(!vis[v]){
vis[v]=1,q.push(mch[v]),++cnt;
ans[v-n].fi=u,ans[v-n].se=mch[v];
}
}
}
}
signed main(){
n=read(),S=n<<1,T=S+1,ND=T;
rep(i,2,n)adde(S,i,1);
rep(i,1,n-1)adde(i+n,T,1);
for(int i=1;i<n;++i){
int m=read();
rep(t,1,m){
int x=read();
if(x!=1)adde(x,i+n,1);
g[x].pb(i+n);
}
}
while(bfs())mf+=dfs(S,inf);
if(mf!=n-1)return puts("-1"),0;
bfs2();
if(cnt<n-1)return puts("-1"),0;
for(int i=1;i<n;++i)printf("%d %d\n",ans[i].fi,ans[i].se);
return 0;
}```
CF1421A XORwice.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
signed main(){
for(int T=read();T;--T){
int a=read(),b=read();
printf("%d\n",a+b-(a&b)*2);
}
}```
P5022 旅行.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=5005;
int n,m,deg[N];
int head[N],num_edge;
int t[N],tot,ans[N],ban[2],son[N];
int top;
int loop[N],dfn[N],timer,pre[N],loop_cnt;
bool vis[N];
struct edge {
int nxt,to;
}e[N<<1];
struct node {
int u,ft;
node(){u=ft=0;}
node(int u_,int ft_){u=u_,ft=ft_;}
}stk[N];
inline void addedge(int fr,int to) {
++num_edge;
e[num_edge].to=to;
e[num_edge].nxt=head[fr];
head[fr]=num_edge;
}
inline void dfs(){
stk[top=1]=node(1,0),tot=0;
memset(vis,0,sizeof(vis));
while(top) {
node now=stk[top--];
int u=now.u,ft=now.ft;
t[++tot]=u,vis[u]=1;
int len=0;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||(u==ban[0]&&v==ban[1])||(u==ban[1]&&v==ban[0])||vis[v])continue;
son[++len]=v;
}
sort(son+1,son+len+1,greater<int>());
for(int i=1;i<=len;++i)stk[++top]=node(son[i],u);
}
}
inline void upd() {
if(tot<n)return;
for(int i=1;i<=n;++i)
if(ans[i]<t[i])return;
else if(ans[i]>t[i])break;
for(int i=1;i<=n;++i)ans[i]=t[i];
}
void findloop(int u) {
dfn[u]=++timer;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==pre[u])continue;
if(dfn[v]) {
if(dfn[v]<dfn[u])continue;
loop[++loop_cnt]=u;
for(;v!=u;v=pre[v])loop[++loop_cnt]=v;
}else pre[v]=u,findloop(v);
}
}
signed main() {
n=rd(),m=rd();
memset(ans,0x3f,sizeof(ans));
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
if(x>y)x^=y^=x^=y;
addedge(x,y),addedge(y,x);
}
if(m<n) dfs(),upd();
else {
findloop(1);
for(int i=1;i<=loop_cnt;++i)
ban[0]=loop[i],ban[1]=loop[i+1>n?1:i+1],dfs(),upd();
}
for(int i=1;i<=n;++i)printf("%d ",ans[i]);
return 0;
}
```
P5641 【CSGRound2】开拓者的卓识.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
const int M=600005;
const int mod=998244353;
int n,k,a[M],p[M],inv[N],rev[M],lg,lim;
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;return res;}
void init(int n){
for (lg = 0, lim = 1; lim < n; ++ lg, lim <<= 1);
for (int i = 0; i < lim; ++ i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (lg - 1));
}
void NTT(int*a,int g,int op=0){
for (int i = 0; i < lim; ++ i) if (i > rev[i]) std::swap(a[i], a[rev[i]]);
for (int i = 1; i < lim; i <<= 1) {
int wn = qpow (g, (mod - 1) / (i << 1));
for (int j = 0; j < lim; j += i << 1) {
int w0 = 1;
for (int k = 0; k < i; ++ k, w0 = 1ll * w0 * wn % mod) {
int X = a[j + k], Y = 1ll * w0 * a[i + j + k] % mod;
a[j + k] = (X + Y) % mod, a[i + j + k] = (X - Y + mod) % mod;
}
}
}
if(!op)return;int ilim = qpow(lim, mod - 2);
for (int i = 0; i < lim; ++ i) a[i] = 1ll * a[i] * ilim % mod;
}
signed main(){
n=read(),k=read();
for(int i=1;i<=n;++i)a[i]=read();
p[0]=1,inv[1]=1;
for(int i=2;i<=n;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
for(int i=1;i<=n;++i)p[i]=1ll*p[i-1]*(k-1+i)%mod*inv[i]%mod,a[i]=1ll*a[i]*p[i-1]%mod;
init(n<<1),NTT(a,3),NTT(p,3);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*p[i]%mod;
NTT(a,qpow(3,mod-2),1);
for(int i=1;i<=n;++i)printf("%d ",a[i]);
return 0;
}```
CF715B Complete The Graph.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 1005
#define M 10005
#define inf 100000000000000ll
int n,m,L,S,T,head[N],dis[N];
bool vis[N];
struct edge{
int fr,nxt,to,val,flg;
}e[M<<1];
int check(int k){
priority_queue<pair<int,int> >pq;
for(int i=0;i<n;++i)vis[i]=0,dis[i]=inf;
pq.push(mkp(dis[S]=0,S));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vis[u])continue;vis[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to,w=e[i].flg?k/m+(k%m>=(i-1)%m+1):e[i].val;
if(dis[v]>dis[u]+w)dis[v]=dis[u]+w,pq.push(mkp(-dis[v],v));
}
}
// cerr<<"k="<<k<<":";for(int i=0;i<n;++i)cerr<<dis[i]<<' ';cerr<<'\n';
return dis[T];
}
signed main(){
n=read(),m=read(),L=read(),S=read(),T=read();
for(int i=1;i<=m;++i){
e[i].fr=read(),e[i].to=read(),e[i].val=read(),e[i].nxt=head[e[i].fr],head[e[i].fr]=i;
e[i].flg=!e[i].val;
e[i+m].fr=e[i].to,e[i+m].to=e[i].fr,e[i+m].val=e[i].val,e[i+m].nxt=head[e[i+m].fr],head[e[i+m].fr]=i+m;
e[i+m].flg=!e[i+m].val;
}
int l=m,r=m*L;
while(l<=r){
int mid=(l+r)>>1,k=check(mid);
if(k==L){
puts("YES");
for(int i=1;i<=m;++i)
printf("%lld %lld %lld\n",e[i].fr,e[i].to,e[i].flg?mid/m+(mid%m>=(i-1)%m+1):e[i].val);
return 0;
}
if(k<L)l=mid+1;
else r=mid-1;
}
puts("NO");
}```
P7076 动物园.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline unsigned long long readull(){
unsigned long long x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
#define N 1000005
#define mod 998244353
int n,m,c,k,p[N],q[N],cnt;
unsigned long long a[N],msk;
unsigned long long ans=1;
bool buy[70],ask[70];
signed main(){
n=read(),m=read(),c=read(),k=read();
if(n==0&&m==0&&k==64)return cout<<"18446744073709551616",0;
for(int i=1;i<=n;++i)msk|=a[i]=readull();
for(int i=1;i<=m;++i){
p[i]=read(),q[i]=read();
if(msk>>p[i]&1)buy[p[i]]=1;
ask[p[i]]=1;
}
for(int i=0;i<k;++i)
if(buy[i])++cnt;
else if(!ask[i])++cnt;
cerr<<cnt<<'\n';
for(int i=1;i<=cnt;++i)ans<<=1;
cout<<ans-n<<'\n';
return 0;
}```
CF101D Castle.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
int n,siz[N];
LL f[N],g[N];
vector<pair<int,int> >e[N];
bool cmp(const int&a,const int&b){
return g[a]*siz[b]<g[b]*siz[a];
}
void dfs(int u,int ft){
siz[u]=1;
vector<int>t;
for(pair<int,int>i:e[u]){
int v=i.y;if(v==ft)continue;
dfs(v,u),f[u]+=siz[v]*i.x+f[v],siz[u]+=siz[v],g[v]+=i.x*2,g[u]+=g[v],t.pb(v);
}
sort(t.begin(),t.end(),cmp);int now=siz[u]-1;
for(int i:t)f[u]+=g[i]*(now-=siz[i]);
}
signed main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read(),z=read();
e[x].pb(mkp(z,y)),e[y].pb(mkp(z,x));
}
dfs(1,0),printf("%.13lf\n",1.*f[1]/(n-1));
}```
P5424 [USACO19OPEN]Snakes G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 409
#define inf (0x3f3f3f3f)
int n,k,a[N],dp[N][N],val[N][N],sum[N];
signed main() {
n=rd(),k=rd();
for(int i=1;i<=n;++i)sum[i]=sum[i-1]+(a[i]=rd());
for(int i=1;i<=n;++i) {
int mx=0;
for(int j=i;j<=n;++j)
mx=max(mx,a[j]),val[i][j]=mx*(j-i+1)-(sum[j]-sum[i-1]);
}
for(int i=1;i<=n;++i)dp[0][i]=val[1][i];
for(int i=1;i<=k;++i) {
for(int j=1;j<=n;++j) {
dp[i][j]=inf;
for(int t=0;t<j;++t)
dp[i][j]=min(dp[i][j],dp[i-1][t]+val[t+1][j]);
}
}
printf("%d\n",dp[k][n]);
return 0;
}```
P7262 Get Your Wish.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
char rddir(){
char ch=getchar();
while(ch!='<'&&ch!='>'&&ch!='v'&&ch!='^')ch=getchar();
return ch;
}
const int N=105;
int n,m,a[N][N],s[N][N];
char dir;
signed main(){
n=read(),m=read(),dir=rddir();
rep(i,1,n){
static char str[N];
scanf("%s",str+1);
rep(j,1,m)a[i][j]=str[j]=='o'?-1:str[j]=='x'?0:1;
}
if(dir=='^'||dir=='v'){rep(j,1,m)rep(i,1,n)s[i][j]=s[i-1][j]+(!a[i][j]);}
else {rep(i,1,n)rep(j,1,m)s[i][j]=s[i][j-1]+(!a[i][j]);}
if(dir=='^'){rep(i,1,n)rep(j,1,m)if(!~a[i][j]&&s[i][j])return puts("GG"),0;}
else if(dir=='v'){rep(i,1,n)rep(j,1,m)if(!~a[i][j]&&s[n][j]^s[i-1][j])return puts("GG"),0;}
else if(dir=='<'){rep(i,1,n)rep(j,1,m)if(!~a[i][j]&&s[i][j])return puts("GG"),0;}
else {rep(i,1,n)rep(j,1,m)if(!~a[i][j]&&s[i][m]^s[i][j-1])return puts("GG"),0;}
puts("OK");
}```
CF616B Dinner with Emma.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
int n,m,a[N][N],ans;
signed main(){
n=read(),m=read();
rep(i,1,n)rep(j,1,m)a[i][j]=read();
rep(i,1,n){
int mi=2e9;
rep(j,1,m)ckmin(mi,a[i][j]);
ckmax(ans,mi);
}
cout<<ans<<'\n';
}```
CF1355A Sequence with Digits.cpp
``` #include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int T,n,a;
int mm(int x) {
if(!x)return 0;
int res=9;
while(x) {
res=min(res,x%10);
x/=10;
}
return res;
}
int mx(int x) {
if(!x)return 0;
int res=0;
while(x) {
res=max(res,x%10);
x/=10;
}
return res;
}
signed main() {
T=rd();
while(T--) {
a=rd(),n=rd();
for(rint i=1;i<n;++i) {
if(!mm(a))break;
int tmp=mm(a)*mx(a);
a+=tmp;
}
printf("%lld\n",a);
}
return 0;
}
```
P7300 [USACO21JAN] No Time to Paint S.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,q,a[N],pre[26][N],suf[26][N];
char str[N];
signed main(){
scanf("%d%d%s",&n,&q,str+1);
rep(i,1,n)a[i]=str[i]-'A';
rep(i,0,25){
int now=0,flg=1;
rep(j,1,n){
if(a[j]==i)now+=flg,flg=0;
else if(a[j]<i)flg=1;
pre[i][j]=now;
}
}
rep(i,0,25){
int now=0,flg=1;
per(j,n,1){
if(a[j]==i)now+=flg,flg=0;
else if(a[j]<i)flg=1;
suf[i][j]=now;
}
}
/*
rep(i,0,3){
rep(j,1,n)cerr<<pre[i][j]<<' ';cerr<<'\n';
}
rep(i,0,3){
rep(j,1,n)cerr<<suf[i][j]<<' ';cerr<<'\n';
}
*/
while(q--){
int res=0,x=read(),y=read();
rep(i,0,25)res+=pre[i][x-1]+suf[i][y+1];
printf("%d\n",res);
}
return 0;
}```
P5355 [Ynoi2017]由乃的玉米田.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int sq=sqrt(N);
int n,m,a[N],size;
int bel[N],ans[N],cnt[N],jump[N];
struct QUE {
int opt,l,r,x,id;
}q[N];
struct node {
int l,r,x,id;
node(){}
node(int l_,int r_,int x_,int i_){
l=l_,r=r_,x=x_,id=i_;
}
};
vector<node>p[sq+5];
int pre[N],mx[N];
inline bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?a.l<b.l:bel[a.l]&1?a.r<b.r:a.r>b.r;
}
bitset<N>A,B,C;
void add(int x) {
++cnt[a[x]];
if(cnt[a[x]])A[a[x]]=1,B[N-a[x]]=1;
else A[a[x]]=0,B[N-a[x]]=0;
}
void pop(int x) {
--cnt[a[x]];
if(cnt[a[x]])A[a[x]]=1,B[N-a[x]]=1;
else A[a[x]]=0,B[N-a[x]]=0;
}
int Q1(int x) {
C=A,C<<=x,C&=A;
return C.any();
}
int Q2(int x) {
C=B,C>>=N-x,C&=A;
return C.any();
}
int Q3(int x) {
for(int i=1;i*i<=x;++i) {
if(x%i)continue;
if(A[i]&&A[x/i])return 1;
}
return 0;
}
int Q4(int x) {
for(int i=1;i*x<N;++i)
if(A[i]&&A[i*x])return 1;
return 0;
}
void solve() {
for(int i=1;i<=sq;++i) {
if(p[i].empty())continue;
memset(pre,0,sizeof(pre));
memset(mx,0,sizeof(mx));
int t=0;
for(int j=1;j<=n;++j) {
pre[a[j]]=j;
if(i*a[j]<N)t=max(t,pre[i*a[j]]);
if(a[j]%i==0)t=max(t,pre[a[j]/i]);
mx[j]=t;
}
for(node x:p[i])
ans[x.id]=(x.l<=mx[x.r]);
}
}
signed main() {
n=rd(),m=rd(),size=sqrt(n);
for(int i=1;i<=n;++i)a[i]=rd(),bel[i]=(i-1)/size+1;
for(int i=1;i<=m;++i) {
int opt=rd(),l=rd(),r=rd(),x=rd();
if(opt==4&&x<=sq){jump[i]=1;p[x].push_back(node(l,r,x,i));}
q[i].opt=opt,q[i].l=l,q[i].r=r,q[i].x=x,q[i].id=i;
}
solve();
sort(q+1,q+m+1,cmp);
int l=1,r=0;
for(int i=1;i<=m;++i) {
if(jump[q[i].id])continue;
while(l<q[i].l)pop(l++);
while(l>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(r>q[i].r)pop(r--);
if(q[i].opt==1)ans[q[i].id]=Q1(q[i].x);
else if(q[i].opt==2)ans[q[i].id]=Q2(q[i].x);
else if(q[i].opt==3)ans[q[i].id]=Q3(q[i].x);
else ans[q[i].id]=Q4(q[i].x);
}
for(int i=1;i<=m;++i)puts(ans[i]?"yuno":"yumi");
return 0;
}```
P3261 [JLOI2015]城池攻占.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
int n,m;
int dep[N];
int f[N],c[N],a[N];
LL s[N],v[N],h[N];
int ans1[N],ans2[N];
vector<int>g[N];
int tot,root[N];
int ls[N],rs[N],siz[N],fa[N],dst[N];
LL val[N],tg1[N],tg2[N];
void plu(int x,LL d) {val[x]+=d,tg1[x]+=d;}
void mul(int x,LL d) {val[x]*=d,tg1[x]*=d,tg2[x]*=d;}
void pushdown(int x) {
if(tg2[x]!=1)mul(ls[x],tg2[x]),mul(rs[x],tg2[x]),tg2[x]=1;
if(tg1[x]!=0)plu(ls[x],tg1[x]),plu(rs[x],tg1[x]),tg1[x]=0;
}
int merge(int x,int y) {
if(!x||!y)return x|y;
if(val[x]>val[y])swap(x,y);
pushdown(x);
siz[x]+=siz[y],rs[x]=merge(rs[x],y),fa[rs[x]]=x;
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
dst[x]=dst[rs[x]]+1;
return x;
}
struct Left_Tree {
int rt;
Left_Tree(){rt=0;}
int New(LL x) {
++tot;
fa[tot]=tot,tg1[tot]=0,tg2[tot]=1,val[tot]=x,dst[tot]=0,siz[tot]=1;
return tot;
}
void insert(int x) {rt=merge(rt,New(x));}
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
void pop(int u=0) {
int x=find(rt);
ans2[x]=dep[c[x]]-dep[u];
pushdown(x);
fa[ls[x]]=ls[x],fa[rs[x]]=rs[x];
rt=fa[x]=merge(ls[x],rs[x]);
}
int root(){return rt=find(rt);}
LL top(){return val[root()];}
int size(){return siz[root()];}
void update1(LL x) {plu(root(),x);}
void update2(LL x) {mul(root(),x);}
}heap[N];
void dfs(int u) {
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];
dep[v]=dep[u]+1,dfs(v);
heap[u].rt=merge(heap[u].root(),heap[v].root());
}
while(heap[u].size()&&heap[u].top()<h[u])heap[u].pop(u),++ans1[u];
a[u]?heap[u].update2(v[u]):heap[u].update1(v[u]);
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)scanf("%lld",&h[i]);
for(int i=2;i<=n;++i)scanf("%d%d%lld",&f[i],&a[i],&v[i]),g[f[i]].pb(i);
for(int i=1;i<=m;++i)scanf("%lld%d",&s[i],&c[i]),heap[c[i]].insert(s[i]);
dep[1]=1,dfs(1);
while(heap[1].size())heap[1].pop(0);
for(int i=1;i<=n;++i)printf("%d\n",ans1[i]);
for(int i=1;i<=m;++i)printf("%d\n",ans2[i]);
return 0;
}```
CF613B Skills.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=100005;
int n,A,cf,cm,m,sum[N],ans=-1,rk,v,b[N];
struct node{
int val,id;
}a[N];
bool cmp(const node &a,const node &b) {
return a.val<b.val;
}
int find(int sum,int x) {
int l=0,r=x,res;
while(l<=r) {
int mid=(l+r)>>1;
if(a[mid].val<sum)res=mid,l=mid+1;
else r=mid-1;
}
return res;
}
signed main() {
scanf("%lld%lld%lld%lld%lld",&n,&A,&cf,&cm,&m);
for(int i=1;i<=n;++i)
scanf("%lld",&a[i].val),a[i].id=i;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+a[i].val;
m+=sum[n];
for(int i=1;i<=n+1;++i) {
if(A*(n-i+1)+sum[i-1]>m)continue;
int l=a[1].val,r=A,res;
while(l<=r) {
int mid=(l+r)>>1;
int t=find(mid,i-1);
if(A*(n-i+1)+mid*t+sum[i-1]-sum[t]<=m)res=mid,l=mid+1;
else r=mid-1;
}
if(ans<res*cm+(n-i+1)*cf) {
ans=res*cm+(n-i+1)*cf;
rk=i,v=res;
}
}
printf("%lld\n",ans);
for(int i=1;i<rk;++i)a[i].val=max(a[i].val,v);
for(int i=rk;i<=n;++i)a[i].val=A;
for(int i=1;i<=n;++i)b[a[i].id]=a[i].val;
for(int i=1;i<=n;++i)printf("%lld ",b[i]);
return 0;
} ```
P1552 [APIO2012]派遣-2（平衡树启发式合并）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
const int N=5e6+10;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
struct edge {
int nxt,to;
}e[N];
int num_edge,head[N];
int n,m,rt[N],L[N],root;
LL ans,sum[N];
int ch[N][2],val[N],siz[N],rnd[N],tot;
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
int New(int v) {
int t=++tot;
val[t]=sum[t]=v;
rnd[t]=rand();
siz[t]=1;
return t;
}
void pushup(int x) {
siz[x]=siz[ch[x][0]]+1+siz[ch[x][1]];
sum[x]=sum[ch[x][0]]+val[x]+sum[ch[x][1]];
}
int merge(int x,int y) {
if(!x||!y)return x|y;
if(rnd[x]<rnd[y]) {
ch[x][1]=merge(ch[x][1],y);
pushup(x);return x;
} else {
ch[y][0]=merge(x,ch[y][0]);
pushup(y);return y;
}
}
void split(int u,int k,int &x,int &y) {
if(!u) {x=y=0;return;}
if(val[u]<=k)x=u,split(ch[u][1],k,ch[u][1],y);
else y=u,split(ch[u][0],k,x,ch[u][0]);
pushup(u);
}
void del(int &u,int x) {
int a,b,c;
split(u,x,a,b);
split(a,x-1,a,c);
c=merge(ch[c][0],ch[c][1]);
u=merge(merge(a,c),b);
}
int kth(int u,int k) {
while(true) {
if(k<=siz[ch[u][0]])u=ch[u][0];
else {
if(k==siz[ch[u][0]]+1)return val[u];
else k-=siz[ch[u][0]]+1,u=ch[u][1];
}
}
}
void insert(int &x,int v) {
int a,b;
split(x,v,a,b);
x=merge(merge(a,New(v)),b);
}
void dfs(int x,int &y) {
if(!x)return;
if(ch[x][0])dfs(ch[x][0],y);
insert(y,val[x]);
if(ch[x][1])dfs(ch[x][1],y);
}
int dsu(int x,int y) {
if(siz[x]>siz[y])x^=y^=x^=y;
dfs(x,y);return y;
}
void dfs(int u) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
dfs(v);
rt[u]=dsu(rt[u],rt[v]);
}
while(sum[rt[u]]>m)del(rt[u],kth(rt[u],siz[rt[u]]));
ans=max(ans,1ll*L[u]*siz[rt[u]]);
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i) {
int x=rd(),y=rd();
L[i]=rd();
if(x)addedge(x,i);
else root=i;
rt[i]=New(y);
}
dfs(root);
printf("%lld\n",ans);
return 0;
}
```
P4111 [HEOI2015]小 Z 的房间.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=12;
const int M=N*N;
#define mod 1000000000
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int n,m,a[M][M],mp[N][N],tot,id[N][N];
int Gauss(const int&n){
if(!n)return 0;
int res=1;
rep(i,1,n){
rep(j,i+1,n){
while(a[j][i]){
const int div=a[i][i]/a[j][i];
rep(k,i,n)fmod(a[i][k]-=1ll*a[j][k]*div%mod),swap(a[i][k],a[j][k]);
res*=-1;
}
}
if(!a[i][i])return 0;
res=1ll*res*a[i][i]%mod;
}
return fmod(res),res;
}
signed main(){
n=read(),m=read();
rep(i,1,n)rep(j,1,m){
char ch=getchar();
while(ch!='.'&&ch!='*')ch=getchar();
mp[i][j]=ch=='.';
if(mp[i][j])id[i][j]=++tot;
}
rep(i,1,n)rep(j,1,m){
if(!mp[i][j])continue;
if(mp[i-1][j])++a[id[i][j]][id[i][j]],--a[id[i][j]][id[i-1][j]];
if(mp[i+1][j])++a[id[i][j]][id[i][j]],--a[id[i][j]][id[i+1][j]];
if(mp[i][j-1])++a[id[i][j]][id[i][j]],--a[id[i][j]][id[i][j-1]];
if(mp[i][j+1])++a[id[i][j]][id[i][j]],--a[id[i][j]][id[i][j+1]];
}
printf("%d\n",Gauss(tot-1));
return 0;
}```
P6800 【模板】Chirp Z-Transform.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2000005;
const int M=N<<2;
#define mod 998244353
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
namespace poly{
int rev[M],rt[M],lim;
void initpoly(const int&n){
static int lg;
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
for(int i=1;i<lim;i<<=1){
int w=qpow(3,(mod-1)/(i<<1));
rt[i]=1;
for(int j=1;j<i;++j)rt[i+j]=1ll*rt[i+j-1]*w%mod;
}
}
void NTT(int*a,int op){
if(!op)reverse(a+1,a+lim);
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const int t=1ll*rt[i+k]*a[i+j+k]%mod;
fmod(a[i+j+k]=a[j+k]+mod-t),fmod(a[j+k]+=t);
}
}
}
if(!op)for(int i=0,iv=qpow(lim,mod-2);i<lim;++i)a[i]=1ll*a[i]*iv%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];initpoly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void CZT(int*g,int*f,int m,int n,int c){//给定n次多项式f，求f(c^{0->m-1})
static int pw[N<<1],ipw[N<<1],ivc,A[M],B[M];
pw[0]=pw[1]=ipw[0]=ipw[1]=1,ivc=qpow(c,mod-2);
for(int i=2;i<n+m;++i)pw[i]=1ll*pw[i-1]*c%mod,ipw[i]=1ll*ipw[i-1]*ivc%mod;
for(int i=2;i<n+m;++i)pw[i]=1ll*pw[i-1]*pw[i]%mod,ipw[i]=1ll*ipw[i-1]*ipw[i]%mod;
for(int i=0;i<n;++i)A[i]=1ll*f[i]*ipw[i]%mod;
for(int i=0;i<n+m;++i)B[i]=pw[i];
reverse(A,A+n),poly_mul(A,B,A,n,n+m);
for(int i=0;i<m;++i)g[i]=1ll*ipw[i]*A[i+n-1]%mod;
}
}
int n,c,m,a[N],A[M],B[M],pw[N],ipw[N];
signed main(){
n=read(),c=read(),m=read();
for(int i=0;i<n;++i)a[i]=read();
poly::CZT(B,a,m,n,c);
for(int i=0;i<m;++i)printf("%d ",B[i]);
return 0;
}```
P7102 [w3R1] 算.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
LL mul(LL x,LL y,LL mod){
LL res=x*y-(long long)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
LL gcd(LL x,LL y){
while(y){LL t=x%y;x=y,y=t;}
return x;
}
LL qpow(LL n,LL k,LL mod){
LL res=1;for(;k;k>>=1,n=mul(n,n,mod))if(k&1)res=mul(res,n,mod);
return res;
}
namespace MR{
int testp[8]={2,3,5,7,11,19,61,233};
bool mr(LL x,LL p){
if(x%p==0||qpow(p,x-1,x)!=1)return 0;
LL k=x-1;
while(!(k&1)){
LL t=qpow(p,k>>=1,x);
if(t!=x-1&&t!=1)return 0;
if(t==x-1)break;
}
return 1;
}
bool test(LL x){
for(int i=0;i<8;++i){
if(x==testp[i])return 1;
if(!mr(x,testp[i]))return 0;
}
return 1;
}
}
namespace PR{
int tot;
LL d[150];
mt19937_64 rnd(673);
LL pr(LL x,LL c){
if(x==4)return 2;
static LL s[150],v0,v1,g;
static int len;
len=0,v0=c,v1=mul(v0,v0,x)+c,g=1;
while(1){
s[++len]=v1-v0,g=mul(g,v1-v0,x);
if(len==127){if(gcd(g,x)>1)break;len=0;}
v0=mul(v0,v0,x)+c,v1=mul(v1,v1,x)+c,v1=mul(v1,v1,x)+c;
}
for(int i=1;i<=len;++i)if((g=gcd(s[i],x))>1)return g;
return x;
}
void solve(LL x){
if(x==1)return;
if(MR::test(x))return d[++tot]=x,void();
LL y=x;while(y==x)y=pr(x,rnd()%(x-1)+1);
solve(x/y),solve(y);
}
void work(LL x){tot=0,solve(x),sort(d+1,d+tot+1);}
}
const int N=200005;
const int M=N*3*2;
#define mod 998244353
namespace math{
int inv[N],fac[N],ifc[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using namespace math;
namespace poly{
int rev[M],rt[M],lim;
void initpoly(const int&n){
static int lg;
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
for(int i=1;i<lim;i<<=1){
int w=qpow(3,(mod-1)/(i<<1));
rt[i]=1;
for(int j=1;j<i;++j)rt[i+j]=1ll*rt[i+j-1]*w%mod;
}
}
void NTT(int*a,int op){
if(!op)reverse(a+1,a+lim);
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const int t=1ll*rt[i+k]*a[i+j+k]%mod;
fmod(a[i+j+k]=a[j+k]+mod-t),fmod(a[j+k]+=t);
}
}
}
if(!op)for(int i=0,iv=qpow(lim,mod-2);i<lim;++i)a[i]=1ll*a[i]*iv%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];initpoly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void poly_inv(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=qpow(f[0],mod-2),void();
poly_inv(g,f,(n+1)>>1),initpoly(n<<1);
cpy(A,f,n),clr(A+n,lim-n),clr(g+n,lim-n);
NTT(A,1),NTT(g,1);
for(int i=0;i<lim;++i)g[i]=1ll*g[i]*(2+mod-1ll*A[i]*g[i]%mod)%mod;
NTT(g,0),clr(g+n,lim-n);
}
void bernoulli(int*g,int n){
static int A[M];
for(int i=0;i<n;++i)A[i]=ifc[i+1];
clr(g,n),poly_inv(g,A,n);
}
void CZT(int*g,int*f,int m,int n,int c){//给定n-1次多项式f，求f(c^{0->m-1})
static int pw[N<<1],ipw[N<<1],ivc,A[M],B[M];
pw[0]=pw[1]=ipw[0]=ipw[1]=1,ivc=qpow(c,mod-2);
for(int i=2;i<n+m;++i)pw[i]=1ll*pw[i-1]*c%mod,ipw[i]=1ll*ipw[i-1]*ivc%mod;
for(int i=2;i<n+m;++i)pw[i]=1ll*pw[i-1]*pw[i]%mod,ipw[i]=1ll*ipw[i-1]*ipw[i]%mod;
for(int i=0;i<n;++i)A[i]=1ll*f[i]*ipw[i]%mod;
for(int i=0;i<n+m;++i)B[i]=pw[i];
reverse(A,A+n),poly_mul(A,B,A,n,n+m);
for(int i=0;i<m;++i)g[i]=1ll*ipw[i]*A[i+n-1]%mod;
}
}
using PR::d;
using PR::tot;
int m,t,a[N],A[M],B[M],tem[N],num,pri[N];
LL c;
signed main(){
initmath();
scanf("%d%lld%d",&m,&c,&t),++t;
for(int i=0;i<m;++i)a[i]=read();
if(c==1){
static LL sum;
sum=0;for(int i=0;i<m;++i)sum+=a[i];
int s=sum%mod;
for(int i=1;i<t;++i)printf("%d ",s);
return 0;
}
PR::work(c);
for(int l=1,r=0;l<=tot;l=r+1){
while(r<tot&&d[r+1]==d[l])++r;
pri[++num]=d[l]%mod;
}
A[0]=1;
for(int i=1;i<=num;++i)A[0]=1ll*A[0]*(mod+1-(tem[i]=qpow(pri[i],mod-2)))%mod;
for(int i=1;i<m;++i){
A[i]=1;
for(int j=1;j<=num;++j)A[i]=1ll*A[i]*(mod+1-(tem[j]=1ll*tem[j]*pri[j]%mod))%mod;
}
poly::bernoulli(B,m);
for(int i=0;i<m;++i)A[i]=1ll*A[i]*B[i]%mod;
for(int i=0;i<m;++i)B[i]=1ll*a[i]*fac[i]%mod;
reverse(A,A+m),poly::poly_mul(A,B,B,m,m);
for(int i=0;i<m;++i)A[i+1]=1ll*ifc[i+1]*B[i+m-1]%mod;
A[0]=0,clr(B,t),poly::CZT(B,A,t,m+1,c%mod);
for(int i=1;i<t;++i)printf("%d\n",B[i]);
return 0;
}```
P4169 [Violet]天使玩偶 SJY摆棋子.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1145140;
struct QUE {
int t,x,y,z;
inline bool operator < (const QUE&rhs){
return x<rhs.x;
}
}a[N],p[N],fyyAKIOI[N];
int n,m,k,X,Y,tr[N],ans[N];
void add(int x,int d) {
for(int i=x;i<=Y;i+=i&-i)tr[i]=max(tr[i],d);
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res=max(res,tr[i]);
return res;
}
void clear(int x) {
for(int i=x;i<=Y;i+=i&-i)tr[i]=0;
}
void init() {
k=0;int tx=0,ty=0;
for(int i=1;i<=n;++i)
if(!p[i].t)tx=max(tx,p[i].x),ty=max(ty,p[i].y);
for(int i=1;i<=n;++i)
if(p[i].x<=tx&&p[i].y<=ty)fyyAKIOI[++k]=p[i];
for(int i=1;i<=k;++i)p[i]=fyyAKIOI[i];
}
void cdq(int l,int r) {
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid),cdq(mid+1,r);
for(int i=mid+1,j=l;i<=r;++i) {
if(p[i].t)continue;
for(;j<=mid&&p[j].x<=p[i].x;++j)
if(p[j].t)add(p[j].y,p[j].x+p[j].y);
int tmp=ask(p[i].y);
if(tmp)ans[p[i].z]=min(ans[p[i].z],p[i].x+p[i].y-tmp);
}
for(int i=l;i<=mid;++i)if(p[i].t)clear(p[i].y);
merge(p+l,p+mid+1,p+mid+1,p+r+1,fyyAKIOI+l);
for(int i=l;i<=r;++i)p[i]=fyyAKIOI[i];
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i) {
a[i].t=1,a[i].z=i,a[i].x=rd()+1,a[i].y=rd()+1;
X=max(X,a[i].x),Y=max(Y,a[i].y);
}
for(int i=1;i<=m;++i) {
++n,a[n].t=rd()&1,a[n].z=n,a[n].x=rd()+1,a[n].y=rd()+1;
X=max(X,a[n].x),Y=max(Y,a[n].y);
}
memset(ans,0x3f,sizeof(ans));
for(int i=1;i<=n;++i)p[i]=a[i];
init(),cdq(1,k);
for(int i=1;i<=n;++i)p[i]=a[i],p[i].x=X-a[i].x+1;
init(),cdq(1,k);
for(int i=1;i<=n;++i)p[i]=a[i],p[i].y=Y-a[i].y+1;
init(),cdq(1,k);
for(int i=1;i<=n;++i)p[i]=a[i],p[i].x=X-a[i].x+1,p[i].y=Y-a[i].y+1;
init(),cdq(1,k);
for(int i=1;i<=n;++i)if(!a[i].t)printf("%d\n",ans[i]);
return 0;
}
```
CF1260A Heating.cpp
```#include<bits/stdc++.h>
using namespace std;
int n,a,b,ans;
int main() {
scanf("%d",&n);
while(n--) {
ans=0;
scanf("%d%d",&a,&b);
int tmp=b/a;
int sum=b-tmp*a;
ans+=(a-sum)*tmp*tmp;
ans+=sum*(tmp+1)*(tmp+1);
printf("%d\n",ans);
}
return 0;
} ```
P4609 [FJOI2016]建筑师.cpp
```// Problem: P4609 [FJOI2016]建筑师
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P4609
// Memory Limit: 250 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int S1[50005][205],fac[205],ifc[205];
#define mod 1000000007
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int comb(int n,int m){return n<m?0:1ll*fac[n]*1ll*ifc[m]%mod*ifc[n-m]%mod;}
void init(){
fac[0]=1;rep(i,1,200)fac[i]=1ll*fac[i-1]*i%mod;
ifc[200]=qpow(fac[200],mod-2);per(i,199,0)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
S1[0][0]=1;rep(i,1,50000)rep(j,1,200)S1[i][j]=(S1[i-1][j-1]+1ll*S1[i-1][j]*(i-1)%mod)%mod;
}
signed main(){
init();
for(int T=read();T;--T){
int n=read(),A=read(),B=read();
if(A+B-1>n)puts("0");
else printf("%lld\n",1ll*comb(A+B-2,A-1)*S1[n-1][A+B-2]%mod);
}
return 0;
}```
P1028 数的计算.cpp
```#include<bits/stdc++.h>
using namespace std;
int main() {
int n,f[1005]={0};
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i/2;j++)
f[i]+=f[j];
f[i]++;
}
cout<<f[n]<<endl;
return 0;
}
```
CF1324E Sleeping Schedule.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define inf 100000000
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N (2010)
int n,h,l,r,dp[N][N],ans,a[N];
int main() {
memset(dp,-0x3f,sizeof(dp));dp[0][0]=0;
n=rd(),h=rd(),l=rd(),r=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1;i<=n;++i)
for(rint j=0;j<h;++j)
dp[i][j]=max(dp[i-1][((j-a[i])%h+h)%h]+(l<=j&&j<=r),dp[i-1][((j-a[i]+1)%h+h)%h]+(l<=j&&j<=r));
for(rint i=0;i<h;++i)ans=max(ans,dp[n][i]);
printf("%d\n",ans);
return 0;
}```
P4590 [TJOI2018]游园会.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
inline void fmod(int &x) { x -= mod, x += x >> 31 & mod; }
int n, k, f[2][1 << 15][3], a[20], cnt[1<<15], ans[20], mem[1 << 15][3];
char str[20];
int trans(int msk, int c) {
if (mem[msk][c]) return mem[msk][c];
static int A[20], B[20];
int res = 0;
A[0] = B[0] = 0;
for (int i = 0; i < k; ++i) A[i + 1] = A[i] + (msk >> i & 1);
for (int i = 1; i <= k; ++i) B[i] = max(max(B[i - 1], A[i]), (c == a[i]) * (A[i - 1] + 1));
for (int i = 0; i < k; ++i) res |= (B[i + 1] - B[i]) << i;
return mem[msk][c] = res;
}
signed main() {
scanf("%d%d%s",&n, &k, str + 1);
for(int i = 1; i <= k; ++i)
a[i] = str[i] == 'N' ? 0 : str[i] == 'O' ? 1 : 2;
for (int i = 0; i < 1 << k; ++i) cnt[i] = cnt[i >> 1] + (i&1);
f[0][0][0] = 1;
for (int i = 0, u = 0; i < n; ++i, u ^= 1) {
memset(f[u^1], 0, sizeof(f[u^1]));
for (int msk = 0, U = 1 << k; msk < U; ++msk) {
for (int j = 0; j < 3; ++j) {
if (!f[u][msk][j]) continue;
for (int c = 0; c < 3; ++c) {
int l = 0, nex = msk;
if (c == 0) l = 1;
else if (j == 1 && c == 1) l = 2;
else if (j == 2 && c == 2) continue;
fmod(f[u^1][trans(msk, c)][l] += f[u][msk][j]);
}
}
}
}
for (int msk = 0, U = 1 << k; msk < U; ++msk)
fmod(ans[cnt[msk]] += f[n&1][msk][0]),
fmod(ans[cnt[msk]] += f[n&1][msk][1]),
fmod(ans[cnt[msk]] += f[n&1][msk][2]);
for(int i=0;i <= k; ++i) printf("%d\n", ans[i]);
return 0;
}```
树链剖分.cpp
```template<int N>
struct Tree{
static const int O=N+5;
Tree(){ecnt=0;memset(head,0,sizeof(head));}
int ecnt,head[O];
struct edge{int nxt,to;}e[O<<1];
int siz[O],fa[O],top[O],son[O],dep[O],rev[O],dfn[O],tmr;
void addedge(int fr,int to){++ecnt,e[ecnt].nxt=head[fr],e[ecnt].to=to,head[fr]=ecnt;}
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
rev[dfn[u]=++tmr]=u,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
void init(){dfs1(1,0),dfs2(1,1);}
int LCA(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
};```
CF754D Fedor and coupons.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300009;
int n,k,ans,L,R;
struct node {
int l,r,id;
}a[N];
priority_queue<int,vector<int>,greater<int> >q;
bool cmp(const node&a,const node&b) {
return a.l!=b.l?a.l<b.l:a.r<b.r;
}
signed main() {
n=rd(),k=rd();
for(int i=1;i<=n;++i)a[i].l=rd(),a[i].r=rd(),a[i].id=i;
sort(a+1,a+n+1,cmp);
for(int i=1;i<k;++i)q.push(a[i].r);
for(int i=k;i<=n;++i) {
q.push(a[i].r);
if(q.size()>k)q.pop();
int t=q.top()-a[i].l+1;
if(t>ans)ans=t,L=a[i].l,R=q.top();
}
printf("%d\n",ans);
if(!ans)for(int i=1;i<=k;++i)printf("%d ",i);
else for(int i=1,j=1;i<=n&&j<=k;++i)if(a[i].l<=L&&a[i].r>=R)printf("%d ",a[i].id),++j;
return 0;
}```
P7395 弹珠游戏（2021 CoE-I C）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int win[1<<16],mp[4][4];
int rds(){
const static int
d[16]={0,4,1,8,5,2,12,9,6,3,13,10,7,14,11,15};
int res=0,cnt=0;
char ch=getchar();
while(cnt<16){
while(ch!='*'&&ch!='.')ch=getchar();
if(ch=='*')res|=1<<d[cnt];
++cnt,ch=getchar();
}
return res;
}
void print(int msk){
for(int i=0;i<4;++i){
for(int j=0;j<4;++j)
cout<<((msk>>(4*i+j))&1)<<' ';
cout<<endl;
}
cout<<"-----------\n";
}
int hsh(){
int res=0;
for(int i=0;i<4;++i)
for(int j=0;j<4;++j)
if(mp[i][j])res|=1<<(4*i+j);
// print(res);
return res;
}
int kz(int msk){
for(int i=0;i<4;++i)
for(int j=0;j<4;++j)
mp[i][j]=(msk>>(4*i+j))&1;
for(int i=0;i<4;++i){
for(int j=0;j<4;++j){
if(!mp[i][j]){
mp[i][j]=1;
if(!win[hsh()])return 1;
if(j+1<4&&!mp[i][j+1]){
mp[i][j+1]=1;
if(!win[hsh()])return 1;
if(j+2<4&&!mp[i][j+2]){
mp[i][j+2]=1;
if(!win[hsh()])return 1;
mp[i][j+2]=0;
}
mp[i][j+1]=0;
}
if(i+1<4&&!mp[i+1][j]){
mp[i+1][j]=1;
if(!win[hsh()])return 1;
if(i+2<4&&!mp[i+2][j]){
mp[i+2][j]=1;
if(!win[hsh()])return 1;
mp[i+2][j]=0;
}
mp[i+1][j]=0;
}
if(i+1<4&&j+1<4&&!mp[i+1][j+1]){
mp[i+1][j+1]=1;
if(!win[hsh()])return 1;
if(i+2<4&&j+2<4&&!mp[i+2][j+2]){
mp[i+2][j+2]=1;
if(!win[hsh()])return 1;
mp[i+2][j+2]=0;
}
mp[i+1][j+1]=0;
}
if(j+1<4&&i>=1&&!mp[i-1][j+1]){
mp[i-1][j+1]=1;
if(!win[hsh()])return 1;
if(j+2<4&&i>=2&&!mp[i-2][j+2]){
mp[i-2][j+2]=1;
if(!win[hsh()])return 1;
mp[i-2][j+2]=0;
}
mp[i-1][j+1]=0;
}
mp[i][j]=0;
}
}
}
return 0;
}
void init(){
win[(1<<16)-1]=0;
for(int i=(1<<16)-2;i>=0;--i)win[i]=kz(i);
}
signed main(){
init();
for(int T=read();T;--T)
puts(win[rds()]?"Possible.":"Impossible.");
}```
P3830 [SHOI2012]随机树.cpp
```#include<bits/stdc++.h>
const int N=114.5141919810;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
int n,q;
double ans,dp[N][N];
signed main(){
std::cin>>q>>n;
if(q==1){
for(int i=2;i<=n;++i)ans+=2./i;
printf("%.6lf\n",ans);
}else{
rep(i,1,n)dp[i][0]=1;
rep(i,2,n)
rep(j,1,i-1){
rep(k,1,i-1)dp[i][j]+=dp[k][j-1]+dp[i-k][j-1]-dp[k][j-1]*dp[i-k][j-1];
dp[i][j]/=i-1;
}
rep(i,1,n-1)ans+=dp[n][i];
printf("%.6lf\n",ans);
}
return 0;
}```
P2114 [NOI2014]起床困难综合症.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
unsigned int a0=0,a1=-1,ans;
int n,m;
signed main(){
n=read(),m=read();
rep(i,1,n){
static char str[5];static int x;
scanf("%s%d",str,&x);
if(str[0]=='A')a0&=x,a1&=x;
else if(str[0]=='O')a0|=x,a1|=x;
else if(str[0]=='X')a0^=x,a1^=x;
}
for(int i=30;i>=0;--i)
if(a0>>i&1)ans+=1<<i;
else if(a1>>i&1&&m>=(1<<i))ans+=1<<i,m-=1<<i;
printf("%u\n",ans);
return 0;
}```
P3348 [ZJOI2016]大森林.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=200005;
int n,m,nq,q,ans[M];
int id[M],tot,rel,vir,L[M],R[M];
int fa[M],sum[M],val[M],ch[M][2];
struct node{
int pos,id,x,y;
node(){pos=id=x=y=0;}
node(int pos_,int id_,int x_,int y_){pos=pos_,id=id_,x=x_,y=y_;}
inline bool operator < (const node&t)const{return pos!=t.pos?pos<t.pos:id<t.id;}
}v[M<<1];
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){
sum[x]=sum[ch[x][0]]+sum[ch[x][1]]+val[x];
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;fa[y]=x,fa[x]=z;
pushup(y);
}
void splay(int x){
while(nroot(x)){
int y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[y][1]==x)^(ch[z][1]==y)?x:y);
rotate(x);
}
pushup(x);
}
int access(int x){
int y=0;
for(;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
return y;
}
void link(int x,int y){
splay(x),fa[x]=y;
}
void cutfa(int x){
access(x),splay(x),ch[x][0]=fa[ch[x][0]]=0,pushup(x);
}
int query(int x,int y){
int res=0,lca;
access(x),splay(x),res+=sum[x];
lca=access(y),splay(y),res+=sum[y];
access(lca),splay(lca),res-=sum[lca]<<1;
return res;
}
signed main(){
n=read(),m=read();
id[rel=++tot]=1,vir=++tot,val[1]=1,L[1]=1,R[1]=n,link(2,1);
rep(i,1,m){
int opt=read(),x,y,z;
if(opt==0){
x=read(),y=read();
id[++rel]=++tot,link(tot,vir),val[tot]=1,L[rel]=x,R[rel]=y;
}else if(opt==1){
x=read(),y=read(),z=read();
ckmax(x,L[z]),ckmin(y,R[z]);
if(x>y)continue;
++tot,link(tot,vir);
++q,v[q]=node(x,i-m,tot,id[z]);
++q,v[q]=node(y+1,i-m,tot,vir);
vir=tot;
}else{
x=read(),y=read(),z=read();
++q,v[q]=node(x,++nq,id[y],id[z]);
}
}
sort(v+1,v+q+1);
for(int i=1;i<=q;++i){
if(v[i].id<0)cutfa(v[i].x),link(v[i].x,v[i].y);
else ans[v[i].id]=query(v[i].x,v[i].y);
}
rep(i,1,nq)printf("%d\n",ans[i]);
return 0;
}```
CF734E Anton and Tree.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,c[N],U[N],V[N],id[N],cnt,f[N],ans;
struct edge{int nx,to;}e[N<<1];
int et,hed[N];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
if(c[u]!=c[ft])id[u]=++cnt;
else id[u]=id[ft];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u);
}
}
void dfs2(int u,int ft){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs2(v,u),ckmax(ans,f[v]+f[u]+1),ckmax(f[u],f[v]+1);
}
}
signed main(){
n=read();
rep(i,1,n)c[i]=read();
rep(i,1,n-1)
U[i]=read(),V[i]=read(),adde(U[i],V[i]),adde(V[i],U[i]);
c[0]=-1,dfs1(1,0);
memset(hed,0,sizeof(hed)),et=0;
rep(i,1,n-1)if(id[U[i]]!=id[V[i]])adde(id[U[i]],id[V[i]]),adde(id[V[i]],id[U[i]]);
dfs2(1,0);
printf("%d\n",(ans+1)>>1);
return 0;
}```
P5048 [Ynoi2019模拟赛]Yuno loves sqrt technology III.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
const int M=710;
int n,m;
int lastans;
int lsh[N],a[N],len;
int bel[N],L[M],R[M],size,num,val[M][M],bin[N],rev[N];
vector<int>f[N];
void init() {
size=sqrt(n),num=(n-1)/size+1;
for(int i=1;i<=num;++i)L[i]=R[i-1]+1,R[i]=i*size;
R[num]=n;
for(int i=1;i<=num;++i)
for(int j=L[i];j<=R[i];++j)
bel[j]=i;
for(int i=1,mx;i<=num;++i) {
mx=0,memset(bin,0,sizeof(bin));
for(int j=L[i];j<=n;++j) {
mx=max(mx,++bin[a[j]]);
if(j==R[bel[j]])val[i][bel[j]]=mx;
}
}
}
int query(int l,int r) {
if(bel[l]+1>=bel[r]) {
int mx=0;
for(int i=l;i<=r;++i)bin[a[i]]=0;
for(int i=l;i<=r;++i)mx=max(mx,++bin[a[i]]);
return mx;
}
int res=val[bel[l]+1][bel[r]-1];
for(int i=l;i<=R[bel[l]];++i) {
int p=rev[i];
while(p+res<f[a[i]].size()&&f[a[i]][p+res]<=r)++res;
}
for(int i=L[bel[r]];i<=r;++i) {
int p=rev[i];
while(p-res>-1&&f[a[i]][p-res]>=l)++res;
}
return res;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)lsh[i]=a[i]=rd();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
for(int i=1;i<=n;++i)
a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh,f[a[i]].pb(i),rev[i]=f[a[i]].size()-1;
init();
while(m--) {
int l=rd()^lastans,r=rd()^lastans;
printf("%d\n",lastans=query(l,r));
}
return 0;
}```
CF830D Singer House.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
#define N 405
int n,dp[N][N];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
signed main(){
n=read();
for(int i=1;i<=n;++i)dp[i][0]=1;
dp[1][1]=1;
for(int i=2;i<=n;++i){
for(int j=1;j<=n;++j){
for(int k=0;k<=j-1;++k)fmod(dp[i][j]+=1ll*dp[i-1][k]*dp[i-1][j-1-k]%mod);
for(int k=0;k<=j;++k) fmod(dp[i][j]+=1ll*dp[i-1][k]*dp[i-1][j-k]%mod);
for(int k=0;k<=j;++k) fmod(dp[i][j]+=1ll*dp[i-1][k]*dp[i-1][j-k]%mod*2*j%mod);
for(int k=0;k<=j+1;++k)fmod(dp[i][j]+=1ll*dp[i-1][k]*dp[i-1][j+1-k]%mod*j*(j+1)%mod);
}
}
printf("%d\n",dp[n][1]);
return 0;
}
```
P4577 [FJOI2018]领导集团问题.cpp
```#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <vector>
#include <iostream>
#include<cmath>
using std::cout;
using std::endl;
using std::vector;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200009;
const int T=N*26;
int n,w[N],f[N];
int lsh[N],m;
int val[T],ls[T],rs[T],root[N],tot,tag[T];
std::vector<int>g[N];
void pushup(int p) {
val[p]=val[ls[p]]+val[rs[p]];
}
int query(int ql,int qr,int l,int r,int p){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ql,qr,l,mid,ls[p]);
if(mid<qr)res+=query(ql,qr,mid+1,r,rs[p]);
return res;
}
int merge(int x,int y,int l,int r) {
if(!x||!y)return x|y;
if(l==r)return val[x]+=val[y],x;
int mid=(l+r)>>1;
ls[x]=merge(ls[x],ls[y],l,mid);
rs[x]=merge(rs[x],rs[y],mid+1,r);
return pushup(x),x;
}
void add(int pos,int l,int r,int &p,int k){
if(!p)p=++tot;
if(l==r)return val[p]+=k,void();
int mid=(l+r)>>1;
if(pos<=mid)add(pos,l,mid,ls[p],k);
else add(pos,mid+1,r,rs[p],k);
pushup(p);
}
int find(int v,int l,int r,int p,int sum) {
if(!p)return 1;
if(l==r)return l;
int mid=(l+r)>>1;
if(sum+val[ls[p]]<v)return find(v,l,mid,ls[p],sum);
else return find(v,mid+1,r,rs[p],sum+val[ls[p]]);
}
void dfs(int u) {
for(int v:g[u])
dfs(v),root[u]=merge(root[u],root[v],1,m);
int s=query(1,w[u],1,m,root[u]),t=find(s+1,1,m,root[u],0);
add(t,1,m,root[u],1);
if(w[u]!=m)add(w[u]+1,1,m,root[u],-1);
}
signed main() {
n=rd();
for (int i = 1; i <= n; ++i) w[i] = lsh[i] = rd();
sort(lsh + 1, lsh + n + 1), m = unique(lsh + 1, lsh + n +1) - lsh -1;
for (int i = 1; i <= n; ++i) w[i] = lower_bound(lsh + 1, lsh + m + 1, w[i]) - lsh;
for (int i = 2; i <= n; ++i) g[f[i] = rd()].push_back(i);
dfs(1), printf("%d\n", query(1,1,1,m,root[1]));
return 0;
}```
P4175 [CTSC2008]网络管理.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=80005;
const int M=N<<1;
int n,m,nq,nu,t[N],lsh[M],len,bel[M],tmr,S,ans[N];
int siz[N],fa[N],top[N],son[N],dep[N],st[N],ed[N],rev[M];
bool used[M];
struct node{int k,a,b;}o[N];
struct que{
int l,r,id,lca,pre,k;
que(){l=r=id=lca=pre=k=0;}
inline bool operator < (const que&t)const{return bel[l]!=bel[t.l]?l<t.l:bel[r]!=bel[t.r]?r<t.r:pre<t.pre;}
}q[N];
struct upd{int x,y,id;}u[N];
int hed[N],et;
struct edge{int nx,to;}e[M];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,rev[st[u]=++tmr]=u;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
rev[ed[u]=++tmr]=u;
}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
namespace BLO{
int bel[M],sum[M],cnt[M],S,L[M],R[M],num,added;
void init(){
S=sqrt(len),num=(len-1)/S+1;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=len;
rep(i,1,num)rep(j,L[i],R[i])bel[j]=i;
}
void update(int x,int d){
cnt[x]+=d,sum[bel[x]]+=d,added+=d;
}
int query(int k){
//cerr<<added<<'\n';
//rep(i,1,len)cerr<<cnt[i]<<' ';cerr<<'\n';
if(k>added)return -1;
int it=num;
while(k>sum[it])k-=sum[it--];
per(i,R[it],L[it]){
if(k<=cnt[i])return i;
k-=cnt[i];
}
}
}
void flip(int x){
used[x]?BLO::update(t[x],-1):BLO::update(t[x],1);used[x]^=1;
}
void modify(int x,int i){
if(used[u[x].x])BLO::update(t[u[x].x],-1),BLO::update(u[x].y,1);
swap(t[u[x].x],u[x].y);
}
signed main(){
n=read(),m=read();
rep(i,1,n)t[i]=lsh[++len]=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dfs1(1,0),dfs2(1,0);
//rep(i,1,n)cerr<<st[i]<<' ';cerr<<'\n';
//rep(i,1,n)cerr<<ed[i]<<' ';cerr<<'\n';
rep(i,1,m){
o[i].k=read(),o[i].a=read(),o[i].b=read();
if(!o[i].k)lsh[++len]=o[i].b;
}
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
rep(i,1,n)t[i]=lower_bound(lsh+1,lsh+len+1,t[i])-lsh;
rep(i,1,m)if(!o[i].k)o[i].b=lower_bound(lsh+1,lsh+len+1,o[i].b)-lsh;
rep(i,1,m){
if(!o[i].k)++nu,u[nu].x=o[i].a,u[nu].y=o[i].b;
else{
int x=o[i].a,y=o[i].b,lca=LCA(x,y);
++nq,q[nq].id=nq,q[nq].pre=nu,q[nq].k=o[i].k;
if(st[x]>st[y])x^=y^=x^=y;
if(lca==x)q[nq].l=st[x],q[nq].r=st[y],q[nq].lca=0;
else q[nq].l=ed[x],q[nq].r=st[y],q[nq].lca=lca;
}
}
S=pow(tmr,0.666);rep(i,1,tmr)bel[i]=(i-1)/S+1;
sort(q+1,q+nq+1);
BLO::init();
for(int i=1,l=1,r=0,nd=0;i<=nq;++i){
while(l>q[i].l)flip(rev[--l]);
while(r<q[i].r)flip(rev[++r]);
while(l<q[i].l)flip(rev[l++]);
while(r>q[i].r)flip(rev[r--]);
while(nd<q[i].pre)modify(++nd,i);
while(nd>q[i].pre)modify(nd--,i);
if(q[i].lca)flip(q[i].lca);
ans[q[i].id]=BLO::query(q[i].k);
if(q[i].lca)flip(q[i].lca);
}
rep(i,1,nq){
if(~ans[i])printf("%d\n",lsh[ans[i]]);
else puts("invalid request!");
}
return 0;
}
/*
5 5
5 1 2 3 4
3 1
2 1
4 3
5 3
2 4 5
0 1 2
2 2 3
2 1 4
3 3 5
*/```
P3953 逛公园.cpp
```#include<bits/stdc++.h>
using namespace std;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define M 200005
#define K 55
int n,m,k,mod,ans,flg,dis[N],dp[N][K];
bool vis[N],ins[N][K];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
struct edge{
int nxt,to,val;
}e[M],E[M];
int head[N],num_edge,Head[N],Num_edge;
void addedge(int fr,int to,int val){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].val=val;
e[num_edge].to=to;
head[fr]=num_edge;
}
void Addedge(int fr,int to,int val){
++Num_edge;
E[Num_edge].nxt=Head[fr];
E[Num_edge].val=val;
E[Num_edge].to=to;
Head[fr]=Num_edge;
}
void clear(){
ans=0;
memset(dp,-1,sizeof(dp));
memset(head,0,sizeof(head));
memset(Head,0,sizeof(Head));
num_edge=Num_edge=0,flg=1;
}
struct Dij{
int u,dis;
Dij(int u_,int d_){u=u_,dis=d_;}
inline bool operator < (const Dij&t)const{return dis>t.dis;}
};
priority_queue<Dij>q;
void dij(){
memset(dis,0x3f,sizeof(dis));
memset(vis,0,sizeof(vis));
q.push(Dij(1,dis[1]=0));
while(!q.empty()){
Dij now=q.top();q.pop();
int u=now.u;
if(vis[u])continue;
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(dis[v]>dis[u]+e[i].val){
dis[v]=dis[u]+e[i].val;
if(!vis[v])q.push(Dij(v,dis[v]));
}
}
}
}
int dfs(int u,int lft){
if(!flg)return 0;
if(ins[u][lft])return flg=0;
if(~dp[u][lft])return dp[u][lft];
int res=0;
ins[u][lft]=1;
for(int i=Head[u];i&&flg;i=E[i].nxt){
int v=E[i].to;
int w=lft-(E[i].val-(dis[u]-dis[v]));
if(w>=0)fmod(res+=dfs(v,w));
}
ins[u][lft]=0;
if(u==1&&!lft)++res;
return dp[u][lft]=res;
}
void Main(){
clear();
n=read(),m=read(),k=read(),mod=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),z=read();
addedge(x,y,z),Addedge(y,x,z);
}
dij();
for(int i=0;flg&&i<=k;++i)fmod(ans+=dfs(n,i));
flg?printf("%d\n",ans):puts("-1");
}
signed main(){for(int T=read();T;--T)Main();}```
CF685B Kay and Snowflake.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
const int inf=1000000007;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
vector<int>g[N];
int n,q,ans[N],siz[N],root,mx[N],sum,fa[N];
void dfs(int u) {
siz[u]=1;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
dfs(v),siz[u]+=siz[v],mx[u]=max(mx[u],siz[v]);
}
int mxu=mx[u],rt=u;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i],w=ans[v],now=max(mx[w],siz[u]-siz[w]),it=w;
while(fa[w]!=u) {
w=fa[w];
int tmp=max(mx[w],siz[u]-siz[w]);
if(tmp<now)now=tmp,it=w;
else break;
}
if(now<mxu)mxu=now,rt=it;
}
ans[u]=rt;
}
signed main() {
n=rd(),q=rd();
for(rint i=2,x;i<=n;++i)x=rd(),g[x].push_back(i),fa[i]=x;
mx[0]=n;dfs(1);
while(q--)printf("%d\n",ans[rd()]);
return 0;
}```
P4587 [FJOI2016]神秘数.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int T=N*32;
#define UP 1000000001
int n,a[N];
int ls[T],rs[T],sum[T],rt[N],tot;
void update(int pre,int&now,int pos,int l,int r){
now=++tot;
sum[now]=sum[pre]+pos,ls[now]=ls[pre],rs[now]=rs[pre];
//cerr<<now<<' '<<pos<<' '<<sum[now]<<' '<<l<<' '<<r<<'\n';
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[pre],ls[now],pos,l,mid);
else update(rs[pre],rs[now],pos,mid+1,r);
}
int query(int pre,int now,int ql,int qr,int l,int r){
if(!now)return 0;
//cerr<<pre<<' '<<now<<' '<<ql<<' '<<qr<<' '<<l<<' '<<r<<'\n';
if(ql<=l&&r<=qr)return sum[now]-sum[pre];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[pre],ls[now],ql,qr,l,mid);
if(mid<qr)res+=query(rs[pre],rs[now],ql,qr,mid+1,r);
return res;
}
signed main(){
n=read();
rep(i,1,n)a[i]=read(),update(rt[i-1],rt[i],a[i],1,UP);
for(int T=read();T;--T){
int l=read(),r=read(),nsm=1,lsm=0;
while("fyy AK IOI"){
int tmp=query(rt[l-1],rt[r],lsm+1,nsm,1,UP);
if(!tmp)break;
//cerr<<lsm+1<<' '<<nsm<<' '<<tmp<<'\n';
lsm=nsm,nsm+=tmp;
}
printf("%d\n",nsm);
}
return 0;
}```
P1007 独木桥.cpp
```#include <bits/stdc++.h>
using namespace std;
int l,n,p,ans1,ans2;
int main() {
scanf("%d%d",&l,&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&p);
ans1=max(ans1,min(l-p+1,p));
ans2=max(ans2,max(l-p+1,p));
}
printf("%d %d\n",ans1,ans2);
return 0;
}```
SP419 TRANSP - Transposing is Fun.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000003
inline int qpow(int n, int k) {
int res = 1;
for(; k; k >>= 1, n = 1ll * n * n % mod)
if(k & 1) res = 1ll * n * res % mod;
return res;
}
const int N = 500005;
int phi[N], pct, pri[N];
bool vis[N];
void init() {
phi[1] = 1;
for(int i = 2; i < N; ++i) {
if(!vis[i]) pri[++pct] = i, phi[i] = i - 1;
for(int j = 1; j <= pct && i * pri[j] < N; ++j) {
vis[i * pri[j]] = 1;
if(i % pri[j] == 0) {
phi[i * pri[j]] = phi[i] * pri[j];
break;
} else phi[i * pri[j]] = phi[i] * phi[pri[j]];
}
}
}
inline int gcd(int a, int b) {
while(b) { int t = a % b; a = b, b = t; }
return a;
}
signed main() {
init();
for(int T = read(); T; --T) {
int a = read(), b = read(), g = gcd(a, b), t = (a + b) / g, ans = 0;
for(int i = 1, x; i * i <= t; ++i) {
if(t % i) continue;
x = i, ans = (ans + 1ll * phi[t / x] * qpow(2, 1ll * g * x % (mod - 1)) % mod) % mod;
if(i * i != t) x = t / i, ans = (ans + 1ll * phi[t / x] * qpow(2, 1ll * g * x % (mod - 1)) % mod) % mod;
}
ans = (qpow(2, a + b) - 1ll * ans * qpow(t, mod - 2) % mod + mod) % mod;
printf("%d\n", ans);
}
}```
dinic最大流.cpp
```template<int NN,int MM>
struct Dinic{
static const int N=NN+5;
static const int M=(MM<<1)+5;
static const int inf=1<<30;
int hed[N],et,S,T;
struct edge{int fl,nx,to;}e[M];
int dis[N],cur[N];
Dinic(){et=1,memset(hed,0,sizeof(hed));}
void clear(){Dinic();}
void addedge(int u,int v,int fl){e[++et].nx=hed[u],hed[u]=et,e[et].fl=fl,e[et].to=v;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
for(int i=1;i<=N;++i)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl=0,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
int maxflow(){
int res=0;
while(bfs(S,T))res+=dfs(S,inf);
return res;
}
};```
CF1039C Network Safety.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int mod=1000000007;
inline int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
struct mint{
int x;
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
mint(LL v=0){x=v%mod,x<0?x+=mod:0;}
mint& operator += (const mint&t){fmod(x=x+t.x);return *this;}
mint& operator -= (const mint&t){fmod(x=x+mod-t.x);return *this;}
mint& operator *= (const mint&t){x=1ll*x*t.x%mod;return *this;}
mint& operator /= (const mint&t){x=1ll*x*qpow(t.x,mod-2)%mod;return *this;}
friend mint operator + (const mint&a,const mint&b){return mint(a)+=b;}
friend mint operator - (const mint&a,const mint&b){return mint(a)-=b;}
friend mint operator * (const mint&a,const mint&b){return mint(a)*=b;}
friend mint operator / (const mint&a,const mint&b){return mint(a)/=b;}
mint operator -(){return !x?0:mod-x;}
mint operator == (const mint&t){return x==t.x;}
mint operator != (const mint&t){return x!=t.x;}
mint operator < (const mint&t){return x<t.x;}
mint operator > (const mint&t){return x>t.x;}
mint operator <= (const mint&t){return x<=t.x;}
mint operator >= (const mint&t){return x>=t.x;}
friend ostream& operator << (ostream&stream,const mint&v){return stream<<v.x;}
friend istream& operator >> (istream&stream,mint&v){return stream>>v.x;}
explicit operator int() const{return x;}
};
const int N=500005;
int n,m,k,tot,cnt[N];
LL c[N];
map<LL,int>id;
map<int,int>F[N];
inline int anc(LL t,int x){return F[t][x]==x?x:F[t][x]=anc(t,F[t][x]);}
mint ans;
signed main(){
n=read(),m=read(),k=read();
rep(i,1,n)scanf("%lld",&c[i]);
ans=1ll*qpow(2,k)*qpow(2,n)%mod;
rep(i,1,m){
int x=read(),y=read();
LL t=c[x]^c[y];
if(!id[t])id[t]=++tot;
int j=id[t];
if(!F[j][x])F[j][x]=x;
if(!F[j][y])F[j][y]=y;
if(anc(j,x)==anc(j,y))continue;
F[j][anc(j,x)]=anc(j,y);
ans-=qpow(2,n-cnt[j]),++cnt[j];
ans+=qpow(2,n-cnt[j]);
}
cout<<ans<<'\n';
}```
P7394 「TOCO Round 1」History.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m;
int bz[20][N],st[N],dep[N],tmr,ed[N];
int et,hed[N];
struct edge{int nx,to;}e[N<<1];
inline void adde(int u,int v){
e[++et].nx=hed[u],e[et].to=v,hed[u]=et;
}
void dfs(int u,int ft){
dep[u]=dep[ft]+1,bz[0][u]=ft,st[u]=++tmr;
for(int i=1;1<<i<dep[u];++i)bz[i][u]=bz[i-1][bz[i-1][u]];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs(v,u);
}
ed[u]=tmr;
}
inline int kthanc(int u,int k){
for(int i=0;i<=19;++i)
if(k>>i&1)u=bz[i][u];
return u;
}
namespace arr{
const int T=N*25;
int rt[N],val[T],ls[T],rs[T],tot;
void update(int&p,int pre,int pos,int d,int l=1,int r=m){
p=++tot;
ls[p]=ls[pre],rs[p]=rs[pre];
if(l==r)return val[p]=d,void();
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],ls[pre],pos,d,l,mid);
else update(rs[p],rs[pre],pos,d,mid+1,r);
}
int query(int p,int pos,int l=1,int r=m){
if(!p)return 0;
if(l==r)return val[p];
int mid=(l+r)>>1;
if(pos<=mid)return query(ls[p],pos,l,mid);
else return query(rs[p],pos,mid+1,r);
}
}
namespace seg{
const int T=N*25;
int rt[N],val[T],ls[T],rs[T],tot;
void update(int&p,int pre,int pos,int d,int l=1,int r=n){
p=++tot;
val[p]=val[pre]+d,ls[p]=ls[pre],rs[p]=rs[pre];
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],ls[pre],pos,d,l,mid);
else update(rs[p],rs[pre],pos,d,mid+1,r);
}
int query(int p,int ql,int qr,int l=1,int r=n){
if(!p||ql>qr)return 0;
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[p],ql,qr,l,mid);
if(mid<qr)res+=query(rs[p],ql,qr,mid+1,r);
return res;
}
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dfs(1,0);
m=read();
for(int i=1;i<=m;++i){
int opt=read(),x=read(),y;
if(opt==1){
int lst=arr::query(arr::rt[i-1],dep[x]);
int v=seg::query(seg::rt[lst],st[x],st[x]);
seg::update(seg::rt[i],seg::rt[lst],st[x],v?-1:1);
arr::update(arr::rt[i],arr::rt[i-1],dep[x],i);
}else if(opt==2){
y=read(),arr::rt[i]=arr::rt[i-1];
if(y&1||y/2>=dep[x]){puts("0");continue;}
int lst=arr::query(arr::rt[i],dep[x]);
if(!y){puts(seg::query(seg::rt[lst],st[x],st[x])?"1":"0");continue;}
int so=kthanc(x,y/2-1),f=bz[0][so];
printf("%d\n",seg::query(seg::rt[lst],st[f],ed[f])-seg::query(seg::rt[lst],st[so],ed[so]));
}else arr::rt[i]=arr::rt[x];
}
}```
CF817D Imbalanced Array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define N (1000010)
int n,a[N],st[N],top,p[N],lpos[N],rpos[N];
long long sum1,sum2;
int main() {
scanf("%d",&n);
for(rint i=1;i<=n;++i)scanf("%d",&a[i]);
for(rint i=1;i<=n;++i) {
while(top&&a[st[top]]<=a[i])rpos[st[top--]]=i-1;
lpos[i]=st[top]+1,st[++top]=i;
}
while(top)rpos[st[top--]]=n;
for(rint i=1;i<=n;++i)sum1+=1ll*a[i]*(i-lpos[i]+1)*(rpos[i]-i+1);
memset(lpos,0,sizeof(lpos)),memset(rpos,0,sizeof(rpos));
for(rint i=1;i<=n;++i) {
while(top&&a[st[top]]>=a[i])rpos[st[top--]]=i-1;
lpos[i]=st[top]+1,st[++top]=i;
}
while(top)rpos[st[top--]]=n;
for(rint i=1;i<=n;++i)sum2+=1ll*a[i]*(i-lpos[i]+1)*(rpos[i]-i+1);
printf("%lld\n",sum1-sum2);
return 0;
}```
CF1299A Anu Has a Function.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
#define gc getchar()
int x = 0, f = 1; char c = gc;
while (!isdigit(c)) { if (c == '-') f = 0; c = gc; }
while (isdigit(c)) x = x * 10 + c - '0', c = gc;
#undef gc
return f ? x : -x;
}
#define N 100005
int n, a[N], cnt[35];
signed main(){
n = read();
for (int i = 1; i <= n; ++ i) {
a[i] = read();
for (int j = 0; j < 31; ++ j) cnt[j] += a[i] >> j & 1;
}
for (int i = 0; i < 31; ++ i) cerr << cnt[i] << ' '; cerr << '\n';
int pos = 114514, now = -1919810;
for (int i = 1; i <= n; ++ i) {
int sum = 0;
for (int j = 0; j < 31; ++ j) if (a[i] >> j & 1 && cnt[j] <= 1) sum += 1 << j;
if (sum > now) now = sum, pos = i;
}
swap(a[pos], a[1]);
for (int i = 1; i <= n; ++ i) printf("%d ",a[i]);
return 0;
}```
P2012 拯救世界2.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod = 1e9;
int qpow(int n, LL k) {
int res = 1;
for(; k; k >>= 1, n = 1ll * n * n % mod)
if (k & 1) res = 1ll * n * res % mod;
return res;
}
LL n;
int ans;
void fmod(int&x) {x += x >> 31 & mod, x -= mod, x += x >> 31 & mod;}
signed main() {
while (~scanf("%lld", &n)) {
if (! n) break;
if (n < 4) {puts("0"); continue;}
ans = 0;
fmod(ans += 81ll * qpow(12, n - 4)% mod);
fmod(ans -= qpow(8, n - 2));
fmod(ans += 6ll * qpow(4, n - 4) % mod);
fmod(ans += qpow(- 4, n - 4));
printf("%d\n", ans);
}
return 0;
}```
P1527 [国家集训队]矩阵乘法.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=505;
const int M=60005;
int n,m,a[N][N],lsh[N*N],b[N][N],len,ans[M];
vector<pair<int,int> >vc[N*N];
struct node{
int a1,b1,a2,b2,k,id;
}q[M],q1[M],q2[M];
int tr[N][N];
void add(int x,int y,int d){
for(int i=x;i<=n;i+=i&-i)
for(int j=y;j<=n;j+=j&-j)
tr[i][j]+=d;
}
int ask(int x,int y){
int res=0;
for(int i=x;i>0;i-=i&-i)
for(int j=y;j>0;j-=j&-j)
res+=tr[i][j];
return res;
}
void solve(int l,int r,int x,int y){
if(x>y)return;
if(l==r){
rep(i,x,y)ans[q[i].id]=lsh[l];
return;
}
int mid=(l+r)>>1,ii=0,jj=0,kk=x;
rep(i,l,mid)for(pair<int,int>j:vc[i])add(j.fi,j.se,1);
rep(i,x,y){
int t=ask(q[i].a2,q[i].b2)+ask(q[i].a1-1,q[i].b1-1)
-ask(q[i].a2,q[i].b1-1)-ask(q[i].a1-1,q[i].b2);
if(q[i].k<=t)q1[++ii]=q[i];
else q2[++jj]=q[i],q2[jj].k-=t;
}
rep(i,l,mid)for(pair<int,int>j:vc[i])add(j.fi,j.se,-1);
rep(i,1,ii)q[kk++]=q1[i];
rep(i,1,jj)q[kk++]=q2[i];
solve(l,mid,x,x+ii-1),solve(mid+1,r,x+ii,y);
}
signed main(){
n=read(),m=read();
rep(i,1,n)rep(j,1,n)lsh[++len]=a[i][j]=read();
rep(i,1,m)q[i].id=i,q[i].a1=read(),q[i].b1=read(),
q[i].a2=read(),q[i].b2=read(),q[i].k=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
rep(i,1,n)rep(j,1,n){
b[i][j]=lower_bound(lsh+1,lsh+len+1,a[i][j])-lsh;
vc[b[i][j]].pb(mkp(i,j));
}
solve(1,len,1,m);
rep(i,1,m)printf("%d\n",ans[i]);
return 0;
}```
P6541 [WC2018]即时战略.cpp
```#include<bits/stdc++.h>
#include "rts.h"
using namespace std;
#define pb push_back
#define sz(v) (int)v.size()
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##dnd;--i)
template<class T>inline bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>inline bool ckmin(T&x,T y){return x>y?x=y,1:0;}
typedef long long LL;
typedef double db;
const int N=300005;
int rd,a[N];
bool vis[N];
struct RAND{
const int basic=(1<<30)-1;
unsigned long long sa,sb,sc;
RAND(){
srand(time(0));
for(int i=0,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock()),sa=1ull*::rand()*::rand()*::rand();
for(int i=0,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock()),sb=1ull*::rand()*::rand()*::rand();
for(int i=0,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock()),sc=1ull*::rand()*::rand()*::rand();
}
int rand(){
sa^=sa<<32,sa^=sa>>13,sa^=sa<<1;
unsigned long long t=sa;
sa=sb,sb=sc,sc^=t^sa;
return sc&basic;
}
int rad(int l,int r){return rand()%(r-l+1)+l;}
}mk;
namespace data3{
void cov(int x,int y){
vis[x]=1;
while(x!=y)rd=explore(x,y),vis[x=rd]=1;
}
void main(const int&n){
int l=1,r=1;
rep(i,2,n){
int u=a[i];
if(vis[u])continue;
if(!vis[rd=explore(l,u)])cov(rd,u),l=u;
else cov(r,u),r=u;
}
}
}
namespace std{
const db alpha=0.75;
vector<int>e[N],to[N];
int fa[N],mx[N],rt,tsize,siz[N],reb,vt[N],sz[N],root;//sz是分治树的大小，vt是分治树上的父亲
bool used[N];
void getrt(int u,int ft){//找重心
siz[u]=1,mx[u]=0;
for(int i=0,up=sz(e[u]);i<up;++i){
int v=e[u][i];
if(v==ft||used[v])continue;
getrt(v,u),siz[u]+=siz[v];
ckmax(mx[u],siz[v]);
}
ckmax(mx[u],tsize-siz[u]);
if(mx[u]<mx[rt])rt=u;
}
void pia(int u){//拍扁，同时给要重构的点打标记
++tsize,used[u]=0;
for(int v:to[u])pia(v);
to[u].clear();
}
void dfs_build(int u){//普通建立点分树
used[u]=1,sz[u]=1;
for(int i=0,up=sz(e[u]);i<up;++i){
int v=e[u][i];
if(used[v])continue;
rt=0,tsize=siz[v],getrt(v,u);
int tmp=rt;//一定要存一下，rt在变
to[u].pb(rt),vt[rt]=u,dfs_build(rt),sz[u]+=sz[tmp];
}
}
void rebuild(int u){//重构
rt=0,tsize=0,pia(u);
getrt(u,0);
if(u==root)root=rt;
if(vt[u])
for(int i=0,up=sz(to[vt[u]]);i<up;++i)if(to[vt[u]][i]==u)to[vt[u]][i]=rt;
vt[rt]=vt[u];
dfs_build(rt);
}
void dfs_ins(int x,int ft){//点分树上插入一条边，ft已经在树上
used[x]=vis[x]=1;
fa[x]=vt[x]=ft,to[ft].pb(x),e[ft].pb(x),e[x].pb(ft);
for(int i=x;i;i=vt[i])++sz[i];
reb=0;
for(int i=x;vt[i];i=vt[i])if(sz[i]>1.*sz[vt[i]]*alpha)reb=vt[i];
if(reb)rebuild(reb);
}
void solve(int u,int t){//找到那个点并且加边
rd=explore(u,t);
if(!vis[rd]){
int x=rd;
dfs_ins(x,u);
while(x!=t){
rd=explore(x,t);
dfs_ins(rd,x);
x=rd;
}
return;
}
while(vt[rd]!=u)rd=vt[rd];
solve(rd,t);
}
void main(const int&n){
vis[1]=1,mx[rt=0]=n,sz[1]=1,used[1]=1,root=1;
rep(i,2,n){
int u=a[i];
if(vis[u])continue;
solve(root,u);
}
}
}
void play(int n,int T,int dataType){
vis[1]=1;
rep(i,2,n)a[i]=i;
rep(i,2,n)swap(a[i],a[mk.rad(2,n)]);//随机操作序列
if(dataType==3)data3::main(n);
else std::main(n);
}
```
CF1236B Alice and the List of Presents.cpp
```#include<bits/stdc++.h>
using namespace std;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
#define int long long
#define rint register int
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=1e9+7;
int qpow(int n,int k,int p) {
int res=1;
while(k) {
if(k&1)res=res*n%p;
n=n*n%p,k>>=1;
}
return res;
}
signed main() {
int n=rd(),m=rd();
printf("%lld\n",qpow(qpow(2,m,mod)-1,n,mod));
return 0;
}```
CF1337B Kana and Dragon Quest game.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int T,a,b,c;
signed main() {
T=rd();
while(T--) {
a=rd(),b=rd(),c=rd();
for(rint i=1;i<=b;++i) {
int t=a/2+10;
if(t>a)break;
a=t;
}
a-=c*10;
if(a<=0)puts("YES");
else puts("NO");
}
return 0;
}```
CF802I Fake News (hard).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define S (N<<1)
char str[N];
int n;
int trans[S][26],link[S],mxlen[S],lst,tot,cnt[S];
int t[S],q[S];
LL ans;
int extend(int c,int lst){
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else {
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
cnt[np]=1;
return np;
}
void Main(){
memset(trans,0,sizeof(trans));
memset(link,0,sizeof(link));
memset(mxlen,0,sizeof(mxlen));
memset(cnt,0,sizeof(cnt));
memset(t,0,sizeof(t));
lst=tot=1,ans=0;
scanf("%s",str),n=strlen(str);
for(int i=0;i<n;++i)lst=extend(str[i]-'a',lst);
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
for(int i=tot;i>=1;--i)cnt[link[q[i]]]+=cnt[q[i]];
for(int i=1;i<=tot;++i)ans+=1ll*cnt[i]*cnt[i]*(mxlen[i]-mxlen[link[i]]);
printf("%lld\n",ans);
}
signed main(){for(int T=read();T;--T)Main();}```
P5496 【模板】回文自动机（PAM）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n,tot,las;
int len[N],num[N],fail[N],tr[N][26];
char str[N];
int getfail(int x,int i){
while(i-len[x]-1<0||str[i]!=str[i-len[x]-1])x=fail[x];
return x;
}
signed main(){
scanf("%s",str),n=strlen(str);
len[0]=0,num[0]=0,fail[0]=1;
len[1]=-1,num[1]=0,fail[1]=0;
las=0,tot=1;
for(int i=0,lastans=0;i<n;++i){
if(i>=1)str[i]=(str[i]-97+lastans)%26+97;
int c=str[i]-'a',f=getfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[getfail(fail[f],i)][c];
tr[f][c]=tot;
len[tot]=len[f]+2;
num[tot]=num[fail[tot]]+1;
}
las=tr[f][c];
printf("%d ",lastans=num[las]);
}
return 0;
}```
P6185 [NOI Online #1 提高组]序列.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
int n,m,a[N],bl[N],cnt,c[N];
bool tag[N],Tag;
LL sum[2],v[N];
std::vector<pair<int,int> >E;
std::vector<int>g[N],e[N];
void clear(){
cnt=0,E.clear();
for(int i=1;i<=n;++i)g[i].clear(),e[i].clear(),bl[i]=tag[i]=v[i]=0,c[i]=-1;
}
void dfs1(int u){
bl[u]=cnt,v[cnt]+=a[u];
for(int v:g[u])if(!bl[v])dfs1(v);
}
bool dfs2(int u,int col){
if(~c[u])return c[u]==col;
sum[col]+=v[u],c[u]=col,Tag|=tag[u];
bool flg=1;
for(int v:e[u])if(!~c[v])flg&=dfs2(v,col^1);
return flg;
}
void Main(){
n=read(),m=read(),clear();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<=n;++i)a[i]=read()-a[i];
for(int i=1;i<=m;++i){
int t=read()-1,x=read(),y=read();
if(!t)E.pb(mkp(x,y));
if(t)g[x].pb(y),g[y].pb(x);
}
for(int i=1;i<=n;++i)if(!bl[i])++cnt,dfs1(i);
for(std::pair<int,int>i:E){
if(bl[i.x]==bl[i.y])tag[bl[i.x]]=1;
else e[bl[i.x]].pb(bl[i.y]),e[bl[i.y]].pb(bl[i.x]);
}
for(int i=1;i<=cnt;++i){
if(!~c[i]){
sum[0]=sum[1]=Tag=0;
if(dfs2(i,0)){
if(Tag){if((sum[0]-sum[1])%2)return puts("NO"),void();}
else if(sum[0]!=sum[1])return puts("NO"),void();
} else if((sum[0]-sum[1])%2)return puts("NO"),void();
}
}
puts("YES");
}
signed main(){for(int T=read();T;--T)Main();}```
AT4513 [AGC030D] Inversion Sum.cpp
```#include<bits/stdc++.h>
using namespace std;
#define N 3005
#define mod 1000000007
int n,q,x[N],y[N],a[N],dp[N][N],ans;
signed main(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;++i)scanf("%d",&a[i]);
for(int i=1;i<=q;++i)scanf("%d%d",&x[i],&y[i]);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
dp[i][j]=a[i]>a[j];
const int iv2=(mod+1)>>1;
for(int i=1;i<=q;++i){
dp[x[i]][y[i]]=dp[y[i]][x[i]]=1ll*iv2*(dp[x[i]][y[i]]+dp[y[i]][x[i]])%mod;
for(int j=1;j<=n;++j){
if(j==x[i]||j==y[i])continue;
dp[x[i]][j]=dp[y[i]][j]=1ll*iv2*(dp[x[i]][j]+dp[y[i]][j])%mod,
dp[j][x[i]]=dp[j][y[i]]=1ll*iv2*(dp[j][x[i]]+dp[j][y[i]])%mod;
}
}
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j)
ans=(ans+dp[i][j])%mod;
for(int i=1;i<=q;++i)ans=(ans<<1)%mod;
printf("%d\n",ans);
}
```
CF780E Underground Lab.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=N<<1;
int n,m,k,ans[N<<1],tot;
int hed[N],et;
struct edge{int nx,to;}e[M];
inline void adde(int u,int v){
e[++et].nx=hed[u],e[et].to=v,hed[u]=et;
}
bool vis[N];
void dfs(int u){
ans[++tot]=u;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(!vis[v])vis[v]=1,dfs(v),ans[++tot]=u;
}
}
signed main(){
n=read(),m=read(),k=read();
rep(i,1,m){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
vis[1]=1,dfs(1);
int len=(2*n-1)/k+1,cnt=0;
for(int i=1;i<=tot;i+=len){
if(i+len-1<=tot){
printf("%d",len),++cnt;
for(int j=i;j<=i+len-1;++j)printf(" %d",ans[j]);
puts("");
}else{
printf("%d",tot-i+1),++cnt;
for(int j=i;j<=tot;++j)printf(" %d",ans[j]);
puts("");
}
}
for(++cnt;cnt<=k;++cnt)puts("1 1");
return 0;
}```
CF1198C Matching vs Independent Set.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300005;
bool vis[N];
int n,m;
vector<int>v;
void Main() {
n=rd(),m=rd();
for(int i=1;i<=n*3;++i)vis[i]=0;
v.clear();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
if(!vis[x]&&!vis[y])vis[x]=vis[y]=1,v.push_back(i);
}
if(v.size()>=n){
puts("Matching");
for(int i=0;i<n;++i)printf("%d ",v[i]);
} else {
puts("IndSet");
for(int i=1,j=1;j<=n;++i)if(!vis[i])printf("%d ",i),++j;
}
puts("");
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
P4320 道路相遇.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int n,m,tot;
namespace Tree{
struct edge{int nx,to;}e[N<<1];
int et,hed[N];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
int top[N],fa[N],dep[N],siz[N],son[N],dfn[N],tmr,len[N];
void dfs1(int u,int ft){
dep[u]=dep[fa[u]=ft]+1,siz[u]=1,son[u]=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==ft)continue;
len[v]=len[u]+(v<=n),dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
void init(){dfs1(1,0),dfs2(1,1);}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
inline bool cmp(const int&a,const int&b){return dfn[a]<dfn[b];}
void solve(){
static int m,h[N],res,stk[N],top;
m=2,res=0;
rep(i,1,m)h[i]=read();
sort(h+1,h+m+1,cmp);
stk[top=1]=h[1];
for(int i=2;i<=m;++i){
int lca=LCA(h[i],stk[top]);
while(dep[stk[top-1]]>=dep[lca])res+=len[stk[top]]-len[stk[top-1]],--top;
if(stk[top]!=lca)res+=len[stk[top]]-len[lca],stk[top]=lca;
stk[++top]=h[i];
}
while(--top)res+=len[stk[top+1]]-len[stk[top]];
res+=stk[1]<=n;
printf("%d\n",res);
}
void clear(){
memset(hed,0,(tot+1)<<2);
et=tmr=0;
}
}
namespace cac{
int dfn[N],low[N],tmr,stk[N],top;
struct edge{int nx,to;}e[N<<1];
int et,hed[N];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void tarjan(int u){
stk[++top]=u,dfn[u]=low[u]=++tmr;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(!dfn[v]){
tarjan(v),ckmin(low[u],low[v]);
if(low[v]==dfn[u]){
++tot,Tree::adde(tot,u),Tree::adde(u,tot);
while(stk[top+1]!=v)
Tree::adde(tot,stk[top]),Tree::adde(stk[top],tot),--top;
}
}else ckmin(low[u],dfn[v]);
}
}
void init(){tot=n,tarjan(1);}
void clear(){
memset(low,0,(n+1)<<2);
memset(dfn,0,(n+1)<<2);
memset(hed,0,(n+1)<<2);
memset(stk,0,(n+1)<<2);
top=et=tmr=0;
}
}
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
cac::adde(x,y),cac::adde(y,x);
}
cac::init(),Tree::init();
for(int q=read();q;--q)Tree::solve();
cac::clear(),Tree::clear();
}```
自动取模整数.cpp
```const int mod=998244353;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
struct mint{
int x;
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
mint(LL v=0){x=v%mod,x<0?x+=mod:0;}
mint& operator += (const mint&t){fmod(x=x+t.x);return *this;}
mint& operator -= (const mint&t){fmod(x=x-t.x);return *this;}
mint& operator *= (const mint&t){x=1ll*x*t.x%mod;return *this;}
mint& operator /= (const mint&t){x=1ll*x*qpow(t.x,mod-2)%mod;return *this;}
friend mint operator + (const mint&a,const mint&b){return mint(a)+=b;}
friend mint operator - (const mint&a,const mint&b){return mint(a)-=b;}
friend mint operator * (const mint&a,const mint&b){return mint(a)*=b;}
friend mint operator / (const mint&a,const mint&b){return mint(a)/=b;}
mint operator -(){return !x?0:mod-x;}
mint operator == (const mint&t){return x==t.x;}
mint operator != (const mint&t){return x!=t.x;}
mint operator < (const mint&t){return x<t.x;}
mint operator > (const mint&t){return x>t.x;}
mint operator <= (const mint&t){return x<=t.x;}
mint operator >= (const mint&t){return x>=t.x;}
friend ostream& operator << (ostream&stream,const mint&v){return stream<<v.x;}
friend istream& operator >> (istream&stream,mint&v){return stream>>v.x;}
explicit operator int() const{return x;}
};```
P7382 [COCI2018-2019#6] Simfonija.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
int A[N], B[N], n, a[N], s[N], ans = 1e18, k;
signed main() {
n = read(), k = read();
rep(i, 1, n) A[i] = read();
rep(i, 1, n) B[i] = read();
for(int i = 1; i <= n; ++i) a[i] = A[i] - B[i];
sort(a + 1, a + n + 1);
for(int i = n; i >= 1; --i) a[i] -= a[1];
for(int i = 1; i <= n; ++i) s[i] = s[i - 1] + a[i];
// for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << '\n';
// for(int i = 1; i <= n; ++i) cout << s[i] << ' '; cout << '\n';
for(int l = 1; l <= n; ++l) {
int r = l + n - k - 1;
if(r > n) break;
int mid = (l + r) >> 1, t = (r - l + 1) >> 1;
if((r - l + 1) & 1) {
ckmin(ans, s[r] - s[mid] - a[mid] * t + a[mid] * t - (s[mid - 1] - s[l - 1]));
} else ckmin(ans, s[r] - s[mid] - a[mid] * t + a[mid] * t - (s[mid] - s[l - 1]));
}
cout << ans << '\n';
return 0;
}```
P6021 洪水.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int rdc(){
char ch=getchar();
while(ch!='Q'&&ch!='C')ch=getchar();
return ch=='Q';
}
const int N=200005;
const LL inf=1e14;
const int T=N<<2;
int n,dp[N];
LL a[N];
int head[N],num_edge;
int dfn[N],rev[N],tmr,fa[N],siz[N],son[N],top[N],ed[N];
struct edge{
int nxt,to;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
struct Matrix {
LL a[2][2];
Matrix(){a[0][0]=a[0][1]=a[1][0]=a[1][1]=inf;}
LL*operator[](const int&k){return a[k];}
Matrix operator * (const Matrix&b){
Matrix res;
res[0][0]=min(a[0][0]+b.a[0][0],a[0][1]+b.a[1][0]);
res[0][1]=min(a[0][0]+b.a[0][1],a[0][1]+b.a[1][1]);
res[1][0]=min(a[1][0]+b.a[0][0],a[1][1]+b.a[1][0]);
res[1][1]=min(a[1][0]+b.a[0][1],a[1][1]+b.a[1][1]);
return res;
}
void print(){
printf("%lld %lld\n%lld %lld\n\n",a[0][0],a[0][1],a[1][0],a[1][1]);
}
}mat[N],val[T];
void dfs1(int u,int ft){
if(!e[head[u]].nxt)return dp[u]=a[u],siz[u]=1,void();
LL sum=0;siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),sum+=dp[v],siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
dp[u]=min(sum,a[u]);
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr,rev[tmr]=u,ed[tp]=tmr;
mat[u][0][0]=0,mat[u][0][1]=a[u],
mat[u][1][0]=0,mat[u][1][1]=0;
if(!son[u])return mat[u][0][0]=inf,void();
dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v),mat[u][0][0]+=dp[v];
}
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=val[lc]*val[rc];}
void build(int l,int r,int p=1){
if(l==r)return val[p]=mat[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
Matrix query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1;
if(qr<=mid)return query(ql,qr,l,mid,lc);
if(mid<ql)return query(ql,qr,mid+1,r,rc);
return query(ql,qr,l,mid,lc)*query(ql,qr,mid+1,r,rc);
}
void change(int pos,int l=1,int r=n,int p=1){
if(l==r)return val[p]=mat[rev[pos]],void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,l,mid,lc);
else change(pos,mid+1,r,rc);
pushup(p);
}
void update(int x,int v){
mat[x][0][1]+=v,a[x]+=v;
while(x){
Matrix lst=query(dfn[top[x]],ed[top[x]]);
change(dfn[x]);
Matrix now=query(dfn[top[x]],ed[top[x]]);
x=fa[top[x]];
mat[x][0][0]+=min(now[0][0],now[0][1])-min(lst[0][0],lst[0][1]);
}
}
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
dfs1(1,0),dfs2(1,1),build(1,n);
for(int m=read();m;--m){
int opt=rdc(),x=read();
if(opt){
Matrix t=query(dfn[x],ed[top[x]]);
printf("%lld\n",min(t[0][0],t[0][1]));
}
else update(x,read());
}
return 0;
}```
CF1251F Red-White Fence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=600005;
int n,k,a[N],q,ans[N],cnt[N];
namespace math{
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
int pw2[N],fac[N],ifc[N],inv[N];
void initmath(const int&n=600000){
pw2[0]=1;for(int i=1;i<=n;++i)fmod(pw2[i]=pw2[i-1]<<1);
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
int binom(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
}
namespace poly{
using math::qpow;
using math::fmod;
const int M=N<<2;
int lim,rev[M],lg;
void init_poly(const int&n){
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:math::inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*h,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)h[i]=1ll*A[i]*B[i]%mod;
NTT(h,0);
}
void solve(int up){
static int x,y,A[M],B[M];
x=y=0;
for(int i=1;i<up;++i)
if(cnt[i]==1)++x;
else if(cnt[i]>=2)++y;
y<<=1;
for(int i=0;i<=x;++i)A[i]=1ll*math::pw2[i]*math::binom(x,i)%mod;
for(int i=0;i<=y;++i)B[i]=math::binom(y,i);
poly_mul(A,B,A,x+1,y+1);
for(int i=0;i<=min(x+y,N-5);++i)fmod(ans[i+up+1]+=A[i]);
}
}
signed main(){
n=read(),k=read(),math::initmath();
for(int i=1;i<=n;++i)++cnt[a[i]=read()];
for(int i=1;i<=k;++i)poly::solve(read());
q=read();
for(int i=1;i<=q;++i)printf("%d\n",ans[read()>>1]);
return 0;
}```
CF1305D Kuroni and the Celebration.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int n,num,lca,ind[N];
vector<int>leaf,e[N];
signed main(){
scanf("%d",&n);
for(int i=1;i<n;++i){
int x,y;scanf("%d%d",&x,&y);
++ind[x],++ind[y],e[x].pb(y),e[y].pb(x);
}
for(int i=1;i<=n;++i)if(ind[i]==1)leaf.pb(i),++num;
while(num>1){
int x=leaf[num-1],y=leaf[num-2];
printf("? %d %d\n",x,y),fflush(stdout);
scanf("%d",&lca);
if(lca==x||lca==y)return printf("! %d\n",lca),fflush(stdout),0;
num-=2,leaf.pop_back(),leaf.pop_back();
for(int i:e[x])if(--ind[i]==1)leaf.pb(i),++num;
for(int i:e[y])if(--ind[i]==1)leaf.pb(i),++num;
// for(int i:leaf)std::cerr<<i<<' ';std::cerr<<'\n';
}
printf("! %d\n",leaf[0]),fflush(stdout);
}```
线段树合并.cpp
```template<int N,int T>
struct Merge_Segment_Tree{
int ls[T],rs[T],sum[T],mx[T],id[T],tot;
Merge_Segment_Tree(){
tot=0;
memset(mx,0,sizeof(mx));
memset(sum,0,sizeof(sum));
memset(id,0,sizeof(id));
memset(ls,0,sizeof(ls));
memset(rs,0,sizeof(rs));
}
void pushup(int p){
sum[p]=sum[ls[p]]+sum[rs[p]];
if(mx[ls[p]]>=mx[rs[p]])mx[p]=mx[ls[p]],id[p]=id[ls[p]];
else mx[p]=mx[rs[p]],id[p]=id[rs[p]];
}
void update(int&p,int pos,int k,int l=1,int r=N){
if(!p)p=++tot;
if(l==r){
mx[p]+=k,sum[p]+=k,id[p]=pos;
return;
}
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
pushup(p);
}
pair<int,int>query_max(int p,int ql,int qr,int l=1,int r=N){
if(!p)return mkp(0,0);
if(ql<=l&&r<=qr)return mkp(mx[p],id[p]);
int mid=(l+r)>>1;pair<int,int>res=mkp(0,0);
if(ql<=mid)res=max(res,query_max(ls[p],ql,qr,l,mid));
if(mid<qr)res=max(res,query_max(rs[p],ql,qr,mid+1,r));
return res;
}
int query_sum(int p,int ql,int qr,int l=1,int r=N){
if(!p)return 0;
if(ql<=l&&r<=qr)return sum[p];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query_sum(ls[p],ql,qr,l,mid);
if(mid<qr)res+=query_sum(rs[p],ql,qr,mid+1,r);
return res;
}
int merge(int x,int y,int l=1,int r=N){
if(!x||!y)return x|y;
if(l==r){
sum[x]+=sum[y];
mx[x]+=mx[y];
return x;
}
int mid=(l+r)>>1;
ls[x]=merge(ls[x],ls[y],l,mid);
rs[x]=merge(rs[x],rs[y],mid+1,r);
return pushup(x),x;
}
};```
CF1034E Little C Loves 3 III.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdc(){
char ch=getchar();
while(!isdigit(ch))ch=getchar();
return ch-'0';
}
const int N=1<<21;
int n,m;
LL a[N],b[N];
void fwt(LL*a,int op){
for(int i=1;i<m;i<<=1)
for(int j=0;j<m;j+=i<<1)
for(int k=0;k<i;++k)
a[i+j+k]+=a[j+k]*op;
}
signed main(){
m=(1<<(n=read()));
for(int i=0;i<m;++i)a[i]=(1ll<<(__builtin_popcount(i)<<1))*rdc();
for(int i=0;i<m;++i)b[i]=(1ll<<(__builtin_popcount(i)<<1))*rdc();
fwt(a,1),fwt(b,1);
for(int i=0;i<m;++i)a[i]*=b[i];
fwt(a,-1);
for(int i=0;i<m;++i)putchar('0'+((a[i]>>(__builtin_popcount(i)<<1))&3));
puts("");
return 0;
}```
P2766 最长不下降子序列问题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1005
#define M (N*N)
const int inf=0x3f3f3f3f;
int n,a[N];
int ans1,ans2,ans3;
int lsh[N],len,dp[N],tr[N];
int hed[N],et=1,S,T;
int dis[N],cur[N];
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
void add(int x,int d){for(int i=x;i<=n;i+=i&-i)ckmax(tr[i],d);}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)ckmax(res,tr[i]);return res;}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
dis[s]=1,q.push(s);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl=0,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl)used+=rl,e[i].fl-=rl,e[i^1].fl=rl;
}
}
return used;
}
signed main(){
n=read();
if(n==1)return puts("1\n1\n1"),0;
rep(i,1,n)a[i]=lsh[i]=read();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
rep(i,1,n)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
rep(i,1,n)dp[i]=ask(a[i])+1,add(a[i],dp[i]),ckmax(ans1,dp[i]);
printf("%d\n",ans1);
S=n*2+1,T=S+1;
rep(i,1,n){adde(i,i+n,1);if(dp[i]==1)adde(S,i,1);if(dp[i]==ans1)adde(i+n,T,1);}
rep(i,1,n)rep(j,i+1,n)if(a[i]<=a[j]&&dp[i]+1==dp[j])adde(i+n,j,1);
while(bfs(S,T))ans2+=dfs(S,inf);
printf("%d\n",ans2);
ans3=ans2;
adde(S,1,inf),adde(1,1+n,inf);
if(dp[n]==ans1)adde(n*2,T,inf),adde(n,n*2,inf);
while(bfs(S,T))ans3+=dfs(S,inf);
printf("%d\n",ans3);
}```
P5569 [SDOI2008]石子合并.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=40010;
int n;
LL a[N],ans;
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
int i=1,j,k;
for(;i<n-1;) {
for(j=i;j<n-1;++j) {
if(a[j]>a[j+2])continue;
a[j+1]+=a[j],ans+=a[j+1];
for(k=j;k>i;--k)a[k]=a[k-1];
++i,k=j+1;
while(i<k&&a[k-1]<a[k])swap(a[k-1],a[k]),--k;
break;
}
if(j==n-1)a[n-1]+=a[n],ans+=a[--n];
}
if(i==n-1)ans+=a[n-1]+a[n];
printf("%lld\n",ans);
return 0;
}
```
P4899 [IOI2018] werewolf 狼人.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int M=400005;
int n,m,q,root[M],to[M];
struct node{
int x,y,z;
}a[M];
struct Kruskal_Tree{//TYPE=0:max;TYPE=1:min
int TYPE=-1,F[M],cnt,val[M],num_edge,head[M],fa[20][M],dep[M],ld[M],rd[M],timer,rev[M];
Kruskal_Tree(){}
void init(int t){TYPE=t;}
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
struct edge{
int nxt,to;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u){
ld[u]=++timer,rev[timer]=u;
for(int i=1;1<<i<=dep[u];++i)fa[i][u]=fa[i-1][fa[i-1][u]];
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
dep[v]=dep[u]+1,fa[0][v]=u,dfs(v);
}
rd[u]=timer;
}
void build(){
for(int i=1;i<n<<1;++i)F[i]=i;cnt=n;
for(int i=1;i<=m;++i)a[i].z=TYPE?max(a[i].x,a[i].y):min(a[i].x,a[i].y);
sort(a+1,a+m+1,[&](const node&a,const node&b){return TYPE?a.z<b.z:a.z>b.z;});
for(int i=1;i<=m;++i){
int u=a[i].x,v=a[i].y,fx=find(u),fy=find(v);
if(fx!=fy){
++cnt,val[cnt]=a[i].z;
F[fx]=F[fy]=cnt;
addedge(cnt,fx),addedge(cnt,fy);
if(cnt==n*2-1)break;
}
}
dfs(cnt);
}
}T[2];
namespace seg{
const int T=M*24;
int ls[T],rs[T],val[T],tot;
void update(int &p,int pre,int l,int r,int pos){
p=++tot;
ls[p]=ls[pre],rs[p]=rs[pre],val[p]=val[pre]+1;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],ls[pre],l,mid,pos);
else update(rs[p],rs[pre],mid+1,r,pos);
}
int query(int p,int pre,int ql,int qr,int l,int r){
if(ql<=l&&r<=qr)return val[p]-val[pre];
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ls[p],ls[pre],ql,qr,l,mid);
if(mid<qr)res+=query(rs[p],rs[pre],ql,qr,mid+1,r);
return res;
}
}
signed main(){
n=read(),m=read(),q=read(),T[0].init(0),T[1].init(1);
for(int i=1;i<=m;++i)a[i].x=read()+1,a[i].y=read()+1;
T[0].build(),T[1].build();
for(int i=1;i<=n;++i)to[T[0].ld[i]]=T[1].ld[i];
for(int i=1;i<n<<1;++i)
if(T[0].rev[i]>n)root[i]=root[i-1];
else seg::update(root[i],root[i-1],1,(n<<1)-1,to[i]);
while(q--){
int s=read()+1,e=read()+1,l=read()+1,r=read()+1;
for(int i=19;~i;--i)if(T[0].fa[i][s]&&T[0].val[T[0].fa[i][s]]>=l)s=T[0].fa[i][s];
for(int i=19;~i;--i)if(T[1].fa[i][e]&&T[1].val[T[1].fa[i][e]]<=r)e=T[1].fa[i][e];
puts(seg::query(root[T[0].rd[s]],root[T[0].ld[s]-1],T[1].ld[e],T[1].rd[e],1,(n<<1)-1)?"1":"0");
}
return 0;
}
```
CF163E e-Government.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int rdc() {
char ch=getchar();
while(ch!='+'&&ch!='-'&&ch!='?')ch=getchar();
if(ch=='+')return 1;
else if(ch=='-')return 2;
return 3;
}
const int N=100010;
const int M=1000010;
int n,k;
bool vis[N];
string S;
int ch[M][26],tot,ed[N],fail[M];
int lp[M],rp[M],timer;
vector<int>g[M];
int tr[M];
void insert(string s,int id) {
int len=s.length(),u=0;
for(int i=0;i<len;++i) {
int c=s[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
ed[id]=u;
}
void make_fail() {
queue<int>q;
for(int i=0;i<26;++i)
if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=tot;++i)g[fail[i]].pb(i);
}
void dfs(int u) {
lp[u]=++timer;
for(int v:g[u])dfs(v);
rp[u]=timer;
}
void add(int x,int d) {
for(int i=x;i<=tot+1;i+=i&-i)tr[i]+=d;
}
void add(int l,int r,int d) {
add(l,d),add(r+1,-d);
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
signed main() {
cin.tie(0),cout.tie(0);
cin>>n>>k;
for(int i=1;i<=k;++i)
cin>>S,insert(S,i);
make_fail(),dfs(0);
for(int i=1;i<=k;++i)
add(lp[ed[i]],rp[ed[i]],1),vis[i]=1;
for(;n;--n) {
int opt=rdc();
if(opt==1) {
int x=rd();
if(vis[x])continue;
vis[x]=1,add(lp[ed[x]],rp[ed[x]],1);
} else if(opt==2) {
int x=rd();
if(!vis[x])continue;
vis[x]=0,add(lp[ed[x]],rp[ed[x]],-1);
} else {
cin>>S;LL res=0;
for(int i=0,len=S.length(),u=0;i<len;++i)
u=ch[u][S[i]-'a'],res+=ask(lp[u]);
cout<<res<<'\n';
}
}
return 0;
}```
P7392 「TOCO Round 1」奇怪的排序.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
#define mod 1000000007
inline int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
int fac[N],ifc[N];
inline void init(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
inline int C(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
int n,k,ans;
void Main(){
n=read(),k=read();
int a0=n,a1=0,b0=1,b1=0;
rep(i,1,k){
int c0=0,c1=0,d0=0,d1=0;
if(a0==1){
if(b1){
if(a1&1)b0+=b1;
else b1*=2;
a1>>=1;
}
break;
}
if(!b1){
if(a0&1)c0=a0>>1,c1=c0+1,d0=b0,d1=b0;
else c0=a0>>1,d0=b0*2;
}else{
c0=a0>>1,c1=c0+1;
if(a0&1)d0+=b0,d1+=b0;
else d0+=b0*2;
if(a1&1)d0+=b1,d1+=b1;
else d1+=b1*2;
}
a0=c0,a1=c1,b0=d0,b1=d1;
}
ans=1ll*fac[n]*qpow(ifc[a0],b0)%mod*qpow(ifc[a1],b1)%mod;
printf("%d\n",ans);
}
signed main(){
init();
for(int T=read();T;--T)Main();
}```
P1002 过河卒.cpp
```#include<bits/stdc++.h>
using namespace std;
long long mmap[25][25],n,m,xx,yy,s[25][25];
int dx[9]={1,1,2,2,-1,-1,-2,-2};
int dy[9]={2,-2,1,-1,2,-2,1,-1};
bool ok(int x,int y)
{
if(x>n||x<1||y>m||y<1)return false;
return true;
}
int main()
{
scanf("%d%d%d%d",&n,&m,&xx,&yy);
n++;m++;xx++;yy++;
mmap[1][1]=1;
s[xx][yy]=1;
for(int i=0;i<8;i++)
{
if(ok(xx+dx[i],yy+dy[i]))s[xx+dx[i]][yy+dy[i]]=1;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
if(s[i][j])continue;
mmap[i][j]=max(mmap[i][j],mmap[i-1][j]+mmap[i][j-1]);
}
printf("%lld\n",mmap[n][m]);
return 0;
}```
CF553E Kyoya and Train.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int V=55;
const int E=105;
const int N=20005;
const int M=N<<2;
const db inf=1e15;
int n,m,t,X,a[E],b[E],c[E];
db p[E][N<<1],dis[V][V],f[E][N<<1];
namespace poly{
const db PI=acos(-1.0);
int rev[M],lg,lim;
db g[E][N<<1];
void init(const int&n){
for(lg=0,lim=1;lim<=n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
};
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
cp wn=cp(cos(PI/i),sin(PI/i)*(op?1:-1));
for(int j=0;j<lim;j+=i<<1){
cp w0=cp(1,0);
for(int k=0;k<i;++k,w0=w0*wn){
const cp X=a[j+k],Y=w0*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(op)return;
for(int i=0;i<lim;++i)a[i].x/=lim;
}
void CDQ_FFT(int l,int r){
if(l==t&&r==2*t-1)return;
static cp A[M],B[M];
if(l==r){
rep(i,1,n-1)f[i][l]=inf;
for(int i=1;i<=m;++i)if(a[i]!=n)ckmin(f[a[i]][l],g[i][l]+c[i]);
return;
}
int mid=(l+r)>>1;
CDQ_FFT(mid+1,r);
init(r-l+r-mid);
for(int i=1;i<=m;++i){
if(a[i]==n)continue;
for(int j=0;j<lim;++j)A[j]=B[j]=cp(0,0);
for(int j=0;j<=r-l;++j)A[j].x=p[i][j];
for(int j=mid+1;j<=r;++j)B[j-mid-1].x=f[b[i]][r-j+mid+1];
FFT(A,1),FFT(B,1);
for(int j=0;j<lim;++j)A[j]=A[j]*B[j];
FFT(A,0);
for(int j=l;j<=mid;++j)g[i][j]+=A[r-j].x;
}
CDQ_FFT(l,mid);
}
}
signed main(){
n=read(),m=read(),t=read(),X=read();
rep(i,1,n)rep(j,1,n)dis[i][j]=i==j?0:inf;
for(int i=1;i<=m;++i){
a[i]=read(),b[i]=read(),c[i]=dis[a[i]][b[i]]=read();
rep(j,1,t)p[i][j]=1.*read()/100000;
}
rep(k,1,n)rep(i,1,n)rep(j,1,n)ckmin(dis[i][j],dis[i][k]+dis[k][j]);
rep(i,1,n-1)rep(j,t,t*2-1)f[i][j]=dis[i][n]+X;
rep(i,0,t*2-1)f[n][i]=i<=t?0:X;
poly::CDQ_FFT(0,t*2-1);
printf("%.9lf\n",f[1][0]);
return 0;
}
```
P5471 [NOI2019]弹跳.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 70005
#define M 1500005
int n,m;
int to[N],cmp_D,rt;
int dis[N<<1];
bool vis[N<<1];
int nxt[M],head[N],cnt,ver[M];
int z[N];
int L[M],R[M],D[M],U[M],W[M];
struct kdt{
int mx[2],mn[2],ch[2],d[2],id;
#define ls(x) t[x].ch[0]
#define rs(x) t[x].ch[1]
}t[N];
struct dij{
int u,dis;
dij(){u=dis=0;}
dij(int u_,int d_){u=u_,dis=d_;}
inline bool operator < (const dij&t)const{return dis>t.dis;}
};
bool cmp(const kdt&a,const kdt&b){return a.d[cmp_D]<b.d[cmp_D];}
void pushup(int p){
t[p].mx[0]=t[p].mn[0]=t[p].d[0];
t[p].mx[1]=t[p].mn[1]=t[p].d[1];
if(ls(p))
t[p].mx[0]=max(t[p].mx[0],t[ls(p)].mx[0]),
t[p].mx[1]=max(t[p].mx[1],t[ls(p)].mx[1]),
t[p].mn[0]=min(t[p].mn[0],t[ls(p)].mn[0]),
t[p].mn[1]=min(t[p].mn[1],t[ls(p)].mn[1]);
if(rs(p))
t[p].mx[0]=max(t[p].mx[0],t[rs(p)].mx[0]),
t[p].mx[1]=max(t[p].mx[1],t[rs(p)].mx[1]),
t[p].mn[0]=min(t[p].mn[0],t[rs(p)].mn[0]),
t[p].mn[1]=min(t[p].mn[1],t[rs(p)].mn[1]);
}
int build(int l,int r,int D){
int mid=(l+r)>>1;
cmp_D=D,nth_element(t+l,t+mid,t+r+1,cmp),to[t[mid].id]=mid;
if(l!=mid)ls(mid)=build(l,mid-1,D^1);
if(r!=mid)rs(mid)=build(mid+1,r,D^1);
return pushup(mid),mid;
}
void get(int p,int l,int r,int d,int u,int lim){
if(!p||dis[p]<=lim)return;
if(l<=t[p].mn[0]&&t[p].mx[0]<=r&&d<=t[p].mn[1]&&t[p].mx[1]<=u)return z[++z[0]]=p,void();
if(r<t[p].mn[0]||l>t[p].mx[0]||u<t[p].mn[1]||d>t[p].mx[1])return;
if(l<=t[p].d[0]&&t[p].d[0]<=r&&d<=t[p].d[1]&&t[p].d[1]<=u)z[++z[0]]=p+n;
get(ls(p),l,r,d,u,lim),get(rs(p),l,r,d,u,lim);
}
void Dij(){
priority_queue<dij>q;
memset(dis,0x3f,sizeof(dis));
q.push(dij(to[1]+n,dis[to[1]+n]=0));
while(!q.empty()){
dij now=q.top();q.pop();
int u=now.u;
if(vis[u])continue;
vis[u]=1;
if(u<=n){
if(ls(u)&&dis[ls(u)]>dis[u])dis[ls(u)]=dis[u],q.push(dij(ls(u),dis[ls(u)]));
if(rs(u)&&dis[rs(u)]>dis[u])dis[rs(u)]=dis[u],q.push(dij(rs(u),dis[rs(u)]));
if(dis[u+n]>dis[u])dis[u+n]=dis[u],q.push(dij(u+n,dis[u+n]));
}else{
for(int i=head[u-n];i;i=nxt[i]){
int t=ver[i],V=dis[u]+W[t];
z[0]=0,get(rt,L[t],R[t],D[t],U[t],V);
for(int j=1;j<=z[0];++j)
if(dis[z[j]]>V)dis[z[j]]=V,q.push(dij(z[j],dis[z[j]]));
}
}
}
}
signed main(){
n=read(),m=read(),read(),read();
for(int i=1;i<=n;++i)t[i].d[0]=read(),t[i].d[1]=read(),t[i].id=i;
rt=build(1,n,0);
for(int i=1;i<=m;++i){
int x=read();
ver[++cnt]=i,nxt[cnt]=head[to[x]],head[to[x]]=cnt;
W[i]=read(),L[i]=read(),R[i]=read(),D[i]=read(),U[i]=read();
}
Dij();
for(int i=2;i<=n;++i)printf("%d\n",dis[to[i]+n]);
return 0;
}```
CF1303F Number of Components.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=305;
const int M=2000005;
int n,m,q,F[N*N],a[N][N],tot,ans[M],tag[M],siz[N*N],stk[N*N],top;
bool chg[M];
struct edge{
int x,y,c,l,r;
}e[N*N*2+M*4];
inline int anc(int x){while(x!=F[x])x=F[x];return x;}
inline void merge(int x,int y){
x=anc(x),y=anc(y);
if(x==y)return;
if(siz[x]>siz[y])x^=y^=x^=y;
F[x]=y,siz[y]+=siz[x],stk[++top]=x;
}
inline void undo(){
int x=stk[top--];
siz[F[x]]-=siz[x],F[x]=x;
}
map<pair<int,int>,int>mp;
inline int id(int x,int y){return (x-1)*m+y;}
inline bool cmp(const edge&a,const edge&b){
return a.r>b.r;
}
signed main(){
n=read(),m=read(),q=read();
rep(i,1,n)rep(j,1,m){
if(i<n){
mp[mkp(id(i+1,j),id(i,j))]=mp[mkp(id(i,j),id(i+1,j))]=++tot;
e[tot].l=0,e[tot].r=q+1,e[tot].x=id(i+1,j),e[tot].y=id(i,j),e[tot].c=0;
}
if(j<m){
mp[mkp(id(i,j+1),id(i,j))]=mp[mkp(id(i,j),id(i,j+1))]=++tot;
e[tot].l=0,e[tot].r=q+1,e[tot].x=id(i,j+1),e[tot].y=id(i,j),e[tot].c=0;
}
}
rep(i,1,q){
static int lst=0;
int x=read(),y=read(),c=read();
if(c!=lst)chg[i]=1,lst=c;
if(a[x][y]==c)continue;
if(x>1&&a[x-1][y]==a[x][y]){
int j=mp[mkp(id(x-1,y),id(x,y))]; e[j].r=i;
}
if(y>1&&a[x][y-1]==a[x][y]){
int j=mp[mkp(id(x,y-1),id(x,y))]; e[j].r=i;
}
if(x<n&&a[x+1][y]==a[x][y]){
int j=mp[mkp(id(x,y),id(x+1,y))]; e[j].r=i;
}
if(y<m&&a[x][y+1]==a[x][y]){
int j=mp[mkp(id(x,y),id(x,y+1))]; e[j].r=i;
}
a[x][y]=c;
if(x>1&&a[x-1][y]==c){
mp[mkp(id(x-1,y),id(x,y))]=++tot;
e[tot].l=i,e[tot].r=q+1,e[tot].x=id(x-1,y),e[tot].y=id(x,y),e[tot].c=c;
}
if(y>1&&a[x][y-1]==c){
mp[mkp(id(x,y-1),id(x,y))]=++tot;
e[tot].l=i,e[tot].r=q+1,e[tot].x=id(x,y-1),e[tot].y=id(x,y),e[tot].c=c;
}
if(x<n&&a[x+1][y]==c){
mp[mkp(id(x,y),id(x+1,y))]=++tot;
e[tot].l=i,e[tot].r=q+1,e[tot].x=id(x+1,y),e[tot].y=id(x,y),e[tot].c=c;
}
if(y<m&&a[x][y+1]==c){
mp[mkp(id(x,y),id(x,y+1))]=++tot;
e[tot].l=i,e[tot].r=q+1,e[tot].x=id(x,y+1),e[tot].y=id(x,y),e[tot].c=c;
}
}
int j=1;
rep(i,1,n*m)F[i]=i,siz[i]=1;
for(int i=0,now=0,lst=1;i<=q;++i){
if(i==1)now=1;
now+=tag[i];
while(j<=tot&&e[j].l==i){
int x=e[j].x,y=e[j].y;
if(anc(x)!=anc(y))merge(x,y),--now;
++j;
}
if(chg[i+1]){
while(top)undo();
sort(e+lst,e+j,cmp);
for(int k=lst;k<j;++k){
int x=e[k].x,y=e[k].y;
if(anc(x)!=anc(y)){
merge(x,y),++tag[e[k].r];
}
}
while(top)undo();
lst=j;
}
ans[i]=now;
}
rep(i,1,q)printf("%d\n",ans[i]);
}```
P1989 无向图三元环计数.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=200005;
int n,m,deg[N],ord[N],ans;
int et,hed[N];
bool vis[N];
pair<int,int>p[N];
struct edge{int nx,to;}e[M];
struct node{int x,y;}E[M];
void addedge(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
E[i].x=x,E[i].y=y;
++deg[x],++deg[y];
}
rep(i,1,n)p[i]=mkp(deg[i],i);
sort(p+1,p+n+1);
rep(i,1,n)ord[p[i].se]=i;
rep(i,1,m)
if(ord[E[i].x]>ord[E[i].y])addedge(E[i].x,E[i].y);
else addedge(E[i].y,E[i].x);
rep(u,1,n){
for(int i=hed[u];i;i=e[i].nx)vis[e[i].to]=1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
for(int j=hed[v];j;j=e[j].nx)
if(vis[e[j].to])++ans;
}
for(int i=hed[u];i;i=e[i].nx)vis[e[i].to]=0;
}
printf("%d\n",ans);
return 0;
}```
P4396 [AHOI2013]作业.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int n,m,pre[N],a[N],size,bel[N],ans[N][2],bin[N];
struct BIT {
int tr[N];
void add(int x,int d){
if(!x)return;
for(int i=x;i<N;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
int ask(int l,int r){return ask(r)-ask(l-1);}
}t[2];
struct ASK {
int l,r,a,b,id;
}q[N];
inline bool cmp(const ASK&a,const ASK&b) {
return bel[a.l]!=bel[b.l]?a.l<b.l:bel[a.l]&1?a.r<b.r:a.r>b.r;
}
void add(int x) {
t[0].add(a[x],1),++bin[a[x]];
if(bin[a[x]]==1)t[1].add(a[x],1);
}
void pop(int x) {
t[0].add(a[x],-1),--bin[a[x]];
if(bin[a[x]]==0)t[1].add(a[x],-1);
}
signed main() {
n=rd(),m=rd(),size=sqrt(n);
for(int i=1;i<=n;++i)a[i]=rd(),bel[i]=(i-1)/size+1;
for(int i=1;i<=m;++i)q[i].id=i,q[i].l=rd(),q[i].r=rd(),q[i].a=rd(),q[i].b=rd();
sort(q+1,q+m+1,cmp);
int l=1,r=0;
for(int i=1;i<=m;++i) {
while(l<q[i].l)pop(l++);
while(l>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(r>q[i].r)pop(r--);
ans[q[i].id][0]=t[0].ask(q[i].a,q[i].b);
ans[q[i].id][1]=t[1].ask(q[i].a,q[i].b);
}
for(int i=1;i<=m;++i)printf("%d %d\n",ans[i][0],ans[i][1]);
return 0;
}```
P5339 [TJOI2019]唱、跳、rap和篮球.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2005;
const int M=N<<2;
#define mod 998244353
namespace math{
int inv[N],fac[N],ifc[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int binom(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
void initmath(const int&n=N-5){
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
}
using math::qpow;
using math::fmod;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:math::inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
int calch(int index,int a,int b,int c,int d){
static int A[M],B[M],C[M],D[M];
init_poly(a+b+c+d);
for(int i=0;i<a;++i)A[i]=math::ifc[i];clr(A+a,lim-a);
for(int i=0;i<b;++i)B[i]=math::ifc[i];clr(B+b,lim-b);
for(int i=0;i<c;++i)C[i]=math::ifc[i];clr(C+c,lim-c);
for(int i=0;i<d;++i)D[i]=math::ifc[i];clr(D+d,lim-d);
NTT(A,1),NTT(B,1),NTT(C,1),NTT(D,1);
for(int i=0;i<lim;++i)A[i]=1ll*A[i]*B[i]%mod*C[i]%mod*D[i]%mod;
NTT(A,0);return A[index];
}
}
int n,a,b,c,d,h[255],up,f[255],ans;
signed main(){
math::initmath();
n=read(),a=read(),b=read(),c=read(),d=read(),up=min(n>>2,min(a,min(b,min(c,d))));
for(int i=0;i<=up;++i)h[i]=poly::calch(n-4*i,a-i+1,b-i+1,c-i+1,d-i+1);
for(int i=0;i<=up;++i)f[i]=1ll*math::binom(n-3*i,i)*h[i]%mod*math::fac[n-4*i]%mod;
for(int i=0;i<=up;++i)fmod(ans+=i&1?mod-f[i]:f[i]);
printf("%d\n",ans);
return 0;
}```
P6008 [USACO20JAN]Cave Paintings P.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
int rdc(){
char ch=getchar();
while(ch!='#'&&ch!='.')ch=getchar();
return ch=='.';
}
const int N=1005;
const int M=N*N;
const int mod=1e9+7;
int n,m,a[N][N],fa[M],cnt,ans=1,val[M];
unordered_map<int,bool>vis;
int id(int x,int y){return (x-1)*m+y;}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
void merge(int x,int y){
int fx=find(x),fy=find(y);
if(fx!=fy)fa[fx]=fy,val[fy]=1ll*val[fx]*val[fy]%mod;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n*m;++i)fa[i]=i,val[i]=1;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
a[i][j]=rdc();
for(int i=n;i>=1;--i){
for(int j=2;j<=m;++j){
if(!a[i][j])continue;
if(a[i+1][j])merge(id(i+1,j),id(i,j));
if(a[i][j-1])merge(id(i,j-1),id(i,j));
if(a[i][j+1])merge(id(i,j+1),id(i,j));
}
vis.clear();
for(int j=1;j<=m;++j){
if(!a[i][j])continue;
if(!vis[find(id(i,j))])vis[find(id(i,j))]=1,++val[find(id(i,j))];
}
}
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i][j]&&find(id(i,j))==id(i,j))ans=1ll*ans*val[id(i,j)]%mod;
return std::cout<<ans<<'\n',0;
}```
P6517 [CEOI2010 day1] alliances.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
#define broken cerr<<"lqx AK:"<<__LINE__<<' '<<__FUNCTION__<<endl
#define outedge cerr<<u<<' '<<v<<' '<<fl<<'\n'
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=75;
const int N=K*K*3;
const int M=8*K*K*2;
const int inf=0x3f3f3f3f;
int n,m,a[K][K],tot,id[K][K][2],num[2];
char ans[K*3][K*3];
int dx[4]={0,0,-1,1},dy[4]={1,-1,0,0};
map<int,pair<int,int> >rev;
int dis[N],cur[N],mf,S,T,hed[N],et=1;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){
if(!u||!v)return;
addedge(u,v,fl),addedge(v,u,0);
}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,tot)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
n=read(),m=read(),S=++tot,T=++tot;
rep(i,1,n)rep(j,1,m){
a[i][j]=read();
num[(i+j)&1]+=a[i][j];
if(!a[i][j])continue;
if(a[i][j]==2)rev[id[i][j][0]=++tot]=mkp(i,j),rev[id[i][j][1]=++tot]=mkp(i,j);
else rev[id[i][j][0]=++tot]=mkp(i,j);
}
if(num[0]!=num[1])return puts("Impossible!"),0;
rep(i,1,n)rep(j,1,m){
if(!a[i][j])continue;
if((i+j)&1){
if(a[i][j]==2)adde(S,id[i][j][0],1),adde(S,id[i][j][1],1);
else adde(S,id[i][j][0],a[i][j]);
}else {
if(a[i][j]==2)adde(id[i][j][0],T,1),adde(id[i][j][1],T,1);
else adde(id[i][j][0],T,a[i][j]);
continue;
}
if(a[i][j]!=2){
if(a[i+1][j]==2)adde(id[i][j][0],id[i+1][j][1],1);
else adde(id[i][j][0],id[i+1][j][0],1);
if(a[i-1][j]==2)adde(id[i][j][0],id[i-1][j][1],1);
else adde(id[i][j][0],id[i-1][j][0],1);
if(a[i][j+1]==2)adde(id[i][j][0],id[i][j+1][0],1);
else adde(id[i][j][0],id[i][j+1][0],1);
if(a[i][j-1]==2)adde(id[i][j][0],id[i][j-1][0],1);
else adde(id[i][j][0],id[i][j-1][0],1);
}else{
if(a[i+1][j]==2)adde(id[i][j][1],id[i+1][j][1],1);
else adde(id[i][j][1],id[i+1][j][0],1);
if(a[i-1][j]==2)adde(id[i][j][1],id[i-1][j][1],1);
else adde(id[i][j][1],id[i-1][j][0],1);
if(a[i][j+1]==2)adde(id[i][j][0],id[i][j+1][0],1);
else adde(id[i][j][0],id[i][j+1][0],1);
if(a[i][j-1]==2)adde(id[i][j][0],id[i][j-1][0],1);
else adde(id[i][j][0],id[i][j-1][0],1);
}
}
while(bfs(S,T))mf+=dfs(S,inf);
// cerr<<"flow:"<<mf<<' '<<num<<'\n';
if(mf!=num[0])return puts("Impossible!"),0;
rep(i,1,n)rep(j,1,m)if(a[i][j])ans[i*3-1][j*3-1]='O';
rep(i,1,n*3)rep(j,1,m*3)if(!ans[i][j])ans[i][j]='.';
for(int i=2;i<=et;i+=2){
if(e[i^1].fl&&e[i].to!=S&&e[i].to!=T&&e[i^1].to!=S&&e[i^1].to!=T){
pair<int,int>ed=rev[e[i].to],fr=rev[e[i^1].to];
// cerr<<fr.fi<<' '<<fr.se<<' '<<ed.fi<<' '<<ed.se<<'\n';
rep(j,0,3)if(mkp(fr.fi+dx[j],fr.se+dy[j])==ed){
fr.fi=fr.fi*3-1,fr.se=fr.se*3-1;
ed.fi=ed.fi*3-1,ed.se=ed.se*3-1;
ans[fr.fi+dx[j]][fr.se+dy[j]]='X';
ans[ed.fi-dx[j]][ed.se-dy[j]]='X';
}
}
}
rep(i,1,n*3){
rep(j,1,m*3)putchar(ans[i][j]);
puts("");
}
return 0;
}
/*
3 4
2 3 2 0
3 4 3 0
2 3 3 1
P6517_8.in
P6517_43.in
*/```
CF321C Ciel the Commander.cpp
```#include<bits/stdc++.h>
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,rt,ans[N],siz[N],mx[N];
bool used[N];
struct edge{
int nxt,to;
}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void getrt(int u,int ft,int totsize){
siz[u]=1,mx[u]=0;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(used[v]||v==ft)continue;
getrt(v,u,totsize);
siz[u]+=siz[v];
mx[u]=std::max(mx[u],siz[v]);
}
mx[u]=std::max(mx[u],totsize-siz[u]);
if(mx[u]<mx[rt])rt=u;
}
void solve(int u,int dep){
ans[u]=dep,used[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(used[v])continue;
rt=0,getrt(v,u,siz[v]);
solve(rt,dep+1);
}
}
signed main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
mx[rt=0]=n,getrt(1,0,n),solve(rt,0);
for(int i=1;i<=n;++i)printf("%c ",ans[i]+'A');
}```
P5683 [CSPJX2019]道路拆除.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=3005;
int n,m,s1,t1,s2,t2,ans=-1;
int dis[3][N];
bool vis[N];
int head[N],num_edge;
struct edge{
int nxt,to;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void bfs(int st,int t){
queue<int>q;
memset(vis,0,sizeof(vis));
q.push(st),dis[t][st]=0,vis[st]=1;
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(!vis[v])vis[v]=1,q.push(v),dis[t][v]=dis[t][u]+1;
}
}
}
signed main() {
n=read(),m=read();
for(int i=1;i<=m;++i) {
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
s1=read(),t1=read(),s2=read(),t2=read();
memset(dis,0x3f,sizeof(dis));
bfs(1,0),bfs(s1,1),bfs(s2,2);
for(int i=1;i<=n;++i)
if(dis[0][i]+dis[1][i]<=t1&&dis[0][i]+dis[2][i]<=t2)ans=max(ans,m-dis[0][i]-dis[1][i]-dis[2][i]);
printf("%d\n",ans);
return 0;
}
```
CF1474A Puzzle From the Future.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n;
char a[N],b[N];
void Main(){
scanf("%d%s",&n,b+1);
a[0]='0';
for(int i=1;i<=n;++i){
if(b[i]=='0'){
if(a[i-1]+b[i-1]-'0'!='1')a[i]='1';
else a[i]='0';
}else{
if(a[i-1]+b[i-1]-'0'!='2')a[i]='1';
else a[i]='0';
}
}
for(int i=1;i<=n;++i)printf("%c",a[i]);
puts("");
}
signed main(){for(int T=read();T;--T)Main();}
/*
5
1
0
3
011
3
110
6
111000
6
001011
*/```
P3768 简单的数学题.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int mod,ans,inv6,inv2;
LL n;
const int N=8000005;
const int C=N-5;
inline int qpow(int n,int k){
int res=1;
while(k){
if(k&1)res=1ll*res*n%mod;
n=1ll*n*n%mod,k>>=1;
}
return res;
}
int pri[N],cnt,phi[N],sum[N];
bool vis[N];
void Sieve(const int&N){
phi[1]=1;
for(int i=2;i<=N;++i){
if(!vis[i])pri[++cnt]=i,phi[i]=i-1;
for(int j=1;j<=cnt&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){phi[i*pri[j]]=1ll*phi[i]*pri[j]%mod;break;}
else phi[i*pri[j]]=1ll*phi[i]*phi[pri[j]]%mod;
}
}
for(int i=1;i<=N;++i)sum[i]=(1ll*i*i%mod*phi[i]%mod+sum[i-1])%mod;
}
int f1(LL x){//一次方和
return x%=mod,1ll*x*(x+1)%mod*inv2%mod;
}
int f2(LL x){//二次方和
x%=mod;
LL res=1ll*x*(x+1)%mod*(2*x+1)%mod*inv6%mod;
return res;
}
int f3(LL x){//三次方和
int t=f1(x%mod);
return 1ll*t*t%mod;
}
unordered_map<LL,int>mp;
int djs(LL x){
if(x<=C)return sum[x];
if(mp[x])return mp[x];
int res=f3(x);
for(LL l=2,r;l<=x;l=r+1)
r=x/(x/l),res=(res-1ll*(f2(r)-f2(l-1))*djs(x/l)%mod)%mod;
return mp[x]=(res+mod)%mod;
}
signed main(){
scanf("%d%lld",&mod,&n),Sieve(min(n,1ll*C));
inv6=qpow(6,mod-2),inv2=qpow(2,mod-2);
for(LL l=1,r;l<=n;l=r+1){
r=n/(n/l),ans=(ans+1ll*(djs(r)-djs(l-1))*f3(n/l)%mod)%mod;
}
printf("%d\n",(ans+mod)%mod);
return 0;
}```
CF1316E Team Building.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
#define N 200010
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int dp[2][129],n,p,k;
struct node{
int a,s[8];
}a[N];
inline bool cmp(const node &a,const node &b) {
return a.a>b.a;
}
signed main() {
n=rd(),p=rd(),k=rd();
for(rint i=1;i<=n;++i)a[i].a=rd();
for(rint i=1;i<=n;++i)
for(rint j=0;j<p;++j)
a[i].s[j]=rd();
sort(a+1,a+n+1,cmp);
for(rint i=1;i<(1<<p);++i)dp[0][i]=-1;
for(rint i=1,u=1;i<=n;++i,u^=1) {
for(rint i=1;i<(1<<p);++i)dp[u][i]=-1;
for(rint mask=0;mask<(1<<p);++mask) {
int tmp=0;
for(rint j=0;j<p;++j)if(mask&(1<<j))++tmp;
tmp=i-1-tmp;
if(tmp<k){ if(~dp[u^1][mask])dp[u][mask]=dp[u^1][mask]+a[i].a;}
else dp[u][mask]=dp[u^1][mask];
for(rint j=0;j<p;++j)
if((mask&(1<<j))&&~dp[u^1][mask^(1<<j)])
dp[u][mask]=max(dp[u][mask],dp[u^1][mask^(1<<j)]+a[i].s[j]);
}
}
printf("%lld\n",dp[n&1][(1<<p)-1]);
return 0;
}```
CF1442C Graph Transpositions.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=210005;
#define mod 998244353
const int M=N*22;
const int inf=0x3f3f3f3f3f3f3f3f;
vector<pair<int,int> >g1[M],g2[M];
int n,m,pw2[N],ds1[M],ds2[N<<1],ans=inf;
bool vs1[M],vs2[N<<1];
int id(int dep,int x){return dep*n+x;}
void Dij1(){
priority_queue<pair<int,int> >pq;
memset(ds1,0x3f,sizeof(ds1));
pq.push(mkp(ds1[id(0,1)]=0,id(0,1)));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vs1[u])continue;vs1[u]=1;
for(auto [w,v]:g1[u]){
if(ckmin(ds1[v],ds1[u]+w)&&!vs1[v])pq.push(mkp(-ds1[v],v));
}
}
}
void Dij2(){
priority_queue<pair<int,int> >pq;
memset(ds2,0x3f,sizeof(ds2));
pq.push(mkp(ds2[id(0,n)]=0,id(0,n)));
pq.push(mkp(ds2[id(1,n)]=0,id(1,n)));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vs2[u])continue;vs2[u]=1;
for(auto [w,v]:g2[u])
if(ckmin(ds2[v],ds2[u]+w)&&!vs2[v])pq.push(mkp(-ds2[v],v));
}
}
signed main(){
n=read(),m=read();
pw2[0]=1;rep(i,1,N-1)pw2[i]=(pw2[i-1]<<1)%mod;
rep(i,1,m){
int x=read(),y=read();
rep(j,0,19)
if(j&1)g1[id(j,y)].pb(mkp(1,id(j,x)));
else g1[id(j,x)].pb(mkp(1,id(j,y)));
g2[id(0,x)].pb(mkp(1,id(0,y))),g2[id(1,y)].pb(mkp(1,id(1,x)));
}
rep(i,0,18)rep(j,1,n)g1[id(i,j)].pb(mkp(pw2[i],id(i+1,j)));
Dij1();
rep(i,0,19)ckmin(ans,ds1[id(i,n)]);
if(ans!=inf)return cout<<ans<<'\n',0;
rep(i,1,n)g2[id(0,i)].pb(mkp(pw2[20],id(1,i))),g2[id(1,i)].pb(mkp(pw2[20],id(0,i)));
Dij2();
int mi=inf,tmp=inf;
rep(i,1,n){
if(ds1[id(19,i)]<inf){
int t1=19+(ds2[id(0,i)]>>20),t2=(ds2[id(0,i)]&(pw2[20]-1))+ds1[id(19,i)];
if(ckmin(mi,t1))tmp=t2;
else if(mi==t1)ckmin(tmp,t2);
}
}
ans=(pw2[mi]-1+tmp)%mod;
ans=(ans+mod-pw2[19]+1)%mod;
cout<<ans<<'\n';
}```
CF1009F Dominant Indices.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000010;
const int M=21*N;
const int inf=1000000007;
int n,ans[N];
int dep[N];
int head[N],num_edge;
int root[N],tot,ls[M],rs[M],val[M],id[M];
struct edge {
int nxt,to;
}e[N<<1];
void addedge(int fr,int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void pushup(int p) {
val[p]=0;
if(val[p]<val[ls[p]])val[p]=val[ls[p]],id[p]=id[ls[p]];
if(val[p]<val[rs[p]])val[p]=val[rs[p]],id[p]=id[rs[p]];
}
void update(int &p,int l,int r,int pos,int k) {
if(!p)p=++tot;
if(l==r){val[p]+=k,id[p]=l;return;}
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],l,mid,pos,k);
else update(rs[p],mid+1,r,pos,k);
pushup(p);
}
int merge(int x,int y,int l,int r) {
if(!x||!y)return x|y;
int mid=(l+r)>>1;
if(l==r){val[x]+=val[y];return x;}
ls[x]=merge(ls[x],ls[y],l,mid);
rs[x]=merge(rs[x],rs[y],mid+1,r);
pushup(x);return x;
}
void dfs(int u,int ft) {
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dep[v]=dep[u]+1;
dfs(v,u);
root[u]=merge(root[u],root[v],1,n);
}
update(root[u],1,n,dep[u],1);
ans[u]=id[root[u]]-dep[u];
}
signed main() {
n=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
dep[1]=1,dfs(1,0);
for(int i=1;i<=n;++i)printf("%d\n",ans[i]);
return 0;
}
```
P3311 [SDOI2014] 数数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define mod 1000000007
#define N 1505
char n[N];
int m,Len,ch[N][10],tot,dp[N][N][2][2],fail[N];
bool en[N];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void insert(char*str){
int u=0,len=strlen(str);
for(int i=0;i<len;++i){
int c=str[i]-'0';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
en[u]=1;
}
void build_fail(){
queue<int>q;
for(int i=0;i<10;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()){
int u=q.front();q.pop();
en[u]|=en[fail[u]];
for(int i=0;i<10;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
}
int dfs(int u,int pos,int limit,int lead){
if(!pos)return !en[u];
if(en[u])return 0;
if(~dp[u][pos][limit][lead])return dp[u][pos][limit][lead];
int up=limit?n[pos-1]-'0':9,res=0;
for(int i=0;i<=up;++i)fmod(res+=dfs(lead&&!i?0:ch[u][i],pos-1,limit&&i==up,lead&&!i));
return dp[u][pos][limit][lead]=res;
}
signed main(){
scanf("%s%d",n,&m),Len=strlen(n);
for(int i=1;i<=m;++i){
static char str[N];
scanf("%s",str),insert(str);
}
build_fail();
reverse(n,n+Len);
memset(dp,-1,sizeof(dp));
printf("%d\n",(dfs(0,Len,1,1)+mod-1)%mod);
return 0;
}```
CF1469A Regular Bracket Sequence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
char str[N];
int n;
void Main(){
scanf("%s",str+1),n=strlen(str+1);
if(n&1)return puts("NO"),void();
int num=0;
for(int i=1;i<=n;++i){
if(str[i]=='(')++num;
}
if(num>n/2)return puts("NO"),void();
int ned=n/2-num,now=0;
for(int i=1;i<=n;++i){
if(str[i]=='?'){
if(ned>0)++now,--ned;
else --now;
}else if(str[i]=='(')++now;
else --now;
if(now<0)return puts("NO"),void();
}
puts("YES");
}
signed main(){for(int T=read();T;--T)Main();}//???```
P6006 [USACO20JAN]Farmer John Solves 3SUM G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=6009;
const int M=2000000;
int n,q,a[N],g[N][N],mp[M*2+114514];
LL f[N][N];
signed main() {
n=rd(),q=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<=n;++i) {
for(int j=i+1;j<=n;++j) {
int t=a[i]+a[j]+M;
if(0<=t&&t<=M*2)g[i][j]=mp[t];
++mp[M-a[j]];
}
for(int j=i+1;j<=n;++j)mp[M-a[j]]=0;
}
for(int len=3;len<=n;++len) {
for(int i=1;i<=n;++i) {
int j=i+len-1;
if(j>n)break;
f[i][j]=f[i+1][j]+f[i][j-1]-f[i+1][j-1]+g[i][j];
}
}
while(q--) {
int x=rd(),y=rd();
printf("%lld\n",f[x][y]);
}
}
```
P2294 [HNOI2005]狡猾的商人.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=109;
const int M=2200;
const int inf=10000007;
int n,m,S;
struct edge {
int nxt,to,val;
}e[M];
int num_edge,head[N];
bitset<N>inq;
int num[N],dis[N];
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void clear(){
memset(head,0,sizeof(head));
num_edge=0;
}
int spfa() {
inq.reset();
for(int i=0;i<=S;++i)num[i]=0,dis[i]=inf;
queue<int>q;q.push(S),dis[S]=0;
while(!q.empty()) {
int u=q.front();q.pop(),inq[u]=0;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(dis[v]>dis[u]+e[i].val) {
dis[v]=dis[u]+e[i].val,++num[v];
if(num[v]>n+2)return 0;
if(!inq[v])q.push(v),inq[v]=1;
}
}
}
return 1;
}
void Main() {
clear();
n=rd(),m=rd(),S=n+1;
for(int i=1;i<=m;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x-1,y,z),addedge(y,x-1,-z);
}
for(int i=0;i<=n;++i)addedge(S,i,-inf);
puts(spfa()?"true":"false");
}
signed main() {for(int T=rd();T;--T)Main();}```
P3758 [TJOI2017]可乐.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=35;
const int mod=2017;
int n,m,ans;
struct Matrix {
int a[N][N];
Matrix(){memset(a,0,sizeof(a));}
}fyyAKIOI;
Matrix mul(const Matrix &a,const Matrix &b) {
Matrix c;
for(int i=1;i<=n+1;++i)
for(int k=1;k<=n+1;++k)
for(int j=1;j<=n+1;++j)
c.a[i][j]=(c.a[i][j]+a.a[i][k]*b.a[k][j])%mod;
return c;
}
Matrix qpow(Matrix a,int k) {
Matrix res=a;--k;
while(k) {
if(k&1)res=mul(res,a);
a=mul(a,a),k>>=1;
}
return res;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
fyyAKIOI.a[x][y]=fyyAKIOI.a[y][x]=1;
}
for(int i=1;i<=n;++i)fyyAKIOI.a[i][i]=1;
for(int i=1;i<=n+1;++i)fyyAKIOI.a[i][n+1]=1;
fyyAKIOI=qpow(fyyAKIOI,rd());
for(int i=1;i<=n+1;++i)ans=(ans+fyyAKIOI.a[1][i])%mod;
printf("%d\n",ans);
return 0;
}
```
CF1042A Benches.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
// #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
const int N=109;
int n,m,a[N],mx,ans;
priority_queue<int,vector<int>,greater<int> >q;
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd(),mx=max(mx,a[i]),q.push(a[i]);
for(int i=1;i<=m;++i) {
int x=q.top();q.pop();q.push(x+1);
}
while(!q.empty())ans=max(ans,q.top()),q.pop();
printf("%d %d\n",ans,mx+m);
return 0;
}```
P4525 【模板】自适应辛普森法1.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
double a,b,c,d,L,R;
double f(double x) {return (c*x+d)/(a*x+b);}
double simpson(double l,double r) {return (f(l)+4*f((l+r)/2)+f(r))*(r-l)/6;}
double work(double l,double r,double eps,double val) {
double mid=(l+r)/2,lv=simpson(l,mid),rv=simpson(mid,r);
if(abs(lv+rv-val)<15*eps)return lv+rv+(lv+rv-val)/15;
return work(l,mid,eps/2,lv)+work(mid,r,eps/2,rv);
}
signed main() {
double eps=1e-7;
scanf("%lf%lf%lf%lf%lf%lf",&a,&b,&c,&d,&L,&R);
printf("%.6lf\n",work(L,R,eps,simpson(L,R)));
return 0;
}
```
CF1081D Maximum Distance.cpp
```// Problem: D. Maximum Distance
// Contest: Codeforces - Avito Cool Challenge 2018
// URL: https://codeforces.com/contest/1081/problem/D
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int F[N],n,m,k,tag[N],ans,siz[N];
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
struct edge{int x,y,z;}e[N];
inline bool cmp(const edge&a,const edge&b){
return a.z<b.z;
}
signed main(){
n=read(),m=read(),k=read();
rep(i,1,k){int x=read();tag[x]=siz[x]=1;}
rep(i,1,n)F[i]=i;
rep(i,1,m){
int x=read(),y=read(),z=read();
e[i].x=x,e[i].y=y,e[i].z=z;
}
sort(e+1,e+m+1,cmp);
rep(i,1,m){
int x=e[i].x,y=e[i].y,z=e[i].z;
if(find(x)==find(y))continue;
if(siz[find(x)]+siz[find(y)]==k){
rep(i,1,k)printf("%lld ",z);
return 0;
}
siz[find(x)]+=siz[find(y)],F[find(y)]=find(x);
}
assert(0);
return 0;
}```
P3324 [SDOI2015]星际战争.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
#define broken cerr<<"lqx AK:"<<__LINE__<<' '<<__FUNCTION__<<endl
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=55;
const int N=K*5;
const int M=(N*4+N*N)*2;
const db inf=1e15;
const db eps=1e-7;
int n,m,a[N],b[N],c[N][N];
int dis[N],cur[N],S,T,hed[N],et=1,control=0;
db mf;
struct edge{int nx,to;db fl;}e[M];
void addedge(int u,int v,db fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,db fl){
if(control){
if(fabs(fl-inf)<eps)cerr<<u<<' '<<v<<' '<<"inf\n";
else cerr<<u<<' '<<v<<' '<<fl<<'\n';
}
addedge(u,v,fl),addedge(v,u,0);
}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl>eps&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
db dfs(int u,db fl){
if(u==T)return fl;
db rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl>eps){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used+eps>fl)break;
}
}
}
return used;
}
bool check(db o){
et=1,mf=0,memset(hed,0,sizeof(hed));
rep(i,1,m)adde(S,i,1.*o*b[i]);
rep(i,1,n)adde(i+m,T,a[i]);
rep(i,1,m)rep(j,1,n)if(c[i][j])adde(i,j+m,inf);
while(bfs(S,T))mf+=dfs(S,inf);
return mf+eps>a[0];
}
signed main(){
n=read(),m=read(),S=m+n+1,T=S+1;;
rep(i,1,n)a[i]=read(),a[0]+=a[i];
rep(i,1,m)b[i]=read();
rep(i,1,m)rep(j,1,n)c[i][j]=read();
db l=0,r=1e7;
while(r-l>eps){
db mid=(l+r)/2;
if(check(mid))r=mid;
else l=mid;
}
printf("%.6lf\n",l);
return 0;
}
/*
2 2
3 10
4 6
0 1
1 1
*/```
P1177 【模板】快速排序（松排）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=100005;
int n;
unsigned a[N];
void Sort(unsigned int*a,int n){
static unsigned int _b[N];
static unsigned int*b=_b;
static int cnt[256];
for(int i=0;i<32;i+=8){
memset(cnt,0,sizeof(cnt));
for(int j=n-1;j>=0;--j)++cnt[(a[j]>>i)&255];
for(int j=1;j<256;++j)cnt[j]+=cnt[j-1];
for(int j=n-1;j>=0;--j)b[--cnt[(a[j]>>i)&255]]=a[j];
swap(a,b);
}
}
signed main(){
n=read();
for(int i=0;i<n;++i)a[i]=read();
sort(a,a+n);
for(int i=0;i<n;++i)printf("%d ",a[i]);
return 0;
}```
UVA12298 Super Poker II.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=N<<2;
namespace math{
int pri[N],pct;
bool vis[N];
void initmath(const int&n=N-5){
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
}
}
namespace poly{
const db PI=acos(-1);
int rev[M],lg,lim;
void init_poly(const int&n){
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
};
db round(const db&x){return x>0?floor(x+0.5):ceil(x-0.5);}
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
const cp wn(cos(PI/i),sin(PI/i)*(op?1:-1));
for(int j=0;j<lim;j+=i<<1){
cp w0(1,0);
for(int k=0;k<i;++k,w0=w0*wn){
const cp X=a[j+k],Y=a[i+j+k]*w0;
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(op)return;
for(int i=0;i<lim;++i)a[i].x/=lim;
}
void solve(LL*E,LL*F,LL*G,LL*H,LL*ans,int n){
static cp A[M],B[M],C[M],D[M];init_poly(n<<2);
for(int i=0;i<n;++i)A[i]=cp(E[i],0);for(int i=n;i<lim;++i)A[i]=cp(0,0);FFT(A,1);
for(int i=0;i<n;++i)B[i]=cp(F[i],0);for(int i=n;i<lim;++i)B[i]=cp(0,0);FFT(B,1);
for(int i=0;i<n;++i)C[i]=cp(G[i],0);for(int i=n;i<lim;++i)C[i]=cp(0,0);FFT(C,1);
for(int i=0;i<n;++i)D[i]=cp(H[i],0);for(int i=n;i<lim;++i)D[i]=cp(0,0);FFT(D,1);
for(int i=0;i<lim;++i)A[i]=A[i]*B[i]*C[i]*D[i];FFT(A,0);
for(int i=0;i<lim;++i)ans[i]=round(A[i].x);
}
}
pair<int,char>exread(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return mkp(x,ch);
}
int a,b,c;
LL S[M],H[M],C[M],D[M];
void Main(){
a=read(),b=read(),c=read();
if(!a&&!b&&!c)exit(0);++b;
for(int i=1;i<b;++i)S[i]=H[i]=C[i]=D[i]=math::vis[i];
for(int i=1;i<=c;++i){
pair<int,char>x=exread();
if(x.se=='S')S[x.fi]=0;
if(x.se=='H')H[x.fi]=0;
if(x.se=='C')C[x.fi]=0;
if(x.se=='D')D[x.fi]=0;
}
poly::solve(S,H,C,D,S,b);
for(int i=a;i<b;++i)printf("%lld\n",S[i]);
puts("");
}
signed main(){
math::initmath();
while("fyy AK IOI")Main();
}```
CF1276B Two Fairs.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int M = 5000005;
int n,m,a,b;
int head[N], num_edge;
int ans[2];
bool vis[N];
struct edge {
int nxt, to;
}e[M<<1];
void addedge(int fr, int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void bfs(int st,int ban,int o) {
for (int i = 1; i <= n; ++ i) vis[i] = 0;
queue<int>q;
q.push(st),vis[st]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i =head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==ban)continue;
if(!vis[v])vis[v]=1,q.push(v);
}
}
ans[o]=0;
for (int i = 1; i <= n; ++ i) ans[o] += ! vis[i];
--ans[o];
}
void Main() {
n = read(), m = read(), a = read(), b = read();
for (int i = 1; i <= n; ++ i) head[i] = 0;
num_edge=0;
for(int i=1;i<=m;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
bfs(a,b,0),bfs(b,a,1);
printf("%lld\n",ans[0]*ans[1]);
}
signed main(){
for(int T=read();T; -- T) Main();
}```
P6913 [ICPC2015 WF]Tile Cutting.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 500005
#define M (N<<2)
#define C 500000
#define mod 998244353
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int a[M],rev[M],lg,lim;
int id[20][N],mx[20][N],lg2[N],pw2[40];
int n;
void init_poly(int n){
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void NTT(int*a,int g,int op=0){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(!op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
void init_ST(const int&n){
lg2[0]=-1;for(int i=1;i<=n;++i)lg2[i]=lg2[i>>1]+1;
pw2[0]=1;for(int i=1;i<=20;++i)pw2[i]=pw2[i-1]<<1;
for(int i=1;i<=n;++i)mx[0][i]=a[i],id[0][i]=i;
for(int i=1;i<=lg2[n];++i)
for(int j=1;j+pw2[i]-1<=n;++j){
int t=j+pw2[i-1];
if(mx[i-1][j]>=mx[i-1][t])mx[i][j]=mx[i-1][j],id[i][j]=id[i-1][j];
else mx[i][j]=mx[i-1][t],id[i][j]=id[i-1][t];
}
}
void ask(int l,int r){
int x=lg2[r-l+1],t=r-pw2[x]+1;
if(mx[x][l]>=mx[x][t])printf("%d %d\n",id[x][l],mx[x][l]);
else printf("%d %d\n",id[x][t],mx[x][t]);
}
signed main(){
for(int i=1;i<=C;++i)
for(int j=1;i*j<=C;++j)
++a[i*j];
init_poly(C<<1),NTT(a,3);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*a[i]%mod;
NTT(a,qpow(3,mod-2),1);
init_ST(C);
n=read();
while(n--){
int l=read(),r=read();
ask(l,r);
}
return 0;
}
/*
2
4 4
2 6
*/```
CF1296D Fight with Monsters.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=200005;
int n,a,b,k,x[N],ans,sum;
int main()
{
scanf("%d%d%d%d",&n,&a,&b,&k);
for(int i=1,hp,tmp;i<=n;++i)
{
scanf("%d",&hp);
tmp=(hp-1)%(a+b)+1;
x[i]=tmp/a;
if(x[i]*a==tmp)--x[i];
}
sort(x+1,x+n+1);
for(int i=1;i<=n;++i)
{
sum+=x[i];
if(sum>k)break;
++ans;
}
printf("%d\n",ans);
return 0;
}```
CF1A Theatre Square.cpp
```#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll chenzhe(ll a,ll b)
{
if(a%b==0)return a/b;
return a/b+1;
}
int main()
{
ll n,m,a;
cin>>n>>m>>a;
ll kkk=chenzhe(n,a),sc03=chenzhe(m,a);
cout<<kkk*sc03<<endl;
return 0;
}```
P3480 [POI2009]KAM-Pebbles.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1010;
int T,n,a[N];
void Main() {
n=rd();int res=0;
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=n;i>=1;i-=2)res^=a[i]-a[i-1];
if(res)puts("TAK");
else puts("NIE");
}
signed main() {
T=rd();
while(T--)Main();
return 0;
}
```
CF1469B Red and Blue.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
int n,m,r[N],b[N];
void Main(){
int m1=0,m2=0;
n=read();rep(i,1,n)ckmax(m1,r[i]=read()+r[i-1]);
m=read();rep(i,1,m)ckmax(m2,b[i]=read()+b[i-1]);
printf("%d\n",m1+m2);
}
signed main(){for(int T=read();T;--T)Main();}```
CF427D Match & Catch.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 10005
#define S (N<<1)
int n,ans=N;
int trans[S][26],mxlen[S],link[S],tot=1,lst,cnt[S][2];
int t[S],q[S];
int extend(int c,int lst,int id){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return ++cnt[q][id],q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return ++cnt[nq][id],nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return ++cnt[np][id],np;
}
signed main(){
static char str[N];
scanf("%s",str),lst=1,n=strlen(str);
for(int i=0;i<n;++i)lst=extend(str[i]-'a',lst,0);
scanf("%s",str),lst=1,n=strlen(str);
for(int i=0;i<n;++i)lst=extend(str[i]-'a',lst,1);
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
for(int i=tot;i>=1;--i)cnt[link[q[i]]][0]+=cnt[q[i]][0],cnt[link[q[i]]][1]+=cnt[q[i]][1];
for(int i=2;i<=tot;++i)if(cnt[i][0]==1&&cnt[i][1]==1)ans=min(ans,mxlen[link[i]]+1);
if(ans==N)ans=-1;printf("%d\n",ans);
return 0;
}```
CF505E Mr. Kitayuta vs. Bamboos.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
int n, m, k, p, h[N], a[N], v[N];
bool check(int md) {
priority_queue <pair<int, int> > pq;
for (int i = 1; i <= n; ++i)
if (md - m * a[i] < h[i])
v[i] = md, pq.push(mkp(-(md / a[i]), i));
for (int i = 1; i <= m; ++i) {
if (pq.empty()) break;
for (int j = 1; j <= k; ++j) {
if (pq.empty()) break;
pair <int, int> now = pq.top();
pq.pop();
int id = now.se;
if (v[id] - i * a[id] < 0) return 0;
v[id] += p;
if (v[id] - m * a[id] < h[id])
pq.push(mkp(-(v[id] / a[id]), id));
}
}
return pq.empty();
}
signed main() {
n = read(), m = read(), k = read(), p = read();
for (int i = 1; i <= n; ++i) h[i] = read(), a[i] = read();
int l = 0, r = 1e15, res = 114514114514114514;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid)) res = mid, r = mid - 1;
else l = mid + 1;
}
cout << res << '\n';
}```
CF487E Tourists.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long LL;
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
int n,m,q,w[N<<1],tot;
namespace Tree{
#define T (N<<1)
#define S (T<<2)
#define inf 1000000007
struct egde{int nxt,to;}e[T<<1];
int num_edge,head[T];
multiset<int>s[T];
int dfn[T],tmr,rev[T],fa[T],top[T],son[T],siz[T],dep[T];
int val[S];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs1(int u,int ft){
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
rev[dfn[u]=++tmr]=u,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=min(val[lc],val[rc]);}
void build(int l=1,int r=tot,int p=1){
if(l==r)return val[p]=w[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void change(int pos,int k,int l=1,int r=tot,int p=1){
if(l==r)return val[p]=k,void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,k,l,mid,lc);
else change(pos,k,mid+1,r,rc);
pushup(p);
}
int query_min(int ql,int qr,int l=1,int r=tot,int p=1){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=inf;
if(ql<=mid)res=min(res,query_min(ql,qr,l,mid,lc));
if(mid<qr)res=min(res,query_min(ql,qr,mid+1,r,rc));
return res;
}
int ask_min(int x,int y){
int res=inf;
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res=min(res,query_min(dfn[top[x]],dfn[x])),x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
return min(res,query_min(dfn[x],dfn[y]));
}
void modify(int x,int y){
if(fa[x]>n){
s[fa[x]].erase(s[fa[x]].find(w[x]));
s[fa[x]].insert(y);
if(w[fa[x]]!=*s[fa[x]].begin()){
w[fa[x]]=*s[fa[x]].begin();
change(dfn[fa[x]],w[fa[x]]);
}
}
change(dfn[x],w[x]=y);
}
int LCA(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
int query(int x,int y){
int res=ask_min(x,y),lca=LCA(x,y);
if(lca>n)res=min(res,w[fa[lca]]);
return res;
}
void init(){
dfs1(1,0),dfs2(1,1);
for(int i=1;i<=n;++i)s[fa[i]].insert(w[i]);
for(int i=n+1;i<=tot;++i)w[i]=*s[i].begin();
build();
}
}
namespace cst{
int dfn[N],tmr,low[N],stk[N],top;
struct egde{int nxt,to;}e[N<<1];
int num_edge,head[N];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void tarjan(int u){
dfn[u]=low[u]=++tmr,stk[++top]=u;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(!dfn[v]){
tarjan(v),low[u]=min(low[u],low[v]);
if(dfn[u]==low[v]){
++tot;
Tree::addedge(tot,u),Tree::addedge(u,tot);
while(stk[top+1]!=v){
Tree::addedge(tot,stk[top]),Tree::addedge(stk[top],tot),--top;
}
}
}else low[u]=min(low[u],dfn[v]);
}
}
}
signed main(){
tot=n=read(),m=read(),q=read();
for(int i=1;i<=n;++i)w[i]=read();
for(int i=1;i<=m;++i){
int x=read(),y=read();
cst::addedge(x,y),cst::addedge(y,x);
}
cst::tarjan(1),Tree::init();
while(q--){
char ch=getchar();
while(ch!='C'&&ch!='A')ch=getchar();
int x=read(),y=read();
if(ch=='C')Tree::modify(x,y);
else printf("%d\n",Tree::query(x,y));
}
return 0;
}```
P5356 [Ynoi2017]由乃打扑克.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define S 800
#define N 100005
int n,m,a[N],up,down;
typedef pair<int,int> pii;
pii b[N],t1[S],t2[S];
int num,L[N/5],R[N/S+5],bel[N];
int cnt1,cnt2,tag[N/S+5];
void init(){
num=(n-1)/S+1;
for(int i=1;i<=num;++i)L[i]=R[i-1]+1,R[i]=i*S;
R[num]=n;
for(int i=1;i<=num;++i){
for(int j=L[i];j<=R[i];++j)
bel[j]=i,b[j].fi=a[j],b[j].se=j;
sort(b+L[i],b+R[i]+1);
}
}
void rebuild(int id,int l,int r,int delta){
cnt1=0,cnt2=0;
for(int i=L[id];i<=R[id];++i)
if(b[i].se>=l&&b[i].se<=r)t1[++cnt1]=mkp(b[i].fi+delta+tag[id],b[i].se);
else t2[++cnt2]=mkp(b[i].fi+tag[id],b[i].se);
tag[id]=0;
int i=L[id],j=1,k=1;
while(j<=cnt1&&k<=cnt2)b[i++]=t1[j]<t2[k]?t1[j++]:t2[k++];
while(j<=cnt1)b[i++]=t1[j++];
while(k<=cnt2)b[i++]=t2[k++];
}
void update(int l,int r,int k){
k>0?up+=k:down+=k;
int bl=bel[l],br=bel[r];
if(bl==br){
rebuild(bl,l,r,k);
return;
}
for(int i=bl+1;i<br;++i)tag[i]+=k;
rebuild(bl,l,R[bl],k),rebuild(br,L[br],r,k);
}
int calc(int l,int r,int k,pii*b){
int ll=l,rr=r,ret=0;
while(ll<=rr){
int mid=(ll+rr)>>1;
if(b[mid].fi<=k)ret=mid-l+1,ll=mid+1;
else rr=mid-1;
}
return ret;
}
int ask(int l,int r,int k){
int res=0;
int bl=bel[l],br=bel[r];
for(int i=bl+1;i<br;++i)res+=calc(L[i],R[i],k-tag[i],b);
res+=calc(1,cnt1,k-tag[bl],t1);
res+=calc(1,cnt2,k-tag[br],t2);
return res;
}
int query(int l,int r,int k){
if(k>r-l+1)return -1;
int bl=bel[l],br=bel[r];
if(bl==br){
cnt1=0;
for(int i=L[bl];i<=R[br];++i)if(b[i].se>=l&&b[i].se<=r)t1[++cnt1]=b[i];
return t1[k].fi+tag[bl];
}
cnt1=0,cnt2=0;
for(int i=L[bl];i<=R[bl];++i)if(b[i].se>=l&&b[i].se<=r)t1[++cnt1]=b[i];
for(int i=L[br];i<=R[br];++i)if(b[i].se>=l&&b[i].se<=r)t2[++cnt2]=b[i];
int ll=down,rr=up,res;
while(ll<=rr){
int mid=(ll+rr)>>1,t=ask(l,r,mid);
if(t>=k)res=mid,rr=mid-1;
else ll=mid+1;
}
return res;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)a[i]=read(),up=max(up,a[i]),down=min(down,a[i]);
init();
while(m--){
int opt=read(),l=read(),r=read(),k=read();
if(opt==1)printf("%d\n",query(l,r,k));
else update(l,r,k);
}
}
```
P4267 [USACO18FEB]Taming the Herd G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 109
int dp[N][N][N],n,a[N],ans[N];//i day;j times;len=k
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
memset(dp,0x3f,sizeof(dp));
memset(ans,0x3f,sizeof(ans));
dp[1][1][0]=(a[1]!=0);
for(int i=2;i<=n;++i) {
for(int j=1;j<=i;++j) {
for(int k=1;k<=i;++k)dp[i][j][k]=dp[i-1][j][k-1]+(a[i]!=k);
for(int k=0;k<=i;++k)dp[i][j][0]=min(dp[i][j][0],dp[i-1][j-1][k]+(a[i]!=0));
}
}
for(int j=1;j<=n;++j)
for(int k=0;k<=n;++k)
ans[j]=min(ans[j],dp[n][j][k]);
for(int i=1;i<=n;++i)printf("%d\n",ans[i]);
return 0;
}```
CF897A Scarborough Fair.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
typedef long long LL;
#define rint register int
const int N=105;
char s[N];
int n,m;
signed main() {
n=rd(),m=rd();
scanf("%s",s+1);
while(m--) {
int l=rd(),r=rd();char s1,s2;
cin>>s1>>s2;
for(rint i=l;i<=r;++i)if(s[i]==s1)s[i]=s2;
}
printf("%s",s+1);
return 0;
}```
李超线段树.cpp
```#define N 40000
#define M 100005
#define T (N<<2)
#define mod1 39989
#define mod2 1000000000
int lastans,cnt;
pair<db,db>li[M];
int v[T];
#define lc (p<<1)
#define rc (p<<1|1)
#define val(x,y) (1.*li[x].fi*y+li[x].se)
void update(int id,int ql,int qr,int l=1,int r=N,int p=1){
int mid=(l+r)>>1;
if(ql<=l&&r<=qr){
if(!v[p])return v[p]=id,void();
db nol=val(id,l),nor=val(id,r),lal=val(v[p],l),lar=val(v[p],r);
if(nol<=lal&&nor<=lar)return;
if(nol>=lal&&nor>=lar)return v[p]=id,void();
db inter=1.*(li[id].se-li[v[p]].se)/(li[v[p]].fi-li[id].fi);
if(nol>=lal){
if(inter<=mid)update(id,ql,qr,l,mid,lc);
else update(v[p],ql,qr,mid+1,r,rc),v[p]=id;
}else{
if(inter>mid)update(id,ql,qr,mid+1,r,rc);
else update(v[p],ql,qr,l,mid,lc),v[p]=id;
}
return;
}
if(ql<=mid)update(id,ql,qr,l,mid,lc);
if(mid<qr)update(id,ql,qr,mid+1,r,rc);
}
int query(int X,int l=1,int r=N,int p=1){
int res=0;
if(v[p]&&val(v[p],X)>val(res,X))res=v[p];
if(l==r)return res;
int mid=(l+r)>>1,t;
if(X<=mid)t=query(X,l,mid,lc);
else t=query(X,mid+1,r,rc);
if(val(res,X)<val(t,X))res=t;
return res;
}```
P4085 [USACO17DEC]Haybale Feast G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
int n,m,F[N],S[N],lp[N],rp[N],stk[N],top,ans=1e18,sum[N];
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)F[i]=rd(),S[i]=rd(),sum[i]=sum[i-1]+F[i];
for(int i=1;i<=n;++i) {
while(top&&S[stk[top]]<=S[i])rp[stk[top--]]=i-1;
lp[i]=stk[top]+1,stk[++top]=i;
}
while(top)rp[stk[top--]]=n;
for(int i=1;i<=n;++i)
if(sum[rp[i]]-sum[lp[i]-1]>=m)ans=min(ans,S[i]);
printf("%lld\n",ans);
return 0;
}```
P5176 公约数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=20000005;
const int mod=1000000007;
int A,B,C;
int pri[N/10],cnt,s[N];
bool vis[N];
void Sieve(const int N=20000000){
s[1]=1;
for(int i=2;i<=N;++i){
if(!vis[i])pri[++cnt]=i,s[i]=1ll*i*i%mod-1;
for(int j=1;j<=cnt&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){s[i*pri[j]]=1ll*s[i]*pri[j]%mod*pri[j]%mod;break;}
s[i*pri[j]]=1ll*s[i]*s[pri[j]]%mod;
}
}
for(int i=1;i<=N;++i)s[i]=(s[i]+s[i-1])%mod;
}
int f(int A,int B,int C){
int res=0;
for(int l=1,r,mx=min(A,B);l<=mx;l=r+1){
r=min(A/(A/l),B/(B/l));
res=(res+1ll*(A/l)*(B/l)%mod*(s[r]-s[l-1])%mod)%mod;
}
return 1ll*res*C%mod;
}
signed main(){
Sieve();
for(int T=read();T;--T){
A=read(),B=read(),C=read();
printf("%d\n",(((f(A,B,C)+f(B,C,A))%mod+f(C,A,B))%mod+mod)%mod);
}
}```
P3265 [JLOI2015]装备购买.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double ldb;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 505;
const ldb eps = 1e-7;
int n, m, ans[2], d[N];
struct node {
ldb p[N]; int val;
inline bool operator<(const node&rhs)const{return val < rhs.val;}
}a[N];
signed main(){
n = read(), m = read();
for (int i = 1; i <= n; ++ i)
for(int j = 1; j <= m; ++ j) a[i].p[j] = read();
for (int i = 1; i <= n; ++ i) a[i].val = read();
sort(a + 1, a + n + 1);
for (int i = 1; i <= n ; ++ i) {
for(int j = 1; j <= m ; ++ j) {
if (fabs(a[i].p[j]) > eps) {
if (!d[j]) {
d[j] = i, ++ ans[0], ans[1] += a[i].val;
break;
} else {
ldb div = a[i].p[j] / a[d[j]].p[j];
for (int k = j; k <= m; ++ k) a[i].p[k] -= a[d[j]].p[k] * div;
}
}
}
}
printf("%d %d\n", ans[0], ans[1]);
}
```
P7077 函数调用.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=1000005;
#define mod 998244353
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,a[N],m,q,T[N],p[N],v[N],f[N];
int tpn[N],ind[N],mul[N],sum[N];
int et,hed[N];
struct edge{int nx,to;}e[M];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void topo(){
queue<int>q;
rep(i,1,m)if(!ind[i])q.push(i);
while(!q.empty()){
int u=q.front();q.pop(),tpn[++tpn[0]]=u;
for(int i=hed[u];i;i=e[i].nx)if(!--ind[e[i].to])q.push(e[i].to);
}
}
signed main(){
n=read();
rep(i,1,n)a[i]=read();
m=read();
rep(i,1,m){
T[i]=read();
if(T[i]==1)p[i]=read(),v[i]=read(),mul[i]=1;
else if(T[i]==2)v[i]=read(),mul[i]=v[i];
else{
int c=read(),x;mul[i]=1;
rep(j,1,c)adde(i,x=read()),++ind[x];
}
}
topo();
per(i,m,1){
int u=tpn[i];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;mul[u]=1ll*mul[u]*mul[v]%mod;
}
}
q=read();
rep(i,1,q)f[i]=read();
int tmp=1;
per(i,q,1)fmod(sum[f[i]]+=tmp),tmp=1ll*tmp*mul[f[i]]%mod;
rep(i,1,n)a[i]=1ll*a[i]*tmp%mod;
rep(i,1,m){
int u=tpn[i],now=1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;fmod(sum[v]+=1ll*sum[u]*now%mod),now=1ll*now*mul[v]%mod;
}
}
rep(i,1,m)if(T[i]==1)fmod(a[p[i]]+=1ll*sum[i]*v[i]%mod);
rep(i,1,n)printf("%d ",a[i]);
return 0;
}```
CF840C On the Bench.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 305
#define mod 1000000007
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,a[N],dp[N][N][N];
void change(int&x){
for(int i=2;i*i<=x;++i)
while(x%(i*i)==0)x/=i*i;
}
signed main(){
n=read();
for(int i=1;i<=n;++i)change(a[i]=read());
sort(a+1,a+n+1);
dp[0][0][0]=1;
for(int i=1,cnt=0;i<=n;++i){
if(a[i]!=a[i-1]){
for(int j=0;j<=i;++j)
for(int k=1;k<=cnt;++k){
fmod(dp[i-1][j][0]+=dp[i-1][j][k]);
dp[i-1][j][k]=0;
}
cnt=0;
}
for(int j=0;j<=i;++j){
for(int k=0,up=min(cnt,j);k<=up;++k){
if(j&&k)fmod(dp[i][j][k]+=1ll*dp[i-1][j-1][k-1]*(cnt+cnt-k+1)%mod);
fmod(dp[i][j][k]+=1ll*dp[i-1][j+1][k]*(j-k+1)%mod);
fmod(dp[i][j][k]+=1ll*dp[i-1][j][k]*(i-(cnt+cnt-k)-(j-k))%mod);
}
}
++cnt;
}
// for(int i=0;i<=n;++i){
// for(int j=0;j<=n;++j){
// for(int k=0;k<=n;++k)cerr<<dp[i][j][k]<<' ';
// cerr<<'\n';
// }
// cerr<<'\n';
// }
printf("%d\n",dp[n][0][0]);
return 0;
}```
CF571B Minimization.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
int n,k,a[N];
ll dp[5005][5005];
int main() {
memset(dp,0x3f,sizeof(dp));
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
int l1=n/k+1,l2=n/k,t1=n%k,t2=k-n%k;
for(int i=0;i<=t1;++i) {
for(int j=0;j<=t2;++j) {
if(!i&&!j) {
dp[i][j]=0;
continue;
}
if(i)dp[i][j]=min(dp[i][j],dp[i-1][j]-a[l1*(i-1)+l2*j+1]+a[l1*i+l2*j]);
if(j)dp[i][j]=min(dp[i][j],dp[i][j-1]-a[l1*i+l2*(j-1)+1]+a[l1*i+l2*j]);
}
}
printf("%lld\n",dp[t1][t2]);
return 0;
}```
P6640 [BJOI2020] 封印.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 200005
#define S (N<<1)
int n,m,q;
int trans[S][2],mxlen[S],link[S],tot=1,lst;
int b[S],c[S];
int len[N],ST[18][N],lg[N],pw[30];
char s[N],t[N];
int extend(int c,int lst){
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
trans[nq][0]=trans[q][0],trans[nq][1]=trans[q][1];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
int ask(int l,int r){
if(l>r)return 0;int t=lg[r-l+1];
return max(ST[t][l],ST[t][r-pw[t]+1]);
}
signed main(){
scanf("%s%s%d",s,t,&q),n=strlen(s),m=strlen(t);
for(int i=0,lst=1;i<m;++i)lst=extend(t[i]-'a',lst);
for(int i=0,l=0,u=1;i<n;++i){
int c=s[i]-'a';
if(trans[u][c])u=trans[u][c],++l;
else{
for(;u&&!trans[u][c];u=link[u]);
if(trans[u][c])l=mxlen[u]+1,u=trans[u][c];
else u=1,l=0;
}
len[i+1]=l;
}
lg[0]=-1;for(int i=1;i<=n;++i)lg[i]=lg[i>>1]+1;
pw[0]=1;for(int i=1;i<=20;++i)pw[i]=pw[i-1]<<1;
for(int i=1;i<=n;++i)ST[0][i]=len[i];
for(int i=1;i<=lg[n];++i)
for(int j=1;j+pw[i]-1<=n;++j)
ST[i][j]=max(ST[i-1][j],ST[i-1][j+pw[i-1]]);
while(q--){
int L=read(),R=read(),l=L,r=R+1,pos=R+1;
while(l<=r){
int mid=(l+r)>>1;
if(mid-len[mid]+1>=L)r=mid-1,pos=mid;
else l=mid+1;
}
printf("%d\n",max(pos-L,ask(pos,R)));
}
return 0;
}```
P4254 [JSOI2008]Blue Mary开公司.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int rdc(){
char ch=getchar();
while(ch!='t'&&ch!='y')ch=getchar();
return ch=='t';
}
#define N 50005
#define T (N<<2)
#define M 100005
pair<db,db>li[M];
int cnt,v[T];
#define lc (p<<1)
#define rc (p<<1|1)
#define val(x,y) (li[x].fi*y+li[x].se)
void update(int id,int l=1,int r=50000,int p=1){
int mid=(l+r)>>1;
if(!v[p])return v[p]=id,void();
db nol=val(id,l),nor=val(id,r),lal=val(v[p],l),lar=val(v[p],r);
if(nol<=lal&&nor<=lar)return;
if(nol>=lal&&nor>=lar)return v[p]=id,void();
db inter=(li[v[p]].se-li[id].se)/(li[id].fi-li[v[p]].fi);
if(nol>=lal){
if(inter<=mid)update(id,l,mid,lc);
else update(v[p],mid+1,r,rc),v[p]=id;
}else{
if(inter>mid)update(id,mid+1,r,rc);
else update(v[p],l,mid,lc),v[p]=id;
}
}
db query(int X,int l=1,int r=50000,int p=1){
db res=0;
if(v[p]&&val(v[p],X)>res)res=val(v[p],X);
if(l==r)return res;
int mid=(l+r)>>1;
if(X<=mid)res=max(res,query(X,l,mid,lc));
else res=max(res,query(X,mid+1,r,rc));
return res;
}
signed main(){
for(int Te=read();Te;--Te){
static int op,x;
static db S,P;
op=rdc();
if(op)scanf("%lf%lf",&S,&P),li[++cnt]=mkp(P,S-P),update(cnt);
else x=read(),printf("%d\n",(int)floor(query(x)/100));
}
return 0;
}```
CF1169B Pairs.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300005;
int X,Y,n,m,a[N],b[N],ans;
int check(int t,int x) {
for(int i=t;i<=m;++i)if(a[i]!=x&&b[i]!=x&&a[i]!=X&&b[i]!=X)return 0;
return 1;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i)a[i]=rd(),b[i]=rd();
X=a[1];
for(int i=1;i<=m;++i) {
if(a[i]!=X&&b[i]!=X) {
Y=1;
if(check(i,a[i]))ans=1;
else if(check(i,b[i]))ans=1;
break;
}
}
X=b[1];
for(int i=1;i<=m;++i) {
if(a[i]!=X&&b[i]!=X) {
Y=1;
if(check(i,a[i]))ans=1;
else if(check(i,b[i]))ans=1;
break;
}
}
puts(ans|(!Y)?"YES":"NO");
}
```
CF337D Book of Evil.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
const int inf=1000000007;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,m,d,ans,dis[N],ds[N],dt[N],s,t;
bool bo[N];
vector<int>g[N];
void dfs1(int u,int ft,int &pos) {
if(bo[u]&&dis[u]>dis[pos])pos=u;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
dis[v]=dis[u]+1;
dfs1(v,u,pos);
}
}
void dfs2(int u,int ft,int *dep) {
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
dep[v]=dep[u]+1;
dfs2(v,u,dep);
}
}
signed main() {
n=rd(),m=rd(),d=rd();
for(rint i=1;i<=m;++i)bo[rd()]=1;
for(rint i=1,x,y;i<n;++i) {
x=rd(),y=rd();
g[x].push_back(y);
g[y].push_back(x);
}
memset(dis,0,sizeof(dis));dfs1(1,0,s);
memset(dis,0,sizeof(dis));dfs1(s,0,t);
dfs2(s,0,ds),dfs2(t,0,dt);
for(rint i=1;i<=n;++i)
if(ds[i]<=d&&dt[i]<=d)++ans;
printf("%d\n",ans);
return 0;
}```
P3435 [POI2006]OKR-Periods of Words.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 1000005
int n,P[N];
char str[N];
LL ans;
signed main(){
scanf("%d%s",&n,str);
int j=-1;P[0]=-1;
for(int i=1;i<n;++i){
while(~j&&str[j+1]!=str[i])j=P[j];
if(str[j+1]==str[i])++j;
P[i]=j;
}
for(int i=0;i<n;++i){
j=P[i];
while(~j&&~P[j])P[i]=j=P[j];
if(~j)ans+=i-j;
}
printf("%lld\n",ans);
return 0;
}```
CF1320A Journey Planning.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 200010
#define C 200000
int n,a[N];
long long ans,sum;
vector<int>v[N*3];
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd(),v[a[i]-i+C].push_back(i);
for(rint i=0;i<=C*3;++i) {
sum=0;
for(rint j=0;j<v[i].size();++j)
sum+=a[v[i][j]];
ans=max(ans,sum);
}
printf("%lld\n",ans);
return 0;
}```
P5309 [Ynoi2011]初始化.cpp
```#pragma GCC optimize("Ofast","-funroll-loops","-fdelete-null-pointer-checks")
#pragma GCC target("ssse3","sse3","sse2","sse","avx2","avx")
#pragma GCC optimize(3,"Ofast","inline")
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cmath>
using std::cout;
using std::endl;
using std::vector;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 200009
#define M 800
#define zky 1000000007
int n,a[N],m;
int s[M][M],sum[M];
int S,num,L[M],R[M],bl[N];
void inc(int&x,const int&v) {(x+=v)>=zky?x-=zky:114514;}
void init(){
S=sqrt(n/3)+1,num=(n-1)/S+1;
for(int i=1;i<=num;++i)L[i]=R[i-1]+1,R[i]=i*S;
R[num]=n;
for(int i=1;i<=num;++i)
for(int j=L[i];j<=R[i];++j)
bl[j]=i;
}
void update(int x,int y,int z){
if(x>=S)for(int i=y;i<=n;i+=x)inc(a[i],z),inc(sum[bl[i]],z);
else for(int i=y;i<=x;++i)inc(s[x][i],z);
}
int query(int x){
int res=0;
for(int i=1;i<S;++i)
inc(res,1ll*(x/i)*s[i][i]%zky),inc(res,s[i][x%i]);
return res;
}
int query(int l,int r){
int res=0;
if(bl[l]+2>bl[r]){
for(int i=l;i<=r;++i)inc(res,a[i]);
return res;
}else {
for(int i=l;i<=R[bl[l]];++i)inc(res,a[i]);
for(int i=L[bl[r]];i<=r;++i)inc(res,a[i]);
for(int i=bl[l]+1;i<bl[r];++i)inc(res,sum[i]);
return res;
}
}
signed main(){
n=rd(),m=rd(),init();
for(int i=1;i<=n;++i)a[i]=rd()%zky,sum[bl[i]]=(sum[bl[i]]+a[i])%zky;
while(m--){
int opt=rd(),x=rd(),y=rd();
if(opt&1)update(x,y,rd()%zky);
else printf("%d\n",((query(y)-query(x-1)+query(x,y))%zky+zky)%zky);
}
return 0;
}```
P4553 80人环游世界.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=250;
const int M=25000;
const int inf=1<<28;
int head[N],num_edge=1;
int n,m;
int s,t,S,T,SS,TT,S_;
int maxflow,sumflow,cost;
int dta[N],inq[N],dst[N],cur[N];
bool vis[N];
struct edge {
int nxt,to,val,w;
}e[M];
void addedge(int from,int to,int val,int w) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
e[num_edge].w=w;
head[from]=num_edge;
}
void addedge(int from,int to,int l,int r,int w) {
addedge(from,to,r-l,w),addedge(to,from,0,-w);
dta[from]-=l,dta[to]+=l;
}
bool spfa() {
for(rint i=1;i<=TT;++i)cur[i]=head[i],inq[i]=0,dst[i]=inf;
queue<int>q;q.push(s);dst[s]=0;
while(!q.empty()) {
int u=q.front();inq[u]=0,q.pop();
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(e[i].val&&dst[v]>dst[u]+e[i].w) {
dst[v]=dst[u]+e[i].w;
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return dst[t]!=inf;
}
int dfs(int u,int flow) {
vis[u]=1;
if(u==t){maxflow+=flow;return flow;}
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
int v=e[i].to;cur[u]=i;
if(dst[v]==dst[u]+e[i].w&&e[i].val&&(v==t||!vis[v])) {
rlow=dfs(v,min(e[i].val,flow-used));
if(rlow) {
e[i].val-=rlow;
e[i^1].val+=rlow;
cost+=rlow*e[i].w;
used+=rlow;
if(used==flow)break;
}
}
}
return used;
}
void MCMF() {
while(spfa()) {
vis[t]=1;
while(vis[t]){memset(vis,0,sizeof(vis)),dfs(s,inf);}
}
}
signed main() {
n=rd(),m=rd();
S=n+n+1,S_=S+1,T=S_+1,SS=T+1,TT=SS+1;
addedge(S_,S,m,m,0);
for(rint i=1;i<=n;++i) {
addedge(S,i,0,m,0);
addedge(i+n,T,0,m,0);
int x=rd();
addedge(i,i+n,x,x,0);
}
for(rint i=1;i<=n;++i) {
for(rint j=i+1;j<=n;++j) {
int x=rd();
if(~x)addedge(i+n,j,0,m,x);
}
}
for(rint i=1;i<=T;++i)
if(dta[i]>0)addedge(SS,i,0,dta[i],0);
else addedge(i,TT,0,-dta[i],0);
addedge(T,S_,0,inf,0);
s=SS,t=TT,MCMF();
printf("%d\n",cost);
return 0;
}
```
P3228 [HNOI2013]数列.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
LL n;
int m,k,p;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%p)
if(k&1)res=1ll*n*res%p;
return res;
}
signed main(){
std::cin>>n>>k>>m>>p;
std::cout<<(n%p*qpow(m,k-1)%p-1ll*(k-1)*qpow(m,k-2)%p*(1ll*m*(m+1)/2%p)%p+p)%p<<'\n';
}```
P5071 [Ynoi2015] 此时此刻的光辉.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int qpow(int n,int k,int mod){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;return res;}
int gcd(int x,int y){while(y){int t=x%y;x=y,y=t;}return x;}
namespace MR{
static const int pri[8]={2,3,5,7,13,19,61,233};
bool mr(int x,int p){
if(x%p==0||qpow(p,x-1,x)!=1)return 0;
int k=x-1;
while(!(k&1)){
int t=qpow(p%x,k>>=1,x);
if(t!=1&&t!=x-1)return 0;
if(t==x-1)break;
}
return 1;
}
bool test(int x){
for(int i=0;i<8;++i){
if(x==pri[i])return 1;
if(!mr(x,pri[i]))return 0;
}
return 1;
}
}
namespace PR{
int ans,d[150],tot;
mt19937 rnd(673);
#define rad(l,r) (rnd()%((r)-(l)+1)+l)
int pr(int x,int c){
if(x==4)return 2;
LL v0=c,v1=1ll*v0*v0%x+c,g=1;tot=0;
while(true){
g=1ll*g*(v1-v0)%x,d[++tot]=v1-v0;
if(tot==32){if(gcd(g,x)>1)break;tot=0;}
v0=1ll*v0*v0%x+c,v1=1ll*v1*v1%x+c,v1=1ll*v1*v1%x+c;
}
for(int i=1;i<=tot;++i){g=gcd(d[i],x);if(g>1)return g;}
return x;
}
void solve(int x){
if(x<=ans)return;
if(MR::test(x))return ckmax(ans,x),void();
int y=x;while(y==x)y=pr(x,rad(1,x-1));
while(x%y==0)x/=y;solve(x),solve(y);
}
int work(int x){return ans=1,solve(x),ans;}
}
const int N=100005;
const int V=N*2+500;
const int M=30*N;
#define mod 19260817
int n,m,a[N],S,ans[N],now=1;
struct ASK{
int l,r,id;
ASK(){l=r=id=0;}
inline bool operator < (const ASK&t)const{return l/S!=t.l/S?l<t.l:(l/S)&1?r<t.r:r>t.r;}
}q[N];
vector<pair<int,int> >d[N];
int pct,pri[N];
bool vis[N];
int len,lsh[V],cnt[V],inv[M];
void prework(){
for(int i=2;i<=1000;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=1000;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
rep(i,1,pct)lsh[++len]=pri[i];
for(int i=1;i<=n;++i){
int x=a[i],y;
for(int j=1;j<=pct;++j){
if(x%pri[j])continue;
int num=0;
while(x%pri[j]==0)x/=pri[j],++num;
d[i].pb(mkp(pri[j],num));
}
if(x==1)continue;
y=PR::work(x),d[i].pb(mkp(y,1)),lsh[++len]=y,x/=y;
if(x>1)d[i].pb(mkp(x,1)),lsh[++len]=x;
}
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
for(int i=1;i<=n;++i)
for(int j=0,up=sz(d[i]);j<up;++j)
d[i][j].fi=lower_bound(lsh+1,lsh+len+1,d[i][j].fi)-lsh;
inv[1]=1;rep(i,2,30*n)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
void add(int x){
for(int i=0,up=sz(d[x]);i<up;++i){
pair<int,int>t=d[x][i];
now=1ll*now*inv[cnt[t.fi]+1]%mod;
cnt[t.fi]+=t.se,now=1ll*now*(cnt[t.fi]+1)%mod;
}
}
void pop(int x){
for(int i=0,up=sz(d[x]);i<up;++i){
pair<int,int>t=d[x][i];
now=1ll*now*inv[cnt[t.fi]+1]%mod;
cnt[t.fi]-=t.se,now=1ll*now*(cnt[t.fi]+1)%mod;
}
}
signed main(){
n=read(),m=read();
rep(i,1,n)a[i]=read();
prework();
rep(i,1,m)q[i].l=read(),q[i].r=read(),q[i].id=i;
S=n/sqrt(m)+1,sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i){
while(l>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(l<q[i].l)pop(l++);
while(r>q[i].r)pop(r--);
ans[q[i].id]=now;
}
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}
/*
5 5
64 2 18 9 100
1 5
2 4
2 3
1 4
3 4
*/```
P5505 [JSOI2011]分特产.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define mod 1000000007
#define N 2005
int n,m,a[N],C[N][N],ans;
void fmod(int&x){x-=mod,x+=x>>31&mod;}
signed main(){
n=read(),m=read();
for(int i=1;i<=m;++i)a[i]=read();
C[0][0]=1;
for(int i=1;i<=2000;++i){
C[i][0]=1;
for(int j=1;j<=i;++j){
fmod(C[i][j]=C[i-1][j]+C[i-1][j-1]);
}
}
for(int i=0;i<=n;++i){
int res=1;
for(int j=1;j<=m;++j)res=1ll*res*C[a[j]+n-i-1][n-i-1]%mod;
res=1ll*res*C[n][i]%mod;
(i&1)?fmod(ans+=mod-res):fmod(ans+=res);
}
printf("%d\n",ans);
return 0;
}
```
P5576 [CmdOI2019]口头禅.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 20004
#define M 100005
#define S 400005
int n,m,len,le[N],mxv[N],ans[M];
char str[S];
vector<pair<int,int> >q[N];
int trans[S<<1][2],mxlen[S<<1],link[S<<1],tot=1;
int elt[S<<1],ltt[S<<1],tag[S<<1];
bool ckmax(int&x,int y){return x<y?x=y,1:0;}
int extend(int c,int lst){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
trans[nq][0]=trans[q][0],trans[nq][1]=trans[q][1];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
trans[nq][0]=trans[q][0],trans[nq][1]=trans[q][1];
link[nq]=link[q],link[np]=link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void update(int u,int id,int lim){
for(;u&&tag[u]!=id;u=link[u]){
if(id>ltt[u]+1)elt[u]=ltt[u]=id;
else{
ltt[u]=id;
ckmax(mxv[lower_bound(q[id].begin(),q[id].end(),mkp(elt[u],-1))-q[id].begin()+1],min(mxlen[u],lim));
}
tag[u]=id;
}
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i){
char ch=getchar();le[i]=len+1;
int lst=1;
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))str[++len]=ch,lst=extend(ch-'0',lst),ch=getchar();
}
le[n+1]=len+1;
for(int i=1;i<=m;++i){
int l=read(),r=read();
q[r].pb(mkp(l,i));
}
for(int i=1;i<=n;++i){
sort(q[i].begin(),q[i].end());
fill(mxv,mxv+sz(q[i])+3,0);
int u=1;
for(int j=le[i];j<le[i+1];++j)
u=trans[u][str[j]-'0'],update(u,i,j-le[i]+1);
for(int j=0;j<sz(q[i]);++j)ckmax(mxv[j+1],mxv[j]),ans[q[i][j].se]=mxv[j+1];
}
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
CF617E XOR and Favorite Number.cpp
```#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,m,k,a[N],bin[1<<20],size,bel[N];
LL ans[N],cur;
struct QUE {
int id,l,r;
}q[N];
bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?a.l<b.l:bel[a.l]&1?a.r<b.r:a.r>b.r;
}
void pop(int x) {--bin[a[x]],cur-=bin[a[x]^k];}
void add(int x) {cur+=bin[a[x]^k],++bin[a[x]];}
signed main() {
n=rd(),m=rd(),k=rd(),size=sqrt(n);
for(rint i=1;i<=n;++i)a[i]=rd(),a[i]^=a[i-1],bel[i]=(i-1)/size+1;
for(rint i=1;i<=m;++i)q[i].l=rd()-1,q[i].r=rd(),q[i].id=i;
sort(q+1,q+m+1,cmp);
for(rint i=1,l=1,r=0;i<=m;++i) {
while(l<q[i].l)pop(l++);
while(l>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(r>q[i].r)pop(r--);
ans[q[i].id]=cur;
}
for(rint i=1;i<=m;++i)printf("%lld\n",ans[i]);
return 0;
}```
P5610 [Ynoi2013]大学.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rint register int
#define N 100001
#define C 200
#define M 500001
int val[M*C],rnd[M*C],ch[M*C][2],size[M*C],root[M],n,m,a[N],b[M],num_node,tot;
ll lastans;
vector<int>vec[M];
#define lt(i) (i&(-i))
ll tr[N];
void add(int x,int d) {
if(x<=0)return;
for(int i=x; i<=n; i+=lt(i))
tr[i]+=d;
}
ll sum(int x) {
if(x>n)x=n;
ll res=0;
for(int i=x; i>0; i-=lt(i))
res+=tr[i];
return res;
}
void upd(int u) {
size[u]=size[ch[u][0]]+1+size[ch[u][1]];
}
int newnode(int x) {
++num_node;
val[num_node]=x;
rnd[num_node]=rand();
size[num_node]=1;
return num_node;
}
int build(int l,int r,int *p) {
if(l>r)return 0;
int mid=(l+r)>>1;
int u=newnode(p[mid]);
ch[u][0]=build(l,mid-1,p);
ch[u][1]=build(mid+1,r,p);
return upd(u),u;
}
int merge(int a,int b) {
if(!a||!b)return a+b;
if(rnd[a]<rnd[b]) {
ch[a][1]=merge(ch[a][1],b);
return upd(a),a;
} else {
ch[b][0]=merge(a,ch[b][0]);
return upd(b),b;
}
}
void split(int u,int k,int &x,int &y) {
if(!u) x=y=0;
else {
if(val[u]<=k)x=u,split(ch[u][1],k,ch[u][1],y);
else y=u,split(ch[u][0],k,x,ch[u][0]);
upd(u);
}
}
void dfs(int u,int mo) {
if(!u)return;
if(ch[u][0])dfs(ch[u][0],mo);
if(a[val[u]]%mo==0) {
add(val[u],-a[val[u]]);
a[val[u]]/=mo;
add(val[u],a[val[u]]);
}
if(a[val[u]]%mo==0)b[++tot]=val[u];
if(ch[u][1])dfs(ch[u][1],mo);
}
void del(int u,int l,int r) {
int x,y,z;
split(root[u],r,x,y);
split(x,l-1,x,z);
tot=0;
dfs(z,u);
root[u]=merge(x,merge(build(1,tot,b),y));
}
int main() {
srand(time(0));
scanf("%d%d",&n,&m);
for(rint i=1; i<=n; ++i) {
scanf("%d",&a[i]);
add(i,a[i]);
for(int j=1,mx=sqrt(a[i]); j<=mx; ++j) {
if(a[i]%j)continue;
vec[j].push_back(i);
if(j*j!=a[i])vec[a[i]/j].push_back(i);
}
}
for(rint i=1; i<=M-3; ++i) {
int cnt=0;
for(rint j=0; j<vec[i].size(); ++j)
b[++cnt]=vec[i][j];
root[i]=build(1,cnt,b);
}
while(m--) {
int opt,l,r,x;
scanf("%d",&opt);
if(opt==1) {
scanf("%d%d%d",&l,&r,&x);
l^=lastans,r^=lastans,x^=lastans;
if(x^1)del(x,l,r);
} else {
scanf("%d%d",&l,&r);
l^=lastans,r^=lastans;
lastans=sum(r)-sum(l-1);
printf("%lld\n",lastans);
}
}
return 0;
}
```
P4720 【模板】扩展卢卡斯.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000010;
const int M=1010;
int n,m,mod;
int A[M],B[M];
int qpow(int n,int k,int mod) {
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod,k>>=1;
}
return res;
}
int mul(int a,int b,int mod) {
int res=0;
while(b) {
if(b&1)res=(res+a)%mod;
a=(a+a)%mod,b>>=1;
}
return res;
}
void exgcd(int a,int b,int &d,int &x,int &y) {
if(!b){x=1,y=0,d=a;return;}
exgcd(b,a%b,d,y,x),y-=a/b*x;
}
int inv(int x,int mod) {
int a,b,d;
exgcd(x,mod,d,a,b);
return (a%mod+mod)%mod;
}
int F(int n,int m,int k) {
if(!n)return 1;
int cyc=1,rem=1;
for(int i=1;i<=k;++i)
if(i%m)cyc=cyc*i%k;
cyc=qpow(cyc,n/k,k);
for(int i=k*(n/k);i<=n;++i)
if(i%m)rem=rem*(i%k)%k;
return F(n/m,m,k)*cyc%k*rem%k;
}
int G(int n,int m) {
if(n<m)return 0;
return n/m+G(n/m,m);
}
int solve(int n,int m,int f,int k) {
int fz=F(n,f,k),fm1=inv(F(m,f,k),k),fm2=inv(F(n-m,f,k),k),index=G(n,f)-G(m,f)-G(n-m,f);
return fz*fm1%k*fm2%k*qpow(f,index,k)%k;
}
int excrt(int n) {
int lcm=A[1],res=B[1],x,y,a,b,c,d,tmp;
for(int i=2;i<=n;++i) {
a=lcm,b=A[i],c=(B[i]-res%b+b)%b;
exgcd(a,b,d,x,y),tmp=b/d;
if(c%d)return -1;
x=x*(c/d)%tmp;
res+=x*lcm;
lcm*=tmp;
res=(res%lcm+lcm)%lcm;
}
return res;
}
int exLucas(int n,int m,int mod) {
int t=mod,tot=0;
for(int i=2;i*i<=mod;++i) {
if(t%i==0) {
int k=1;
while(t%i==0)t/=i,k*=i;
++tot,A[tot]=k,B[tot]=solve(n,m,i,k);
}
}
if(t>1)++tot,A[tot]=t,B[tot]=solve(n,m,t,t);
return excrt(tot);
}
signed main() {
n=rd(),m=rd(),mod=rd();
printf("%lld\n",exLucas(n,m,mod));
return 0;
}```
CF893D Credit Card.cpp
```// Problem: D. Credit Card
// Contest: Codeforces - Educational Codeforces Round 33 (Rated for Div. 2)
// URL: https://codeforces.com/contest/893/problem/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int inf=0x3f3f3f3f;
int n,a[N],d,s[N],smx[N],ans;
signed main(){
n=read(),d=read();
rep(i,1,n)a[i]=read(),s[i]=s[i-1]+a[i];
smx[n+1]=-inf;
per(i,n,1)smx[i]=max(smx[i+1],s[i]);
int now=0;
rep(i,1,n){
if(!a[i]){
if(now<0){
now=d-(smx[i]-s[i-1]),++ans;
if(now<0)return puts("-1"),0;
}
}else now+=a[i];
if(now>d)return puts("-1"),0;
}
cout<<ans<<'\n';
}```
P2522 [HAOI2011]Problem b.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50010;
int pri[N/10],cnt,vis[N],mu[N],sum[N];
void Sieve() {
mu[1]=1;
for(int i=2;i<N;++i) {
if(!vis[i])pri[++cnt]=i,mu[i]=-1;
for(int j=1;j<=cnt&&i*pri[j]<N;++j) {
vis[i*pri[j]]=1;
if(i%pri[j])mu[i*pri[j]]=-mu[i];
else break;
}
}
for(int i=1;i<N;++i)sum[i]=sum[i-1]+mu[i];
}
LL solve(int n,int m,int k) {
if(n>m)n^=m^=n^=m;
LL res=0;
for(int l=1,r;l*k<=n;l=r+1)
r=min(n/(n/l),m/(m/l)),res+=1ll*(n/(l*k))*(m/(l*k))*(sum[r]-sum[l-1]);
return res;
}
signed main() {
Sieve();
for(int n=rd();n;--n) {
int a=rd(),b=rd(),c=rd(),d=rd(),k=rd();
printf("%lld\n",solve(b,d,k)+solve(a-1,c-1,k)-solve(b,c-1,k)-solve(a-1,d,k));
}
return 0;
}```
CF600E Lomsat gelral.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,c[N],mx;
int son[N],siz[N],cnt[N];
LL sum,ans[N];
int num_edge,head[N];
struct edge {
int nxt,to;
}e[N<<1];
void addedge(int from,int to) {
++num_edge;
e[num_edge].to=to;
e[num_edge].nxt=head[from];
head[from]=num_edge;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs1(v,u);
siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void calc(int u,int ft,int sn) {
++cnt[c[u]];
if(cnt[c[u]]>mx)sum=c[u],mx=cnt[c[u]];
else if(cnt[c[u]]==mx)sum+=c[u];
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==sn||v==ft)continue;
calc(v,u,sn);
}
}
void clear(int u,int ft) {
--cnt[c[u]];
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
clear(v,u);
}
}
void dfs(int u,int ft,int cl) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||v==son[u])continue;
dfs(v,u,1);
}
if(son[u])dfs(son[u],u,0);
calc(u,ft,son[u]),ans[u]=sum;
if(cl)clear(u,ft),mx=sum=0;
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)c[i]=rd();
for(rint i=1;i<n;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
dfs1(1,0),dfs(1,0,0);
for(rint i=1;i<=n;++i)printf("%lld%c",ans[i]," \n"[i==n]);
return 0;
}```
P1399 [NOI2013]快餐店.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 200005
#define inf 1000000000000000ll
int n;
int loop[N],cnt,val[N],vis[N];
LL sum[N],f[N],ans1,ans2,L[N],R[N],ll[N],rr[N];
int head[N],num_edge;
struct edge{int nxt,to,val;}e[N<<1];
void addedge(int fr,int to,int val){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
int dfs(int u,int ft){
if(vis[u])return u;
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
int tmp=dfs(v,u);
if(tmp){
loop[++cnt]=u,val[cnt]=e[i].val,vis[u]=2;
return tmp==u?0:tmp;
}
}
return 0;
}
void getd(int u,int ft){
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft||vis[v]==2)continue;
getd(v,u);
ans1=max(ans1,f[v]+f[u]+e[i].val);
f[u]=max(f[u],f[v]+e[i].val);
}
}
signed main(){
n=read();
for(int i=1;i<=n;++i){
int x=read(),y=read(),z=read();
addedge(x,y,z),addedge(y,x,z);
}
dfs(1,0);
for(int i=1;i<=cnt;++i)getd(loop[i],0);
for(int i=1;i<=cnt;++i)sum[i]=sum[i-1]+val[i];
LL tmp;
L[0]=ll[0]=R[cnt+1]=rr[cnt+1]=-inf;
tmp=-inf;
for(int i=1;i<=cnt;++i){
L[i]=max(L[i-1],f[loop[i]]+sum[i]);
ll[i]=max(ll[i-1],f[loop[i]]+sum[i]+tmp);
tmp=max(tmp,f[loop[i]]-sum[i]);
}//ll[r]=max{f[r]+sum[r]+f[l]-sum[l]}
tmp=-inf;
for(int i=cnt;i>=1;--i){
R[i]=max(R[i+1],f[loop[i]]+sum[cnt]-sum[i]);
rr[i]=max(rr[i+1],f[loop[i]]-sum[i]+tmp);
tmp=max(tmp,f[loop[i]]+sum[i]);
}//ll[l]=max{f[r]+sum[r]+f[l]-sum[l]}
//both:ans=min{f[l]+sum[l]+f[r]+sum[cnt]-sum[r]}
ans2=inf;
for(int i=1;i<=cnt;++i)ans2=min(ans2,max(L[i-1]+R[i],max(ll[i-1],rr[i])));
printf("%.1lf\n",0.5*max(ans1,ans2));
return 0;
}```
P5655 基础数论函数练习题.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 305
#define mod 1000000007
int n,q,ans[N][N];
LL a[N],b[N],s[N];
LL mul(LL a,LL b,LL P){
// return (__int128)(a*b%P);
LL res=a*b-(LL)((long double)a/P*b+0.5)*P;
return res<0?res+P:res;
}
void init(){
for(int i=1;i<=n;++i){
b[i]=a[i],s[i]=1;
for(int j=i-1;j>=1;--j)s[j]=mul(s[j+1],b[j],a[i]);
LL t=__gcd(s[1],a[i]);
for(int j=1;j<i;++j){
if(s[j+1]%t){
LL gcd=__gcd(t,s[j+1]);
b[j]/=t/gcd,t=gcd;
}
}
ans[i][i]=a[i]%mod;
for(int j=i-1;j>=1;--j)ans[j][i]=1ll*ans[j+1][i]*(b[j]%mod)%mod;
}
}
void Main(){
// std::cerr<<mul(1e17,1e18+1,1e18)<<'\n';
scanf("%d%d",&n,&q);
for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
init();
while(q--){int l,r;scanf("%d%d",&l,&r);printf("%d\n",ans[l][r]);}
}
signed main(){for(int T=read();T;--T)Main();}```
P6772 [NOI2020]美食家.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define F(i,l,r) for(int i=l;i<=r;++i)
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=53;
const int K=205;
const int L=255;
const LL inf=1e15;
int n,m,T,k,l,c[N];
LL ans[L],t[L];
struct Matrix {
LL a[L][L];
LL* operator [] (const int&k){return a[k];}
}mp[33];
struct node {int t,x,y;}pty[K];
int f(int x,int y){return x+y*n;}
inline bool cmp(const node &a,const node &b) {
return a.t<b.t;
}
signed main() {
n=rd(),m=rd(),T=rd(),k=rd(),l=5*n;
F(i,0,30)F(j,1,l)F(k,1,l)mp[i][j][k]=-inf;
for(int i=1;i<=n;++i) {
for(int j=4;j>0;--j)mp[0][f(i,j)][f(i,j-1)]=0;
c[i]=rd();
}
ans[1]=0;for(int i=2;i<=l;++i)ans[i]=-inf;
for(int i=1;i<=m;++i) {
int x=rd(),y=rd(),z=rd();
mp[0][y][f(x,z-1)]=c[x];
}
for(int r=1;r<=30;++r)
F(i,1,l)F(k,1,l)F(j,1,l)mp[r][i][j]=max(mp[r][i][j],mp[r-1][i][k]+mp[r-1][k][j]);
for(int i=1;i<=k;++i)pty[i].t=rd(),pty[i].x=rd(),pty[i].y=rd();
sort(pty+1,pty+k+1,cmp);
pty[k+1].t=T;
for(int z=1;z<=k+1;++z) {
int d=pty[z].t-pty[z-1].t;
for(int r=0;d;++r,d>>=1)
if(d&1) {
F(i,1,l)t[i]=-inf;
F(i,1,l)F(k,1,l)t[i]=max(t[i],mp[r][i][k]+ans[k]);
F(i,1,l)ans[i]=t[i];
}
ans[pty[z].x]+=pty[z].y;
}
ans[1]+=c[1];
if(ans[1]<0)puts("-1");
else printf("%lld\n",ans[1]);
return 0;
}```
P4311 士兵占领.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=210;
const int inf=1<<29;
const int M=2*(N+N+N*N+N);
struct edge {
int to,nxt,val;
}e[M];
int num_edge=1,head[N];
int dep[N],cur[N],dta[N],maxflow,ans,sumflow;
int n,m,k,a[N>>1][N>>1];
int s,t,S,T,SS,TT;
void addedge(int from,int to,int val) {
++num_edge,e[num_edge].nxt=head[from],e[num_edge].to=to,e[num_edge].val=val,head[from]=num_edge;
++num_edge,e[num_edge].nxt=head[to],e[num_edge].to=from,e[num_edge].val=0,head[to]=num_edge;
}
void addedge(int from,int to,int l,int r) {
addedge(from,to,r-l),addedge(to,from,0);
dta[from]-=l,dta[to]+=l;
}
int bfs() {
for(rint i=1;i<=TT;++i)dep[i]=0,cur[i]=head[i];
queue<int>q;dep[s]=1,q.push(s);
while(!q.empty()) {
int u=q.front();q.pop();
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dep[v]&&e[i].val)q.push(v),dep[v]=dep[u]+1;
}
}
return dep[t]>0;
}
int dfs(int u,int flow) {
if(u==t) {maxflow+=flow;return flow;}
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
int v=e[i].to;cur[u]=i;
if(e[i].val&&dep[v]==dep[u]+1) {
rlow=dfs(v,min(flow-used,e[i].val));
if(rlow)e[i].val-=rlow,e[i^1].val+=rlow,used+=rlow;
if(used==flow)break;
}
}
return used;
}
signed main() {
m=rd(),n=rd(),k=rd();S=n+m+1,T=S+1,SS=T+1,TT=SS+1;
for(rint i=1;i<=m;++i)addedge(S,i,rd(),inf);
for(rint i=1;i<=n;++i)addedge(i+m,T,rd(),inf);
for(rint i=1;i<=k;++i) {
int x=rd(),y=rd();
a[x][y]=1;
}
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
if(!a[i][j])addedge(i,j+m,0,1);
for(rint i=1;i<=T;++i)
if(dta[i]>0)addedge(SS,i,0,dta[i]),sumflow+=dta[i];
else addedge(i,TT,0,-dta[i]);
s=SS,t=TT;
while(bfs())dfs(s,inf);
addedge(T,S,0,inf);
while(bfs())ans+=dfs(s,inf);
if(maxflow!=sumflow)return puts("JIONG!"),0;
printf("%d\n",ans);
return 0;
}
```
P4119 [Ynoi2018] 未来日记.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int S1=720;
const int S2=200;
const int V=100000;
int n,m,a[N],L1[N/S1+5],R1[N/S1+5],L2[N/S2+5],R2[N/S2+5],n1,n2,bl1[N],bl2[N];
int F[N/S1+5][N],rev[N/S1+5][N];
int t1[N],t2[N/S2+5],t[N],tot;
int s1[N/S1+5][N],s2[N/S1+5][N/S2+5];
void init(){
n1=(n-1)/S1+1,n2=(V-1)/S2+1;
rep(i,1,n1)L1[i]=R1[i-1]+1,R1[i]=i*S1;
rep(i,1,n2)L2[i]=R2[i-1]+1,R2[i]=i*S2;
R1[n1]=n,R2[n2]=V;
rep(i,1,n1)rep(j,L1[i],R1[i])bl1[j]=i;
rep(i,1,n2)rep(j,L2[i],R2[i])bl2[j]=i;
rep(bl,1,n1){
rep(i,1,V)s1[bl][i]=s1[bl-1][i];
rep(i,1,n2)s2[bl][i]=s2[bl-1][i];
rep(i,L1[bl],R1[bl])++s1[bl][a[i]],++s2[bl][bl2[a[i]]],F[bl][a[i]]=a[i],rev[bl][a[i]]=a[i];
}
}
void update(int l,int r,int x,int y){
if(x==y)return;
if(bl1[l]==bl1[r]){
int bl=bl1[l],sum=0;
if(s1[bl][x]-s1[bl-1][x]>0){
rep(i,l,r)if(F[bl][a[i]]==x)++sum;
if(!sum)return;
rep(i,L1[bl],R1[bl])a[i]=F[bl][a[i]];
rep(i,l,r)if(a[i]==x)a[i]=y;
rep(i,L1[bl],R1[bl])F[bl][a[i]]=a[i],rev[bl][a[i]]=a[i];
rep(i,bl,n1)s1[i][x]-=sum,s1[i][y]+=sum,s2[i][bl2[x]]-=sum,s2[i][bl2[y]]+=sum;
}
return;
}
int bl=bl1[l],br=bl1[r],sum=0,tmp;
if(s1[bl][x]-s1[bl-1][x]>0){
rep(i,L1[bl],R1[bl])a[i]=F[bl][a[i]];
rep(i,l,R1[bl])if(a[i]==x)a[i]=y,++sum;
rep(i,L1[bl],R1[bl])F[bl][a[i]]=a[i],rev[bl][a[i]]=a[i];
}
s1[bl][x]-=sum,s1[bl][y]+=sum,s2[bl][bl2[x]]-=sum,s2[bl][bl2[y]]+=sum;
rep(i,bl+1,br-1){
if(tmp=s1[i][x]-s1[i-1][x]-sum){
if(s1[i][y]-s1[i-1][y]+sum==0)F[i][rev[i][x]]=y,rev[i][y]=rev[i][x];
else {
rep(j,L1[i],R1[i])a[j]=F[i][a[j]];
rep(j,L1[i],R1[i])if(a[j]==x)a[j]=y;
rep(j,L1[i],R1[i])F[i][a[j]]=a[j],rev[i][a[j]]=a[j];
}
sum+=tmp;
}
s1[i][x]-=sum,s1[i][y]+=sum,s2[i][bl2[x]]-=sum,s2[i][bl2[y]]+=sum;
}
if(s1[br][x]-s1[br-1][x]-sum>0){
rep(i,L1[br],R1[br])a[i]=F[br][a[i]];
rep(i,L1[br],r)if(a[i]==x)a[i]=y,++sum;
rep(i,L1[br],R1[br])F[br][a[i]]=a[i],rev[br][a[i]]=a[i];
}
rep(i,br,n1)s1[i][x]-=sum,s1[i][y]+=sum,s2[i][bl2[x]]-=sum,s2[i][bl2[y]]+=sum;
}
int query(int l,int r,int k){
if(bl1[l]==bl1[r]){
int bl=bl1[l],it=1;
rep(i,l,r){
int x=F[bl][a[i]];
++t1[x],++t2[bl2[x]],t[++tot]=x;
}
while(k>t2[it])k-=t2[it++];
it=L2[it];
while(k>t1[it])k-=t1[it++];
rep(i,1,tot)t1[t[i]]=t2[bl2[t[i]]]=0;tot=0;
return it;
}
int bl=bl1[l],br=bl1[r],it=1,tmp;
rep(i,l,R1[bl]){
int x=F[bl][a[i]];
++t1[x],++t2[bl2[x]],t[++tot]=x;
}
rep(i,L1[br],r){
int x=F[br][a[i]];
++t1[x],++t2[bl2[x]],t[++tot]=x;
}
while(k>(tmp=s2[br-1][it]-s2[bl][it]+t2[it]))k-=tmp,++it;
it=L2[it];
while(k>(tmp=s1[br-1][it]-s1[bl][it]+t1[it]))k-=tmp,++it;
rep(i,1,tot)t1[t[i]]=t2[bl2[t[i]]]=0;tot=0;
return it;
}
signed main(){
n=read(),m=read();
rep(i,1,n)a[i]=read();
init();
while(m--){
int op=read(),x=read(),y=read(),z=read();
if(op==1)update(x,y,z,read());
else printf("%d\n",query(x,y,z));
}
return 0;
}```
AT2006 [AGC003F] Fraction of Fractal.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
int rdc(){
char ch=getchar();
while(ch!='#'&&ch!='.')ch=getchar();
return ch=='#';
}
#define mod 1000000007
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
const int N=1005;
int n,m,a[N][N];
int cnt,cnt1,cnt2,x,y,ans;
LL k;
int qpow(int n,LL k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;return res;}
struct Matrix{
int a[2][2];
Matrix(){a[0][0]=a[0][1]=a[1][0]=a[1][1]=0;}
int*operator [] (const int&k){return a[k];}
friend Matrix operator * (const Matrix&a,const Matrix&b){
Matrix res;
rep(i,0,1)rep(j,0,1)rep(k,0,1)fmod(res.a[i][j]+=1ll*a.a[i][k]*b.a[k][j]%mod);
return res;
}
void e(){
a[0][0]=1,a[0][1]=0;
a[1][0]=0,a[1][1]=1;
}
}sta,tur;
Matrix Matrix_pow(Matrix a,LL k){
Matrix res;res.e();
for(;k;k>>=1,a=a*a)if(k&1)res=res*a;
return res;
}
int solve(int x,int y,int z,LL k){
sta[0][0]=1,sta[0][1]=y;
tur[0][0]=x,tur[0][1]=0;
tur[1][0]=-1,tur[1][1]=z;
tur=Matrix_pow(tur,k);
sta=sta*tur;
return sta[0][0];
}
signed main(){
scanf("%d%d%lld",&n,&m,&k);
rep(i,1,n)rep(j,1,m)a[i][j]=rdc(),cnt+=a[i][j];
rep(i,1,n)rep(j,1,m-1)cnt1+=a[i][j]&&a[i][j+1];//左右连边
rep(i,1,n-1)rep(j,1,m)cnt2+=a[i][j]&&a[i+1][j];//上下连边
rep(i,1,n)x+=a[i][1]&&a[i][m];//左右是否联通
rep(j,1,m)y+=a[n][j]&&a[1][j];//上下是否联通
if(x&&y)return puts("1"),0;
if(!x&&!y)return printf("%d\n",qpow(cnt,k-1)),0;
if(x&&!y)return printf("%d\n",solve(cnt,cnt1,x,k-1)),0;
if(y&&!x)return printf("%d\n",solve(cnt,cnt2,y,k-1)),0;
return 0;
}```
CF1278F Cards.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
const int N=5005;
int dp[N][N],n,m,k,ans,c=1,p;
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod;
k>>=1;
}
return res;
}
signed main() {
scanf("%lld%lld%lld",&n,&m,&k);
dp[0][0]=1;
for(int i=1;i<=k;++i)
for(int j=1;j<=i;++j)
dp[i][j]=(dp[i-1][j]*j+dp[i-1][j-1]*(n-j+1))%mod;
p=qpow(m,mod-2);
for(int i=0;i<=k;++i)
ans=(ans+dp[k][i]*c)%mod,c=c*p%mod;
printf("%lld\n",ans);
return 0;
}```
AT3604 Time Gap.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 55;
int n, a[N], ans, c[N], b[N], d[N], tot;
vector <int> v1, v2;
int calc(int msk) {
v2 = v1;
for(int i = 0; i < tot; ++i)
if(msk >> i & 1) v2.pb(24 - d[i]);
else v2.pb(d[i]);
sort(v2.begin(), v2.end());
int res = 25;
for(int i = 0; i < sz(v2) - 1; ++i) ckmin(res, v2[i + 1] - v2[i]);
return res;
}
signed main() {
n = read();
for(int i = 1; i <= n; ++i) a[i] = read(), ++c[a[i]];
for(int i = 0; i <= 12; ++i) {
if(c[i] >= 3) return puts("0"), 0;
else if(c[i] == 2) v1.pb(i), v1.pb(24 - i);
else if(c[i] == 1) d[tot++] = i;
}
v1.pb(0), v1.pb(24);
for(int msk = 0; msk < 1 << tot; ++msk)
ckmax(ans, calc(msk));
cout << ans << '\n';
return 0;
}```
P3567 [POI2014]KUR-Couriers.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500005;
const int T=N*20;
int n,m,a[N];
int tot,val[T],ls[T],rs[T],root[N];
void update(int &p,int pre,int l,int r,int pos){
p=++tot;
ls[p]=ls[pre],rs[p]=rs[pre],val[p]=val[pre]+1;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],ls[pre],l,mid,pos);
else update(rs[p],rs[pre],mid+1,r,pos);
}
int query(int p,int pre,int l,int r,int k){
if(l==r)return l;
int mid=(l+r)>>1,L=val[ls[p]]-val[ls[pre]],R=val[rs[p]]-val[rs[pre]],res;
if(L>k){res=query(ls[p],ls[pre],l,mid,k);if(~res)return res;}
if(R>k){res=query(rs[p],rs[pre],mid+1,r,k);if(~res)return res;}
return -1;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)a[i]=read()+1,update(root[i],root[i-1],1,n+1,a[i]);
while(m--){
int l=read(),r=read(),k=(r-l+1)/2,t=query(root[r],root[l-1],1,n+1,k);
printf("%d\n",~t?t-1:0);
}
}
```
CF1223D Sequence Sorting.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=3e5+10;
int T,n,m,a[N],lsh[N],len,fir[N],lst[N],ans,dp[N];
#define lt(i) (i&(-i))
void Main() {
n=rd(),ans=0;
for(rint i=1;i<=n;++i)lsh[i]=a[i]=rd(),fir[i]=lst[i]=dp[i]=0;
for(rint i=1;i<=n;++i) {
if(!fir[a[i]])fir[a[i]]=i;
lst[a[i]]=i;
}
sort(a+1,a+n+1),len=unique(a+1,a+n+1)-a-1;
for(rint i=1;i<=len;++i) {
if(fir[a[i]]>lst[a[i-1]])dp[a[i]]=dp[a[i-1]]+1;
else dp[a[i]]=1;ans=max(ans,dp[a[i]]);
}
printf("%d\n",len-ans);
}
signed main() {
T=rd();
while(T--)Main();
return 0;
}```
CF1169A Circle Metro.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=105;
int n,a,b,x,y;
signed main() {
n=rd(),a=rd(),x=rd(),b=rd(),y=rd();
while("fyyAKIOI") {
if(a==b)return puts("YES"),0;
++a,--b;
if(a==n+1)a=1;
if(b==0)b=n;
if(a==b)return puts("YES"),0;
if(x==a||y==b)break;
}
puts("NO");
}
```
CF1236C Labs.cpp
```#include<bits/stdc++.h>
using namespace std;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
#define rint register int
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,a[305][305],cnt;
signed main() {
n=rd();
for(rint j=1;j<=n;++j)
for(rint i=1;i<=n;++i)a[i][j]=++cnt;
for(rint i=1;i<=n;i+=2)
for(rint j=1;j<=n/2;++j)swap(a[n-j+1][i],a[j][i]);
for(rint i=1;i<=n;++i) {
for(rint j=1;j<=n;++j)printf("%d ",a[i][j]);
putchar('\n');
}
return 0;
}```
CF982D Shark.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
int n, a[N], b[N], ans1 = 2e9, cnt[N], ans2;
set <int> s, s2;
inline bool cmp(const int &x, const int &y) {
return a[x] < a[y];
}
signed main() {
n = read();
rep(i, 1, n) a[i] = read(), b[i] = i;
sort(b + 1, b + n + 1, cmp);
cnt[n] = 1;
s.insert(0), s.insert(n + 1), s2.insert(n);
per(i, n, 1) {
if(sz(s2) == 1){
int t = i / *s2.begin();
if(ckmax(ans2, t) || ans2 == t)
ckmin(ans1, a[b[i]] + 1);
}
int x = b[i];
auto it = s.upper_bound(x);
int suf = *it, pre = *(--it);
if(!--cnt[suf - pre - 1]) s2.erase(suf - pre - 1);
s.insert(x);
if(x - 1 > pre) {
if(!cnt[x - pre - 1]++) s2.insert(x - pre - 1);
}
if(x + 1 < suf) {
if(!cnt[suf - x - 1]++) s2.insert(suf - x - 1);
}
}
cout << ans1 << '\n';
}```
CF1467E Distinctive Roots in a Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
const int T = N * 44;
int n, a[N], lsh[N], len, cnt[N], ans, st[N], ed[N], tmr, dif[N];
bool flg[N], fl;
vector <int> e[N];
int rt[N], tot, ls[T], rs[T], val[T];
inline void update(int &p, int pos, int d, int l = 1, int r = n) {
if (!p) p = ++tot;
if (l == r) return val[p] += d, void();
int mid = (l + r) >> 1;
if (pos <= mid) update(ls[p], pos, d, l, mid);
else update(rs[p], pos, d, mid + 1, r);
}
int merge(int x, int y, int l = 1, int r = n) {
if (!x || !y) return x|y;
int mid = (l + r) >> 1, p = ++tot;
if (l == r) return val[p] = val[x] + val[y], p;
ls[p] = merge(ls[x], ls[y], l, mid);
rs[p] = merge(rs[x], rs[y], mid + 1, r);
return p;
}
inline int query(int p, int pos, int l = 1, int r = n) {
if (!p) return 0;
if (l == r) return val[p];
int mid = (l + r) >> 1;
if (pos <= mid) return query(ls[p], pos, l, mid);
else return query(rs[p], pos, mid + 1, r);
}
void dfs(int u, int ft) {
update(rt[u], a[u], 1);
st[u] = ++tmr;
for (int v : e[u]) {
if (v == ft) continue;
dfs(v, u), rt[u] = merge(rt[u], rt[v]);
}
ed[u] = tmr;
for (int v : e[u]) {
if (v == ft) continue;
if (query(rt[v], a[u])) ++dif[1], --dif[st[v]], ++dif[ed[v] + 1];
}
if (query(rt[u], a[u]) < cnt[a[u]]) ++dif[st[u]], --dif[ed[u] + 1];
}
int main() {
n = read();
rep (i, 1, n) lsh[++len] = a[i] = read();
sort(lsh + 1, lsh + len + 1), len = unique(lsh + 1, lsh + len + 1) - lsh - 1;
rep (i, 1, n) a[i] = lower_bound(lsh + 1, lsh + len + 1, a[i]) - lsh, ++cnt[a[i]];
rep (i, 2, n) {
int x = read(), y = read();
e[x].pb(y), e[y].pb(x);
}
dfs(1, 0);
for (int i = 1; i <= n; ++i) dif[i] += dif[i - 1], ans += !dif[i];
cout << ans << '\n';
}```
可持久化平衡树.cpp
```const int N=500005;
const int T=N*50;
int tot;
int rt[N];
struct node{
int ls,rs,siz,rnd,val;
#define ls(x) (t[x].ls)
#define rs(x) (t[x].rs)
#define siz(x) (t[x].siz)
#define rnd(x) (t[x].rnd)
#define val(x) (t[x].val)
}t[T];
int newnode(int v){return ++tot,siz(tot)=1,rnd(tot)=rand()*rand(),val(tot)=v,tot;}
void pushup(int x){siz(x)=siz(ls(x))+1+siz(rs(x));}
int merge(int x,int y){
if(!x||!y)return x|y;
int p=++tot;
if(rnd(x)<rnd(y)){
t[p]=t[x];
rs(p)=merge(rs(p),y);
return pushup(p),p;
} else{
t[p]=t[y];
ls(p)=merge(x,ls(p));
return pushup(p),p;
}
}
void split(int u,int k,int&x,int&y){
if(!u)return x=y=0,void();
if(val(u)<=k)t[x=++tot]=t[u],split(rs(x),k,rs(x),y),pushup(x);
else t[y=++tot]=t[u],split(ls(y),k,x,ls(y)),pushup(y);
}
void insert(int&rt,int v){
int x,y;
split(rt,v,x,y);
rt=merge(x,merge(newnode(v),y));
}
void del(int&rt,int v){
int x,y,z;
split(rt,v,y,z);
split(y,v-1,x,y);
y=merge(ls(y),rs(y));
rt=merge(x,merge(y,z));
}
int rnk(int&rt,int v){
int x,y,res;
split(rt,v-1,x,y);
res=siz(x)+1;
rt=merge(x,y);
return res;
}
int kth(int rt,int k){
int now=rt;
while("fyyAKIOI"){
if(k<=siz(ls(now)))now=ls(now);
else if(siz(ls(now))+1==k)return val(now);
else k-=siz(ls(now))+1,now=rs(now);
}
}
int lbound(int&rt,int v){
int x,y,res;
split(rt,v-1,x,y);
res=kth(x,siz(x));
rt=merge(x,y);
return res;
}
int rbound(int&rt,int v){
int x,y,res;
split(rt,v,x,y);
res=kth(y,1);
rt=merge(x,y);
return res;
}
signed main(){
for(int n=read(),i=1;i<=n;++i){
int v=read(),opt=read(),x=read();
rt[i]=rt[v];
if(opt==1)insert(rt[i],x);
else if(opt==2)del(rt[i],x);
else if(opt==3)printf("%d\n",rnk(rt[i],x));
else if(opt==4)printf("%d\n",kth(rt[i],x));
else if(opt==5)printf("%d\n",lbound(rt[i],x));
else if(opt==6)printf("%d\n",rbound(rt[i],x));
else puts("fyyAKIOI");
}
return 0;
}```
P3825 [NOI2017]游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int rdc() {
char ch=getchar();
while(!isalpha(ch))ch=getchar();
if(ch<='C')return ch-'A';
if(ch<='c')return ch-'a';
return -1;
}
#define fyyAKIOI 50010
const int NJN=fyyAKIOI;
const int N=NJN<<1;
const int M=N<<1;
int n,d,m,mp[NJN],id[10];
int num_edge,head[N];
int scc[N],timer,dfn[N],low[N],Col,stk[N],top;
int f[3][2]={{1,2},{0,2},{0,1}};
struct node {
int i,x,j,y;
}a[M];
struct edge{
int nxt,to;
}e[M];
void addedge(int fr,int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void clear() {
num_edge=0;
memset(head,0,sizeof(head));
memset(scc,0,sizeof(scc));
memset(dfn,0,sizeof(dfn));
memset(low,0,sizeof(low));
Col=0,top=0,timer=0;
}
void tarjan(int u) {
dfn[u]=low[u]=++timer,stk[++top]=u;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u]) {
scc[u]=++Col;
while(stk[top]!=u)scc[stk[top--]]=Col;
--top;
}
}
void solve() {
clear();
for(int z=1;z<=m;++z) {
int i=a[z].i,x=a[z].x,j=a[z].j,y=a[z].y;
if(x==mp[i])continue;
int f1=i+n*(f[mp[i]][0]!=x),t1=j+n*(f[mp[j]][0]!=y);
int f2=f1>n?f1-n:f1+n,t2=t1>n?t1-n:t1+n;
if(y==mp[j])addedge(f1,f2);
else addedge(f1,t1),addedge(t2,f2);
}
for(int i=1;i<=n*2;++i)if(!dfn[i])tarjan(i);
for(int i=1;i<=n;++i)if(scc[i]==scc[i+n])return;
for(int i=1;i<=n;++i)putchar('A'+f[mp[i]][scc[i]>scc[i+n]]);
exit(0);
}
void dfs(int stp) {
if(stp>d) {
solve();
return;
}
mp[id[stp]]=0,dfs(stp+1);
mp[id[stp]]=1,dfs(stp+1);
}
signed main() {
n=rd(),rd();
for(int i=1;i<=n;++i) {
mp[i]=rdc();
if(mp[i]==-1)id[++d]=i;
}
m=rd();
for(int i=1;i<=m;++i)a[i].i=rd(),a[i].x=rdc(),a[i].j=rd(),a[i].y=rdc();
dfs(1);puts("-1");return 0;
}```
CF1168B Good Triple.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300005;
int n;
LL ans;
char s[N];
signed main() {
scanf("%s",s+1),n=strlen(s+1);
for(int i=n,r=n+1;i>=1;--i) {
for(int j=1;i+j*2<=n;++j)
if(s[i]==s[i+j]&&s[i]==s[i+j*2]){r=min(r,i+j*2);break;}
ans+=n-r+1;
}
printf("%lld\n",ans);
}
```
CF616A Comparing Two Long Integers.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int n,m,a,b;
char S[N],T[N];
signed main(){
scanf("%s%s",S+1,T+1);
n=strlen(S+1),m=strlen(T+1);
a=0,b=0;
rep(i,1,n)if(S[i]!='0'){a=i;break;}
rep(i,1,m)if(T[i]!='0'){b=i;break;}
if(!a&&!b)return puts("="),0;
if(!a&&b)return puts("<"),0;
if(a&&!b)return puts(">"),0;
if(n-a+1>m-b+1)return puts(">"),0;
else if(n-a+1<m-b+1)return puts("<"),0;
int i=a,j=b;
while(i<=n&&j<=m){
if(S[i]<T[j])return puts("<"),0;
else if(S[i]>T[j])return puts(">"),0;
++i,++j;
}
puts("=");
}```
P1742 最小圆覆盖.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
struct vec {
double x,y;
vec(){x=y=0;}
vec(double _x,double _y){x=_x,y=_y;}
vec operator + (const vec &t)const{return vec(x+t.x,y+t.y);}
vec operator - (const vec &t)const{return vec(x-t.x,y-t.y);}
vec operator * (const double &t)const{return vec(x*t,y*t);}
vec operator / (const double &t)const{return vec(x/t,y/t);}
vec rot_90() {return vec(y,-x);}
double len2() {return x*x+y*y;}
}p[N],O;
int n;
double R;
double cross(const vec &x,const vec &y) {return x.x*y.y-x.y*y.x;}
vec intersection(const vec &a1,const vec &a2,const vec &b1,const vec &b2) {
double t=cross(b1-a1,b2)/cross(a2,b2);
return a1+a2*t;
}
vec circle(const vec &a,const vec &b,const vec &c) {
return intersection((a+b)/2,(b-a).rot_90(),(b+c)/2,(c-b).rot_90());
}
void min_circle() {
random_shuffle(p+1,p+n+1);
R=0;
for(rint i=1;i<=n;++i) {
if((p[i]-O).len2()>R) {
O=p[i],R=0;
for(rint j=1;j<i;++j) {
if((p[j]-O).len2()>R) {
O=(p[i]+p[j])/2,R=(p[j]-O).len2();
for(rint k=1;k<j;++k) {
if((p[k]-O).len2()>R) {
O=circle(p[i],p[j],p[k]),R=(p[k]-O).len2();
}
}
}
}
}
}
}
signed main() {
srand('f'*'f'*'y'*' '*'A'*'K'*' '*'I'*'O'*'I');n=rd();
for(rint i=1;i<=n;++i)scanf("%lf%lf",&p[i].x,&p[i].y);
min_circle();
printf("%.10lf\n%.10lf %.10lf",sqrt(R),O.x,O.y);
return 0;
}
```
P6031 CF1278F Cards 加强版.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=10000005;
int n,k,p,ans;
int f[N];
namespace math{
int id[N],pct,inv[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
void initmath(const int&n=N-1){
id[1]=1,id[0]=0;
for(int i=2;i<=n;++i){
if(!inv[i])f[++pct]=i,id[i]=qpow(i,k);
for(int j=1;i*f[j]<=n&&j<=pct;++j){
inv[i*f[j]]=1,id[i*f[j]]=1ll*id[i]*id[f[j]]%mod;
if(i%f[j]==0)break;
}
}
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using namespace math;
namespace solve1{
void main(){
f[0]=1;for(int i=1;i<=n;++i)f[i]=1ll*(mod+1-p)*f[i-1]%mod;
for(int i=0,j=1,y=1;i<=n;++i){
fmod(ans+=1ll*j*y%mod*f[n-i]%mod*id[i]%mod);
j=1ll*j*(n-i)%mod*inv[i+1]%mod,y=1ll*y*p%mod;
}
printf("%d\n",ans),exit(0);
}
}
namespace solve2{
void main(){
f[k]=1;
for(int i=k-1,x=0,z=1,y=1;i>=0;--i){
++x,z=1ll*z*(x+n-k-1)%mod*inv[x]%mod,y=1ll*y*(mod-p)%mod;
fmod(f[i]=1ll*(mod+1-p)*f[i+1]%mod),fmod(f[i]+=1ll*y*z%mod);
}
for(int i=0,j=1,y=1;i<=k;++i){
fmod(ans+=1ll*id[i]*j%mod*y%mod*f[i]%mod);
j=1ll*j*(n-i)%mod*inv[i+1]%mod,y=1ll*y*p%mod;
}
printf("%d\n",ans),exit(0);
}
}
signed main(){
n=read(),p=qpow(read(),mod-2),k=read(),initmath(min(n,k)+3);
if(n<=k)solve1::main();
else solve2::main();
}```
CF632E Thief in a Shop.cpp
```#include <bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int mod;
const int N=1100;
int qpow(int n,int k) {
int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;
return res;
}
int n,k,a[N*N<<1],x[N],lim,lg,rev[N*N<<1];
vector<int>v;
void NTT(int *a,int g) {
for(rint i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(rint i=1;i<lim;i<<=1) {
LL wn=qpow(g,(mod-1)/(i<<1));
for(rint j=0;j<lim;j+=(i<<1)) {
LL w0=1;
for(rint k=0;k<i;++k,w0=w0*wn%mod) {
LL X=a[j+k],Y=w0*a[j+k+i]%mod;
a[j+k]=(X+Y)%mod;
a[j+k+i]=(X-Y+mod)%mod;
}
}
}
}
signed main() {
n=rd(),k=rd();
for(rint i=1;i<=n;++i)x[i]=rd();
for(lim=1,lg=0;lim<=524288;lim<<=1,++lg);
for(rint i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
for(rint i=1;i<=n;++i)++a[x[i]];
mod=998244353;
NTT(a,3);
for(rint i=0;i<lim;++i)a[i]=qpow(a[i],k);
NTT(a,qpow(3,mod-2));
for(rint i=0,inv=qpow(lim,mod-2);i<lim;++i)a[i]=1ll*a[i]*inv%mod;
for(rint i=0;i<=1000000;++i)if(a[i])v.push_back(i);
memset(a,0,sizeof(a));
for(rint i=1;i<=n;++i)++a[x[i]];
mod=1004535809;
NTT(a,3);
for(rint i=0;i<lim;++i)a[i]=qpow(a[i],k);
NTT(a,qpow(3,mod-2));
for(rint i=0,inv=qpow(lim,mod-2);i<lim;++i)a[i]=1ll*a[i]*inv%mod;
for(rint i=0;i<=1000000;++i)if(a[i])v.push_back(i);
sort(v.begin(),v.end());
int len=unique(v.begin(),v.end())-v.begin();
for(rint i=0;i<len;++i)printf("%d ",v[i]);
return 0;
}```
P4548 [CTSC2006]歌唱王国.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
#define mod 10000
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,m,p[N],a[N],ans;
bool A[N];
void print(int n){
int d[5];d[0]=0;
for(;n;n/=10)d[++d[0]]=n%10;
while(d[0]<4)d[++d[0]]=0;
while(d[0])printf("%c",'0'+d[d[0]--]);
puts("");
}
signed main(){
n=read();
for(int T=read();T;--T){
m=read(),ans=0;
rep(i,1,m)a[i]=read(),A[i]=0;
p[1]=0;
int j=0;
for(int i=2;i<=m;++i){
while(j&&a[j+1]!=a[i])j=p[j];
if(a[j+1]==a[i])++j;
p[i]=j;
}
j=m;
while(j)A[j]=1,j=p[j];
for(int i=1,j=n;i<=m;++i,j=1ll*j*n%mod)if(A[i])fmod(ans+=j);
print(ans);
}
}```
P3320 [SDOI2015]寻宝游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mkp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, x, y) for (int i = x, i##end = y; i <= i##end; ++i)
#define per(i, x, y) for (int i = x, i##end = y; i >= i##end; --i)
inline int read() {
int x = 0, f = 1; char ch = getchar();
while (!isdigit(ch)) { if (ch == '-') f = 0; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
const int N = 100005;
int n, m, dfn[N], tmr, dep[N], bz[20][N], rev[N];
LL now, di[N];
bool used[N];
set<int>S;
vector<pair<int, int> >e[N];
void dfs(int u, int ft) {
rev[dfn[u] = ++tmr] = u, dep[u] = dep[bz[0][u] = ft] + 1;
for (int i = 1; 1 << i <= dep[u]; ++i)
bz[i][u] = bz[i - 1][bz[i - 1][u]];
for (auto it = e[u].begin(); it != e[u].end(); ++it) {
int v = it->se, w = it->fi;
if (v == ft) continue;
di[v] = di[u] + w, dfs(v, u);
}
}
int LCA(int x, int y) {
if (dep[x] < dep[y]) x ^= y ^= x ^= y;
for (int i = 19, dif = dep[x] - dep[y]; i >= 0; --i)
if (dif >> i & 1) x = bz[i][x];
if (x == y) return x;
for (int i = 19; i >= 0; --i)
if (bz[i][x] != bz[i][y]) x = bz[i][x], y = bz[i][y];
return bz[0][x];
}
LL dis(int x, int y) { return di[x] + di[y] - (di[LCA(x, y)] * 2); }
void add(int u) {
if (S.size() == 0) return S.insert(dfn[u]), void();
auto _s = S.upper_bound(dfn[u]), _p = _s;
--_p;
int pre = rev[_s == S.begin() ? *S.rbegin() : *_p];
int suf = rev[_s == S.end() ? *S.begin() : *_s];
now += dis(pre, u) + dis(suf, u) - dis(pre, suf);
S.insert(dfn[u]);
}
void del(int u) {
if (S.size() == 1) return S.erase(dfn[u]), void();
auto _s = S.upper_bound(dfn[u]), _p = _s;
--_p;
int pre = rev[_p == S.begin() ? *S.rbegin() : *(--_p)];
int suf = rev[_s == S.end() ? *S.begin() : *_s];
now -= dis(pre, u) + dis(suf, u) - dis(pre, suf);
S.erase(dfn[u]);
}
signed main(){
n = read(), m = read();
for (int i = 1; i < n; ++i) {
int x = read(), y = read(), z = read();
e[x].pb(mkp(z, y)), e[y].pb(mkp(z, x));
}
dfs(1, 0);
while (m--) {
int x = read();
if (used[x]) del(x);
else add(x);
used[x] ^= 1;
printf("%lld\n", now);
}
return 0;
}```
CF1276F Asterisk Substrings.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
char str[N];
LL ans=2;
int n,rt[N<<1];
struct SAM{
static const int S=N<<1;
int mxlen[S],link[S],trans[S][26],tot,to[N];
int q[S],t[N];
SAM(){
memset(trans,0,sizeof(trans));
tot=1;
memset(link,0,sizeof(link));
memset(mxlen,0,sizeof(mxlen));
}
int extend(int c,int lst){
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void rsort(){
for(int i=0;i<=n;++i)t[i]=0;
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=n;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
}
}sam[2];
int fa[20][N<<1],lg[N<<1],pw[30],dep[N<<1],rev[N<<1],dfn[N<<1],tmr;
void init_lca(){
lg[0]=-1;for(int i=1;i<=n<<1;++i)lg[i]=lg[i>>1]+1;
pw[0]=1;for(int i=1;i<=20;++i)pw[i]=pw[i-1]<<1;
for(int i=1;i<=lg[n<<1];++i)
for(int j=1;j<=n<<1;++j)
fa[i][j]=fa[i-1][fa[i-1][j]];
}
int LCA(int x,int y){
if(!x||!y)return 0;
if(dep[x]<dep[y])x^=y^=x^=y;
int delta=dep[x]-dep[y];
for(int i=19;i>=0;--i)if(delta>>i&1)x=fa[i][x];
if(x==y)return x;
for(int i=19;i>=0;--i)if(fa[i][x]!=fa[i][y])x=fa[i][x],y=fa[i][y];
return fa[0][x];
}
vector<int>e[N<<1];
void dfs(int u){
rev[dfn[u]=++tmr]=u;
for(int v:e[u])fa[0][v]=u,dep[v]=dep[u]+1,dfs(v);
}
struct SegmentTree{
static const int T=(N<<1)*40;
int ls[T],rs[T],tot,L[T],R[T];
LL val[T];
SegmentTree(){
memset(ls,0,sizeof(ls));
memset(rs,0,sizeof(rs));
memset(val,0,sizeof(val));
memset(L,0,sizeof(L));
memset(R,0,sizeof(R));
tot=0;
}
void pushup(int p){
val[p]=val[ls[p]]+val[rs[p]]-sam[1].mxlen[LCA(rev[R[ls[p]]],rev[L[rs[p]]])];
L[p]=ls[p]?L[ls[p]]:L[rs[p]];
R[p]=rs[p]?R[rs[p]]:R[ls[p]];
}
void update(int&p,int pos,int k,int l=1,int r=n<<1){
if(!p)p=++tot;
int mid=(l+r)>>1;
if(l==r){
L[p]=R[p]=pos,val[p]=sam[1].mxlen[rev[pos]];
return;
}
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
pushup(p);
}
int merge(int x,int y,int l=1,int r=n<<1){
if(!x||!y)return x|y;
int mid=(l+r)>>1,p=++tot;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return pushup(p),p;
}
}seg;
signed main(){
scanf("%s",str+1),n=strlen(str+1);
for(int i=1,lst=1;i<=n;++i){
sam[0].to[i]=lst=sam[0].extend(str[i]-'a',lst);
if(i==n-1)for(int i=1;i<=sam[0].tot;++i)ans+=sam[0].mxlen[i]-sam[0].mxlen[sam[0].link[i]];
}
for(int i=n,lst=1;i>=1;--i){
sam[1].to[i]=lst=sam[1].extend(str[i]-'a',lst);
if(i==2)for(int i=1;i<=sam[1].tot;++i)ans+=sam[1].mxlen[i]-sam[1].mxlen[sam[1].link[i]];
}
for(int i=1;i<=sam[0].tot;++i)ans+=sam[0].mxlen[i]-sam[0].mxlen[sam[0].link[i]];
sam[0].rsort();
for(int i=2;i<=sam[1].tot;++i)e[sam[1].link[i]].pb(i);
dfs(1),init_lca();
for(int i=1;i<=n-2;++i)
seg.update(rt[sam[0].to[i]],dfn[sam[1].to[i+2]],1);
for(int i=sam[0].tot;i>=1;--i){
int u=sam[0].q[i];
rt[sam[0].link[u]]=seg.merge(rt[sam[0].link[u]],rt[u]);
}
for(int i=1;i<=sam[0].tot;++i)
ans+=1ll*(sam[0].mxlen[i]-sam[0].mxlen[sam[0].link[i]])*seg.val[rt[i]];
printf("%lld\n",ans);
return 0;
}```
CF908G New Year and Original Order.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 705
#define mod 1000000007
char s[N];
int d[N],dp[N][N][10];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int dfs(int pos,int limit,int sum,int low){
if(!pos)return !sum;
if(!limit&&~dp[pos][sum][low])return dp[pos][sum][low];
int res=0,up=limit?d[pos]:9;
for(int i=0;i<=up;++i)fmod(res+=dfs(pos-1,limit&&i==up,sum-(i>=low),low));
if(!limit)dp[pos][sum][low]=res;
return res;
}
int solve(char*s){
int res=0;
d[0]=0;int n=strlen(s+1);
for(int i=1,j=n;i<=n;++i,--j)d[j]=s[i]-'0';
for(int i=1;i<=9;++i)
for(int j=1,now=1;j<=n;++j,now=(10ll*now+1)%mod)
fmod(res+=1ll*dfs(n,1,j,i)*now%mod);
return res;
}
signed main(){
memset(dp,-1,sizeof(dp));
scanf("%s",s+1);
printf("%d\n",solve(s));
}```
CF1006F Xor-Paths.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=25;
int n,m,b[N][N],tot;
LL k,ans,a[N][N];
map<LL,int>mp[N*N];
void dfs1(int x,int y,LL v){
if(x==n&&y==m)return ans+=v==k,void();
if(x<n)dfs1(x+1,y,v^a[x+1][y]);
if(y<m)dfs1(x,y+1,v^a[x][y+1]);
}
void dfs2(int x,int y,LL v){
if(b[x][y])return mp[b[x][y]][v]++,void();
if(x<n)dfs2(x+1,y,v^a[x+1][y]);
if(y<m)dfs2(x,y+1,v^a[x][y+1]);
}
void dfs3(int x,int y,LL v){
if(b[x][y])return mp[b[x][y]][v]++,void();
if(x>1)dfs3(x-1,y,v^a[x-1][y]);
if(y>1)dfs3(x,y-1,v^a[x][y-1]);
}
signed main(){
cin>>n>>m>>k;
rep(i,1,n)rep(j,1,m)cin>>a[i][j];
if(n<=6&&m<=6){
dfs1(1,1,a[1][1]);
cout<<ans;
return 0;
}
rep(i,1,n)rep(j,1,m){
if(i+j-2==(n+m-2)>>1){
b[i][j]=++tot;
if(j<m&&!b[i][j+1])b[i][j+1]=++tot;
if(i<n&&!b[i+1][j])b[i+1][j]=++tot;
}
}
dfs2(1,1,a[1][1]),dfs3(n,m,a[n][m]);
rep(i,1,n)rep(j,1,m){
if(i<n&&b[i][j]&&b[i+1][j]){
for(auto t:mp[b[i][j]])ans+=1ll*t.se*mp[b[i+1][j]][k^t.fi];
}
if(j<m&&b[i][j]&&b[i][j+1]){
for(auto t:mp[b[i][j]])ans+=1ll*t.se*mp[b[i][j+1]][k^t.fi];
}
}
cout<<ans<<'\n';
}
/*
7 7 6
1 1 4 5 6 1 4
2 3 5 6 8 9 0
1 6 3 4 7 8 9
2 4 3 6 5 7 1
2 4 3 6 7 3 9
1 4 2 8 4 6 9
1 5 3 4 7 5 3
*/```
P3181 [HAOI2016]找相同字符.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=4e5+5;
int n,t[N],x[N],y[N],sa[N],rk[N],height[N];
int lena,lenb,st[N],top,lp[N],rp[N];
LL ans,f[N];
char s[N],A[N],B[N];
void get_SA() {
memset(sa,0,sizeof(sa));
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
int m='~',num;
for(int i=1;i<=m;++i)t[i]=0;
for(int i=1;i<=n;++i)++t[x[i]=s[i]];
for(int i=1;i<=m;++i)t[i]+=t[i-1];
for(int i=n;i>=1;--i)sa[t[x[i]]--]=i;
for(int k=1;k<=n;k<<=1) {
num=0;
for(int i=1;i<=m;++i)t[i]=0;
for(int i=n-k+1;i<=n;++i)y[++num]=i;
for(int i=1;i<=n;++i)if(sa[i]>k)y[++num]=sa[i]-k;
for(int i=1;i<=n;++i)++t[x[i]];
for(int i=2;i<=m;++i)t[i]+=t[i-1];
for(int i=n; i>=1;--i)sa[t[x[y[i]]]--]=y[i];
swap(x,y);x[sa[1]]=1,num=1;
for(int i=2;i<=n;++i)
x[sa[i]]=(y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k])?num:++num;
if(num==n)break;m=num;
}
}
void get_Height() {
for(int i=1;i<=n;++i)rk[sa[i]]=i;
for(int i=1,k=0;i<=n;++i) {
if(rk[i]==1)continue;
if(k)--k;
int j=sa[rk[i]-1];
while(j+k<=n&&i+k<=n&&s[j+k]==s[i+k])++k;
height[rk[i]]=k;
}
}
void solve(int flg) {
get_SA(),get_Height();
top=0;
memset(f,0,sizeof(f));
for(int i=1;i<=n;++i) {
while(top&&height[st[top]]>=height[i])--top;
f[i]=f[st[top]]+height[i]*(i-st[top]);
st[++top]=i;
}
for(int i=1;i<=n;++i)ans+=f[i]*flg;
}
signed main() {
scanf("%s%s",A+1,B+1);
lena=strlen(A+1),lenb=strlen(B+1),n=lena+lenb+1;
for(int i=1;i<=lena;++i)s[i]=A[i];
s[lena+1]='~';
for(int i=1;i<=lenb;++i)s[i+lena+1]=B[i];
solve(1);
for(int i=1;i<=lena;++i)s[i]=A[i];n=lena;
solve(-1);
for(int i=1;i<=lenb;++i)s[i]=B[i];n=lenb;
solve(-1);
printf("%lld\n",ans);
return 0;
}```
P7371 [COCI2018-2019#4] Kisik.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 1000006;
int n, k;
LL ans = 1e18, now;
pair<int, int> p[N];
multiset <int, greater<int> > s;
signed main(){
n = read(), k = read();
rep(i, 1, n) p[i].se = read(), p[i].fi = read();
sort(p + 1, p + n + 1);
rep(i, 1, n) {
if(sz(s) < k) s.insert(p[i].se), now += p[i].se;
else {
int tmp = *s.begin();
if(tmp > p[i].se) {
now -= tmp - p[i].se;
s.erase(s.begin()), s.insert(p[i].se);
}
}
if(sz(s) == k) ckmin(ans, now * p[i].fi);
}
cout << ans << '\n';
}```
P7297 [USACO21JAN] Telephone G.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=52;
const int N=50005;
const int M=N*K*2;
int n,k,c[K][K],b[N],lst[K],dis[N];
bool vis[N];
int hed[N],et;
struct edge{int nx,to,vl;}e[M];
void adde(int u,int v,int d){e[++et].nx=hed[u],e[et].to=v,e[et].vl=d,hed[u]=et;}
void Dij(){
priority_queue<pair<int,int> >pq;
memset(dis,0x3f,sizeof(dis));
pq.push(mkp(dis[1]=0,1));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vis[u])continue;
vis[u]=1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(ckmin(dis[v],dis[u]+e[i].vl)){
if(!vis[v])pq.push(mkp(-dis[v],v));
}
}
}
}
signed main(){
n=read(),k=read();
rep(i,1,n)b[i]=read();
rep(i,1,k){
static char str[K];
scanf("%s",str+1);
rep(j,1,k)c[i][j]=str[j]-'0';
}
for(int i=1;i<=n;++i){
rep(j,1,k)if(c[b[i]][j]&&lst[j])adde(i,lst[j],i-lst[j]);
lst[b[i]]=i;
}
memset(lst,0,sizeof(lst));
for(int i=n;i>=1;--i){
rep(j,1,k)if(c[b[i]][j]&&lst[j])adde(i,lst[j],lst[j]-i);
lst[b[i]]=i;
}
for(int i=1;i<=n;++i)if(c[b[i]][b[n]])adde(i,n,n-i);
Dij();
printf("%d\n",dis[n]!=0x3f3f3f3f?dis[n]:-1);
return 0;
}```
CF896A Nephren gives a riddle.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+!0;
int len[N],n,k,T;
const int inf=1e18+20;
char s[4][100]={
" What are you doing at the end of the world? Are you busy? Will you save us?",
" What are you doing while sending \"",
" \"? Are you busy? Will you send \"",
" \"?"
};
char dfs(int n,int k) {
if(k>len[n])return '.';
if(!n)return s[0][k];
if(k<=34)return s[1][k];
if(k<=34+len[n-1])return dfs(n-1,k-34);
if(k<=34+len[n-1]+32)return s[2][k-34-len[n-1]];
if(k<=34+len[n-1]+32+len[n-1])return dfs(n-1,k-66-len[n-1]);
return s[3][k-66-len[n-1]*2];
}
signed main() {
len[0]=75;
for(rint i=1;i<N;++i)
len[i]=min(len[i-1]*2+68,inf);
T=rd();
while(T--) {
n=rd(),k=rd();
putchar(dfs(n,k));
}
return 0;
}```
CF1264A Beautiful Regional Contest.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=400010;
int T,n,a[N],g,s,b;
signed main() {
T=rd();
while(T--) {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
int i1=1,i2=1,i3=1;
g=s=b=-1;
while(i1<=n&&a[i1+1]==a[i1])++i1;
g=i1;
i2=i1+1;
while(i2<=n&&(i2<=i1*2||a[i2+1]==a[i2]))++i2;
s=i2-i1;
i3=i2+1;
while(i3<=n&&(i3<=i1+i2||a[i3+1]==a[i3]))++i3;
for(;;) {
if(i3>n/2)break;
b=i3-i2;++i3;
while(a[i3+1]==a[i3])++i3;
}
if(g==-1||s==-1||b==-1||g>=s||g>=b)g=s=b=0;
printf("%d %d %d\n",g,s,b);
}
return 0;
}```
CF1131C Birthday.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 105
int n,a[N],ans[N];
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=read();
sort(a+1,a+n+1);
int l=1,r=n;
ans[1]=a[1],ans[n]=a[2];
for(int i=3;i<=n;++i){
if(a[i]-ans[l]<a[i]-ans[r])ans[--r]=a[i];
else ans[++l]=a[i];
}
for(int i=1;i<=n;++i)printf("%lld ",ans[i]);
puts("");
return 0;
}```
P1659 [国家集训队]拉拉队排练.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 19930726
const int N=1000005;
inline int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
int n,id[N],ans=1;
LL k;
char str[N];
int len[N],tr[N][26],fail[N],tot,las,cnt[N];
inline int gfail(int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
inline bool cmp(const int&a,const int&b){
return len[a]>len[b];
}
signed main(){
scanf("%d%lld%s",&n,&k,str);
len[0]=0,len[1]=-1,fail[0]=1,fail[1]=0,tot=1,las=0;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=gfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[gfail(fail[f],i)][c];
len[tot]=len[f]+2,tr[f][c]=tot;
}
las=tr[f][c],++cnt[las];
}
for(int i=tot;i>=0;--i)cnt[fail[i]]+=cnt[i];
for(int i=0;i<=tot;++i)id[i]=i;
sort(id,id+tot+1,cmp);
for(int i=0;i<=tot;++i){
int x=id[i];
if(len[x]%2==0)continue;
if(k<=cnt[x]){
ans=1ll*ans*qpow(len[x],k)%mod,k=0;
break;
}else{
ans=1ll*ans*qpow(len[x],cnt[x])%mod;
k-=cnt[x];
}
}
if(k)cout<<-1<<'\n';
else cout<<ans<<'\n';
}```
CF1366D Two Divisors.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=10000005;
const int M=500005;
int n,a[M],ansa[N],ansb[N];
int pri[N/10],pct,low[N];
bool vis[N];
void Sieve(const int&n=N-1){
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1,low[i*pri[j]]=pri[j];
if(i%pri[j]==0)break;
}
}
}
signed main(){
Sieve();
n=read();
rep(i,1,n)a[i]=read();
rep(i,1,n){
if(!vis[a[i]]){
ansa[i]=ansb[i]=-1;
continue;
}
int x=low[a[i]],r1=1,r2=a[i];
while(r2%x==0)r1*=x,r2/=x;
if(r2!=1)ansa[i]=r1,ansb[i]=r2;
else ansa[i]=ansb[i]=-1;
}
rep(i,1,n)printf("%d ",ansa[i]);puts("");
rep(i,1,n)printf("%d ",ansb[i]);puts("");
return 0;
}```
P2053 [SCOI2007]修车.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=620;
const int M=66010;
const int inf=1<<28;
int head[N],num_edge=1;
int n,m,s,t;
int T[65][11];
int dst[N],cur[N],inq[N],maxflow,cost,vis[N];
struct edge {
int val,w,to,nxt;
}e[M];
void addedge_(int from,int to,int val,int w) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
e[num_edge].w=w;
head[from]=num_edge;
}
void addedge(int from,int to,int val,int w) {
addedge_(from,to,val,w),addedge_(to,from,0,-w);
}
bool spfa() {
for(rint i=1;i<=t;++i)dst[i]=inf,cur[i]=head[i],inq[i]=0;
queue<int>q;q.push(s),dst[s]=0;
while(!q.empty()) {
int u=q.front();q.pop(),inq[u]=0;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(dst[v]>dst[u]+e[i].w&&e[i].val) {
dst[v]=dst[u]+e[i].w;
if(!inq[v])q.push(v),inq[v]=1;
}
}
}
return dst[t]!=inf;
}
int dfs(int u,int flow) {
vis[u]=1;
if(u==t)return flow;
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
int v=e[i].to;cur[u]=i;
if(e[i].val&&dst[v]==dst[u]+e[i].w&&(v==t||!vis[v])) {
rlow=dfs(v,min(e[i].val,flow-used));
if(rlow) {
e[i].val-=rlow;
e[i^1].val+=rlow;
used+=rlow;
cost+=rlow*e[i].w;
if(used==flow)break;
}
}
}
return used;
}
void MCMF() {
maxflow=cost=0;
while(spfa()) {
vis[t]=1;
while(vis[t])memset(vis,0,sizeof(vis)),maxflow+=dfs(s,inf);
}
}
signed main() {
m=rd(),n=rd(),s=n*m+n+1,t=s+1;
for(rint i=1;i<=n;++i)
for(rint j=1;j<=m;++j)
T[i][j]=rd();
for(rint i=1;i<=n;++i)addedge(s,i,1,0);
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
addedge((i-1)*n+j+n,t,1,0);
for(rint i=1;i<=n;++i) {
for(rint j=1;j<=m;++j) {
for(rint k=1;k<=n;++k) {
addedge(i,(j-1)*n+k+n,1,T[i][j]*k);
}
}
}
MCMF();
printf("%.2lf\n",1.0*cost/n);
return 0;
}
```
CF1081E Missing Numbers.cpp
```// Problem: E. Missing Numbers
// Contest: Codeforces - Avito Cool Challenge 2018
// URL: https://codeforces.com/contest/1081/problem/E
// Memory Limit: 256 MB
// Time Limit: 2000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,a[N],b[N],now,tot;
bool isrt(int x){
if(x>1e13)return 0;
int l=max(1ll,(int)(sqrt(x)-3)),r=sqrt(x)+3;
rep(i,l,r)if(x%i==0)return 1;
return 0;
}
signed main(){
n=read()/2;
rep(i,1,n)a[i]=read();
for(int i=1;i<=n;++i){
bool flg=0;int res;
for(int j=sqrt(a[i]);j>=1;--j){
if(a[i]%j)continue;
int X=a[i]/j,Y=j;
if((X-Y)%2)continue;
res=(X-Y)/2,res*=res;
if(res<=now)continue;
flg=1;break;
}
if(now>=res||!flg)return puts("No"),0;
b[++tot]=res-now,b[++tot]=a[i];
now=a[i]+res;
}
now=0;
rep(i,1,n<<1){
now+=b[i];
if(!isrt(now))return puts("No"),0;
}
puts("Yes");
rep(i,1,n<<1)printf("%lld ",b[i]);
puts("");
return 0;
}```
P2619 [国家集训队2]Tree I.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50010;
const int M=100010;
struct node {
int u,v,d,col;
}e[M];
bool cmp(const node &a,const node &b) {
return a.d!=b.d?a.d<b.d:a.col<b.col;
}
int n,m,need,ans;
int sumval;
int fa[N];
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
int check(int x) {
for(int i=1;i<=n;++i)fa[i]=i;
for(int i=1;i<=m;++i)if(!e[i].col)e[i].d+=x;
sort(e+1,e+m+1,cmp);
int res=0;sumval=0;
for(int i=1;i<=m;++i) {
int fx=find(e[i].u),fy=find(e[i].v);
if(fx!=fy)sumval+=e[i].d,res+=(!e[i].col),fa[fx]=fy;
}
for(int i=1;i<=m;++i)if(!e[i].col)e[i].d-=x;
return res;
}
signed main() {
n=rd(),m=rd(),need=rd();
for(int i=1; i<=m; ++i)
e[i].u=rd()+1,e[i].v=rd()+1,e[i].d=rd(),e[i].col=rd();
int l=-100,r=100;
while(l<=r) {
int mid=(l+r)>>1,k=check(mid);
if(k>=need)ans=sumval-need*mid,l=mid+1;
else r=mid-1;
}
printf("%d\n",ans);
return 0;
}```
P4288 [SHOI2014]信号增幅仪.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
const double pi=acos(-1.0);
struct vec {
double x,y;
vec(){x=y=0;}
vec(double _x,double _y){x=_x,y=_y;}
vec operator + (const vec &t)const{return vec(x+t.x,y+t.y);}
vec operator - (const vec &t)const{return vec(x-t.x,y-t.y);}
vec operator * (const double &t)const{return vec(x*t,y*t);}
vec operator / (const double &t)const{return vec(x/t,y/t);}
vec rot_90() {return vec(y,-x);}
double len2() {return x*x+y*y;}
}p[N],O;
double R;
int n;
double cross(const vec &a,const vec &b) {
return a.x*b.y-a.y*b.x;
}
vec inter(const vec &p1,const vec &v1,const vec &p2,const vec &v2) {
double t=cross(p2-p1,v2)/cross(v1,v2);
return p1+v1*t;
}
vec circle(const vec &a,const vec &b,const vec &c) {
return inter((a+b)/2,(b-a).rot_90(),(b+c)/2,(c-b).rot_90());
}
void min_circle() {
random_shuffle(p+1,p+n+1);
R=0;
for(rint i=1;i<=n;++i) {
if((p[i]-O).len2()>R) {
O=p[i],R=0;
for(rint j=1;j<i;++j) {
if((p[j]-O).len2()>R) {
O=(p[i]+p[j])/2,R=(p[i]-O).len2();
for(rint k=1;k<j;++k) {
if((p[k]-O).len2()>R) {
O=circle(p[i],p[j],p[k]),R=(p[i]-O).len2();
}
}
}
}
}
}
R=sqrt(R);
}
double A,P;
signed main() {
srand(time(0));
n=rd();
for(rint i=1;i<=n;++i) scanf("%lf%lf",&p[i].x,&p[i].y);
A=1.0*rd()*pi/180,P=rd();
for(rint i=1;i<=n;++i) {
double X=p[i].x,Y=p[i].y;
p[i].x=X*cos(A)+Y*sin(A);
p[i].y=Y*cos(A)-X*sin(A);
p[i].x/=P;
}
min_circle();
printf("%.3lf\n",R);
return 0;
}
```
CF1451E2 Bitwise Queries (Hard Version).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=(1<<16)+5;
int n,a[N],lst[N];
const char QUE[3][5]={"XOR","OR","AND"};
int ask(int op,int x,int y){
printf("%s %d %d\n",QUE[op],x,y),fflush(stdout);
return read();
}
signed main(){
scanf("%d",&n);
rep(i,2,n)a[i]=ask(0,1,i);
rep(i,1,n){
if(lst[a[i]]){
int x=ask(1,lst[a[i]],i);
a[1]=x^a[i];
printf("! %d",a[1]);
rep(i,2,n)printf(" %d",a[1]^a[i]);puts("");fflush(stdout);
return 0;
}
lst[a[i]]=i;
}
rep(i,1,n){
if(a[i]==1)a[1]|=ask(2,1,i);
if(a[i]==n-2)a[1]|=ask(1,1,i)&1;
}
printf("! %d",a[1]);
rep(i,2,n)printf(" %d",a[1]^a[i]);puts("");fflush(stdout);
return 0;
}```
CF1368F Lamps on a Circle.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 1005;
int n, a[N], len, tot, input;
bool vis[N];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin >> n;
if (n <= 3) return cout << 0 << endl, 0;
for (len = 1; len * len < n; ++ len);
for (int i = 1; i <= n; ++ i) if ((i - 1) % len) a[++ tot] = i;
while ("fyy AK IOI") {
if (len > tot) break;
cout << len;
for (int i = 1; i <= len; ++ i) cout << ' ' << a[tot], vis[a[tot]] = 1, -- tot;
cout << endl;
cin >> input;
for (int i = input, j = 0; j < len; i = i % n + 1, ++ j) if (vis[i]) vis[i] = 0, a[++ tot] = i;
}
cout << "0" << endl;
return 0;
}
```
CF1280A Cut and Paste.cpp
``` #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1050;
const int mod=1e9+7;
int T,x,it,n;
LL ans;
string s;
signed main() {
T=rd();
while(T--) {
x=rd(),it=0,cin>>s,ans=n=s.length();
for(rint i=0;i<x;++i) {
if(s.length()>=x)ans=(ans+1ll*(ans-i-1+mod)*(s[i]-'1')%mod)%mod;
else {
if(s[i]=='2')s+=s.substr(i+1);
else if(s[i]=='3')s+=s.substr(i+1)+s.substr(i+1);
ans=s.length();
}
}
printf("%lld\n",ans);
}
return 0;
}```
CF504E Misha and LCP on Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
#define mod1 998244353
#define mod2 1004535809
#define base1 31
#define base2 37
inline int qpow(int n,int k,int mod){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
int n,m,h[N];
char str[N];
struct edge{int nx,to;}e[N<<1];
int hed[N],et;
inline void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
int dep[N],son[N],top[N],len[N],fa[N],lg[N<<1],bz[20][N];
int pool[N<<2],*up[N],*dw[N],*mem=pool;
LL d1[N],d2[N],u1[N],u2[N],pw1[N],pw2[N],ipw1[N],ipw2[N];
int ST[20][N<<1],dfn[N],tmr;
void dfs1(int u,int ft){
dep[u]=dep[ft]+1,bz[0][u]=fa[u]=ft,ST[0][dfn[u]=++tmr]=u;
for(int i=1;1<<i<dep[u];++i)bz[i][u]=bz[i-1][bz[i-1][u]];
u1[u]=(u1[ft]*base1+h[u])%mod1;
u2[u]=(u2[ft]*base2+h[u])%mod2;
d1[u]=(d1[ft]+pw1[dep[u]-1]*h[u])%mod1;
d2[u]=(d2[ft]+pw2[dep[u]-1]*h[u])%mod2;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u),ST[0][++tmr]=u;
if(len[v]>len[son[u]])son[u]=v;
}
len[u]=len[son[u]]+1;
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
if(top[u]==u){
up[u]=mem;
for(int i=0,j=u;i<=len[u]&&j;j=fa[j],++i)*mem++=j;
dw[u]=mem;
for(int j=u;j;j=son[j])*mem++=j;
}
}
inline int kthanc(int x,int k){
if(!k)return x;
int y=top[bz[lg[k]][x]];
if(dep[x]-dep[y]>=k)return dw[y][dep[x]-dep[y]-k];
else return up[y][k-dep[x]+dep[y]];
}
inline int LCA(int x,int y){
if(dfn[x]>dfn[y])x^=y^=x^=y;
int t=lg[dfn[y]-dfn[x]+1],t1=ST[t][dfn[x]],t2=ST[t][dfn[y]-(1<<t)+1];
return dep[t1]<dep[t2]?t1:t2;
}
inline LL calc1(LL*h,int v,int u){//u is anc of v
return (h[v]-h[fa[u]]*pw1[dep[v]-dep[fa[u]]]%mod1+mod1)%mod1;
}
inline LL calc2(LL*h,int v,int u){//u is anc of v
return (h[v]-h[fa[u]]*pw2[dep[v]-dep[fa[u]]]%mod2+mod2)%mod2;
}
inline LL calc3(LL*h,int v,int u){//u is anc of v
return (h[v]-h[u]+mod1)%mod1*ipw1[dep[u]]%mod1;
}
inline LL calc4(LL*h,int v,int u){//u is anc of v
return (h[v]-h[u]+mod2)%mod2*ipw2[dep[u]]%mod2;
}
signed main(){
scanf("%d%s",&n,str+1);
rep(i,1,n)h[i]=str[i]-'a'+1;
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
lg[0]=-1;rep(i,1,n<<1)lg[i]=lg[i>>1]+1;
pw1[0]=1;rep(i,1,n)pw1[i]=1ll*pw1[i-1]*base1%mod1;
pw2[0]=1;rep(i,1,n)pw2[i]=1ll*pw2[i-1]*base2%mod2;
ipw1[n]=qpow(pw1[n],mod1-2,mod1);per(i,n-1,0)ipw1[i]=1ll*ipw1[i+1]*base1%mod1;
ipw2[n]=qpow(pw2[n],mod2-2,mod2);per(i,n-1,0)ipw2[i]=1ll*ipw2[i+1]*base2%mod2;
dfs1(1,0),dfs2(1,1);
rep(i,1,lg[tmr])rep(j,1,tmr){
int x=ST[i-1][j],y=ST[i-1][j+(1<<(i-1))];
ST[i][j]=dep[x]<dep[y]?x:y;
}
// rep(i,1,n)cerr<<d1[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<d2[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<u1[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<u2[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<pw1[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<pw2[i]<<' ';cerr<<'\n';
for(m=read();m;--m){
int a=read(),b=read(),c=read(),d=read();
int lca1=LCA(a,b),lca2=LCA(c,d);
int dis1=dep[a]+dep[b]-2*dep[lca1],dis2=dep[c]+dep[d]-2*dep[lca2];
int l=0,r=min(dis1,dis2),res=-1;
while(l<=r){
int mid=(l+r)>>1;
LL H1=dep[a]-dep[lca1]>=mid?calc1(u1,a,kthanc(a,mid)):
(calc1(u1,a,lca1)+calc3(d1,kthanc(b,dis1-mid),lca1)*pw1[dep[a]-dep[lca1]+1])%mod1;
LL H2=dep[c]-dep[lca2]>=mid?calc1(u1,c,kthanc(c,mid)):
(calc1(u1,c,lca2)+calc3(d1,kthanc(d,dis2-mid),lca2)*pw1[dep[c]-dep[lca2]+1])%mod1;
LL H3=dep[a]-dep[lca1]>=mid?calc2(u2,a,kthanc(a,mid)):
(calc2(u2,a,lca1)+calc4(d2,kthanc(b,dis1-mid),lca1)*pw2[dep[a]-dep[lca1]+1])%mod2;
LL H4=dep[c]-dep[lca2]>=mid?calc2(u2,c,kthanc(c,mid)):
(calc2(u2,c,lca2)+calc4(d2,kthanc(d,dis2-mid),lca2)*pw2[dep[c]-dep[lca2]+1])%mod2;
// cerr<<mid<<":"<<H1<<' '<<H2<<' '<<H3<<' '<<H4<<'\n';
if(H1==H2&&H3==H4)l=mid+1,res=mid;
else r=mid-1;
}
printf("%d\n",++res);
}
}
/*
5
abcac
1 2
2 3
2 4
1 5
10
2 1 2 4
1 3 4 5
*/ ```
CF1239C Queue in the Train.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int long long
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,p,a[N],now,ans[N];
priority_queue<pair<int,int> >q;
queue<int>qu;
set<int>s;
signed main() {
n=rd(),p=rd();
for(rint i=1;i<=n;++i)q.push(make_pair(-rd(),-i));
for(rint i=1;i<=n;++i) {
if(qu.empty()&&s.empty())now=-q.top().first;
now+=p;
while(!q.empty()&&-q.top().first<=now) {
if(qu.empty()||-q.top().second<qu.back())qu.push(-q.top().second);
else s.insert(-q.top().second);
q.pop();
}
ans[qu.front()]=now,qu.pop();
if(qu.empty()&&!s.empty())qu.push(*s.begin()),s.erase(s.begin());
}
for(rint i=1;i<=n;++i)printf("%lld ",ans[i]);
return 0;
} ```
P4317 花神的数论题.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
const int mod=10000007;
LL n;
int num[51],tot;
int dp[51][51];
int dfs(int pos,int limit,int now) {
if(!pos)return max(now,1);
if(!limit&&~dp[pos][now])return dp[pos][now];
int up=limit?num[pos]:1,res=1;
for(int i=0;i<=up;++i)
res=1ll*res*dfs(pos-1,limit&&i==up,now+i)%mod;
if(!limit)dp[pos][now]=res;
return res;
}
int solve(LL x) {
while(x)num[++tot]=x&1ll,x>>=1ll;
return dfs(tot,1,0);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
memset(dp,-1,sizeof(dp));
cin>>n,cout<<solve(n)<<'\n';
return 0;
}```
线性基.cpp
```void insert(int x) {
for(int i=A;~i;--i)
if(x>>i&1) {
if(d[i])x^=d[i];
else return d[i]=x,void();
}
}```
CF897B Chtholly's request.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int k,p,pw[20],ans;
int rev(int x) {
int res=0;
while(x)res=res*10+x%10,x/=10;
return res;
}
signed main() {
k=rd(),p=rd();
pw[0]=1;for(rint i=1;i<=9;++i)pw[i]=pw[i-1]*10;
for(rint i=1,j=0;i<=k;++i) {
while(i>=pw[j])++j;
ans=(ans+pw[j]*i+rev(i))%p;
}
printf("%lld\n",ans);
return 0;
}```
CF893E Counting Arrays.cpp
```// Problem: E. Counting Arrays
// Contest: Codeforces - Educational Codeforces Round 33 (Rated for Div. 2)
// URL: https://codeforces.com/contest/893/problem/E
// Memory Limit: 256 MB
// Time Limit: 3000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2000005;
#define mod 1000000007
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,pri[N/10],pct,low[N],fac[N],pw2[N],ifc[N];
bool vis[N];
void init(const int&n=N-1){
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i,low[i]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1,low[i*pri[j]]=pri[j];
if(i%pri[j]==0)break;
}
}
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
pw2[0]=1;for(int i=1;i<=n;++i)pw2[i]=1ll*pw2[i-1]*2%mod;
}
int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
signed main(){
init();
for(int T=read();T;--T){
int x=read(),y=read(),res=1;
map<int,int>mp;
while(x>1)++mp[low[x]],x/=low[x];
for(auto j:mp)res=1ll*res*comb(y+j.se-1,y-1)%mod;
res=1ll*res*pw2[y-1]%mod;
printf("%d\n",res);
}
}```
P7326 [w33z-2018] Dream and Evaluation.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=110005;
int n,m,a[N],ans[N],top;
unsigned long long val[70],q[N],stk[N];
signed main(){
scanf("%d",&n);
rep(i,1,n){
char str[6];
scanf("%s",str+1);
if(str[1]=='!')a[i]=-1;
else if(str[1]=='&')a[i]=-2;
else if(str[1]=='|')a[i]=-3;
else if(str[1]=='^')a[i]=-4;
else rep(j,1,strlen(str+1))a[i]=a[i]*10+str[j]-'0';
}
scanf("%d",&m);
rep(i,1,m)scanf("%llu",&q[i]);
for(int i=1;i<=m;i+=64){
for(int j=0;j<64;++j)val[j]=0;
for(int j=0;j<64;++j)
for(int k=0;k<64;++k)
val[k]|=(1ull<<j)*(q[i+j]>>k&1);
top=0;
for(int j=1;j<=n;++j){
if(a[j]<0){
if(a[j]==-1)stk[top]^=-1ull;
else{
unsigned long long X=stk[top--];
if(a[j]==-2)stk[top]&=X;
else if(a[j]==-3)stk[top]|=X;
else stk[top]^=X;
}
}else stk[++top]=val[a[j]];
}
for(int j=0;j<64;++j)ans[i+j]=stk[1]>>j&1;
}
rep(i,1,m)putchar(ans[i]+'0');
return 0;
}```
FWT.cpp
```const int N=18;
const int mod=998244353;
int m,n,a[1<<N],b[1<<N],A[1<<N],B[1<<N];
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
void OR(int*a,int op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j)
fmod(a[i+j+k]+=a[i+j]*op);
}
void AND(int*a,int op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j)
fmod(a[i+j]+=a[i+j+k]*op);
}
void XOR(int*a,int op){
for(int o=2,k=1;k<n;o<<=1,k<<=1)
for(int i=0;i<n;i+=o)
for(int j=0;j<k;++j){
int x=a[i+j],y=a[i+j+k];
fmod(a[i+j]=x+y),fmod(a[i+j+k]=x-y),a[i+j]=1ll*a[i+j]*op%mod,a[i+j+k]=1ll*a[i+j+k]*op%mod;
}
}```
CF987C Three displays.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=3009;
const int inf=0x3f3f3f3f;
int n,s[N],c[N],dp[N][2],ans=1e15;
signed main() {
n=rd();
for(int i=1;i<=n;++i)s[i]=rd();
for(int i=1;i<=n;++i)c[i]=rd();
memset(dp,0x3f,sizeof(dp));
for(int i=1;i<=n;++i) {
for(int j=1;j<i;++j)if(s[j]<s[i])dp[i][0]=min(dp[i][0],c[j]);
}
for(int i=n;i>=1;--i) {
for(int j=n;j>i;--j)if(s[j]>s[i])dp[i][1]=min(dp[i][1],c[j]);
}
for(int i=1;i<=n;++i)if(dp[i][0]!=inf&&dp[i][1]!=inf)ans=min(ans,c[i]+dp[i][0]+dp[i][1]);
if(ans!=1e15)cout<<ans<<endl;
else cout<<-1<<endl;
return 0;
}```
CF1139A Even Substrings.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n;
char s[100009];
LL ans;
signed main() {
scanf("%d%s",&n,s+1);
for(int i=1;i<=strlen(s+1);++i) {
if((s[i]-'0')%2==0)ans+=i;
}
printf("%lld\n",ans);
return 0;
}```
P3317 [SDOI2014]重建.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=55;
const db eps=1e-7;
int n;
db a[N][N],ans=1;
db Gauss(const int&n){
db res=1;
rep(i,1,n){
int mx=i;
rep(j,i+1,n)if(fabs(a[mx][i])<fabs(a[j][i]))mx=j;
if(mx!=i){
res*=-1;
rep(j,i,n)swap(a[i][j],a[mx][j]);
}
if(fabs(a[i][i])<eps)return 0;
rep(j,i+1,n){
if(fabs(a[j][i])<eps)continue;
const db div=a[j][i]/a[i][i];
rep(k,i,n)a[j][k]-=div*a[i][k];
}
res*=a[i][i];
}
return res;
}
signed main(){
n=read();
rep(i,1,n)rep(j,1,n){
scanf("%lf",&a[i][j]);
ckmax(a[i][j],eps),ckmin(a[i][j],1.-eps);
if(i<j)ans*=1.-a[i][j];
a[i][j]=a[i][j]/(1.-a[i][j]);
}
rep(i,1,n){
a[i][i]=0;
rep(j,1,n)if(i!=j)a[i][i]+=a[i][j],a[i][j]*=-1.;
}
//cerr<<"ans="<<ans<<'\n';
//rep(i,1,n)rep(j,1,n)printf("%.5lf%c",a[i][j]," \n"[j==n]);
printf("%.8lf\n",ans*Gauss(n-1));
//rep(i,1,n)rep(j,1,n)printf("%.5lf%c",a[i][j]," \n"[j==n]);
return 0;
}```
AT2042 [AGC004B] Colorful Slimes.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=4005;
int n,x,a[N];
LL ans=1e18;
signed main(){
n=read(),x=read();
rep(i,1,n)a[i]=a[i+n]=read();
rep(i,0,n){
static int b[N],q[N],H,T;
memset(b,0x3f,sizeof(b));
LL res=1ll*x*i;
H=1,T=0;
for(int j=1;j<=n<<1;++j){
while(H<=T&&q[H]<j-i)++H;
while(H<=T&&a[q[T]]>=a[j])--T;
q[++T]=j;
ckmin(b[(j-1)%n+1],a[q[H]]);
}
rep(j,1,n)res+=b[j];
ckmin(ans,res);
}
printf("%lld\n",ans);
return 0;
}```
CF906D Power Tower.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=100010;
int a[N],m,l,r,n,q;
unordered_map<int,int>mp;
int phi(int x) {
int tmp=x;
if(mp.count(x))return mp[x];
int res=x;
for(int i=2; i*i<=x; ++i) {
if(x%i==0) {
res=res-res/i;
while(x%i==0)x/=i;
}
}
if(x>1)res=res-res/x;
return mp[tmp]=res;
}
int mod(int x,int m) {
return x>=m?x%m+m:x;
}
int qpow(int n,int k,int p) {
int base=n,res=1;
while(k) {
if(k&1)res=mod(res*base,p);
base=mod(base*base,p);
k>>=1;
}
return res;
}
int f(int l,int r,int m) {
if(l==r||m==1)return mod(a[r],m);
return qpow(a[l],f(l+1,r,phi(m)),m);
}
signed main() {
scanf("%lld%lld",&n,&m);
for(int i=1; i<=n; ++i)scanf("%lld",&a[i]);
scanf("%lld",&q);
while(q--) {
scanf("%lld%lld",&l,&r);
printf("%lld\n",f(l,r,m)%m);
}
return 0;
}```
CF1366F Jog Around The Graph.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define mod 1000000007
typedef std::pair<int,int> pii;
inline int upd(const int x){return x+(x>>31&mod);}
inline void reduce(int&x){x-=mod,x+=x>>31&mod;}
inline void add(int&x,const int y){x=upd((x+y)%mod);}
#define N 2005
const int inf=0x3f3f3f3f;
int n,m,T,mxv,ans,dis[N][N];
std::pair<int,int>li[N];
int et,hed[N];
struct edge{int nx,to,vl;}e[N<<1];
struct node{
int x,y,z;
node(int x_,int y_,int z_){x=x_,y=y_,z=z_;}
};
std::vector<node>E;
void adde(int u,int v,int d){e[++et].nx=hed[u],e[et].to=v,e[et].vl=d,hed[u]=et;}
void Dij(){
static bool vis[N][N];
memset(vis,0,sizeof(vis));
memset(dis,-1,sizeof(dis));
std::queue<std::pair<int,int> >q;
q.push(std::make_pair(1,dis[1][0]=0)),vis[1][0]=1;
while(!q.empty()){
std::pair<int,int>now=q.front();q.pop();
int u=now.first,t=now.second;
if(t==n)continue;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(dis[v][t+1]<dis[u][t]+e[i].vl){
dis[v][t+1]=dis[u][t]+e[i].vl;
if(!vis[v][t+1])q.push(std::make_pair(v,t+1)),vis[v][t+1]=1;
}
}
}
}
int calc(ll a1,ll d,ll n){
static const int iv2=(mod+1)>>1;
return 1ll*(a1+a1+(n-1)*d)%mod*n%mod*iv2%mod;
}
signed main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0),std::cout.tie(0);
std::cin>>n>>m>>T;
E.push_back(node(114,514,1919810));
rep(i,1,m){
int x,y,z;
std::cin>>x>>y>>z;
adde(x,y,z),adde(y,x,z),E.push_back(node(x,y,z)),mxv=std::max(mxv,z);
}
Dij();
rep(i,1,m)li[i].second=-2e9-5,li[i].first=E[i].z;
rep(i,1,std::min(n,T)){
rep(j,1,m){
int x=E[j].x,y=E[j].y,z=E[j].z;
if(~dis[x][i])li[j].second=std::max(dis[x][i]-i*z,li[j].second);
if(~dis[y][i])li[j].second=std::max(dis[y][i]-i*z,li[j].second);
}
ll res=0;
rep(j,1,m)res=std::max(res,1ll*li[j].first*i+li[j].second);
reduce(ans+=res%mod);
}
rep(i,1,m){
int L=n+1,R=T;
rep(j,1,m){
if(i==j)continue;
if(L>R)break;
if(li[i].first==li[j].first){
if(li[i].second<li[j].second){R=114514,L=1919810;break;}
else if(li[i].second==li[j].second&&i>j){R=114514,L=1919810;break;}
else continue;
}
if(li[i].first>li[j].first)L=std::max(L,(li[j].second-li[i].second)/(li[i].first-li[j].first)+1);
else R=std::min(R,(li[j].second-li[i].second)/(li[i].first-li[j].first));
}
if(L>R)continue;
reduce(ans+=calc(1ll*li[i].first*L%mod+li[i].second,li[i].first,R-L+1));
}
std::cout<<ans<<'\n';
return 0;
}```
CF939F Cutlet.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
#define K 105
#define inf 0x3f3f3f3f
int n, k, dp[2][N << 1], L[K], R[K];
int q[N << 1], H, T;
signed main() {
n = read(), k = read();
for (int i = 1; i <= k; ++ i) L[i] = read(), R[i] = read();
dp[0][0] = 0;
for (int i = 1; i <= n << 1; ++ i) dp[0][i] = inf;
for (int i = 1, u = 1; i <= k; ++ i, u ^= 1) {
for (int j = 0; j <= n; ++ j) dp[u][j] = dp[u ^ 1][j];
H = 1, T = 0;
for (int j = 0; j <= n; ++ j) {
while (H <= T && dp[u ^ 1][j] <= dp[u ^ 1][q[T]]) -- T;
q[++ T] = j;
while (H <= T && q[H] < j - (R[i] - L[i])) ++ H;
dp[u][j] = min(dp[u][j], dp[u ^ 1][q[H]] + 2);
}
H = 1, T = 0;
for (int j = R[i]; j >= 0; -- j) {
while (H <= T && dp[u ^ 1][R[i] - j] <= dp[u ^ 1][q[T]]) -- T;
q[++ T] = R[i] - j;
while (H <= T && q[H] < L[i] - j) ++ H;
dp[u][j] = min(dp[u][j], dp[u ^ 1][q[H]] + 1);
}
}
if (dp[k & 1][n] == inf) puts("Hungry");
else printf("Full\n%d\n",dp[k & 1][n]);
return 0;
}```
P3911 最小公倍数之和.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int n,q,ans,a[N];
int vis[N],pri[N/10],mu[N],cnt,f[N],num[N],g[N];
void init() {
for(int i=1;i<N;++i)
for(int j=1;i*j<N;++j)
g[i]+=num[i*j]*j;
mu[1]=1;
for(int i=2;i<N;++i) {
if(!vis[i])pri[++cnt]=i,mu[i]=-1;
for(int j=1;j<=cnt&&i*pri[j]<N;++j) {
vis[i*pri[j]]=1;
if(i%pri[j])mu[i*pri[j]]=-mu[i];
else break;
}
}
for(int i=1;i<N;++i)
for(int j=1;i*j<N;++j)
f[i*j]+=mu[i]*i;
for(int i=1;i<N;++i)
ans+=i*f[i]*g[i]*g[i];
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)++num[a[i]=rd()];
init();
printf("%lld\n",ans);
return 0;
}```
P1020 导弹拦截（单调栈二分）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n=1,a[N],st[N],top;
int main() {
while(scanf("%d",&a[n])!=EOF)++n;
--n;
for(rint i=1;i<=n;++i) {
if(!top||st[top]>=a[i])st[++top]=a[i];
else st[upper_bound(st+1,st+top+1,a[i],greater<int>())-st]=a[i];
}
printf("%d\n",top),top=0;
for(rint i=1;i<=n;++i) {
if(!top||st[top]<a[i])st[++top]=a[i];
else st[lower_bound(st+1,st+top+1,a[i])-st]=a[i];
}
printf("%d\n",top);
return 0;
}
```
CF825C Multi-judge Solving.cpp
```// Problem: C. Multi-judge Solving
// Contest: Codeforces - Educational Codeforces Round 25
// URL: https://codeforces.com/contest/825/problem/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int n,k,a[N],ans;
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read();
sort(a+1,a+n+1);
int now=k;
rep(i,1,n){
while(now<1+(a[i]-1)/2)now*=2,++ans;
ckmax(now,a[i]);
}
cout<<ans<<'\n';
}```
CF1355B Young Explorers.cpp
``` #include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
int T,n,a[N],bin[N],ans;
signed main() {
T=rd();
while(T--) {
n=rd(),ans=0;
for(rint i=1;i<=n;++i)a[i]=rd(),++bin[a[i]];
int tmp=0;
for(rint i=1;i<=n;++i) {
ans+=(bin[i]+tmp)/i;
tmp=(bin[i]+tmp)%i;
}
for(rint i=1;i<=n;++i)bin[i]=0;
printf("%d\n",ans);
}
return 0;
}```
CF546E Soldier and Traveling.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=305;
const int M=2005;
const int inf=0x3f3f3f3f;
int n,m,a[N],b[N],ans[N][N];
int dis[N],cur[N],mf,S,T,hed[N],et=1;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(fl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
n=read(),m=read(),S=n*3+1,T=S+1;
rep(i,1,n)a[i]=read(),adde(S,i,a[i]),adde(i,i+n,a[i]),adde(i+n,i+2*n,inf),a[0]+=a[i];
rep(i,1,n)b[i]=read(),adde(i+n*2,T,b[i]),b[0]+=b[i];
if(a[0]!=b[0])return puts("NO"),0;
rep(i,1,m){
int x=read(),y=read();
adde(x+n,y+2*n,inf),adde(y+n,x+2*n,inf);
}
while(bfs(S,T))mf+=dfs(S,inf);
if(mf!=b[0])return puts("NO"),0;
puts("YES");
for(int i=2;i<=et;++i){
if(e[i].to>2*n&&e[i].to<=3*n&&e[i^1].to>n&&e[i^1].to<=2*n){
ans[e[i^1].to-n][e[i].to-2*n]=e[i^1].fl;
}
}
rep(i,1,n)rep(j,1,n)printf("%d%c",ans[i][j]," \n"[j==n]);
return 0;
}
/*
4 4
1 2 6 3
3 5 3 1
1 2
2 3
3 4
4 2
*/```
CF754A Lesha and array splitting.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,a[1005],sum;
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd(),sum+=a[i];
if(sum) return printf("YES\n1\n1 %d\n",n),0;
for(int i=1;i<=n;++i)
if(a[i])return printf("YES\n2\n1 %d\n%d %d\n",i,i+1,n),0;
puts("NO");
}```
CF852D Exploration plan.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1205;
const int M=(N*N+N*2)*2;
const int inf=0x3f3f3f3f;
int n,m,c,lim,a[N],mp[N][N];
int dis[N],et=1,hed[N],S,T,mf,cur[N];
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int used=0,rl;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(fl-used,e[i].fl));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
bool check(int o){
memset(hed,0,sizeof(hed)),et=1,mf=0;
rep(i,1,n)if(a[i])adde(S,i,a[i]);
rep(i,1,n)adde(i+n,T,1);
rep(i,1,n)rep(j,1,n)if(mp[i][j]<=o)adde(i,j+n,inf);
while(bfs(S,T))mf+=dfs(S,inf);
return mf>=lim;
}
signed main(){
n=read(),m=read(),c=read(),lim=read(),S=n+n+1,T=S+1;
rep(i,1,c)++a[read()];
memset(mp,0x3f,sizeof(mp));
rep(i,1,n)mp[i][i]=0;
rep(i,1,m){
int x=read(),y=read(),z=read();
ckmin(mp[x][y],z),ckmin(mp[y][x],z);
}
rep(k,1,n)rep(i,1,n)rep(j,1,n)ckmin(mp[i][j],mp[i][k]+mp[k][j]);
int l=0,r=1731311,res=-1;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid))r=mid-1,res=mid;
else l=mid+1;
}
printf("%d\n",res);
return 0;
}
/*
6 7 5 4
5 5 2 2 5
1 3 3
1 5 2
1 6 5
2 5 4
2 6 7
3 4 11
3 5 3
*/```
P1004 [NOIP2000 提高组] 方格取数.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=10;
int dp[N*2][N][N],n,a[N<<1][N];
signed main() {
n=read();
while("fyyAKIOI"){
int x=read(),y=read(),z=read();
if(!x&&!y&&!z)break;
a[x][y]=z;
}
memset(dp,-1,sizeof(dp));
dp[2][1][1]=a[1][1];
for(int i=3;i<=2*n;++i){
for(int j=1;j<=n;++j){
for(int k=1;k<=n;++k){
if(j>i||k>i)continue;
int tmp=-1;
tmp=max(dp[i-1][j-1][k-1],max(dp[i-1][j-1][k],max(dp[i-1][j][k-1],dp[i-1][j][k])));
if(tmp!=-1){
if(j!=k)dp[i][j][k]=tmp+a[i-j][j]+a[i-k][k];
else dp[i][j][k]=tmp+a[i-j][j];
}
}
}
}
printf("%d\n",dp[2*n][n][n]);
return 0;
}```
P4526 【模板】自适应辛普森法2.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
double a;
double f(double x) {return pow(x,a/x-x);}
double simpson(double l,double r) {return (f(l)+4*f((l+r)/2)+f(r))*(r-l)/6;}
double work(double l,double r,double eps,double val) {
double mid=(l+r)/2,lv=simpson(l,mid),rv=simpson(mid,r);
if(abs(lv+rv-val)<15*eps)return lv+rv+(lv+rv-val)/15;
return work(l,mid,eps/2,lv)+work(mid,r,eps/2,rv);
}
signed main() {
double eps=1e-6;
scanf("%lf",&a);if(a<0)return puts("orz"),0;
printf("%.5lf\n",work(eps,15,eps,simpson(eps,15)));
return 0;
}
```
CF696C PLEASE.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)]
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int mod=1e9+7;
int n,a[N],sum=1;
int qpow(int n,int k) {
k=(k%(mod-1)+mod-1)%(mod-1);
int res=1;
while(k) {
if(k&1)res=1ll*res*n%mod;
n=1ll*n*n%mod,k>>=1;
}
return res;
}
const int inv3=qpow(3,mod-2);
int ans1,ans2;
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd(),sum=sum*(a[i]%(mod-1))%(mod-1);
ans1=(qpow(2,sum-1)+((sum&1)?-1:1))%mod*inv3%mod;
ans2=qpow(2,sum-1);
printf("%lld/%lld\n",ans1,ans2);
return 0;
}
//ans=\dfrac{2^{i-1}-(-1)^{i-1}}{3*2^{i-1}}```
P5354 [Ynoi2017]由乃的OJ.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline unsigned long long readull(){
unsigned long long x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=100005;
int n,m,k;
struct node{
unsigned long long a[2][2];
node(){a[0][0]=a[1][0]=0,a[0][1]=a[1][1]=-1;}
void init(int opt,unsigned long long x){
if(opt==1)a[0][0]=0,a[0][1]=x,a[1][0]=0,a[1][1]=x;
else if(opt==2)a[0][0]=x,a[0][1]=-1,a[1][0]=x,a[1][1]=-1;
else if(opt==3)a[0][0]=x,a[0][1]=(-1)^x,a[1][0]=x,a[1][1]=(-1)^x;
}
friend node operator + (const node&a,const node&b){
node res;
res.a[0][0]=(a.a[0][0]&b.a[0][1])|((~a.a[0][0])&b.a[0][0]);
res.a[0][1]=(a.a[0][1]&b.a[0][1])|((~a.a[0][1])&b.a[0][0]);
res.a[1][0]=(b.a[1][0]&a.a[1][1])|((~b.a[1][0])&a.a[1][0]);
res.a[1][1]=(b.a[1][1]&a.a[1][1])|((~b.a[1][1])&a.a[1][0]);
return res;
}
node inv(){
node res=*this;
swap(res.a[0][0],res.a[1][0]),swap(res.a[0][1],res.a[1][1]);
return res;
}
}a[N],val[N<<2];
int top[N],fa[N],rev[N],dfn[N],son[N],siz[N],dep[N],tmr;
int et,hed[N];
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u),fa[v]=u,siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
rev[dfn[u]=++tmr]=u,top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=val[lc]+val[rc];}
void build(int l=1,int r=n,int p=1){
if(l==r)return val[p]=a[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
node query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1;
if(qr<=mid)return query(ql,qr,l,mid,lc);
if(mid<ql)return query(ql,qr,mid+1,r,rc);
return query(ql,qr,l,mid,lc)+query(ql,qr,mid+1,r,rc);
}
void change(int pos,int l=1,int r=n,int p=1){
if(l==r)return val[p]=a[rev[l]],void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,l,mid,lc);
else change(pos,mid+1,r,rc);
pushup(p);
}
node ask(int x,int y){
node res1,res2;
while(top[x]!=top[y]){
if(dep[top[x]]>dep[top[y]])res1=res1+query(dfn[top[x]],dfn[x]).inv(),x=fa[top[x]];
else res2=query(dfn[top[y]],dfn[y])+res2,y=fa[top[y]];
}
if(dfn[x]<dfn[y])res2=query(dfn[x],dfn[y])+res2;
else res1=res1+query(dfn[y],dfn[x]).inv();
return res1+res2;
}
signed main(){
n=read(),m=read(),k=read();
rep(i,1,n){
int opt=read();unsigned long long x=readull();
a[i].init(opt,x);
}
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dfs1(1,0),dfs2(1,1),build();
while(m--){
int opt=read(),x=read(),y=read();
unsigned long long z=readull(),res=0;
if(opt==1){
node p=ask(x,y);
// cerr<<"p:"<<p.a[0][0]<<' '<<p.a[0][1]<<'\n';
per(i,k-1,0){
unsigned long long tmp=1ull<<i;
if(p.a[0][0]&tmp)res|=tmp;
else if(p.a[0][1]&tmp&&z>=tmp)res|=tmp,z-=tmp;
}
printf("%llu\n",res);
}else a[x].init(y,z),change(dfn[x]);
}
return 0;
}```
P4245 【模板】任意模数多项式乘法（预处理单位根7次FFT）.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=N<<2;
int n,m,f[M],g[M],mod;
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
namespace poly{
const db pi=acos(-1.0);
int rev[M],lg,lim;
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
}w[M];
void init_poly(const int&n){
for(lim=1,lg=0;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1)),w[i]=cp(cos(2.*pi*i/lim),sin(2.*pi*i/lim));
}
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1,t=lim>>1;i<lim;i<<=1,t>>=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const cp X=a[j+k],Y=w[t*k]*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(!op)for(int i=0;i<lim;++i)a[i].x/=lim;
}
void MTT(int*f,int*g,int*ans){
static cp A[M],B[M],C[M],D[M],E[M],F[M],G[M];
for(int i=0;i<lim;++i)
A[i]=cp(f[i]&65535,0),B[i]=cp(f[i]>>16,0),
C[i]=cp(g[i]&65535,0),D[i]=cp(g[i]>>16,0);
FFT(A,1),FFT(B,1),FFT(C,1),FFT(D,1);
for(int i=0;i<lim;++i)
E[i]=A[i]*C[i],F[i]=A[i]*D[i]+B[i]*C[i],G[i]=B[i]*D[i],w[i].y*=-1;
FFT(E,0),FFT(F,0),FFT(G,0);
for(int i=0;i<lim;++i)
ans[i]=LL(G[i].x+0.5)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(F[i].x+0.5)%mod)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(E[i].x+0.5)%mod)%mod,
w[i].y*=-1;
}
}
signed main(){
n=read(),m=read(),mod=read();
rep(i,0,n)f[i]=read()%mod;
rep(i,0,m)g[i]=read()%mod;
poly::init_poly(n+m),poly::MTT(f,g,f);
rep(i,0,n+m)printf("%d ",f[i]);
return 0;
}```
P4921 [MtOI2018]情侣？给我烧了！.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 2005
#define mod 998244353
int n,f[N],g[N],fac[N],ifc[N],pw2[N];
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void init(){
int up=2000;
fac[0]=1,pw2[0]=1;
for(int i=1;i<=up;++i)fac[i]=1ll*fac[i-1]*i%mod,pw2[i]=(pw2[i-1]<<1)%mod;
ifc[up]=qpow(fac[up],mod-2);
for(int i=up-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
up=1000;
for(int i=0;i<=up;++i){
for(int j=0;j<=i;++j)
f[i]=(f[i]+1ll*(j&1?-1:1)*pw2[j]*ifc[j]%mod*fac[2*i-2*j]%mod*ifc[i-j]%mod*ifc[i-j]%mod+mod)%mod;
}
}
int A(int n,int m){return 1ll*fac[n]*ifc[n-m]%mod;}
int C(int n,int m){return 1ll*fac[n]*ifc[n-m]%mod*ifc[m]%mod;}
signed main(){
init();
for(int T=read();T;--T){
n=read();
for(int i=0;i<=n;++i)printf("%lld\n",1ll*pw2[i]*fac[n]%mod*fac[n]%mod*ifc[i]%mod*f[n-i]%mod);
}
}
```
CF1366E Two Arrays.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define mod 998244353
typedef std::pair<int,int> pii;
inline int upd(const int x){return x+(x>>31&mod);}
inline void reduce(int&x){x-=mod,x+=x>>31&mod;}
inline void add(int&x,const int y){x=upd((x+y)%mod);}
#define N 200005
int n,m,a[N],b[N],ans,lst[N];
std::map<int,int>mp;
int main(){
std::ios::sync_with_stdio(0);
std::cin.tie(0),std::cout.tie(0);
std::cin>>n>>m;
rep(i,1,n) std::cin>>a[i];
rep(i,1,m) std::cin>>b[i],mp[b[i]]=i;
rep(i,1,n) if(mp[a[i]])lst[mp[a[i]]]=i;
ans=1;
rep(i,1,m){
int j=lst[i];
for(;j>=lst[i-1];--j) if(a[j]<a[lst[i]])break;
if(i==1)ans*=!j;
else {
ans=1ll*ans*(lst[i]-j)%mod;
rep(j,lst[i-1],lst[i]) if(a[j]<a[lst[i-1]])return std::cout<<"0\n",0;
}
}
rep(i,lst[m],n)if(a[i]<a[lst[m]])return std::cout<<"0\n",0;
std::cout<<ans<<'\n';
}```
CF893A Chess For Three.cpp
```// Problem: A. Chess For Three
// Contest: Codeforces - Educational Codeforces Round 33 (Rated for Div. 2)
// URL: https://codeforces.com/contest/893/problem/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,a[4];
signed main(){
n=read();
a[0]=a[1]=1;
rep(t,1,n){
int x=read()-1,y;
if(!a[x])return puts("NO"),0;
if(0!=x&&a[0])a[0]=0,y=0;
else if(1!=x&&a[1])a[1]=0,y=1;
else a[2]=0,y=2;
if(x!=0&&y!=0)a[0]=1;
else if(x!=1&&y!=1)a[1]=1;
else if(x!=2&&y!=2)a[2]=1;
}
puts("YES");
}```
CF1355E Restorer Distance.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,a,b,c,hi;
int h[N];
int check(int x) {
int sum1=0,sum2=0;
for(rint i=1;i<=n;++i)
if(x>h[i])sum1+=x-h[i];
else sum2+=h[i]-x;
int tmp=min(sum1,sum2);
return tmp*c+(sum1-tmp)*a+(sum2-tmp)*b;
}
signed main() {
n=rd(),a=rd(),b=rd(),c=rd(),c=min(a+b,c);
for(rint i=1;i<=n;++i)h[i]=rd(),hi=max(hi,h[i]);
int l=0,r=hi;
while(l<r) {
int mid=(l+r)>>1;
if(check(mid)>check(mid+1))l=mid+1;
else r=mid;
}
printf("%lld\n",check(l));
return 0;
}```
P7112 【模板】行列式求值.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=605;
int n,mod,a[N][N];
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int Gauss(){
int res=1;
rep(i,1,n){
rep(j,i+1,n){
while(a[j][i]){
int div=a[i][i]/a[j][i];
rep(k,i,n)fmod(a[i][k]-=1ll*div*a[j][k]%mod),swap(a[i][k],a[j][k]);
res*=-1;
}
}
if(!a[i][i])return 0;
res=1ll*res*a[i][i]%mod;
}
return fmod(res),res;
}
signed main(){
n=read(),mod=read();
rep(i,1,n)rep(j,1,n)a[i][j]=read();
printf("%d\n",Gauss());
return 0;
}```
P3389 【模板】高斯消元法.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=110;
const double eps=1e-7;
int n;
double a[N][N],ans[N];
signed main() {
n=rd();
for(rint i=1;i<=n;++i)
for(rint j=1;j<=n+1;++j)
scanf("%lf",&a[i][j]);
for(rint i=1;i<=n;++i) {
int mx=i;
for(rint j=i;j<=n;++j)
if(fabs(a[mx][i])<fabs(a[j][i]))mx=j;
for(rint j=1;j<=n+1;++j)swap(a[mx][j],a[i][j]);
if(fabs(a[i][i])<eps)return puts("No Solution"),0;
for(rint j=1;j<=n;++j) {
if(i==j)continue;
double div=a[j][i]/a[i][i];
for(rint k=i+1;k<=n+1;++k) {
a[j][k]-=div*a[i][k];
}
}
}
for(rint i=1;i<=n;++i)ans[i]=a[i][n+1]/a[i][i];
for(rint i=1;i<=n;++i)printf("%.2lf\n",ans[i]);
return 0;
}
```
CF427C Checkposts.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int M=300010;
const int mod=1000000007;
const int inf=1000000009;
struct edge{
int nxt,to;
}e[M];
int head[N],num_edge,w[N];
int n,m,st[N],top,mi[N],sum[N],C,dfstim,low[N],dfn[N],scc[N];
LL ans1,ans2=1;
void addegde(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
void tarjan(int u) {
low[u]=dfn[u]=++dfstim;
st[++top]=u;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]) {
++C,scc[u]=C;
mi[C]=w[u],sum[C]=1;
while(st[top]!=u) {
scc[st[top]]=C;
if(w[st[top]]==mi[C])++sum[C];
else if(w[st[top]]<mi[C])mi[C]=w[st[top]],sum[C]=1;
--top;
}
--top;
}
}
signed main() {
n=rd();for(rint i=1;i<=n;++i)w[i]=rd();
m=rd();for(rint i=1,x,y;i<=m;++i)x=rd(),y=rd(),addegde(x,y);
for(rint i=1;i<=n;++i)if(!dfn[i])tarjan(i);
for(rint i=1;i<=C;++i)ans1+=mi[i],ans2=1ll*ans2*sum[i]%mod;
printf("%lld %lld\n",ans1,ans2);return 0;
}```
CF220B Little Elephant and Array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int n,m,a[N],num[N],lst[N],tr[N],nxt[N],ans[N],pre[N];
struct QUE{int l,r,id;}q[N];
inline bool cmp(const QUE&a,const QUE&b){return a.r!=b.r?a.r<b.r:a.l<b.l;}
void add(int x,int d){if(!x)return;for(int i=x;i<=n;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
signed main(){
n=read(),m=read();
rep(i,1,n){
a[i]=read();
if(a[i]>n)a[i]=0;
}
rep(i,1,m)q[i].l=read(),q[i].r=read(),q[i].id=i;
sort(q+1,q+m+1,cmp);
rep(i,1,n)lst[i]=n+1;
per(i,n,1)nxt[i]=lst[a[i]],lst[a[i]]=i;
rep(i,1,n)lst[i]=0;
rep(i,1,n)pre[i]=lst[a[i]],lst[a[i]]=i;
memset(lst,0,sizeof(lst));
int it=1;
rep(i,1,m){
for(;it<=q[i].r;++it){
if(!a[it])continue;
if(!lst[a[it]])lst[a[it]]=it;
++num[a[it]];
if(num[a[it]]>=a[it]){
add(lst[a[it]],1);
add(pre[lst[a[it]]],-2);
add(pre[pre[lst[a[it]]]],1);
// cerr<<lst[a[it]]<<' '<<pre[lst[a[it]]]<<' '<<pre[pre[lst[a[it]]]]<<'\n';
lst[a[it]]=nxt[lst[a[it]]];
}
// cerr<<"it="<<it<<'\n';
// cerr<<"num:";rep(j,1,5)cerr<<num[j]<<' ';cerr<<'\n';
// cerr<<"lst:";rep(j,1,5)cerr<<lst[j]<<' ';cerr<<'\n';
// cerr<<"tr:";rep(j,1,n)cerr<<ask(j)-ask(j-1)<<' ';cerr<<'\n';
}
ans[q[i].id]=ask(q[i].r)-ask(q[i].l-1);
// cerr<<"calc:"<<q[i].id<<' '<<ans[q[i].id]<<'\n';
}
rep(i,1,m)printf("%d\n",ans[i]);
return 0;
}```
P1019 单词接龙.cpp
```#include<bits/stdc++.h>
using namespace std;
string st[25];
int orz[25][25];
int vis[25];
int ans=-1,mx=0,n;
char ch;
int dalao(int x,int y)
{
bool f=true;
int ky=0;
for(int k=st[x].length()-1;k>=1;k--)
{
for(int j=k;j<st[x].length();j++)
{
if(st[x][j]!=st[y][ky++])
{
f=false;break;
}
}
if(f)
{
return st[x].length()-k;
}
else
{
f=true;
ky=0;
}
}
return 0;
}
void dfs(int x)
{
bool flag=false;
for(int i=1;i<=n;i++)
{
if(orz[x][i]==0)continue;
if(vis[i]==2)continue;
if(orz[x][i]==st[x].length()||orz[x][i]==st[i].length())continue;
vis[i]++;
mx+=st[i].length()-orz[x][i];
flag=true;
dfs(i);
vis[i]--;
mx-=st[i].length()-orz[x][i];
}
if(!flag)ans=max(mx,ans);
return;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
cin>>st[i];
cin>>ch;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
orz[i][j]=dalao(i,j);
for(int i=1;i<=n;i++)
{
if(st[i][0]==ch)
{
vis[i]++;
mx=st[i].length();
dfs(i);
vis[i]--;
}
}
cout<<ans<<endl;
return 0;
}
```
P6279 [USACO20OPEN]Favorite Colors G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {
if(ch=='-')f=-1;
ch=getchar();
}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200009;
vector<int>v[N],g[N];
queue<int>q;
int n,m,F[N],col[N],cnt;
int find(int x) {
return x==F[x]?x:F[x]=find(F[x]);
}
int merge(int x,int y) {
x=find(x),y=find(y);
if(v[x].size()>v[y].size())x^=y^=x^=y;
for(int i:v[x])v[y].pb(i),F[i]=y;
for(int i:g[x])g[y].pb(i);
return y;
}
void bfs() {
while(!q.empty()) {
int u=q.front(),rt;q.pop();
if(g[u].size()<2)continue;
vector<int>fyyAKIOI,t=g[u];
g[u].swap(fyyAKIOI);
rt=find(t[0]);
for(uint i=1;i<t.size();++i)
if(find(rt)!=find(t[i]))rt=merge(rt,t[i]);
g[u].pb(rt),q.push(rt);
}
}
signed main() {
n=rd(),m=rd();
for(int i=1; i<=m; ++i) {
int x=rd(),y=rd();
g[x].pb(y);
}
for(int i=1; i<=n; ++i)F[i]=i,v[i].pb(i),q.push(i);
bfs();
for(int i=1; i<=n; ++i) {
if(col[i])continue;
int fx=find(i);++cnt;
for(int j:v[fx])col[j]=cnt;
}
for(int i=1; i<=n; ++i)printf("%d\n",col[i]);
return 0;
}
```
CF1293A ConneR and the A.R.C. Markland-N.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1010;
const int inf=2000000000;
int n,s,T,k,a[N],ans;
signed main() {
T=rd();
while(T--) {
n=rd(),s=rd(),k=rd();ans=inf;
map<int,bool>mp;
for(rint i=1;i<=k;++i)mp[rd()]=1;
if(!mp[s]) {puts("0");continue;}
for(rint i=s+1;i<=n;++i)if(!mp[i]){ans=min(ans,i-s);break;}
for(rint i=s-1;i>=1;--i)if(!mp[i]){ans=min(ans,s-i);break;}
printf("%d\n",ans);
}
return 0;
}
```
CF739B Alyona and a tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
const int inf=1000000007;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
LL dist[N];
int n,a[N],dif[N],fa[19][N],ans[N];
vector<pair<int,int> >g[N];
void dfs(int u) {
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i].first;
dist[v]=dist[u]+g[u][i].second;
dfs(v);
}
}
void solve(int u) {
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i].first;
solve(v);
}
int w=u;
for(rint j=18;j>=0;--j)
if(fa[j][w]&&dist[u]-dist[fa[j][w]]<=a[u])w=fa[j][w];
--dif[fa[0][w]],++dif[fa[0][u]];
}
void calc(int u) {
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i].first;
calc(v);
dif[u]+=dif[v];
}
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=2,x,y;i<=n;++i) {
x=rd(),y=rd();
fa[0][i]=x;
g[x].push_back(make_pair(i,y));
}
g[0].push_back(make_pair(1,0));
for(rint i=1;i<=18;++i)
for(rint j=1;j<=n;++j)
fa[i][j]=fa[i-1][fa[i-1][j]];
dfs(1);solve(1);calc(1);
for(rint i=1;i<=n;++i)printf("%d%c",dif[i]," \n"[i==n]);
return 0;
}```
P3223 [HNOI2012]排队.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
const int base=1000000000;
const int limit=9;
struct bint {
LL a[100000];
bint(int x=0){a[a[0]=1]=x;}
void rprint(LL x,int len){
int d[20];d[0]=0;
while(x)d[++d[0]]=x%10,x/=10;
for(int i=d[0]+1;i<=len;++i)d[++d[0]]=0;
for(int i=d[0];i;--i)putchar('0'+d[i]);
}
void print(char text=-1){
for(int i=a[0];i;--i)rprint(a[i],i<a[0]?limit:1);
if(~text)putchar(text);
}
}A,B;
bint operator * (const bint&a,const int&b){
bint res=a;
for(int i=1;i<=res.a[0];++i)res.a[i]*=b;
for(int i=1;i<=res.a[0];++i)if(res.a[i]>=base)res.a[i+1]+=res.a[i]/base,res.a[i]%=base;
while(res.a[res.a[0]+1]){
++res.a[0];
if(res.a[res.a[0]]>=base)res.a[res.a[0]+1]+=res.a[res.a[0]]/base,res.a[res.a[0]]%=base;
}
return res;
}
bint operator - (const bint&a,const bint&b){
bint res=a;
for(int i=1;i<=res.a[0];++i){
res.a[i]-=b.a[i];
if(res.a[i]<0)res.a[i]+=base,--res.a[i+1];
}
while(res.a[0]>1&&!res.a[res.a[0]])--res.a[0];
return res;
}
signed main(){
int n=read(),m=read();
if(n+4-m<=0)return puts("0"),0;
A=1,B=2;
for(int i=n+4-m;i<=n+3;++i)A=A*i;
for(int i=1;i<=n+2;++i)A=A*i;
for(int i=n+3-m;i<=n+2;++i)B=B*i;
for(int i=1;i<=n+1;++i)B=B*i;
(A-B).print('\n');
}
/*
20 10
4426611674116398910034411520000000
5 2
221760
*/```
P3372 【模板】线段树 1.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
int n,m,a[N];
LL val[N<<2],tag[N<<2];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {val[p]=val[lc]+val[rc];}
void build(int l,int r,int p) {
if(l==r)return val[p]=a[l],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void pushdown(int p,int l,int r) {
if(tag[p]) {
int mid=(l+r)>>1;
tag[lc]+=tag[p],val[lc]+=tag[p]*(mid-l+1);
tag[rc]+=tag[p],val[rc]+=tag[p]*(r-mid);
tag[p]=0;
}
}
void update(int ql,int qr,int l,int r,int k,int p) {
if(ql<=l&&r<=qr)return tag[p]+=k,val[p]+=k*(r-l+1),void();
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,k,lc);
if(qr>mid)update(ql,qr,mid+1,r,k,rc);
pushup(p);
}
LL query(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1;LL res=0;
pushdown(p,l,r);
if(ql<=mid)res+=query(ql,qr,l,mid,lc);
if(qr>mid)res+=query(ql,qr,mid+1,r,rc);
return res;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd();
build(1,n,1);
while(m--) {
int opt=rd(),x=rd(),y=rd(),z;
if(opt==1)z=rd(),update(x,y,1,n,z,1);
else if(opt==2)printf("%lld\n",query(x,y,1,n,1));
}
return 0;
}```
CF1469D Ceil Divisions.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,a[N],tot,b[N],c[N];
vector<pair<int,int> >ans;
void Main(){
n=read(),tot=0;
ans.clear();
fill(b+1,b+n+1,0);
int x=n;
a[++tot]=n,c[tot]=n,b[n]=1;
while(1){
x=ceil(sqrt(x));
a[++tot]=x,c[tot]=x,b[x]=1;
if(x==2)break;
}
for(int i=2;i<n;++i)if(!b[i])ans.pb(mkp(i,n));
for(int i=2;i<=tot;++i){
while(a[i-1]>1)ans.pb(mkp(c[i-1],c[i])),a[i-1]=ceil(1.*a[i-1]/a[i]);
}
printf("%d\n",sz(ans));
for(int i=0;i<sz(ans);++i)printf("%d %d\n",ans[i].fi,ans[i].se);
}
signed main(){for(int T=read();T;--T)Main();}```
P5665 划分.cpp
```#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=4e7+10;
const int M=1e5+10;
const int mod=(1<<30)-1;
int a[N],n,q[N],H,T,typ,pre[N];
int p[M],l[M],r[M],b[N];
LL sum[N];
const int base=1000000000;
const int limit=9;
int power_10[13]={1,10,100,1000,1000,10000,100000,1000000,10000000,100000000,1000000000};
struct num {
LL a[12];
num(){memset(a,0,sizeof(a));}
void init(LL x) {
a[0]=0;
while(x)a[++a[0]]=x%base,x/=base;
}
void print(char c=-1) {
printf("%lld",a[a[0]]);
for(rint i=a[0]-1;i>0;--i)printf("%0*lld",limit,a[i]);
if(~c)putchar(c);
}
}ans;
num operator + (const num &a,const num &b) {
num c;int mx=max(a.a[0],b.a[0]);c.a[0]=mx;
for(rint i=1;i<=mx;++i)c.a[i]=a.a[i]+b.a[i];
for(rint i=1;i<=mx;++i)if(c.a[i]>=base)++c.a[i+1],c.a[i]-=base;
if(c.a[c.a[0]+1])++c.a[0];
return c;
}
num operator * (const num &a,const num &b) {
num c;int mx=a.a[0]+b.a[0]-1;c.a[0]=mx;
for(rint i=1,mxa=a.a[0];i<=mxa;++i)
for(rint j=1,mxb=b.a[0];j<=mxb;++j) {
c.a[i+j-1]+=a.a[i]*b.a[j];
if(c.a[i+j-1]>=base)c.a[i+j]+=c.a[i+j-1]/base,c.a[i+j-1]%=base;
}
if(c.a[c.a[0]+1])++c.a[0];
return c;
}
#define val(i) ((sum[i]<<1)-sum[pre[i]])
signed main() {
// freopen("ac.in","r",stdin);
n=rd(),typ=rd();
if(!typ)for(rint i=1;i<=n;++i)a[i]=rd();
else {
int x=rd(),y=rd(),z=rd();b[1]=rd(),b[2]=rd();int m=rd();
for(rint i=1;i<=m;++i)p[i]=rd(),l[i]=rd(),r[i]=rd();
for(rint i=3;i<=n;++i)b[i]=((((1ll*x*b[i-1]&mod)+(1ll*y*b[i-2]&mod))&mod)+(z&mod))&mod;
for(rint i=1;i<=m;++i) {
for(rint j=p[i-1]+1;j<=p[i];++j)
a[j]=b[j]%(r[i]-l[i]+1)+l[i];
}
}
for(rint i=1;i<=n;++i)sum[i]=sum[i-1]+a[i];
for(rint i=1;i<=n;++i) {
while(H<T&&val(q[H+1])<=sum[i])++H;
pre[i]=q[H];
while(H<=T&&val(i)<=val(q[T]))--T;
q[++T]=i;
}
num tmp;
for(rint i=n;i;i=pre[i]) {
tmp.init(sum[i]-sum[pre[i]]);
ans=ans+(tmp*tmp);
}
ans.print('\n');
return 0;
}
```
CF997C Sky Full of Stars.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=1000005;
namespace math{
int fac[N],ifc[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
}
}
using math::qpow;
using math::fmod;
int n,ans;
int f(int x,int y){
return 1ll*qpow(3,1ll*(n-x)*(n-y)%(mod-1))*((!x||!y)?qpow(3,x+y):3)%mod;
}
signed main(){
math::initmath();
n=read();
for(int i=1;i<=n;++i){
const int t=qpow(3,n-i);
int res=3ll*(qpow(t-1,n)-qpow(t,n)+mod)%mod;
fmod(res+=1ll*qpow(t,n)*qpow(3,i)%mod);
fmod(ans+=1ll*math::comb(n,i)*(i&1?mod-res:res)%mod);
}
for(int i=0;i<=n;++i)fmod(ans+=1ll*math::comb(n,i)*(i&1?mod-f(0,i):f(0,i))%mod);
fmod(ans=qpow(3,1ll*n*n%(mod-1))-ans+mod);
cout<<ans<<'\n';
}```
P6097 【模板】子集卷积.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=20;
const int mod=1e9+9;
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int n,m,a[N+1][1<<N],b[N+1][1<<N],c[N+1][1<<N],cnt[1<<N];
void fwt(int*a,int n,int op){
for(int i=1;i<n;i<<=1)
for(int j=0;j<n;j+=i<<1)
for(int k=0;k<i;++k)
fmod(a[i+j+k]+=a[j+k]*op);
}
signed main(){
m=1<<(n=read());
for(int i=0;i<m;++i)cnt[i]=cnt[i>>1]+(i&1);
for(int i=0;i<m;++i)a[cnt[i]][i]=read();
for(int i=0;i<m;++i)b[cnt[i]][i]=read();
for(int i=0;i<=n;++i)fwt(a[i],m,1),fwt(b[i],m,1);
for(int i=0;i<=n;++i)
for(int j=0;j<=i;++j)
for(int k=0;k<m;++k)
fmod(c[i][k]+=1ll*a[j][k]*b[i-j][k]%mod);
for(int i=0;i<=n;++i)fwt(c[i],m,-1);
for(int i=0;i<m;++i)printf("%d ",c[cnt[i]][i]);
return 0;
}```
P5313 [Ynoi2011]WBLT.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
template<int M>struct Bitset{
typedef unsigned long long ull;
static const ull ULL_MAX=-1,N=(M-1)/64+1;
ull a[N],suf[65],pre[65];
unordered_map<ull,int>mp;
Bitset(){
rep(i,0,63)mp[1ull<<i]=i;
pre[0]=0;rep(i,1,64)pre[i]=pre[i-1]<<1|1;
suf[64]=ULL_MAX;per(i,63,0)suf[i]=suf[i+1]<<1;
memset(a,0,sizeof(a));
}
void reset(){memset(a,0,sizeof(a));}
void set(int x){a[x>>6]|=1ull<<(x&63);}
void flip(int x){a[x>>6]^=1ull<<(x&63);}
void set(int x,int v){if((a[x>>6]>>(x&63))!=v)a[x>>6]^=1ull<<(x&63);}
int mex(int V=M){
V=(V-1)/64+1;
for(int i=0;i<V;++i)if(a[i]^ULL_MAX){
const ull tmp=~a[i];
return mp[tmp&-tmp]+(i<<6);
}
return M;
}
ull get(int l,int r){
if(l>r)return 0;
int bl=l>>6,br=r>>6;
if(bl==br)return (a[br]&(pre[(r&63)+1]^pre[l&63]))>>(l&63);
else return ((a[bl]&suf[(br<<6)-l])>>(l-(bl<<6)))|((a[br]&pre[r+1-(br<<6)])<<((br<<6)-l));
}
void print(ull x){
int d[65];d[0]=0;
while(x)d[++d[0]]=x&1,x>>=1;
rep(i,1,d[0])putchar('0'+d[i]);
rep(i,d[0]+1,64)putchar('0');
}
void out(int V=M){
int i=0,j=0;
while(i<V)print(a[j]),i+=64,++j;
puts("");
}
int query(int b,int V=M){
static ull p[N];int flg;
int c1=b&63,c2=b>>6,it=0,res=0;
rep(i,0,c2)p[i]=ULL_MAX;
for(flg=1;;){
flg=0;
p[0]&=get(it,min(V,it+c1-1)),it+=c1,flg|=p[0]>0;
if(it>V)return res+flg;
rep(i,1,c2){
p[i]&=get(it,min(V,it+63)),it+=64,flg|=p[i]>0;
if(it>V)return res+flg;
}
if(!flg)return res;
++res;
}
}
};
const int N=100005;
Bitset<N>Bs,bs[64];
int n,a[N],m,ans[N],S,qm,cnt[N],V;
struct preque{
int l,r,b,id;
inline bool operator < (const preque&t)const{return b<t.b;}
}prq[N];
struct que{
int l,r,b,id;
inline bool operator < (const que&t)const{return l/S!=t.l/S?l<t.l:(l/S)&1?r<t.r:r>t.r;}
}q[N];
void add1(int x,int b){
int v=a[x]/b,t=a[x]-v*b;
if(!cnt[a[x]]++)bs[t].flip(v);
}
void pop1(int x,int b){
int v=a[x]/b,t=a[x]-v*b;
if(!--cnt[a[x]])bs[t].flip(v);
}
int query1(int b){
int res=0;
rep(i,0,b-1)ckmax(res,bs[i].mex(V));
return res;
}
void solve1(int ll,int rr,int b){
if(ll>rr)return;
qm=0;
rep(i,ll,rr)q[++qm].l=prq[i].l,q[qm].r=prq[i].r,q[qm].b=prq[i].b,q[qm].id=prq[i].id;
S=n/sqrt(qm)+1,sort(q+1,q+qm+1);
int l=1,r=0;
for(int i=1;i<=qm;++i){
while(l>q[i].l)add1(--l,b);
while(r<q[i].r)add1(++r,b);
while(l<q[i].l)pop1(l++,b);
while(r>q[i].r)pop1(r--,b);
ans[q[i].id]=query1(b);
}
while(l<=r)pop1(l++,b);
}
void add2(int x){if(!cnt[a[x]]++)Bs.flip(a[x]);}
void pop2(int x){if(!--cnt[a[x]])Bs.flip(a[x]);}
void solve2(int ll,int rr){
if(ll>rr)return;
qm=0;
rep(i,ll,rr)q[++qm].l=prq[i].l,q[qm].r=prq[i].r,q[qm].b=prq[i].b,q[qm].id=prq[i].id;
S=n/sqrt(qm)+1,sort(q+1,q+qm+1);
for(int i=1,l=1,r=0;i<=qm;++i){
while(l>q[i].l)add2(--l);
while(r<q[i].r)add2(++r);
while(l<q[i].l)pop2(l++);
while(r>q[i].r)pop2(r--);
ans[q[i].id]=Bs.query(q[i].b,V);
}
}
signed main(){
clock_t st=clock(),ed;
n=read();rep(i,1,n)ckmax(V,a[i]=read());
m=read();rep(i,1,m)prq[i].l=read(),prq[i].r=read(),prq[i].b=read(),prq[i].id=i;
sort(prq+1,prq+m+1);
int it=1;
for(int i=1,j=0;i<=64&&it<=m;++i){
while(prq[j+1].b==i)++j;
solve1(it,j,i),it=j+1;
}
solve2(it,m);
rep(i,1,m)printf("%d\n",ans[i]);
ed=clock(),cerr<<1.*(ed-st)/CLOCKS_PER_SEC<<'\n';
return 0;
}```
CF1265B Beautiful Numbers.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
int T,n,a[N],p[N];
signed main() {
T=rd();
while(T--) {
n=rd();int mi=n,mx=1;
for(rint i=1;i<=n;++i)a[i]=rd(),p[a[i]]=i;
for(rint i=1;i<=n;++i) {
mi=min(mi,p[i]),mx=max(mx,p[i]);
if(mx-mi+1==i)putchar('1');
else putchar('0');
}
puts("");
}
return 0;
}```
CF1296C Yet Another Walking Robot.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200005;
int T,n,l,r,sum[N];
char s[N];
int f(char c)
{
if(c=='L')return -1;
if(c=='R')return 1;
if(c=='U')return N;
if(c=='D')return -N;
}
signed main()
{
scanf("%lld",&T);
while(T--)
{
scanf("%lld%s",&n,s+1);
for(int i=1;i<=n;++i)
sum[i]=sum[i-1]+f(s[i]);
//for(int i=1;i<=n;++i)cout<<sum[i]<<" ";puts("");
unordered_map<int,int>mp;
l=-1,r=n+1;
for(int i=0;i<=n;++i)
{
if(mp.count(sum[i])&&i-mp[sum[i]]+1<r-l+1)
l=mp[sum[i]]+1,r=i;
mp[sum[i]]=i;
}
if(l==-1)puts("-1");
else printf("%lld %lld\n",l,r);
}
return 0;
} ```
CF1392F Omkar and Landslide.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000009;
int n,a[N],sum;
signed main() {
n=rd();
for(int i=1;i<=n;++i)sum+=(a[i]=rd());
int l=1,r=sum/n,res=sum;
while(l<=r) {
int mid=(l+r)>>1;
if(n*(2*mid+n-1)/2>=sum)res=mid,r=mid-1;
else l=mid+1;
}
--res;
int k=sum-n*(2*res+n-1)/2;
for(int i=1;i<=k;++i)printf("%lld ",i+res);
for(int i=k+1;i<=n;++i)printf("%lld ",i+res-1);
return 0;
}```
P2791 幼儿园篮球题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=N<<2;
const int K=20000005;
#define mod 998244353
int n,m,s,l,sti[N],k,ans;
namespace math{
int fac[K],ifc[K];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
void initmath(const int&n=K-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
}
using math::qpow;
using math::fmod;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:qpow(3,mod-2);
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j|k],Y=1ll*w0*a[i|j|k]%mod;
fmod(a[j|k]=X+Y),fmod(a[i|j|k]=X-Y+mod);
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void get_stirling(int n,int*sti){//第n行
static int A[M],B[M];
for(int i=0;i<=n;++i)A[i]=i&1?mod-math::ifc[i]:math::ifc[i],B[i]=1ll*qpow(i,n)*math::ifc[i]%mod;
poly_mul(A,B,A,n+1,n+1);
for(int i=0;i<=n;++i)sti[i]=A[i];
}
}
signed main(){
n=read(),m=read(),s=read(),l=read();
math::initmath(n);
poly::get_stirling(l,sti);
while(s--){
n=read(),m=read(),k=read(),ans=0;
for(int up=min(n,min(m,l)),i=0;i<=up;++i){
fmod(ans+=1ll*math::fac[i]*sti[i]%mod*math::comb(m,i)%mod*math::comb(n-i,k-i)%mod);
}
ans=1ll*ans*qpow(math::comb(n,k),mod-2)%mod;
printf("%d\n",ans);
}
return 0;
}```
CF1271D Portals.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000009;
int n,m,k,a[N],b[N],c[N],to[N],ans;
vector<int>v[N];
struct Heap {
int siz,a[N];
Heap(){siz=0;memset(a,0,sizeof(a));}
void push(int x) {
a[++siz]=x;int now=siz;
while(now>1&&a[now]<a[now>>1])swap(a[now],a[now>>1]),now>>=1;
}
void pop() {
a[1]=a[siz--];int now=1;
while((now<<1)<=siz) {
int nex=a[now<<1]<a[now<<1|1]?now<<1:now<<1|1;
if(a[now]<=a[nex])return;
swap(a[now],a[nex]),now=nex;
}
}
int top(){return a[1];}
bool empty(){return !siz;}
}h;
inline bool cmp(const int &a,const int &b) {return c[a]>c[b];}
int main(){
n=rd(),m=rd(),k=rd();
for(int i=1;i<=n;++i)a[i]=rd(),b[i]=rd(),c[i]=rd(),to[i]=i;
for(int i=1;i<=m;++i) {
int u=rd(),v=rd();
if(to[v]<u)to[v]=u;
}
for(int i=1;i<=n;++i)v[to[i]].pb(i);
for(int i=1;i<=n;++i)sort(v[i].begin(),v[i].end(),cmp);
for(int i=1;i<=n;++i) {
while(!h.empty()&&k<a[i])++k,ans-=h.top(),h.pop();
if(k<a[i])return puts("-1"),0;
k+=b[i];
for(int j:v[i])
if(k)h.push(c[j]),--k,ans+=c[j];
else if(!h.empty()&&h.top()<c[j])ans+=c[j]-h.top(),h.pop(),h.push(c[j]);
else break;
}
printf("%d\n",ans);
return 0;
}```
P3272 [SCOI2011]地板.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
int rdc() {
char ch=getchar();
while(ch!='_'&&ch!='*')ch=getchar();
return ch=='_';
}
const int mod=20110520;
const int hash_mod=1999999;
int n,m,a[114][514],edx,edy,inc[22],ans;
int cnt[1<<21],val[2][1<<21],sum[2][1<<21],head[hash_mod],nxt[1<<21],now,lst;
void turn() {
int b[114][514];
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
b[j][i]=a[i][j];
n^=m^=n^=m;
memset(a,0,sizeof(a));
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
a[i][j]=b[i][j];
}
void insert(int mask,int num) {
int u=mask%hash_mod;
for(int i=head[u];i;i=nxt[i])
if(val[now][i]==mask)return sum[now][i]=(sum[now][i]+num)%mod,void();
++cnt[now];
nxt[cnt[now]]=head[u];
head[u]=cnt[now];
val[now][cnt[now]]=mask;
sum[now][cnt[now]]=num%mod;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
a[i][j]=rdc();
if(n<m)turn();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i][j])edx=i,edy=j;
inc[0]=1;
for(int i=1;i<=20;++i)inc[i]=inc[i-1]<<2;
now=1,lst=0,cnt[1]=1,val[1][1]=0,sum[1][1]=1;
for(int i=1;i<=n;++i) {
for(int j=1;j<=cnt[now];++j)val[now][j]<<=2;
for(int j=1;j<=m;++j) {
memset(head,0,sizeof(head)),lst^=1,now^=1,cnt[now]=0;
for(int k=1;k<=cnt[lst];++k) {
int mask=val[lst][k],num=sum[lst][k];
int b1=(mask>>((j-1)*2))%4,b2=(mask>>(j*2))%4;//right;down
if(!a[i][j]) {
if(!b1&&!b2)insert(mask,num);
} else if(!b1&&!b2) {
if(a[i+1][j]&&a[i][j+1])insert(mask+inc[j-1]*2+inc[j]*2,num);
if(a[i+1][j])insert(mask+inc[j-1],num);
if(a[i][j+1])insert(mask+inc[j],num);
} else if(b1==1&&!b2) {
if(a[i+1][j])insert(mask+inc[j-1],num);
if(a[i][j+1])insert(mask-inc[j-1]+inc[j],num);
} else if(!b1&&b2==1){
if(a[i+1][j])insert(mask-inc[j]+inc[j-1],num);
if(a[i][j+1])insert(mask+inc[j],num);
} else if(b1==2&&!b2) {
if(i==edx&&j==edy)ans=(ans+num)%mod;
insert(mask-inc[j-1]*2,num);
if(a[i][j+1])insert(mask-inc[j-1]*2+inc[j]*2,num);
} else if(!b1&&b2==2) {
if(i==edx&&j==edy)ans=(ans+num)%mod;
insert(mask-inc[j]*2,num);
if(a[i+1][j])insert(mask-inc[j]*2+inc[j-1]*2,num);
} else if(b1==1&&b2==1) {
if(i==edx&&j==edy)ans=(ans+num)%mod;
insert(mask-inc[j]-inc[j-1],num);
}
}
}
}
printf("%lld\n",ans);
return 0;
} ```
P1084 疫情控制.cpp
```#include<bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
typedef long long LL;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=50005;
int n,m,c[N],fa[17][N],dep[N],a[N];
bool tag[N],ned[N];
LL dis[N],ans=-1;
struct edge{
int v,w;
edge(){v=w=0;}
edge(int v_,int w_){v=v_,w=w_;}
inline bool operator < (const edge&p)const{return w<p.w;}
};
vector<edge>e[N];
struct node{
int u;LL dis;
node(){u=dis=0;}
node(int u_,LL dis_){u=u_,dis=dis_;}
inline bool operator < (const node&p)const{return dis<p.dis;}
};
void dfs1(int u,int ft){
for(int i=1;1<<i<=dep[u];++i)fa[i][u]=fa[i-1][fa[i-1][u]];
for(int i=0;i<e[u].size();++i){
int v=e[u][i].v;if(v==ft)continue;
dep[v]=dep[u]+1,dis[v]=dis[u]+e[u][i].w,fa[0][v]=u;
dfs1(v,u);
}
}
int dfs2(int u,int ft){
if(tag[u])return 0;
for(int i=0;i<e[u].size();++i){
int v=e[u][i].v;if(v==ft)continue;
if(dfs2(v,u))return 1;
}
return e[u].size()<2;
}
bool check(LL k){
memset(tag,0,sizeof(tag));
memset(ned,0,sizeof(ned));
vector<node>arm,nod,vec;
for(int i=1;i<=m;++i){
int u=a[i];
for(int j=16;~j;--j)if(fa[j][u]>1&&dis[a[i]]<=dis[fa[j][u]]+k)u=fa[j][u];
if(dis[a[i]]<=k)vec.pb(node(u,k-dis[a[i]]));
else tag[u]=1;
}
for(int i=0;i<e[1].size();++i)if(dfs2(e[1][i].v,1))ned[e[1][i].v]=1;
sort(vec.begin(),vec.end());
for(int i=0;i<vec.size();++i){
int u=vec[i].u;
if(ned[u]&&vec[i].dis<dis[u])ned[u]=0;
else arm.pb(vec[i]);
}
for(int i=0;i<e[1].size();++i)if(ned[e[1][i].v])nod.pb(node(e[1][i].v,e[1][i].w));
sort(arm.begin(),arm.end()),sort(nod.begin(),nod.end());
if(arm.size()<nod.size())return 0;
int i=0,j=0;
while(i<arm.size()&&j<nod.size())
if(arm[i].dis>=nod[j].dis)++i,++j;
else ++i;
return j==nod.size();
}
signed main(){
n=read();
LL l=0,r=0;
for(int i=1;i<n;++i){
int x=read(),y=read(),z=read();
e[x].pb(edge(y,z)),e[y].pb(edge(x,z)),r+=z;
}
dfs1(1,0);
m=read();
for(int i=1;i<=m;++i)a[i]=read();
while(l<=r){
LL mid=(l+r)>>1;
if(check(mid))ans=mid,r=mid-1;
else l=mid+1;
}
printf("%lld\n",ans);
return 0;
}
```
P1481 种树.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
int n,k,a[N];
LL ans=-1145141919810,f[N][2],g[N][2],ANS;
int check(int x){
f[0][0]=f[0][1]=g[0][0]=g[0][1]=0;
for(int i=1;i<=n;++i)a[i]+=x;
for(int i=1;i<=n;++i) {
f[i][1]=f[i-1][0]+a[i],g[i][1]=g[i-1][0]+1;
f[i][0]=f[i-1][1],g[i][0]=g[i-1][1];
if(f[i-1][0]>f[i-1][1]||(f[i-1][0]==f[i-1][1]&&g[i-1][0]<g[i-1][1]))
f[i][0]=f[i-1][0],g[i][0]=g[i-1][0];
}
for(int i=1;i<=n;++i)a[i]-=x;
ANS=max(f[n][0],f[n][1]);
if(f[n][0]>f[n][1]||(f[n][0]==f[n][1]&&g[n][0]<g[n][1]))return g[n][0];
else return g[n][1];
}
signed main() {
n=rd(),k=rd();
int l=0,r=0;
for(int i=1;i<=n;++i)a[i]=rd(),r=max(r,abs(a[i])),assert(abs(a[i])<=1000000);
l=-r,r=0;
if(check(0)<=k)return printf("%lld\n",ANS),0;
while(l<=r) {
int mid=(l+r)>>1;
if(check(mid)<=k)ans=ANS-1ll*k*mid,l=mid+1;
else r=mid-1;
}
if(ans==-1145141919810)ans=0;
printf("%lld\n",ans);
return 0;
}```
AT2000 [AGC002F] Leftmost Ball.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 2505
#define mod 1000000007
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,k,fac[N*N],ifac[N*N],dp[N][N];
int C(int n,int m){return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
void init(const int&lim){
fac[0]=1;for(int i=1;i<=lim;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifac[lim]=qpow(fac[lim],mod-2);for(int i=lim-1;i>=0;--i)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
}
signed main(){
n=read(),k=read(),init(n*k);
if(k==1)return puts("1"),0;
for(int i=1;i<=n;++i)dp[i][0]=1;
for(int i=1;i<=n;++i)
for(int j=1;j<=i;++j){
dp[i][j]=(dp[i-1][j]+
1ll*dp[i][j-1]*(n-j+1)%mod*C(n*k-i-(j-1)*(k-1)-1,k-2)%mod)%mod;
}
printf("%d\n",dp[n][n]);
return 0;
}
/*
dp[sum of white][sum kinds of ball]
*/```
P3966 [TJOI2013]单词.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=205;
const int M=1000005;
int fail[M],dp[M];
int n,tot,ch[M][26],ed[M];
string S;
vector<int>f[M],g[M];
unordered_map<int,bool>mp[M];
void ins(char*s,int id) {
int u=0,len=strlen(s);
for(int i=0;i<len;++i) {
int c=s[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
ed[id]=u;
}
void make_fail() {
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]),fail[ch[0][i]]=0;
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])q.push(ch[u][i]),fail[ch[u][i]]=ch[fail[u]][i];
else ch[u][i]=ch[fail[u]][i];
}
}
void dfs(int u) {
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];dfs(v);
dp[u]+=dp[v];
}
}
signed main() {
n=rd();
char jpjAKIOI[M];
for(int i=1;i<=n;++i) {
scanf("%s",jpjAKIOI);
S+=(string)jpjAKIOI+"|";
ins(jpjAKIOI,i);
}
make_fail();
for(int i=0,u=0,len=S.size();i<len;++i)
{
if(S[i]!='|')u=ch[u][S[i]-'a'],++dp[u];
else u=0;
}
for(int i=1;i<=tot;++i)g[fail[i]].pb(i);
dfs(0);
for(int i=1;i<=n;++i)printf("%d\n",dp[ed[i]]);
return 0;
}```
CF1100F Ivan and Burgers.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
int n,q;
struct linear_base {
int d[30],pos[30];
linear_base(){memset(d,0,sizeof(d)),memset(pos,0,sizeof(pos));}
void insert(int val,int id,const linear_base &mzAKIOI) {
*this=mzAKIOI;
for(int i=21;i>=0;--i) {
if(val>>i&1) {
if(!d[i]){d[i]=val,pos[i]=id;break;}
else if(pos[i]<id)swap(val,d[i]),swap(id,pos[i]);
val^=d[i];
}
}
}
int query(int l) {
int res=0;
for(int i=21;i>=0;--i)
if(d[i]&&pos[i]>=l)res=max(res,res^d[i]);
return res;
}
}a[N];
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i].insert(rd(),i,a[i-1]);
for(q=rd();q;--q) {
int x=rd(),y=rd();
printf("%d\n",a[y].query(x));
}
return 0;
}```
CF987B High School_ Become Human.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
double log(int x,int y) {
return 1.*log(y)/log(x);
}
signed main() {
int x=rd(),y=rd();
if(x==1||y==1) {
if(x==y)puts("=");
else puts(x==1?"<":">");
return 0;
}
double t=y/log(x,y);
if(t==x)puts("=");
else if(t>x)puts(">");
else puts("<");
}```
P1081 开车旅行.cpp
```#include<bits/stdc++.h>
using namespace std;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define LOG 18
#define inf 20000000000000ll//2e13
int n,h[N],m;
int A[N][LOG],lg[N],B[N];
LL d[N][LOG],S[N][LOG],dB[N];
void init(){
multiset<pair<LL,int> >s;
s.insert(mkp(inf,0)),s.insert(mkp(inf,0)),s.insert(mkp(-inf,0)),s.insert(mkp(-inf,0));
for(int i=n;i>=1;--i){
set<pair<LL,int> >::iterator it;
it=s.lower_bound(mkp(h[i],114514)),++it;
pair<LL,int> x=*it--,y=*it--,z=*it--,k=*it;
if(h[i]-z.fi<=y.fi-h[i]){
B[i]=z.se,dB[i]=h[i]-z.fi;
if(h[i]-k.fi<=y.fi-h[i])A[i][0]=k.se,d[i][0]=h[i]-k.fi;
else A[i][0]=y.se,d[i][0]=y.fi-h[i];
}else {
B[i]=y.se,dB[i]=y.fi-h[i];
if(h[i]-z.fi<=x.fi-h[i])A[i][0]=z.se,d[i][0]=h[i]-z.fi;
else A[i][0]=x.se,d[i][0]=x.fi-h[i];
}
s.insert(mkp(h[i],i));
}
lg[0]=-1;for(int i=1;i<=n;++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=n;++i)
A[i][1]=B[A[i][0]],d[i][1]=d[i][0],
S[i][0]=d[i][0],S[i][1]=S[i][0]+dB[A[i][0]];
for(int j=2;j<=lg[n];++j)
for(int i=1;i<=n;++i)
A[i][j]=A[A[i][j-1]][j-1],d[i][j]=d[i][j-1]+d[A[i][j-1]][j-1],
S[i][j]=S[i][j-1]+S[A[i][j-1]][j-1];
h[0]=-1e9-114514;
}
pair<LL,LL>solve2(int s,int x){
int u=s;LL sumA=0,sum=0;
for(int i=lg[n];i>=0;--i)if(A[u][i]&&S[u][i]+sum<=x)sumA+=d[u][i],sum+=S[u][i],u=A[u][i];
return mkp(sumA,sum-sumA);
}
const db eps=1e-10;
void solve1(){
int x=read();
pair<LL,LL>now=mkp(114514,0);
int res=0;
for(int i=1;i<=n;++i){
pair<LL,LL>tmp=solve2(i,x);
if(!tmp.se&&!now.se){
if(h[i]>h[res])res=i,now=tmp;
}else if(tmp.se){
if(1.*now.fi/now.se>1.*tmp.fi/tmp.se)res=i,now=tmp;
}
}
printf("%d\n",res);
}
signed main(){
n=read();
for(int i=1;i<=n;++i)h[i]=read();
init();
solve1();
for(m=read();m;--m){
int s=read(),x=read();
pair<LL,LL>tmp=solve2(s,x);
printf("%lld %lld\n",tmp.fi,tmp.se);
}
return 0;
}```
CF1278D Segment Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int fa[N],n,flag=1,sum,mp[N<<1],c[N];
struct node{
int op,id;
}a[N<<1];
set<int>s;
int find(int x) {
return x==fa[x]?x:fa[x]=find(fa[x]);
}
int main() {
scanf("%d",&n);
for(int i=1;i<=n;++i)fa[i]=i;
for(int i=1,x,y;i<=n;++i) {
scanf("%d%d",&x,&y);
a[x].op=1,a[x].id=i;
a[y].op=0,a[y].id=i;
mp[x]=mp[y]=i;c[i]=y;
}
for(int i=1;i<=n*2;++i) {
if(!a[i].op){
s.erase(c[a[i].id]);
continue;
}
for(set<int>::iterator it=s.begin();it!=s.end()&&*it<=c[a[i].id];++it) {
int x=find(a[i].id),y=find(mp[*it]);
if(x==y)return puts("NO"),0;
fa[x]=y,++sum;
if(sum>=n)return puts("NO"),0;
}
s.insert(c[a[i].id]);
}
if(sum<n-1)return puts("NO"),0;
return puts("YES"),0;
}```
CF1236A Stones.cpp
```#include<bits/stdc++.h>
using namespace std;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
#define rint register int
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int T,a,b,c,ans;
signed main() {
T=rd();
while(T--) {
a=rd(),b=rd(),c=rd(),ans=0;
while(c>=2&&b>=1)c-=2,b-=1,ans+=3;
while(a>=1&&b>=2)b-=2,a-=1,ans+=3;
printf("%d\n",ans);
}
return 0;
}```
P1997 faebdc 的烦恼.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=200005;
int n,m,cnt[M],ans[M],now,sum[M],S,a[N];
struct que{
int l,r,id;
que(){l=r=id=0;}
inline bool operator < (const que&t)const{return l/S!=t.l/S?l<t.l:(l/S)&1?r<t.r:r>t.r;}
}q[M];
void add(int x){
++cnt[x];
if(!sum[cnt[x]]++)++now;
}
void pop(int x){
if(!--sum[cnt[x]])--now;
--cnt[x];
}
signed main(){
n=read(),m=read(),S=(n-1)/sqrt(m)+1;
rep(i,1,n)a[i]=read()+100000;
rep(i,1,m)q[i].id=i,q[i].l=read(),q[i].r=read();
sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i){
while(l>q[i].l)add(a[--l]);
while(r<q[i].r)add(a[++r]);
while(l<q[i].l)pop(a[l++]);
while(r>q[i].r)pop(a[r--]);
ans[q[i].id]=now;
}
rep(i,1,m)printf("%d\n",ans[i]);
return 0;
}```
CF853A Planning.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=300005;
struct node{
int tim,val;
friend bool operator < (const node &a,const node &b) {
return a.val<b.val;
}
node(int t,int v) : tim(t) ,val(v) {}
};
priority_queue<node>q;
int n,ans,res[N],k;
signed main() {
scanf("%lld%lld",&n,&k);
for(int i=1,x;i<=k;++i) {
scanf("%d",&x);
q.push(node(i,x));
}
for(int i=k+1,x;i<=n;++i) {
scanf("%lld",&x);
q.push(node(i,x));
ans+=(i-q.top().tim)*q.top().val;
res[q.top().tim]=i;
q.pop();
}
for(int i=n+1;i<=n+k;++i) {
ans+=(i-q.top().tim)*q.top().val;
res[q.top().tim]=i;
q.pop();
}
printf("%lld\n",ans);
for(int i=1;i<=n;++i)
printf("%lld ",res[i]);
return 0;
}```
CF1336B Xenia and Colorful Gems.cpp
```//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
int a[3][N],T,ans,len[3],mx[3];
int p2(int x) {return x*x;}
int calc(int x,int y,int z) {
return p2(x-y)+p2(y-z)+p2(z-x);
}
signed main() {
T=rd();
while(T--) {
ans=4e18;mx[0]=mx[1]=mx[2]=0;
len[0]=rd(),len[1]=rd(),len[2]=rd();
for(rint i=0;i<3;++i)
for(rint j=1;j<=len[i];++j)
a[i][j]=rd();
sort(a[0]+1,a[0]+len[0]+1),sort(a[1]+1,a[1]+len[1]+1),sort(a[2]+1,a[2]+len[2]+1);
for(rint i=0;i<3;++i) {
for(rint j=0;j<3;++j) {
if(i==j)continue;
for(rint k=0;k<3;++k) {
if(k==i||k==j)continue;
for(rint l=1;l<=len[i];++l) {
int Y=lower_bound(a[j],a[j]+len[j]+1,a[i][l])-a[j];
int Z=upper_bound(a[k],a[k]+len[k]+1,a[i][l])-a[k];
if(Y!=len[j]+1&&Z!=1) ans=min(ans,calc(a[i][l],a[j][Y],a[k][--Z]));
}
}
}
}
printf("%lld\n",ans);
for(rint i=0;i<3;++i)
for(rint j=1;j<=len[i];++j)
a[i][j]=0;
}
return 0;
}```
P1315 观光公交.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1005;
const int M=10005;
int n,m,k,D[N],T[M],A[M],B[M];
int las[N],nex[N],arv[N],sum[N];
LL ans;
signed main(){
n=read(),m=read(),k=read();
for(int i=1;i<n;++i)D[i]=read();
for(int i=1;i<=m;++i){
T[i]=read(),A[i]=read(),B[i]=read();
las[A[i]]=max(las[A[i]],T[i]);
++sum[B[i]];
}
arv[1]=0;
for(int i=1;i<n;++i){
arv[i+1]=arv[i];
if(las[i]>arv[i])arv[i+1]+=las[i]-arv[i];
arv[i+1]+=D[i];
}
for(int i=1;i<=m;++i)ans+=arv[B[i]]-T[i];
for(int i=1;i<=n;++i)sum[i]+=sum[i-1];
while(k--){
nex[n-1]=n;
for(int i=n-2;i>0;--i)
if(las[i+1]>=arv[i+1])nex[i]=i+1;
else nex[i]=nex[i+1];
int add=-1,mx=0;
for(int i=1;i<n;++i){
int s=sum[nex[i]]-sum[i];
if(s>mx&&D[i]>0)mx=s,add=i;
}
if(!~add)break;
ans-=mx,--D[add];
arv[1]=0;
for(int i=2;i<=n;++i){
arv[i+1]=arv[i];
if(las[i]>arv[i])arv[i+1]+=las[i]-arv[i];
arv[i+1]+=D[i];
}
}
printf("%lld\n",ans);
return 0;
}```
P3647 [APIO2014]连珠线.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 200005
#define inf (0x3f3f3f3f)
int n,ans,fa[N],f[N][2],rlen[N];
vector<int>e[N],q[N],w[N],h[N][2];
void dfs1(int u,int ft){
int Mx=-inf,mx=-inf,flg=0;
for(int i=0;i<sz(e[u]);++i)
if(e[u][i]==ft){swap(e[u][i],e[u][sz(e[u])-1]),swap(w[u][i],w[u][sz(w[u])-1]),flg=1;break;}
if(flg)e[u].pop_back();
for(int i=0;i<sz(e[u]);++i){
int v=e[u][i];
dfs1(v,u),fa[v]=u,rlen[v]=w[u][i];
f[u][0]+=max(f[v][0],f[v][1]+w[u][i]);
int tmp=f[v][0]+w[u][i]-max(f[v][0],f[v][1]+w[u][i]);
if(tmp>Mx)mx=Mx,Mx=tmp;
else if(tmp>mx)mx=tmp;
}
f[u][1]=f[u][0]+Mx;
for(int i=0;i<sz(e[u]);++i){
int v=e[u][i];
h[u][0].pb(f[u][0]-max(f[v][0],f[v][1]+w[u][i]));
int tmp=f[v][0]+w[u][i]-max(f[v][0],f[v][1]+w[u][i]);
if(tmp==Mx)q[u].pb(mx),h[u][1].pb(h[u][0][i]+mx);
else q[u].pb(Mx),h[u][1].pb(h[u][0][i]+Mx);
}
}
void dfs2(int u,int ft){
for(int i=0;i<sz(e[u]);++i){
int v=e[u][i];if(v==ft)continue;
f[u][0]=h[u][0][i],f[u][1]=h[u][1][i];
if(fa[u]){
f[u][0]+=max(f[fa[u]][0],f[fa[u]][1]+rlen[u]);
f[u][1]=f[u][0]+max(q[u][i],f[fa[u]][0]+rlen[u]-max(f[fa[u]][0],f[fa[u]][1]+rlen[u]));
}
ans=max(ans,f[v][0]+max(f[u][0],f[u][1]+w[u][i]));
dfs2(v,u);
}
}
signed main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read(),z=read();
e[x].pb(y),w[x].pb(z);
e[y].pb(x),w[y].pb(z);
}
dfs1(1,0),dfs2(1,0);
printf("%d\n",ans);
return 0;
}```
CF616F Expensive Strings.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
const int S=N<<1;
int n,a[N];
string str[N];
int trans[S][26],mxlen[S],link[S],rt[S],tot=1;
vector<int>e[S];
LL s[S],ans=-1e18;
int extend(int c,int lst,int id){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return s[q]+=a[id],q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return s[nq]+=a[id],nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return s[np]+=a[id],np;
}
void dfs(int u){
for(int v:e[u])dfs(v),s[u]+=s[v];
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
rep(i,1,n)cin>>str[i];
rep(i,1,n)cin>>a[i];
rep(i,1,n){
int lst=1,len=sz(str[i]);
for(int j=0;j<len;++j)lst=extend(str[i][j]-'a',lst,i);
}
for(int i=1;i<=tot;++i)e[link[i]].pb(i);
dfs(1);
for(int i=1;i<=tot;++i)ckmax(ans,1ll*mxlen[i]*s[i]);
cout<<ans<<'\n';
}```
CF1260C Infinite Fence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,r,b,k;
signed main() {
scanf("%lld",&n);
while(n--) {
scanf("%lld%lld%lld",&r,&b,&k);
if(r>b)swap(r,b);
int GCD=__gcd(r,b);
r/=GCD,b/=GCD;
if(r*(k-1)+1>=b) puts("OBEY");
else puts("REBEL");
}
return 0;
}```
CF628F Bear and Fair Set.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=11005;
const int M=N*7*2;
const int inf=0x3f3f3f3f;
int n,b,q,sum[N][5];
pair<int,int>p[N];
int dis[N],cur[N],mf,S,T,hed[N],et=1;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(fl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
n=read(),b=read(),q=read(),S=q+6+1,T=S+1;
rep(i,1,b)rep(j,0,4)sum[i][j]=sum[i-1][j]+(i%5==j);
rep(i,1,q)p[i].fi=read(),p[i].se=read();
sort(p+1,p+q+1),p[++q]=mkp(b,n);
rep(i,1,q){
if(p[i].se>=p[i-1].se)adde(S,i,p[i].se-p[i-1].se);
else return puts("unfair"),0;
rep(j,0,4)adde(i,q+j+1,sum[p[i].fi][j]-sum[p[i-1].fi][j]);
}
rep(i,1,5)adde(q+i,T,n/5);
while(bfs(S,T))mf+=dfs(S,inf);
puts(mf==n?"fair":"unfair");
return 0;
}```
CF1091A New Year and the Christmas Ornament.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define F(i,l,r) for(int i=l;i<=r;++i)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
signed main() {
int a=rd(),b=rd(),c=rd();
a=min(a,min(b-1,c-2));
printf("%d\n",(a+1)*3);
}```
P1020 导弹拦截（树状数组）.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=100005;
const int M=50005;
int ans,a[N],n=1,dp1[N],dp2[N];
struct BIT1 {
int tr[M];
#define lt(i) (i&(-i))
void add(int x,int d) {
if(x<=0)return;
for(int i=x;i>0;i-=lt(i))
tr[i]=max(tr[i],d);
}
int ask(int x) {
if(x>=M)x=M-1;
int res=0;
for(int i=x;i<M;i+=lt(i))
res=max(res,tr[i]);
return res;
}
}tr1;
struct BIT2 {
int tr[M];
#define lt(i) (i&(-i))
void add(int x,int d) {
if(x<=0)return;
for(int i=x;i<M;i+=lt(i))
tr[i]=max(tr[i],d);
}
int ask(int x) {
if(x>=M)x=M-1;
int res=0;
for(int i=x;i>0;i-=lt(i))
res=max(res,tr[i]);
return res;
}
}tr2;
int main() {
while(scanf("%d",&a[n])!=EOF)++n;
--n;
for(int i=1;i<=n;++i) {
int tmp=tr1.ask(a[i])+1;
ans=max(ans,tmp);
tr1.add(a[i],tmp);
}
printf("%d\n",ans);
ans=0;
for(int i=1;i<=n;++i) {
int tmp=tr2.ask(a[i])+1;
dp2[i]=tmp;
ans=max(ans,tmp);
tr2.add(a[i]+1,tmp);
}
printf("%d\n",ans);
return 0;
}
```
P6222 「P6156 简单题」加强版.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
typedef unsigned int unt;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline unt read() {
unt x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x;
}
const int N=20000005;
unt T,n,k;
unt pw[N],f[N], pri[1270610], cnt;
bool vis[N];
unt qpow(unt n,unt k,unt res=1){
for(;k;k>>=1,n=n*n)if(k&1)res=res*n;
return res;
}
void init(const unt&N){
pw[1]=1,f[1]=1;
for(unt i=2;i<=N;++i){
if (!vis[i]) pri[++cnt] = i, pw[i] = qpow(i, k), f[i] = i - 1;
for (unt j = 1; j <= cnt && i * pri[j] <= N; ++ j) {
vis[i * pri[j]] = 1, pw[i * pri[j]] = pw[i] * pw[pri[j]];
if (i % pri[j] == 0) {
if(i / pri[j] % pri[j]) f[i * pri[j]] = - f[i / pri[j]] * pri[j];
break;
}
pw[i * pri[j]] = pw[i] * pw[pri[j]], f [i * pri[j]] = f[i] * f[pri[j]];
}
}
for(unt i=1;i<=N;++i)f[i]=pw[i]*f[i]+f[i-1],pw[i]=pw[i]+pw[i-1];
for(unt i=1;i<=N;++i)pw[i]=pw[i-1]+pw[i];
}
unt query(unt n){
unt res=0;
for(unt l=1,r;l<=n;l=r+1)
r=n/(n/l),res=(res+(pw[(n/l)<<1]-(pw[n/l]<<1))*(f[r]-f[l-1]));
return res;
}
signed main(){
T = read(), n=read(), k = read(),init(n<<1);
while(T--)printf("%u\n",query(read()));
}```
P1587 [NOI2016]循环之美.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 1000005;
const int C = 1000000;
const int K = 2005;
int n, m, k;
int mu[N], sm[N], pri[N / 9], cnt, s[K];
bool vis[N];
LL ans;
unordered_map <int, int> _mu, dp[K];
int gcd(int x, int y) {return !y ? x : gcd(y, x % y);}
void init() {
mu[1] = 1;
for (int i = 2; i <= C; ++ i) {
if (!vis[i]) pri[++cnt] = i, mu[i] = -1;
for (int j = 1; j <= cnt && i * pri[j] <= C; ++ j) {
vis[i * pri[j]] = 1;
if (i % pri[j] == 0) break;
mu[i * pri[j]] = - mu[i];
}
}
for (int i = 1; i <= C; ++ i) sm[i] = mu[i] + sm[i - 1];
for (int i = 1; i <= k; ++ i) s[i] = s[i - 1] + (gcd(i, k) == 1);
}
int smu(int x) {
if (x <= C) return sm[x];
if (_mu[x]) return _mu[x];
int res = 1;
for (int l = 2, r; l <= x; l = r + 1)
r = x / (x / l), res -= (r - l + 1) * smu(x / l);
return _mu[x]=res;
}
int h(int x) {return s[k] * (x / k) + s[x % k];}//for i 1 x :[gcd(i,k)=1]
int g(int n, int k) {
if (!n) return 0;
if (k == 1) return dp[k][n] = smu(n);
if (dp[k][n]) return dp[k][n];
int res = 0;
for (int i = 1; i * i <= k; ++ i) {
if (k % i == 0) {
if (mu[i]) res += mu[i] * mu[i] * g(n / i, i);
if (mu[k / i] && i * i != k) res += mu[k / i] * mu[k / i] * g(n / (k / i), k / i);
}
}
return dp[k][n] = res;
}
signed main(){
n = read(), m = read(), k = read(), init();
for (int l = 1, r, mx = min(n, m); l <= mx; l = r + 1) {
r = min(n / (n / l), m / (m / l));
ans += 1ll * (n / l) * h(m / l) * (g(r, k) - g(l - 1, k));
}
printf("%lld\n", ans);
return 0;
}
/*
1000000000 99999999 1926
30114906314949722
904 791040170 780
168263165839
*/```
CF1107G Vasya and Maximum Profit.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 300009
int n,a,ans;
int c[N],sc[N],d[N];
int lg[N],pw2[25];
int st[N],top,lp[N],rp[N];
struct ST_Table {
int st[20][N];
void init() {
for(int i=1;i<=19;++i)
for(int j=1;j+pw2[i]-1<=n;++j)
st[i][j]=max(st[i-1][j],st[i-1][j+pw2[i-1]]);
}
int ask(int l,int r) {
if(l>r)return 0;
int x=lg[r-l+1];
return max(st[x][l],st[x][r-pw2[x]+1]);
}
}s[2];
void st_init() {
lg[0]=-1,pw2[0]=1;
for(int i=1;i<N;++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=20;++i)pw2[i]=pw2[i-1]<<1;
}
signed main() {
n=rd(),a=rd();
st_init();
for(int i=1;i<=n;++i)d[i]=rd(),sc[i]=sc[i-1]+(c[i]=rd());
for(int i=1;i<n;++i)d[i]=(d[i+1]-d[i])*(d[i+1]-d[i]);
for(int i=1;i<n;++i) {
while(top&&d[st[top]]<d[i])rp[st[top--]]=i-1;
lp[i]=st[top]+1,st[++top]=i;
}
while(top)rp[st[top--]]=n-1;
for(int i=1;i<=n;++i)
s[0].st[0][i]=sc[i-1]-a*(i-1),
s[1].st[0][i]=a*(i+1)-sc[i+1];
s[0].init(),s[1].init();
for(int i=1;i<=n;++i)ans=max(ans,a-c[i]);
for(int i=1;i<n;++i)
ans=max(ans,s[0].ask(lp[i],i)+s[1].ask(i,rp[i])-d[i]);
printf("%lld\n",ans);
return 0;
}```
P4491 [HAOI2018]染色.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1004535809
const int V=10000005;
const int N=100005;
const int M=N<<2;
namespace math{
int fac[V],ifc[V];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
int binom(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
void initmath(const int&n=V-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
}
using math::qpow;
using math::fmod;
namespace poly{
int rev[M],lg,lim;
void poly_init(const int&n){
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:qpow(3,mod-2);
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*a[i+j+k]*w0%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=mod+X-Y);
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];poly_init(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
}
int n,m,S,up,f[M],g[M],A[M],B[M],C[M],W[N],ans;
signed main(){
math::initmath();
n=read(),m=read(),S=read(),up=min(n/S,m);
rep(i,0,m)W[i]=read();
for(int i=0;i<=up;++i)f[i]=1ll*math::binom(m,i)*math::fac[n]%mod*qpow(math::ifc[S],i)%mod*math::ifc[n-S*i]%mod*qpow(m-i,n-S*i)%mod;
for(int i=0;i<=up;++i)A[i]=1ll*math::fac[up-i]*f[up-i]%mod;
for(int i=0;i<=up;++i)B[i]=(i&1)?mod-math::ifc[i]:math::ifc[i];
poly::poly_mul(A,B,C,up+1,up+1);
for(int i=0;i<=up;++i)g[i]=1ll*math::ifc[i]*C[up-i]%mod;
for(int i=0;i<=up;++i)fmod(ans+=1ll*g[i]*W[i]%mod);
printf("%d\n",ans);
return 0;
}```
CF1406B Maximum Product.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,a[N];
vector<int>f,g;
LL ans;
void Main() {
n=rd(),ans=-1e18,f.clear(),g.clear();
for(int i=1;i<=n;++i)a[i]=rd(),a[i]>0?f.push_back(a[i]):g.push_back(a[i]);
sort(f.begin(),f.end()),reverse(f.begin(),f.end()),sort(g.begin(),g.end());
if(!f.size()) {
reverse(g.begin(),g.end()),ans=1;
for(int i=0;i<5;++i)ans*=g[i];
printf("%lld\n",ans);
} else {
for(int i=0;i<=5;++i) {
int j=5-i;
if(f.size()>=i&&g.size()>=j) {
LL t=1;
for(int k=0;k<i;++k)t*=f[k];
for(int k=0;k<j;++k)t*=g[k];
ans=max(ans,t);
}
}
printf("%lld\n",ans);
}
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
CF1307E Cow and Treats.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1000000007;
const int N=5010;
int s[N],f[N],h[N],n,m,mx,sum;
vector<int>vec[N];
signed main() {
scanf("%lld%lld",&n,&m);
for(int i=1; i<=n; ++i)
scanf("%lld",&s[i]);
for(int i=1; i<=m; ++i) {
scanf("%lld%lld",&f[i],&h[i]);
vec[f[i]].push_back(h[i]);
}
for(int i=1; i<=n; ++i)
sort(vec[i].begin(),vec[i].end());
for(int i=0; i<=n; ++i) {
int cnt_l[N]= {0},cnt_r[N]= {0};
for(int j=1; j<=i; ++j)++cnt_l[s[j]];
for(int j=i+1; j<=n; ++j)++cnt_r[s[j]];
int res=1,f1=!i,f2=i?1:0;
for(int j=0;j<vec[s[i]].size();++j)
if(vec[s[i]][j]==cnt_l[s[i]]) {
f1=1;
break;
}
if(!f1)continue;
for(int j=1; j<=n; ++j) {
int l=0,r=0;
while(l<vec[j].size()&&cnt_l[j]>=vec[j][l])++l;
while(r<vec[j].size()&&cnt_r[j]>=vec[j][r])++r;
if(j==s[i])l=0,r-=cnt_r[j]>=cnt_l[j];
if(l>r)swap(l,r);
if(!(l+r))continue;
else if(!l)res=res*r%mod,++f2;
else if(r^1)res=res*l*(r-1)%mod,f2+=2;
else res=(res<<1)%mod,++f2;
}
if(f2==mx)sum=(sum+res)%mod;
else if(f2>mx)mx=f2,sum=res;
}
printf("%lld %lld\n",mx,sum);
return 0;
}```
P5903 【模板】树上 k 级祖先.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define ui unsigned int
ui s;
inline ui get(ui x) {
x ^= x << 13;
x ^= x >> 17;
x ^= x << 5;
return s = x;
}
const int N=500005;
int n,q,fa[N],rt,lstans,lg[N];
LL ans;
int hed[N],et,nx[N],to[N];
int son[N],len[N],bz[20][N],dep[N],top[N];
int *dw[N],*up[N],pool[N*3],*mem=pool;
inline void adde(int u,int v){nx[++et]=hed[u],to[et]=v,hed[u]=et;}
void dfs1(int u){
dep[u]=dep[bz[0][u]=fa[u]]+1;
for(int i=1;1<<i<dep[u];++i)bz[i][u]=bz[i-1][bz[i-1][u]];
for(int i=hed[u];i;i=nx[i]){
int v=to[i];
dfs1(v);
if(len[v]>len[son[u]])son[u]=v;
}
len[u]=len[son[u]]+1;
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=nx[i]){
int v=to[i];if(v==son[u])continue;
dfs2(v,v);
}
if(top[u]==u){
dw[u]=mem;
for(int i=u;i;i=son[i])*mem++=i;
up[u]=mem;
for(int i=u,j=0;j<=len[u]&&i;++j,i=fa[i])*mem++=i;
}
}
int kthanc(int x,int k){
if(!k)return x;
int y=top[bz[lg[k]][x]];
if(dep[x]-dep[y]>=k)return dw[y][dep[x]-k-dep[y]];
else return up[y][dep[y]-dep[x]+k];
}
signed main(){
cin>>n>>q>>s;
rep(i,1,n){
fa[i]=read();
if(!fa[i])rt=i;
else adde(fa[i],i);
}
lg[0]=-1;rep(i,1,n)lg[i]=lg[i>>1]+1;
dfs1(rt),dfs2(rt,rt);
rep(t,1,q){
int x=(get(s)^lstans)%n+1,y=(get(s)^lstans)%dep[x];
ans^=1ll*(lstans=kthanc(x,y))*t;
}
cout<<ans<<'\n';
}```
P4195 【模板】扩展BSGS.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int a,p,b,ans;
int BSGS(int k,int a,int p,int b) {
map<int,int>mp;
int m=ceil(sqrt(p)),t=1;
for(rint i=1;i<=m;++i)t=t*a%p,mp[t*b%p]=i;
for(rint i=1;i<=m;++i) {
k=k*t%p;
if(mp.find(k)!=mp.end()) {
return ((i*m-mp[k])%p+p)%p;
}
}
return -1;
}
int gcd(int x,int y) {return !y?x:gcd(y,x%y);}
int exBSGS(int a,int p,int b) {
a%=p,b%=p;
if(b==1||p==1)return 0;
int cnt=0,d,k=1,res;
while((d=gcd(a,p))!=1) {
if(b%d)return -1;
++cnt,b/=d,p/=d;
k=a/d*k%p;
if(k==b)return cnt;
}
res=BSGS(k,a,p,b);
if(~res)return res+cnt;
else return -1;
}
signed main() {
while("fyy AK Noip&ZJOI&NOI&CTSC&WC&ACM&IOI&POI&global-round") {
a=rd(),p=rd(),b=rd();
if(!a&&!p&&!b)return 0;
ans=exBSGS(a,p,b);
if(~ans)printf("%lld\n",ans);
else puts("No Solution");
}
}
```
CF1437G Death DBMS.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
//Data
#define N 3000005
#define inf 0x3f3f3f3f
int n,m,tot=1,trie[N][26],to[N],strval[N];
int fa[N],val[N],ch[N][2],mx[N],stk[N],top;
bool rev[N];
multiset<int,greater<int> >s[N];
//ACAM
void insert(char*str,int id){
int u=1,len=strlen(str);
for(int i=0;i<len;++i){
int c=str[i]-'a';
if(!trie[u][c])trie[u][c]=++tot;
u=trie[u][c];
}
val[u]=0,to[id]=u;
}
void build_fail(){
queue<int>q;
for(int i=0;i<26;++i)
if(trie[1][i])q.push(trie[1][i]),fa[trie[1][i]]=1;
else trie[1][i]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(trie[u][i])fa[trie[u][i]]=trie[fa[u]][i],q.push(trie[u][i]);
else trie[u][i]=trie[fa[u]][i];
}
for(int i=1;i<=n;++i)s[to[i]].insert(0);
}
//LCT
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){
mx[x]=val[x];
if(ch[x][0])mx[x]=max(mx[x],mx[ch[x][0]]);
if(ch[x][1])mx[x]=max(mx[x],mx[ch[x][1]]);
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;fa[y]=x,fa[x]=z;
pushup(y);
}
void pushdown(int x){if(rev[x])swap(ch[x][0],ch[x][1]),rev[ch[x][0]]^=1,rev[ch[x][1]]^=1,rev[x]=0;}
void splay(int x){
int y=x,z;stk[top=1]=x;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[z][1]==y)^(ch[y][1]==x)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){access(x),splay(x),rev[x]^=1;}
void split(int x,int y){makeroot(x),access(y),splay(y);}
signed main(){
n=read(),m=read();
memset(val,-1,sizeof(val));
for(int i=1;i<=n;++i){
static char str[N];
scanf("%s",str),insert(str,i);
}
build_fail();
while(m--){
static char str[N];
static int opt,x,y,res,t;
scanf("%d",&opt);
if(opt==2){
res=-1,scanf("%s",str);
for(int u=1,i=0,len=strlen(str);i<len;++i)
u=trie[u][str[i]-'a'],split(1,u),res=max(res,mx[u]);
printf("%d\n",res);
}else {
x=read(),y=read(),t=to[x];
splay(t),s[t].erase(s[t].find(strval[x])),s[t].insert(y),val[t]=*s[t].begin(),strval[x]=y;
}
}
return 0;
}```
CF1463D Pairs.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=400005;
int n,a[N],b[N];
void Main(){
n=read(),fill(b,b+n*2+1,0);
int L=2*n,R=-1;
rep(i,1,n)b[a[i]=read()]=1;
for(int i=1,now=0;i<=n<<1;++i){
if(b[i])++now;else --now;
ckmin(L,now),ckmax(R,now);
}
printf("%d\n",n+1-(R-L));
}
signed main(){for(int T=read();T;--T)Main();}```
P3216 [HNOI2011]数学作业.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,mod,k;
struct Matrix {
int a[3][3];
Matrix(){memset(a,0,sizeof(a));}
void clear(){*this=Matrix();}
void e(){
for(int i=0;i<3;++i)
for(int j=0;j<3;++j)
a[i][j]=(i==j);
}
void Start() {
a[0][0]=0,a[0][1]=0,a[0][2]=0,
a[1][0]=1,a[1][1]=0,a[1][2]=0,
a[2][0]=1,a[2][1]=0,a[2][2]=0;
}
void make(int x=1) {
a[0][0]=x%mod,a[0][1]=1,a[0][2]=0,
a[1][0]=0,a[1][1]=1,a[1][2]=1,
a[2][0]=0,a[2][1]=0,a[2][2]=1;
}
int*operator[](const int &k){return a[k];}
Matrix operator * (const Matrix &t) {
Matrix res;
for(int i=0;i<3;++i)
for(int k=0;k<3;++k)
for(int j=0;j<3;++j)
res.a[i][j]=(res.a[i][j]+a[i][k]*t.a[k][j]%mod)%mod;
return res;
}
Matrix operator ^ (int k) {
Matrix res,n=*this;res.e();
while(k) {
if(k&1)res=res*n;
n=n*n,k>>=1;
}
return res;
}
}ans;
void calc(int x,int y) {
Matrix p;p.make(x);
ans=(p^y)*ans;
}
signed main() {
n=rd(),mod=rd(),ans.Start();
for(int i=10,j=0;j<n;i*=10)
calc(i,min(n,i-1)-j),j=min(n,i-1);
printf("%lld\n",ans[0][0]);
return 0;
}
```
CF1251D Salary Changing.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200005;
const int inf=1e15;
int T,n,s,l,r,ans;
inline int max(const int &a,const int &b) {
return a>b?a:b;
}
inline int min(const int &a,const int &b) {
return a<b?a:b;
}
struct node {
int l,r;
}a[N];
bool cmp(const node &a,const node &b) {
return a.l<b.l;
}
bool check(int x) {
int sum=n/2+1,total=s;
for(int i=n;i>=1;--i) {
if(a[i].r>=x&&sum) {
total-=max(x,a[i].l);
--sum;
} else {
total-=a[i].l;
}
}
return (!sum)&&(total>=0);
}
signed main() {
scanf("%lld",&T);
while(T--) {
l=inf,r=0;
scanf("%lld%lld",&n,&s);
for(int i=1;i<=n;++i)
scanf("%lld%lld",&a[i].l,&a[i].r),l=min(l,a[i].l),r=max(r,a[i].r);
sort(a+1,a+n+1,cmp);
while(l<=r) {
int mid=(l+r)>>1;
if(check(mid))ans=mid,l=mid+1;
else r=mid-1;
}
printf("%lld\n",ans);
}
return 0;
}```
CF1392A Omkar and Password.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int inf=1e9+7;
int n,k,T,a[N];
void Main() {
n=rd();int f=1;
for(int i=1;i<=n;++i)a[i]=rd(),f&=a[i]==a[1];
if(f)printf("%lld\n",n);
else puts("1");
}
signed main() {
for(T=rd();T;--T)Main();
}```
CF1481E Sorting Books.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n,a[N],cnt[N],L[N],R[N],suf[N],ans=N,f[N];
signed main(){
n=read();
rep(i,1,n)a[i]=read();
rep(i,1,n)R[a[i]]=i;
per(i,n,1)L[a[i]]=i;
per(i,n,1)++cnt[a[i]],suf[i]=max(suf[i+1],cnt[a[i]]);
rep(i,1,n){
f[i]=f[i-1];
if(i==R[a[i]])ckmax(f[i],f[L[a[i]]-1]+cnt[a[i]]);
ckmin(ans,n-f[i]-suf[i+1]);
}
cout<<ans<<'\n';
}```
P6570 [NOI Online #3 提高组]优秀子序列.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int mod=1e9+7;
const int N=18;
const int M=(1<<N)+5;
int ans,n,dp[M],phi[M],pri[M],pri_tot,mx,len,cnt[M];
bool vis[M];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void Sieve(const int&N){
phi[1]=1;
for(int i=2;i<=N;++i){
if(!vis[i])pri[++pri_tot]=i,phi[i]=i-1;
for(int j=1;j<=pri_tot&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){phi[i*pri[j]]=phi[i]*pri[j];break;}
phi[i*pri[j]]=phi[i]*phi[pri[j]];
}
}
}
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;
return res;
}
signed main(){
n=read();
for(int i=1,x;i<=n;++i)++cnt[x=read()],mx=max(mx,x);
while(mx)++len,mx>>=1;
dp[0]=qpow(2,cnt[0]);
for(int msk=1;msk<1<<len;++msk){
int k=msk&-msk;
for(int i=msk;i;i=(i-1)&msk)if(i&k)fmod(dp[msk]+=1ll*cnt[i]*dp[msk^i]%mod);
}
Sieve(1<<len);
for(int i=0;i<1<<len;++i)fmod(ans+=1ll*phi[i+1]*dp[i]%mod);
printf("%d\n",ans);
return 0;
}```
CF1132D Stressful Training.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rint register int
#define N (200010)
#define inf (1000000000000000)
int n,k,a[N],b[N],l,r,ans=-1;
struct node{
int a,b,val;
node(int a,int b):a(a),b(b),val(a/b){}
bool operator < (const node &rhs)const{return val>rhs.val;}
};
bool check(int x) {
priority_queue<node>q;
for(rint i=1;i<=n;++i)
if(a[i]/b[i]<k)q.push(node(a[i],b[i]));
if(q.empty())return 1;
for(rint i=0;i<k;++i) {
node tmp=q.top();q.pop();
if(tmp.a-i*tmp.b<0)return 0;
tmp.a+=x;
if(tmp.a/tmp.b<k)q.push(node(tmp.a,tmp.b));
if(q.empty())return 1;
}
return 1;
}
signed main() {
scanf("%lld%lld",&n,&k);
for(rint i=1;i<=n;++i)scanf("%lld",&a[i]);
for(rint i=1;i<=n;++i)scanf("%lld",&b[i]),r=max(r,b[i]*k);
while(l<=r) {
int mid=(l+r)>>1;
if(check(mid))r=mid-1,ans=mid;
else l=mid+1;
}
printf("%lld\n",ans);
return 0;
}```
CF1178A Prime Minister.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=110;
int n,a[N],sum,num,ans1=1;
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd(),num+=a[i];
sum=a[1];
for(rint i=2;i<=n;++i)if(a[i]*2<=a[1])sum+=a[i],++ans1;
if(sum*2<=num)return puts("0"),0;
printf("%d\n1",ans1);
for(rint i=2;i<=n;++i)if(a[i]*2<=a[1])printf(" %d",i);
return 0;
}```
CF1091B New Year and the Treasure Geolocation.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define F(i,l,r) for(int i=l;i<=r;++i)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,a,b,sa,sb;
signed main() {
n=rd();
for(int i=1;i<=2*n;++i) {
a=rd(),b=rd();
sa+=a,sb+=b;
}
printf("%lld %lld\n",sa/n,sb/n);
return 0;
}```
CF1421E Swedish Heroes.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
typedef double db;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
int n, a[N], dp[N][3][2][2];//pos=i,2'-'+'+',+1-0,continueop
void ckmax(int&x, int y){if (x < y) x = y; }
signed main() {
n = read();
for (int i = 1; i <= n; ++ i) a[i] = read();
if (n == 1) return printf("%lld\n", a[1]), 0;
memset(dp, -0x3f, sizeof(dp));
dp[1][2][0][0] = - a[1], dp[1][1][1][0] = a[1];
for (int i = 1; i < n; ++ i) {
for (int j = 0; j < 3; ++ j) {
ckmax(dp[i + 1][(j + 1) % 3][1][1], max(dp[i][j][1][0], max(dp[i][j][1][1], dp[i][j][0][1])) + a[i + 1]);
ckmax(dp[i + 1][(j + 1) % 3][1][0], dp[i][j][0][0] + a[i + 1]);
ckmax(dp[i + 1][(j + 2) % 3][0][1], max(dp[i][j][0][0], max(dp[i][j][0][1], dp[i][j][1][1])) - a[i + 1]);
ckmax(dp[i + 1][(j + 2) % 3][0][0], dp[i][j][1][0] - a[i + 1]);
}
}
printf("%lld\n",max(dp[n][1][0][1], dp[n][1][1][1]));
return 0;
}```
P3565 [POI2014]HOT-Hotels.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n;
struct edge{int nx,to;}e[N<<1];
int hed[N],et;
inline void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
LL *f[N],*g[N],pool[N<<2],*mem=pool,ans;
int son[N],len[N];
void dfs1(int u,int ft){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u);
if(len[v]>len[son[u]])son[u]=v;
}
len[u]=len[son[u]]+1;
}
void dfs2(int u,int ft){
if(son[u])f[son[u]]=f[u]+1,g[son[u]]=g[u]-1,dfs2(son[u],u);
f[u][0]=1,ans+=g[u][0];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft||v==son[u])continue;
f[v]=mem,mem+=len[v]+1,mem+=len[v]-1,g[v]=mem,mem+=len[v]+1;
dfs2(v,u);
for(int j=0;j<len[v];++j){
ans+=g[u][j+1]*f[v][j];
if(j)ans+=f[u][j-1]*g[v][j];
}
for(int j=0;j<len[v];++j){
g[u][j+1]+=f[u][j+1]*f[v][j];
if(j)g[u][j-1]+=g[v][j];
f[u][j+1]+=f[v][j];
}
}
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dfs1(1,0);
f[1]=mem,mem+=len[1]+1,mem+=len[1]-1,g[1]=mem,mem+=len[1]+1;
dfs2(1,0);
cout<<ans<<'\n';
}```
P2598 [ZJOI2009]狼和羊的故事.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=105;
const int N=K*K;
const int M=N*5*2;
const int inf=0x3f3f3f3f;
int n,m,a[K][K];
int dis[N],cur[N],mf,S,T,hed[N],et=1,control=0;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){
if(control)cerr<<u<<' '<<v<<' '<<fl<<'\n';
addedge(u,v,fl),addedge(v,u,0);
}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
int id(int x,int y){return (x-1)*m+y;}
signed main(){
n=read(),m=read(),S=n*m+1,T=S+1;
rep(i,1,n)rep(j,1,m){
a[i][j]=read();
if(a[i][j]==1)adde(S,id(i,j),inf);
else if(a[i][j]==2)adde(id(i,j),T,inf);
if(i>1)adde(id(i,j),id(i-1,j),1);
if(i<n)adde(id(i,j),id(i+1,j),1);
if(j>1)adde(id(i,j),id(i,j-1),1);
if(j<m)adde(id(i,j),id(i,j+1),1);
}
while(bfs(S,T))mf+=dfs(S,inf);
printf("%d\n",mf);return 0;
}```
P4516 [JSOI2018]潜入行动.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
const int mod=1e9+7;
void fmod(int&x){x-=mod,x+=x>>31&mod;}
struct edge{int nxt,to;}e[N<<1];
int num_edge,head[N];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
int n,k,dp[N][105][2][2],cpy[105][2][2],siz[N];
//dp[root][used][choose?][controled?]
void dfs(int u,int ft){
siz[u]=1;
dp[u][0][0][0]=1,dp[u][1][1][0]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
dfs(v,u);
for(int j=0,up=std::min(siz[u],k);j<=up;++j)
cpy[j][0][0]=dp[u][j][0][0],dp[u][j][0][0]=0,
cpy[j][0][1]=dp[u][j][0][1],dp[u][j][0][1]=0,
cpy[j][1][0]=dp[u][j][1][0],dp[u][j][1][0]=0,
cpy[j][1][1]=dp[u][j][1][1],dp[u][j][1][1]=0;
for(int j=0,up1=std::min(k,siz[u]);j<=up1;++j)
for(int l=0,up2=std::min(k-j,siz[v]);l<=up2;++l){
fmod(dp[u][j+l][0][0]+=1ll*cpy[j][0][0]*dp[v][l][0][1]%mod),
fmod(dp[u][j+l][0][1]+=1ll*cpy[j][0][1]*(1ll*(dp[v][l][1][1]+dp[v][l][0][1])%mod)%mod),
fmod(dp[u][j+l][0][1]+=1ll*cpy[j][0][0]*dp[v][l][1][1]%mod),
fmod(dp[u][j+l][1][0]+=1ll*cpy[j][1][0]*((dp[v][l][0][1]+dp[v][l][0][0])%mod)%mod),
fmod(dp[u][j+l][1][1]+=1ll*cpy[j][1][1]*(1ll*dp[v][l][0][0]+1ll*dp[v][l][0][1]+1ll*dp[v][l][1][0]+1ll*dp[v][l][1][1])%mod),
fmod(dp[u][j+l][1][1]+=1ll*cpy[j][1][0]*((dp[v][l][1][1]+dp[v][l][1][0])%mod)%mod);
}
siz[u]+=siz[v];
}
}
signed main(){
n=read(),k=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
dfs(1,0),printf("%d\n",(dp[1][k][0][1]+dp[1][k][1][1])%mod);
return 0;
}```
CF576E Painting Edges.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=52;
const int N=500005;
const int T=N<<2;
int n,m,k,q,a[N],b[N],e[N],c[N],lst[N],fir[N],ans[N],ed[N];
struct DSU{
vector<int>stk;
int F[N<<1],siz[N<<1],tim;
void init(const int&n){rep(i,1,n)F[i]=i,siz[i]=1;}
inline int anc(int x){while(x!=F[x])x=F[x];return x;}
void merge(int x,int y){
x=anc(x),y=anc(y);
if(x==y)return;
if(siz[x]<siz[y])x^=y^=x^=y;
siz[x]+=siz[y],F[y]=x,stk.pb(y);
}
void undo(){
int x=stk.back();stk.pop_back();
siz[F[x]]-=siz[x],F[x]=x;
}
}dsu[K];
vector<pair<int,int> >upd[T];
#define lc (p<<1)
#define rc (p<<1|1)
void update(int ql,int qr,pair<int,int>d,int l=1,int r=q,int p=1){
if(ql>qr)return;
// cerr<<"update:"<<ql<<' '<<qr<<' '<<d.fi<<' '<<d.se<<' '<<l<<' '<<r<<' '<<p<<'\n';
if(ql<=l&&r<=qr)return upd[p].pb(d),void();
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,d,l,mid,lc);
if(mid<qr)update(ql,qr,d,mid+1,r,rc);
}
void solve(int l,int r,int p){
// cerr<<"solve:"<<l<<' '<<r<<'\n';
int nwsz[K],mid=(l+r)>>1;
rep(i,1,k)nwsz[i]=sz(dsu[i].stk);
for(pair<int,int>i:upd[p]){
int id=i.fi,cc=i.se,x=a[e[id]],y=b[e[id]];
dsu[cc].merge(x+n,y),dsu[cc].merge(x,y+n);
}
if(l==r){
int x=a[e[l]],y=b[e[l]],cc;
if(dsu[c[l]].anc(x)==dsu[c[l]].anc(y))cc=fir[e[l]],ans[l]=0;
else cc=c[l],fir[e[l]]=c[l],ans[l]=1;
if(cc)update(l+1,ed[l],mkp(l,cc));
}else solve(l,mid,lc),solve(mid+1,r,rc);
rep(i,1,k)while(sz(dsu[i].stk)>nwsz[i])dsu[i].undo();
}
signed main(){
n=read(),m=read(),k=read(),q=read();
rep(i,1,m)a[i]=read(),b[i]=read();
rep(i,1,q){
e[i]=read(),c[i]=read();
if(lst[e[i]])ed[lst[e[i]]]=i-1;
lst[e[i]]=i;
}
rep(i,1,m)if(lst[i]&&lst[i]<q)ed[lst[i]]=q;
rep(i,1,k)dsu[i].init(n<<1);
solve(1,q,1);
rep(i,1,q)puts(ans[i]?"YES":"NO");
}```
AT3607 Distribute Numbers.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,k,tot,a[2005][2005];
signed main(){
// freopen("1.out","w",stdout);
n=38*37+1,k=38;
printf("%d %d\n",n,k);
tot=1;
rep(i,0,k-1){
printf("%d ",a[i][0]=1);
rep(j,1,k-1)printf("%d ",a[i][j]=++tot);
puts("");
}
int c=0,d=1371;
for(int i=0;i<k-1;++i){
for(int l=0;l<k-1;++l){
for(int j=0,t=l;j<k;++j,t=(t+i)%(k-1)){
if(j==k-1){
if(c==k-1)c=0,++d;
printf("%d ",d),++c;
}else printf("%d ",a[j][t+1]);
}
puts("");
}
}
}```
CF1268B Domino for Young.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300009;
int n,a[N],cnt[2];
LL ans;
signed main() {
n=rd();
for(int i=1;i<=n;++i) {
a[i]=rd();
if(a[i]&1)++cnt[i&1];
ans+=a[i]/2;
}
ans+=min(cnt[0],cnt[1]);
printf("%lld\n",ans);
return 0;
}```
扩展卢卡斯.cpp
```#define int long long
const int N=1000010;
const int M=1010;
int n,m,mod;
int A[M],B[M];
int qpow(int n,int k,int mod) {
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod,k>>=1;
}
return res;
}
int mul(int a,int b,int mod) {
int res=0;
while(b) {
if(b&1)res=(res+a)%mod;
a=(a+a)%mod,b>>=1;
}
return res;
}
void exgcd(int a,int b,int &d,int &x,int &y) {
if(!b){x=1,y=0,d=a;return;}
exgcd(b,a%b,d,y,x),y-=a/b*x;
}
int inv(int x,int mod) {
int a,b,d;
exgcd(x,mod,d,a,b);
return (a%mod+mod)%mod;
}
int F(int n,int m,int k) {
if(!n)return 1;
int cyc=1,rem=1;
for(int i=1;i<=k;++i)
if(i%m)cyc=cyc*i%k;
cyc=qpow(cyc,n/k,k);
for(int i=k*(n/k);i<=n;++i)
if(i%m)rem=rem*(i%k)%k;
return F(n/m,m,k)*cyc%k*rem%k;
}
int G(int n,int m) {
if(n<m)return 0;
return n/m+G(n/m,m);
}
int solve(int n,int m,int f,int k) {
int fz=F(n,f,k),fm1=inv(F(m,f,k),k),fm2=inv(F(n-m,f,k),k),index=G(n,f)-G(m,f)-G(n-m,f);
return fz*fm1%k*fm2%k*qpow(f,index,k)%k;
}
int excrt(int n) {
int lcm=A[1],res=B[1],x,y,a,b,c,d,tmp;
for(int i=2;i<=n;++i) {
a=lcm,b=A[i],c=(B[i]-res%b+b)%b;
exgcd(a,b,d,x,y),tmp=b/d;
if(c%d)return -1;
x=x*(c/d)%tmp;
res+=x*lcm;
lcm*=tmp;
res=(res%lcm+lcm)%lcm;
}
return res;
}
int exLucas(int n,int m,int mod) {
int t=mod,tot=0;
for(int i=2;i*i<=mod;++i) {
if(t%i==0) {
int k=1;
while(t%i==0)t/=i,k*=i;
++tot,A[tot]=k,B[tot]=solve(n,m,i,k);
}
}
if(t>1)++tot,A[tot]=t,B[tot]=solve(n,m,t,t);
return excrt(tot);
}
signed main() {
n=rd(),m=rd(),mod=rd();
printf("%lld\n",exLucas(n,m,mod));
return 0;
}```
P6788 「EZEC-3」四月樱花.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
typedef unsigned int uint;
uint t,mod,ans=1;
inline uint qpow(uint n,uint k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
uint f(uint n){
uint res=0;
for(uint l=1,r;l<=n;l=r+1)
r=n/(n/l),(res+=1ll*(n/l)*(r-l+1))%=mod-1;
return res;
}
signed main(){
cin>>t>>mod;
for(uint l=1,r;l<=t;l=r+1)
r=t/(t/l),ans=1ll*ans*qpow(1ll*l*qpow(r+1,mod-2)%mod,f(t/l))%mod;
ans=1ll*ans*ans%mod;
cout<<ans<<'\n';
return 0;
}```
CF1027B Numbers on the Chessboard.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,q;
signed main() {
n=rd(),q=rd();
while(q--) {
int x=rd(),y=rd(),t=0;
if((x+y)%2==0) {
if(n%2==0)t=n/2*(x-1)+(y+1)/2;
else {
if(x%2==1)t=n*(x/2)+(y+1)/2;
else t=n*(x/2-1)+n/2+1+(y+1)/2;
}
printf("%lld\n",t);
} else {
if(n%2==0)t=n/2*(x-1)+(y+1)/2;
else {
if(x%2==1)t=n*(x/2)+(y+1)/2;
else t=n*(x/2-1)+n/2+(y+1)/2;
}
printf("%lld\n",t+(n*n+1)/2);
}
}
}
```
CF1042F Leaf Sets.cpp
```#include<bits/stdc++.h>
using namespace std;
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1000009
int n,k,ans=1,mxd[N];
vector<int>g[N];
void dfs(int u,int ft) {
if(g[u].size()==1)return mxd[u]=0,void();
vector<int>a;
for(int v:g[u])if(v!=ft)dfs(v,u),a.push_back(mxd[v]+1);
sort(a.begin(),a.end());
while(a.size()>1) {
if(a[a.size()-1]+a[a.size()-2]<=k)break;
++ans,a.pop_back();
}
mxd[u]=a.back();
}
signed main() {
n=rd(),k=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].push_back(y);
g[y].push_back(x);
}
for(int i=1;i<=n;++i)
if(g[i].size()>1){dfs(i,0),printf("%d\n",ans);return 0;}
} ```
P7023 [NWRRC2017]Equal Numbers.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int n,a[N],cnt[N],f[N],tot,ans[N];
signed main(){
n=read();
rep(i,1,n)++cnt[a[i]=read()];
int now=0;
for(int i=1;i<N;++i)if(cnt[i])++now;
for(int i=1;i<N;++i){
if(!cnt[i])continue;
for(int j=2;i*j<N;++j)
if(cnt[i*j]){f[++tot]=cnt[i];break;}
}
sort(f+1,f+tot+1);
// rep(i,1,tot)cout<<f[i]<<' ';cout<<'\n';
sort(cnt+1,cnt+N);
ans[0]=now;
for(int i=1,j=1,t=now+1;i<N;++i){
if(!cnt[i])continue;
for(int k=1;k<cnt[i];++k)ans[j++]=min(t,now);
ans[j++]=--t;
}
// rep(i,0,n)cerr<<ans[i]<<' ';cerr<<'\n';
for(int i=1,j=1;i<=tot;++i){
for(int k=1;k<f[i];++k)ckmin(ans[j++],now);
ckmin(ans[j++],--now);
}
rep(i,1,n)ckmin(ans[i],ans[i-1]);
rep(i,0,n)printf("%d ",ans[i]);
return 0;
}
/*
6
3 6 4 8 5 10
5
1 2 4 8 16
4
1 2 3 9
*/```
CF1120D Power Tree.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
int n, w[N], deg[N], num[N];
vector <int> ans;
LL dp[N][2], sum[N], g[N];
int hed[N], et;
bool lef[N], can[N][2];
struct edge { int nx, to; }e[N << 1];
void adde(int u, int v) { e[++ et].nx = hed[u], e[et].to = v, hed[u] = et; }
void dfs(int u, int ft) {
if (deg[u] == 1 && u != 1) {
dp[u][0] = w[u], dp[u][1] = 0, lef[u] = 1;
return;
}
LL mx = 0;
for (int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to; if (v == ft) continue;
dfs(v, u);
sum[u] += dp[v][0];
if(mx < dp[v][0] - dp[v][1]) mx = dp[v][0] - dp[v][1], g[u] = mx, num[u] = 1;
else if (mx == dp[v][0] - dp[v][1]) ++ num[u];
}
dp[u][1] = sum[u] - mx;
dp[u][0] = min(dp[u][1] + w[u], sum[u]);
}
void calc(int u, int ft) {
if (can[u][0] && dp[u][0] == dp[u][1] + w[u]) ans.pb(u);
for (int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to; if (v == ft) continue;
if (can[u][0]) {
if (sum[u] - dp[v][0] + dp[v][1] + w[u] == dp[u][0]) can[v][1] = 1;
if (sum[u] == dp[u][0] || g[u] != dp[v][0] - dp[v][1] || num[u] > 1) can[v][0] = 1;
}
if (can[u][1]) {
if (g[u] == dp[v][0] - dp[v][1]) can[v][1] = 1;
if (g[u] != dp[v][0] - dp[v][1] || num[u] > 1) can[v][0] = 1;
}
calc(v, u);
}
}
signed main() {
n=read();
rep (i, 1, n) w[i] = read();
rep (i, 2, n) {
int x = read(), y = read();
adde(x, y), adde(y, x), ++ deg[x], ++ deg[y];
}
dfs(1, 0), can[1][0] = 1, can[1][1] = dp[1][0] == dp[1][1] + w[1], calc(1, 0);
// rep(i, 1, n) cerr << sum[i] << ' '; cerr << '\n';
// rep(i, 1, n) cerr << g[i] << ' '; cerr << '\n';
// rep(i, 1, n) cerr << dp[i][0] << ' ' << dp[i][1] << '\n';
printf("%lld %d\n",dp[1][0], sz(ans));
sort(ans.begin(), ans.end());
rep(i, 0, sz(ans) - 1) printf("%d ", ans[i]);
puts("");
return 0;
}```
CF1406C Link Cut Centroids.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,a[N],siz[N],mx[N],r1,r2;
vector<int>e[N];
void dfs1(int u,int ft) {
siz[u]=1,mx[u]=0;
for(int v:e[u])if(v!=ft)
dfs1(v,u),siz[u]+=siz[v],mx[u]=max(mx[u],siz[v]);
mx[u]=max(mx[u],n-siz[u]);
if(mx[u]<mx[r1])r1=u,r2=0;
else if(mx[u]==mx[r1])r2=u;
}
void Main() {
n=rd(),r1=r2=0,mx[0]=n;
for(int i=1;i<=n;++i) {
vector<int>fyyAKIOI;
e[i].swap(fyyAKIOI);
}
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
e[x].push_back(y),e[y].push_back(x);
}
dfs1(1,0);
if(!r2)printf("%d %d\n%d %d\n",1,e[1][0],1,e[1][0]);
else {
int t=0;
for(int v:e[r1])if(v!=r2){t=v;break;}
printf("%d %d\n%d %d\n",t,r1,t,r2);
}
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
AT1219 歴史の研究.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int inf=2000000010;
int a[N],n,m;
int b[N],lsh[N],len,bin[N],bel[N],L[N],R[N],size,num,Bin[N];
LL sum,ans[N];
struct QUE {
int l,r,id;
}que[N];
inline bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?bel[a.l]<bel[b.l]:a.r<b.r;
}
void brute(int l,int r,int x) {
LL res=0;
for(rint i=l;i<=r;++i)++Bin[b[i]];
for(rint i=l;i<=r;++i)res=max(res,1ll*Bin[b[i]]*a[i]);
for(rint i=l;i<=r;++i)--Bin[b[i]];
ans[x]=res;
}
void pop(int x) {--bin[b[x]];}
void add(int x,LL &sum) {sum=max(sum,1ll*(++bin[b[x]])*a[x]);}
signed main() {
n=rd(),m=rd(),size=sqrt(n),num=(n-1)/size+1;
for(rint i=1;i<=n;++i)lsh[++len]=a[i]=rd();
for(rint i=1;i<=m;++i)que[i].l=rd(),que[i].r=rd(),que[i].id=i;
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
for(rint i=1;i<=n;++i)b[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
for(rint i=1;i<=n;++i)bel[i]=(i-1)/size+1;
for(rint i=1;i<=num;++i)L[i]=(i-1)*size+1,R[i]=i*size;R[num]=n;
sort(que+1,que+m+1,cmp);
for(rint i=1,l=1,r=0,lst=0;i<=m;++i) {
if(bel[que[i].l]==bel[que[i].r]) {brute(que[i].l,que[i].r,que[i].id);continue;}
if(lst!=bel[que[i].l]) {
while(r>R[bel[que[i].l]])pop(r--);
while(l<R[bel[que[i].l]]+1)pop(l++);
sum=0,lst=bel[que[i].l];
}
while(r<que[i].r)add(++r,sum);
int l_=l;LL tmp=sum;
while(l_>que[i].l)add(--l_,tmp);
ans[que[i].id]=tmp;
while(l_<l)pop(l_++);
}
for(rint i=1;i<=m;++i)printf("%lld\n",ans[i]);
return 0;
}```
P1263 宫廷守卫.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
typedef long long LL;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=210;
const int M=40010;
struct edge {
int to,nxt;
}e[N*N];
int num_edge,head[M];
int m,n,cas[N][N],ans;
int id[2][N][N],n1,n2,match[M];
bool vis[M];
void addedge(int from,int to) {
++num_edge,e[num_edge].nxt=head[from],e[num_edge].to=to,head[from]=num_edge;
}
int dfs(int u) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!vis[v]) {
vis[v]=1;
if(!match[v]||dfs(match[v])) {
match[v]=u;return 1;
}
}
}
return 0;
}
signed main() {
m=rd(),n=rd();
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
cas[i][j]=rd();
for(rint i=1;i<=m;++i)cas[i][0]=2;
for(rint i=1;i<=n;++i)cas[0][i]=2;
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
if(cas[i][j]!=2) {
if(cas[i][j-1]==2)id[0][i][j]=++n1;
else id[0][i][j]=id[0][i][j-1];
}
for(rint j=1;j<=n;++j)
for(rint i=1;i<=m;++i)
if(cas[i][j]!=2) {
if(cas[i-1][j]==2)id[1][i][j]=++n2;
else id[1][i][j]=id[1][i-1][j];
}
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
if(!cas[i][j])addedge(id[0][i][j],id[1][i][j]);
for(rint i=1;i<=n1;++i)
fill(vis+1,vis+n2+1,0),ans+=dfs(i);
printf("%d\n",ans);
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
if(!cas[i][j]&&id[0][i][j]==match[id[1][i][j]])printf("%d %d\n",i,j);
return 0;
}
```
P2458 [SDOI2006]保安站岗.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=2005;
int f[N][3],v[N],root=1,n;
vector<int>g[N];
bool vis[N];
//f[i][0]当前节点父亲监视
//f[i][1]当前节点儿子监视
//f[i][2]当前节点放守卫
void DP(int u)
{
int d=1000000007;
for(int i=0;i<g[u].size();++i)
{
int v=g[u][i];
DP(v);
f[u][0]+=min(f[v][1],f[v][2]);
f[u][1]+=min(f[v][1],f[v][2]);
d=min(d,f[v][2]-min(f[v][2],f[v][1]));
f[u][2]+=min(f[v][0],min(f[v][1],f[v][2]));
}
f[u][2]+=v[u];
f[u][1]+=d;
}
int main()
{
scanf("%d",&n);
for(int i=1,m,x;i<=n;++i)
{
scanf("%d",&x);
scanf("%d%d",&v[x],&m);
for(int j=1,y;j<=m;++j)
{
scanf("%d",&y);
g[x].push_back(y);
vis[y]=true;
}
}
while(vis[root])++root;
DP(root);
printf("%d\n",min(f[root][1],f[root][2]));
return 0;
}
```
CF1138A Sushi for Two.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100009;
int n,a[N],nxt[N][2],ans;
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd()-1;
nxt[n][0]=n+1,nxt[n][1]=n+1;
for(int i=n;i>=1;--i)
nxt[i-1][0]=nxt[i][0],nxt[i-1][1]=nxt[i][1],nxt[i-1][a[i]]=i;
for(int i=1;i<=n;++i) {
int x=nxt[i][!a[i]],y=nxt[x][a[i]];
ans=max(ans,2*min(x-i,y-x));
}
printf("%lld\n",ans);
return 0;
}```
CF1081C Colorful Bricks.cpp
```// Problem: C. Colorful Bricks
// Contest: Codeforces - Avito Cool Challenge 2018
// URL: https://codeforces.com/contest/1081/problem/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2005;
#define mod 998244353
int dp[N][N],n,m,k;
signed main(){
n=read(),m=read(),k=read();
dp[1][0]=m;
rep(i,2,n){
rep(j,0,min(i-1,k)){
dp[i][j]=(dp[i-1][j]+1ll*dp[i-1][j-1]*(m-1)%mod)%mod;
}
}
printf("%d\n",dp[n][k]);
return 0;
}```
P3312 [SDOI2014]数表.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline unsigned read() {
unsigned x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 20005;
const int M = 100005;
const int mod = 1ll << 31;
int ans[N], tr[M];
bool vis[M];
int mu[M], pri[M], cnt, q, it = 1;
struct node {
int n, m, a, id;
inline bool operator<(const node&rhs)const{return a < rhs.a;}
}a[N];
struct fact {
int id, x;
inline bool operator<(const fact&rhs)const{return x < rhs.x;}
}f[M];
void add(int x, int d) {
for (int i = x; i < M; i += i & -i) tr[i] += d;
}
int ask(int x) {
int res = 0;
for (int i = x; i > 0; i -= i & -i) res += tr[i];
return res;
}
void Sieve() {
mu[1] = 1;
for (int i = 2; i < M; ++ i) {
if (! vis[i]) pri[++ cnt] = i, mu[i] = -1;
for (int j = 1; i * pri[j] < M; ++ j) {
vis[i * pri[j]] = 1;
if(i % pri[j] == 0) break;
mu[i * pri[j]] = - mu[i];
}
}
for (int i = 1; i < M; ++ i)
for (int j = 1; i * j < M; ++ j)
f[i * j].x += i;
for(int i = 1; i < M; ++ i) f[i].id = i;
sort(f + 1, f + M);
}
signed main() {
Sieve();
q = read();
for (int i = 1; i <= q; ++ i)
a[i].n = read(), a[i].m = read(), a[i].a = read(), a[i].id = i;
sort(a + 1, a + q + 1);
for (int i = 1; i <= q; ++ i) {
while (it < M && f[it].x <= a[i].a) {
int t = f[it].id;
for (int j = 1; j * t < M; ++ j) add(j * t, f[it].x * mu[j]);
++ it;
}
int res = 0, n = a[i].n, m = a[i].m;
if (n > m) swap(n, m);
for (int l = 1, r; l <= n; l = r + 1)
r = min(n / (n / l), m / (m / l)), res += (n / l) * (m / l) * (ask(r) - ask(l - 1));
ans[a[i].id] = res;
}
for (int i = 1; i <= q; ++ i) printf("%lld\n", ans[i] % mod);
return 0;
}
/*
1
25291 26958 42646
235628669
*/```
P4555 [国家集训队]最长双回文串.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,pre[N],suf[N],ans;
int len[N],tot,las,fail[N],tr[N][26];
char str[N];
inline int getfail(int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
signed main(){
scanf("%s",str),n=strlen(str);
len[0]=0,fail[0]=1,len[1]=-1,fail[1]=0,tot=1,las=0;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=getfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[getfail(fail[f],i)][c];
len[tot]=len[f]+2;
tr[f][c]=tot;
}
las=tr[f][c],pre[i]=len[las];
}
memset(tr,0,sizeof(tr)),memset(fail,0,sizeof(fail));
memset(len,0,sizeof(len)),reverse(str,str+n);
len[0]=0,fail[0]=1,len[1]=-1,fail[1]=0,tot=1,las=0;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=getfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[getfail(fail[f],i)][c];
len[tot]=len[f]+2;
tr[f][c]=tot;
}
las=tr[f][c],suf[n-i-1]=len[las];
}
for(int i=0;i<n-1;++i)ckmax(ans,pre[i]+suf[i+1]);
cout<<ans<<'\n';
}```
P4091 [HEOI2016 TJOI2016]求和.cpp
```// Problem: P4091 [HEOI2016/TJOI2016]求和
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P4091
// Memory Limit: 125 MB
// Time Limit: 3000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
const int M = N << 2;
#define mod 998244353
int n, A[M], B[M], ans;
namespace math{
int fac[N], ifc[N], inv[N];
inline int qpow(int n, int k) {
int res = 1;
for (; k; k >>= 1, n = 1ll * n * n % mod)
if (k & 1) res = 1ll * n * res % mod;
return res;
}
void initmath(const int &n = N - 1) {
fac[0] = 1; rep(i, 1, n) fac[i] = 1ll * fac[i - 1] * i % mod;
ifc[n] = qpow(fac[n], mod - 2); per(i, n - 1, 0) ifc[i] = 1ll * ifc[i + 1] * (i + 1) % mod;
inv[1] =1; rep(i, 2, n) inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
}
}
using namespace math;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int &n) {
for (lg = 0, lim = 1; lim < n; ++lg, lim <<= 1);
for (int i = 0; i < lim; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (lg - 1));
}
void NTT(int *a, int op) {
for (int i = 0; i < lim; ++i)
if (i > rev[i]) swap(a[i], a[rev[i]]);
const int g = op ? 3 : inv[3];
for (int i = 1; i < lim; i <<= 1) {
const int wn = qpow(g, (mod - 1) / (i << 1));
for (int j = 0; j < lim; j += i << 1) {
int w0 = 1;
for (int k = 0; k < i; ++k, w0 = 1ll * w0 * wn % mod) {
const int X = a[j + k], Y = 1ll * w0 * a[i + j + k] % mod;
a[j + k] = (X + Y) % mod, a[i + j + k] = (X - Y + mod) % mod;
}
}
}
if (op) return; const int ilim = qpow(lim, mod - 2);
for (int i = 0; i < lim; ++i) a[i] = 1ll * a[i] * ilim % mod;
}
#define clr(a, n) memset(a, 0, sizeof(int) * (n))
#define cpy(a, b, n) memcpy(a, b, sizeof(int) * (n))
void poly_mul(int *f, int *g, int *ans, int n, int m) {
static int A[M], B[M]; init_poly(n + m);
cpy(A, f, n), clr(A + n, lim - n), NTT(A, 1);
cpy(B, g, m), clr(B + m, lim - m), NTT(B, 1);
for (int i = 0; i < lim; ++i) ans[i] = 1ll * A[i] * B[i] % mod;
NTT(ans, 0);
}
}
signed main(){
initmath();
n = read();
for (int i = 0; i <= n; ++i) A[i] = i & 1 ? mod - ifc[i] : ifc[i];
for (int i = 0; i <= n; ++i){
if (i == 1) B[i] = n + 1;
else B[i] = 1ll * (qpow(i, n + 1) - 1) * qpow(1ll * fac[i] * (i - 1) % mod, mod - 2) % mod;
}
poly::poly_mul(A, B, A, n + 1, n + 1);
for (int i = 0, j = 1; i <= n; ++i, j = j * 2 % mod) ans = (ans + 1ll * j * fac[i] % mod * A[i] % mod) % mod;
printf("%d\n", ans);
return 0;
}```
CF566E Restoring Map.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
bitset<N>bs[N],nr[N],nw[N];
int n,m,rt,id[N],sz[N];
bool vis[N],used[N];
vector<int>e[N];
signed main(){
n=read();
if(n==2)return puts("1 2"),0;
rep(i,1,n){
sz[i]=read();
rep(t,1,sz[i])bs[i][read()]=1;
}
rep(i,1,n)rep(j,i+1,n){
bitset<N>tmp=bs[i]&bs[j];
if(tmp.count()==2){
int x=tmp._Find_first(),y=tmp._Find_next(x);
if(!nr[x][y])e[x].pb(y),e[y].pb(x),nr[x][y]=1,nr[y][x]=1,cerr<<"edge:"<<x<<' '<<y<<'\n';
if(!vis[x])++m,vis[x]=1,nr[x][x]=1;
if(!vis[y])++m,vis[y]=1,nr[y][y]=1;
}
}
cerr<<"m="<<m<<'\n';
if(m==0){
rep(i,2,n)printf("%d %d\n",i,1);
return 0;
}
if(m==2){
int r1=0,r2=0;
for(int i=1;i<=n;++i)if(vis[i]){
if(!r1)r1=i;else r2=i;
}
rep(i,1,n)if(sz[i]!=n){
rep(j,1,n)if(j!=r1){
if(bs[i][j])printf("%d %d\n",j,r1);
else printf("%d %d\n",j,r2);
}
break;
}
return 0;
}
// cerr<<"vis:";rep(i,1,n)cerr<<vis[i];cerr<<'\n';
rep(i,1,n){
nw[i]=bs[i];
rep(j,1,n)if(!vis[j])nw[i][j]=0;
}
// cerr<<"nr:\n";
// rep(i,1,n){
// if(!vis[i])continue;
// cerr<<i<<":";rep(j,1,n)cerr<<nr[i][j];cerr<<'\n';
// }
// cerr<<"nw:\n";
// rep(i,1,n){
// cerr<<i<<":";rep(j,1,n)cerr<<nw[i][j];cerr<<'\n';
// }
// cerr<<"bs:\n";
// rep(i,1,n){
// cerr<<i<<":";rep(j,1,n)cerr<<bs[i][j];cerr<<'\n';
// }
for(int i=1;i<=n;++i){
if(vis[i])continue;
int id=-1;
for(int j=1;j<=n;++j)
if(!used[j]&&bs[j][i]&&(!~id||sz[j]<sz[id]))id=j;
used[id]=1;
for(int j=1;j<=n;++j)
if(vis[j]&&nr[j]==nw[id]){e[i].pb(j),e[j].pb(i);break;}
}
rep(u,1,n)for(int v:e[u])
if(u<v)printf("%d %d\n",u,v);
return 0;
}
/*
12
7 1 2 3 4 5 6 7
8 1 2 7 8 9 10 11 12
6 1 2 3 4 5 6
4 2 3 4 5
4 1 2 3 6
7 1 2 3 6 7 8 9
5 7 8 10 11 12
4 2 3 4 5
7 1 7 8 9 10 11 12
5 7 8 10 11 12
5 7 8 10 11 12
4 1 7 8 9
*/```
CF528D Fuzzy Search.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=530005;
const int mod=998244353;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;
return res;
}
const int G=3;
const int IG=qpow(G,mod-2);
int n,m,k,sum[N],ans,A[M],B[M];
char s1[N],s2[N];
int lim,lg,rev[M];
void init(int n){
for(lg=0,lim=1;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int g,int op=0){
for(int i=0;i<lim;++i)if(i>rev[i])std::swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(!op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
void calc(char ch){
memset(A,0,sizeof(A)),memset(B,0,sizeof(B));
for(int i=0;i<n;++i){
if(s1[i]==ch){
A[i]=1;
for(int j=i-1;j>=i-k&&j>=0&&!A[j];--j)A[j]=1;
for(int j=std::min(n-1,i+k);j>=i+1&&!A[j];--j)A[j]=1;
}
}
for(int i=0;i<m;++i)B[i]=s2[m-i-1]==ch;
NTT(A,G),NTT(B,G);
for(int i=0;i<lim;++i)A[i]=1ll*A[i]*B[i]%mod;
NTT(A,IG,1);
for(int i=0;i<n;++i)sum[i]+=A[i];
}
signed main(){
n=read(),m=read(),k=read(),scanf("%s%s",s1,s2);
init(n+m);
calc('A'),calc('G'),calc('C'),calc('T');
for(int i=0;i<n;++i)if(sum[i]==m)++ans;
printf("%d\n",ans);
}```
CF1265E Beautiful Mirrors.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int long long
#define rint register int
#define pb push_back
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=998244353;
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=1ll*res*n%mod;
n=1ll*n*n%mod,k>>=1;
}
return res;
}
int n,ans;
signed main() {
n=rd();
for(rint i=1;i<=n;++i) {
int x=rd();
ans=(ans+1)*100%mod*qpow(x,mod-2)%mod;
}
printf("%lld\n",ans);
return 0;
}```
P1012 拼数.cpp
```#include<bits/stdc++.h>
using namespace std;
bool cmp(string a,string b)
{
return a+b>b+a;
}
int main()
{
string s[1005];
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>s[i];
}
sort(s+1,s+n+1,cmp);
for(int i=1;i<=n;i++)
cout<<s[i];
return 0;
}```
P4768 [NOI2018]归程.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int M=400010;
const int inf=2e9;
struct node {
int u,v,l,a;
}a[M];
bool cmp(const node &a,const node &b) {
return a.a>b.a;
}
struct edge {
int nxt,to,val;
}e[M<<1];
int T,n,m,Q,K,S,lastans;
int fa[N<<1],cnt;
int dis[N],vis[N];
int bz[20][N<<1];
int val[N<<1],ans[N<<1];
int head[N<<1],num_edge;
void addedge(int fr,int to,int v=0) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=v;
head[fr]=num_edge;
}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
struct DIS {
int u,dis;
bool operator < (const DIS &rhs)const{return dis>rhs.dis;}
DIS(){}
DIS(int a,int b){u=a,dis=b;}
};
void dij() {
priority_queue<DIS>q;
for(int i=1;i<=n;++i)dis[i]=inf,vis[i]=0;
q.push(DIS(1,0)),dis[1]=0;
while(!q.empty()) {
DIS now=q.top();q.pop();
int u=now.u;
if(vis[u])continue;
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(dis[v]>dis[u]+e[i].val) {
dis[v]=dis[u]+e[i].val;
if(!vis[v])q.push(DIS(v,dis[v]));
}
}
}
}
void dfs(int u) {
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
dfs(v);
ans[u]=min(ans[u],ans[v]);
}
}
void clear_graph(){
num_edge=0;
memset(head,0,sizeof(head));
}
void clear() {
lastans=0;
cnt=n;
memset(bz,0,sizeof(bz));
}
void solve() {
n=rd(),m=rd();
clear(),clear_graph();
for(int i=1;i<=m;++i) {
a[i].u=rd(),a[i].v=rd(),a[i].l=rd(),a[i].a=rd();
addedge(a[i].u,a[i].v,a[i].l),addedge(a[i].v,a[i].u,a[i].l);
}
dij();
sort(a+1,a+m+1,cmp);
clear_graph();
for(int i=1;i<=n*2;++i)fa[i]=i;
for(int i=1;i<=n;++i)ans[i]=dis[i];
for(int i=n+1;i<=n*2;++i)ans[i]=inf;
for(int i=1;i<=m;++i) {
int fx=find(a[i].u),fy=find(a[i].v);
if(fx!=fy) {
++cnt,val[cnt]=a[i].a;
bz[0][fx]=cnt,bz[0][fy]=cnt;
fa[fx]=fa[fy]=cnt;
addedge(cnt,fx),addedge(cnt,fy);
if(cnt==n*2-1)break;
}
}
for(int i=1;i<=19;++i)
for(int j=1;j<=2*n-1;++j)
bz[i][j]=bz[i-1][bz[i-1][j]];
dfs(cnt);
Q=rd(),K=rd(),S=rd();
while(Q--) {
int v=(rd()+K*lastans-1)%n+1,p=1ll*(1ll*rd()+K*lastans)%(S+1);
for(int i=19;i>=0;--i)
if(bz[i][v]&&val[bz[i][v]]>p)v=bz[i][v];
printf("%d\n",lastans=ans[v]);
}
}
signed main() {
T=rd();
while(T--)solve();
return 0;
}```
P1010 幂次方.cpp
```#include<bits/stdc++.h>
using namespace std;
int power(int n,int k)
{
int base=n,ans=1;
while(k>0)
{
if(k&1)ans*=base;
base*=base;
k>>=1;
}
return ans;
}
void dfs(int n)
{
int x;
for(int i=0;;i++)
{
if(power(2,i)>n)
{
x=i-1;
break;
}
}
if(x==0)printf("2(0)");
if(x==1)printf("2");
if(x>1)
{
printf("2(");
dfs(x);
printf(")");
}
if(n!=power(2,x))
{
printf("+");
dfs(n-power(2,x));
}
}
int main()
{
int n;
scanf("%d",&n);
dfs(n);
return 0;
}```
CF286E Ladies' Shop.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=3000010;
int n,m,p[N],ans;
int A[N],B[N];
const int mod=998244353;
int qpow(int n,int k,int P=mod) {
int res=1;
while(k) {
if(k&1)res=1ll*res*n%P;
n=1ll*n*n%P,k>>=1;
}
return res;
}
const int G=3;
const int IG=qpow(G,mod-2);
int lim,lg,rev[N];
void init(int n) {
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int g,int op=0) {
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1) {
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=(i<<1)) {
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod) {
int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(!op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
signed main() {
n=ans=rd(),m=rd();
for(int i=1;i<=n;++i) {
p[i]=rd();
if(p[i]<=m)A[p[i]]=B[p[i]]=1;
}
init(m<<1),NTT(B,G);
for(int i=0;i<lim;++i)B[i]=1ll*B[i]*B[i]%mod;
NTT(B,IG,1);
for(int i=1;i<=m;++i) {
if(!B[i])continue;
--ans;
if(!A[i])return puts("NO"),0;
}
printf("YES\n%d\n",ans);
for(int i=1;i<=m;++i)if(!B[i]&&A[i])printf("%d ",i);
return 0;
}```
P3642 [APIO2016]烟火表演.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define rint register int
#define pb push_back
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int M=300010;
const int N=M<<1;
int dst[N],ls[N],rs[N],tot;
LL val[N];
int n,m,Fa[N],rt[N],len[N],son[N];
LL ans;
int merge(int x,int y) {
if(!x||!y)return x|y;
if(val[x]<val[y])swap(x,y);
rs[x]=merge(rs[x],y);
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
dst[x]=dst[rs[x]]+1;
return x;
}
signed main() {
n=rd(),m=rd();
for(int i=2;i<=n+m;++i)
Fa[i]=rd(),len[i]=rd(),++son[Fa[i]],ans+=len[i];
for(int i=n+m;i>1;--i) {
LL L=0,R=0;
if(i<=n) {
while(--son[i])rt[i]=merge(ls[rt[i]],rs[rt[i]]);
R=val[rt[i]],rt[i]=merge(ls[rt[i]],rs[rt[i]]);
L=val[rt[i]],rt[i]=merge(ls[rt[i]],rs[rt[i]]);
}
++tot,val[tot]=L+len[i];
rt[i]=merge(rt[i],tot);
++tot,val[tot]=R+len[i];
rt[i]=merge(rt[i],tot);
rt[Fa[i]]=merge(rt[Fa[i]],rt[i]);
}
while(son[1]--)rt[1]=merge(ls[rt[1]],rs[rt[1]]);
while(rt[1])ans-=val[rt[1]],rt[1]=merge(ls[rt[1]],rs[rt[1]]);
printf("%lld\n",ans);
return 0;
}```
P5398 [Ynoi2018]GOSICK.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
char cltout[1<<21],*oh=cltout,*ot=cltout+(1<<21);
inline void pc(char c){
if(oh==ot){
fwrite(cltout,1,1<<21,stdout);
oh=cltout;
}
*oh++=c;
}
inline void write(LL w,char text=-1){
if(!w)pc(48);
else{
int d[20];
for(d[0]=0;w;d[++d[0]]=w%10,w/=10);
for(;d[0];pc(d[d[0]--]^48));
}
if(text>=0)pc(text);
}
const int N=500005;
int n,m,a[N];
int V,S,bin[N],bel[N];
LL pre[N],ans[N];
int tot;
int cnt[N],tim[N];
LL suf[N];
vector<int>d[N];
struct QUE{
int id,l,r;
QUE(){id=l=r=0;}
inline bool operator < (const QUE&t)const{return bel[l]!=bel[t.l]?l<t.l:bel[l]&1?r<t.r:r>t.r;}
}q[N];
struct ASK{
int pos,id,op,l,r;
ASK(){pos=l=r=op=id=0;}
inline bool operator < (const ASK&t)const{return pos<t.pos;}
}qn[N<<1];
void init(){
for(int i=1;i<=n;++i)suf[a[i]]+=V/a[i];
for(int i=V;i>=1;--i)suf[i]+=suf[i+1];
LL mx=1e15;
for(int i=1;i*i<=V;++i)if(ckmin(mx,5ll*i*n+suf[i+1]))S=i;
for(int i=1;i<=V;++i)for(int j=1;i*j<=V;++j)d[i*j].pb(i);
}
signed main(){
// freopen("data1.in","r",stdin);
// freopen("1.out","w",stdout);
clock_t ST=clock(),ED;
n=read(),m=read();
int blocksize=sqrt(n-1)+1;
rep(i,1,n)ckmax(V,a[i]=read()),bel[i]=(i-1)/blocksize+1;
init();
cerr<<S<<'\n';
for(int i=1;i<=n;++i){
int x=a[i],res=bin[x];
for(int j=0,up=sz(d[x]);j<up;++j){
if(d[x][j]>S)break;
res+=tim[d[x][j]];
}
pre[i]=pre[i-1]+res;
for(int j=0,up=sz(d[x]);j<up;++j)++bin[d[x][j]];
if(x>S)for(int j=x;j<=V;j+=x)++bin[j];
else ++tim[x];
}
rep(i,1,m)q[i].l=read(),q[i].r=read(),q[i].id=i;
sort(q+1,q+m+1);
for(int i=1,l=1,r=0;i<=m;++i){
if(l>q[i].l){
if(r<=n)qn[++tot].pos=r,qn[tot].id=q[i].id,qn[tot].l=q[i].l,qn[tot].r=l-1,qn[tot].op=1;
ans[q[i].id]-=pre[l-1]-pre[q[i].l-1]+(l-q[i].l)*2,l=q[i].l;
}
if(r<q[i].r){
if(l>1)qn[++tot].pos=l-1,qn[tot].id=q[i].id,qn[tot].l=r+1,qn[tot].r=q[i].r,qn[tot].op=-1;
ans[q[i].id]+=pre[q[i].r]-pre[r],r=q[i].r;
}
if(l<q[i].l){
if(r<=n)qn[++tot].pos=r,qn[tot].id=q[i].id,qn[tot].l=l,qn[tot].r=q[i].l-1,qn[tot].op=-1;
ans[q[i].id]+=pre[q[i].l-1]-pre[l-1]+(q[i].l-l)*2,l=q[i].l;
}
if(r>q[i].r){
if(l>1)qn[++tot].pos=l-1,qn[tot].id=q[i].id,qn[tot].l=q[i].r+1,qn[tot].r=r,qn[tot].op=1;
ans[q[i].id]-=pre[r]-pre[q[i].r],r=q[i].r;
}
}
sort(qn+1,qn+tot+1);
memset(bin,0,sizeof(bin));
for(int i=1,j=1;i<=n;++i){
int x=a[i];
for(int k=0,up=sz(d[x]);k<up;++k)++bin[d[x][k]];
if(x>S)for(int k=x;k<=V;k+=x)++bin[k];
for(;j<=tot&&qn[j].pos==i;++j){
int st=qn[j].l,ed=qn[j].r; LL sum=0;
for(int k=st;k<=ed;++k)sum+=bin[a[k]];
ans[qn[j].id]+=1ll*sum*qn[j].op;
}
}
ED=clock(),cerr<<1.*(ED-ST)/CLOCKS_PER_SEC<<'\n';
for(int v=1;v<=S;++v){
for(int i=1;i<=n;++i)cnt[i]=cnt[i-1]+(a[i]%v==0),tim[i]=tim[i-1]+(a[i]==v);
for(int i=1;i<=tot;++i)ans[qn[i].id]+=1ll*(cnt[qn[i].r]-cnt[qn[i].l-1])*tim[qn[i].pos]*qn[i].op;
}
rep(i,1,m)ans[q[i].id]+=ans[q[i-1].id];
rep(i,1,m)ans[q[i].id]+=q[i].r-q[i].l+1;
rep(i,1,m)write(ans[i],'\n');
// rep(i,1,m)printf("%lld\n",ans[i]);
fwrite(cltout,1,oh-cltout,stdout),oh=cltout;
ED=clock(),cerr<<1.*(ED-ST)/CLOCKS_PER_SEC<<'\n';
return 0;
}
/*
6 3
1 1 4 5 1 4
1 1
4 5
1 4
*/```
CF547B Mike and Feet.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define N (200010)
#define len (rp[i]-lp[i]+1)
int st[N],top;
int n,a[N],lp[N],rp[N],ans[N];
int main() {
scanf("%d",&n);
for(rint i=1;i<=n;++i)scanf("%d",&a[i]);
for(rint i=1;i<=n;++i) {
while(top&&a[st[top]]>a[i])rp[st[top]]=i-1,--top;
lp[i]=st[top]+1;st[++top]=i;
}
while(top)rp[st[top--]]=n;
for(rint i=1;i<=n;++i)
ans[len]=max(ans[len],a[i]);
for(rint i=n-1;i>=1;--i)
ans[i]=max(ans[i],ans[i+1]);
for(rint i=1;i<=n;++i)
printf("%d ",ans[i]);
return 0;
}```
最小圆覆盖.cpp
```const int N=1e5+10;
struct vec {
double x,y;
vec(){x=y=0;}
vec(double _x,double _y){x=_x,y=_y;}
vec operator + (const vec &t)const{return vec(x+t.x,y+t.y);}
vec operator - (const vec &t)const{return vec(x-t.x,y-t.y);}
vec operator * (const double &t)const{return vec(x*t,y*t);}
vec operator / (const double &t)const{return vec(x/t,y/t);}
vec rot_90() {return vec(y,-x);}
double len2() {return x*x+y*y;}
}p[N],O;
int n;
double R;
double cross(const vec &x,const vec &y) {return x.x*y.y-x.y*y.x;}
vec intersection(const vec &a1,const vec &a2,const vec &b1,const vec &b2) {
double t=cross(b1-a1,b2)/cross(a2,b2);
return a1+a2*t;
}
vec circle(const vec &a,const vec &b,const vec &c) {
return intersection((a+b)/2,(b-a).rot_90(),(b+c)/2,(c-b).rot_90());
}
void min_circle() {
random_shuffle(p+1,p+n+1);
R=0;
for(rint i=1;i<=n;++i) {
if((p[i]-O).len2()>R) {
O=p[i],R=0;
for(rint j=1;j<i;++j) {
if((p[j]-O).len2()>R) {
O=(p[i]+p[j])/2,R=(p[j]-O).len2();
for(rint k=1;k<j;++k) {
if((p[k]-O).len2()>R) {
O=circle(p[i],p[j],p[k]),R=(p[k]-O).len2();
}
}
}
}
}
}
}```
P7243 最大公约数.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline LL readLL(){
LL x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10ll+ch-'0',ch=getchar();
return x;
}
const int N=2003;
LL a[N][N];
int n,m,x,y,ans;
vector<LL>b[N<<1];
signed main(){
n=read(),m=read();
rep(i,1,n)rep(j,1,m)a[i][j]=readLL();
x=read(),y=read();
rep(i,1,n)rep(j,1,m)b[abs(i-x)+abs(j-y)].pb(a[i][j]);
LL now=a[x][y];
while(now>1){
++ans;
if(!sz(b[ans])){ans=-1;break;}
for(int j=0,up=sz(b[ans]);now>1&&j<up;++j)now=__gcd(b[ans][j],now);
}
cout<<ans<<'\n';
}```
CF1368B Codeforces Subsequences.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int k;
string s="codeforces";
signed main(){
cin>>k;
if(k==1)return cout<<s<<endl,0;
int i,j,now=1;
for(i=1;;++i) {
now=1;
for(j=1;j<=10;++j)now*=i;
if(now>=k)break;
}
--i,now=1;
for(j=1;j<=10;++j)now*=i;
for(j=1;j<=10;++j){
now/=i,now*=i+1;
if(now>=k)break;
}
for(int l=1;l<=j;++l)
for(int k=1;k<=i+1;++k)putchar(s[l-1]);
for(int l=j+1;l<=10;++l)
for(int k=1;k<=i;++k)putchar(s[l-1]);
}
```
P1836 数页码.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define fyyAKNOI return 0;
//Start----------------------------------------------------------------------------
int n;
int num[10],tot;
LL dp[10][100];
LL dfs(int pos,int limit,int val) {
if(!pos)return val;
if(!limit&&~dp[pos][val])return dp[pos][val];
int up=limit?num[pos]:9;LL res=0;
for(int i=0;i<=up;++i)
res=res+dfs(pos-1,limit&&i==up,val+i);
if(!limit)dp[pos][val]=res;
return res;
}
LL solve(int x) {
tot=0;
while(x)num[++tot]=x%10,x/=10;
return dfs(tot,1,0);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
memset(dp,-1,sizeof(dp));
cin>>n,cout<<solve(n)<<endl;
fyyAKNOI
}```
CF1237D Balanced Playlist.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define N (100010)
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,a[N*3],l=1,r=0,p[N*3],q[N*3],ans[N*3],mx,mi=1000000007;
int main() {
n=rd();
for(rint i=1;i<=n;++i) {
a[i]=rd(),a[i+n]=a[i+n*2]=a[i];
mx=max(mx,a[i]),mi=min(mi,a[i]);
}
if(mi*2>=mx) {
for(rint i=1;i<=n;++i)
printf("-1 ");
return puts(""),0;
}
for(rint i=1;i<=n*3;++i) {
while(l<=r&&a[i]>=q[r])--r;
q[++r]=a[i],p[r]=i;
while(l<=r&&q[l]>a[i]*2) ans[p[l]]=i-p[l],++l;
}
for(rint i=3*n;i>=1;--i)
if(!ans[i])ans[i]=ans[i+1]+1;
for(rint i=1;i<=n;++i)
printf("%d ",ans[i]);
return 0;
}```
P1009 阶乘之和.cpp
```#include<bits/stdc++.h>
using namespace std;
string orz(string a,int b)//*
{
int jw=0,now;
string ans;
for(int i=a.length()-1;i>=0;i--)
{
now=(a[i]-'0')*b+jw;
jw=now/10;
now%=10;
ans=char(now+'0')+ans;
}
while(jw>0)
{
char c=jw%10+'0';
jw/=10;
ans=c+ans;
}
return ans;
}
string qwq(string a,string b)//+
{
string ans;
while(a.length()<b.length())a="0"+a;
while(b.length()<a.length())b="0"+b;
int jw=0,now;
for(int i=a.length()-1;i>=0;i--)
{
now=a[i]-'0'+b[i]-'0'+jw;
jw=now/10;
now%=10;
ans=char(now+'0')+ans;
}
return ans;
}
int main()
{
int n;
ios::sync_with_stdio(false);
cin>>n;
string ans,s;
for(int i=1;i<=n;i++)
{
s="1";
for(int j=1;j<=i;j++)
{
s=orz(s,j);
}
ans=qwq(ans,s);
}
cout<<ans<<endl;
return 0;
}```
P1017 进制转换.cpp
```#include<bits/stdc++.h>
using namespace std;
string s="0123456789ABCDEFGHIJK";
void orz(int n,int r)
{
if(n==0)return;
int m=n%r;
if(m<0)m-=r,n+=r;
orz(n/r,r);
printf("%c",s[m]);
}
int main()
{
int base,num;
scanf("%d%d",&num,&base);
printf("%d=",num);
orz(num,base);
printf("(base%d)\n",base);
return 0;
} ```
P1502 窗口的星星.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=10005;
const int M=N<<2;
int n,W,H,ans;
int cpyy[N],leny,cpyx[N],lenx;
int val[M],tag[M];
struct node {
int x,y,l;
inline bool operator < (const node&rhs)const{return x<rhs.x;}
}a[N];
struct line {
int x,l,r,opt;
inline bool operator < (const line&rhs)const{return x<rhs.x;}
}b[N<<1];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {val[p]=max(val[lc],val[rc]);}
void pushdown(int p) {
if(tag[p]) {
val[lc]+=tag[p];
val[rc]+=tag[p];
tag[lc]+=tag[p];
tag[rc]+=tag[p];
tag[p]=0;
}
}
void update(int ql,int qr,int l,int r,int p,int k) {
if(ql<=l&&r<=qr) {
val[p]+=k,tag[p]+=k;
return;
}
pushdown(p);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,lc,k);
if(mid<qr)update(ql,qr,mid+1,r,rc,k);
pushup(p);
}
void clear() {
lenx=leny=0;
memset(val,0,sizeof(val));
memset(tag,0,sizeof(tag));
ans=0;
}
void Main() {
n=rd(),W=rd()-1,H=rd()-1;
clear();
for(int i=1;i<=n;++i)cpyx[++lenx]=a[i].x=rd(),cpyy[++leny]=a[i].y=rd(),a[i].l=rd();
sort(a+1,a+n+1);
sort(cpyx+1,cpyx+lenx+1),lenx=unique(cpyx+1,cpyx+lenx+1)-cpyx-1;
sort(cpyy+1,cpyy+leny+1),leny=unique(cpyy+1,cpyy+leny+1)-cpyy-1;
for(int i=1;i<=n;++i)
b[i*2-1].x=lower_bound(cpyx+1,cpyx+lenx+1,a[i].x)-cpyx,
b[i*2-1].l=lower_bound(cpyy+1,cpyy+leny+1,a[i].y)-cpyy,
b[i*2-1].r=upper_bound(cpyy+1,cpyy+leny+1,a[i].y+H)-cpyy-1,b[i*2-1].opt=a[i].l,
b[i*2].x=upper_bound(cpyx+1,cpyx+lenx+1,a[i].x+W)-cpyx,
b[i*2].l=b[i*2-1].l,b[i*2].r=b[i*2-1].r,b[i*2].opt=-a[i].l;
sort(b+1,b+(n<<1)+1);
// for(int i=1;i<=n<<1;++i)cout<<i<<' '<<b[i].l<<' '<<b[i].r<<' '<<b[i].x<<' '<<b[i].opt<<endl;
// exit(0);
for(int i=1;i<=n<<1;++i) {
int j=i;
while(j<=(n<<1)&&b[j+1].x==b[j].x)++j;
for(int k=i;k<=j;++k)update(b[k].l,b[k].r,1,n,1,b[k].opt);//,cout<<"update"<<b[k].l<<' '<<b[k].r<<' '<<b[k].opt<<endl;
ans=max(ans,val[1]),i=j;
// cout<<i<<' '<<val[1]<<endl;
}
printf("%d\n",ans);
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
CF803C Maximal GCD.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
LL n,k,ans;
bool check(LL x){
if(x>n*2/k/(k+1)+5)return 0;
return x*(k+1)*k/2<=n;
}
signed main(){
scanf("%lld%lld",&n,&k);
if(k>sqrt(n*2)+5)return puts("-1"),0;
cerr<<"Qwq\n";
for(LL i=1;i*i<=n;++i){
if(n%i)continue;
if(check(i))ckmax(ans,i);
if(check(n/i))ckmax(ans,n/i);
}
if(!ans)return puts("-1"),0;
rep(i,1,k-1)printf("%lld ",ans*i);
printf("%lld\n",n-ans*k*(k-1)/2);
return 0;
}```
CF1091H New Year and the Tricolore Recreation.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200009;
int n,f,ans,sg[N];
bool vis[N];
int pri[N],cnt;
bitset<N>bs,bg,a[80];
int SG(int x) {
for(int i=0;i<114514;++i)if(!a[i][x])return i;
return 1919810;
}
void init() {
for(int i=2;i<N;++i) {
if(!vis[i])pri[++cnt]=i;
for(int j=1;j<=cnt&&i*pri[j]<N;++j) {
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
for(int i=1;i<=cnt;++i) {
bs[pri[i]]=1;
for(int j=i;j<=cnt;++j) {
int t=pri[i]*pri[j];
if(t>N) break;
bs[t]=1;
}
}
bs[f]=0;
for(int i=0;i<N;++i)
sg[i]=SG(i),a[sg[i]]|=bs<<i;
}
signed main() {
n=rd(),f=rd();
init();
for(int i=1;i<=n;++i) {
int x=rd(),y=rd(),z=rd();
ans^=sg[z-y-1]^sg[y-x-1];
}
puts(ans?"Alice\nBob":"Bob\nAlice");
return 0;
}```
P3834 【模板】可持久化线段树 2（主席树）（整体二分）.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,m,a[N],lsh[N],b[N],len,ans[N];
struct node{int l,r,k,id;}q[N],q1[N],q2[N];
int tr[N];
inline void add(int x,int d){for(int i=x;i<=n;i+=i&-i)tr[i]+=d;}
inline int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
vector<int>vc[N];
void solve(int l,int r,int x,int y){
if(x>y)return;
if(l==r){
rep(i,x,y)ans[q[i].id]=lsh[l];
return;
}
int mid=(l+r)>>1,ii=0,jj=0,kk=x;
rep(i,l,mid)for(int j:vc[i])add(j,1);
rep(i,x,y){
int t=ask(q[i].r)-ask(q[i].l-1);
if(q[i].k<=t)q1[++ii]=q[i];
else q2[++jj]=q[i],q2[jj].k-=t;
}
rep(i,l,mid)for(int j:vc[i])add(j,-1);
rep(i,1,ii)q[kk++]=q1[i];
rep(i,1,jj)q[kk++]=q2[i];
solve(l,mid,x,x+ii-1),solve(mid+1,r,x+ii,y);
}
signed main(){
n=read(),m=read();
rep(i,1,n)lsh[++len]=a[i]=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
rep(i,1,n)b[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh,vc[b[i]].pb(i);
rep(i,1,m)q[i].id=i,q[i].l=read(),q[i].r=read(),q[i].k=read();
solve(1,len,1,m);
rep(i,1,m)printf("%d\n",ans[i]);
return 0;
}```
CF986B Petr and Permutations.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[1000005],r[1000005];
long long ans;
inline int rd()
{
int f=1,x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void msort(int left,int right)
{
if(left==right)return;
int mid=(left+right)/2;
msort(left,mid);msort(mid+1,right);
int i=left,j=mid+1,k=left;
while(i<=mid&&j<=right)
{
if(a[i]>a[j])
{
ans+=mid-i+1;
r[k++]=a[j++];
}
if(a[i]<=a[j])
r[k++]=a[i++];
}
while(i<=mid)r[k++]=a[i++];
while(j<=right)r[k++]=a[j++];
for(int t=left;t<=right;t++)
a[t]=r[t];
return;
}
signed main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
msort(1,n);
if(ans%2==3*n%2)puts("Petr");
else puts("Um_nik");
return 0;
}```
P1297 [国家集训队]单选错位.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 1e7 + 5;
double ans;
int n, A, B, C, a[N];
signed main() {
scanf("%d%d%d%d%d", &n, &A, &B, &C, a + 1);
for (int i = 2; i <= n; i++)
a[i] = ((long long) a[i - 1] * A + B) % 100000001;
for (int i = 1; i <= n; i++)
a[i] = a[i] % C + 1;
for (int i = 1; i < n; ++ i) ans += 1. * min(a[i], a[i + 1]) / (1ll * a[i] * a[i + 1]);
ans += 1. * min(a[1], a[n]) / (1ll * a[1] * a[n]);
printf("%.3lf\n", ans);
}```
CF773F Test Data Generation.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=30005;
const int M=N<<2;
int n,a,mod,f[2][M],ans;
int fmod(int x){return x-=mod,x+=x>>31&mod,x;}
namespace poly{
const db PI=acos(-1);
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
}w[M];
int rev[M],lim,lg;
void init(const int&n){
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1)),w[i]=cp(cos(2*PI*i/lim),sin(2*PI*i/lim));
}
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1,t=lim>>1;i<lim;i<<=1,t>>=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const cp X=a[j+k],Y=w[k*t]*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(op)return;
for(int i=0;i<lim;++i)a[i].x/=lim;
}
void mul(int*f,int*g,int*ans){
static cp A[M],B[M];
for(int i=0;i<lim;++i)A[i]=cp(f[i],0),B[i]=cp(g[i],0);
FFT(A,1),FFT(B,1);
for(int i=0;i<lim;++i)A[i]=A[i]*B[i],w[i].y*=-1;
FFT(A,0);
for(int i=0;i<lim;++i)ans[i]=LL(A[i].x+0.5)%mod;
for(int i=0;i<lim;++i)w[i].y*=-1;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
void shift(const int&n,const int&a){
static int g[M],h[M],q[M];
clr(g,lim),clr(h,lim),clr(q,lim),g[0]=1;
for(int i=1;i<=n;++i)g[i]=fmod(f[0][i]+f[1][i]);
mul(g,f[a&1],h),mul(g,f[(a&1)^1],q);
for(int i=1;i<=n;++i)f[0][i]=fmod(f[0][i]+h[i]),f[1][i]=fmod(f[1][i]+q[i]);
}
void setbit(const int&n,const int&a){
static int g[N];g[0]=1;
for(int i=1;i<=n;++i)g[i]=fmod(f[0][i]+f[1][i]),f[1][i]=fmod(f[1][i]+g[i-1]);
}
}
signed main(){
n=read(),a=read()>>1,mod=read();
if(!a)return puts("0"),0;
f[1][1]=ans=1,poly::init(n<<1);
for(int i=log2(a)-1,len=1;i>=0;--i){
poly::shift(n,len),len<<=1;
if(a>>i&1)poly::setbit(n,len),++len;
for(int j=1;j<=n;j+=2)ans=fmod(ans+f[1][j]);
}
printf("%d\n",ans);
return 0;
}```
CF891E Lust.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
inline int qpow(int n, int k) {
int res = 1;
for(; k; k >>= 1, n = 1ll * n * n % mod)
if(k & 1) res = 1ll * n * res % mod;
return res;
}
const int N = 5005;
int n, k, a[N], f[N], ans;
typedef vector <int> poly;
poly A;
poly operator * (const poly&a,const poly&b) {
poly res;
int n = sz(a), m = sz(b);
res.resize(n + m - 1);
for(int i = 0; i < n + m - 2; ++i) res[i] = 0;
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
res[i + j] = (res[i + j] + 1ll * a[i] * b[j] % mod) % mod;
return res;
}
signed main() {
n = read(), k = read();
for(int i = 1; i <= n; ++i) a[i] = read();
A.resize(2), A[0] = a[1], A[1] = mod - 1;
for(int i = 2; i <= n; ++i) {
static poly B;
B.resize(2), B[0] = a[i], B[1] = mod - 1;
A = A * B;
}
f[0] = qpow(n, k);
static const int ivn = qpow(n, mod - 2);
for(int i = 1; i <= n; ++i)
f[i] = 1ll * f[i - 1] * (k - i + 1) % mod * ivn % mod;
for(int i = 0; i <= n; ++i)
ans = (ans + 1ll * f[i] * A[i] % mod + mod) % mod;
ans = 1ll * ans * qpow(qpow(n, k), mod - 2) % mod;
int tmp = 1;
for(int i = 1; i <= n; ++i) tmp = 1ll * tmp * a[i] % mod;
ans = (tmp - ans + mod) % mod;
cout << ans << '\n';
return 0;
}```
CF1061D TV Shows.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
const int N=100009;
const int zky=1000000007;
const int inf=1e12;
int n,x,y,cnt,st[N],top,ans,l[N],r[N];
struct node {
int x,id,o;
}a[N<<1];
inline bool cmp(const node&a,const node&b) {
return a.x!=b.x?a.x<b.x:a.o<b.o;
}
signed main() {
n=rd(),x=rd(),y=rd();
for(int i=1;i<=n;++i)
++cnt,a[cnt].x=l[i]=rd(),a[cnt].id=i,a[cnt].o=0,
++cnt,a[cnt].x=r[i]=rd(),a[cnt].id=i,a[cnt].o=1;
sort(a+1,a+cnt+1,cmp);
for(int i=1;i<=cnt;++i) {
if(a[i].o)st[++top]=a[i].x;
else {
int t=r[a[i].id];
if(!top)ans=(ans+x+y*(t-a[i].x)%zky)%zky;
else {
int tx=x+y*(t-a[i].x),ty=y*(t-st[top]);
if(tx<ty)ans=(ans+tx)%zky;
else ans=(ans+ty)%zky,--top;
}
}
}
printf("%lld\n",ans);
return 0;
}```
SP10502 VIDEO - Video game combos.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int n,k,ch[305][3],tot,cnt[305],dp[305][1005],fail[305];
vector<int>e[305];
void insert(char*str){
int u=0,len=strlen(str);
for(int i=0;i<len;++i){
int c=str[i]-'A';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
++cnt[u];
}
void build_fail(){
queue<int>q;
for(int i=0;i<3;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<3;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=tot;++i)e[fail[i]].pb(i);
}
void dfs1(int u){
for(int v:e[u])cnt[v]+=cnt[u],dfs1(v);
}
int dfs2(int u,int k){
if(~dp[u][k])return dp[u][k];
if(!k)return cnt[u];
int res=0;
for(int i=0;i<3;++i)res=max(res,dfs2(ch[u][i],k-1));
return dp[u][k]=res+cnt[u];
}
signed main(){
n=read(),k=read();
for(int i=1;i<=n;++i){
static char str[20];
scanf("%s",str),insert(str);
}
build_fail(),dfs1(0);
memset(dp,-1,sizeof(dp));
printf("%d\n",dfs2(0,k));
}```
P4197 Peaks.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=1000005;
const int K=N<<1;
const int T=K*23;
int n,m,q,h[K],F[K],cnt,fa[20][K],cpy[N],len,w[K];
int head[K],num_edge;
int ld[K],rd[K],rev[K],timer,sum[K];
int val[T],ls[T],rs[T],tot,root[K];
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
struct node{
int u,v,d;
inline bool operator < (const node&rhs)const{return d<rhs.d;}
}a[M];
struct edge{
int nxt,to;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u){
ld[u]=++timer,rev[timer]=u;
if(u<=n)++sum[u];
for(int i=head[u];i;i=e[i].nxt)dfs(e[i].to),sum[u]+=sum[e[i].to];
rd[u]=timer;
}
void update(int &p,int pre,int l,int r,int v){
p=++tot;
ls[p]=ls[pre],rs[p]=rs[pre],val[p]=val[pre]+1;
if(l==r)return;
int mid=(l+r)>>1;
if(v<=mid)update(ls[p],ls[pre],l,mid,v);
else update(rs[p],rs[pre],mid+1,r,v);
}
int query(int p,int pre,int l,int r,int k){
if(l==r)return l;
int x=val[rs[p]]-val[rs[pre]],mid=(l+r)>>1;
if(k<=x)return query(rs[p],rs[pre],mid+1,r,k);
else return query(ls[p],ls[pre],l,mid,k-x);
}
signed main(){
n=read(),m=read(),q=read();
for(int i=1;i<=n;++i)cpy[++len]=h[i]=read();
for(int i=1;i<n<<1;++i)F[i]=i;
sort(cpy+1,cpy+len+1),len=unique(cpy+1,cpy+len+1)-cpy-1;
for(int i=1;i<=n;++i)h[i]=lower_bound(cpy+1,cpy+len+1,h[i])-cpy;
for(int i=1;i<=m;++i)a[i].u=read(),a[i].v=read(),a[i].d=read();
sort(a+1,a+m+1),cnt=n;
for(int i=1;i<=m;++i){
int u=a[i].u,v=a[i].v;
int fx=find(u),fy=find(v);
if(fx!=fy){
++cnt,w[cnt]=a[i].d;
addedge(cnt,fx),addedge(cnt,fy);
fa[0][fx]=fa[0][fy]=F[fx]=F[fy]=cnt;
if(cnt==2*n-1)break;
}
}
dfs(cnt);
for(int i=1;i<20;++i)
for(int j=1;j<=cnt;++j)
fa[i][j]=fa[i-1][fa[i-1][j]];
for(int i=1;i<=cnt;++i)
if(rev[i]<=n)update(root[i],root[i-1],1,len,h[rev[i]]);
else root[i]=root[i-1];
while(q--){
int x=read(),y=read(),z=read();
for(int i=19;~i;--i) {
if(fa[i][x]&&w[fa[i][x]]<=y)x=fa[i][x];
}
if(z>sum[x])puts("-1");
else printf("%d\n",cpy[query(root[rd[x]],root[ld[x]-1],1,len,z)]);
}
return 0;
}
```
CF1344D Résumé Review.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,a[N],b[N];
pair<LL,int>c[N];
LL k,sum;
bool check(LL o){
LL res=0;
for(int i=1;i<=n;++i){
int l=0,r=a[i],t=0;
while(l<=r){
LL mid=(l+r)>>1;
if(-3ll*mid*mid-3ll*mid-1ll+a[i]>=o)l=mid+1,t=mid;
else r=mid-1;
}
res+=t;
}
return res>=k;
}
signed main(){
cin>>n>>k;
rep(i,1,n)a[i]=read();
LL l=-3.5e18,r=3.5e18,res=114514;
while(l<=r){
LL mid=(l+r)>>1;
if(check(mid))l=mid+1,res=mid;
else r=mid-1;
}
for(int i=1;i<=n;++i){
int l=0,r=a[i],t=0;
while(l<=r){
LL mid=(l+r)>>1;
if(-3ll*mid*mid-3ll*mid-1ll+a[i]>=res)l=mid+1,t=mid;
else r=mid-1;
}
b[i]=t,sum+=b[i];
if(t>0)c[i]=mkp(-3ll*t*t+3ll*t-1ll+a[i],i);
else c[i]=mkp(4e18,i);
}
sort(c+1,c+n+1);
rep(i,1,sum-k)--b[c[i].se];
LL qwq=0;
rep(i,1,n)qwq+=1ll*b[i]*(a[i]-1ll*b[i]*b[i]);
cerr<<qwq<<'\n';
rep(i,1,n)printf("%d ",b[i]);
return 0;
}```
P3750 [六省联考2017]分手是祝愿.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=100003;
const int N=100009;
int n,k,a[N],dp[N],mi,ans;
int qpow(int n,int k) {
int res=1;
while(k) {
if(k&1)res=1ll*res*n%mod;
n=1ll*n*n%mod,k>>=1;
}
return res;
}
signed main() {
n=rd(),k=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=n;i>=1;--i) {
if(!a[i])continue;
++mi;
for(int j=1;j*j<=i;++j) {
if(i%j)continue;
a[j]^=1;
if(j*j!=i)a[i/j]^=1;
}
}
dp[n]=1;
for(int i=n-1;i>=1;--i)
dp[i]=1ll*(((1ll*dp[i+1]*(n-i)%mod+n)%mod)*qpow(i,mod-2))%mod;
if(mi<=k)ans=mi;
else {for(int i=k+1;i<=mi;++i)ans=(ans+dp[i])%mod;ans=(ans+k)%mod;}
for(int i=1;i<=n;++i)ans=(1ll*ans*i)%mod;
printf("%d\n",ans);return 0;
}
```
CF1492D Genius's Gambit.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define FAIL return puts("No"),0
#define pc putchar
const int N=200005;
int a,b,k,S[N],T[N],n;
signed main(){
a=read(),b=read(),k=read(),n=a+b;
if(k==0){
puts("Yes");
rep(i,1,b)pc('1');rep(i,1,a)pc('0');puts("");
rep(i,1,b)pc('1');rep(i,1,a)pc('0');puts("");
return 0;
}
if(k>=a+b)FAIL;
if(a==0){
if(k)FAIL;
else{
puts("Yes");
rep(i,1,b)pc('1');puts("");
rep(i,1,b)pc('1');puts("");
}
return 0;
}
if(b==1){
if(k)FAIL;
else{
puts("Yes");
pc('1');rep(i,1,a)pc('0');puts("");
pc('1');rep(i,1,a)pc('0');puts("");
}
return 0;
}
if(k==a+b-1)FAIL;
S[1]=T[1]=1;
S[2]=1,S[2+k]=0;
T[2]=0,T[2+k]=1;
b-=2,--a;
rep(i,3,1+k)if(a)S[i]=T[i]=0,--a;else S[i]=T[i]=1,--b;
rep(i,k+3,n)if(a)S[i]=T[i]=0,--a;else S[i]=T[i]=1,--b;
puts("Yes");
rep(i,1,n)pc(S[i]+'0');puts("");
rep(i,1,n)pc(T[i]+'0');puts("");
}```
P5192 Zoj3229 Shoot the Bullet.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=410;
const int M=1010;
const int K=1500;
const int inf=1e8;
const int L=2*(N*N+M+K);
int n,m,G[M],C[N],D[N],ans;
int num_edge,head[K];
int s,t,S,T,SS,TT,dta[K];
int cur[K],dep[K],maxflow,sumflow;
struct edge {
int nxt,to,val;
}e[L];
void addedge(int from,int to,int val) {
++num_edge;e[num_edge].nxt=head[from];e[num_edge].to=to;e[num_edge].val=val;head[from]=num_edge;
++num_edge;e[num_edge].nxt=head[to];e[num_edge].to=from;e[num_edge].val=0;head[to]=num_edge;
}
void clear() {
memset(head,0,sizeof(head));
memset(dta,0,sizeof(dta));
num_edge=1;ans=0;sumflow=0;maxflow=0;
}
bool bfs() {
for(rint i=1;i<=TT;++i)cur[i]=head[i],dep[i]=0;
dep[s]=1;queue<int>q;q.push(s);
while(!q.empty()) {
int u=q.front();q.pop();
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(e[i].val&&!dep[v])dep[v]=dep[u]+1,q.push(v);
}
}
return dep[t]>0;
}
int dfs(int u,int flow) {
if(u==t)return flow;
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
cur[u]=i;int v=e[i].to;
if(e[i].val&&dep[v]==dep[u]+1) {
rlow=dfs(v,min(e[i].val,flow-used));
if(rlow) {
e[i].val-=rlow;
e[i^1].val+=rlow;
used+=rlow;
if(used==flow)break;
}
}
}
return used;
}
void Main() {
clear();
S=n+m+1,T=S+1,SS=T+1,TT=SS+1;
for(rint i=1;i<=m;++i)
G[i]=rd(),addedge(i+n,T,inf-G[i]),dta[i+n]-=G[i],dta[T]+=G[i];
for(rint i=1;i<=n;++i) {
C[i]=rd(),D[i]=rd();
addedge(S,i,D[i]);
for(rint j=1;j<=C[i];++j) {
int t=rd()+1,l=rd(),r=rd();
addedge(i,t+n,r-l);
dta[t+n]+=l,dta[i]-=l;
}
}
for(rint i=1;i<=n+m+2;++i)
if(dta[i]>0)addedge(SS,i,dta[i]),sumflow+=dta[i];
else addedge(i,TT,-dta[i]);
addedge(T,S,inf);
s=SS,t=TT;while(bfs())maxflow+=dfs(s,inf);
if(sumflow!=maxflow){printf("%d\n\n",-1);return;}
s=S,t=T;while(bfs())ans+=dfs(s,inf);
printf("%d\n\n",ans);
}
signed main() {
while(scanf("%d%d",&n,&m)!=EOF)Main();
return 0;
}
```
P6853 station.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=4005;
int n,m,need;
vector<int>a;
void f2(){
printf("2 %d %d\n",m+1,m+2);
printf("2 %d %d\n",m+2,m+3);
a.pb(m+1),a.pb(m+3);
need-=2,m+=3;
}
void f3(){
printf("2 %d %d\n",m+1,m+4);
printf("2 %d %d\n",m+2,m+4);
printf("2 %d %d\n",m+3,m+4);
a.pb(m+1),a.pb(m+2),a.pb(m+3);
need-=3,m+=4;
}
signed main(){
n=read(),need=n-1;
if((n-1)%6==0)printf("%d\n",(n-1)/6*5);
else if((n-1)%6==1)printf("%d\n",(n-8)/6*5+10),f2(),f2(),f3();
else if((n-1)%6==2)printf("%d\n",(n-3)/6*5+3),f2();
else if((n-1)%6==3)printf("%d\n",(n-4)/6*5+4),f3();
else if((n-1)%6==4)printf("%d\n",(n-5)/6*5+6),f2(),f2();
else if((n-1)%6==5)printf("%d\n",(n-6)/6*5+7),f2(),f3();
//// cout<<need<<' '<<m<<endl;
for(int i=1;i<=need;i+=6,m+=5){
printf("2 %d %d\n",m+1,m+4);
printf("2 %d %d\n",m+1,m+5);
printf("2 %d %d\n",m+2,m+4);
printf("2 %d %d\n",m+2,m+5);
printf("2 %d %d\n",m+3,m+4);
printf("2 %d %d\n",m+3,m+5);
a.pb(m+1),a.pb(m+2),a.pb(m+3);
}
printf("%d ",(int)a.size());
for(int i:a)printf("%d ",i);
return 0;
}```
P1419 寻找段落.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef double db;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
const db eps=1e-6;
int n,a[N],s,t;
db ans;
bool check(db m){
static int q[N],H,T;
static db b[N]={0};
for(int i=1;i<=n;++i)b[i]=1.*a[i]-m+b[i-1];
H=1,T=0;
for(int i=1;i<=n;++i){
if(i>=s){
while(H<=T&&b[q[T]]>b[i-s])--T;
q[++T]=i-s;
}
while(H<=T&&i-q[H]>t)++H;
if(H<=T){if(b[i]-b[q[H]]>-1e-9)return 1;}
}
return 0;
}
signed main(){
n=read(),s=read(),t=read();
for(int i=1;i<=n;++i)a[i]=read();
db l=-10000,r=10000;
while(r-l>eps){
db mid=(l+r)/2;
if(check(mid))ans=mid,l=mid;
else r=mid;
}
printf("%.3lf\n",ans);
return 0;
}```
P5162 WD与积木.cpp
```// Problem: P5162 WD与积木
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P5162
// Memory Limit: 125 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=100005;
const int M=N<<2;
namespace math{
int inv[N],fac[N],ifc[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using namespace math;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void poly_inv(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=qpow(f[0],mod-2),void();
poly_inv(g,f,(n+1)>>1);
init_poly(n<<1);
cpy(A,f,n),clr(A+n,lim-n),clr(g+n,lim-n);
NTT(A,1),NTT(g,1);
for(int i=0;i<lim;++i)g[i]=1ll*g[i]*(2-1ll*g[i]*A[i]%mod+mod)%mod;
NTT(g,0),clr(g+n,lim-n);
}
}
int G[M],H[M],A[M],B[M];
void solve(const int&n=100000){
initmath();
A[0]=1;
for(int i=1;i<=n;++i)A[i]=mod-ifc[i];
poly::poly_inv(G,A,n+1);
poly::NTT(A,1);
for(int i=0;i<poly::lim;++i)A[i]=1ll*A[i]*A[i]%mod;
poly::NTT(A,0);
poly::poly_inv(B,A,n+1);
for(int i=1;i<=n;++i)H[i]=ifc[i];
poly::poly_mul(H,B,H,n+1,n+1);
}
int main(){
solve();
for(int T=read();T;--T){
int x=read();
printf("%lld\n",1ll*H[x]*qpow(G[x],mod-2)%mod);
}
return 0;
}
```
P1025 数的划分.cpp
```#include<bits/stdc++.h>
using namespace std;
int f[205][10];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
f[i][1]=f[i][0]=1;
for(int i=2;i<=n;i++)
for(int j=2;j<=k;j++)
if(i>j)f[i][j]=f[i-1][j-1]+f[i-j][j];
else f[i][j]=f[i-1][j-1];
cout<<f[n][k]<<endl;
return 0;
}
```
CF246E Blood Cousins Return.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 300009
int n,q,hash_tot,id[N],ans[N];
int son[N],dep[N],siz[N];
int cnt[N<<1];
bool vis[N];
vector<pair<int,int> >v[N];
vector<int>g[N];
map<string,int>name;
map<int,bool>mp[N];
void dfs1(int u) {
siz[u]=1;
for(int v:g[u]) {
dep[v]=dep[u]+1,dfs1(v),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void calc(int u,int sn) {
if(!mp[dep[u]][id[u]])++cnt[dep[u]],mp[dep[u]][id[u]]=1;
for(int v:g[u]) if(v!=sn)calc(v,sn);
}
void clear(int u) {
mp[dep[u]][id[u]]=0,cnt[dep[u]]=0;
for(int v:g[u])clear(v);
}
void dfs(int u,int cl) {
vis[u]=1;
for(int v:g[u])
if(v!=son[u])dfs(v,1);
if(son[u])dfs(son[u],0);
calc(u,son[u]);
for(pair<int,int> i:v[u])ans[i.first]=cnt[i.second+dep[u]];
if(cl)clear(u);
}
signed main() {
// ios::sync_with_stdio(0);
// cin.tie(0),cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i) {
string s;int f;
cin>>s>>f;
if(!name[s])name[s]=++hash_tot;
id[i]=name[s],g[f].pb(i);
}
cin>>q;
for(int i=1;i<=q;++i) {
int x=rd(),y=rd();
v[x].pb(mkp(i,y));
}
for(int i=1;i<=n;++i)if(!vis[i])dfs1(i),dfs(i,1);
for(int i=1;i<=q;++i)cout<<ans[i]<<endl;
return 0;
}```
CF1265A Beautiful String.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int T;
char s[N],t[N],a[4]="abc";
signed main() {
scanf("%d",&T);
while(T--) {
scanf("%s",s+1);int n=strlen(s+1);
t[0]=s[0]='#',t[n+1]=s[n+1]='#';
for(rint i=1;i<=n;++i) {
if(s[i]!='?')t[i]=s[i];
else {
for(rint j=0;j<3;++j)
if(a[j]!=t[i-1]&&a[j]!=s[i+1]){t[i]=a[j];break;}
}
}
int flg=0;
for(rint i=2;i<=n;++i)if(t[i]==t[i-1]){flg=1;break;}
if(flg){puts("-1");continue;}
for(rint i=1;i<=n;++i)putchar(t[i]);puts("");
}
return 0;
}```
P5038 [SCOI2012]奇怪的游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
#define broken cerr<<"lqx AK:"<<__LINE__<<' '<<__FUNCTION__<<endl
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=45;
const int N=K*K+5;
const int M=(N*N*4+2*N*N)*2;
const LL inf=1e14;
int n,m,a[K][K],c[2],mxv;
LL sum[2];
int dis[N],cur[N],S,T,hed[N],et=1,control=0;
LL mf;
struct edge{int nx,to;LL fl;}e[M];
void addedge(int u,int v,LL fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,LL fl){
if(control)cerr<<u<<' '<<v<<' '<<fl<<'\n';
addedge(u,v,fl),addedge(v,u,0);
}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
LL dfs(int u,LL fl){
if(u==T)return fl;
LL rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
int id(int x,int y){return (x-1)*m+y;}
bool check(LL o){
et=1,mf=0,memset(hed,0,sizeof(hed));
rep(i,1,n)rep(j,1,m){
if((i+j)&1){
adde(S,id(i,j),o-a[i][j]);
if(i>1)adde(id(i,j),id(i-1,j),inf);
if(i<n)adde(id(i,j),id(i+1,j),inf);
if(j>1)adde(id(i,j),id(i,j-1),inf);
if(j<m)adde(id(i,j),id(i,j+1),inf);
}else adde(id(i,j),T,o-a[i][j]);
}
while(bfs(S,T))mf+=dfs(S,inf);
return mf==1ll*c[0]*o-sum[0];
}
void Main(){
n=read(),m=read(),S=n*m+1,T=S+1,c[0]=c[1]=mxv=sum[0]=sum[1]=0;
rep(i,1,n)rep(j,1,m)a[i][j]=read(),++c[(i+j)&1],sum[(i+j)&1]+=a[i][j],ckmax(mxv,a[i][j]);
if(c[0]!=c[1]){
LL res=(sum[0]-sum[1])/(c[0]-c[1]);
if(check(res))printf("%lld\n",mf);
else puts("-1");
}else{
LL l=mxv,r=inf,res=-1;
while(l<=r){
LL mid=(l+r)>>1;
if(check(mid))res=mf,r=mid-1;
else l=mid+1;
}
printf("%lld\n",res);
}
}
signed main(){for(int T=read();T;--T)Main();}
/*
2
2 2
1 2
2 3
3 3
1 2 3
2 3 4
4 3 2
*/```
P4630 [APIO2018] Duathlon 铁人两项.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long LL;
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
#define M 200005
#define T (N<<1)
int n,m,tot,siz[T],val[T],S;
int stk[N],top,low[N],dfn[N],tmr;
LL ans;
struct edge{int nxt,to;}e[M<<1],E[T<<1];
int head[T],num_edge;
int Head[T],Num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void Addedge(int fr,int to){
++Num_edge;
E[Num_edge].nxt=Head[fr];
E[Num_edge].to=to;
Head[fr]=Num_edge;
}
void tarjan(int u){
dfn[u]=low[u]=++tmr,++S,stk[++top]=u;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(!dfn[v]){
tarjan(v),low[u]=min(low[u],low[v]);
if(low[v]==dfn[u]){
int num=1;++tot;
Addedge(tot,u),Addedge(u,tot);
while(stk[top+1]!=v){
Addedge(tot,stk[top]),Addedge(stk[top],tot);
--top,++num;
}
val[tot]=num;
}
}else low[u]=min(low[u],dfn[v]);
}
}
void dfs(int u,int ft){
siz[u]=u<=n;
for(int i=Head[u];i;i=E[i].nxt){
int v=E[i].to;if(v==ft)continue;
dfs(v,u),ans+=2ll*siz[v]*siz[u]*val[u];
siz[u]+=siz[v];
}
ans+=2ll*(S-siz[u])*siz[u]*val[u];
}
signed main(){
tot=n=read(),m=read();
for(int i=1;i<=m;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
for(int i=1;i<=n;++i)val[i]=-1;
for(int i=1;i<=n;++i)if(!dfn[i])S=top=0,tarjan(i),dfs(i,0);
printf("%lld\n",ans);
return 0;
}
/*
4 3
1 2
2 3
3 4
*/```
CF1037H Security.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n, m;
char str[N];
namespace seg{
#define T ((N << 1) * 23)
int val[T], ls[T], rs[T], tot;
void update(int&p, int pos, int k, int l = 1, int r = n) {
if (!p) p = ++ tot;
if (l == r) return val[p] += k, void();
int mid = (l + r) >> 1;
if (pos <= mid) update(ls[p], pos, k, l, mid);
else update(rs[p], pos, k, mid + 1, r);
val[p] = val[ls[p]] + val[rs[p]];
}
int merge(int x, int y, int l = 1, int r = n) {
if (!x || !y) return x | y;
if (l == r) return val[x] += val[y], x;
int mid = (l + r) >> 1, p = ++ tot;
ls[p] = merge(ls[x], ls[y], l, mid);
rs[p] = merge(rs[x], rs[y], mid + 1, r);
return val[p] = val[ls[p]] + val[rs[p]], p;
}
int query(int p, int ql, int qr, int l = 1, int r = n) {
if (!p) return 0;
if (ql <= l && r <= qr) return val[p];
int mid = (l + r) >> 1;
if (ql <= mid && query(ls[p], ql, qr, l, mid)) return 1;
if (mid < qr && query(rs[p], ql, qr, mid + 1, r)) return 1;
return 0;
}
#undef T
}
namespace sam{
#define S (N<<1)
int q[S], t[S], rt[S];
int mxlen[S], tot = 1, trans[S][26], to[N], link[S];
int extend(int c, int lst, int id) {
int p = lst, np = ++ tot; mxlen[np] = mxlen[p] + 1;
for (; p && !trans[p][c]; p = link[p]) trans[p][c] = np;
if (!p) link[np] = 1;
else{
int q = trans[p][c];
if (mxlen[p] + 1 == mxlen[q]) link[np] = q;
else {
int nq = ++ tot; mxlen[nq] = mxlen[p] + 1;
for (int i = 0; i < 26; ++ i) trans[nq][i] = trans[q][i];
link[nq] = link[q], link[q] = link[np] = nq;
for (; p && trans[p][c] == q; p = link[p]) trans[p][c] = nq;
}
}
return seg::update(rt[np], id, 1), np;
}
void insert(char*str, int n) {
for (int i = 1, lst = 1; i <= n; ++ i) to[i] = lst = extend(str[i] - 'a', lst, i);
}
void work() {
for (int i = 1; i <= tot; ++ i) ++ t[mxlen[i]];
for (int i = 1; i <= n; ++ i) t[i] += t[i - 1];
for (int i = 1; i <= tot; ++ i) q[t[mxlen[i]] --] = i;
for (int i = tot; i > 1; -- i) rt[link[q[i]]] = seg::merge(rt[link[q[i]]], rt[q[i]]);
// for(int i=1;i<=tot;++i)cerr<<link[i] << ' ' <<i <<'\n';
// for(int i=0;i<26;++i)cerr<<trans[5][i]<<' ';cerr<<'\n';
}
#undef S
}
signed main() {
scanf("%s", str + 1), n = strlen(str + 1), sam::insert(str, n), sam::work();
for (m = read(); m ; -- m) {
static char s[N];
static int l, r, tmp[N], len;
scanf("%d%d%s",&l, &r, s + 1), len = strlen(s + 1);
int u = 1, i = 1, id = -1;
for(;;++i) {
tmp[i] = -1;
for (int j = i > len ? 0 : s[i] - 'a' + 1; j < 26; ++ j){
// if(j < 4)cerr << u << ' ' << j << ' ' << sam::trans[u][j] << '\n';
if (seg::query(sam::rt[sam::trans[u][j]], l + i - 1, r)) { tmp[i] = j; break; }
}
u = sam::trans[u][s[i] - 'a'];
if (!u || i > len || !seg::query(sam::rt[u], l + i - 1, r)) break;
// if (!seg::query(sam::rt[u], l + i - 1, r)) break;
}
for (; i >= 1; -- i) if (~tmp[i]) { id = i; break; }
if (!~id) puts("-1");
else{
for (int i = 1; i < id; ++ i)putchar(s[i]);
putchar('a' + tmp[id]), puts("");
}
}
return 0;
}
/*
baa
5
1 2 ba
2 3 a
1 2 b
2 3 aa
1 3 b
*/```
P6033 合并果子 加强版.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const LL inf=1e15;
int n,bin[100005];
LL ans;
struct QUEUE{
queue<LL>q[2];
void push(LL x,int o){q[o].push(x);}
LL front(){
assert(!q[0].empty()||!q[1].empty());
LL res=inf;
if(!q[0].empty())res=min(res,q[0].front());
if(!q[1].empty())res=min(res,q[1].front());
return res;
}
void pop(){
assert(!q[0].empty()||!q[1].empty());
if(q[0].empty())q[1].pop();
else if(q[1].empty())q[0].pop();
else if(q[0].front()<q[1].front())q[0].pop();
else q[1].pop();
}
int size(){return q[0].size()+q[1].size();}
}q;
signed main(){
n=read();
for(int i=1;i<=n;++i)++bin[read()];
for(int i=1;i<=100000;++i)for(int j=1;j<=bin[i];++j)q.push(i,0);
while(q.size()>1){
LL x=q.front();q.pop();
LL y=q.front();q.pop();
q.push(x+y,1),ans+=x+y;
}
printf("%lld\n",ans);
return 0;
}```
CF452E Three strings.cpp
```#include<bits/stdc++.h>
using namespace std;
#define N 300005
#define S (N<<1)
#define mod 1000000007
char str[N];
int trans[S][26],tot=1,link[S],mxlen[S];
int n,cnt[S][3],q[S],t[S],ans[N];
int extend(int c,int id,int lst){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return ++cnt[q][id],q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return ++cnt[nq][id],nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return ++cnt[np][id],np;
}
bool ckmax(int&x,int y){return x<y?x=y,1:0;}
bool ckmin(int&x,int y){return x>y?x=y,1:0;}
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
signed main(){
scanf("%s",str),n=strlen(str);
for(int i=0,lst=1,len=strlen(str);i<len;++i)lst=extend(str[i]-'a',0,lst);
scanf("%s",str),ckmin(n,strlen(str));
for(int i=0,lst=1,len=strlen(str);i<len;++i)lst=extend(str[i]-'a',1,lst);
scanf("%s",str),ckmin(n,strlen(str));
for(int i=0,lst=1,len=strlen(str);i<len;++i)lst=extend(str[i]-'a',2,lst);
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
for(int i=tot;i>=1;--i)for(int j=0;j<3;++j)fmod(cnt[link[q[i]]][j]+=cnt[q[i]][j]);
for(int i=2;i<=tot;++i){
int tmp=1ll*cnt[i][0]*cnt[i][1]%mod*cnt[i][2]%mod;
fmod(ans[mxlen[link[i]]+1]+=tmp),fmod(ans[mxlen[i]+1]-=tmp);
}
for(int i=1;i<=n;++i)fmod(ans[i]+=ans[i-1]);
for(int i=1;i<=n;++i)printf("%d%c",ans[i]," \n"[i==n]);
return 0;
}
/*
abc
bc
cbc
abacaba
abac
abcd
*/```
P4721 【模板】分治 FFT.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=N<<2;
#define mod 998244353
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,g[N],f[N];
namespace poly{
int lg,lim,rev[M];
void init(const int&n){
for(lim=1,lg=0;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
int g=op?3:qpow(3,mod-2);
for(int i=1;i<lim;i<<=1){
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
void CDQ_NTT(int l,int r){
if(l==r)return;
int mid=(l+r)>>1;
CDQ_NTT(l,mid);
static int A[M],B[M];
poly::init(r-l-1+mid-l),clr(A,poly::lim),clr(B,poly::lim);
for(int i=l;i<=mid;++i)A[i-l]=f[i];
for(int i=1;i<=r-l;++i)B[i-1]=g[i];
poly::NTT(A,1),poly::NTT(B,1);
for(int i=0;i<poly::lim;++i)A[i]=1ll*A[i]*B[i]%mod;
poly::NTT(A,0);
for(int i=mid+1;i<=r;++i)fmod(f[i]+=A[i-l-1]);
CDQ_NTT(mid+1,r);
}
signed main(){
n=read(),f[0]=1;rep(i,1,n-1)g[i]=read();
CDQ_NTT(0,n-1);
rep(i,0,n-1)printf("%d ",f[i]);
return 0;
}```
CF1000F One Occurrence.cpp
```#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
int n,a[N],m,ans[N];
int size,bel[N],C;
int st[N],top,cnt[N],del[N];
struct QUE {
int id,l,r;
}que[N];
bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?bel[a.l]<bel[b.l]:bel[a.l]&1?a.r<b.r:a.r>b.r;
}
void add(int x) {
if(cnt[x]==1)++del[x];
++cnt[x];
if(cnt[x]==1) {
if(del[x])--del[x];
else st[++top]=x;
}
}
void pop(int x) {
if(cnt[x]==1)++del[x];
--cnt[x];
if(cnt[x]==1) {
if(del[x])--del[x];
else st[++top]=x;
}
}
signed main() {
n=rd(),size=sqrt(n);
for(rint i=1;i<=n;++i)
a[i]=rd(),C=max(a[i],C),bel[i]=(i-1)/size+1;
m=rd();
for(rint i=1;i<=m;++i)
que[i].id=i,que[i].l=rd(),que[i].r=rd();
sort(que+1,que+m+1,cmp);
for(rint i=1,l=1,r=0;i<=m;++i) {
while(l<que[i].l)pop(a[l++]);
while(l>que[i].l)add(a[--l]);
while(r<que[i].r)add(a[++r]);
while(r>que[i].r)pop(a[r--]);
while(del[st[top]]&&top)--del[st[top--]];
ans[que[i].id]=st[top];
}
for(rint i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
P1014 Cantor表.cpp
```#include<bits/stdc++.h>
using namespace std;
int main()
{
int a=1,t,k;
cin>>k;
while((a+1)*a/2<k)
{
a++;
}
a--;
t=k-a*(a+1)/2;
a++;
if(a%2==1)cout<<a+1-t<<"/"<<t<<endl;
else cout<<t<<"/"<<a+1-t<<endl;
return 0;
}```
P3706 [SDOI2017]硬币游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=305;
#define mod1 998244353
#define mod2 1000000007
#define base1 31
#define base2 37
int n,m,H1[N][N],H2[N][N],pw1[N],pw2[N];
db a[N][N],ans[N],pw[N];
int hash1(int id,int l,int r){
return (H1[id][r]-1ll*H1[id][l-1]*pw1[r-l+1]%mod1+mod1)%mod1;
}
int hash2(int id,int l,int r){
return (H2[id][r]-1ll*H2[id][l-1]*pw2[r-l+1]%mod2+mod2)%mod2;
}
void Gauss(int n){
rep(i,1,n){
int mx=i;
rep(j,i,n)if(fabs(a[j][i])>fabs(a[mx][i]))mx=j;
if(mx!=i)rep(j,1,n+1)swap(a[mx][j],a[i][j]);
rep(j,1,n){
if(i==j)continue;
db div=a[j][i]/a[i][i];
rep(k,i,n+1)a[j][k]-=a[i][k]*div;
}
}
rep(i,1,n)ans[i]=a[i][n+1]/a[i][i];
}
signed main(){
n=read(),m=read();
pw[0]=pw1[0]=pw2[0]=1;
rep(i,1,m)pw1[i]=1ll*pw1[i-1]*base1%mod1,pw2[i]=1ll*pw2[i-1]*base2%mod2,pw[i]=2.*pw[i-1];
rep(i,1,n){
static char str[N];scanf("%s",str+1);
rep(j,1,m)H1[i][j]=(1ll*H1[i][j-1]*base1+(str[j]=='H')+1)%mod1,H2[i][j]=(1ll*H2[i][j-1]*base2+(str[j]=='H')+1)%mod2;
}
rep(i,1,n){
db res=0;
rep(j,1,n)rep(k,1,m)
if(hash1(i,1,k)==hash1(j,m-k+1,m)&&hash2(i,1,k)==hash2(j,m-k+1,m))a[i][j]+=pw[k];
a[i][n+1]=-1,a[i][n+2]=0;
}
rep(i,1,n)a[n+1][i]=1;a[n+1][n+1]=0,a[n+1][n+2]=1;
Gauss(n+1);
for(int i=1;i<=n;++i)printf("%.10lf\n",ans[i]);
return 0;
}```
P2763 试题库问题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1050;
const int M=6e4+7;
const int inf=0x3f3f3f3f;
int k,n,a[N],num;
int hed[N],et=1,S,T,dis[N],cur[N],mf;
vector<int>ans[N];
struct edge{int nx,to,fl,id;}e[M];
void addedge(int u,int v,int fl,int id=0){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,e[et].id=id,hed[u]=et;}
void adde(int u,int v,int fl,int id=0){addedge(u,v,fl,id),addedge(v,u,0,id);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int used=0,rl;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(fl-used,e[i].fl));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
k=read(),n=read(),S=n+k+1,T=S+1;
rep(i,1,k)adde(i+n,T,a[i]=read()),num+=a[i];
rep(i,1,n){
int x=read();
adde(S,i,1);
rep(j,1,x)adde(i,read()+n,1,i);
}
while(bfs(S,T))mf+=dfs(S,inf);
if(mf!=num)return puts("No Solution!"),0;
for(int i=2;i<et;i+=2)
if(e[i].id&&e[i^1].fl)ans[e[i].to-n].pb(e[i].id);
rep(i,1,k){
printf("%d:",i);
rep(j,0,a[i]-1)printf(" %d",ans[i][j]);
puts("");
}
}```
P4299 首都.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline char rdopt(){
char ch=getchar();
while(ch!='A'&&ch!='Q'&&ch!='X')ch=getchar();
return ch;
}
const int N=100005;
int n,m,F[N],XOR;
int fa[N],ch[N][2],siz[N],siv[N];
bool fl[N];
int find(int x){return x==F[x]?x:F[x]=find(F[x]);}
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){
siz[x]=siz[ch[x][0]]+siz[ch[x][1]]+siv[x]+1;
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;fa[y]=x,fa[x]=z;
pushup(y);
}
void pushdown(int x){
if(fl[x]){
fl[x]=0,fl[ch[x][0]]^=1,fl[ch[x][1]]^=1;
swap(ch[x][0],ch[x][1]);
}
}
void splay(int x){
static int stk[N],top;
int y=x,z;stk[top=1]=y;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[z][1]==y)^(ch[y][1]==x)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),siv[x]+=siz[ch[x][1]]-siz[y],ch[x][1]=y,pushup(x);
}
void makeroot(int x){access(x),splay(x),fl[x]^=1;}
void split(int x,int y){makeroot(x),access(y),splay(y);}
void link(int x,int y){split(x,y),fa[x]=y,siv[y]+=siz[x],pushup(y);}
int getrt(int x){
int res=N,lsum=0,rsum=0,aim=siz[x]>>1;
while(x){
pushdown(x);
int sl=siz[ch[x][0]],sr=siz[ch[x][1]];
if(sl+lsum<=aim&&sr+rsum<=aim)ckmin(res,x);
if(sl+lsum<=sr+rsum)lsum+=sl+siv[x]+1,x=ch[x][1];
else rsum+=sr+siv[x]+1,x=ch[x][0];
}
return splay(res),res;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)F[i]=i,XOR^=i,siz[i]=1;
while(m--){
char opt=rdopt();int x,y;
if(opt=='A'){
y=read(),x=read();int z,rx=find(x),ry=find(y);
link(x,y),split(rx,ry),z=getrt(ry),XOR^=rx^ry^z,F[rx]=F[ry]=F[z]=z;
}else if(opt=='Q')x=read(),printf("%d\n",find(x));
else printf("%d\n",XOR);
}
return 0;
}```
P5591 小猪佩奇学数学.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,p,k,w[1<<20],ans;
signed main(){
n=read(),p=read(),k=read();
w[0]=1,w[1]=qpow(3,(mod-1)/k);
for(int i=2;i<k;++i)w[i]=1ll*w[i-1]*w[1]%mod;
ans=1ll*n*p%mod*qpow(p+1,n-1)%mod;
int res=0;
for(int i=0;i<k;++i){
int x=qpow(1ll*p*w[i]%mod+1,n),y=0;
if(i)y=1ll*k*qpow(w[k-i]-1,mod-2)%mod;
else y=1ll*k*(k-1)/2%mod;
res=(res+1ll*x*y%mod)%mod;
}
res=1ll*res*qpow(k,mod-2)%mod,ans=(ans+mod-res)%mod;
ans=1ll*ans*qpow(k,mod-2)%mod;
cout<<ans<<'\n';
}```
CF1194D 1-2-K Game.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define db double
#define N 1005
inline bool down(int&x,const int y){
return x>y?x=y,1:0;
}
int T,n,k,sg[300];
int main(){
std::ios::sync_with_stdio(0),std::cin.tie(0),std::cout.tie(0);
std::cin>>T;
while(T--){
std::cin>>n>>k;
if(k%3)puts(n%3==0?"Bob":"Alice");
else{
n=(n-1)%(k+1)+1;
if(n==k+1)puts("Bob");
else if(n==k)puts("Alice");
else if(n%3==0)puts("Bob");
else puts("Alice");
}
// rep(i,1,40){
// sg[i]=0;
// if(i>=1)sg[i]|=!sg[i-1];
// if(i>=2)sg[i]|=!sg[i-2];
// if(i>=k)sg[i]|=!sg[i-k];
// std::cout<<sg[i]<<' ';
// }
// std::cout<<std::endl;
}
}```
CF1363E Tree Shuffling.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 200009
int n,a[N],b[N],c[N];
int tag[N],mi[N],s[2][N],ans;
vector<int>g[N];
void dfs(int u,int ft) {
if(a[u]>mi[u])tag[u]=1;
if(b[u]!=c[u])++s[b[u]][u];
for(int v:g[u])if(v!=ft) {
mi[v]=min(a[v],mi[u]),dfs(v,u);
s[0][u]+=s[0][v],s[1][u]+=s[1][v];
}
if(!tag[u]) {
int k=min(s[0][u],s[1][u]);
ans+=2*a[u]*k,s[0][u]-=k,s[1][u]-=k;
}
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd(),b[i]=rd(),c[i]=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].push_back(y),g[y].push_back(x);
}
mi[1]=a[1],dfs(1,0);
if(s[0][1]||s[1][1])puts("-1");
else printf("%lld\n",ans);
return 0;
}```
P3343 [ZJOI2015]地震后的幻想乡.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=10;
const int M=N*(N-1)/2+5;
int n,m,mp[N][N],num[1<<N];
LL f[1<<N][M],g[1<<N][M],C[M][M];
db ans;
void out(int n,int msk){
for(int i=0;i<n;++i)putchar((msk>>i&1)+'0');
}
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read()-1,y=read()-1;
mp[x][y]=mp[y][x]=1;
}
C[0][0]=1;
for(int i=1;i<=m;++i){
C[i][0]=1;
for(int j=1;j<=i;++j)
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
for(int i=0;i<1<<n;++i){
for(int j=0;j<n;++j)
for(int k=j+1;k<n;++k)
if(i>>j&1&&i>>k&1&&mp[j][k])++num[i];
}
for(int i=0;i<n;++i)f[1<<i][0]=1;
for(int msk=0;msk<1<<n;++msk){
for(int i=0;i<=num[msk];++i){
for(int ms=(msk-1)&msk;ms;ms=(ms-1)&msk){
if(ms&(msk&-msk))
for(int j=0;j<=num[ms];++j)
g[msk][i]+=f[ms][j]*C[num[msk^ms]][i-j];
}
f[msk][i]=C[num[msk]][i]-g[msk][i];
}
}
/*
for(int msk=(1<<n)-1;msk<1<<n;++msk){
cerr<<"msk=";out(n,msk);cerr<<'\n';
cerr<<"f:";for(int j=0;j<=m;++j)cerr<<f[msk][j]<<' ';cerr<<'\n';
cerr<<"g:";for(int j=0;j<=m;++j)cerr<<g[msk][j]<<' ';cerr<<'\n';
}
*/
for(int i=0;i<=m;++i)ans+=1.*g[(1<<n)-1][i]/C[m][i];
printf("%.6lf\n",ans/=(m+1));
return 0;
}```
P4619 [SDOI2018]旧试题.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=821535+5;
#define mod 1000000007
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int A,B,C,mx,ans;
int mu[N],pri[N],pct,sum[N],tot,tag[N];
bool vis[N];
vector<int>d[N];
int U[M],V[M],ord[N],deg[N],tu[M],tv[M],cnt,LCM[M],id[M];
vector<pair<int,int> >e[N];
pair<int,int>p[N];
void init(const int&N){
mu[1]=1;
for(int i=2;i<=N;++i){
if(!vis[i])pri[++pct]=i,mu[i]=-1;
for(int j=1;j<=pct&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){mu[i*pri[j]]=0;break;}
mu[i*pri[j]]=-mu[i];
}
}
for(int i=1;i<=N;++i){
if(!mu[i])continue;
for(int j=1;i*j<=N;++j)if(mu[i*j])d[i].pb(i*j);
}
for(int i=1;i<=N;++i)
for(int j=0,up=sz(d[i]);j<up;++j)
for(int k=j;k<up&&1ll*d[i][j]*d[i][k]/i<=N;++k)
if(__gcd(d[i][j],d[i][k])==i)U[++tot]=d[i][j],V[tot]=d[i][k],LCM[tot]=d[i][j]/i*d[i][k];
for(int i=1;i<=N;++i){
int res=0;
for(int l=1,r;l<=i;l=r+1)
r=i/(i/l),res+=(i/l)*(r-l+1);
sum[i]=res;
}
}
int lcm(int x,int y){return x/__gcd(x,y)*y;}
LL f(int x,int y,int z){return 1ll*sum[x]*sum[y]*sum[z];}
void Main(){
A=read(),B=read(),C=read(),mx=max(A,max(B,C)),fill(deg+1,deg+mx+1,0),fill(tag+1,tag+mx+1,0),ans=0,cnt=0;
rep(i,1,tot)if(LCM[i]<=mx)++deg[U[i]],++deg[V[i]],++cnt,tu[cnt]=U[i],tv[cnt]=V[i],id[cnt]=i;
rep(i,1,mx)p[i]=mkp(deg[i],i);
sort(p+1,p+mx+1);
rep(i,1,mx)ord[p[i].se]=i,e[i].clear();
rep(i,1,cnt)
if(ord[tu[i]]>ord[tv[i]])e[tu[i]].pb(mkp(tv[i],LCM[id[i]]));
else e[tv[i]].pb(mkp(tu[i],LCM[id[i]]));
rep(u,1,mx){
for(int i=0,up=sz(e[u]);i<up;++i)tag[e[u][i].fi]=u;
for(int i=0,up1=sz(e[u]);i<up1;++i){
int v=e[u][i].fi;
for(int j=0,up2=sz(e[v]);j<up2;++j){
int w=e[v][j].fi;
if(tag[w]==u){
int x=e[u][i].se,y=e[v][j].se,z=lcm(w,u);unsigned long long res=0;
if(u!=v&&u!=w&&v!=w)
res=f(A/x,B/y,C/z)+f(A/x,B/z,C/y)+f(A/y,B/x,C/z)+f(A/y,B/z,C/x)+f(A/z,B/x,C/y)+f(A/z,B/y,C/x);
else if(u==v&&u==w&&v==w)res=f(A/x,B/y,C/z);
else res=f(A/x,B/y,C/z)+f(A/y,B/z,C/x)+f(A/z,B/x,C/y);
int t=res%mod;
fmod(ans+=1ll*mu[u]*mu[v]*mu[w]*t);
}
}
}
}
printf("%d\n",ans);
}
signed main(){
init(100000);
for(int T=read();T;--T)Main();
}
/*
5
10 10 10
100 100 100
1000 1000 1000
10000 10000 10000
100000 100000 100000
2
100000 100000 100000
100000 100000 100000
*/```
CF1178E Archaeology.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e6+10;
char s[N];
int n;
vector<char>v[2];
signed main() {
scanf("%s",s+1),n=strlen(s+1);
for(rint i=1,j=n;j-i>=3;i+=2,j-=2) {
if(s[i]==s[j])v[0].pb(s[i]),v[1].pb(s[j]);
else if(s[i]==s[j-1])v[0].pb(s[i]),v[1].pb(s[j-1]);
else if(s[i+1]==s[j])v[0].pb(s[i+1]),v[1].pb(s[j]);
else if(s[i+1]==s[j-1])v[0].pb(s[i+1]),v[1].pb(s[j-1]);
}
if(n%4!=0)v[0].pb(s[1+n/2]);
for(rint i=0;i<v[0].size();++i)putchar(v[0][i]);
for(rint i=v[1].size()-1;i>=0;--i)putchar(v[1][i]);
}```
P4747 [CERC2017]Intrinsic Interval.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int D=N<<2;
const int M=N*25;
int n,m,a[N],pos[N];
int bin[18],lg[N];
int lp[D],rp[D],Lp[D],Rp[D],ind[D];
int sta[D],timer,top,dfn[D],low[D],scc[D],C;
int maxpos;
struct ST_table {
int st_max[18][N],st_min[18][N],n;
void init() {
for(rint i=1;i<=lg[n];++i)
for(rint j=1;j+bin[i]-1<=n;++j)
st_max[i][j]=max(st_max[i-1][j],st_max[i-1][j+bin[i-1]]),
st_min[i][j]=min(st_min[i-1][j],st_min[i-1][j+bin[i-1]]);
}
int query_max(int l,int r) {
if(l>r)l^=r^=l^=r;
int x=lg[r-l+1];
return max(st_max[x][l],st_max[x][r-bin[x]+1]);
}
int query_min(int l,int r) {
if(l>r)l^=r^=l^=r;
int x=lg[r-l+1];
return min(st_min[x][l],st_min[x][r-bin[x]+1]);
}
}st[2];
struct graph {
int nxt[M],head[M],to[M],num_edge;
graph(){num_edge=0;}
void addedge(int u,int v) {
++num_edge;
to[num_edge]=v;
nxt[num_edge]=head[u];
head[u]=num_edge;
}
}g,dag;
struct Segment_Tree {
#define lc p<<1
#define rc p<<1|1
void build(int l,int r,int p) {
maxpos=max(maxpos,p);
if(l==r)return void(pos[l]=p);
int mid=(l+r)>>1;
g.addedge(p,lc),g.addedge(p,rc);
build(l,mid,lc),build(mid+1,r,rc);
}
void update(int ql,int qr,int l,int r,int p,int k) {
if(ql<=l&&r<=qr) {g.addedge(k,p);return;}
int mid=(l+r)>>1;
if(mid>=ql)update(ql,qr,l,mid,lc,k);
if(mid<qr)update(ql,qr,mid+1,r,rc,k);
}
}seg;
void init() {
memset(lp,0x3f,sizeof(lp));
memset(rp,0,sizeof(rp));
bin[0]=1;for(rint i=1;i<=17;++i)bin[i]=bin[i-1]<<1;
lg[0]=-1;for(rint i=1;i<=n;++i)lg[i]=lg[i>>1]+1;
}
void tarjan(int u) {
dfn[u]=low[u]=++timer;
sta[++top]=u;
for(rint i=g.head[u];i;i=g.nxt[i]) {
int v=g.to[i];
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u]) {
scc[u]=++C,Lp[C]=lp[u],Rp[C]=rp[u];
while(sta[top]!=u) {
scc[sta[top]]=C;
Lp[C]=min(Lp[C],lp[sta[top]]);
Rp[C]=max(Rp[C],rp[sta[top]]);
--top;
}
--top;
}
}
void build_DAG() {
for(rint u=1;u<=maxpos;++u) {
for(rint i=g.head[u];i;i=g.nxt[i]) {
int v=g.to[i];
if(scc[u]!=scc[v])dag.addedge(scc[v],scc[u]),++ind[scc[u]];
}
}
}
void toposort() {
queue<int>q;
for(rint i=1;i<=C;++i)if(!ind[i])q.push(i);
while(!q.empty()) {
int u=q.front();q.pop();
for(rint i=dag.head[u];i;i=dag.nxt[i]) {
int v=dag.to[i];
Lp[v]=min(Lp[u],Lp[v]);
Rp[v]=max(Rp[u],Rp[v]);
--ind[v];
if(!ind[v])q.push(v);
}
}
}
signed main() {
n=rd(),init(),seg.build(1,n-1,1);
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1;i<=n;++i)
st[0].st_min[0][a[i]]=i,
st[0].st_max[0][a[i]]=i;
st[0].n=n,st[0].init();
for(rint i=1;i<n;++i) {
lp[pos[i]]=st[0].query_min(a[i],a[i+1]);
rp[pos[i]]=st[0].query_max(a[i],a[i+1]);
seg.update(lp[pos[i]],rp[pos[i]]-1,1,n-1,1,pos[i]);
}
tarjan(1);
build_DAG();
toposort();
for(rint i=1;i<n;++i)
st[1].st_min[0][i]=Lp[scc[pos[i]]],
st[1].st_max[0][i]=Rp[scc[pos[i]]];
st[1].n=n-1,st[1].init();
m=rd();
while(m--) {
int x=rd(),y=rd();
if(x==y) {printf("%d %d\n",x,y);continue;}
printf("%d %d\n",st[1].query_min(x,y-1),st[1].query_max(x,y-1));
}
return 0;
}
```
P5308 [COCI2019] Quiz.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const db inf=1e14;
const db eps=1e-12;
int n,k,g[N],q[N],H,T;
db f[N],res;
db slope(int i,int j){
return 1.*(f[i]-f[j])/(i-j);
}
int check(db sl){
q[H=T=1]=0;
for(int i=1;i<=n;++i){
while(H<T&&slope(q[H],q[H+1])>1./i)++H;
f[i]=f[q[H]]+1.*(i-q[H])/i-sl,g[i]=g[q[H]]+1;
while(H<T&&slope(q[T-1],q[T])<slope(q[T-1],i))--T;
q[++T]=i;
}
return g[n];
}
signed main(){
n=read(),k=read();
db l=0,r=inf;
while(r-l>eps){
db mid=(l+r)/2;int tmp=check(mid);
if(tmp>=k)l=mid,res=1.*k*mid+f[n];
else r=mid;
}
printf("%.9Lf\n",res);
return 0;
}```
CF1059D Nature Reserve.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
struct node {
db l,r;
node(){}
node(db l_,db r_){l=l_,r=r_;}
node operator + (const node&t){return node(max(l,t.l),min(r,t.r));}
};
const db inf=1e15;
struct point {
db x,y;
}a[N];
int n;
db ans=-1;
bool check(db k) {
node res=node(-inf,inf);
for(int i=1;i<=n;++i) {
db delta=8*a[i].y*k-4*a[i].y*a[i].y;
if(delta<0)return 0;
node now=node(2*a[i].x-sqrt(delta),2*a[i].x+sqrt(delta));
res=res+now;
}
return res.l-1e-10<res.r;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
bool f1=0,f2=0;
for(int i=1;i<=n;++i) {
cin>>a[i].x>>a[i].y;
f1|=a[i].y>0,f2|=a[i].y<0;
if(f1&&f2)return puts("-1"),0;
a[i].y=fabs(a[i].y);
}
db l=-inf,r=inf;
for(int i=1;i<=114;++i) {
db mid=(l+r)/2;
if(check(mid))ans=mid,r=mid;
else l=mid;
}
if(fabs(ans+1)<1e-10)puts("-1");
else printf("%.10lf\n",ans);
return 0;
}```
CF985F Isomorphic Strings.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
struct Rand{
unsigned long long sa,sb,sc;
static const int basic=(1<<30)-1;
Rand(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
void init(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
inline int rand(){
sa^=sa<<32,sa^=sa>>13,sa^=sa<<1;
unsigned long long t=sa;
sa=sb,sb=sc,sc^=t^sa;
return static_cast<int>(sc&basic)+1;
}
int rad(int l,int r){return rand()%(r-l+1)+l;}
};
template<int N>
struct String_Hash{
static const int O=N+5;
LL H1[O],H2[O],pw1[O],pw2[O],mod1,mod2;
int base1,base2;
String_Hash(){
static const int base[8]={31,37,41,43,47,53,59,61};
static const LL mod[8]={100000000000031ll,100000000000367ll,100000000000169ll,100000000000261ll,
10000000000000069ll,10000000000000639ll,10000000000000753ll,10000000000000669ll};
static Rand maker;
base1=base[maker.rand()&7];
while((base2=base[maker.rand()&7])==base1);
mod1=mod[maker.rand()&7];
while((mod2=mod[maker.rand()&7])==mod1);
pw1[0]=1;for(int i=1;i<=N;++i)pw1[i]=pw1[i-1]*base1%mod1;
pw2[0]=1;for(int i=1;i<=N;++i)pw2[i]=pw2[i-1]*base2%mod2;
}
void insert(char*str,int c){
int n=strlen(str);
H1[0]=H2[0]=0;
for(int i=0;i<n;++i)if(str[i]-'a'==c)H1[i+1]=(H1[i]*base1+2)%mod1;else H1[i+1]=(H1[i]*base1+1)%mod1;
for(int i=0;i<n;++i)if(str[i]-'a'==c)H2[i+1]=(H2[i]*base2+2)%mod2;else H2[i+1]=(H2[i]*base2+1)%mod2;
}
LL mul(LL x,LL y,LL mod){
LL res=x*y-(LL)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
pair<LL,LL>Hash_val(int l,int r){
LL v1=(H1[r]-mul(H1[l-1],pw1[r-l+1],mod1)+mod1)%mod1;
LL v2=(H2[r]-mul(H2[l-1],pw2[r-l+1],mod2)+mod2)%mod2;
return mkp(v1,v2);
}
};
const int N=200005;
String_Hash<N>H[26];
int n,m,sum[N][26];
char str[N];
signed main(){
scanf("%d%d%s",&n,&m,str+1);
rep(i,1,25)H[i]=H[0];
rep(i,0,25)H[i].insert(str+1,i);
rep(i,1,n){
rep(j,0,25)sum[i][j]=sum[i-1][j];
++sum[i][str[i]-'a'];
}
while(m--){
static pair<int,int>X[26],Y[26];
static int sx[26],sy[26];
int x=read(),y=read(),len=read(),ans=1;
rep(i,0,25)sx[i]=sum[x+len-1][i]-sum[x-1][i],sy[i]=sum[y+len-1][i]-sum[y-1][i];
sort(sx,sx+26),sort(sy,sy+26);
rep(i,0,25)if(sx[i]!=sy[i]){ans=0;break;}
if(!ans){puts("NO");continue;}
rep(i,0,25)X[i]=H[i].Hash_val(x,x+len-1),Y[i]=H[i].Hash_val(y,y+len-1);
sort(X,X+26),sort(Y,Y+26);
rep(i,0,25)if(X[i]!=Y[i]){ans=0;break;}
puts(ans?"YES":"NO");
}
return 0;
}
/*
10 1
accbaaccac
6 8 3
7 4
abacaba
1 1 1
1 4 2
2 1 3
2 4 3
*/```
P6568 [NOI Online #3 提高组]水壶.cpp
```#include<bits/stdc++.h>
using namespace std;
int n,a[1000005],s[1000005],ans,k;
signed main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i)scanf("%d",&a[i]),s[i]=s[i-1]+a[i];
for(int i=k+1;i<=n;++i)ans=max(ans,s[i]-s[i-k-1]);
printf("%d\n",ans);
return 0;
}```
CF1131F Asya And Kittens.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 150005
int n,pre[N],suf[N],Lm[N],Rm[N],fa[N],val[N];
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
signed main(){
n=read();
for(int i=1;i<=n;++i)fa[i]=i,Lm[i]=Rm[i]=i,val[i]=i;
for(int i=1;i<n;++i){
int x=read(),y=read();
int fx=find(x),fy=find(y);
if(!pre[Lm[fx]])pre[Lm[fx]]=Rm[fy],suf[Rm[fy]]=Lm[fx],Lm[fx]=Lm[fy];
else suf[Rm[fx]]=Lm[fy],pre[Lm[fy]]=Rm[fx],Rm[fx]=Rm[fy];
fa[fy]=fx;
}
for(int i=Lm[find(1)];i;i=suf[i])printf("%d ",i);
puts("");
return 0;
}```
CF852B Neural Network country.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,L,m,v[3][1000000],ans;
struct Matrix{
int a[100][100];
Matrix(){memset(a,0,sizeof(a));}
void e(){rep(i,0,m-1)rep(j,0,m-1)a[i][j]=i==j;}
int*operator[](const int&k){return a[k];}
inline Matrix operator*(const Matrix&b){
Matrix res;
rep(i,0,m-1)rep(j,0,m-1)rep(k,0,m-1)fmod(res.a[i][j]+=1ll*a[i][k]*b.a[k][j]%mod);
return res;
}
void print(){
rep(i,0,m-1)rep(j,0,m-1)printf("%d%c",a[i][j]," \n"[j==m-1]);
}
}sta,tur;
inline Matrix Matrix_pow(Matrix n,int k){
if(!k){
Matrix qwq;qwq.e();return qwq;
}
Matrix res=n;--k;
for(;k;k>>=1,n=n*n)if(k&1)res=res*n;
return res;
}
signed main(){
n=read(),L=read(),m=read();
rep(i,0,2)rep(j,0,n-1)v[i][j]=read()%m;
rep(i,0,n-1)++sta[0][v[0][i]%m];
rep(i,0,n-1)rep(j,0,m-1)++tur[j][(v[1][i]+j)%m];
// sta.print(),tur.print();
sta=sta*Matrix_pow(tur,L-2);
// sta.print();
rep(i,0,n-1)
fmod(ans+=sta[0][(2*m-v[2][i]-v[1][i])%m]);
printf("%d\n",ans);
return 0;
}```
CF1202E You Are Given Some Strings....cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 200005
string T,str[N];
int n,f[N],g[N];
LL cnt[N];
int ch[N][26],tot,fail[N];
LL ans;
vector<int>e[N];
void clear(){
for(int i=0;i<=tot;++i)e[i].clear();
tot=0;
memset(cnt,0,sizeof(cnt));
memset(ch,0,sizeof(ch));
memset(fail,0,sizeof(fail));
}
void insert(string str){
int u=0;
for(int i=0;i<sz(str);++i){
int c=str[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
++cnt[u];
}
void build_fail(){
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=tot;++i)e[fail[i]].pb(i);
}
void dfs(int u){
for(int v:e[u])cnt[v]+=cnt[u],dfs(v);
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>T>>n;
for(int i=1;i<=n;++i)cin>>str[i];
for(int i=1;i<=n;++i)insert(str[i]);
build_fail(),dfs(0);
for(int u=0,i=0;i<sz(T);++i)u=ch[u][T[i]-'a'],f[i]=cnt[u];
// cout<<"cnt:";for(int i=0;i<=tot;++i)cout<<cnt[i]<<' ';cout<<'\n';
// cout<<"fail:";for(int i=0;i<=tot;++i)cout<<fail[i]<<' ';cout<<'\n';
clear();
for(int i=1;i<=n;++i)reverse(str[i].begin(),str[i].end()),insert(str[i]);
build_fail(),dfs(0);
// for(int u=0,i=sz(T)-1;~i;--i)u=ch[u][T[i]-'a'],g[i]=cnt[u];
for(int u=0,i=sz(T)-1;~i;--i)u=ch[u][T[i]-'a'],g[i]=cnt[u];
// cout<<"f:";for(int i=0;i<sz(T);++i)cout<<f[i]<<' ';cout<<'\n';
// cout<<"g:";for(int i=0;i<sz(T);++i)cout<<g[i]<<' ';cout<<'\n';
for(int i=1;i<sz(T);++i)ans+=1ll*f[i-1]*g[i];
cout<<ans<<'\n';
return 0;
}
/*
abcdabcd
4
d
cd
a
ab
*/```
CF1042B Vitamins.cpp
```#include<bits/stdc++.h>
#define N 100009
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,c[N],a[N],dp[8];
char s[N];
signed main() {
memset(dp,0x3f,sizeof(dp));
n=rd();
for(int i=1;i<=n;++i) {
c[i]=rd(),scanf("%s",s+1);
for(int j=1,m=strlen(s+1);j<=m;++j)a[i]|=(1<<(s[j]-'A'));
}
for(int i=1;i<=n;++i) {
dp[a[i]]=std::min(dp[a[i]],c[i]);
for(int msk=0;msk<8;++msk)
dp[msk|a[i]]=std::min(dp[msk|a[i]],dp[msk]+c[i]);
}
if(dp[7]==0x3f3f3f3f)puts("-1");
else printf("%d\n",dp[7]);
return 0;
}```
P6139 【模板】广义后缀自动机（广义 SAM）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e6+10;
const int M=N<<1;
int n;
LL ans;
char s[N];
int lst,tot=1,ch[M][26],link[M],maxlen[M];
int ins(int c,int lst) {
if(ch[lst][c]) {
int p=lst,q=ch[p][c];
if(maxlen[q]==maxlen[p]+1)return q;
else {
int nq=++tot;maxlen[nq]=maxlen[p]+1;
for(rint i=0;i<26;++i)ch[nq][i]=ch[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&ch[p][c]==q;p=link[p])ch[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;maxlen[np]=maxlen[p]+1;
for(;p&&!ch[p][c];p=link[p])ch[p][c]=np;
if(!p)link[np]=1;
else {
int q=ch[p][c];
if(maxlen[q]==maxlen[p]+1)link[np]=q;
else {
int nq=++tot;maxlen[nq]=maxlen[p]+1;
for(rint i=0;i<26;++i)ch[nq][i]=ch[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&ch[p][c]==q;p=link[p])ch[p][c]=nq;
}
}
return np;
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i) {
scanf("%s",s),lst=1;
for(rint j=0,len=strlen(s);j<len;++j)lst=ins(s[j]-'a',lst);
}
for(rint i=2;i<=tot;++i)ans+=maxlen[i]-maxlen[link[i]];
printf("%lld\n",ans);
return 0;
}```
P3812 【模板】线性基.cpp
```#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cmath>
using std::cout;
using std::endl;
using std::vector;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
#define int long long
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 50009
#define T (N<<2)
#define A 50
//LinearBase
struct LinearBase {
int d[A+1];
LinearBase(){memset(d,0,sizeof(d));}
void insert(int x) {
for(int i=A;~i;--i)
if(x>>i&1) {
if(d[i])x^=d[i];
else return d[i]=x,void();
}
}
int query(int x) {
for(int i=A;~i;--i)x=max(x,x^d[i]);
return x;
}
void reset() {
*this=LinearBase();
}
}lb;
signed main() {
int n=rd();
for(int i=1;i<=n;++i)lb.insert(rd());
printf("%lld\n",lb.query(0));
return 0;
}```
fhq Treap.cpp
```const int N=1100005;
int n,m,rt,tot,ans;
int siz[N],ch[N][2],val[N],rnd[N];
inline void pushup(int u) {
siz[u]=siz[ch[u][0]]+siz[ch[u][1]]+1;
}
inline int newnode(int x) {
++tot,rnd[tot]=rand(),val[tot]=x,siz[tot]=1;
return tot;
}
int merge(int x,int y) {
if(!x||!y)return x|y;
if(rnd[x]<rnd[y]){
ch[x][1]=merge(ch[x][1],y);
return pushup(x),x;
}else{
ch[y][0]=merge(x,ch[y][0]);
return pushup(y),y;
}
}
void split(int u,int k,int &x,int &y) {
if(!u)return x=y=0,void();
if(val[u]<=k)x=u,split(ch[u][1],k,ch[u][1],y);
else y=u,split(ch[u][0],k,x,ch[u][0]);
pushup(u);
}
inline void insert(int x) {
int a,b;
split(rt,x,a,b);
rt=merge(merge(a,newnode(x)),b);
}
inline void del(int x) {
int a,b,c;
split(rt,x,a,b);
split(a,x-1,a,c);
c=merge(ch[c][0],ch[c][1]);
rt=merge(merge(a,c),b);
}
inline int rk(int x) {
int a,b;
split(rt,x-1,a,b);
int res=siz[a]+1;
rt=merge(a,b);
return res;
}
inline int kth(int u,int k) {
while(true) {
if(k<=siz[ch[u][0]])u=ch[u][0];
else if(k==siz[ch[u][0]]+1)return val[u];
else k-=siz[ch[u][0]]+1,u=ch[u][1];
}
}
inline int lowerbound(int x) {
int a,b;
split(rt,x-1,a,b);
int res=kth(a,siz[a]);
rt=merge(a,b);
return res;
}
inline int upperbound(int x) {
int a,b;
split(rt,x,a,b);
int res=kth(b,1);
rt=merge(a,b);
return res;
}```
CF1469F Power Sockets.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=800005;
int n,k,l[N];
LL sum,d[N];
signed main(){
n=read(),k=read(),sum=1;
rep(i,1,n)l[i]=read(),sum+=l[i];
sort(l+1,l+n+1,greater<int>()),sum-=n<<1;
if(sum<k)return puts("-1"),0;
int it=1;d[0]=1,d[1]=-1,sum=0;
for(int i=0;"fyy AK IOI";++i){
sum+=d[i],d[i+1]+=d[i];
if(sum+d[i+1]>=k)return printf("%d\n",i+1),0;
for(;d[i]>0&&it<=n;++it){
int l1=(l[it]-1)/2,l2=l[it]-1-l1;
d[i+2]+=2,--d[i+2+l1],--d[i+2+l2],--d[i],--sum;
}
}
assert(0);
}```
CF1260B Obtain Two Zeroes.cpp
```#include<bits/stdc++.h>
using namespace std;
int n,a,b;
int main() {
scanf("%d",&n);
while(n--) {
scanf("%d%d",&a,&b);
if(a>b)swap(a,b);
if(b>2*a){puts("NO");continue;}
if((2*a-b)%3==0)puts("YES");
else puts("NO");
}
return 0;
} ```
P3793 由乃救爷爷.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
namespace GenHelper {
unsigned z1,z2,z3,z4,b;
unsigned rand_() {
b=((z1<<6)^z1)>>13;
z1=((z1&4294967294U)<<18)^b;
b=((z2<<2)^z2)>>27;
z2=((z2&4294967288U)<<2)^b;
b=((z3<<13)^z3)>>21;
z3=((z3&4294967280U)<<7)^b;
b=((z4<<3)^z4)>>12;
z4=((z4&4294967168U)<<13)^b;
return (z1^z2^z3^z4);
}
}
void srand(unsigned x) {
using namespace GenHelper;
z1=x;
z2=(~x)^0x233333333U;
z3=x^0x1234598766U;
z4=(~x)+51;
}
int read() {
using namespace GenHelper;
int a=rand_()&32767;
int b=rand_()&32767;
return a*32768+b;
}
const int N=20000010;
const int B=N/30;
int n,m,s,S,num,bel[N],L[B],R[B],a[N];
int st[21][B],suf[N],pre[N];
int bin[21],lg[N];
LL ans;
int query(int l,int r) {
if(bel[l]==bel[r]) {
int res=0;
for(int i=l;i<=r;++i)res=res>a[i]?res:a[i];
return res;
}
int res=max(suf[l],pre[r]);
if(bel[l]+1==bel[r])return res;
int x=lg[bel[r]-1-bel[l]];
res=max(res,max(st[x][bel[l]+1],st[x][bel[r]-bin[x]]));
return res;
}
signed main() {
cin>>n>>m>>s;
srand(s);
S=4500,num=(n-1)/S+1;
bin[0]=1;for(int i=1;i<=20;++i)bin[i]=bin[i-1]<<1;
for(int i=1;i<=n;++i)a[i]=read(),bel[i]=(i-1)/S+1;
lg[0]=-1;for(int i=1;i<=num;++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=num;++i)L[i]=(i-1)*S+1,R[i]=i*S;
R[num]=n;
for(int i=1;i<=num;++i) {
pre[L[i]]=a[L[i]];for(int j=L[i]+1;j<=R[i];++j)pre[j]=max(pre[j-1],a[j]);
suf[R[i]]=a[R[i]];for(int j=R[i]-1;j>=L[i];--j)suf[j]=max(suf[j+1],a[j]);
st[0][i]=suf[L[i]];
}
for(int i=1;i<=lg[num];++i)
for(int j=1;j+bin[i]-1<=num;++j)
st[i][j]=max(st[i-1][j],st[i-1][j+bin[i-1]]);
while(m--) {
int l=read()%n+1,r=read()%n+1;
if(l>r)l^=r^=l^=r;
ans+=query(l,r);
}
cout<<ans<<endl;
return 0;
}
/*
20000000 20000000 13249
*/```
P3177 [HAOI2015]树上染色.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 2005
int n,k,siz[N];
LL dp[N][N],cpy[N];
int head[N],num_edge;
struct edge{int nxt,to,val;}e[N<<1];
void addedge(int fr,int to,int val){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void ckmax(LL&x,LL y){if(x<y)x=y;}
void dfs(int u,int ft){
siz[u]=1,dp[u][0]=dp[u][1]=0;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
dfs(v,u);
for(int j=0;j<=siz[u];++j)cpy[j]=dp[u][j];
for(int j=0,mx1=min(siz[u],k);j<=mx1;++j)
for(int l=0,mx2=min(siz[v],k-j);l<=mx2;++l)
ckmax(dp[u][j+l],cpy[j]+dp[v][l]+1ll*l*(k-l)*e[i].val+1ll*(siz[v]-l)*(n-k-(siz[v]-l))*e[i].val);
siz[u]+=siz[v];
}
}
signed main(){
n=read(),k=read();
for(int i=1;i<n;++i){
int x=read(),y=read(),z=read();
addedge(x,y,z),addedge(y,x,z);
}
memset(dp,-0x3f,sizeof(dp));
dfs(1,0);
printf("%lld\n",dp[1][k]);
return 0;
}```
CF1349F1 Slime and Sequences (Easy Version).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
const int N=5005;
int o[N][N],n,ans[N],fac[N],ifc[N];
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
signed main(){
n=read();
o[0][0]=1;
rep(i,1,n)rep(j,0,i-1){
o[i][j]=1ll*o[i-1][j]*(j+1)%mod;
if(j>0)o[i][j]=(1ll*o[i-1][j-1]*(i-j)%mod+o[i][j])%mod;
}
fac[0]=1;rep(i,1,n)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);per(i,n-1,0)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
rep(k,1,n)rep(i,1,n)ans[k]=(ans[k]+1ll*fac[n-i]*o[i][k-1]%mod*comb(n,i)%mod)%mod;
rep(i,1,n)printf("%d%c",ans[i]," \n"[i==n]);
return 0;
}```
CF1147F Zigzag Game.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=55;
int n,w[N][N],mch[N<<1],kth[N<<1],rk[N<<1][N<<1],ID;
vector<int>e[N<<1];
bool cmp1(const int&a,const int&b){return w[ID][a-n]>w[ID][b-n];}
bool cmp2(const int&a,const int&b){return w[a][ID-n]<w[b][ID-n];}
void init(){//稳定婚姻问题模板
fill(mch+1,mch+n*2+1,0),fill(kth+1,kth+n*2+1,0);
queue<int>q;
rep(i,1,n){
e[i].resize(n+1),e[i+n].resize(n+1);//每一个点的匹配边大小是 n
rep(j,1,n)e[i][j]=j+n,e[i+n][j]=j;//拉边
ID=i,sort(e[i].begin()+1,e[i].begin()+n+1,cmp1);
ID=i+n,sort(e[i+n].begin()+1,e[i+n].begin()+n+1,cmp2);//两边的点对于“优”的定义不同
rep(j,1,n)rk[i][e[i][j]]=j,rk[i+n][e[i+n][j]]=j;//处理对于 i 这个节点的所有可能的匹配 j 在 i 看来的优秀程度
q.push(i);
}
while(!q.empty()){
bool flg=0;
int u=q.front();q.pop();
int v=e[u][++kth[u]];//kth 是 u 当前最优的匹配排名
if(!mch[v])mch[u]=v,mch[v]=u;//v 还没有匹配
else if(rk[v][u]<rk[v][mch[v]]){
if(mch[v]<=n)q.push(mch[v]);
mch[mch[v]]=0,mch[v]=u,mch[u]=v;//v 认为 u 更优
}else q.push(u);
}
}
void Main(){
scanf("%d",&n);
rep(i,1,n)rep(j,1,n)w[i][j]=read();
printf("B\n"),fflush(stdout);
char fyyAK[5];int x;
scanf("%s%d",fyyAK,&x);
if((fyyAK[0]=='I')^(x>n))rep(i,1,n)rep(j,1,n)w[i][j]*=-1;
init();
while("fyy txdy"){//只能膜拜！
printf("%d\n",mch[x]),fflush(stdout);
scanf("%d",&x);if(!~x)break;
}
}
signed main(){for(int T=read();T;--T)Main();}```
P3857 [TJOI2008]彩灯.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=2008;
int n,m,ele;
char s[70];
LL d[70];
void ins(LL x) {
for(rint i=50;i>=0;--i) {
if(x>>i&1) {
if(d[i])x^=d[i];
else {d[i]=x,++ele;break;}
}
}
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=m;++i) {
scanf("%s",s);LL x=0;
for(rint j=0;j<n;++j)if(s[j]=='O')x|=1ll<<j;
ins(x);
}
printf("%lld\n",(1ll<<ele)%mod);
return 0;
}
```
P2617 Dynamic Rankings.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define lowbit(i) (i&(-i))
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int ls[N*170],rs[N*170],val[N*170],rt[N];
int n,m,a[N],b[N<<1],num,tot;
int L[40],R[40],tl,tr;
struct QUERY {
int opt,x,y,z;
}que[N];
void update(int &o,int l,int r,int pos,int w) {
if(!o)o=++tot;val[o]+=w;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[o],l,mid,pos,w);
else update(rs[o],mid+1,r,pos,w);
}
int query(int l,int r,int k) {
if(l==r)return l;
int suml=0,sumr=0;
for(rint i=1;i<=tl;++i)suml+=val[ls[L[i]]];
for(rint i=1;i<=tr;++i)sumr+=val[ls[R[i]]];
int mid=(l+r)>>1;
if(sumr-suml>=k) {
for(rint i=1;i<=tl;++i)L[i]=ls[L[i]];
for(rint i=1;i<=tr;++i)R[i]=ls[R[i]];
return query(l,mid,k);
} else {
for(rint i=1;i<=tl;++i)L[i]=rs[L[i]];
for(rint i=1;i<=tr;++i)R[i]=rs[R[i]];
return query(mid+1,r,k-(sumr-suml));
}
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)a[i]=b[++num]=rd();
char opt[6];
for(rint i=1;i<=m;++i) {
scanf("%s",opt);
que[i].opt=(opt[0]=='Q');
if(que[i].opt)que[i].x=rd(),que[i].y=rd(),que[i].z=rd();
else que[i].x=rd(),b[++num]=que[i].y=rd();
}
sort(b+1,b+num+1);
num=unique(b+1,b+num+1)-b-1;
for(rint i=1;i<=n;++i) {
int tmp=lower_bound(b+1,b+num+1,a[i])-b;
for(rint j=i;j<=n;j+=lowbit(j)) {
update(rt[j],1,num,tmp,1);
}
}
for(rint i=1;i<=m;++i) {
if(que[i].opt) {
tl=tr=0;--que[i].x;
for(rint j=que[i].x;j>0;j-=lowbit(j))L[++tl]=rt[j];
for(rint j=que[i].y;j>0;j-=lowbit(j))R[++tr]=rt[j];
printf("%d\n",b[query(1,num,que[i].z)]);
} else {
int tmp=lower_bound(b+1,b+num+1,a[que[i].x])-b;
for(rint j=que[i].x;j<=n;j+=lowbit(j))
update(rt[j],1,num,tmp,-1);
a[que[i].x]=que[i].y;
tmp=lower_bound(b+1,b+num+1,que[i].y)-b;
for(rint j=que[i].x;j<=n;j+=lowbit(j))
update(rt[j],1,num,tmp,1);
}
}
return 0;
} ```
P4318 完全平方数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n;
int pri[N/9],cnt,mu[N];
bool vis[N];
void Sieve(){
mu[1]=1;
for(int i=2;i<N;++i){
if(!vis[i])pri[++cnt]=i,mu[i]=-1;
for(int j=1;j<=cnt&&i*pri[j]<N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
mu[i*pri[j]]=-mu[i];
}
}
}
int check(int k){
int res=0;
for(int i=1;i*i<=k;++i)res+=k/i/i*mu[i];
return res;
}
void Main(){
n=read();
int l=n,r=n*2,res=-1;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid)>=n)res=mid,r=mid-1;
else l=mid+1;
}
printf("%d\n",res);
}
signed main(){
Sieve();
for(int T=read();T;--T)Main();
}```
P7299 [USACO21JAN] Dance Mooves S.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,k,a[N],b[N],c[N],col[N],tot,vis[N],ans[N];
vector<int>v[N],p[N];
signed main(){
n=read(),k=read();
rep(i,1,k)a[i]=read(),b[i]=read();
rep(i,1,n)c[i]=i;
rep(i,1,k)swap(c[a[i]],c[b[i]]);
rep(i,1,n){
if(col[i])continue;
col[i]=++tot,v[tot].pb(i);
for(int j=c[i];j!=i;j=c[j])col[j]=tot,v[tot].pb(j);
}
rep(i,1,n)c[i]=i;
rep(i,1,k){
p[col[c[a[i]]]].pb(b[i]),p[col[c[b[i]]]].pb(a[i]);
swap(c[a[i]],c[b[i]]);
}
rep(i,1,tot){
for(int j:v[i])if(vis[j]!=i)vis[j]=i,++ans[i];
for(int j:p[i])if(vis[j]!=i)vis[j]=i,++ans[i];
}
rep(i,1,n)printf("%d\n",ans[col[i]]);
return 0;
}```
CF623E Transforming Sequence.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=30005;
const int M=N<<2;
const int mod=1e9+7;
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,k,f[M],ans;
namespace poly{
const db pi=acos(-1.0);
int rev[M],lg,lim;
int fac[M],ifc[M];
void initmath(const int&n){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
}w[M];
void init_poly(const int&n){
for(lim=1,lg=0;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1)),w[i]=cp(cos(2.*pi*i/lim),sin(2.*pi*i/lim));
}
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1,t=lim>>1;i<lim;i<<=1,t>>=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const cp X=a[j+k],Y=w[t*k]*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(!op)for(int i=0;i<lim;++i)a[i].x/=lim;
}
void MTT(int*f,int*g,int*ans){
static cp A[M],B[M],C[M],D[M],E[M],F[M],G[M];
for(int i=0;i<lim;++i)
A[i]=cp(f[i]&65535,0),B[i]=cp(f[i]>>16,0),
C[i]=cp(g[i]&65535,0),D[i]=cp(g[i]>>16,0);
FFT(A,1),FFT(B,1),FFT(C,1),FFT(D,1);
for(int i=0;i<lim;++i)
E[i]=A[i]*C[i],F[i]=A[i]*D[i]+B[i]*C[i],G[i]=B[i]*D[i],w[i].y*=-1;
FFT(E,0),FFT(F,0),FFT(G,0);
for(int i=0;i<lim;++i)
ans[i]=LL(G[i].x+0.5)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(F[i].x+0.5)%mod)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(E[i].x+0.5)%mod)%mod,
w[i].y*=-1;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b) memcpy(a,b,sizeof(int)*(n))
void shift(const int&n,const int&len){
static int g[M],h[M];
clr(g,lim),clr(h,lim);
for(int i=0,bas=qpow(2,len),j=1;i<n;++i,j=1ll*j*bas%mod)g[i]=1ll*f[i]*j%mod*ifc[i]%mod;
for(int i=1;i<=n;++i)h[i]=1ll*f[i]*ifc[i]%mod;
MTT(g,h,f);
for(int i=0;i<=n;++i)f[i]=1ll*f[i]*fac[i]%mod;
clr(f+n+1,lim-n);
}
void setbit(const int&n){
static int g[M],h[M];
clr(g,lim),clr(h,lim);
for(int i=0,j=1;i<n;++i,(j<<=1)%=mod)g[i]=1ll*f[i]*j%mod*ifc[i]%mod;
for(int i=1;i<=n;++i)h[i]=ifc[i];
MTT(g,h,f);
for(int i=0;i<=n;++i)f[i]=1ll*f[i]*fac[i]%mod;
clr(f+n+1,lim-n);
}
}
using poly::fac;
using poly::ifc;
signed main(){
LL whatsthis;scanf("%lld%d",&whatsthis,&k);
if(whatsthis>k)return puts("0"),0;
n=whatsthis;
f[0]=0;rep(i,1,k)f[i]=1;
poly::init_poly(k<<1),poly::initmath(k);
for(int i=log2(n)-1,len=1;i>=0;--i){
poly::shift(k,len),len<<=1;
if(n>>i&1)poly::setbit(k),++len;
}
for(int i=n;i<=k;++i)ans=(ans+1ll*f[i]*fac[k]%mod*ifc[i]%mod*ifc[k-i]%mod)%mod;
printf("%d\n",ans);
return 0;
} ```
CF1492C Maximum width.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,m,a[N],b[N],ans;
char S[N],T[N];
signed main(){
n=read(),m=read(),scanf("%s%s",S+1,T+1);
memset(a,0x3f,sizeof(a));
int it=1;
rep(i,1,n){
if(S[i]==T[it])a[it]=i,++it;
}
it=m;
per(i,n,1){
if(S[i]==T[it])b[it]=i,--it;
}
rep(i,1,m-1)ckmax(ans,b[i+1]-a[i]);
cout<<ans<<'\n';
return 0;
}```
P7039 [NWRRC2016]Integral Polygons.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
const int C = 1e9;
int n, x[N], y[N], s[N][2][2][2], ans, sum[N];
signed main() {
n = read();
for(int i = 1; i <= n; ++i) x[i] = (read() + C) & 1, y[i] = (read() + C) & 1;
int S = 0;
for(int i = 2; i <= n; ++i) S += x[i] * y[i - 1] + y[i] * x[i - 1];
if((S + x[1] * y[n] + y[1] * x[n]) & 1) return puts("0"), 0;
for(int i = 2; i <= n; ++i) {
rep(a, 0, 1) rep(b, 0, 1) rep(c, 0, 1)
s[i][a][b][c] = s[i - 1][a][b][c];
int t = (x[i - 1] * y[i] + x[i] * y[i - 1]) & 1;
sum[i] = sum[i - 1] ^ t;
++s[i][x[i]][y[i]][sum[i]];
}
for(int i = 1; i <= n - 1; ++i) {
rep(a, 0, 1) rep(b, 0, 1) rep(c, 0, 1) {
int tmp = (x[i] * b + y[i] * a + c - sum[i] + 114514) & 1;
if(!tmp) ans += s[n][a][b][c] - s[i][a][b][c];
}
}
// rep(i, 1, n) {
// int p = 0;
// rep(j, i + 1, n) {
// p += x[j - 1] * y[j] + x[j] * y[j - 1];
// if((p + x[i] * y[j] + x[j] * y[i]) % 2 == 0) ++ans;
// }
// }
cout << ans - n << '\n';
}```
CF1139E Maximize Mex.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=5005;
int n,m,p[N],c[N],d,k[N],ans[N],now,match[N];
bool book[N],vis[N];
vector<int>g[N];
int dfs(int u){
for(int v:g[u]){
if(!vis[v]){
vis[v]=1;
if(!~match[v]||dfs(match[v])){
match[v]=u;
return 1;
}
}
}
return 0;
}
void work(){
while(1){
rep(i,1,m)vis[i]=0;
if(!dfs(now))break;
++now;
}
}
signed main(){
n=read(),m=read();
rep(i,1,n)p[i]=read();
rep(i,1,n)c[i]=read();
d=read();
rep(i,1,d)k[i]=read(),book[k[i]]=1;
memset(match,-1,sizeof(match));
rep(i,1,n)if(!book[i])g[p[i]].pb(c[i]);
per(i,d,1){
work(),ans[i]=now;
g[p[k[i]]].pb(c[k[i]]);
}
rep(i,1,d)printf("%d\n",ans[i]);
return 0;
}```
P4097 [HEOI2013]Segment.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 40000
#define M 100005
#define T (N<<2)
#define mod1 39989
#define mod2 1000000000
int lastans,cnt;
pair<db,db>li[M];
int v[T];
#define lc (p<<1)
#define rc (p<<1|1)
#define val(x,y) (1.*li[x].fi*y+li[x].se)
void update(int id,int ql,int qr,int l=1,int r=N,int p=1){
int mid=(l+r)>>1;
if(ql<=l&&r<=qr){
if(!v[p])return v[p]=id,void();
db nol=val(id,l),nor=val(id,r),lal=val(v[p],l),lar=val(v[p],r);
if(nol<=lal&&nor<=lar)return;
if(nol>=lal&&nor>=lar)return v[p]=id,void();
db inter=1.*(li[id].se-li[v[p]].se)/(li[v[p]].fi-li[id].fi);
if(nol>=lal){
if(inter<=mid)update(id,ql,qr,l,mid,lc);
else update(v[p],ql,qr,mid+1,r,rc),v[p]=id;
}else{
if(inter>mid)update(id,ql,qr,mid+1,r,rc);
else update(v[p],ql,qr,l,mid,lc),v[p]=id;
}
return;
}
if(ql<=mid)update(id,ql,qr,l,mid,lc);
if(mid<qr)update(id,ql,qr,mid+1,r,rc);
}
int query(int X,int l=1,int r=N,int p=1){
int res=0;
if(v[p]&&val(v[p],X)>val(res,X))res=v[p];
if(l==r)return res;
int mid=(l+r)>>1,t;
if(X<=mid)t=query(X,l,mid,lc);
else t=query(X,mid+1,r,rc);
if(val(res,X)<val(t,X))res=t;
return res;
}
signed main(){
for(int Te=read();Te;--Te){
static int op,xa,ya,xb,yb,qcnt=0;
op=read();
if(op){
xa=(read()+lastans-1)%mod1+1,ya=(read()+lastans-1)%mod2+1;
xb=(read()+lastans-1)%mod1+1,yb=(read()+lastans-1)%mod2+1;
if(xa>xb)swap(xa,xb),swap(ya,yb);
li[++cnt]=(xa==xb?mkp(0.,1.*max(ya,yb)):mkp(1.*(ya-yb)/(xa-xb),ya-1.*xa*(ya-yb)/(xa-xb)));
update(cnt,xa,xb);
}else{
++qcnt;
xa=(read()+lastans-1)%mod1+1;
printf("%d\n",lastans=query(xa));
}
}
}```
P4336 [SHOI2016]黑暗前的幻想乡.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=18;
#define mod 1000000007
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int n,cnt[1<<N],a[N][N],ans;
vector<pair<int,int> >v[N];
int Gauss(const int&n){
int res=1;
rep(i,1,n){
rep(j,i+1,n){
while(a[j][i]){
const int div=a[i][i]/a[j][i];
rep(k,i,n)fmod(a[i][k]-=1ll*div*a[j][k]%mod),swap(a[i][k],a[j][k]);
res*=-1;
}
}
if(!a[i][i])return 0;
res=1ll*res*a[i][i]%mod;
}
return fmod(res),res;
}
signed main(){
n=read();
rep(i,1,n-1){
int m=read();
rep(j,1,m){int x=read(),y=read();v[i].pb(mkp(x,y));}
}
rep(msk,1,(1<<(n-1))-1){
cnt[msk]=cnt[msk>>1]+(msk&1);
memset(a,0,sizeof(a));
rep(i,1,n)if(msk>>(i-1)&1){
rep(j,0,sz(v[i])-1){
int x=v[i][j].fi,y=v[i][j].se;
++a[x][x],++a[y][y],--a[x][y],--a[y][x];
}
}
fmod(ans+=1ll*((n-cnt[msk])&1?1:-1)*Gauss(n-1)%mod);
}
printf("%d\n",ans);
return 0;
}```
P3273 [SCOI2011]棘手的操作.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
const int inf=1e9+7;
int n,m,a[N],root;
int TAG_ALL;
struct Leftist_Tree {
int tag[N],val[N],fa[N],Fa[N],ls[N],rs[N],dst[N],tot;
Leftist_Tree(){tot=0;}
void init(const int &n,const int *a) {
for(int i=0;i<=n;++i) {
val[i]=a[i];
Fa[i]=fa[i]=i;
tag[i]=ls[i]=rs[i]=dst[i]=0;
}
tot=n;
}
void pushdown(int x) {
if(!tag[x])return;
val[ls[x]]+=tag[x],val[rs[x]]+=tag[x];
tag[ls[x]]+=tag[x],tag[rs[x]]+=tag[x];
tag[x]=0;
}
int merge(int x,int y) {
if(!x||!y)return x|y;
if(val[x]<val[y])swap(x,y);
pushdown(x);
rs[x]=merge(rs[x],y),Fa[rs[x]]=fa[rs[x]]=x;
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
dst[x]=dst[rs[x]]+1;
return x;
}
int build(int n) {
queue<int>q;
for(int i=1;i<=n;++i)q.push(i);
while(!q.empty()) {
if(q.size()==1)break;
int x=q.front();q.pop();
int y=q.front();q.pop();
q.push(merge(x,y));
}
return q.front();
}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int getval(int x) {
int res=val[x];
while(Fa[x]!=x)x=Fa[x],res+=tag[x];
return res;
}
int New(int x) {
++tot;
val[tot]=x;
fa[tot]=Fa[tot]=tot;
ls[tot]=rs[tot]=dst[tot]=tag[tot]=0;
return tot;
}
int insert(int v,int x) {
return merge(New(v),x);
}
int pop(int x) {
pushdown(x);
fa[ls[x]]=Fa[ls[x]]=ls[x];
fa[rs[x]]=Fa[rs[x]]=rs[x];
fa[x]=merge(ls[x],rs[x]);
ls[x]=rs[x]=dst[x]=0;
val[x]=-inf;
return fa[x];
}
int del_node(int x) {
if(x==Fa[x])return pop(x);
int zkyAKIOI=find(x);
pushdown(x);
int u=merge(ls[x],rs[x]),fx=Fa[x];
fa[u]=Fa[u]=fx;
if(ls[fx]==x)ls[fx]=u;
else rs[fx]=u;
ls[x]=rs[x]=dst[x]=0;
val[x]=-inf;
x=fx;
while(x!=Fa[x]) {
pushdown(x);
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
if(dst[x]==dst[rs[x]]+1)return zkyAKIOI;
dst[x]=dst[rs[x]]+1,x=Fa[x];
}
return zkyAKIOI;
}
}H[2];
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
H[0].init(n,a),H[1].init(n,a);
root=H[1].build(n);
for(m=rd();m;--m) {
char opt[5];int x,y;
scanf("%s",opt);
if(!strcmp(opt,"U")) {
x=rd(),y=rd();
x=H[0].find(x),y=H[0].find(y);
if(x==y)continue;
root=H[1].del_node(H[0].merge(x,y)==x?y:x);
} else if(!strcmp(opt,"A1")) {
x=rd(),y=rd();
int cnAKIOI=H[0].getval(x)+y;
int whkAKIOI=H[0].find(x);
int fyyAKIOI=H[0].del_node(x);
H[0].val[x]=cnAKIOI;
H[0].fa[x]=H[0].Fa[x]=x;
x=H[0].merge(x,fyyAKIOI);
root=H[1].del_node(whkAKIOI);
H[1].val[x]=H[0].val[x];
H[1].fa[x]=H[1].Fa[x]=x;
root=H[1].merge(root,x);
} else if(!strcmp(opt,"A2")) {
x=rd(),y=rd();
x=H[0].find(x);
H[0].tag[x]+=y;
H[0].val[x]+=y;
root=H[1].del_node(x);
H[1].val[x]=H[0].val[x];
H[1].fa[x]=H[1].Fa[x]=x;
root=H[1].merge(root,x);
} else if(!strcmp(opt,"A3"))TAG_ALL+=rd();
else if(!strcmp(opt,"F1"))printf("%d\n",H[0].getval(rd())+TAG_ALL);
else if(!strcmp(opt,"F2"))printf("%d\n",H[0].val[H[0].find(rd())]+TAG_ALL);
else if(!strcmp(opt,"F3"))printf("%d\n",H[1].val[root]+TAG_ALL);
}
return 0;
}```
P3258 [JLOI2014]松鼠的新家.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300009;
int n,a[N],dif[N];
struct edge {
int to,nxt;
}e[N<<1];
int head[N],num_edge;
int top[N],fa[N],dep[N],siz[N],son[N];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dep[v]=dep[u]+1;
fa[v]=u;
dfs1(v,u);
siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int LCA(int x,int y) {
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
void dfs(int u,int ft) {
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs(v,u),dif[u]+=dif[v];
}
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1,x,y;i<n;++i)
x=rd(),y=rd(),addedge(x,y),addedge(y,x);
dfs1(1,0),dfs2(1,1);
for(int i=1;i<n;++i) {
int u=a[i],v=a[i+1],lca=LCA(u,v);
++dif[u],++dif[v],--dif[lca],--dif[fa[lca]];
}
dfs(1,0),++dif[a[1]];
for(int i=1;i<=n;++i)printf("%d\n",dif[i]-1);
return 0;
}```
CF1197C Array Splitting.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n,k,a[N],ans;
vector<int>v;
signed main(){
n=read(),k=read();
rep(i,1,n){
a[i]=read();
if(i>1)v.pb(a[i-1]-a[i]);
}
ans=a[n]-a[1];
sort(v.begin(),v.end());
rep(i,0,k-2)ans+=v[i];
cout<<ans<<'\n';
}```
CF1285F Classical_.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n,m,a[N],stk[N],top,mu[N],pri[N/10],pct,b[N],c[N],cnt[N];
LL ans;
bool vis[N];
vector<int>d[N];
void init(){
mu[1]=1;
rep(i,2,m){
if(!vis[i])pri[++pct]=i,mu[i]=-1;
for(int j=1;j<=pct&&i*pri[j]<N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){mu[i*pri[j]]=0;break;}
mu[i*pri[j]]=-mu[i];
}
}
for(int i=1;i<=m;++i)
for(int j=1;i*j<=m;++j)
d[i*j].pb(i);
}
void upd(int x){
rep(i,0,sz(d[x])-1)++c[d[x][i]];
}
void del(int x){
rep(i,0,sz(d[x])-1)--c[d[x][i]];
}
int calc(int x){
int res=0;
rep(i,0,sz(d[x])-1)
res+=mu[d[x][i]]*c[d[x][i]];
return res;
}
signed main(){
n=read();
rep(i,1,n)a[i]=read(),ckmax(m,a[i]),++cnt[a[i]];
sort(a+1,a+n+1,greater<int>());
init();
rep(t,1,m){
b[0]=0;
for(int i=1;i*t<=m;++i)
rep(j,1,cnt[i*t])b[++b[0]]=i;
reverse(b+1,b+b[0]+1);
rep(i,1,b[0]){
int now=calc(b[i]);
while(now>=1){
if(__gcd(stk[top],b[i])==1){
if(now==1)break;
else --now;
}
del(stk[top]),--top;
}
if(now==1)ckmax(ans,1ll*b[i]*stk[top]*t);
stk[++top]=b[i],upd(b[i]);
}
while(top)del(stk[top--]);
}
printf("%lld\n",ans);
}```
P6156 简单题.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=10000005;
const int mod = 998244353;
int n;LL k;
int pw[N],S[N],f[N], pri[N], cnt;
bool vis[N];
int qpow(int n,int k,int res=1){
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;
return res;
}
void init(const int&N){
pw[1]=1,f[1]=1;
for(int i=2;i<=N;++i){
if (!vis[i]) pri[++cnt] = i, pw[i] = qpow(i, k), f[i] = i - 1;
for (int j = 1; j <= cnt && i * pri[j] <= N; ++ j) {
vis[i * pri[j]] = 1, pw[i * pri[j]] = 1ll * pw[i] * pw[pri[j]] % mod;
if (i % pri[j] == 0) {
if(i / pri[j] % pri[j]) f[i * pri[j]] = -1ll * f[i / pri[j]] * pri[j] % mod;
break;
}
pw[i * pri[j]] =1ll * pw[i] * pw[pri[j]] % mod, f [i * pri[j]] = 1ll * f[i] * f[pri[j]] % mod;
}
}
for(int i=1;i<=N;++i)f[i]=(1ll*pw[i]*f[i]%mod+f[i-1])%mod,pw[i]=(pw[i]+pw[i-1])%mod;
for(int i=1;i<=N;++i)S[i]=(S[i-1]+pw[i])%mod;
}
int query(int n){
int res=0;
for(int l=1,r;l<=n;l=r+1)
r=n/(n/l),res=(res+1ll*(S[(n/l)*2]-S[n/l]*2)*(f[r]-f[l-1])%mod)%mod;
return (res+mod)%mod;
}
signed main(){
n=read(), scanf("%lld", &k), k %= mod - 1,init(n<<1);
printf("%d\n",query(n));
}
/*
5000000 1000000000000000000
305836999
*/```
P4886 快递员.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
int n,m,ans=1<<30;
struct edge {
int nxt,val,to;
}e[N<<1];
int head[N],num_edge;
int mx[N],root,siz[N];
int a[N],X[N],Y[N],dis[N],bel[N];
bool used[N];
void addedge(int from,int to,int val) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
head[from]=num_edge;
}
void getroot(int u,int ft,int totsize) {
siz[u]=1,mx[u]=0;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||used[v])continue;
getroot(v,u,totsize);
siz[u]+=siz[v];
mx[u]=max(mx[u],siz[v]);
}
mx[u]=max(mx[u],totsize-siz[u]);
if(mx[u]<mx[root])root=u;
}
void dfs(int u,int ft,int rt) {
bel[u]=rt;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dis[v]=dis[u]+e[i].val;
dfs(v,u,rt);
}
}
void solve(int x) {
if(used[x]){printf("%d\n",ans);exit(0);}
used[x]=1;dis[x]=0;
for(rint i=head[x];i;i=e[i].nxt) {
int v=e[i].to;
dis[v]=dis[x]+e[i].val,dfs(v,x,v);
}
int Mx=0,tr=0;
for(rint i=1;i<=m;++i)
if(dis[X[i]]+dis[Y[i]]>Mx)Mx=dis[X[i]]+dis[Y[i]],a[a[0]=1]=i;
else if(Mx==dis[X[i]]+dis[Y[i]])a[++a[0]]=i;
ans=min(ans,Mx);
for(rint i=1;i<=a[0];++i) {
if(bel[X[a[i]]]!=bel[Y[a[i]]]) {printf("%d\n",ans);exit(0);}
if(!tr)tr=bel[X[a[i]]];
else if(tr!=bel[X[a[i]]]||tr!=bel[Y[a[i]]]) {printf("%d\n",ans);exit(0);}
}
root=0,getroot(tr,x,siz[tr]),solve(root);
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
for(rint i=1;i<=m;++i)X[i]=rd(),Y[i]=rd();
mx[root=0]=n,getroot(1,0,n),solve(root);
}
```
P4831 Scarlet loves WenHuaKe.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
const int N=200005;
int fac[N],ifc[N],ans,n,m,pw2[N],ip2[N];
void initmath(const int&n=N-1){
fac[0]=1;rep(i,1,n)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);per(i,n-1,0)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
pw2[0]=1;rep(i,1,n)fmod(pw2[i]=pw2[i-1]<<1);
const int iv2=(mod+1)>>1;
ip2[0]=1;rep(i,1,n)ip2[i]=1ll*ip2[i-1]*iv2%mod;
}
int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
int g(int n,int m){
int res=0;
rep(i,0,min(n,m-n))fmod(res+=1ll*comb(m,n-i)*comb(m-n+i,i*2)%mod*ip2[n-i]%mod);
res=1ll*res*fac[n*2]%mod;
return res;
}
signed main(){
n=read(),m=read(),initmath();
for(int i=0;i<=n;++i){
int res=1ll*comb(n,i)*comb(m,i)%mod*fac[i]%mod*g(n-i,m-i)%mod;
fmod(ans+=i&1?mod-res:res);
}
ans=1ll*ans*qpow(pw2[n],mod-2)%mod;
printf("%d\n",ans);
}```
P6850 NOI.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int a[10];
signed main(){
a[1]=read(),a[2]=read(),a[3]=read(),a[4]=read(),a[5]=read(),a[6]=read(),a[7]=read(),a[8]=read(),a[9]=read();
a[0]=50+a[1]+a[8]*5+a[2]+a[3]+a[4]+a[5]+a[6]+a[7];
a[0]>=a[9]?puts("AKIOI"):puts("AFO");
}```
P1015 回文数.cpp
```#include<bits/stdc++.h>
using namespace std;
int n;
string s;
bool isp(string s)
{
if(s[0]==0)return false;
for(int i=0;i<s.length()/2;i++)
{
if(s[i]!=s[s.length()-i-1])return false;
}
return true;
}
string sswap(string s)
{
for(int i=0;i<s.length()/2;i++)
{
swap(s[i],s[s.length()-i-1]);
}
return s;
}
string pplus(string a,string b)
{
string ans;
while(a.length()<b.length())a="0"+a;
while(a.length()>b.length())b="0"+b;
int jw=0,now=0,aa,bb;
for(int i=a.length()-1;i>=0;i--)
{
if(a[i]>='0'&&a[i]<='9')aa=a[i]-'0';
else aa=a[i]-'A'+10;
if(b[i]>='0'&&b[i]<='9')bb=b[i]-'0';
else bb=b[i]-'A'+10;
now=aa+bb+jw;
jw=now/n;
now%=n;
if(now<10)ans=char('0'+now)+ans;
else ans=char(now-10+'A')+ans;
}
if(jw>0)ans=char(jw+'0')+ans;
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin>>n>>s;
for(int i=0;i<=30;i++)
{
if(isp(s)){printf("STEP=%d\n",i);return 0;}
s=pplus(s,sswap(s));
}
puts("Impossible!");
return 0;
}```
CF616D Longest k-Good Segment.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int cnt[N],n,a[N],k,len,L,R;
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read();
int l=1,r=0,now=0;
while(l<=n){
while(r+1<=n){
if(cnt[a[r+1]]||now<k){
if(cnt[a[r+1]]==0)++now;
++cnt[a[r+1]],++r;
}
else break;
}
if(ckmax(len,r-l+1))L=l,R=r;
if(cnt[a[l]]==1)--now;
--cnt[a[l]],++l;
}
cout<<L<<' '<<R<<'\n';
}```
CF37C Old Berland Language.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=1005;
const int M=1000005;
int n,ls[M],rs[M],to[N],rt,tot,fa[M];
bool full[M];
pair<int,int>a[N];
void insert(int len,int&ed,int&o){
if(!o)o=++tot;
if(!len)return ed=o,full[o]=1,void();
if(!full[ls[o]])insert(len-1,ed,ls[o]),fa[ls[o]]=o;
else if(!full[rs[o]])insert(len-1,ed,rs[o]),fa[rs[o]]=o;
else puts("NO"),exit(0);
if(full[ls[o]]&&full[rs[o]])full[o]=1;
}
int d[1005];
void print(int o){
d[0]=0;
while(o!=rt)d[++d[0]]=rs[fa[o]]==o,o=fa[o];
for(int i=d[0];i;--i)putchar('0'+d[i]);
puts("");
}
bool cmp(pair<int,int>a,pair<int,int>b){return a.y<b.y;}
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i].x=read(),a[i].y=i;
sort(a+1,a+n+1);
for(int i=1;i<=n;++i)insert(a[i].x,to[a[i].y],rt);
puts("YES");
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)print(to[i]);
}```
P4287 [SHOI2011]双倍回文.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n,ans;
int tot,las,len[N],trans[N],tr[N][26],fail[N];
char str[N];
inline int getfail(int x,int i){
while(i-len[x]-1<0||str[i]!=str[i-len[x]-1])x=fail[x];
return x;
}
inline int gettrans(int x,int i,int lim){
while(2*(len[x]+2)>lim||str[i]!=str[i-len[x]-1])x=fail[x];
return x;
}
void build(char*str,int n){
len[0]=0,fail[0]=1,len[1]=-1,fail[1]=0,tot=1;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=getfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[getfail(fail[f],i)][c];
tr[f][c]=tot;
len[tot]=len[f]+2;
if(len[tot]<=2)trans[tot]=fail[tot];
else trans[tot]=tr[gettrans(trans[f],i,len[tot])][c];
}
las=tr[f][c];
}
}
signed main(){
scanf("%d%s",&n,str);
build(str,strlen(str));
for(int i=1;i<=tot;++i)
if(len[trans[i]]%2==0&&len[trans[i]]*2==len[i])ckmax(ans,len[i]);
cout<<ans<<'\n';
return 0;
}```
P4578 [FJOI2018]所罗门王的宝藏.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=2009;
const int M=N*2;
const int inf=1000000007;
int n,m,k;
int num_edge,head[N];
struct edge {
int nxt,to,val;
}e[M];
int dis[N],num[N],inq[N];
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].val=val;
e[num_edge].to=to;
e[num_edge].nxt=head[fr];
head[fr]=num_edge;
}
void clear() {
num_edge=0;
memset(head,0,sizeof(head));
}
bool spfa() {
for(int i=0;i<=n+m;++i)dis[i]=inf,num[i]=0,inq[i]=0;
queue<int>q;
q.push(0),dis[0]=0,num[0]=1;
while(!q.empty()){
int u=q.front();q.pop(),inq[u]=0;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(dis[v]>dis[u]+e[i].val) {
dis[v]=dis[u]+e[i].val,++num[v];
if(num[v]>n+m)return 0;
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return 1;
}
void Main() {
clear();
n=rd(),m=rd(),k=rd();
for(int i=1;i<=k;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y+n,z),addedge(y+n,x,-z);
}
for(int i=1;i<=n+m;++i)addedge(0,i,0);
puts(spfa()?"Yes":"No");
}
signed main(){for(int T=rd();T;--T)Main();}```
CF321A Ciel and Robot.cpp
```#include<bits/stdc++.h>
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
const int inf=1e9+6;
int n,X,Y,dx,dy,sx,sy;
char s[N];
signed main(){
X=read(),Y=read();
scanf("%s",s+1),n=strlen(s+1);
for(int i=1;i<=n;++i){
if(s[i]=='U')++dy;
else if(s[i]=='D')--dy;
else if(s[i]=='L')--dx;
else ++dx;
}
if(sx==X&&sy==Y)return puts("Yes"),0;
if(sx==X&&!dx){if(dy&&(Y-sy)%dy==0&&(Y-sy)/dy>=0)return puts("Yes"),0;}
if(sy==Y&&!dy){if(dx&&(X-sx)%dx==0&&(X-sx)/dx>=0)return puts("Yes"),0;}
if(dx&&dy){if((Y-sy)%dy==0&&(X-sx)%dx==0&&(Y-sy)/dy==(X-sx)/dx&&(X-sx)/dx>=0)return puts("Yes"),0;}
for(int i=1;i<=n;++i){
if(s[i]=='U')++sy;
else if(s[i]=='D')--sy;
else if(s[i]=='L')--sx;
else ++sx;
std::cerr<<sx<<' '<<sy<<'\n';
if(sx==X&&sy==Y)return puts("Yes"),0;
if(sx==X&&!dx){if(dy&&(Y-sy)%dy==0&&(Y-sy)/dy>=0)return puts("Yes"),0;}
if(sy==Y&&!dy){if(dx&&(X-sx)%dx==0&&(X-sx)/dx>=0)return puts("Yes"),0;}
if(dx&&dy){if((Y-sy)%dy==0&&(X-sx)%dx==0&&(Y-sy)/dy==(X-sx)/dx&&(X-sx)/dx>=0)return puts("Yes"),0;}
}
puts("No");
}//```
CF1419D1 Sage's Birthday (easy version).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n, a[N], sum, ans[N], tot;
signed main() {
n = read();
for (int i = 1; i <= n; ++ i) a[i] = read();
sort(a + 1, a + n + 1);
for (int i = 1, j = n; i <= j; ++ i, -- j) ans[++ tot] = a[j], ans[++ tot] = a[i];
for (int i = 2; i < n; ++ i) sum += ans[i] < ans[i - 1] && ans[i] < ans[i + 1];
printf("%d\n", sum);
for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
}
```
CF1421D Hexagons.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int c[10],x,y;
signed main(){
for(int T=read();T;--T){
x=read(),y=read();
for(int i=1;i<=6;++i)c[i]=read();
for(int j=1;j<=6;++j)
for(int i=1;i<=6;++i)
c[i]=min(c[i],c[i+1==7?1:i+1]+c[i-1==0?6:i-1]);
if(x>=0&&y>=0)printf("%lld\n",c[1]*min(x,y)+(y-x>0?c[2]*(y-x):c[6]*(x-y)));
else if(x>=0&&y<0)y=-y,printf("%lld\n",c[6]*x+c[5]*y);
else if(x<0&&y>=0)x=-x,printf("%lld\n",c[3]*x+c[2]*y);
else x=-x,y=-y,printf("%lld\n",c[4]*min(x,y)+(y-x>0?c[5]*(y-x):c[3]*(x-y)));
}
}
/*
2
-3 1
1 3 5 7 9 11
1000000000 1000000000
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
*/```
P4655 [CEOI2017]Building Bridges.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define M 1000005
#define C (M-5)
#define T (M<<2)
#define inf 1000000000000000000ll
int n,h[N],w[N],cnt;
LL s[N],dp[N];
int v[T];
pair<int,LL>li[N];
#define val(x,y) (1ll*li[x].fi*y+li[x].se)
#define lc (p<<1)
#define rc (p<<1|1)
void update(int id,int l=1,int r=C,int p=1){
if(!v[p])return v[p]=id,void();
int mid=(l+r)>>1;
LL nol=val(id,l),nor=val(id,r),lal=val(v[p],l),lar=val(v[p],r);
if(nol>=lal&&nor>=lar)return;
if(nol<=lal&&nor<=lar)return v[p]=id,void();
db inter=1.*(li[id].se-li[v[p]].se)/(li[v[p]].fi-li[id].fi);
if(nol<=lal){
if(inter<=mid)update(id,l,mid,lc);
else update(v[p],mid+1,r,rc),v[p]=id;
}else{
if(inter>mid)update(id,mid+1,r,rc);
else update(v[p],l,mid,lc),v[p]=id;
}
}
LL query(int X,int l=1,int r=C,int p=1){
LL res=inf;
if(v[p])res=min(res,val(v[p],X));
if(l==r)return res;
int mid=(l+r)>>1;
if(X<=mid)res=min(res,query(X,l,mid,lc));
else res=min(res,query(X,mid+1,r,rc));
return res;
}
signed main(){
n=read();
for(int i=1;i<=n;++i)h[i]=read();
for(int i=1;i<=n;++i)w[i]=read(),s[i]=s[i-1]+w[i];
for(int i=1;i<=n;++i){
if(i==1)dp[i]=0;
else dp[i]=query(h[i])+1ll*h[i]*h[i]+s[i-1];
li[++cnt]=mkp(-2*h[i],dp[i]-s[i]+1ll*h[i]*h[i]);
update(cnt);
}
printf("%lld\n",dp[n]);
return 0;
}```
P6280 [USACO20OPEN]Exercise G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)) {
if(ch=='-')f=-1;
ch=getchar();
}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=10009;
bool vis[N];
int pri[N],cnt;
int n,mod,dp[N],ans;
void Sieve(){
for(int i=2;i<=n;++i) {
if(!vis[i])pri[++cnt]=i;
for(int j=1;j<=cnt&&i*pri[j]<=n;++j) {
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
}
signed main() {
n=rd(),mod=rd();
Sieve();
dp[0]=1;
for(int i=1;i<=cnt;++i) {
for(int j=n;j>=pri[i];--j) {
for(int k=1,t=pri[i];t<=j;++k,t*=pri[i]) {
dp[j]=(dp[j]+1ll*dp[j-t]*t%mod)%mod;
}
}
}
for(int i=0;i<=n;++i)ans=(ans+dp[i])%mod;
printf("%d\n",ans);
}
```
P3629 [APIO2010]巡逻.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 100005
int n,k,d1,d2,f[N],g[N],F[N],G[N],S,T,dep[N],fa[N];
struct edge{int nxt,to;}e[N<<1];
int head[N],num_edge;
vector<int>d;
unordered_map<int,bool>mp[N];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void getd1(int u,int ft,int&pos){
fa[u]=ft,dep[u]=dep[ft]+1;
if(dep[u]>dep[pos])pos=u;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
getd1(v,u,pos);
}
}
void getd2(int u,int ft){
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
getd2(v,u);int w=mp[u][v]?-1:1;
d2=max(d2,f[u]+f[v]+w);
f[u]=max(f[u],f[v]+w);
}
}
signed main(){
n=read(),k=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
getd1(1,dep[1]=0,S=0),getd1(S,dep[S]=0,T=0),d1=dep[T]-1;
if(k==1)return printf("%d\n",2*(n-1)-d1+1),0;
int u=T;while(u)d.pb(u),u=fa[u];
for(int i=0;i<d.size()-1;++i)mp[d[i]][d[i+1]]=mp[d[i+1]][d[i]]=1;
memset(f,0,sizeof(f));
getd2(1,0);
printf("%d\n",2*(n-1)-d1+1-d2+1);
return 0;
}```
P3834 【模板】可持久化线段树 2（主席树）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int T=N*20;
int n,m,a[N],cpy[N],len;
int root[N],tot,val[T],ls[T],rs[T];
void update(int &p,int pre,int l,int r,int v){
p=++tot;
ls[p]=ls[pre],rs[p]=rs[pre],val[p]=val[pre]+1;
if(l==r)return;
int mid=(l+r)>>1;
if(v<=mid)update(ls[p],ls[pre],l,mid,v);
else update(rs[p],rs[pre],mid+1,r,v);
}
int query(int p,int pre,int l,int r,int k){
if(l==r)return l;
int mid=(l+r)>>1,x=val[ls[p]]-val[ls[pre]];
if(k<=x)return query(ls[p],ls[pre],l,mid,k);
else return query(rs[p],rs[pre],mid+1,r,k-x);
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)a[i]=cpy[++len]=read();
sort(cpy+1,cpy+len+1),len=unique(cpy+1,cpy+len+1)-cpy-1;
for(int i=1;i<=n;++i)a[i]=lower_bound(cpy+1,cpy+len+1,a[i])-cpy;
for(int i=1;i<=n;++i)update(root[i],root[i-1],1,len,a[i]);
while(m--){
int x=read(),y=read(),z=read();
printf("%d\n",cpy[query(root[y],root[x-1],1,len,z)]);
}
return 0;
}
```
动态树（LCT）.cpp
```struct Link_Cut_Tree{
static const int O=N+5;
int ch[O][2],fa[O],sum[O],val[O],id[O],tag[O];
bool fl[O];
Link_Cut_Tree(){
memset(ch,0,sizeof(ch));
memset(fa,0,sizeof(fa));
memset(val,0,sizeof(val));
memset(sum,0,sizeof(sum));
memset(id,0,sizeof(id));
memset(fl,0,sizeof(fl));
memset(tag,0,sizeof(tag));
}
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){
sum[x]=sum[ch[x][0]]+val[x]+sum[ch[x][1]];
id[x]=x;
if(ch[x][0]&&val[id[ch[x][0]]]>val[id[x]])id[x]=id[ch[x][0]];
if(ch[x][1]&&val[id[ch[x][1]]]>val[id[x]])id[x]=id[ch[x][1]];
}
void addtag(int x,int d){
val[x]+=d,tag[x]+=d,sum[x]+=d;
}
void pushdown(int x){
if(fl[x]){
fl[x]^=1,fl[ch[x][0]]^=1,fl[ch[x][1]]^=1;
swap(ch[x][0],ch[x][1]);
}
if(tag[x]){
if(ch[x][0])addtag(ch[x][0],tag[x]);
if(ch[x][1])addtag(ch[x][1],tag[x]);
tag[x]=0;
}
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;
fa[y]=x,fa[x]=z;
pushup(y);
}
void splay(int x){
static int stk[O],top;
int y=x,z;stk[top=1]=y;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[z][1]==y)^(ch[y][1]==x)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){
access(x),splay(x),fl[x]^=1;
}
int findroot(int x){
access(x),splay(x);
while(ch[x][0])pushdown(x),x=ch[x][0];
return splay(x),x;
}
void split(int x,int y){
makeroot(x),access(y),splay(y);
}
void link(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)!=x)splay(y),fa[x]=y;
}else split(x,y),fa[x]=y;
}
void cut(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)==x&&fa[y]==x&&!ch[y][0])
fa[y]=ch[x][1]=0;
}else split(x,y),fa[x]=ch[y][0]=0,pushup(y);
}
int ask_sum(int x,int y){return split(x,y),sum[y];}
pair<int,int>ask_max(int x,int y){return split(x,y),mkp(val[id[y]],id[y]);}
void add(int x,int y,int d){split(x,y),addtag(y,d);}
};```
缺省.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}```
P4482 [BJWC2018]Border 的四种求法.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define N 200005
const int inf=0x3f3f3f3f;
char str[N];
int n,numq,root[N<<1];
struct QUE{
int l,r,id;
QUE(){l=r=id=0;}
QUE(int l_,int r_,int d_){l=l_,r=r_,id=d_;}
};
vector<QUE>q[N<<1];
int ans[N];
namespace SAM{
#define S (N<<1)
int link[S],trans[S][26],rev[S],mxlen[S],tot=1,to[N];
int extend(int c,int lst,int id){
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1,rev[np]=id,to[id]=np;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void insert(char*str){
int n=strlen(str);
for(int i=0,lst=1;i<n;++i)lst=extend(str[i]-'a',lst,i+1);
}
#undef S
}
namespace seg{
#define T (N<<2)
#define lc (p<<1)
#define rc (p<<1|1)
int miv[T],tot;
void init(){memset(miv,0x3f,sizeof(miv));}
void pushup(int p){miv[p]=min(miv[lc],miv[rc]);}
void update(int pos,int k,int l=1,int r=n,int p=1){
if(l==r)return miv[p]=k,void();
int mid=(l+r)>>1;
if(pos<=mid)update(pos,k,l,mid,lc);
else update(pos,k,mid+1,r,rc);
pushup(p);
}
int query(int ql,int qr,int l=1,int r=n,int p=1){
if(miv[p]>=ql)return 0;
if(l==r)return miv[p]<ql?l:0;
int mid=(l+r)>>1,res;
if(qr>mid){
res=query(ql,qr,mid+1,r,rc);
if(res)return res;
}
if(ql<=mid)return query(ql,qr,l,mid,lc);
return 0;
}
#undef T
#undef lc
#undef rc
}
namespace mgt{
#define T ((N<<1)*40)
int ls[T],rs[T],val[T],tot;
void pushup(int p){
val[p]=val[ls[p]]+val[rs[p]];
}
void update(int&p,int pos,int k,int l=1,int r=n){
if(!p)p=++tot;
if(l==r)return val[p]+=k,void();
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
pushup(p);
}
int query(int p,int ql,int qr,int l=1,int r=n){
if(!val[p])return 0;
if(l==r)return l;
int mid=(l+r)>>1,res;
if(qr>mid){
res=query(rs[p],ql,qr,mid+1,r);
if(res)return res;
}
if(ql<=mid)return query(ls[p],ql,qr,l,mid);
return 0;
}
int merge(int x,int y,int l=1,int r=n){
if(!x||!y)return x|y;
if(l==r)return val[x]+=val[y],x;
int mid=(l+r)>>1,p=++tot;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return pushup(p),p;
}
#undef T
}
namespace Tree{
#define T (N<<1)
int hed[T],et;
int top[T],fa[T],son[T],siz[T],dep[T];
struct edge{int nx,to;}e[T<<1];
void addedge(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
siz[u]=1,fa[u]=ft,dep[u]=dep[ft]+1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u),siz[u]+=siz[v],root[u]=mgt::merge(root[u],root[v]);
if(siz[v]>siz[son[u]])son[u]=v;
}
if(SAM::rev[u])mgt::update(root[u],SAM::rev[u],1);
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
void init(){
for(int i=1;i<=SAM::tot;++i)addedge(SAM::link[i],i);
dfs1(1,0),dfs2(1,1),seg::init();
}
void upd(int u,int x){
if(SAM::rev[u])seg::update(SAM::rev[u],x<inf?SAM::rev[u]-x:inf);
for(int i=hed[u];i;i=e[i].nx)upd(e[i].to,x);
}
void dfs(int rt){
for(int u=rt;u;u=son[u]){
if(SAM::rev[u])seg::update(SAM::rev[u],SAM::rev[u]-SAM::mxlen[u]);
for(int i=hed[u];i;i=e[i].nx)if(e[i].to!=son[u])upd(e[i].to,SAM::mxlen[u]);
for(vector<QUE>::iterator i=q[u].begin();i!=q[u].end();++i){
int t=mgt::query(root[u],i->l,min(i->l+SAM::mxlen[u]-1,i->r-1));
if(t)ckmax(ans[i->id],t-i->l+1);
t=seg::query(i->l,i->r-1);
if(t)ckmax(ans[i->id],t-i->l+1);
}
}
for(int u=rt;u;u=son[u]){
if(SAM::rev[u])seg::update(SAM::rev[u],inf);
for(int i=hed[u];i;i=e[i].nx)if(e[i].to!=son[u])upd(e[i].to,inf);
}
for(int u=rt;u;u=son[u])
for(int i=hed[u];i;i=e[i].nx)
if(e[i].to!=son[u])dfs(e[i].to);
}
#undef T
}
signed main(){
scanf("%s%d",str,&numq),n=strlen(str),SAM::insert(str);
Tree::init();
for(int i=1;i<=numq;++i){
int l=read(),r=read(),now=SAM::to[r];
if(l==r){ans[i]=0;continue;}
while(now)q[now].pb(QUE(l,r,i)),now=Tree::fa[Tree::top[now]];
}
Tree::dfs(1);
for(int i=1;i<=numq;++i)printf("%d\n",ans[i]);
return 0;
}```
P5607 [Ynoi2013]无力回天NOI2017.cpp
```#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cmath>
using std::cout;
using std::endl;
using std::vector;
using std::lower_bound;
using std::unique;
using std::sort;
using std::max;
using std::min;
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 50009
#define T (N<<2)
#define A 30
//LinearBase
struct LinearBase {
int d[A+1];
LinearBase(){memset(d,0,sizeof(d));}
void insert(int x) {
for(int i=A;~i;--i)
if(x>>i&1) {
if(d[i])x^=d[i];
else return d[i]=x,void();
}
}
int query(int x) {
for(int i=A;~i;--i)x=max(x,x^d[i]);
return x;
}
void reset() {
memset(d,0,sizeof(d));
}
};
LinearBase merge(const LinearBase&a,const LinearBase&b){
LinearBase res=a;
for(int i=A;~i;--i)if(b.d[i])res.insert(b.d[i]);
return res;
}
//Data
int n,m,a[N];
int tr[N];
LinearBase lb[T];
//BIT
void add(int x,int d) {
if(!x)return;
for(int i=x;i<=n;i+=i&-i)tr[i]^=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res^=tr[i];
return res;
}
//SegmentTree
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {lb[p]=merge(lb[lc],lb[rc]);}
void build(int l,int r,int p) {
if(l==r) {
lb[p].insert(a[l]);
return;
}
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void change(int pos,int l,int r,int p,int v) {
if(l==r) {
lb[p].reset(),lb[p].insert(a[l]^=v);
return;
}
int mid=(l+r)>>1;
if(pos<=mid)change(pos,l,mid,lc,v);
else change(pos,mid+1,r,rc,v);
pushup(p);
}
LinearBase query(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return lb[p];
int mid=(l+r)>>1;LinearBase res;
if(ql<=mid)res=merge(res,query(ql,qr,l,mid,lc));
if(mid<qr)res=merge(res,query(ql,qr,mid+1,r,rc));
return res;
}
//Main
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=n;i>=1;--i)a[i]^=a[i-1],add(i,a[i]);
build(1,n,1);
while(m--) {
int opt=rd(),l=rd(),r=rd(),v=rd();
if(opt&1) {
add(l,v),change(l,1,n,1,v);
if(r<n)add(r+1,v),change(r+1,1,n,1,v);
}else {
LinearBase res;
if(l<r)res=query(l+1,r,1,n,1);
res.insert(ask(l));
printf("%d\n",res.query(v));
}
}
return 0;
}```
P2605 [ZJOI2010]基站选址.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 20005
#define K 105
#define T (N<<2)
#define inf 1000000005
int n,k,D[N],C[N],S[N],W[N],dp[N],ans,L[N],R[N],pre[N],suf[N];
vector<pair<int,int> >v1[N],v2[N];
int val[T],tag[T];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=min(val[lc],val[rc]);}
void build(int l=1,int r=n,int p=1){
tag[p]=0;
if(l==r)return val[p]=min(dp[l],inf),void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void pushdown(int p){
if(tag[p]){
val[lc]+=tag[p],val[rc]+=tag[p];
tag[lc]+=tag[p],tag[rc]+=tag[p];
tag[p]=0;
}
}
void update(int ql,int qr,int k,int l=1,int r=n,int p=1){
if(ql>qr)return;
if(ql<=l&&r<=qr)return val[p]+=k,tag[p]+=k,void();
pushdown(p);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,k,l,mid,lc);
if(mid<qr)update(ql,qr,k,mid+1,r,rc);
pushup(p);
}
int query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql>qr)return inf;
if(ql<=l&&r<=qr)return val[p];
pushdown(p);
int mid=(l+r)>>1;
if(qr<=mid)return query(ql,qr,l,mid,lc);
if(mid<ql)return query(ql,qr,mid+1,r,rc);
return min(query(ql,qr,l,mid,lc),query(ql,qr,mid+1,r,rc));
}
signed main(){
n=read(),k=read();
for(int i=2;i<=n;++i)D[i]=read();
for(int i=1;i<=n;++i)C[i]=read();
for(int i=1;i<=n;++i)S[i]=read();
for(int i=1;i<=n;++i)W[i]=read();
for(int i=1;i<=n;++i){
L[i]=lower_bound(D+1,D+n+1,D[i]-S[i])-D;
R[i]=upper_bound(D+1,D+n+1,D[i]+S[i])-D-1;
v1[R[i]].pb(mkp(L[i],i)),v2[L[i]].pb(mkp(R[i],i));
}
for(int i=1;i<=n;++i){
pre[i]+=pre[i-1];
for(int j=0,sz=v1[i].size();j<sz;++j)pre[i+1]+=W[v1[i][j].se];
}
for(int i=n;i>=1;--i){
suf[i]+=suf[i+1];
for(int j=0,sz=v2[i].size();j<sz;++j)suf[i-1]+=W[v2[i][j].se];
}
// for(int i=1;i<=n;++i)cerr<<L[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<R[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<pre[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<suf[i]<<' ';cerr<<'\n';
memset(dp,0x3f,sizeof(dp));
for(int i=1;i<=n;++i)ans+=W[i];
if(!k)return printf("%d\n",ans),0;
for(int i=1;i<=n;++i)dp[i]=pre[i]+C[i],ans=min(ans,dp[i]+suf[i]);
// for(int j=1;j<=n;++j)cerr<<dp[j]<<' ';cerr<<'\n';
// cerr<<ans<<'\n';
for(int t=2;t<=k;++t){
build();
for(int i=1;i<=n;++i){
dp[i]=query(1,i-1)+C[i],ans=min(ans,dp[i]+suf[i]);
for(int j=0,sz=v1[i].size();j<sz;++j)update(1,v1[i][j].fi-1,W[v1[i][j].se]);
// for(int j=1;j<=i;++j)cerr<<query(j,j)<<' ';cerr<<'\n';
}
// for(int j=1;j<=n;++j)cerr<<dp[j]<<' ';cerr<<'\n';
}
printf("%d\n",ans);
return 0;
}
/*
5 3
10 14 22 26
13 16 14 19 16
2 5 4 3 3
2 7 4 11 13
*/
```
P3425 [POI2005]KOS-Dicing.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=20005;
const int M=N*7*2;
const int inf=0x3f3f3f3f;
int n,m,U[N],V[N],win[N];
int dis[N],cur[N],mf,S,T,hed[N],et=1;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(fl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
bool check(int o){
et=1,fill(hed,hed+T+1,0),mf=0;
rep(i,1,n)adde(S,i,o);
rep(i,1,m)adde(i+n,T,1),adde(U[i],i+n,1),adde(V[i],i+n,1);
while(bfs(S,T))mf+=dfs(S,inf);
return mf==m;
}
signed main(){
n=read(),m=read(),S=n+m+1,T=S+1;
rep(i,1,m)U[i]=read(),V[i]=read();
int l=0,r=m,res=-1;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid))r=mid-1,res=mid;
else l=mid+1;
}
printf("%d\n",res),check(res);
for(int i=2;i<=et;++i)
if(e[i^1].fl&&e[i].to!=S&&e[i].to!=T&&e[i^1].to!=S&&e[i^1].to!=T)win[e[i].to-n]=e[i^1].to;
rep(i,1,m)printf("%d\n",win[i]==U[i]?1:0);
return 0;
}```
CF1474C Array Destruction.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int M=1000005;
const int N=1005;
int a[N<<1],n,cnt[M];
bool check(int x){
rep(i,1,n<<1)++cnt[a[i]];
int now=a[n<<1]+x,num=0;
per(i,n<<1,1){
if(cnt[a[i]]){
if(now<=a[i]||!cnt[now-a[i]]){
rep(j,1,n<<1)cnt[a[j]]=0;
return 0;
}
--cnt[now-a[i]],--cnt[a[i]],now=max(a[i],now-a[i]),++num;
}
}
rep(i,1,n<<1)cnt[a[i]]=0;
return num==n;
}
void Main(){
n=read();
rep(i,1,n<<1)a[i]=read();
sort(a+1,a+n*2+1);
for(int i=1;i<n*2;++i)if(check(a[i])){
rep(j,1,n<<1)++cnt[a[j]];
int now=a[n*2]+a[i];
printf("YES\n%d\n",now);
per(j,n<<1,1){
if(cnt[a[j]])printf("%d %d\n",a[j],now-a[j]),--cnt[now-a[j]],--cnt[a[j]],now=max(a[j],now-a[j]);
}
rep(j,1,n<<1)cnt[a[j]]=0;
return;
}
rep(i,1,n<<1)cnt[a[i]]=0;
puts("NO");
}
signed main(){for(int T=read();T;--T)Main();}
/*
4
2
3 5 1 2
3
1 1 8 8 64 64
2
1 1 2 4
5
1 2 3 4 5 6 7 14 3 11
*/```
CF1392C Omkar and Waterslide.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int inf=1e9+7;
int n,k,T,a[N],ans;
void Main() {
n=rd(),ans=0;
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1,mx=0;i<=n;++i) {
mx=max(mx,a[i]);
a[i]=mx-a[i];
}
// for(int i=1;i<=n;++i)cout<<a[i]<<' ';
// puts("");
for(int i=1,lst=0;i<=n;++i)
ans+=max(a[i]-lst,0ll),lst=a[i];
printf("%lld\n",ans);
}
signed main() {
for(T=rd();T;--T)Main();
}```
P2764 最小路径覆盖问题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=320;
const int M=2*(N+6000);
const int inf=0x3f3f3f3f;
int n,m,nxt[N],pre[N];
int dep[N],S,T,mf,ND,cur[N];
int hed[N],et=1;
struct edge{int to,nx,fl;}e[M];
inline void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
inline void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(){
assert(ND>0);
queue<int>q;
for(int i=1;i<=ND;++i)dep[i]=0,cur[i]=hed[i];
q.push(S),dep[S]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dep[v])dep[v]=dep[u]+1,q.push(v);
}
}
return dep[T]>0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,us=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dep[v]==dep[u]+1){
rl=dfs(v,min(fl-us,e[i].fl));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,us+=rl;
if(us==fl)break;
}
}
return us;
}
signed main(){
n=read(),m=read(),S=n*2+1,T=S+1,ND=T;
rep(i,1,n)adde(S,i,1),adde(i+n,T,1);
rep(i,1,m){
int x=read(),y=read();
adde(x,y+n,1);
}
while(bfs())mf+=dfs(S,inf);
for(int i=2;i<=et;i+=2){
if(e[i].to==S||e[i].to==T||e[i^1].to==S||e[i^1].to==T)continue;
if(e[i^1].fl)nxt[e[i^1].to]=e[i].to-n,pre[e[i].to-n]=e[i^1].to;
}
for(int i=1;i<=n;++i){
if(pre[i])continue;
for(int j=i;j;j=nxt[j])printf("%d ",j);
puts("");
}
printf("%d\n",n-mf);
}```
CF1299C Water Balance.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
#define gc getchar()
int x = 0, f = 1; char c = gc;
while (!isdigit(c)) { if (c == '-') f = 0; c = gc; }
while (isdigit(c)) x = x * 10 + c - '0', c = gc;
#undef gc
return f ? x : -x;
}
typedef double db;
typedef long long LL;
#define N 1000005
int n, a[N], tot;
int suf[N], pre[N];
db ans[N];
struct node {
int l, r; LL v;
db ave(){return 1. * v / (r - l + 1);}
node(){l = r = v = 0;}
node(int l_, int r_, LL v_){l = l_, r = r_, v = v_;}
}p[N];
signed main(){
n = read();
for (int i = 1; i <= n; ++ i) a[i] = read();
for (int i = 1; i <= n; ++ i) {
if (a[i] > a[i - 1]) ++ tot, p[tot].l = i, p[tot].r = i, p[tot].v = a[i];
else ++ p[tot].r, p[tot].v += a[i];
}
for (int i = 1; i < tot; ++ i) suf[i] = i + 1;
for (int i = tot - 1; i >= 1; -- i) {
while (suf[i] && p[suf[i]].ave() < p[i].ave())
p[i] = node(p[i].l, p[suf[i]].r, p[i].v + p[suf[i]].v), suf[i] = suf[suf[i]];
}
for (int i = 1; i; i = suf[i]){
db tmp = p[i].ave();
for (int j = p[i].l; j <= p[i].r; ++ j)
ans[j] = tmp;
}
for (int i = 1; i <= n; ++ i) printf("%.9lf\n", ans[i]);
return 0;
}```
UVA12345 Dynamic len(set(a[L：R])).cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=50005;
const int M=1000005;
int n,m,a[N],nq,nu,S,bel[N],ans[N],cnt[M],now;
struct que{
int l,r,id,pre;
inline bool operator < (const que&t)const{return bel[l]!=bel[t.l]?l<t.l:bel[r]!=bel[t.r]?r<t.r:pre<t.pre;}
}q[N];
struct upd{int x,y,id;}u[N];
void add(int x){if(!cnt[x]++)++now;}
void pop(int x){if(!--cnt[x])--now;}
void modify(int x,int l,int r){
if(u[x].x>=l&&u[x].x<=r)pop(a[u[x].x]),add(u[x].y);
swap(a[u[x].x],u[x].y);
}
signed main(){
n=read(),m=read(),S=pow(n,0.666);
rep(i,1,n)a[i]=read(),bel[i]=(i-1)/S+1;
rep(i,1,m){
char ch=getchar();
while(ch!='M'&&ch!='Q')ch=getchar();
if(ch=='M')++nu,u[nu].x=read()+1,u[nu].y=read(),u[nu].id=nu;
else ++nq,q[nq].l=read()+1,q[nq].r=read(),q[nq].id=nq,q[nq].pre=nu;
}
sort(q+1,q+nq+1);
for(int i=1,l=1,r=0,ud=0;i<=m;++i){
while(l>q[i].l)add(a[--l]);
while(r<q[i].r)add(a[++r]);
while(l<q[i].l)pop(a[l++]);
while(r>q[i].r)pop(a[r--]);
while(ud<q[i].pre)modify(++ud,q[i].l,q[i].r);
while(ud>q[i].pre)modify(ud--,q[i].l,q[i].r);
ans[q[i].id]=now;
}
rep(i,1,nq)printf("%d\n",ans[i]);
return 0;
}```
MTT.cpp
```namespace poly{
const db pi=acos(-1.0);
int rev[M],lg,lim;
struct cp{
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp&t)const{return cp(x+t.x,y+t.y);}
cp operator - (const cp&t)const{return cp(x-t.x,y-t.y);}
cp operator * (const cp&t)const{return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
}w[M];
void init_poly(const int&n){
for(lim=1,lg=0;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1)),w[i]=cp(cos(2.*pi*i/lim),sin(2.*pi*i/lim));
}
void FFT(cp*a,int op){
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1,t=lim>>1;i<lim;i<<=1,t>>=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const cp X=a[j+k],Y=w[t*k]*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(!op)for(int i=0;i<lim;++i)a[i].x/=lim;
}
void MTT(int*f,int*g,int*ans){
static cp A[M],B[M],C[M],D[M],E[M],F[M],G[M];
for(int i=0;i<lim;++i)
A[i]=cp(f[i]&65535,0),B[i]=cp(f[i]>>16,0),
C[i]=cp(g[i]&65535,0),D[i]=cp(g[i]>>16,0);
FFT(A,1),FFT(B,1),FFT(C,1),FFT(D,1);
for(int i=0;i<lim;++i)
E[i]=A[i]*C[i],F[i]=A[i]*D[i]+B[i]*C[i],G[i]=B[i]*D[i],w[i].y*=-1;
FFT(E,0),FFT(F,0),FFT(G,0);
for(int i=0;i<lim;++i)
ans[i]=LL(G[i].x+0.5)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(F[i].x+0.5)%mod)%mod,
ans[i]=((65536ll*ans[i]%mod)+LL(E[i].x+0.5)%mod)%mod,
w[i].y*=-1;
}
}```
CF613D Kingdom and its Cities.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,q,a[N],m,ans;
int stk[N],top;
bool book[N];
vector<int>g[N];
int hed[N],et;
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
namespace Tree{
int fa[N],top[N],son[N],dep[N],siz[N],dfn[N],tmr;
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v!=fa[u]&&v!=son[u])dfs2(v,v);
}
}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
void init(){dfs1(1,0),dfs2(1,1);}
}
using Tree::LCA;
using Tree::dfn;
using Tree::dep;
using Tree::fa;
inline bool cmp(int a,int b){return dfn[a]<dfn[b];}
void dfs(int u){
int cnt=0;
for(auto v:g[u]){
dfs(v);
if(book[v])++cnt;
book[v]=0;
}
if(book[u])ans+=cnt;
else{
if(cnt==1)book[u]=1;
else if(cnt>1)++ans;
}
g[u].clear();
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
Tree::init();
for(q=read();q;--q){
m=read();
rep(i,1,m)a[i]=read(),book[a[i]]=1;
sort(a+1,a+m+1,cmp);
bool flg=1;
rep(i,1,m)if(book[a[i]]&&book[fa[a[i]]]){flg=0;break;}
if(!flg){
puts("-1");
rep(i,1,m)book[a[i]]=0;
continue;
}
stk[top=1]=a[1];
rep(i,2,m){
int lca=LCA(stk[top],a[i]);
while(top>1&&dep[stk[top-1]]>=dep[lca])g[stk[top-1]].pb(stk[top]),--top;
if(lca!=stk[top])g[lca].pb(stk[top]),stk[top]=lca;
stk[++top]=a[i];
}
while(--top)g[stk[top]].pb(stk[top+1]);
ans=0,dfs(stk[1]),printf("%d\n",ans);
book[stk[1]]=0;
}
}```
CF1215D Ticket Game.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 200005
int n,c[2], s[2];
char str[N];
signed main() {
scanf("%d%s", &n, str + 1);
rep(i, 1, n){
if (str[i] != '?') s[i > n / 2] += str[i] - '0';
else ++ c[i > n / 2];
}
c[0] >>= 1, c[1] >>= 1;
if (s[0] + c[0] * 9 == s[1] + c[1] * 9) puts("Bicarp");
else puts("Monocarp");
}```
CF1091D New Year and the Permutation Concatenation.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000009;
const int mod=998244353;
int n,jc[N],a[N];
signed main() {
n=rd();
jc[0]=1;
for(int i=1;i<=n;++i)jc[i]=jc[i-1]*i%mod;
a[0]=1;
for(int i=1;i<=n;++i)
a[i]=i*(a[i-1]+jc[i-1]-1)%mod;
cout<<a[n]<<endl;
return 0;
}```
P4550 收集邮票.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=114514;
int n;
db f[N],g[N];
signed main(){
n=read();
f[0]=g[0]=1;
rep(i,1,n-1){
f[i]=f[i-1]+1.*n/(n-i);
g[i]=1.*i/(n-i)*(f[i]+1)+f[i-1]+g[i-1]+1;
}
printf("%.2lf\n",g[n-1]);
return 0;
}```
CF940F Machine Learning.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,q,a[N],lsh[N<<1],len,cnt[N<<1],nowc,nq,nc,opt[N],sz,bel[N],bin[N<<1],ans[N];
struct QUE {
int id,l,r,pre;
}que[N];
struct UPD {
int x,y;
}upd[N];
bool cmp(const QUE &a,const QUE &b) {
if(bel[a.l]!=bel[b.l])return bel[a.l]<bel[b.l];
if(bel[a.r]!=bel[b.r])return bel[a.r]<bel[b.r];
return a.pre<b.pre;
}
void pop(int x) {--bin[cnt[x]],--cnt[x],++bin[cnt[x]];}
void add(int x) {--bin[cnt[x]],++cnt[x],++bin[cnt[x]];}
void modify(int x,int i) {
if(que[i].l<=upd[x].x&&upd[x].x<=que[i].r) {
pop(a[upd[x].x]);
add(upd[x].y);
}
swap(a[upd[x].x],upd[x].y);
}
int mex() {
for(rint i=1;i<=n;++i)if(!bin[i])return i;
}
signed main() {
n=rd(),q=rd(),sz=ceil(pow(n,0.666));
for(rint i=1;i<=n;++i)a[i]=lsh[++len]=rd(),bel[i]=(i-1)/sz+1;
for(rint i=1;i<=q;++i) {
opt[i]=rd();
if(opt[i]&1) {
++nq;
que[nq].id=nq;
que[nq].l=rd();
que[nq].r=rd();
que[nq].pre=nc;
} else {
++nc;
upd[nc].x=rd();
lsh[++len]=upd[nc].y=rd();
}
}
sort(lsh+1,lsh+len+1);len=unique(lsh+1,lsh+len+1)-lsh-1;
for(rint i=1;i<=n;++i)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
for(rint i=1;i<=nc;++i)upd[i].y=lower_bound(lsh+1,lsh+len+1,upd[i].y)-lsh;
sort(que+1,que+nq+1,cmp);
for(rint i=1,l=1,r=0;i<=nq;++i) {
while(l<que[i].l)pop(a[l++]);
while(l>que[i].l)add(a[--l]);
while(r<que[i].r)add(a[++r]);
while(r>que[i].r)pop(a[r--]);
while(nowc<que[i].pre)modify(++nowc,i);
while(nowc>que[i].pre)modify(nowc--,i);
ans[que[i].id]=mex();
}
for(rint i=1;i<=nq;++i)printf("%d\n",ans[i]);
return 0;
}```
P2868 [USACO07DEC]Sightseeing Cows G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1010;
const int M=5010;
const double eps=1e-4;
int n,m,F[N];
int head[N],num_edge;
double dst[N];
int inq[N],num[N];
struct edge {
int nxt,to,tim;
double val;
}e[M];
void addedge(int from,int to,int val) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].tim=val;
head[from]=num_edge;
}
bool spfa() {
for(rint i=1;i<=n;++i)dst[i]=1e12,inq[i]=0,num[i]=0;
queue<int>q;q.push(1);
num[1]=1,inq[1]=1,dst[1]=0;
while(!q.empty()) {
int u=q.front();q.pop(),inq[u]=0;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(dst[v]>dst[u]+e[i].val) {
dst[v]=dst[u]+e[i].val;
++num[v];
if(num[v]>n)return 1;
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return 0;
}
bool check(double k) {
for(rint i=1;i<=m;++i)e[i].val=1.0*k*e[i].tim-F[e[i].to]-eps;
return spfa();
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)F[i]=rd();
for(rint i=1;i<=m;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z);
}
double l=0,r=1e6;
while(r-l>eps) {
double mid=(l+r)/2;
if(check(mid))l=mid;
else r=mid;
}
printf("%.2lf\n",l);
return 0;
}
```
P4269 [USACO18FEB]Snow Boots G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 100009
int n,m,f[N],ans[N];
struct node {
int id,s,d;
}a[N];
inline bool cmp1(const node&a,const node&b) {
return a.s<b.s;
}
struct snow {
int id,f;
}b[N];
inline bool cmp2(const snow&a,const snow&b) {
return a.f<b.f;
}
set<int>w;
multiset<int>s;
typedef set<int>::iterator IT;
void add(int x) {
IT Pre=w.lower_bound(x),Suf=w.upper_bound(x);
--Pre;
int pre=*Pre,suf=*Suf;
s.erase(s.lower_bound(suf-pre));
s.insert(x-pre),s.insert(suf-x);
w.insert(x);
}
signed main() {
n=rd(),m=rd();
if(n==1) {
for(int i=1;i<=m;++i)puts("1");
return 0;
}
for(int i=1;i<=n;++i)b[i].f=f[i]=rd(),b[i].id=i;
for(int i=1;i<=m;++i)a[i].id=i,a[i].s=rd(),a[i].d=rd();
sort(a+1,a+m+1,cmp1),sort(b+1,b+n+1,cmp2);
w.insert(1),w.insert(n),s.insert(n-1);
for(int i=1,j=1;i<=n;++i) {
while(j<=n&&b[j].f<=a[i].s) {
if(b[j].id!=1&&b[j].id!=n)add(b[j].id);
++j;
}
ans[a[i].id]=*s.rbegin()<=a[i].d;
}
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
CF1481C Fence Painting.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
#define FAIL return puts("NO"),void()
int n,a[N],b[N],c[N],m,cnt[N],ned[N];
vector<int>v[N];
void Main(){
n=read(),m=read();
rep(i,1,n)a[i]=read(),cnt[i]=ned[i]=0,v[i].clear();
rep(i,1,n){
b[i]=read();
if(a[i]!=b[i])++ned[b[i]],v[b[i]].pb(i);
}
rep(i,1,m)c[i]=read(),++cnt[c[i]];
int id=0;
rep(i,1,n)if(c[m]==b[i]){id=i;break;}
if(ned[c[m]])id=v[c[m]][0];
if(!id)FAIL;
rep(i,1,n)if(cnt[i]<ned[i])FAIL;
puts("YES");
rep(i,1,m){
if(ned[c[i]])printf("%d ",v[c[i]][--ned[c[i]]]);
else printf("%d ",id);
}
puts("");
}
signed main(){for(int T=read();T;--T)Main();}```
P3702 [SDOI2017]序列计数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int mod=20170408;
int n,m,p,A[105],B[105],a[105],b[105],c[105];
int pri[4000005],cnt;
bool vis[20000005];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void mul(int*a,int*b){
rep(i,0,p-1)rep(j,0,p-1)fmod(c[i+j>=p?i+j-p:i+j]+=1ll*a[i]*b[j]%mod);
rep(i,0,p-1)a[i]=c[i],c[i]=0;
}
signed main(){
n=read(),m=read(),p=read();
A[0]=B[0]=1;
vis[1]=1;
rep(i,1,m){
++a[i%p];
if(!vis[i])pri[++cnt]=i;
else ++b[i%p];
for(int j=1;j<=cnt&&i*pri[j]<=m;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
for(;n;n>>=1,mul(a,a),mul(b,b))if(n&1)mul(A,a),mul(B,b);
printf("%d\n",(A[0]-B[0]+mod)%mod);
}```
CF97B Superset.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=150005;
int n,len,tot;
struct point{
int x,y;
}a[N],ans[N],p[N];
bool cmp(const point &a,const point &b)
{
if(a.x!=b.x)return a.x<b.x;
else return a.y<b.y;
}
void msort(int l,int r)
{
if(l==r){ans[++tot]=a[l];return;}
if(l>r)return;
int mid=(l+r)>>1;
msort(l,mid-1);msort(mid+1,r);
for(int i=l;i<=r;++i)
{
point tmp;
tmp.x=a[mid].x;
tmp.y=a[i].y;
ans[++tot]=tmp;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+n+1,cmp);
msort(1,n);
sort(ans+1,ans+tot+1,cmp);
ans[0].x=ans[0].y=1000000007;
for(int i=1;i<=tot;++i)
{
if(ans[i].x!=ans[i-1].x||ans[i].y!=ans[i-1].y)
p[++len]=ans[i];
}
printf("%d\n",len);
for(int i=1;i<=len;++i)
printf("%d %d\n",p[i].x,p[i].y);
return 0;
}```
CF1264E Beautiful League.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 105 * 105 / 2 + 105;
const int M = (3 * 105 * 105 / 2 + 105 * 105) * 2;
const int inf = 0x3f3f3f3f;
int n, a[105][105], m;
pair <int, int> b[105 * 105];
int dis[N], cur[N], S, T, ND, mf, mc;
bool inq[N], vis[N];
int hed[N], et = 1;
struct edge{ int nx, to, fl, c; } e[M];
inline void Adde(int u, int v, int fl, int c) {
e[++et].nx = hed[u], e[et].to = v, e[et].fl = fl, e[et].c = c, hed[u] = et;
}
inline void adde(int u, int v, int fl, int c) {
Adde(u, v, fl, c), Adde(v, u, 0, -c);
}
bool spfa() {
queue <int> q;
for(int i = 1; i <= ND; ++i)
cur[i] = hed[i], dis[i] = inf;
q.push(S), dis[S] = 0;
while(!q.empty()) {
int u = q.front(); q.pop(), inq[u] = 0;
for(int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to;
if(e[i].fl && ckmin(dis[v], dis[u] + e[i].c)) {
if (!inq[v]) inq[v] = 1, q.push(v);
}
}
}
return dis[T] < T;
}
int dfs(int u, int fl) {
vis[u] = 1;
if(u == T) return fl;
int us = 0, rl;
for(int i = cur[u]; i; i = e[i].nx) {
int v = e[i].to; cur[u] = i;
if(e[i].fl && dis[v] == dis[u] + e[i].c && (v == T || !vis[v])) {
rl = dfs(v, min(fl - us, e[i].fl));
if(rl) e[i].fl -= rl, e[i ^ 1].fl += rl, mc += e[i].c * rl, us += rl;
if(us == fl) break;
}
}
return us;
}
void MCMF() {
while(spfa()){
vis[T] = 1;
while(vis[T]) memset(vis, 0, T + 1), mf += dfs(S, inf);
}
}
signed main() {
n = read(), m = read();
rep(i, 1, n) rep(j, 1, n) a[i][j] = i == j ? 0 : 2;
rep(i, 1, m) {
int x = read(), y =read();
a[x][y] = 1, a[y][x] = 0;
}
S = n * (n - 1) / 2 + n + 1, T = S + 1, ND = T;
int idx = 0;
rep(i, 1, n) {
rep(j, 1, i - 1) {
++idx, b[idx] = mkp(i, j);
adde(S, idx + n, 1, 0);
if(a[i][j] == 2) {
adde(idx + n, i, 1, 0);
adde(idx + n, j, 1, 0);
} else if(a[i][j] == 1) {
adde(idx + n, j, 1, 0);
} else adde(idx + n, i, 1, 0);
}
}
rep(i, 1, n)
rep(j, 0, n - 1) adde(i, T, 1, j);
MCMF();
memset(a, 0, sizeof(a));
for(int i = 2; i <= et; i += 2) {
int u = e[i ^ 1].to, v = e[i].to;
if(u == S || v == T || v == S || u == T) continue;
if(e[i ^ 1].fl) {
int x = b[u - n].fi, y = b[u - n].se;
if(x == v) a[y][v] = 1, a[v][y] = 0;
else a[x][v] = 1, a[v][x] = 0;
}
}
rep(i, 1, n) {
rep(j, 1, n) printf("%d",a[i][j]);
puts("");
}
}```
P3648 [APIO2014]序列分割.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int K=205;
const LL inf=1e18;
int n,k,a[N],H,T,q[N],pre[N][K],id;
LL dp[N][K],s[N],ans;
db slope(int i,int j,int c){
return s[i]==s[j]?inf:1.*(dp[i][c]-dp[j][c])/(s[i]-s[j]);
}
void print(int n,int k){
if(k==1)return printf("%d ",n),void();
print(pre[n][k],k-1);
printf("%d ",n);
}
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=read(),s[i]=s[i-1]+a[i];
rep(i,1,n)dp[i][1]=s[i]*(s[n]-s[i]);
rep(j,2,k){
H=1,T=0;
rep(i,1,n){
while(H<T&&slope(q[H],q[H+1],j-1)>=s[n]-s[i])++H;
dp[i][j]=dp[q[H]][j-1]+(s[i]-s[q[H]])*(s[n]-s[i]),pre[i][j]=q[H];
while(H<T&&slope(q[T-1],q[T],j-1)<=slope(q[T-1],i,j-1))--T;
q[++T]=i;
}
}
rep(i,1,n)if(ckmax(ans,dp[i][k]))id=i;
printf("%lld\n",ans);
print(id,k),puts("");
return 0;
}```
P2633 Count on a tree.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
const int M=N*22;
int n,m,a[N],lsh[N],len,lastans;
vector<int>g[N];
int val[M],ls[M],rs[M],root[N],cnt;
int dep[N],fa[N],top[N],son[N],siz[N];
void build(int &p,int l,int r) {
p=++cnt;
if(l==r)return;
int mid=(l+r)>>1;
build(ls[p],l,mid),build(rs[p],mid+1,r);
}
void update(int pre,int &now,int l,int r,int pos) {
now=++cnt,ls[now]=ls[pre],rs[now]=rs[pre],val[now]=val[pre]+1;
if(l==r)return;
int mid=(l+r)>>1;
if(pos<=mid)update(ls[pre],ls[now],l,mid,pos);
else update(rs[pre],rs[now],mid+1,r,pos);
}
int query(int rt1,int rt2,int rt3,int rt4,int l,int r,int k) {
if(l==r)return lsh[l];
int sum=val[ls[rt1]]+val[ls[rt2]]-val[ls[rt3]]-val[ls[rt4]],mid=(l+r)>>1;
if(k<=sum)return query(ls[rt1],ls[rt2],ls[rt3],ls[rt4],l,mid,k);
else return query(rs[rt1],rs[rt2],rs[rt3],rs[rt4],mid+1,r,k-sum);
}
void dfs(int u,int ft) {
update(root[fa[u]],root[u],1,len,a[u]);
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
dfs(v,u);
}
}
void dfs1(int u,int ft) {
siz[u]=1;
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
dep[v]=dep[u]+1,fa[v]=u;
dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int LCA(int x,int y) {
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)lsh[i]=a[i]=rd();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
for(rint i=1;i<=n;++i)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
for(rint i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].pb(y),g[y].pb(x);
}
dfs1(1,0),dfs2(1,1),build(root[1],1,len),dfs(1,0);
while(m--) {
int u=rd()^lastans,v=rd(),k=rd(),lca=LCA(u,v);
printf("%d\n",lastans=query(root[u],root[v],root[lca],root[fa[lca]],1,len,k));
}
return 0;
}
```
P7370 [COCI2018-2019#4] Wand.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
const int M = N;
int n, m, deg[N];
char ans[N];
bool vis[N];
int hed[N], et;
struct edge{int nx, to;} e[M];
inline void adde(int u, int v){
e[++et].to = v, e[et].nx = hed[u], hed[u] = et;
}
void dfs(int u) {
for(int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to;
if(!vis[v])vis[v] = 1, dfs(v);
}
}
signed main() {
n = read(), m = read();
rep(i, 1, m) {
int x = read(), y = read();
adde(y, x), ++deg[y];
}
dfs(1);
for(int i = 1; i <= n; ++i) ans[i] = vis[i] ? '1' : '0';
if(!deg[1]) ans[1] = '1';
ans[n + 1] = '\0';
puts(ans + 1);
}```
CF900A Find Extra One.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,cnt[2];
signed main(){
n=read();
for(int i=1;i<=n;++i){
int x=read(),y=read();
++cnt[x<0];
}
puts(cnt[0]<2||cnt[1]<2?"Yes":"No");
}
```
CF1027A Palindromic Twist.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=105;
int n;
char s[N];
void Main() {
scanf("%d%s",&n,s+1);
for(int i=1;i<=n>>1;++i)
if(abs(s[i]-s[n-i+1])>2||abs(s[i]-s[n-i+1])%2)return puts("NO"),void();
puts("YES");
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
压位高精加减乘除.cpp
```const int N=2010;
const int base=10000;
const int limit=4;
int power_10[6]={1,10,100,1000,1000,10000};
struct num {
LL a[N],len;
num(){memset(a,0,sizeof(a)),len=0;}
void init(LL x) {
while(x)a[len++]=x%base,x/=base;
}
void read() {
char s[2010];
scanf("%s",s);
len=1;
int n=strlen(s),t=0;
for(rint i=n-1;~i;--i,++t) {
a[len-1]+=(s[i]-'0')*power_10[t];
if(t+1==limit)t=-1,++len;
}
if(!t)--len;
}
void print(char c=-1) {
printf("%lld",a[len-1]);
for(rint i=len-2;i>=0;--i)printf("%0*lld",limit,a[i]);
if(~c)putchar(c);
}
};
num operator + (const num &a,const num &b) {
num c;int mx=max(a.len,b.len);c.len=mx;
for(rint i=0;i<mx;++i)c.a[i]=a.a[i]+b.a[i];
for(rint i=0;i<mx;++i)if(c.a[i]>=base)++c.a[i+1],c.a[i]-=base;
if(c.a[c.len])++c.len;
return c;
}
num operator - (const num &a,const num &b) {
num c;int mx=a.len;c.len=mx;
for(rint i=0;i<mx;++i)c.a[i]=a.a[i]-b.a[i];
for(rint i=0;i<mx;++i)if(c.a[i]<0)--c.a[i+1],c.a[i]+=base;
while(c.len&&!c.a[c.len-1])--c.len;
return c;
}
num operator * (const num &a,const num &b) {
num c;int mx=a.len+b.len-1;c.len=mx;
for(rint i=0,mxa=a.len;i<mxa;++i)
for(rint j=0,mxb=b.len;j<mxb;++j) {
c.a[i+j]+=a.a[i]*b.a[j];
if(c.a[i+j]>=base)c.a[i+j+1]+=c.a[i+j]/base,c.a[i+j]%=base;
}
if(c.a[c.len])++c.len;
return c;
}
num operator / (const num &a,const int &b) {
num c;int mx=a.len;
LL now=0;
for(rint i=mx-1,s=0;~i;--i) {
now=now*base+a.a[i];
if(now/b)s=1;
if(!s)continue;
c.a[c.len++]=now/b;
now%=b;
}
reverse(c.a,c.a+c.len);
return c;
}
bool operator < (const num &a,const num &b) {
if(a.len!=b.len)return a.len<b.len;
for(rint i=a.len-1;~i;--i)if(a.a[i]!=b.a[i])return a.a[i]<b.a[i];
return 0;
}```
AT5200 [AGC038C] LCMs.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N = 1000005;
const int M = N - 5;
const int mod = 998244353;
const int iv2 = (mod + 1) >> 1;
int n, c[N], mu[N], pri[N/9], cnt, f[N], ans, g[N], a[N];
bool vis[N];
void Sieve(const int&N) {
mu[1] = 1;
for (int i = 2; i <= N; ++ i) {
if(!vis[i])pri[++cnt]=i,mu[i]=-1;
for (int j = 1; i * pri[j] <= N; ++ j) {
vis[i * pri[j]] = 1;
if (i % pri[j]) mu[i * pri[j]] = - mu[i];
else break;
}
}
for (int i = 1; i <= N; ++ i)
for (int j = 1; i * j <= N; ++ j)
f[i * j] = (f[i * j] +1ll * mu[i] * i % mod) % mod;
for (int i = 1; i <= N; ++ i)
for (int j = 1; i * j <= N; ++ j)
g[i] = (g[i] + 1ll * j * c[i * j]) % mod;
for (int i = 1; i <= N; ++ i)
ans = (ans + 1ll * i * f[i] % mod * g[i] % mod * g[i] % mod) % mod;
}
signed main() {
n = read();
for (int i = 1; i <= n; ++ i) ++c[a[i] = read()];
Sieve(M);
for(int i = 1; i <= n; ++ i) ans = (ans - a[i]) % mod;
ans = 1ll * ans * iv2 % mod;
printf("%d\n", (ans + mod) % mod);
return 0;
}```
CF1207F Remainder Problem.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
const int L=720;
int n=N-10,m,len,a[N],blo[L][L];
void change(int x,int y) {
for(rint i=1;i<=len;++i)blo[i][x%i]+=y;
a[x]+=y;
}
int query(int x,int y) {
if(x>len) {
int res=0;
for(rint i=y;i<=n;i+=x)res+=a[i];
return res;
} else return blo[x][y];
}
signed main() {
m=rd();len=710;
while(m--) {
int opt=rd(),x=rd(),y=rd();
if(opt==1) change(x,y);
else printf("%d\n",query(x,y));
}
return 0;
}```
P3346 [ZJOI2015]诸神眷顾的幻想乡.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define T (1900000*2)
int n,c,a[N],deg[N],lef[N],fa[N];
LL ans;
int link[T],lst,tot=1,mxlen[T],trans[T][10];
struct edge{int nxt,to;}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u,int ft){
fa[u]=ft;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
dfs(v,u);
}
}
int extend(int c){
if(trans[lst][c]){
int p=lst,q=trans[lst][c];
if(mxlen[p]+1==mxlen[q])return q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<10;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<10;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
signed main(){
n=read(),c=read();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
++deg[x],++deg[y];
}
for(int i=1;i<=n;++i)if(deg[i]==1)lef[++lef[0]]=i;
for(int i=1;i<=lef[0];++i){
dfs(lef[i],0);
for(int j=1;j<=lef[0];++j){
if(i==j)continue;
int u=lef[j];
lst=1;
while(u){
lst=extend(a[u]);
u=fa[u];
}
}
}
for(int i=1;i<=tot;++i)ans+=mxlen[i]-mxlen[link[i]];
printf("%lld\n",ans);
return 0;
}```
CF986A Fair.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd(){
int f=1,x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int N=100009;
const int K=105;
int n,m,k,S,a[N],dis[K][N];
int vis[N];
struct edge {
int nxt,to;
}e[N<<1];
int head[N],num_edge;
inline void addedge(int fr,int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
struct node {
int u,dis;
node(){u=dis=0;}
node(int u_,int dis_){u=u_,dis=dis_;}
};
void bfs(int t) {
queue<node>q;
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;++i)if(a[i]==t)q.push(node(i,0)),vis[i]=1;
while(!q.empty()) {
node now=q.front();q.pop();
int u=now.u,d=now.dis;
dis[t][u]=d;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!vis[v])vis[v]=1,q.push(node(v,d+1));
}
}
}
signed main() {
n=rd(),m=rd(),k=rd(),S=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
for(int i=1;i<=k;++i)bfs(i);
for(int i=1;i<=n;++i) {
long long res=0;
priority_queue<int,vector<int>,greater<int> >pq;
for(int j=1;j<=k;++j)pq.push(dis[j][i]);
for(int j=1;j<=S;++j)res+=pq.top(),pq.pop();
printf("%lld ",res);
}
return 0;
}```
P6240 好吃的题目.cpp
```#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1; char c = getchar();
while(!isdigit(c)) { if(c == '-') f = 0; c = getchar(); }
while(isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();
return f ? x : -x;
}
template <class T> inline bool ckmax(T &x, T y) { return x < y ? x = y, 1 : 0;}
template <class T> inline bool ckmin(T &x, T y) { return x > y ? x = y, 1 : 0;}
const int N = 40005;
const int M = 200005;
int n, m, h[N], w[N], ans[M], bg1[N][205], bg2[N][205];
struct node {
int l, r, t, id;
} q[M], q1[M], q2[M], q3[M];
void solve(int l, int r, int x, int y) {
if(x > y) return;
if(l == r) {
for(int i = x; i <= y; ++i)
ans[q[i].id] = h[l] <= q[i].t ? w[l] : 0;
return;
}
int mid = (l + r) >> 1, t1 = 0, t2 = 0, t3 = 0, it = x;
for(int i = x; i <= y; ++i)
if(q[i].r <= mid) q1[++t1] = q[i];
else if(q[i].l >= mid + 1) q2[++t2] = q[i];
else q3[++t3] = q[i];
for(int i = 1; i <= t1; ++i) q[it++] = q1[i];
for(int i = 1; i <= t2; ++i) q[it++] = q2[i];
for(int i = 1; i <= t3; ++i) q[it++] = q3[i];
solve(l, mid, x, x + t1 - 1), solve(mid + 1, r, x + t1, x + t1 + t2 - 1);
memset(bg1[mid + 1], 0, sizeof(bg1[mid + 1]));
memset(bg2[mid], 0, sizeof(bg2[mid]));
for(int i = mid; i >= l; --i) {
for(int j = 200; j >= 0; --j){
bg1[i][j] = bg1[i + 1][j];
if(j >= h[i]) ckmax(bg1[i][j], bg1[i + 1][j - h[i]] + w[i]);
}
}
for(int i = mid + 1; i <= r; ++i) {
for(int j = 200; j >= 0; --j) {
bg2[i][j] = bg2[i - 1][j];
if(j >= h[i]) ckmax(bg2[i][j], bg2[i - 1][j - h[i]] + w[i]);
}
}
for(int i = x + t1 + t2; i <= y; ++i) {
int res = 0, t = q[i].t, ll = q[i].l, rr = q[i].r;
for(int j = 0; j <= t; ++j)
ckmax(res, bg1[ll][j] + bg2[rr][t - j]);
ans[q[i].id] = res;
}
}
signed main() {
n = read(), m = read();
for(int i = 1; i <= n; ++i) h[i] = read();
for(int i = 1; i <= n; ++i) w[i] = read();
for(int i = 1; i <= m; ++i)
q[i].l = read(), q[i].r = read(), q[i].t = read(), q[i].id = i;
solve(1, n, 1, m);
for(int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}```
SP11985 GOT - Gao on a tree.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
int n,m,a[N];
int dfn[N],top[N],fa[N],siz[N],son[N],dep[N],timer;
vector<int>g[N];
set<int>v[N];
struct ASK {
int x,y,z;
}q[N<<1];
void dfs1(int u,int ft) {
siz[u]=1;
for(int v:g[u]) {
if(v==ft)continue;
fa[v]=u,dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
top[u]=tp,dfn[u]=++timer;
if(son[u])dfs2(son[u],tp);
for(int v:g[u]) {
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int query(int x,int y,int z) {
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
if(*v[z].lower_bound(dfn[top[x]])<=dfn[x])return 1;
x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
return *v[z].lower_bound(dfn[x])<=dfn[y];
}
void Main() {
for(int i=0;i<=n;++i)g[i].clear(),v[i].clear();
memset(son,0,sizeof(son));
memset(dfn,0,sizeof(dfn));
memset(top,0,sizeof(top));
memset(fa,0,sizeof(fa));
memset(siz,0,sizeof(siz));
memset(dep,0,sizeof(dep));
timer=0;
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].pb(y),g[y].pb(x);
}
for(int i=1;i<=m;++i)q[i].x=rd(),q[i].y=rd(),q[i].z=rd();
for(int i=0;i<=n;++i)v[i].insert(0),v[i].insert(n+1);
dfs1(1,0),dfs2(1,1);
for(int i=1;i<=n;++i)v[a[i]].insert(dfn[i]);
for(int i=1;i<=m;++i)puts(query(q[i].x,q[i].y,q[i].z)?"Find":"NotFind");
}
signed main() {
while(scanf("%d%d",&n,&m)!=EOF)Main();
}```
CF570D Tree Requests.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int rdc() {
char c=getchar();
while(!isalpha(c))c=getchar();
return c-'a';
}
const int N=500010;
int n,m,a[N],ans[N];
int siz[N],son[N],dep[N],cnt[N];
vector<pair<int,int> >que[N];
vector<int>g[N];
void dfs1(int u) {
siz[u]=1;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
dep[v]=dep[u]+1;
dfs1(v);
siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void calc(int u,int sn) {
cnt[dep[u]]^=1<<a[u];
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==sn)continue;
calc(v,sn);
}
}
int check(int x) {
x-=x&-x;
return !x;
}
void clear(int u) {
cnt[dep[u]]^=1<<a[u];
for(rint i=0;i<g[u].size();++i)clear(g[u][i]);
}
void dfs(int u,int keep) {
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==son[u])continue;
dfs(v,0);
}
if(son[u])dfs(son[u],1);
calc(u,son[u]);
for(vector<pair<int,int> >::iterator it=que[u].begin();it!=que[u].end();++it)
ans[it->second]=check(cnt[it->first]);
if(!keep) {
cnt[dep[u]]^=1<<a[u];
for(rint i=0;i<g[u].size();++i)clear(g[u][i]);
}
}
signed main() {
n=rd(),m=rd();
for(rint i=2;i<=n;++i)g[rd()].pb(i);
for(rint i=1;i<=n;++i)a[i]=rdc();
for(rint i=1;i<=m;++i) {
int x=rd(),y=rd();
que[x].pb(make_pair(y,i));
}
dep[1]=1,dfs1(1),dfs(1,1);
for(rint i=1;i<=m;++i)puts(ans[i]?"Yes":"No");
return 0;
}```
CF360B Levko and Array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2005;
int n,k,a[N],l,r,ans;
bool check(int x) {
int f[N]={0};
for(int i=1;i<=n;++i) {
f[i]=i-1;
for(int j=1;j<i;++j) {
if(abs(a[i]-a[j])<=(i-j)*x)
f[i]=min(f[i],f[j]+i-j-1);
}
if(f[i]+n-i<=k)return true;
}
return false;
}
signed main() {
scanf("%lld%lld",&n,&k);
for(int i=1;i<=n;++i)
scanf("%lld",&a[i]);
for(int i=1;i<n;++i)
r=max(r,abs(a[i]-a[i+1]));
while(l<=r) {
int mid=(l+r)>>1;
if(check(mid))ans=mid,r=mid-1;
else l=mid+1;
}
printf("%lld\n",ans);
return 0;
}```
CF16E Fish.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=18;
db a[N][N],dp[1<<N];
int n;
signed main(){
scanf("%d",&n);
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
scanf("%lf",&a[i][j]);
dp[(1<<n)-1]=1;
for(int msk=(1<<n)-1;msk;--msk){
db d=__builtin_popcount(msk);
d=d*(d-1)/2;
for(int i=0;i<n;++i){
if(!(msk>>i&1))continue;
for(int j=0;j<n;++j){
if(!(msk>>j&1))continue;
dp[msk-(1<<j)]+=dp[msk]*a[i][j]/d;
}
}
}
for(int i=0;i<n;++i)printf("%.6lf ",dp[1<<i]);
return 0;
} ```
CF1187G Gang Up.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=103;
const int N=52*K;
const int D=K-2;
const int M=2*(K+52+52*K+2*52*52*K);
const int inf=0x3f3f3f3f;
int n,m,k,c,d,a[52],S,T;
int dis[N],mf,mc,inc[N],pre[N];
bool vis[N],inq[N];
struct edge{int nx,to,fl,c;}e[M];
int et=1,hed[N];
void addedge(int u,int v,int fl,int c){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,e[et].c=c,hed[u]=et;}
void adde(int u,int v,int fl,int c){addedge(u,v,fl,c),addedge(v,u,0,-c);}
int id(int dep,int x){return (dep-1)*n+x;}
bool spfa(){
queue<int>q;
rep(i,1,T)dis[i]=inf,inq[i]=0;
inc[S]=inf,dis[S]=0,q.push(S);
while(!q.empty()){
int u=q.front();q.pop(),inq[u]=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&ckmin(dis[v],dis[u]+e[i].c)){
pre[v]=i,inc[v]=min(e[i].fl,inc[u]);
if(!inq[v])inq[v]=1,q.push(v);
}
}
}
return dis[T]<inf;
}
void EK(){
int rl=inc[T];
mf+=rl;
for(int u=T;u!=S;u=e[pre[u]^1].to)
e[pre[u]].fl-=rl,e[pre[u]^1].fl+=rl,mc+=e[pre[u]].c*rl;
}
signed main(){
n=read(),m=read(),k=read(),c=read(),d=read(),S=id(D,n)+1,T=S+1;
rep(i,1,k)a[i]=read(),adde(S,id(1,a[i]),1,0);
rep(i,1,m){
int x=read(),y=read();
rep(j,1,D-1)rep(l,0,k-1)adde(id(j,x),id(j+1,y),1,(2*l+1)*d+c),adde(id(j,y),id(j+1,x),1,(2*l+1)*d+c);
}
rep(i,1,D-1)rep(j,1,n)adde(id(i,j),id(i+1,j),k,c);
rep(i,1,D)adde(id(i,1),T,k,0);
while(spfa())EK();
printf("%d\n",mc);
return 0;
}
/*
3 3 4 2 3
3 2 2 3
1 2
2 3
2 3
*/```
P4084 [USACO17DEC]Barn Painting G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define zky 1000000007
#define N 100009
int n,k,a[N],dp[N][3],c[N];
int head[N],num_edge;
struct edge {
int to,nxt;
}e[N<<1];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
void dfs(int u,int ft) {
if(~c[u])dp[u][c[u]]=1;
else dp[u][0]=dp[u][1]=dp[u][2]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs(v,u);
if(~c[u]) {
dp[u][c[u]]=1ll*dp[u][c[u]]*(dp[v][(c[u]+1)%3]+dp[v][(c[u]+2)%3])%zky;
} else {
dp[u][0]=1ll*dp[u][0]*(dp[v][1]+dp[v][2])%zky;
dp[u][1]=1ll*dp[u][1]*(dp[v][0]+dp[v][2])%zky;
dp[u][2]=1ll*dp[u][2]*(dp[v][0]+dp[v][1])%zky;
}
}
}
signed main() {
n=rd(),k=rd();
for(int i=1;i<n;++i){
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
memset(c,-1,sizeof(c));
for(int i=1;i<=k;++i) {
int x=rd(),y=rd();
c[x]=y-1;
}
dfs(1,0);
printf("%d\n",((dp[1][0]+dp[1][1])%zky+dp[1][2])%zky);
return 0;
}```
CF961G Partitions.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
#define mod 1000000007
inline int qpow(int n,int k){if(k<0)return 0;int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,k,sum,fac[N],ifc[N],ans;
int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
signed main(){
n=read(),k=read()-1;
rep(i,1,n)sum=(sum+read())%mod;
fac[0]=1;rep(i,1,k)fac[i]=1ll*i*fac[i-1]%mod;
ifc[k]=qpow(fac[k],mod-2);per(i,k-1,0)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
for(int i=0;i<=k;++i){
int tmp=1ll*comb(k,i)*(qpow(1+i,n-1)+1ll*(n-1)*qpow(1+i,n-2)%mod)%mod;
(k-i)&1?ans=(ans+mod-tmp)%mod:ans=(ans+tmp)%mod;
}
ans=1ll*ans*ifc[k]%mod*sum%mod;
cout<<ans<<'\n';
}```
字符串哈希.cpp
```//调用手写随机数
template<int N>
struct String_Hash{
static const int O=N+5;
LL H1[O],H2[O],pw1[O],pw2[O],mod1,mod2;
int base1,base2;
String_Hash(){
static const int base[8]={31,37,41,43,47,53,59,61};
static const LL mod[8]={100000000000031ll,100000000000367ll,100000000000169ll,100000000000261ll,
10000000000000069ll,10000000000000639ll,10000000000000753ll,10000000000000669ll};
static Rand maker;
base1=base[maker.rand()&7];
while((base2=base[maker.rand()&7])==base1);
mod1=mod[maker.rand()&7];
while((mod2=mod[maker.rand()&7])==mod1);
pw1[0]=1;for(int i=1;i<=N;++i)pw1[i]=pw1[i-1]*base1%mod1;
pw2[0]=1;for(int i=1;i<=N;++i)pw2[i]=pw2[i-1]*base2%mod2;
}
void insert(char*str){
int n=strlen(str);
H1[0]=H2[0]=0;
for(int i=0;i<n;++i)H1[i+1]=(H1[i]*base1+str[i]-'a'+1)%mod1;
for(int i=0;i<n;++i)H2[i+1]=(H2[i]*base2+str[i]-'a'+1)%mod2;
}
LL mul(LL x,LL y,LL mod){
LL res=x*y-(LL)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
pair<LL,LL>Hash_val(int l,int r){
LL v1=(H1[r]-mul(H1[l-1],pw1[r-l+1],mod1)+mod1)%mod1;
LL v2=(H2[r]-mul(H2[l-1],pw2[r-l+1],mod2)+mod2)%mod2;
return mkp(v1,v2);
}
};```
P6187 [NOI Online #1 提高组]最小环.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 200005
int n,m,a[N];
LL ans[N];
int gcd(int x,int y){return !y?x:gcd(y,x%y);}
LL f(int x){
if(!x){
if(ans[0])return ans[0];
for(int i=1;i<=n;++i)ans[0]+=1ll*a[i]*a[i];
return ans[0];
}
int len=n/gcd(n,x);
if(ans[len])return ans[len];
LL res=0;
for(int i=1;i<=n;i+=len){
for(int j=i;j<i+len-2;++j)
res+=1ll*a[j]*a[j+2];
res+=1ll*a[i+1]*a[i]+1ll*a[i+len-1]*a[i+len-2];
}
return ans[len]=res;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)a[i]=read();
sort(a+1,a+n+1);
while(m--)printf("%lld\n",f(read()));
return 0;
}```
SP422 TRANSP2 - Transposing is Even More Fun.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000003
inline int qpow(int n, int k) {
int res = 1;
for(; k; k >>= 1, n = 1ll * n * n % mod)
if(k & 1) res = 1ll * n * res % mod;
return res;
}
const int N = 1000005;
int phi[N], pct, pri[N], pw2[N], inv[N];
bool vis[N];
int pool[N * 20], *mem = pool, *d[N], cnt[N];
void init() {
phi[1] = 1;
for(int i = 2; i < N; ++i) {
if(!vis[i]) pri[++pct] = i, phi[i] = i - 1;
for(int j = 1; j <= pct && i * pri[j] < N; ++j) {
vis[i * pri[j]] = 1;
if(i % pri[j] == 0) {
phi[i * pri[j]] = phi[i] * pri[j];
break;
} else phi[i * pri[j]] = phi[i] * phi[pri[j]];
}
}
for(int i = 1; i < N; ++i)
for(int j = 1; i * j < N; ++j)
++cnt[i * j];
for(int i = 1; i < N; ++i) d[i] = mem, mem += cnt[i], cnt[i] = 0;
for(int i = 1; i < N; ++i)
for(int j = 1; i * j < N; ++j)
d[i * j][cnt[i * j]++] = i;
pw2[0] = 1;
for(int i = 1; i < N; ++i) pw2[i] = (pw2[i - 1] << 1) % mod;
inv[1] = 1;
for(int i = 2; i < N; ++i) inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
}
inline int gcd(int a, int b) {
while(b) { int t = a % b; a = b, b = t; }
return a;
}
signed main() {
// freopen("dt.in", "r", stdin);
// freopen("1.out", "w", stdout);
init();
for(int T = read(); T; --T) {
int a = read(), b = read();
if(!a || !b) { puts("0"); continue; }
int g = gcd(a, b), t = (a + b) / g, ans = 0;
for(int i = 0; i < cnt[t]; ++i) {
int x = d[t][i];
ans = (ans + 1ll * phi[t / x] * pw2[g * x] % mod) % mod;
}
ans = (pw2[a + b] - 1ll * ans * inv[t] % mod + mod) % mod;
printf("%d\n", ans);
}
}```
CF1327F AND Segments.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
#define mod 998244353
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,k,m,l[N],r[N],x[N],dif[N],pos[N],ans=1,dp[N];
signed main(){
n=read(),k=read(),m=read();
rep(i,1,m)l[i]=read(),r[i]=read(),x[i]=read();
rep(i,0,k-1){
rep(j,1,n+1)pos[j]=dif[j]=dp[i]=0;
rep(j,1,m)
if(x[j]>>i&1)++dif[l[j]],--dif[r[j]+1];
else ckmax(pos[r[j]+1],l[j]);
rep(j,1,n+1)ckmax(pos[j],pos[j-1]),dif[j]+=dif[j-1];
// cerr<<i<<",pos:";rep(j,1,n)cerr<<pos[j]<<' ';cerr<<'\n';
// cerr<<i<<",dif:";rep(j,1,n)cerr<<dif[j]<<' ';cerr<<'\n';
dp[0]=1;
int res=0,now=1,it=0;
rep(j,1,n+1){
if(dif[j]){dp[j]=0;continue;}
while(it<pos[j])fmod(now+=mod-dp[it]),++it;
dp[j]=now,fmod(res+=now),fmod(now+=dp[j]);
}
// cerr<<i<<", dp:";rep(j,1,n+1)cerr<<dp[j]<<' ';cerr<<'\n';
ans=1ll*ans*dp[n+1]%mod;
}
printf("%d\n",ans);
}```
P6046 纯粹容器.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=55;
const int mod=998244353;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
int n,a[N],fac[N],ifc[N],ans;
void init(){
fac[0]=1;
for(int i=1;i<N;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[N-1]=qpow(fac[N-1],mod-2);
for(int i=N-2;~i;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
}
int f(int i,int j){
if(i>j)return 0;
return 1ll*fac[j]*fac[n-i-1]%mod*ifc[j-i]%mod*ifc[n-1]%mod;
}
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
signed main(){
n=read(),init();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<=n;++i){
int l=i-1,r=i+1;
while(l>=1&&a[l]<a[i])--l;
while(r<=n&&a[r]<a[i])++r;
int A,B=0,C=0;
if(l<1&&r>n){printf("%d ",n-1);continue;}
for(int j=1;j<n;++j){
A=0;
if(r<=n)fmod(A+=f(r-i,j));
if(l>=1)fmod(A+=f(i-l,j));
if(l>=1&&r<=n)fmod(A-=f(r-l,j));
fmod(C+=1ll*(A-B)*(j-1)%mod),B=A;
}
printf("%d ",C);
}
return 0;
}```
P7361 拜神.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 50005;
const int Q = 100005;
vector <pair<int,int> > que[N], upd[N];
int n, q, ans[Q];
char str[N];
namespace mgt{
const int T = N * 40;
int tot, ls[T], rs[T], le[T], ri[T];
void pushup(int p){
if(ls[p]) le[p] = le[ls[p]];
else le[p] = le[rs[p]];
if(rs[p]) ri[p] = ri[rs[p]];
else ri[p] = ri[ls[p]];
}
void addupd(int p, int len) {
if (!ls[p] || !rs[p] || !len) return;
upd[le[rs[p]]].pb(mkp(ri[ls[p]], len));
}
void update(int &p, int pos, int l = 1, int r = n) {
if(!p) p = ++tot;
if(l == r) return le[p] = ri[p] = pos, void();
int mid = (l + r) >> 1;
if(pos <= mid) update(ls[p], pos, l, mid);
else update(rs[p], pos, mid + 1, r);
pushup(p);
}
int merge(int x, int y, int len, int l = 1, int r = n) {
if (!x || !y) return x | y;
int mid = (l + r) >> 1, p = ++tot;
if (l == r) return le[p] = ri[p] = l, p;
ls[p] = merge(ls[x], ls[y], len, l, mid);
rs[p] = merge(rs[x], rs[y], len, mid + 1, r);
return pushup(p), addupd(p, len), p;
}
void print(int p, int l = 1, int r = n) {
if (!p) return;
if (l == r) return cout << l << ' ', void();
int mid = (l + r) >> 1;
print(ls[p], l, mid), print(rs[p], mid + 1, r);
}
}
namespace SAM{
const int M = N << 1;
int tot = 1, trans[M][26], link[M], mxlen[M], rt[M];
int q[M], t[N];
inline int extend(int c, int lst, int id) {
int p = lst, np = ++tot; mxlen[np] = mxlen[p] + 1;
for(; p && !trans[p][c]; p = link[p]) trans[p][c] = np;
if(!p) link[np] = 1;
else {
int q = trans[p][c];
if (mxlen[q] == mxlen[p] + 1) link[np] = q;
else {
int nq = ++tot; mxlen[nq] = mxlen[p] + 1;
for(int i = 0; i < 26; ++i) trans[nq][i] = trans[q][i];
link[nq] = link[q], link[np] = link[q] = nq;
for(; p && trans[p][c] == q; p = link[p]) trans[p][c] = nq;
}
}
mgt::update(rt[np], id);
return np;
}
void work() {
for(int i = 1; i <= tot; ++i) ++t[mxlen[i]];
for(int i = 1; i <= n; ++i) t[i] += t[i - 1];
for(int i = 1; i <= tot; ++i) q[t[mxlen[i]]--] = i;
for(int i = tot; i >= 2; --i) {
int u = q[i], f = link[u];
rt[f] = mgt::merge(rt[f], rt[u], mxlen[f]);
}
// for(int i = 1; i <= tot; ++i) {
// cout << i << ":";
// mgt::print(rt[i]);
// puts("");
// }
}
}
namespace sgt {
const int T = N << 2;
int val[T];
#define lc (p << 1)
#define rc (p << 1 | 1)
void change(int pos, int d, int l = 1, int r = n, int p = 1) {
ckmax(val[p], d);
if (l == r) return;
int mid = (l + r) >> 1;
if(pos <= mid) change(pos, d, l, mid, lc);
else change(pos, d, mid + 1, r, rc);
}
int query(int ql, int qr, int l = 1, int r = n, int p = 1) {
if (ql <= l && r <= qr) return val[p];
int mid = (l + r) >> 1, res = 0;
if (ql <= mid) ckmax(res, query(ql, qr, l, mid, lc));
if (mid < qr) ckmax(res, query(ql, qr, mid + 1, r, rc));
return res;
}
}
signed main() {
scanf("%d%d%s", &n, &q, str + 1);
for(int i = 1; i <= q; ++i) {
int l = read(), r = read();
que[r].pb(mkp(l, i));
}
for(int i = 1, lst = 1; i <= n; ++i)
lst = SAM::extend(str[i] - 'a', lst, i);
SAM::work();
for(int i = 1; i <= n; ++i) {
for(pair <int,int> j : upd[i]) {
// cout << "upd:" << i << ' ' << j.fi << ' ' << j.se << endl;
sgt::change(j.fi, j.se);
}
for(pair <int,int> j : que[i]) {
int l = 1, r = i - j.fi, res = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (sgt::query(j.fi + mid - 1, i) >= mid) res = mid, l = mid + 1;
else r = mid - 1;
}
ans[j.se] = res;
}
}
for(int i = 1; i <= q; ++i) printf("%d\n", ans[i]);
return 0;
}```
P3676 小清新数据结构题.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,q,a[N],rt;
LL S,D,R1[N],R2[N],R3[N],sum[N];
int fa[N],top[N],son[N],dep[N],siz[N];
int hed[N],et;
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
namespace Tree{
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1,sum[u]=a[u];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v],sum[u]+=sum[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
D+=sum[u]*(S-sum[u]);
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v!=fa[u]&&v!=son[u])dfs2(v,v);
}
}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
int dis(int x,int y){return dep[x]+dep[y]-(dep[LCA(x,y)]<<1);}
}
using Tree::LCA;
using Tree::dis;
namespace DFZ{
int siz[N],mx[N],tsiz,vt[N];
bool used[N];
void getrt(int u,int ft){
siz[u]=1,mx[u]=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft||used[v])continue;
getrt(v,u),siz[u]+=siz[v];
ckmax(mx[u],siz[v]);
}
ckmax(mx[u],tsiz-siz[u]);
if(mx[u]<mx[rt])rt=u;
}
bool qwq[N];
void solve(int x){
static int cnt=0;
used[x]=1;
for(int i=x;i;i=vt[i]){
R1[i]+=a[x]*dis(i,x),R3[i]+=a[x];
if(vt[i])R2[i]+=a[x]*dis(vt[i],x);
}
for(int i=hed[x];i;i=e[i].nx){
int y=e[i].to;if(used[y])continue;
tsiz=siz[y],rt=0,getrt(y,x),vt[rt]=x,solve(rt);
}
}
LL calc(int x){
LL res=R1[x];
for(int i=x;vt[i];i=vt[i])
res+=R1[vt[i]]-R2[i]+(R3[vt[i]]-R3[i])*dis(vt[i],x);
return res;
}
void upd(int x,int y){
for(int i=x;i;i=vt[i]){
R1[i]+=y*dis(i,x),R3[i]+=y;
if(vt[i])R2[i]+=y*dis(vt[i],x);
}
}
void change(int x,int y){
D+=calc(x)*(y-a[x]),S+=y-a[x],upd(x,y-a[x]),a[x]=y;
}
LL query(int x){return S*(calc(x)+S)-D;}
void build(){mx[rt=0]=tsiz=n,getrt(1,0),solve(rt);}
}
signed main(){
n=read(),q=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
rep(i,1,n)a[i]=read(),S+=a[i];
Tree::dfs1(1,0),Tree::dfs2(1,1);
DFZ::build();
while(q--){
int op=read(),x=read();
if(op==1)DFZ::change(x,read());
else printf("%lld\n",DFZ::query(x));
}
return 0;
}```
CF1198B Welfare State.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
int n,q,a[N];
bool vis[N];
int opt[N],x[N],y[N];
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
q=rd();
for(int i=1;i<=q;++i) {
opt[i]=rd(),x[i]=rd();
if(opt[i]==1)y[i]=rd();
}
int val=0;
for(int i=q;i>=1;--i) {
if(opt[i]==1) {
if(vis[x[i]])continue;
a[x[i]]=max(y[i],val),vis[x[i]]=1;
} else val=max(val,x[i]);
}
for(int i=1;i<=n;++i)if(!vis[i])a[i]=max(a[i],val);
for(int i=1;i<=n;++i)printf("%d ",a[i]);
return 0;
}
```
P4126 [AHOI2009]最小割.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=4005;
const int M=60005*2;
const int inf=0x3f3f3f3f;
int n,m,U[M],V[M];
int dfn[N],tmr,low[N],scc[N],C,stk[N],top;
int dis[N],cur[N],mf,S,T,hed[N],et=1,control=0;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){assert(et<M-1),e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){
if(control){
if(fl==inf)cout<<u<<' '<<v<<' '<<"inf\n";
else cout<<u<<' '<<v<<' '<<fl<<'\n';
}
addedge(u,v,fl),addedge(v,u,0);
}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,n)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
if(!used)dis[u]=0;
return used;
}
void tarjan(int u){
dfn[u]=low[u]=++tmr,stk[++top]=u;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(!e[i].fl)continue;
if(!dfn[v])tarjan(v),ckmin(low[u],low[v]);
else if(!scc[v])ckmin(low[u],dfn[v]);
}
if(dfn[u]==low[u]){
scc[u]=++C;
while(stk[top]!=u)scc[stk[top--]]=C;
--top;
}
}
signed main(){
n=read(),m=read(),S=read(),T=read();
rep(i,1,m)U[i]=read(),V[i]=read(),adde(U[i],V[i],read());
while(bfs(S,T))dfs(S,inf);
rep(i,1,n)if(!dfn[i])tarjan(i);
rep(i,1,m)
if(!e[i<<1].fl)printf("%d %d\n",scc[U[i]]!=scc[V[i]],scc[U[i]]==scc[S]&&scc[V[i]]==scc[T]);
else puts("0 0");
return 0;
}
/*
6 7 1 6
1 2 3
1 3 2
2 4 4
2 5 1
3 5 5
4 6 2
5 6 3
*/```
最大团.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=51;
int n,mp[N][N],cans,cnum[N];
inline int read()
{
char ch=getchar();
while(ch!='1'&&ch!='0')ch=getchar();
return ch-'0';
}
bool dfs(int step,int *e,int nume){
if(step>cans){cans=step;return true;}
int e1[N],nume1=0;
for(int i=1;i<=nume;++i){
if(step+nume-i+1<=cans)break;
if(step+cnum[e[i]]<=cans)break;
nume1=0;
for(int j=i+1;j<=nume;++j)
if(mp[e[i]][e[j]])e1[++nume1]=e[j];
if(dfs(step+1,e1,nume1))return true;
}
return false;
}
inline void maxclique(){
int e[N],nume;
cnum[n]=1;cans=1;
for(int i=n-1;i>=1;--i){
nume=0;cnum[i]=1;
for(int j=i+1;j<=n;j++)
if(mp[i][j])e[++nume]=j;
dfs(1,e,nume);
cnum[i]=cans;
}
}//cans为最大团大小```
CF1168A Increasing by Modulo.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300005;
int n,m,a[N],ans;
int check(int k) {
int mx=m;
for(int i=n;i;--i) {
if(a[i]+k<m) {
if(a[i]>mx)return 0;
mx=min(mx,a[i]+k);
}else {
if(a[i]<=mx)continue;
else mx=min(mx,(a[i]+k)%m);
}
}
return 1;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd();
int l=0,r=m;
while(l<=r) {
int mid=(l+r)>>1;
if(check(mid))ans=mid,r=mid-1;
else l=mid+1;
}
printf("%d\n",ans);
return 0;
}
```
CF1080C Masha and two friends.cpp
```#include<bits/stdc++.h>
#define int long long
using std::cout;
using std::endl;
inline int rd(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))f=(ch=='-'?0:f),ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,m,ans;
int calc_w(int a,int b,int c,int d) {
if(a>c||b>d)return 0;
int n1=(c-a+1)/2+((c-a+1)&1?(a&1):0),n2=c-a+1-n1;
int n3=(d-b+1)/2+((d-b+1)&1?(b&1):0),n4=d-b+1-n3;
// cout<<n1<<' '<<n2<<' '<<n3<<' '<<n4<<endl;
return n1*n3+n2*n4;
}
int calc_s(int a,int b,int c,int d) {
if(a>c||b>d)return 0;
return (c-a+1)*(d-b+1);
}
int calc_b(int a,int b,int c,int d) {
if(a>c||b>d)return 0;
return calc_s(a,b,c,d)-calc_w(a,b,c,d);
}
void Main() {
n=rd(),m=rd();
ans=calc_w(1,1,n,m);//while
// printf("deb1:%lld\n",calc_w(1,1,n,m));
int a=rd(),b=rd(),c=rd(),d=rd();
int e=rd(),f=rd(),g=rd(),h=rd();
ans+=calc_b(a,b,c,d);
// printf("deb2:%lld\n",calc_b(a,b,c,d));
ans-=calc_w(e,f,g,h);
// printf("deb2:%lld\n",calc_w(e,f,g,h));
ans-=calc_b(std::max(a,e),std::max(b,f),std::min(c,g),std::min(d,h));
// printf("deb4:%lld\n",calc_b(std::max(a,e),std::max(b,f),std::min(c,g),std::min(d,h)));
printf("%lld %lld\n",ans,calc_s(1,1,n,m)-ans);
}
signed main() {
for(int T=rd();T;--T)Main();
}```
CF466C Number of Ways.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+10;
int sum[N],n,ans,tmp;
signed main() {
scanf("%lld",&n);
for(int i=1;i<=n;++i)
scanf("%lld",&sum[i]),sum[i]+=sum[i-1];
for(int i=1;i<=n;++i) {
if(i>1&&i<n&&sum[i]*3==sum[n]*2)ans+=tmp;
if(sum[i]*3==sum[n])++tmp;
}
printf("%lld\n",ans);
return 0;
}```
P2150 [NOI2015]寿司晚宴.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int pri[]={2,3,5,7,11,13,17,19};
int n,mod,ans;
int dp[260][260],f[260][260],g[260][260];
struct node {
int mask,xf;
node(){mask=xf=0;}
}a[510];
bool zhouAKngyang(const node &a,const node &b) {
return a.xf<b.xf;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n>>mod;
for(int i=2;i<=n;++i) {
int t=i;
for(int j=0;j<8;++j)
if(t%pri[j]==0) {
a[i].mask|=(1<<j);
while(t%pri[j]==0)t/=pri[j];
}
a[i].xf=t;
}
sort(a+2,a+n+1,zhouAKngyang);
dp[0][0]=1;
for(int t=2;t<=n;++t) {
if(a[t].xf==1||a[t].xf!=a[t-1].xf) {
for(int i=0;i<(1<<8);++i)
for(int j=0;j<(1<<8);++j)
f[i][j]=g[i][j]=dp[i][j];
}
for(int i=(1<<8)-1;~i;--i)
for(int j=(1<<8)-1;~j;--j) {
if(i&j)continue;
if((j&a[t].mask)==0)f[i|a[t].mask][j]=(f[i|a[t].mask][j]+f[i][j])%mod;
if((i&a[t].mask)==0)g[i][j|a[t].mask]=(g[i][j|a[t].mask]+g[i][j])%mod;
}
if(a[t].xf==1||a[t].xf!=a[t+1].xf) {
for(int i=0;i<(1<<8);++i)
for(int j=0;j<(1<<8);++j)
if((i&j)==0)dp[i][j]=(f[i][j]+g[i][j]-dp[i][j]+mod)%mod;
}
}
for(int i=0;i<(1<<8);++i)
for(int j=0;j<(1<<8);++j)
if((i&j)==0)ans=(ans+dp[i][j])%mod;
cout<<ans<<'\n';
return 0;
}```
P4284 [SHOI2014]概率充电器.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n;
db q[N],f[N],g[N],ans;
int et,hed[N];
struct edge{int nx,to;db vl;}e[N<<1];
void adde(int u,int v,db d){e[++et].nx=hed[u],e[et].to=v,e[et].vl=d,hed[u]=et;}
void dfs1(int u,int ft){
f[u]=1-q[u];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs1(v,u),f[u]*=f[v]*e[i].vl+1-e[i].vl;
}
}
void dfs2(int u,int ft){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
db tmp=f[v]*e[i].vl+1-e[i].vl,P=g[u]/tmp;
if(tmp>1e-8)g[v]=f[v]*(e[i].vl*P+1-e[i].vl);
dfs2(v,u);
}
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read(),z=read();db d=1.*z/100;
adde(x,y,d),adde(y,x,d);
}
rep(i,1,n)q[i]=1.*read()/100;
dfs1(1,0),g[1]=f[1],dfs2(1,0);
rep(i,1,n)ans+=1.-g[i];
printf("%.6lf\n",ans);
return 0;
}
/*
3
1 2 50
1 3 50
50 0 0
*/```
P5685 [JSOI2013]快乐的 JYY.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
const int M=N<<1;
int n,m;
LL ans;
int len[M],fail[M],tr[M][26],tot,cnt[2][M];
char S[N],T[N];
inline int gfail(char*str,int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
inline int extend(char*str,int i,int las){
int c=str[i]-'a',f=gfail(str,las,i);
if(!tr[f][c]){
fail[++tot]=tr[gfail(str,fail[f],i)][c];
tr[f][c]=tot,len[tot]=len[f]+2;
}
return tr[f][c];
}
signed main(){
scanf("%s%s",S,T),n=strlen(S),m=strlen(T);
len[0]=0,len[1]=-1,fail[0]=1,fail[1]=0,tot=1;
for(int i=0,las=0;i<n;++i)las=extend(S,i,las),++cnt[0][las];
for(int i=0,las=0;i<m;++i)las=extend(T,i,las),++cnt[1][las];
for(int i=tot;i>=0;--i)cnt[0][fail[i]]+=cnt[0][i],cnt[1][fail[i]]+=cnt[1][i];
for(int i=2;i<=tot;++i)ans+=1ll*cnt[0][i]*cnt[1][i];
cout<<ans<<'\n';
}```
P3377 【模板】左偏树（可并堆）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
const int inf=1<<29;
int n,m;
int val[N],fa[N],dst[N],ls[N],rs[N];
int merge(int x,int y) {
if(!x||!y)return x|y;
if(val[x]>val[y]||(val[x]==val[y]&&x>y))swap(x,y);
rs[x]=merge(rs[x],y),fa[rs[x]]=x;
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
dst[x]=dst[rs[x]]+1;
return x;
}
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
void del(int x) {
val[x]=inf;
fa[ls[x]]=ls[x],fa[rs[x]]=rs[x];
fa[x]=merge(ls[x],rs[x]);
dst[x]=ls[x]=rs[x]=0;
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)val[i]=rd(),fa[i]=i;
while(m--) {
int opt=rd(),x,y;
if(opt==1) {
x=rd(),y=rd();
int tx=find(x),ty=find(y);
if(tx==ty||val[x]==inf||val[y]==inf)continue;
merge(tx,ty);
} else {
x=rd();
if(val[x]==inf) {puts("-1");continue;}
int tx=find(x);
printf("%d\n",val[tx]);
del(tx);
}
}
return 0;
}
```
P2801 教主的魔法.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdopt(){
char ch=getchar();
while(ch!='A'&&ch!='M')ch=getchar();
return ch=='A';
}
const int N=1000005;
const int S=1000;
int n,q,a[N],b[N],tag[N];
int num,L[N/S+5],R[N/S+5],bel[N];
void rebuild(int id){
rep(i,L[id],R[id])b[i]=a[i]+tag[id];
tag[id]=0,sort(b+L[id],b+R[id]+1);
}
void build(){
num=(n-1)/S+1;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=n;
rep(i,1,num){
rebuild(i);
rep(j,L[i],R[i])bel[j]=i;
}
}
void update(int l,int r,int x){
if(bel[l]+1>=bel[r]){
rep(i,l,r)a[i]+=x;
rebuild(bel[l]),rebuild(bel[r]);
return;
}
rep(i,l,R[bel[l]])a[i]+=x;
rep(i,L[bel[r]],r)a[i]+=x;
rebuild(bel[l]),rebuild(bel[r]);
rep(i,bel[l]+1,bel[r]-1)tag[i]+=x;
}
int calc(int*a,int L,int R,int k){
int l=L,r=R,res=L-1;
while(l<=r){
int mid=(l+r)>>1;
if(a[mid]<=k)l=mid+1,res=mid;
else r=mid-1;
}
return res-L+1;
}
int query(int l,int r,int x){
int res=0;
if(bel[l]+1>=bel[r]){
rep(i,l,r)if(a[i]+tag[bel[i]]<=x)++res;
return res;
}
rep(i,l,R[bel[l]])if(a[i]+tag[bel[l]]<=x)++res;
rep(i,L[bel[r]],r)if(a[i]+tag[bel[r]]<=x)++res;
rep(i,bel[l]+1,bel[r]-1)res+=calc(b,L[i],R[i],x-tag[i]);
return res;
}
signed main(){
n=read(),q=read();
rep(i,1,n)a[i]=read();
build();
while(q--){
int opt=rdopt(),l=read(),r=read(),x=read();
if(opt)printf("%d\n",r-l+1-query(l,r,x-1));
else update(l,r,x);
}
return 0;
}```
P4251 [SCOI2015]小凸玩矩阵.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=510;
const int M=(N*N+N*2)*2;
const int inf=0x3f3f3f3f;
int n,m,k,a[N][N],b[N*N],tot;
int dis[N],et=1,hed[N],S,T,mf,cur[N];
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int used=0,rl;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(fl-used,e[i].fl));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
bool check(int o){
memset(hed,0,sizeof(hed)),et=1,mf=0;
rep(i,1,n)adde(S,i,1);
rep(j,1,m)adde(j+n,T,1);
rep(i,1,n)rep(j,1,m)if(a[i][j]<=o)adde(i,j+n,1);
while(bfs(S,T))mf+=dfs(S,inf);
return mf>=n-k+1;
}
signed main(){
n=read(),m=read(),k=read(),S=n+m+1,T=S+1;
rep(i,1,n)rep(j,1,m)a[i][j]=read(),b[++tot]=a[i][j];
sort(b+1,b+tot+1);
int l=1,r=tot,res=-1;
while(l<=r){
int mid=(l+r)>>1;
if(check(b[mid]))res=b[mid],r=mid-1;
else l=mid+1;
}
printf("%d\n",res);
return 0;
}```
手写随机数生成器.cpp
```struct Rand{
unsigned long long sa,sb,sc;
static const int basic=(1<<30)-1;
Rand(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
void init(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
inline int rand(){
sa^=sa<<32,sa^=sa>>13,sa^=sa<<1;
unsigned long long t=sa;
sa=sb,sb=sc,sc^=t^sa;
return static_cast<int>(sc&basic)+1;
}
int rad(int l,int r){return rand()%(r-l+1)+l;}
};```
CF1406E Deleting Numbers.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,x=1,a[N],now;
int pri[N/10],cnt,vis[N];
vector<int>f;
void Sieve(int n) {
for(int i=2; i<=n; ++i) {
if(!vis[i])pri[++cnt]=i;
for(int j=1; j<=cnt&&i*pri[j]<=n; ++j) {
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
}
signed main() {
scanf("%d",&n),now=n;
for(int i=1;i<=n;++i)a[i]=1;
Sieve(n);
int p=sqrt(n),it=1,t;
while(pri[it]<=p)++it;
for(int i=it,flg=0; i<=cnt; i+=100) {
for(int j=i,mx=min(i+99,cnt); j<=mx; ++j) {
printf("B %d\n",pri[j]);
fflush(stdout);
scanf("%d",&t);
for(int k=1; k*pri[j]<=n; ++k)if(a[k*pri[j]])a[k*pri[j]]=0,--now;
}
printf("A 1\n");
fflush(stdout);
scanf("%d",&t);
if(t!=now) {
for(int j=i,mx=min(i+99,cnt); j<=mx; ++j) {
printf("A %d\n",pri[j]);
fflush(stdout);
scanf("%d",&t);
if(t){x*=pri[j];flg=1;break;}
}
}
if(flg)break;
}
it=1;
while(it<=cnt&&pri[it]<=p) {
printf("B %d\n",pri[it]);
fflush(stdout);
scanf("%d",&t);
printf("A %d\n",pri[it]);
fflush(stdout);
scanf("%d",&t);
if(t)f.push_back(pri[it]);
++it;
}
for(int i:f) {
x*=i;
int r=i*i;
while(r<=n) {
printf("A %d\n",r);
fflush(stdout);
scanf("%d",&t);
if(t)x*=i;
else break;
r*=i;
}
}
printf("C %d\n",x);
fflush(stdout);
}
```
行列式求值.cpp
```const int N=605;
int n,mod,a[N][N];
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int Gauss(){
int res=1;
rep(i,1,n){
rep(j,i+1,n){
while(a[j][i]){
int div=a[i][i]/a[j][i];
rep(k,i,n)fmod(a[i][k]-=1ll*div*a[j][k]%mod),swap(a[i][k],a[j][k]);
res*=-1;
}
}
if(!a[i][i])return 0;
res=1ll*res*a[i][i]%mod;
}
return fmod(res),res;
}```
CF845G Shortest Path Problem.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,m;
int head[N],num_edge;
bool vis[N],istree[N<<1];
int d[30],dis[N],ans;
struct edge {
int to,nxt,val;
}e[N<<1];
void addedge(int from,int to,int val) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
head[from]=num_edge;
}
void build(int u) {
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(vis[v])continue;
istree[i]=1;
dis[v]=dis[u]^e[i].val,build(v);
}
}
void add(int x) {
for(int i=30;i>=0;--i)
if(x>>i&1) {
if(d[i])x^=d[i];
else {d[i]=x;break;}
}
}
void dfs(int u) {
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(istree[i])dfs(v);
else if(u<v)add(dis[u]^dis[v]^e[i].val);
}
}
void calc() {
ans=dis[n];
for(int i=30;i>=0;--i)
ans=min(ans,ans^d[i]);
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd(),z=rd();
if(x==y)add(z);
else addedge(x,y,z),addedge(y,x,z);
}
build(1),dfs(1),calc();
printf("%d\n",ans);
return 0;
}
```
P7391 「TOCO Round 1」自适应 PVZ.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
multiset<pair<int,int> ,greater<pair<int,int> > >s;
int n,m,tot,ans;
bool del[N];
struct node{
int op,x,r,id;
}a[N<<1];
inline bool cmp(const node&a,const node&b){
return a.x==b.x?a.op>b.op:a.x<b.x;
}
signed main(){
n=read(),m=read();
if(m>=n)return puts("0"),0;
rep(i,1,n)
a[++tot].op=1,a[tot].x=read(),
a[++tot].op=0,a[tot].x=a[tot-1].r=read(),
a[tot-1].id=a[tot].id=i;
sort(a+1,a+tot+1,cmp);
int now=0;
for(int i=1;i<=tot;++i){
int j=i;
while(j<tot&&a[j+1].x==a[i].x)++j;
rep(k,i,j){
if(del[a[k].id])continue;
if(a[k].op)s.insert(mkp(a[k].r,a[k].id)),++now;
else s.erase(s.find(mkp(a[k].x,a[k].id))),--now;
}
while(now>m){
--now,++ans;
pair<int,int>t=*s.begin();
s.erase(s.begin());
del[t.se]=1;
}
i=j;
}
cout<<ans<<'\n';
}```
CF213C Relay Race.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=305;
int dp[N<<1][N][N],n,a[N][N];
signed main(){
memset(dp,-0x3f,sizeof(dp));
dp[0][0][0]=0;
n=read();
rep(i,1,n)rep(j,1,n)a[i][j]=read();
rep(i,1,n*2-1)rep(j,1,n){
if(j>n||j>i||i-j+1>n)continue;
rep(k,1,n){
if(k>n||k>i||i-k+1>n)continue;
int tmp;
if(j!=k)tmp=a[j][i-j+1]+a[k][i-k+1];
else tmp=a[j][i-j+1];
ckmax(dp[i][j][k],dp[i-1][j][k]+tmp);
ckmax(dp[i][j][k],dp[i-1][j-1][k]+tmp);
ckmax(dp[i][j][k],dp[i-1][j][k-1]+tmp);
ckmax(dp[i][j][k],dp[i-1][j-1][k-1]+tmp);
}
}
printf("%d\n",dp[n*2-1][n][n]);
return 0;
}```
P3976 [TJOI2015]旅游.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
// #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50009;
const int inf=1000000007;
int n;
int mxv[N],miv[N],val[N],tag[N],lvl[N],rvl[N];
int fa[N],ch[N][2],fl[N],stk[N];
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x) {
#define lc ch[x][0]
#define rc ch[x][1]
miv[x]=min(val[x],min(miv[lc],miv[rc]));
mxv[x]=max(val[x],max(mxv[lc],mxv[rc]));
lvl[x]=max(max(lvl[lc],lvl[rc]),max(mxv[lc],val[x])-min(miv[rc],val[x]));
rvl[x]=max(max(rvl[lc],rvl[rc]),max(mxv[rc],val[x])-min(miv[lc],val[x]));
#undef lc
#undef rc
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
fa[w]=y,fa[y]=x,fa[x]=z;
pushup(y);
}
void addtag(int x,int d) {val[x]+=d,mxv[x]+=d,miv[x]+=d,tag[x]+=d;}
void rev(int x){swap(lvl[x],rvl[x]),swap(ch[x][0],ch[x][1]),fl[x]^=1;}
void pushdown(int x) {
if(fl[x]) {
if(ch[x][0])rev(ch[x][0]);
if(ch[x][1])rev(ch[x][1]);
fl[x]=0;
}
if(tag[x]) {
if(ch[x][0])addtag(ch[x][0],tag[x]);
if(ch[x][1])addtag(ch[x][1],tag[x]);
tag[x]=0;
}
}
void splay(int x) {
int y=x,z,top=0;stk[++top]=x;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)) {
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[y][1]==x)^(ch[z][1]==y)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){access(x),splay(x),rev(x);}
void split(int x,int y){makeroot(x),access(y),splay(y);}
void link(int x,int y){makeroot(x),fa[x]=y;}
void print(int x) {
if(!x)return;
pushdown(x);
print(ch[x][0]),print(ch[x][1]);
}
signed main() {
miv[0]=inf,mxv[0]=-inf;
n=rd();
for(int i=1;i<=n;++i)val[i]=miv[i]=mxv[i]=rd();
for(int i=1;i<n;++i)link(rd(),rd());
for(int q=rd();q;--q) {
int x=rd(),y=rd(),z=rd();
split(x,y),printf("%d\n",rvl[y]),addtag(y,z);
}
return 0;
}```
P4449 于神之怒加强版.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=5000010;
const int mod=1000000007;
int T,n,m,k,ans;
int pri[N/10],cnt,f[N],pw[N/10],vis[N];
int qpow(int n,int k){
int res=1;
while(k) {
if(k&1)res=res*n%mod;
n=n*n%mod,k>>=1;
}
return res;
}
void Sieve() {
f[1]=1;
for(int i=2;i<N;++i) {
if(!vis[i])pri[++cnt]=i,pw[cnt]=qpow(i,k),f[i]=pw[cnt]-1;
for(int j=1;j<=cnt&&i*pri[j]<N;++j) {
vis[i*pri[j]]=1;
if(i%pri[j]==0){f[i*pri[j]]=f[i]*pw[j]%mod;break;}
else f[i*pri[j]]=f[i]*f[pri[j]]%mod;
}
}
for(int i=1;i<N;++i)f[i]=(f[i]+f[i-1])%mod;
}
void solve() {
n=rd(),m=rd();
ans=0;
if(n>m)n^=m^=n^=m;
for(int l=1,r;l<=n;l=r+1) {
r=min(n/(n/l),m/(m/l));
ans=(ans+((n/l)*(m/l)%mod)*(f[r]-f[l-1]+mod)%mod)%mod;
}
printf("%lld\n",ans);
}
signed main() {
T=rd(),k=rd();
Sieve();
for(;T;--T)solve();
}```
P5501 [LnOI2019]来者不拒，去者不追.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
const int M=100005;
int n,m,a[N],S,V,num;
int bel[N],L[N],R[N];
int pr1[N],sf1[N],t1[M];
LL pr2[N],sf2[N],t2[M];
LL sp1[N],ss1[N],sp2[N],ss2[N];
LL res1[N<<1],res2[N<<1],ans[N];
int tl,tr;
struct QUE{
int id,l,r;
QUE(){l=r=id=0;}
inline bool operator < (const QUE&t)const{return bel[l]!=bel[t.l]?l<t.l:bel[l]&1?r<t.r:r>t.r;}
}q[N];
struct ASK{
int pos,id,l,r;
ASK(){pos=id=l=r=0;}
inline bool operator < (const ASK&t)const{return pos<t.pos;}
}ql[N],qr[N];
namespace BLO{
int num,S,L[N],R[N],bel[N];
int sum1[N],tag1[N];
LL sum2[N],tag2[N];
void init(){
S=sqrt(V-1)+1,num=(V-1)/S+1;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=V;
rep(i,1,num)rep(j,L[i],R[i])bel[j]=i;
}
void clear(){
memset(sum1,0,sizeof(sum1)),memset(tag1,0,sizeof(tag1));
memset(sum2,0,sizeof(sum2)),memset(tag2,0,sizeof(tag2));
}
void update1(int x,int d){
for(int i=num;i>bel[x];--i)tag1[i]+=d;
for(int i=R[bel[x]];i>=x;--i)sum1[i]+=d;
}
int query1(int x){return sum1[x]+tag1[bel[x]];}
void update2(int x,int d){
for(int i=1;i<bel[x];++i)tag2[i]+=d;
for(int i=L[bel[x]];i<=x;++i)sum2[i]+=d;
}
LL query2(int x){return sum2[x]+tag2[bel[x]];}
}
signed main(){
n=read(),m=read(),
S=sqrt(n-1)+1,num=(n-1)/S+1;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=n;
rep(i,1,num)rep(j,L[i],R[i])bel[j]=i;
rep(i,1,n)ckmax(V,a[i]=read());
rep(i,1,m)q[i].l=read(),q[i].r=read(),q[i].id=i;
sort(q+1,q+m+1);
for(int i=1;i<=n;++i){
int r1=0;LL r2=0;
for(int j=a[i]-1;j>0;j-=j&-j)r1+=t1[j];
for(int j=a[i]+1;j<=V;j+=j&-j)r2+=t2[j];
pr1[i]=r1,pr2[i]=r2,sp1[i]=sp1[i-1]+r1,sp2[i]=sp2[i-1]+r2;
for(int j=a[i];j<=V;j+=j&-j)++t1[j];
for(int j=a[i];j>0;j-=j&-j)t2[j]+=a[i];
}
memset(t1,0,sizeof(t1)),memset(t2,0,sizeof(t2));
for(int i=n;i>=1;--i){
int r1=0;LL r2=0;
for(int j=a[i]-1;j>0;j-=j&-j)r1+=t1[j];
for(int j=a[i]+1;j<=V;j+=j&-j)r2+=t2[j];
sf1[i]=r1,sf2[i]=r2,ss1[i]=ss1[i+1]+r1,ss2[i]=ss2[i+1]+r2;
for(int j=a[i];j<=V;j+=j&-j)++t1[j];
for(int j=a[i];j>0;j-=j&-j)t2[j]+=a[i];
}
rep(i,1,n)sp1[i]=sp1[i-1]+1ll*a[i]*(pr1[i]+1);
rep(i,1,n)sp2[i]=sp2[i-1]+pr2[i];
per(i,n,1)ss1[i]=ss1[i+1]+1ll*a[i]*(sf1[i]+1);
per(i,n,1)ss2[i]=ss2[i+1]+sf2[i];
// for(int i=1;i<=n;++i)cerr<<sp1[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<sp2[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<sf1[i]<<' ';cerr<<'\n';
// for(int i=1;i<=n;++i)cerr<<sf2[i]<<' ';cerr<<'\n';
for(int i=1,l=1,r=0;i<=m;++i){
// cerr<<q[i].id<<' '<<q[i].l<<' '<<q[i].r<<' '<<l<<' '<<r<<'\n';
if(l>q[i].l)ql[++tl].pos=r+1,ql[tl].l=q[i].l,ql[tl].r=l-1,ql[tl].id=q[i].id<<1,l=q[i].l;
if(r<q[i].r)qr[++tr].pos=l-1,qr[tr].l=r+1,qr[tr].r=q[i].r,qr[tr].id=q[i].id<<1|1,r=q[i].r;
if(l<q[i].l)ql[++tl].pos=r+1,ql[tl].l=l,ql[tl].r=q[i].l-1,ql[tl].id=q[i].id<<1,l=q[i].l;
if(r>q[i].r)qr[++tr].pos=l-1,qr[tr].l=q[i].r+1,qr[tr].r=r,qr[tr].id=q[i].id<<1|1,r=q[i].r;
}
sort(ql+1,ql+tl+1),sort(qr+1,qr+tr+1);
BLO::init();
for(int i=1,j=1;i<=n;++i){
while(j<=tr&&qr[j].pos<i)++j;
BLO::update1(a[i],1),BLO::update2(a[i],a[i]);
for(;j<=tr&&qr[j].pos==i;++j){
int st=qr[j].l,ed=qr[j].r,id=qr[j].id;
for(int k=st;k<=ed;++k)
res1[id]+=1ll*BLO::query1(a[k]-1)*a[k],res2[id]+=BLO::query2(a[k]+1);
// cerr<<"qr:"<<i<<' '<<qr[j].l<<' '<<qr[j].r<<' '<<res1[id]<<' '<<res2[id]<<'\n';
}
}
BLO::clear();
for(int i=n,j=tl;i>=1;--i){
while(j>=1&&ql[j].pos>i)--j;
BLO::update1(a[i],1),BLO::update2(a[i],a[i]);
for(;j>=1&&ql[j].pos==i;--j){
int st=ql[j].l,ed=ql[j].r,id=ql[j].id;
for(int k=st;k<=ed;++k)
res1[id]+=1ll*BLO::query1(a[k]-1)*a[k],res2[id]+=BLO::query2(a[k]+1);
// cerr<<"ql:"<<i<<' '<<ql[j].l<<' '<<ql[j].r<<' '<<res1[id]<<' '<<res2[id]<<'\n';
}
}
LL now=0;
for(int i=1,l=1,r=0;i<=m;++i){
int id=q[i].id;
if(l>q[i].l)now+=ss1[q[i].l]-ss1[l]-res1[id<<1]+ss2[q[i].l]-ss2[l]-res2[id<<1],l=q[i].l;
if(r<q[i].r)now+=sp1[q[i].r]-sp1[r]-res1[id<<1|1]+sp2[q[i].r]-sp2[r]-res2[id<<1|1],r=q[i].r;
if(l<q[i].l)now-=ss1[l]-ss1[q[i].l]-res1[id<<1]+ss2[l]-ss2[q[i].l]-res2[id<<1],l=q[i].l;
if(r>q[i].r)now-=sp1[r]-sp1[q[i].r]-res1[id<<1|1]+sp2[r]-sp2[q[i].r]-res2[id<<1|1],r=q[i].r;
ans[id]=now;
}
rep(i,1,m)printf("%lld\n",ans[i]);
return 0;
}```
P4239 任意模数多项式乘法逆(7次FFT).cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long double ld;
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=400010;
const int M=32768;
const int mod=1000000007;
const ld pi=acos(-1);
struct cp{
ld x,y;
cp(){}
cp(ld _x,ld _y){x=_x,y=_y;}
};
inline cp operator + (const cp &a,const cp &b){return cp(a.x+b.x,a.y+b.y);}
inline cp operator - (const cp &a,const cp &b){return cp(a.x-b.x,a.y-b.y);}
inline cp operator * (const cp &a,const cp &b){return cp(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
int n,lim,lg,rev[N],a[N],b[N],c[N],f[N],g[N];
cp A1[N],B1[N],A2[N],B2[N],A[N],B[N],C[N];
int qpow(int n,int k) {
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;
return res;
}
inline void FFT(cp *a,int lim,int o) {
for(rint i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(rint i=1;i<lim;i<<=1) {
cp wn=cp(cos(pi/i),o*sin(pi/i));
for(rint j=0;j<lim;j+=(i<<1)) {
cp w0=cp(1,0);
for(rint k=0;k<i;++k,w0=w0*wn) {
cp X=a[j+k],Y=w0*a[i+j+k];
a[j+k]=X+Y;
a[i+j+k]=X-Y;
}
}
}
}
inline void init(int n) {
for(lim=1,lg=0;lim<=n;++lg,lim<<=1);
for(rint i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
inline void MTT(int pw,int mod,int *f,int *g,int *ans) {
init(pw<<1);
for(rint i=0;i<pw;++i) {
A1[i].x=f[i]/M,A1[i].y=0;
B1[i].x=f[i]%M,B1[i].y=0;
A2[i].x=g[i]/M,A2[i].y=0;
B2[i].x=g[i]%M,B2[i].y=0;
}
for(rint i=pw;i<lim;++i)A1[i]=B1[i]=A2[i]=B2[i]=cp(0,0);
FFT(A1,lim,1),FFT(B1,lim,1),FFT(A2,lim,1),FFT(B2,lim,1);
for(rint i=0;i<lim;++i) {
A[i]=A1[i]*A2[i];
B[i]=A1[i]*B2[i]+A2[i]*B1[i];
C[i]=B1[i]*B2[i];
}
FFT(A,lim,-1),FFT(B,lim,-1),FFT(C,lim,-1);
for(rint i=0;i<pw;++i) {
ans[i]=(LL)round(A[i].x/lim)%mod;
ans[i]=(1ll*g[i]*M%mod+(LL)round(B[i].x/lim)%mod)%mod;
ans[i]=(1ll*g[i]*M%mod+(LL)round(C[i].x/lim)%mod)%mod;
}
for(rint i=pw;i<lim;++i)ans[i]=0;
}
void poly_inv(int *f,int *g,int pw) {
if(pw==1) {g[0]=qpow(f[0],mod-2);return;}
poly_inv(f,g,(pw+1)>>1);
for(rint i=0;i<n;++i)b[i]=g[i];
MTT(pw,mod,f,b,b);
MTT(pw,mod,g,b,b);
for(rint i=0;i<pw;++i)g[i]=(g[i]*2%mod-b[i]+mod)%mod;
}
signed main() {
n=rd();
for(rint i=0;i<n;++i)f[i]=rd()%mod;
poly_inv(f,g,n);
for(rint i=0;i<n;++i)printf("%d ",g[i]);
return 0;
}```
CF1111A Superhero Transformation.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1009;
char s[N],t[N];
int n,m,a[N],b[N];
signed main() {
scanf("%s%s",s,t),n=strlen(s),m=strlen(t);
if(n!=m)return puts("No"),0;
for(int i=0;i<n;++i)
a[i+1]=(s[i]=='a'||s[i]=='e'||s[i]=='o'||s[i]=='i'||s[i]=='u'),
b[i+1]=(t[i]=='a'||t[i]=='e'||t[i]=='o'||t[i]=='i'||t[i]=='u');
for(int i=1;i<=n;++i)if(a[i]!=b[i])return puts("No"),0;
puts("Yes");return 0;
}```
P1183 多边形的面积.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
int n,ans;
struct vec{
int x,y;
}p[N];
int crs(const vec&a,const vec&b){
return a.x*b.y-b.x*a.y;
}
signed main(){
n=read();
rep(i,1,n)p[i].x=read(),p[i].y=read();
rep(i,1,n)ans+=crs(p[i],p[i%n+1]);
printf("%d\n",ans>>1);
return 0;
}```
P4843 清理雪道.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=110;
const int M=2.5e4+10;
const int inf=1e8;
struct edge {
int to,nxt,val;
}e[M];
int num_edge=1,head[N];
int dep[N],cur[N],maxflow;
int n,s,t,ans;
int dta[N];
void addedge(int from,int to,int val) {
++num_edge,e[num_edge].nxt=head[from],e[num_edge].to=to,e[num_edge].val=val,head[from]=num_edge;
++num_edge,e[num_edge].nxt=head[to],e[num_edge].to=from,e[num_edge].val=0,head[to]=num_edge;
}
int bfs() {
for(rint i=1;i<=n+4;++i)dep[i]=0,cur[i]=head[i];
queue<int>q;dep[s]=1,q.push(s);
while(!q.empty()) {
int u=q.front();q.pop();
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dep[v]&&e[i].val)q.push(v),dep[v]=dep[u]+1;
}
}
return dep[t]>0;
}
int dfs(int u,int flow) {
if(u==t) {
maxflow+=flow;return flow;
}
int rlow,used=0;
for(rint i=cur[u];i;i=e[i].nxt) {
int v=e[i].to;cur[u]=i;
if(e[i].val&&dep[v]==dep[u]+1) {
rlow=dfs(v,min(flow-used,e[i].val));
if(rlow)e[i].val-=rlow,e[i^1].val+=rlow,used+=rlow;
if(used==flow)break;
}
}
return used;
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i) {
int m=rd();
while(m--) {
int x=rd();
addedge(i,x,inf);
--dta[i],++dta[x];
}
}
int S=n+1,T=n+2,SS=n+3,TT=n+4;
for(rint i=1;i<=n;++i)
if(dta[i]>0)addedge(SS,i,dta[i]);
else addedge(i,TT,-dta[i]);
for(rint i=1;i<=n;++i)
addedge(S,i,inf),addedge(i,T,inf);
s=SS,t=TT;
while(bfs())dfs(s,inf);
addedge(T,S,inf);
while(bfs())dfs(s,inf);
printf("%d\n",e[num_edge].val);
return 0;
}
```
CF1406A Subset Mex.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=105;
int n,a[N],b[N];
void Main() {
n=rd();
memset(b,0,sizeof(b));
for(int i=1;i<=n;++i)a[i]=rd(),++b[a[i]];
int f0=1,f1=1,ans=0;
for(int i=0;i<N;++i) {
if(b[i]==1) {
if(f1)ans+=i,f1=0;
} else if(!b[i]){
if(f0)ans+=i,f0=0;
if(f1)ans+=i,f1=0;
}
}
printf("%d\n",ans);
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
SPFA费用流.cpp
```const int N=405;
const int M=2*(N*2+N*N);
const int inf=0x3f3f3f3f;
const LL LLinf=0x3f3f3f3f3f3f3f3f;
int n,m,a[N],b[N],c[N][N],S,T,mf,tot;
struct node{int x,y,v;}d[N*N];
inline bool cmp(const node&a,const node&b){return a.v<b.v;}
LL mc,dis[N];
int hed[N],et=1,cur[N];
bool vis[N],inq[N];
struct edge{int nx,to,fl,w;}e[M];
void addedge(int u,int v,int fl,int w){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,e[et].w=w,hed[u]=et;}
void adde(int u,int v,int fl,int w){addedge(u,v,fl,w),addedge(v,u,0,-w);}
bool bfs(){
rep(i,1,T)dis[i]=LLinf,cur[i]=hed[i],inq[i]=0;
queue<int>q;q.push(S),dis[S]=0;
while(!q.empty()){
int u=q.front();q.pop(),inq[u]=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&ckmin(dis[v],dis[u]+e[i].w)){
if(!inq[v])q.push(v),inq[v]=1;
}
}
}
return dis[T]<LLinf;
}
int dfs(int u,int fl){
vis[u]=1;
if(u==T)return fl;
int used=0,rl=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if((!vis[v]||v==T)&&e[i].fl&&dis[v]==dis[u]+e[i].w){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,mc+=1ll*e[i].w*rl,used+=rl;
if(used==fl)break;
}
}
return used;
}
void mcmf(){
while(bfs()){
vis[T]=1;
while(vis[T])fill(vis,vis+T+1,0),mf+=dfs(S,inf);
}
}```
P1351 联合权值.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int mod=10007;
int n,w[N],ans1,ans2;
struct edge{
int nxt,to;
}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void dfs(int u,int ft){
vector<int>t;int cnt=0;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
++cnt,dfs(v,u),t.push_back(w[v]);
}
for(int i=0,mx=0;i<cnt;++i){
ans1=max(ans1,max(mx*t[i],w[ft]*t[i])),mx=max(mx,t[i]),ans2=(ans2+t[i]*w[ft])%mod;
if(i)ans2=(ans2+t[i-1]*t[i])%mod,t[i]=(t[i]+t[i-1])%mod;
}
}
signed main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
for(int i=1;i<=n;++i)w[i]=read();
dfs(1,0);
printf("%d %d\n",ans1,ans2*2%mod);
return 0;
}```
P7327 [w33z-2018] Dream and Discs.cpp
```//感谢ZAKY指导,验题变成补题可海星,验不动/kk
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 500005;
#define mod 1000000007
inline int qpow(int n, int k) {
int res = 1;
for (; k; k >>= 1, n = 1ll * n * n % mod)
if (k & 1) res = 1ll * n * res % mod;
return res;
}
const int iv6 = qpow(6, mod - 2);
int n, a[N], ALL, ans, pre[N], vis[N];
int f(int n){ return 1ll * iv6 * n % mod * (n + 1) % mod * (n + 2) % mod; }
int calc1(int x, int y) {
// int res = 0;
// rep(l, 1 + x, y) rep(r, y, n) {
// rep(i, l, y - 1) rep(j, i, y - 1) ++res;
// rep(i, y + 1, r) rep(j, i, r) ++res;
// }
// return res;
return (1ll * (n - y + 1) * f(y - x - 1) % mod + 1ll * (y - x) * f(n - y) % mod) % mod;
}
int calc2(int x, int y) {
// int res = 0;
// rep(l, 1 + x, y) rep(r, y, n) rep(i, l, y) rep(j, y, r) ++res;
// return res;
return 1ll * (1ll * (y - x) * (y - x + 1) / 2 % mod) * (1ll * (n - y + 1) * (n - y + 2) / 2 % mod) % mod;
}
int calc3(int x, int y) {
// int res = 0;
// rep(l, 1, x) rep(r, y, n) rep(i, x + 1, y) rep(j, y, r) ++res;
// return res;
return 1ll * x * (y - x) % mod * (1ll * (n - y + 1) * (n - y + 2) / 2 % mod) % mod;
}
signed main() {
n = read();
for (int i = 1; i <= n; ++i) a[i] =read();
for (int i = 1; i <= n; ++i) pre[i] = vis[a[i]], vis[a[i]] = i;
for (int i = 1; i <= n; ++i) ALL = (ALL + 1ll * (n - i + 1) * i * (i + 1) / 2 % mod) % mod;
for (int i = 1; i <= n; ++i) {
int A1 = calc1(pre[i], i), A2 = calc1(0, a[i]);//第一次包含,第二次不包含.
int B1 = calc2(pre[i], i), B2 = calc2(0, a[i]);//第一次包含,第二次也包含.
int C = calc3(pre[i], i);//两次都包含i,第二次不包含pre[i].
ans = (ans + 1ll * A1 * B2 % mod) % mod;
ans = (ans + 1ll * A2 * B1 % mod) % mod;
ans = (ans + 1ll * A1 * A2 % mod) % mod;
ans = (ans - 1ll * C * B2 % mod + mod) % mod;
}
ans = 1ll * ans * qpow(1ll * ALL * ALL % mod, mod - 2) % mod;
cout << ans << '\n';
}```
P5621 [DBOI2019]德丽莎世界第一可爱.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=50005;
int n,n_,len,lsh[N];
LL dp[N],ans,tr[N];
struct node{
int a,b,c,d,op,id;
LL s;
node(){a=b=c=d=0;}
inline bool operator == (const node&t)const{return a==t.a&&b==t.b&&c==t.c&&d==t.d;}
}a[N],b[N];
inline bool cmp1(const node&a,const node&b){return a.a!=b.a?a.a<b.a:a.b!=b.b?a.b<b.b:a.c!=b.c?a.c<b.c:a.d<b.d;}
inline bool cmp2(const node&a,const node&b){return a.b!=b.b?a.b<b.b:a.a!=b.a?a.a<b.a:a.c!=b.c?a.c<b.c:a.d<b.d;}
inline bool cmp3(const node&a,const node&b){return a.c<b.c;}
void upd(int x,LL d){for(int i=x;i<=len;i+=i&-i)ckmax(tr[i],d);}
LL ask(int x){LL res=0;for(int i=x;i>0;i-=i&-i)ckmax(res,tr[i]);return res;}
void clr(int x){for(int i=x;i<=len;i+=i&-i)tr[i]=0;}
void cdq2(int l,int r){
if(l==r)return;
int mid=(l+r)>>1,i,j;
cdq2(l,mid),sort(a+l,a+mid+1,cmp3),sort(a+mid+1,a+r+1,cmp3);
for(i=mid+1,j=l;i<=r;++i){
for(;a[j].c<=a[i].c&&j<=mid;++j)if(a[j].op)upd(a[j].d,dp[a[j].id]);
if(!a[i].op)ckmax(dp[a[i].id],ask(a[i].d)+a[i].s);
}
for(--j;j>=l;--j)clr(a[j].d);
sort(a+mid+1,a+r+1,cmp2);
cdq2(mid+1,r);
}
void cdq1(int l,int r){
if(l==r)return;
int mid=(l+r)>>1;
cdq1(l,mid);
for(int i=l;i<=r;++i)a[i].op=i<=mid;
sort(a+l,a+r+1,cmp2);
cdq2(l,r);
sort(a+l,a+r+1,cmp1);
cdq1(mid+1,r);
}
signed main(){
memset(dp,-0x3f,sizeof(dp));
n_=read();
rep(i,1,n_)b[i].a=read(),b[i].b=read(),b[i].c=read(),b[i].d=lsh[++len]=read(),b[i].s=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
rep(i,1,n_)b[i].d=lower_bound(lsh+1,lsh+len+1,b[i].d)-lsh;
sort(b+1,b+n_+1,cmp1);
for(int i=1,j=1;i<=n_;i=++j){
a[++n]=b[i],a[n].id=n;
while(j<n_&&b[j+1]==b[i])a[n].s+=b[++j].s;
dp[n]=a[n].s;
}
cdq1(1,n);
for(int i=1;i<=n;++i)ckmax(ans,dp[i]);
printf("%lld\n",ans);return 0;
}```
CF1190D Tokitsukaze and Strange Rectangle.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 200009
int n,ans,LX,LY,lshx[N],lshy[N],tr[N],cnt[N];
struct node {
int x,y;
}a[N];
inline bool cmp(const node&a,const node&b) {
return a.y!=b.y?a.y>b.y:a.x>b.x;
}
void add(int x,int d) {
for(int i=x;i<=n;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
int ask(int l,int r){
return ask(r)-ask(l-1);
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i].x=lshx[++LX]=rd(),a[i].y=lshy[++LY]=rd();
sort(lshx+1,lshx+LX+1),sort(lshy+1,lshy+LY+1);
LX=unique(lshx+1,lshx+LX+1)-lshx-1,LY=unique(lshy+1,lshy+LY+1)-lshy-1;
for(int i=1;i<=n;++i)
a[i].x=lower_bound(lshx+1,lshx+LX+1,a[i].x)-lshx,a[i].y=lower_bound(lshy+1,lshy+LY+1,a[i].y)-lshy;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i) {
if(!cnt[a[i].x])cnt[a[i].x]=1,add(a[i].x,1);
ans+=ask(a[i].y==a[i+1].y?a[i+1].x+1:1,a[i].x)*ask(a[i].x,n);
}
printf("%lld\n",ans);
return 0;
}```
P5341 [TJOI2019]甲苯先生和大中锋的字符串.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 3000005
#define S (N<<1)
int n,k,trans[S][26],tot,mxlen[S],link[S],cnt[S];
int q[S],t[N],dif[N];
char str[N];
int New(){return ++tot,memset(trans[tot],0,sizeof(trans[tot])),link[tot]=cnt[tot]=mxlen[tot]=0,tot;}
int extend(int c,int lst){
int p=lst,np=New();mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return ++cnt[np],np;
}
void Main(){
scanf("%s%d",str,&k),n=strlen(str);
tot=0,New();
for(int i=0,lst=1;i<n;++i)lst=extend(str[i]-'a',lst);
fill(t,t+n+1,0),fill(dif,dif+n+1,0);
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=n;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
for(int i=tot;i>=1;--i)cnt[link[q[i]]]+=cnt[q[i]];
for(int i=1;i<=tot;++i)if(cnt[i]==k)++dif[mxlen[link[i]]+1],--dif[mxlen[i]+1];
bool flg=0;
for(int i=1;i<=n;++i)dif[i]+=dif[i-1],flg|=dif[i]>0;
if(!flg)return puts("-1"),void();
int tim=0,res=0;
for(int i=1;i<=n;++i)
if(dif[i]>=tim)tim=dif[i],res=i;
printf("%d\n",res);
}
signed main(){for(int T=read();T;--T)Main();}
/*
6
aab 1
abc 1
aaaa 2
abab 2
ababacc 2
abab 4
*/```
P1350 车的放置.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
const int N=2005;
const int mod=1e5+3;
int a,b,c,d,k,dp[N][N];
signed main(){
a=read(),b=read(),c=read(),d=read(),k=read();
for(int i=1;i<=b+d;++i)dp[i][0]=1;
dp[0][0]=1;
for(int i=1;i<=b+d;++i){
int l=i<=b?a:a+c;
for(int j=1;j<=k;++j)dp[i][j]=(dp[i-1][j]+1ll*dp[i-1][j-1]*(l-j+1)%mod)%mod;
}
printf("%d\n",dp[d+b][k]);
return 0;
}```
CF1481D AB Graph.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int n,m;
char mp[N][N];
void Main(){
n=read(),m=read();
rep(i,1,n)scanf("%s",mp[i]+1);
if(m&1){
puts("YES");
rep(j,0,m)printf("%d ",j&1?1:2);
puts("");
return;
}
rep(i,1,n){
rep(j,1,n){
if(i==j)continue;
if(mp[i][j]==mp[j][i]){
puts("YES");
rep(k,0,m)printf("%d ",k&1?i:j);
puts("");
return;
}
}
}
rep(i,1,n){
int in[2],ou[2],x=0,y=0;
memset(in,0,sizeof(in)),memset(ou,0,sizeof(ou));
rep(j,1,n){
if(i==j)continue;
if(mp[i][j]=='a')ou[0]=j;
else ou[1]=j;
if(mp[j][i]=='a')in[0]=j;
else in[1]=j;
}
if(in[0]&&ou[0])x=in[0],y=ou[0];
else if(in[1]&&ou[1])x=in[1],y=ou[1];
if(!x||!y)continue;
puts("YES");
rep(j,1,m/2)
if(m/2%2!=j%2)printf("%d ",i);
else printf("%d ",in[0]);
printf("%d ",i);
rep(j,m/2+2,m+1)
if(m/2%2!=j%2)printf("%d ",i);
else printf("%d ",ou[0]);
puts("");
return;
}
puts("NO");
}
signed main(){for(int T=read();T;--T)Main();}```
CF754B Ilya and tic-tac-toe game.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int a[9][9];
char s[9];
int check(int x,int y) {
if(a[x-1][y]==1&&a[x+1][y]==1)return 1;
if(a[x+1][y]==1&&a[x+2][y]==1)return 1;
if(a[x-1][y]==1&&a[x-2][y]==1)return 1;
if(a[x][y-1]==1&&a[x][y+1]==1)return 1;
if(a[x][y-1]==1&&a[x][y-2]==1)return 1;
if(a[x][y+1]==1&&a[x][y+2]==1)return 1;
if(a[x-1][y-1]==1&&a[x+1][y+1]==1)return 1;
if(a[x-2][y-2]==1&&a[x-1][y-1]==1)return 1;
if(a[x+1][y+1]==1&&a[x+2][y+2]==1)return 1;
if(a[x+1][y-1]==1&&a[x+2][y-2]==1)return 1;
if(a[x-1][y+1]==1&&a[x+1][y-1]==1)return 1;
if(a[x-2][y+2]==1&&a[x-1][y+1]==1)return 1;
return 0;
}
signed main() {
for(int i=2;i<=5;++i) {
scanf("%s",s+2);
for(int j=2;j<=5;++j)
if(s[j]=='x')a[i][j]=1;
else if(s[j]=='.')a[i][j]=0;
else a[i][j]=-1;
}
for(int i=2;i<=5;++i)for(int j=2;j<=5;++j)if(!a[i][j]&&check(i,j))return puts("YES"),0;
puts("NO");return 0;
}```
树剖ddp.cpp
```const int N=100005;
const int M=N<<2;
const int inf=1e8;
int n,m,a[N];
int siz[N],dfn[N],tmr,son[N],fa[N],top[N],rev[N],ed[N],f[N][2];
struct edge{int nxt,to;}e[N<<1];
int hed[N],et;
void addedge(int fr,int to){++et,e[et].nxt=hed[fr],e[et].to=to,hed[fr]=et;}
struct Matrix{
int a[2][2];
Matrix(){a[0][0]=a[0][1]=a[1][0]=a[1][1]=-inf;}
int*operator[](const int&k){return a[k];}
Matrix operator * (const Matrix&b){
Matrix res;
res[0][0]=max(a[0][0]+b.a[0][0],a[0][1]+b.a[1][0]);
res[0][1]=max(a[0][0]+b.a[0][1],a[0][1]+b.a[1][1]);
res[1][0]=max(a[1][0]+b.a[0][0],a[1][1]+b.a[1][0]);
res[1][1]=max(a[1][0]+b.a[0][1],a[1][1]+b.a[1][1]);
return res;
}
}mat[N],val[M];
void dfs1(int u,int ft){
siz[u]=1,f[u][1]=a[u];
for(int i=hed[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
f[u][0]+=max(f[v][0],f[v][1]);
f[u][1]+=f[v][0];
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr,rev[tmr]=u;
if(son[u])dfs2(son[u],tp),ed[u]=ed[son[u]];
else ed[u]=u;
int g[2];g[0]=0,g[1]=a[u];
for(int i=hed[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==son[u]||v==fa[u])continue;
dfs2(v,v);
g[0]+=max(f[v][0],f[v][1]);
g[1]+=f[v][0];
}
mat[u][0][0]=g[0],mat[u][0][1]=g[0];
mat[u][1][0]=g[1],mat[u][1][1]=-inf;
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=val[lc]*val[rc];}
void build(int l,int r,int p){
if(l==r)return val[p]=mat[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
Matrix query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1;
if(qr<=mid)return query(ql,qr,l,mid,lc);
if(mid<ql)return query(ql,qr,mid+1,r,rc);
return query(ql,qr,l,mid,lc)*query(ql,qr,mid+1,r,rc);
}
void change(int pos,int l=1,int r=n,int p=1){
if(l==r)return val[p]=mat[rev[l]],void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,l,mid,lc);
else change(pos,mid+1,r,rc);
pushup(p);
}
void update(int x,int v){
mat[x][1][0]+=v-a[x],a[x]=v;
while(x){
Matrix lst=query(dfn[top[x]],dfn[ed[x]]);
change(dfn[x]);
Matrix now=query(dfn[top[x]],dfn[ed[x]]);
x=fa[top[x]];
mat[x][0][0]+=max(now[0][0],now[1][0])-max(lst[0][0],lst[1][0]);
mat[x][0][1]=mat[x][0][0];
mat[x][1][0]+=now[0][0]-lst[0][0];
}
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
dfs1(1,0),dfs2(1,1),build(1,n,1);
while(m--){
int x=read(),v=read();
update(x,v);
Matrix t=query(dfn[1],dfn[ed[1]]);
printf("%d\n",max(t[0][0],t[1][0]));
}
return 0;
}```
替罪羊树.cpp
```namespace goat{
LL val[N];
int ch[N][2],siz[N],tot,rt;
int stk[N],top;
const db alpha=0.83;
void clear(){tot=rt=0;}
int newnode(LL x){
val[++tot]=x,siz[tot]=1;
ch[tot][0]=ch[tot][1]=0;
return tot;
}
void pushup(int x){
siz[x]=siz[ch[x][0]]+siz[ch[x][1]]+1;
}
void dfs(int u){
if(!u)return;
dfs(ch[u][0]),stk[++top]=u,dfs(ch[u][1]);
ch[u][0]=ch[u][1]=0;
}
int build(int l,int r){
if(l>r)return 0;
if(l==r)return siz[stk[l]]=1,stk[l];
int mid=(l+r)>>1,u=stk[mid];
ch[u][0]=build(l,mid-1),ch[u][1]=build(mid+1,r);
return pushup(u),u;
}
void rebuild(int&x){
top=0,dfs(x),x=build(1,top);
}
void ins(int&x,int nd){
if(!x)return x=nd,void();
if(val[nd]<=val[x])ins(ch[x][0],nd);
else ins(ch[x][1],nd);
pushup(x);
if(siz[ch[x][0]]>siz[x]*alpha||siz[ch[x][1]]>siz[x]*alpha)rebuild(x);
}
void insert(LL x){ins(rt,newnode(x));}
LL findkth(int u,int k){
while("fyy yyds"){
if(siz[ch[u][1]]+1==k)return val[u];
if(k>siz[ch[u][1]]+1)k-=siz[ch[u][1]]+1,u=ch[u][0];
else u=ch[u][1];
}
}
LL kth(int x){return findkth(rt,x);}
int size(){return siz[rt];}
}```
P3527 [POI2011]MET-Meteors.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n,m,p[N],k,ans[N],L[N],R[N],D[N],o[N];
struct node{
int p,id;
}q[N],q1[N],q2[N];
LL tr[N];
void add(int x,int d){for(int i=x;i<=m;i+=i&-i)tr[i]+=d;}
void add(int l,int r,int d){add(l,d),add(r+1,-d);}
LL ask(int x){LL res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
vector<int>vc[N];
void solve(int x,int y,int l,int r){
if(l>r)return;
if(x==y){
rep(i,l,r)ans[q[i].id]=x;
return;
}
int mid=(x+y)>>1,ii=0,jj=0,kk=l;
rep(i,x,mid){
if(L[i]<=R[i])add(L[i],R[i],D[i]);
else add(1,R[i],D[i]),add(L[i],m,D[i]);
}
rep(i,l,r){
LL res=0;
for(int j:vc[q[i].id]){
res+=ask(j);
if(res>=q[i].p)break;
}
if(q[i].p<=res)q1[++ii]=q[i];
else q2[++jj]=q[i],q2[jj].p-=res;
}
rep(i,x,mid){
if(L[i]<=R[i])add(L[i],R[i],-D[i]);
else add(1,R[i],-D[i]),add(L[i],m,-D[i]);
}
rep(i,1,ii)q[kk++]=q1[i];
rep(i,1,jj)q[kk++]=q2[i];
solve(x,mid,l,l+ii-1),solve(mid+1,y,l+ii,r);
}
signed main(){
n=read(),m=read();
rep(i,1,m)o[i]=read(),vc[o[i]].pb(i);
rep(i,1,n)q[i].p=read(),q[i].id=i;
k=read();
rep(i,1,k)L[i]=read(),R[i]=read(),D[i]=read();
solve(1,k+1,1,n);
rep(i,1,n){
if(ans[i]==k+1)puts("NIE");
else printf("%d\n",ans[i]);
}
return 0;
}```
CF601B Lipshitz Sequence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define N 100010
int n,q,h[N],a[N],l,r,top,st[N],lp[N],rp[N];
long long ans;
int main() {
scanf("%d%d",&n,&q);
for(rint i=1;i<=n;++i)scanf("%d",&h[i]);
while(q--) {
scanf("%d%d",&l,&r),--r,ans=0;
int len=r-l+1;
for(rint i=1;i<=len;++i)
a[i]=abs(h[l+i-1]-h[l+i]);
for(rint i=1;i<=len;++i) {
while(top&&a[st[top]]<a[i])rp[st[top--]]=i-1;
lp[i]=st[top]+1;st[++top]=i;
}
while(top)rp[st[top--]]=len;
for(rint i=1;i<=len;++i)ans+=1ll*a[i]*(i-lp[i]+1)*(rp[i]-i+1);
printf("%lld\n",ans);
}
return 0;
}```
CF1282D Enchanted Artifact.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
string ans;
int n, na, nb;
signed main() {
int t;
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
for (int i = 1; i <= 300; ++ i) cout << 'a'; cout << endl;
cin >> t; if (! t) return 0; na = 300 - t;
for (int i = 1; i <= 300; ++ i) cout << 'b'; cout << endl;
cin >> t; if (! t) return 0; nb = 300 - t;
n = na + nb;
for (int i = 1; i < n; ++ i) {
cout << ans << 'a';
for (int j = 1; j <= nb; ++j) cout << 'b'; cout << endl;
cin >> t;
if (! t) return 0;
if (t != n - i - nb) ans += 'b', -- nb;
else ans += 'a', -- na;
}
if (na) ans += 'a';
if (nb) ans += 'b';
cout << ans << endl;
}
```
CF1370F2 The Hidden Pair (Hard Version).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1005;
char s[10];
int n,dis,rt,dep[N];
int head[N],num_edge;
vector<int>v[N],vec;
struct edge {
int nxt,to;
}e[N<<1];
inline void addedge(int fr,int to) {
++num_edge;
e[num_edge].to=to;
e[num_edge].nxt=head[fr];
head[fr]=num_edge;
}
void dfs1(int u,int ft) {
v[dep[u]].push_back(u);
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dep[v]=dep[u]+1,dfs1(v,u);
}
}
void dfs2(int u,int ft,int d) {
if(d==dis)return vec.push_back(u),void();
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs2(v,u,d+1);
}
}
void Main() {
scanf("%d",&n);
for(int i=1;i<=n;++i)v[i].clear();
memset(head,0,sizeof(head)),num_edge=0;
vec.clear();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
addedge(x,y),addedge(y,x);
}
printf("? %d",n);for(int i=1;i<=n;++i)printf(" %d",i);puts(""),fflush(stdout);
scanf("%d%d",&rt,&dis);
dep[rt]=0,dfs1(rt,0);
int l=(dis+1)>>1,r=dis,ra,rb,t;
while(l<=r) {
int mid=(l+r)>>1;
if(!v[mid].size()){r=mid-1;continue;}
printf("? %u",v[mid].size());for(int i:v[mid])printf(" %d",i);puts(""),fflush(stdout);
scanf("%d%d",&ra,&rb);
if(rb==dis)t=ra,l=mid+1;
else r=mid-1;
}
dfs2(t,0,0);
printf("? %u",vec.size());for(int i:vec)printf(" %d",i);puts(""),fflush(stdout);
scanf("%d%d",&ra,&rb);
printf("! %d %d\n",t,ra),fflush(stdout);
scanf("%s",s);
}
signed main(){
for(int T=rd();T;--T)Main();
}
```
P6832 [Cnoi2020]子弦.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=10000007;
char s[N];
int n, ans, cnt[30];
signed main() {
scanf("%s", s + 1), n = strlen(s + 1);
for (int i = 1; i <= n; ++ i) ans = max(ans, ++ cnt[s[i] - 'a']);
printf("%d\n",ans);
}
```
P6189 [NOI Online #1 入门组] 跑步.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,mod,ans,m;
int f[N],g[320][N];
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
signed main(){
n=read(),mod=read(),m=sqrt(n-1)+1;
f[0]=g[0][0]=1;
for(int i=1;i<m;++i)//每一个数都<m
for(int j=i;j<=n;++j)
fmod(f[j]+=f[j-i]);
for(int i=1;i<=m;++i){//i个数>=m
for(int j=i;j<=n;++j){
g[i][j]=g[i][j-i];
if(j>=m)fmod(g[i][j]+=g[i-1][j-m]);
}
}
for(int i=0;i<=m;++i){
for(int j=0;j<=n;++j)fmod(ans+=1ll*g[i][j]*f[n-j]%mod);
}
printf("%d\n",ans);
return 0;
}```
AC自动机.cpp
```const int M=2000005;
int fail[M],dp[M];
int n,tot,ch[M][26],ed[M];
void ins(char*s,int id) {
int u=0,len=strlen(s);
for(int i=0;i<len;++i) {
int c=s[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c];
}
ed[id]=u;
}
void make_fail() {
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]),fail[ch[0][i]]=0;
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])q.push(ch[u][i]),fail[ch[u][i]]=ch[fail[u]][i];
else ch[u][i]=ch[fail[u]][i];
}
}```
P3190 [HNOI2007]神奇游乐园.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n, m, a[107][7], inc[20], dp[2][1 << 12], ans = -1e9;
namespace Hash{
const int mod = 110017;
int val[2][11000], mxv[2][11000], nxt[11000], hed[mod];
int cnt[2], now = 0, lst = 1;
void insert(int msk, int v) {
int t = msk % mod;
for(int i = hed[t]; i; i = nxt[i]) {
if(val[now][i] == msk) {
ckmax(mxv[now][i], v);
return;
}
}
++cnt[now];
nxt[cnt[now]] = hed[t], hed[t] = cnt[now];
mxv[now][cnt[now]] = v, val[now][cnt[now]] = msk;
}
void clear() {
memset(hed, 0, sizeof(hed)), now ^= 1, lst ^= 1, cnt[now] = 0;
}
}
using namespace Hash;
void solve(){
insert(0, 0);
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= cnt[now]; ++j)
val[now][j] <<= 2;
for(int j = 1; j <= m; ++j) {
clear();
for(int k = 1; k <= cnt[lst]; ++k) {
int msk = val[lst][k], num = mxv[lst][k];
int b1 = (msk >> (j * 2 - 2)) % 4, b2 = (msk >> (j * 2)) % 4;
// cout << i << ' ' << j << ':' << msk << ' ' << num << ' ' << b1 <<' ' << b2 << '\n';
if(!b1 && !b2) {
insert(msk, num);
if(i < n && j < m)
insert(msk + inc[j - 1] + inc[j] * 2, a[i][j] + num);
} else if(!b1 && b2) {
if(i < n) insert(msk - inc[j] * b2 + inc[j - 1] * b2, a[i][j] + num);
if(j < m) insert(msk, a[i][j] + num);
} else if(b1 && !b2) {
if(j < m) insert(msk - inc[j - 1] * b1 + inc[j] * b1, a[i][j] + num);
if(i < n) insert(msk, a[i][j] + num);
} else if(b1 == 1 && b2 == 1) {
int ctr = 1;
for(int l = j + 1; l <= m; ++l) {
if((msk >> (l * 2)) % 4 == 1) ++ctr;
if((msk >> (l * 2)) % 4 == 2) --ctr;
if(!ctr) {
insert(msk - inc[j] - inc[j - 1] - inc[l], a[i][j] + num);
break;
}
}
} else if(b1 == 2 && b2 == 2) {
int ctr = 1;
for (int l = j - 2; l >= 0; --l) {
if((msk >> (l * 2)) % 4 == 1) --ctr;
if((msk >> (l * 2)) % 4 == 2) ++ctr;
if(!ctr) {
insert(msk - inc[j] * 2 - inc[j - 1] * 2 + inc[l], a[i][j] + num);
break;
}
}
} else if(b1 == 2 && b2 == 1) {
insert(msk - inc[j] - inc[j - 1] * 2, a[i][j] + num);
} else if(b1 == 1 && b2 == 2 && msk == inc[j - 1] + inc[j] * 2) {
ckmax(ans, num + a[i][j]);
}
}
}
}
}
signed main() {
n = read(), m = read();
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m; ++j)
a[i][j] = read();
inc[0] = 1;
for(int i = 1; i <= 10; ++i) inc[i] = inc[i - 1] << 2;
solve();
cout << ans << '\n';
}```
P3201 [HNOI2009] 梦幻布丁（链表）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=1000005;
int n,m,ans,a[N],siz[M],head[M],nxt[M],F[M],st[M];
void merge(int x,int y){
for(int i=head[x];i;i=nxt[i])ans-=(a[i-1]==y)+(a[i+1]==y);
for(int i=head[x];i;i=nxt[i])a[i]=y;
nxt[st[x]]=head[y],head[y]=head[x],siz[y]+=siz[x];
siz[x]=head[x]=st[x]=0;
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i){
++siz[a[i]=read()],F[a[i]]=a[i],ans+=a[i]!=a[i-1];
if(!head[a[i]])st[a[i]]=i;
nxt[i]=head[a[i]],head[a[i]]=i;
}
while(m--) {
int opt=read(),x,y;
if(opt==1){
x=read(),y=read();
if(x==y)continue;
if(siz[F[x]]>siz[F[y]])swap(F[x],F[y]);
if(!siz[F[x]])continue;
merge(F[x],F[y]);
}else printf("%d\n",ans);
}
}
```
线段树.cpp
```template<int N,class typ>
struct SegmentTree{
static const int O=N+5;
#define T (O<<2)
typ sum[T],mx[T],tag[T];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){sum[p]=sum[lc]+sum[rc],mx[p]=max(mx[lc],mx[rc]);}
void clear(int p=1,int l=1,int r=N){
sum[p]=mx[p]=tag[p]=0;
if(l==r)return;
int mid=(l+r)>>1;
clear(lc,l,mid),clear(rc,mid+1,r);
}
void build(typ*a,int p=1,int l=1,int r=N){
sum[p]=mx[p]=tag[p]=0;
if(l==r){
sum[p]=mx[p]=a[l];
return;
}
int mid=(l+r)>>1;
build(a,lc,l,mid),build(a,rc,mid+1,r);
pushup(p);
}
void pushdown(int p,int l,int r){
if(tag[p]){
int mid=(l+r)>>1;
tag[lc]+=tag[p],tag[rc]+=tag[p];
sum[lc]+=tag[p]*(mid-l+1),sum[rc]+=tag[p]*(r-mid);
mx[lc]+=tag[p],mx[rc]+=tag[p];
tag[p]=0;
}
}
void update(int ql,int qr,typ k,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr){
sum[p]+=k*(r-l+1),mx[p]+=k,tag[p]+=k;
return;
}
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,k,lc,l,mid);
if(mid<qr)update(ql,qr,k,rc,mid+1,r);
pushup(p);
}
typ query_sum(int ql,int qr,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr)return sum[p];
pushdown(p,l,r);
int mid=(l+r)>>1;
if(qr<=mid)return query_sum(ql,qr,lc,l,mid);
if(mid<ql)return query_sum(ql,qr,rc,mid+1,r);
return query_sum(ql,qr,lc,l,mid)+query_sum(ql,qr,rc,mid+1,r);
}
typ query_max(int ql,int qr,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr)return mx[p];
pushdown(p,l,r);
int mid=(l+r)>>1;
if(qr<=mid)return query_max(ql,qr,lc,l,mid);
if(mid<ql)return query_max(ql,qr,rc,mid+1,r);
return max(query_max(ql,qr,lc,l,mid),query_max(ql,qr,rc,mid+1,r));
}
#undef lc
#undef rc
#undef T
};```
CF280C Game on Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
vector<int>g[N];
int n,dep[N];
double ans;
void dfs(int u,int ft){
dep[u]=dep[ft]+1;
for(int v:g[u]){
if(v==ft)continue;
dfs(v,u);
}
}
signed main(){
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
g[x].pb(y),g[y].pb(x);
}
dfs(1,0);
for(int i=1;i<=n;++i)ans+=1./dep[i];
printf("%.10lf\n",ans);
return 0;
}```
P2472 [SCOI2007]蜥蜴.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
template<class T>inline bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>inline bool ckmin(T&x,T y){return x>y?x=y,1:0;}
template<int NN,int MM>
struct Dinic{
static const int N=NN+5;
static const int M=(MM<<1)+5;
static const int inf=1<<30;
int hed[N],et,S,T;
struct edge{int fl,nx,to;}e[M];
int dis[N],cur[N];
Dinic(){et=1,memset(hed,0,sizeof(hed));}
void clear(){Dinic();}
void addedge(int u,int v,int fl){e[++et].nx=hed[u],hed[u]=et,e[et].fl=fl,e[et].to=v;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
for(int i=1;i<=N;++i)dis[i]=0,cur[i]=hed[i];
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
LL dfs(int u,int fl){
if(u==T)return fl;
int rl=0,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
}
}
return used;
}
LL maxflow(){
LL res=0;
while(bfs(S,T))res+=dfs(S,inf);
return res;
}
};
const int N=22;
const int inf=0x3f3f3f3f;
Dinic<800,400*70>mf;
int r,c,d,h[N][N],cnt;
int id(int x,int y){return (x-1)*c+y;}
signed main(){
r=read(),c=read(),d=read();
mf.S=r*c*2+1,mf.T=mf.S+1;
for(int i=1;i<=r;++i){
for(int j=1;j<=c;++j){
char ch=getchar();
while(!isdigit(ch))ch=getchar();
h[i][j]=ch-'0';
}
}
for(int i=1;i<=r;++i)
for(int j=1;j<=c;++j)
if(h[i][j]){
mf.adde(id(i,j),id(i,j)+r*c,h[i][j]);
for(int k=max(1,i-d);k<=min(r,i+d);++k)
for(int l=max(1,j-d);l<=min(c,j+d);++l){
if(i==k&&j==l)continue;
if(h[k][l]&&(k-i)*(k-i)+(l-j)*(l-j)<=d*d)mf.adde(id(i,j)+r*c,id(k,l),inf);
}
if(i<=d||j<=d||r-i<d||c-j<d)mf.adde(id(i,j)+r*c,mf.T,inf);
}
for(int i=1;i<=r;++i)
for(int j=1;j<=c;++j){
char ch=getchar();
while(ch!='L'&&ch!='.')ch=getchar();
if(ch=='L')mf.adde(mf.S,id(i,j),1),++cnt;
}
printf("%lld\n",cnt-mf.maxflow());
return 0;
}
/*
5 8 2
00000000
02000000
00321100
02000000
00000000
........
........
..LLLL..
........
........
*/```
扩展BSGS.cpp
```#define int long long
int a,p,b,ans;
int BSGS(int k,int a,int p,int b) {
map<int,int>mp;
int m=ceil(sqrt(p)),t=1;
for(int i=1;i<=m;++i)t=t*a%p,mp[t*b%p]=i;
for(int i=1;i<=m;++i) {
k=k*t%p;
if(mp.find(k)!=mp.end()) {
return ((i*m-mp[k])%p+p)%p;
}
}
return -1;
}
int gcd(int x,int y) {return !y?x:gcd(y,x%y);}
int exBSGS(int a,int p,int b) {
a%=p,b%=p;
if(b==1||p==1)return 0;
int cnt=0,d,k=1,res;
while((d=gcd(a,p))!=1) {
if(b%d)return -1;
++cnt,b/=d,p/=d;
k=a/d*k%p;
if(k==b)return cnt;
}
res=BSGS(k,a,p,b);
if(~res)return res+cnt;
else return -1;
}```
P3674 小清新人渣的本愿.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,m,a[N],size;
int bel[N],ans[N],cnt[N];
struct QUE {
int opt,l,r,x,id;
}q[N];
inline bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?a.l<b.l:bel[a.l]&1?a.r<b.r:a.r>b.r;
}
bitset<N>A,B,C;
void add(int x) {
++cnt[a[x]];
if(cnt[a[x]])A[a[x]]=1,B[N-a[x]]=1;
else A[a[x]]=0,B[N-a[x]]=0;
}
void pop(int x) {
--cnt[a[x]];
if(cnt[a[x]])A[a[x]]=1,B[N-a[x]]=1;
else A[a[x]]=0,B[N-a[x]]=0;
}
int Q1(int x) {
C=A,C<<=x,C&=A;
return C.any();
}
int Q2(int x) {
C=B,C>>=(N-x),C&=A;
return C.any();
}
int Q3(int x) {
for(int i=1;i*i<=x;++i) {
if(x%i)continue;
if(A[i]&&A[x/i])return 1;
}
return 0;
}
signed main() {
n=rd(),m=rd(),size=sqrt(n);
for(int i=1;i<=n;++i)a[i]=rd(),bel[i]=(i-1)/size+1;
for(int i=1;i<=m;++i)q[i].opt=rd(),q[i].l=rd(),q[i].r=rd(),q[i].x=rd(),q[i].id=i;
sort(q+1,q+m+1,cmp);
int l=1,r=0;
for(int i=1;i<=m;++i) {
while(l<q[i].l)pop(l++);
while(l>q[i].l)add(--l);
while(r<q[i].r)add(++r);
while(r>q[i].r)pop(r--);
if(q[i].opt==1)ans[q[i].id]=Q1(q[i].x);
else if(q[i].opt==2)ans[q[i].id]=Q2(q[i].x);
else if(q[i].opt==3)ans[q[i].id]=Q3(q[i].x);
}
for(int i=1;i<=m;++i)puts(ans[i]?"hana":"bi");
return 0;
}```
P5445 [APIO2019]路灯（cdq分治）.cpp
```/*
|------- |------
| | |
| | |
| | | * |
|------ |----| --- ----- \ / ----- --- |-----| | | --- ----- | | --|--
| | | |/ \ | | \ / | | |/ \ | | | |/ \ | | | | |
| | | | ----- \ / ----- | | | | | |---- | | | |
| | | | | \ / | | | | | | | | | | |
| |----| | ----/ - ---/ | _____ | |----| | ----| |----| | --/
\ / \ / |----\ ------
\ / \ / | \ |
\ / \ / | \ |
\-/ \-/ | | ------
| | | | |
| | | / |
| | | / |
| | |----/ ------
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdopt(){
static char opt[10];
scanf("%s",opt);
return opt[0]=='t';
}
const int N=300005;
const int T=N*19*19;
int n,q,c[N],o,tr[N],ans[N];
char str[N];
set<pair<int,int> >s;
struct node{
int s,x,y,id;
node(){s=x=y=id=0;}
}a[N<<2],b[N<<2];
inline bool cmp1(const node&a,const node&b){return a.x!=b.x?a.x<b.x:a.y!=b.y?a.y<b.y:a.id<b.id;}
void upd(int a1,int b1,int a2,int b2,int d){
++o,a[o].s=d,a[o].x=a1,a[o].y=b1,a[o].id=0;
++o,a[o].s=-d,a[o].x=a1,a[o].y=b2+1,a[o].id=0;
++o,a[o].s=-d,a[o].x=a2+1,a[o].y=b1,a[o].id=0;
++o,a[o].s=d,a[o].x=a2+1,a[o].y=b2+1,a[o].id=0;
}
void add(int x,int d){for(int i=x;i<=n;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
void cdq(int l,int r){
if(l==r)return;
int mid=(l+r)>>1,i,j;
cdq(l,mid),cdq(mid+1,r);
// cerr<<"cdq:"<<l<<' '<<r<<'\n';
// rep(i,l,r)cerr<<a[i].x<<' '<<a[i].y<<' '<<a[i].s<<' '<<a[i].id<<'\n';
for(i=mid+1,j=l;i<=r;++i){
for(;j<=mid&&a[j].x<=a[i].x;++j)if(!a[j].id)add(a[j].y,a[j].s);
if(a[i].id)a[i].s+=ask(a[i].y);
}
for(--j;j>=l;--j)if(!a[j].id)add(a[j].y,-a[j].s);
merge(a+l,a+mid+1,a+mid+1,a+r+1,b+l,cmp1);
for(int i=l;i<=r;++i)a[i]=b[i];
}
signed main(){
scanf("%d%d%s",&n,&q,str+1);
rep(i,1,n)c[i]=str[i]-'0';
for(int i=1,j;i<=n;++i){
if(!c[i])continue;
j=i;
while(j<n&&c[j+1])++j;
s.insert(mkp(i,j));
i=j;
}
for(set<pair<int,int> >::iterator it=s.begin();it!=s.end();++it)
upd(it->fi,it->fi,it->se,it->se,q);
s.insert(mkp(N,N));
rep(t,1,q){
int opt=rdopt(),x=read(),y,a1,a2,b1,b2;
if(opt){
if(!c[x]){
set<pair<int,int> >::iterator ir=s.upper_bound(mkp(x,N)),il=ir;--il;
if(ir==s.begin()||il->se!=x-1)a1=a2=x;
else a1=il->fi,a2=x,s.erase(il);
if(ir==s.end()||ir->fi!=x+1)b1=b2=x;
else b1=x,b2=ir->se,s.erase(ir);
s.insert(mkp(a1,b2));
upd(a1,b1,a2,b2,q-t);
}
else{
set<pair<int,int> >::iterator it=s.upper_bound(mkp(x,N));--it;
a1=it->fi,a2=x,b1=x,b2=it->se,s.erase(it);
if(a1<x)s.insert(mkp(a1,x-1));
if(b2>x)s.insert(mkp(x+1,b2));
upd(a1,b1,a2,b2,t-q);
}
c[x]^=1;
}else{
y=read()-1;
set<pair<int,int> >::iterator i1=s.upper_bound(mkp(x,N)),i2=s.upper_bound(mkp(y,N));
if(c[x]&&c[y]&&i1==i2)a1=q-t;else a1=0;
++o,a[o].x=x,a[o].y=y,a[o].s=-a1,a[o].id=t;
}
}
cdq(1,o);
memset(ans,-1,sizeof(ans));
rep(i,1,o)if(a[i].id)ans[a[i].id]=a[i].s;
for(int i=1;i<=q;++i)if(~ans[i])printf("%d\n",ans[i]);
return 0;
}```
P5397 [Ynoi2018]天降之物.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
const int M=320;
const int inf=0x3f3f3f3f;
int n,m,a[N],lastans;
int lim,siz[N],ans[M][N],id[N],F[N];
int rub[N],top,tot;
vector<int>v[N];
int New() {return top?rub[top--]:++tot;}
void build(int x,int Id=0) {
id[x]=Id?Id:New();
int t=id[x];
memset(ans[t],0x3f,sizeof(ans[t]));
for(int i=1,j=inf;i<=n;++i)
if(a[i]==x)j=0;
else ans[t][a[i]]=min(ans[t][a[i]],++j);
for(int i=n,j=inf;i;--i)
if(a[i]==x)j=0;
else ans[t][a[i]]=min(ans[t][a[i]],++j);
vector<int>fyyAKIOI;
ans[t][x]=0,v[x].swap(fyyAKIOI);
}
void merge(int x,int y) {
int i=0,j=0,sx=v[x].size(),sy=v[y].size();
vector<int>res;
while(i<sx&&j<sy)res.push_back(v[x][i]<v[y][j]?v[x][i++]:v[y][j++]);
while(i<sx)res.push_back(v[x][i++]);
while(j<sy)res.push_back(v[y][j++]);
v[y]=res;
}
int merge_(int x,int y) {
int i=0,j=0,sx=v[x].size(),sy=v[y].size(),res=inf;
if(!sx||!sy)return inf;
while(i<sx&&j<sy)res=min(v[x][i]<v[y][j]?v[y][j]-v[x][i++]:v[x][i]-v[y][j++],res);
if(i<sx)res=min(res,abs(v[x][i]-v[y][sy-1]));
if(j<sy)res=min(res,abs(v[x][sx-1]-v[y][j]));
return res;
}
int query(int x,int y) {
x=F[x],y=F[y];
if(!siz[x]||!siz[y])return -1;
if(x==y)return 0;
if(siz[x]>siz[y])x^=y^=x^=y;
if(siz[y]<=lim)return merge_(x,y);
else if(siz[x]<=lim)return min(ans[id[y]][x],merge_(x,y));
else return min(merge_(x,y),min(ans[id[x]][y],ans[id[y]][x]));
}
void change(int x,int y) {
int x_=F[x],y_=F[y];
if(!siz[x_]||x_==y_)return;
if(siz[x_]>siz[y_])F[y]=x_,F[x]=n+1,x_^=y_^=x_^=y_;
else F[x]=n+1;
if(x_>n||y_>n)return;
x=x_,y=y_;
if(siz[y]<=lim) {
if(siz[x]+siz[y]<=lim) {
for(int i:v[x])a[i]=y;
for(int i=1;i<=tot;++i)ans[i][y]=min(ans[i][y],ans[i][x]);
merge(x,y);
} else {
for(int i=1;i<=n;++i)if(a[i]==x)a[i]=y;
build(y);
}
} else if(siz[x]<=lim) {
if(siz[x]+v[y].size()<=lim) {
for(int i:v[x])a[i]=y;
for(int i=1;i<=tot;++i)ans[i][y]=min(ans[i][y],ans[i][x]);
merge(x,y);
} else {
for(int i=1;i<=n;++i)if(a[i]==x)a[i]=y;
build(y,id[y]);
}
} else {
for(int i=1;i<=n;++i)if(a[i]==x)a[i]=y;
rub[++top]=id[x],build(y,id[y]);
}
vector<int>fyyAKIOI;
siz[y]+=siz[x],siz[x]=0,v[x].swap(fyyAKIOI);
}
signed main() {
n=rd(),m=rd(),lim=sqrt(n);
for(int i=1;i<=n;++i)++siz[a[i]=rd()],v[a[i]].push_back(i),F[i]=i;
for(int i=0;i<=n;++i)if(siz[i]>lim)build(i);
while(m--) {
int opt=rd(),x=rd()^lastans,y=rd()^lastans;
if(opt==1)change(x,y);
else {
lastans=query(x,y);
if(~lastans)printf("%d\n",lastans);
else lastans=0,puts("Ikaros");
}
}
return 0;
}
```
P6630 [ZJOI2020] 传统艺能.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
inline int add(int x, int y) {return (x += y) >= mod ? x - mod : x;}
inline int sub(int x, int y) {return (x += mod - y) >= mod ? x - mod : x;}
inline int mul(int x, int y) {return 1ll * x * y % mod;}
inline int qpow(int n, int k) {
int res = 1;
for(; k; k >>= 1, n = 1ll * n * n % mod)
if(k & 1) res = 1ll * n * res % mod;
return res;
}
const int N = 400005;
int n, k, pw[N], ans, iv, s[N];
int L[N], R[N], fa[N], tot;
struct Matrix {
int a[3][3];
Matrix() { memset(a, 0, sizeof(a)); }
inline void e(){ rep(i, 0, 2) rep(j, 0, 2) a[i][j]= i == j ; }
inline int* operator [] (const int&k) { return a[k]; }
inline Matrix operator * (const Matrix&t) const {
Matrix res;
rep(i, 0, 2) rep(j, 0, 2) rep(k, 0, 2) res.a[i][j] = add(res.a[i][j], mul(a[i][k], t.a[k][j]));
return res;
}
inline Matrix operator ^ (int k) const {
Matrix res, t=*this; res.e();
for(; k; k >>= 1, t = t * t)
if(k & 1) res = res * t;
return res;
}
};
int calc(int p) {
int p1, p2, p3, p4, p5;
if(p == 1) {
p1 = sub(1, iv), p2 = iv;
p3 = p4 = p5 = 0;
} else {
p1 = mul(sub(s[n], add(s[L[p] - 1], add(s[n - R[p]], mul(L[p], n - R[p] + 1)))), iv);
p2 = mul(sub(mul(L[p], n - R[p] + 1), mul(L[fa[p]], n - R[fa[p]] + 1)), iv);
p3 = mul(add(sub(s[L[p] - 1], s[L[fa[p]] - 1]), sub(s[n - R[p]], s[n - R[fa[p]]])), iv);
p4 = mul(mul(L[fa[p]], n - R[fa[p]] + 1), iv);
p5 = mul(add(s[L[fa[p]] - 1], s[n - R[fa[p]]]), iv);
}
assert(add(p1, add(p2, add(p3, add(p4, p5)))) == 1);
Matrix A, B;
A[0][0] = 0, A[0][1] = 1, A[0][2] = 1;
B[0][0] = add(p4, p5);
B[1][0] = sub(0, p3), B[1][1] = add(p3, p5);
B[2][0] = add(p2, p3), B[2][1] = p1, B[2][2] = 1;
A = A * (B ^ k);
return A[0][0];
}
void dfs(int p) {
ans = add(ans, calc(p));
if(L[p] == R[p]) return;
int mid = read();
++tot, fa[tot] = p, L[tot] = L[p], R[tot] = mid, dfs(tot);
++tot, fa[tot] = p, L[tot] = mid + 1, R[tot] = R[p], dfs(tot);
}
signed main(){
n = read(), k = read(), iv = qpow(1ll * n * (n + 1) / 2 % mod, mod - 2);
for(int i = 1; i <= n; ++i) s[i] = 1ll * i * (i + 1) / 2 % mod;
++tot, fa[tot] = 0, L[tot] = 1, R[tot] = n, dfs(1);
cout << ans << '\n';
return 0;
}```
P5643 [PKUWC2018]随机游走(FWT).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=19;
const int mod=998244353;
int n,q,st,dp[1<<N],A[N],B[N],deg[N],cnt[1<<N];
int head[N],num_edge;
struct edge{
int to,nxt;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
void fmod(int&x){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
void dfs(int u,int ft,int msk) {
if(msk>>(u-1)&1)return;
int sumA=0,sumB=0;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
dfs(v,u,msk),fmod(sumA+=A[v]),fmod(sumB+=B[v]);
}
int inv=qpow(deg[u]-sumA+mod,mod-2);
A[u]=inv,B[u]=1ll*inv*(sumB+deg[u])%mod;
}
signed main(){
n=read(),q=read(),st=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x),++deg[x],++deg[y];
}
for(int msk=0;msk<1<<n;++msk){
fill(A,A+n+1,0),fill(B,B+n+1,0),cnt[msk]=cnt[msk>>1]+(msk&1);
dfs(st,0,msk),dp[msk]=(cnt[msk]&1?1:-1)*B[st];
}
for(int o=2,k=1;k<1<<n;o<<=1,k<<=1)
for(int i=0;i<1<<n;i+=o)
for(int j=0;j<k;++j)
fmod(dp[i+j+k]+=dp[i+j]);
while(q--){
int msk=0,k=read();
for(int i=0;i<k;++i)msk|=1<<(read()-1);
printf("%d\n",dp[msk]);
}
}```
P5029 T'ill It's Over.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=100005;
const int N=11*K;
const int M=N<<1;
const int inf=0x3f3f3f3f;
int n,m,k,tot,rt[2],ls[K<<2],rs[K<<2];
int hed[N],et=1,S,T,cur[N],dis[N],mf;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,tot)dis[i]=0,cur[i]=hed[i];
dis[s]=1,q.push(s);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl=0,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
void build(int&x,int&y,int l=1,int r=k){
x=++tot,y=l==r?x:++tot;
if(l==r){
if(l==1)adde(S,x,n);
if(l==k)adde(y,T,n);
return;
}
int mid=(l+r)>>1;
build(ls[x],ls[y],l,mid);
build(rs[x],rs[y],mid+1,r);
adde(x,ls[x],inf),adde(x,rs[x],inf);
adde(ls[y],y,inf),adde(rs[y],y,inf);
}
void link(int p,int ql,int qr,int pos,int op,int l=1,int r=k){
if(ql<=l&&r<=qr){
if(!op)adde(pos,p,inf);
else adde(p,pos,inf);
return;
}
int mid=(l+r)>>1;
if(ql<=mid)link(ls[p],ql,qr,pos,op,l,mid);
if(mid<qr)link(rs[p],ql,qr,pos,op,mid+1,r);
}
signed main(){
n=read(),m=read(),k=read(),S=++tot,T=++tot;
build(rt[0],rt[1]);
rep(i,1,m){
int op=read(),l=read(),a1,b1,a2,b2;
if(op==1)a1=read(),a2=a1,b1=read(),b2=b1;
else if(op==2)a1=read(),a2=read(),b1=read(),b2=b1;
else if(op==3)a1=read(),a2=a1,b1=read(),b2=read();
else a1=read(),a2=read(),b1=read(),b2=read();
link(rt[0],b1,b2,tot+2,0);
link(rt[1],a1,a2,tot+1,1);
adde(tot+1,tot+2,l),tot+=2;
}
while(bfs(S,T))mf+=dfs(S,inf);
printf("%d\n",mf);
}
/*
5 4 5
1 3 1 3
1 3 3 2
1 3 2 5
4 1 1 1 4 5
*/```
P1001 A+B Problem.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read()
{
char ch=getchar();
int f=1,x=0;
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
void write(int a)
{
if(a>9)write(a/10);
putchar(a%10+'0');
}
int main()
{
int a,b;
a=read();
b=read();
write(a+b);
} ```
P6099 [USACO19FEB]Dishwashing G.cpp
```#include<bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::max;
using std::vector;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100009;
int n,mx,st,ed;
vector<int>v[N];
signed main() {
n=rd(),st=1,ed=0;
for(int i=1;i<=n;++i) {
int x=rd();
if(mx>x)return printf("%d\n",i-1),0;
if(st>ed){v[++ed].push_back(x);continue;}
int l=st,r=ed,res=ed+1;
while(l<=r) {
int mid=(l+r)>>1;
if(v[mid].front()>x)res=mid,r=mid-1;
else l=mid+1;
}
while(!v[res].empty()&&v[res].back()<x)
mx=max(mx,v[res].back()),v[res].pop_back();
v[res].push_back(x),ed=max(ed,res);
}
printf("%d\n",n);return 0;
}```
P1552 [APIO2012]派遣-1（左偏树）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
const int inf=1<<29;
int n,m;
int root;
int L[N];
int num_edge,head[N];
int val[N],fa[N],ls[N],rs[N],dst[N],siz[N];
LL sum[N];
LL ans;
struct edge {
int nxt,to;
}e[N];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
int merge(int x,int y) {
if(!x||!y)return x|y;
if(val[x]<val[y]||(val[x]==val[y]&&x>y))swap(x,y);
siz[x]+=siz[y],sum[x]+=sum[y],rs[x]=merge(rs[x],y),fa[rs[x]]=x;
if(dst[ls[x]]<dst[rs[x]])swap(ls[x],rs[x]);
dst[x]=dst[rs[x]]+1;
return x;
}
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
void pop(int x) {
x=find(x),siz[x]=0,sum[x]=0,val[x]=0;
fa[ls[x]]=ls[x],fa[rs[x]]=rs[x];
fa[x]=merge(ls[x],rs[x]);
}
void dfs(int u) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
dfs(v);
merge(find(u),find(v));
}
while(sum[find(u)]>m)pop(u);
ans=max(ans,1ll*L[u]*siz[find(u)]);
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i) {
int x=rd();
sum[i]=val[i]=rd(),L[i]=rd();
fa[i]=i,siz[i]=1;
if(x)addedge(x,i);
else root=i;
}
dfs(root);
printf("%lld\n",ans);
return 0;
}
```
P3349 [ZJOI2016]小星星.cpp
```#include <bits/stdc++.h>
using namespace std;
inline int read()
{
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
{
if (ch == '-')
f = 0;
ch = getchar();
}
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
typedef long long LL;
#define N 17
int n, m;
LL dp[N][N][1 << N], ans, A[N][1 << N], sum[1 << N];
struct Graph
{
#define M (N * N)
int head[N], nxt[M], to[M], ecnt;
void addedge(int u, int v) { nxt[++ecnt] = head[u], to[ecnt] = v, head[u] = ecnt; }
#undef M
} T, G;
void OR(LL *a, int op)
{
for (int i = 1; i < 1 << n; i <<= 1)
for (int j = 0; j < 1 << n; j += i << 1)
for (int k = 0; k < i; ++k)
a[i + j + k] += a[j + k] * op;
}
void dfs(int u, int ft)
{
memcpy(dp[u], A, sizeof(A));
for (int o = T.head[u]; o; o = T.nxt[o])
{
int v = T.to[o];
if (v == ft)
continue;
dfs(v, u);
for (int x = 0; x < n; ++x)
{
memset(sum, 0, sizeof(sum));
for (int t = G.head[x]; t; t = G.nxt[t])
{
int y = G.to[t];
for (int i = 0; i < 1 << n; ++i)
sum[i] += dp[v][y][i];
}
for (int i = 0; i < 1 << n; ++i)
dp[u][x][i] *= sum[i];
}
}
}
signed main()
{
n = read(), m = read();
for (int i = 0; i < n; ++i)
A[i][1 << i] = 1, OR(A[i], 1);
for (int i = 1; i <= m; ++i)
{
int x = read() - 1, y = read() - 1;
G.addedge(x, y), G.addedge(y, x);
}
for (int i = 1; i < n; ++i)
{
int x = read() - 1, y = read() - 1;
T.addedge(x, y), T.addedge(y, x);
}
dfs(0, -1);
for (int i = 0; i < n; ++i)
OR(dp[0][i], -1), ans += dp[0][i][(1 << n) - 1];
printf("%lld\n", ans);
return 0;
}```
P4643 [国家集训队]阿狸和桃子的游戏.cpp
```#include<bits/stdc++.h>
using namespace std;int n,m,c,a[10000],u,v,s;main(){for(cin>>n>>m;u<n;a[u++]*=2)cin>>a[u];for(;m--;a[--v]+=s)cin>>u>>v>>s,a[--u]+=s;for(sort(a,a+n);n--;)c+=n&1?a[n]:-a[n];cout<<c/2;}```
CF986C AND Graph.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd(){
int f=1,x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int M=(1<<22)+5;
const int N=23;
int n,m,a[M],ans=0;
bool vis[M];
void dfs(int msk) {
if(vis[msk])return;
vis[msk]=1;
for(int i=0;i<n;++i)if(msk>>i&1)dfs(msk^(1<<i));
if(a[msk])dfs((1<<n)-1-msk);
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=m;++i)a[rd()]=1;
for(int i=0;i<(1<<n);++i) {
if(vis[i]||!a[i])continue;
dfs((1<<n)-1-i),++ans;
}
cout<<ans<<endl;
return 0;
}```
CF1093E Intersection of Permutations.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int M=32400000;
int n,m,a[N],b[N],c[N];
int val[M],ch[M][2],tot,rub[M],top,root[N];
#define lt(i) (i&(-i))
int ne() {return top?rub[top--]:++tot;}
void ins(int &x,int l,int r,int pos,int w) {
if(!x)x=ne();
val[x]+=w;
if(l==r) {if(!val[x])rub[++top]=x,x=0;return;}
int mid=(l+r)>>1;
if(mid>=pos)ins(ch[x][0],l,mid,pos,w);
else ins(ch[x][1],mid+1,r,pos,w);
if(!val[x])rub[++top]=x,x=0;
}
int query(int x,int ql,int qr,int l,int r) {
if(!x)return 0;
if(ql<=l&&r<=qr)return val[x];
int mid=(l+r)>>1,res=0;
if(mid>=ql)res+=query(ch[x][0],ql,qr,l,mid);
if(mid<qr)res+=query(ch[x][1],ql,qr,mid+1,r);
return res;
}
void add(int t,int x,int w) {
for(rint i=t;i<=n;i+=lt(i))ins(root[i],1,n,x,w);
}
int ask(int ql,int qr,int l,int r) {
int res=0;
for(rint i=ql-1;i>0;i-=lt(i))res-=query(root[i],l,r,1,n);
for(rint i=qr;i>0;i-=lt(i))res+=query(root[i],l,r,1,n);
return res;
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)a[rd()]=i;
for(rint i=1;i<=n;++i)b[i]=a[rd()];
for(rint i=1;i<=n;++i)add(i,b[i],1);
while(m--) {
int opt=rd();
if(opt==1) {
int l1=rd(),r1=rd(),l2=rd(),r2=rd();
printf("%d\n",ask(l2,r2,l1,r1));
} else {
int x=rd(),y=rd();
add(x,b[x],-1),add(y,b[y],-1);
swap(b[x],b[y]);
add(x,b[x],1),add(y,b[y],1);
}
}
return 0;
}```
P3201 [HNOI2009] 梦幻布丁（vector）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=1000005;
int n,m,a[N],F[M],ans,num[M<<1],cnt;
vector<int>v[M<<1];
void update(int x,int y){
int x_=F[x],y_=F[y];
if(x_==y_)return;
if(v[x_].size()>v[y_].size())F[y]=x_,F[x]=0,swap(x_,y_);
else F[x]=0;
swap(x,x_),swap(y,y_);
if(!x||!y||!v[x].size())return;
int i=0,j=0;
vector<int>fyyAKIOI;
++cnt;
v[cnt].push_back(v[x][i]<v[y][j]?v[x][i++]:v[y][j++]);
ans-=num[x]+num[y];
num[cnt]=1;
while(i<v[x].size()&&j<v[y].size()){
v[cnt].push_back(v[x][i]<v[y][j]?v[x][i++]:v[y][j++]);
if(v[cnt][i+j-1]>v[cnt][i+j-2]+1)++num[cnt];
}
while(i<v[x].size()){
v[cnt].push_back(v[x][i++]);
if(v[cnt][i+j-1]>v[cnt][i+j-2]+1)++num[cnt];
}
while(j<v[y].size()){
v[cnt].push_back(v[y][j++]);
if(v[cnt][i+j-1]>v[cnt][i+j-2]+1)++num[cnt];
}
v[x].swap(fyyAKIOI),F[y_]=cnt,ans+=num[cnt];
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)v[a[i]=read()].push_back(i);
for(int i=1;i<M;++i)F[i]=i;
cnt=M+1;
for(int i=1;i<M;++i){
if(!v[i].size())continue;
num[i]=1;
for(int j=1;j<v[i].size();++j)if(v[i][j]>v[i][j-1]+1)++num[i];
ans+=num[i];
}
while(m--){
int opt=read(),x,y;
if(opt==1){x=read(),y=read(),update(x,y);}
else printf("%d\n",ans);
}
return 0;
}
```
P6852 Mex.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 500005
int n,m,a[N],dif[N],ans[N];
int okl[N],okr[N],bnl[N],bnr[N];
vector<int>v;
bool vis[N];
signed main(){
n=read(),m=read();
for(int i=0;i<=n;++i)okl[i]=0,okr[i]=n,bnl[i]=n,bnr[i]=0;
for(int i=1;i<=m;++i){
int l=read(),r=read(),v=read();
if(v)okl[v-1]=max(okl[v-1],l),okr[v-1]=min(okr[v-1],r);
else ++dif[l],--dif[r+1];
bnl[v]=min(bnl[v],l),bnr[v]=max(bnr[v],r);
}
for(int i=1;i<=n;++i)dif[i]+=dif[i-1];
for(int i=n-1;i>=0;--i){
okl[i]=max(okl[i+1],okl[i]);
okr[i]=min(okr[i+1],okr[i]);
if(okl[i]>okr[i])return puts("-1"),0;
}
for(int i=okl[0];i<=okr[0];++i)
if(!dif[i])v.pb(i),vis[i]=1;
if(v.empty())return puts("-1"),0;
ans[v.back()]=0,v.pop_back();
for(int i=okl[0];i<=okr[0];++i)
if(!vis[i])v.pb(i),vis[i]=1;
for(int i=1;i<=n;++i){
if(bnl[i]<=bnr[i]){
for(int j=okl[i];j<bnl[i]&&j<=okr[i]&&!vis[j];++j)v.pb(j),vis[j]=1;
for(int j=okr[i];j>bnr[i]&&j>=okl[i]&&!vis[j];--j)v.pb(j),vis[j]=1;
}
if(v.empty()||(bnl[i]<=v.back()&&v.back()<=bnr[i]))return puts("-1"),0;
ans[v.back()]=i,v.pop_back();
for(int j=max(okl[i],bnl[i]);j<=okr[i]&&!vis[j];++j)v.pb(j),vis[j]=1;
for(int j=min(okr[i],bnr[i]);j>=okl[i]&&!vis[j];--j)v.pb(j),vis[j]=1;
}
for(int i=0;i<=n;++i)printf("%d%c",ans[i]," \n"[i==n]);
return 0;
}
/*
3 0 2 1 4 5
5 7
1 2 1
0 2 1
0 3 4
1 3 3
0 5 6
4 5 0
2 3 0
*/```
P7114 字符串匹配（n ln n）.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
typedef long long LL;
typedef double db;
template<class T>inline bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>inline bool ckmin(T&x,T y){return x>y?x=y,1:0;}
const int N=(1<<20)+5;
#define mod 1000000021
#define base 37
LL ans;
int n;
int pw[N],H[N],pre[N],suf[N],cnt[30],tr[30];
char str[N];
LL val(int l,int r){return (H[r]-1ll*H[l-1]*pw[r-l+1]%mod+mod)%mod;}
void add(int x,int d){for(int i=x;i<=29;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
void Main(){
ans=0,memset(tr,0,sizeof(tr));
scanf("%s",str+1),n=strlen(str+1);
rep(i,1,n)H[i]=(1ll*H[i-1]*base+str[i]-'a')%mod;
pre[0]=0;rep(i,0,25)cnt[i]=-1;
rep(i,1,n)pre[i]=pre[i-1]+(cnt[str[i]-'a']*=-1);
suf[n+1]=0;rep(i,0,25)cnt[i]=-1;
per(i,n,1)suf[i]=suf[i+1]+(cnt[str[i]-'a']*=-1);
for(int len=2;len<n;++len){
add(pre[len-1]+1,1);LL tmp=val(1,len);
for(int i=1;i+len-1<n;i+=len){
if(tmp!=val(i,i+len-1))break;
ans+=ask(suf[i+len]+1);
}
}
printf("%lld\n",ans);
}
signed main(){
pw[0]=1;rep(i,1,N-1)pw[i]=1ll*base*pw[i-1]%mod;
for(int T=read();T;--T)Main();
}```
P7245 灯光效果.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=1005;
int n,k,m,x[N],y[N],ans,ivm;
namespace math{
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
}
using math::qpow;
using math::fmod;
struct Matrix{
int a[2][2];
Matrix(){memset(a,0,sizeof(a));}
Matrix operator * (const Matrix&t){
Matrix res;
// rep(i,0,1)rep(j,0,1)rep(k,0,1)fmod(res.a[i][j]+=1ll*a[i][k]*t.a[k][j]%mod);
fmod(res.a[0][0]+=1ll*a[0][0]*t.a[0][0]%mod),fmod(res.a[0][0]+=1ll*a[0][1]*t.a[1][0]%mod);
fmod(res.a[0][1]+=1ll*a[0][0]*t.a[0][1]%mod),fmod(res.a[0][1]+=1ll*a[0][1]*t.a[1][1]%mod);
fmod(res.a[1][0]+=1ll*a[1][0]*t.a[0][0]%mod),fmod(res.a[1][0]+=1ll*a[1][1]*t.a[1][0]%mod);
fmod(res.a[1][1]+=1ll*a[1][0]*t.a[0][1]%mod),fmod(res.a[1][1]+=1ll*a[1][1]*t.a[1][1]%mod);
return res;
}
void e(){a[0][0]=a[1][1]=1,a[1][0]=a[0][1]=0;}
};
Matrix Matrix_qpow(Matrix a,int k){
Matrix res;res.e();
for(;k;k>>=1,a=a*a)if(k&1)res=res*a;
return res;
}
int calc(int yx,int zs,int k){
int tmp=1ll*yx*zs%mod*ivm%mod;
Matrix tur,sta;
sta.a[0][0]=tmp;
tur.a[0][0]=mod+2-tmp*2%mod,tur.a[0][1]=1;
tur.a[1][0]=(tmp*2-1)%mod,tur.a[1][1]=0;
sta=sta*Matrix_qpow(tur,k-1);
// for(int i=2;i<=k;++i)res=(1ll*(mod+1-tmp*2%mod)*res%mod+tmp)%mod;
// return res;
return sta.a[0][0];
}
signed main(){
n=read(),m=read(),k=read(),ivm=qpow(1ll*(m*m)*(m*m-m*2+1)/4%mod,mod-2);
for(int i=1;i<=m;++i)x[i]=read();
for(int i=1;i<=m;++i)y[i]=read();
for(int i=1;i<=m;++i)
for(int j=1;j<=m;++j){
int num=1ll*(x[i]-x[i-1])*(y[j]-y[j-1])%mod;
int tmp=calc((m-i+1)*(m-j+1),(i-1)*(j-1),k);
fmod(ans+=1ll*num*tmp%mod);
}
cout<<ans<<'\n';
return 0;
}```
P7273 ix35 的等差数列.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n,w,a[N],cnt[N],ans;
signed main(){
n=read(),w=read();
rep(i,1,n)a[i]=read();
if(n==1)return puts("0"),0;
rep(d,0,w/(n-1)){
int fyyak;
rep(i,1,n)if((fyyak=a[i]-d*(i-1))>0&&a[i]+(n-i)*d<=w)ckmax(ans,++cnt[fyyak]);
rep(i,1,n)if((fyyak=a[i]-d*(i-1))>0&&a[i]+(n-i)*d<=w)--cnt[fyyak];
}
printf("%d\n",n-ans);
return 0;
}```
CF650D Zip-line.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 800005
int n,m,a[N],b[N],h[N],lsh[N],len,tr1[N],tr2[N],pre[N],suf[N],cnt[N],LIS,ans[N];
void add1(int x,int d){for(int i=x;i<=len;i+=i&-i)tr1[i]=max(d,tr1[i]);}
int ask1(int x){int res=0;for(int i=x;i>0;i-=i&-i)res=max(res,tr1[i]);return res;}
void add2(int x,int d){for(int i=x;i>0;i-=i&-i)tr2[i]=max(tr2[i],d);}
int ask2(int x){int res=0;for(int i=x;i<=len;i+=i&-i)res=max(res,tr2[i]);return res;}
vector<pair<int,int> >q[N];
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)h[i]=lsh[++len]=read();
for(int i=1;i<=m;++i)a[i]=read(),b[i]=lsh[++len]=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
for(int i=1;i<=n;++i)h[i]=lower_bound(lsh+1,lsh+len+1,h[i])-lsh;
for(int i=1;i<=m;++i)b[i]=lower_bound(lsh+1,lsh+len+1,b[i])-lsh,q[a[i]].pb(mkp(b[i],i));
// for(int i=1;i<=n;++i)std::cerr<<h[i]<<' ';std::cerr<<'\n';
for(int i=1;i<=n;++i){
for(pair<int,int>j:q[i])ans[j.y]+=ask1(j.x-1);
add1(h[i],pre[i]=ask1(h[i]-1)+1),LIS=max(LIS,pre[i]);
}
for(int i=n;i>=1;--i){
for(pair<int,int>j:q[i])ans[j.y]+=ask2(j.x+1);
add2(h[i],suf[i]=ask2(h[i]+1)+1);
}
// std::cerr<<LIS<<'\n';
// for(int i=1;i<=n;++i)std::cerr<<pre[i]<<' ';std::cerr<<'\n';
// for(int i=1;i<=n;++i)std::cerr<<suf[i]<<' ';std::cerr<<'\n';
// for(int i=1;i<=m;++i)std::cerr<<ans[i]<<' ';std::cerr<<'\n';
for(int i=1;i<=n;++i)if(pre[i]+suf[i]-1==LIS)++cnt[pre[i]];
for(int i=1;i<=m;++i){
if(cnt[pre[a[i]]]==1&&pre[a[i]]+suf[a[i]]-1==LIS)printf("%d\n",max(LIS-1,ans[i]+1));
else printf("%d\n",max(LIS,ans[i]+1));
}
return 0;
}```
P1291 [SHOI2002]百事世界杯之旅.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int __int128
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n;
int gcd(int x,int y){return !y?x:gcd(y,x%y);}
struct node{
int x,y;
node(int q=0){x=q,y=1;}
node(int X,int Y){x=X,y=Y;}
node operator + (const node&t){
int Y=y/gcd(t.y,y)*t.y;
int X=x*Y/y+t.x*Y/t.y;
int g=gcd(X,Y);
X/=g,Y/=g;
return node(X,Y);
}
}ans;
int ws(int x){
int res=0;
while(x)x/=10,++res;
return res;
}
void print(int x,int text=-1){
int d[40];d[0]=0;
while(x)d[++d[0]]=x%10,x/=10;
for(int i=d[0];i;--i)putchar('0'+d[i]);
if(~text)putchar(text);
}
signed main(){
signed nnn; std::cin>>nnn;
n=nnn;
for(int i=1;i<=n;++i)ans=ans+node(n,i);
int A=ans.x/ans.y,B=ans.x-A*ans.y;
if(ans.y==1)return printf("%lld\n",ans.x),0;
int g=gcd(B,ans.y);
B/=g,ans.y/=g;
int l1=ws(A),l2=ws(ans.y);
for(int i=1;i<=l1;++i)putchar(' ');print(B,'\n');
print(A);for(int i=1;i<=l2;++i)putchar('-');puts("");
for(int i=1;i<=l1;++i)putchar(' ');print(ans.y,'\n');
return 0;
}```
P5518 [MtOI2019]幽灵乐团 莫比乌斯反演基础练习题.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int T,mod,A,B,C,iv6;
int mu[N],pri[N/9],cnt,jc[N],jp[N],sm[N],jk[N],st[N],phi[N],fp[N],vf[N];
bool vis[N];
int qpow(int n,int k,int res=1){
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
void Sieve(const int N=100000){
mu[1]=1,phi[1]=1,jc[0]=1,jp[0]=1,jk[0]=1,st[0]=1,fp[0]=1,fp[1]=1,vf[0]=1;
for(int i=2;i<=N;++i){
fp[i]=1;
if(!vis[i])pri[++cnt]=i,mu[i]=-1,phi[i]=i-1;
for(int j=1;j<=cnt&&i*pri[j]<=N;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){phi[i*pri[j]]=phi[i]*pri[j];break;}
mu[i*pri[j]]=-mu[i],phi[i*pri[j]]=phi[i]*phi[pri[j]];
}
}
for(int i=1;i<=N;++i){
if(!mu[i])continue;
for(int j=1;i*j<=N;++j)
if(mu[i]==1)fp[i*j]=1ll*fp[i*j]*j%mod;
else fp[i*j]=1ll*fp[i*j]*qpow(j,mod-2)%mod;
}
for(int i=1;i<=N;++i)fp[i]=1ll*fp[i]*fp[i-1]%mod,vf[i]=qpow(fp[i],mod-2);
for(int i=1;i<=N;++i)
jc[i]=1ll*jc[i-1]*i%mod,
jp[i]=1ll*jp[i-1]*qpow(i,i)%mod,
sm[i]=(sm[i-1]+1ll*mu[i]*i%(mod-1)*i%(mod-1))%(mod-1),
jk[i]=1ll*jk[i-1]*qpow(i,1ll*i*i%(mod-1))%mod,
mu[i]+=mu[i-1],
st[i]=1ll*st[i-1]*qpow(i,phi[i])%mod,
phi[i]=(phi[i]+phi[i-1])%(mod-1);
/*
Attention:
mu:∑μ
jc :阶乘 mod mod
jp : i^i 的前缀积 mod mod
sm：∑μ(x)*x*x mod (mod-1)
jk:∏i^(i^2) mod (mod-1)
phi:∑φ mod (mod-1)
st:πT^phi(T) mod mod
fp:∑π(d|T)d^μ(T/d) mod mod
vf:qpow(fp,mod-2)
*/
}
namespace Task0{
int fz,fm;
int f(int n,int m){
if(n>m)n^=m^=n^=m;
int res=0;
for(int l=1,r;l<=n;l=r+1)
r=min(n/(n/l),m/(m/l)),res=(res+1ll*(n/l)*(m/l)%(mod-1)*(mu[r]-mu[l-1])%(mod-1))%(mod-1);
return (res+mod-1)%(mod-1);
}
int g(int n,int m){
if(n>m)n^=m^=n^=m;
int res=1;
for(int l=1,r;l<=n;l=r+1)
r=min(n/(n/l),m/(m/l)),res=1ll*res*qpow(1ll*jc[r]*qpow(jc[l-1],mod-2)%mod,f(n/l,m/l))%mod;
return (res+mod)%mod;
}
void main(){
fz=qpow(1ll*qpow(jc[A],B)*qpow(jc[B],A)%mod,C)%mod;
fm=qpow(1ll*qpow(g(A,B),C)*qpow(g(A,C),B)%mod,mod-2);
printf("%lld ",1ll*fz*fm%mod);
}
}
namespace Task1{
int fz,fm;
int s(int x,int y){
return (1ll*x*(x+1)/2%(mod-1))*(1ll*y*(y+1)/2%(mod-1))%(mod-1);
}
int s2(int x){
return 1ll*x*(x+1)%mod*(x+x+1)%mod*iv6%mod;
}
int f(int n,int m){
if(n>m)n^=m^=n^=m;
int res=0;
for(int l=1,r;l<=n;l=r+1){
r=min(n/(n/l),m/(m/l));
res=(res+1ll*s(n/l,m/l)*(sm[r]-sm[l-1])%(mod-1))%(mod-1);
}
return (res+mod-1)%(mod-1);
}
int g(int n,int m){
if(n>m)n^=m^=n^=m;
int res=1;
for(int l=1,r;l<=n;l=r+1){
r=min(n/(n/l),m/(m/l));
res=1ll*res*qpow(1ll*jk[r]*qpow(jk[l-1],mod-2)%mod,f(n/l,m/l))%mod;
}
return (res+mod)%mod;
}
void main(){
fz=qpow(1ll*qpow(jp[A],1ll*B*(B+1)/2%(mod-1))*qpow(jp[B],1ll*A*(A+1)/2%(mod-1))%mod,1ll*C*(C+1)/2%(mod-1));
fm=qpow(1ll*qpow(g(A,B),1ll*C*(C+1)/2%(mod-1))*qpow(g(A,C),1ll*B*(B+1)/2%(mod-1))%mod,mod-2);
printf("%lld ",1ll*fz*fm%mod);
}
}
namespace Task2{
int fz,fm;
int f(int A,int B,int C){
int res=1;
for(int l=1,r,mx=min(A,min(B,C));l<=mx;l=r+1){
r=min(A/(A/l),min(B/(B/l),C/(C/l)));
res=1ll*res*qpow(jc[A/l],1ll*(B/l)*(C/l)%(mod-1)*(phi[r]-phi[l-1]+mod-1)%(mod-1))%mod;
res=1ll*res*qpow(1ll*st[r]*qpow(st[l-1],mod-2)%mod,1ll*(A/l)*(B/l)*(C/l)%(mod-1))%mod;
}
return res;
}
int h(int n,int m){
if(n>m)n^=m^=n^=m;
int res=1;
for(int l=1,r;l<=n;l=r+1){
r=min(n/(n/l),m/(m/l));
res=1ll*res*qpow(1ll*fp[r]*vf[l-1]%mod,1ll*(n/l)*(m/l)%(mod-1))%mod;
}
return res;
}
int g(int A,int B,int C){
int res=1;
for(int l=1,r,mx=min(A,min(B,C));l<=mx;l=r+1){
r=min(A/(A/l),min(B/(B/l),C/(C/l)));
res=1ll*res*qpow(1ll*st[r]*qpow(st[l-1],mod-2)%mod,1ll*(A/l)*(B/l)*(C/l)%(mod-1))%mod;
res=1ll*res*qpow(h(A/l,B/l),1ll*(phi[r]-phi[l-1]+mod-1)*(C/l)%(mod-1))%mod;
}
return res;
}
void main(){
fz=1ll*f(A,B,C)*f(B,A,C)%mod;
fm=qpow(1ll*g(A,B,C)*g(A,C,B)%mod,mod-2);
printf("%lld ",1ll*fz*fm%mod);
}
}
signed main(){
T=read(),mod=read(),iv6=qpow(6,mod-2),Sieve();
while(T--) {
A=read(),B=read(),C=read();
Task0::main(),Task1::main(),Task2::main(),puts("");
}
}
/*
3 998244353
6 6 6
100000 100000 100000
99998 99999 100000
570465346 682784945 524427235
862376103 371412326 358248208
103815203 127873959 745848036
*/```
P2252 [SHOI2002]取石子游戏 【模板】威佐夫博弈.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define db double
#define N 100005
inline bool down(int&x,const int y){
return x>y?x=y,1:0;
}
int a,b;
signed main(){
std::ios::sync_with_stdio(0),std::cin.tie(0),std::cout.tie(0);
std::cin>>a>>b;
if(a>b)std::swap(a,b);
int k=b-a;
int t=1.*k*(sqrt(5)+1)/2;
if(t==a)puts("0");
else puts("1");
}```
P6672 [清华集训2016] 你的生命已如风中残烛.cpp
```#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int n,w[45],m,cynAK=1;
signed main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",&w[i]),m+=w[i];
for(int i=1;i<=m;++i)if(m-n+1!=i)cynAK=1ll*cynAK*i%mod;
std::cout<<cynAK<<'\n';
}```
P6564 [POI2007] 堆积木KLO.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,tr[N];
void upd(int x,int d){for(int i=x;i<=n;i+=i&-i)tr[i]=max(tr[i],d);}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res=max(res,tr[i]);return res;}
struct node {
int x,y,val;
inline bool operator < (const node&rhs)const{return x!=rhs.x?x<rhs.x:y<rhs.y;}
}a[N];
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i].x=i-(a[i].val=rd()),a[i].y=i;
sort(a+1,a+n+1);
for(int i=1;i<=n;++i){
if(a[i].x<0) continue;
upd(a[i].val,ask(a[i].val-1)+1);
}
printf("%d\n",ask(n));
return 0;
}
```
P5839 [USACO19DEC]Moortal Cowmbat G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define N 100009
#define M 29
#define inf (0x3f3f3f3f)
int n,m,k,sum[N][M],dp[N],a[N],dis[M][M],f[M];
char s[N];
signed main() {
n=rd(),m=rd(),k=rd(),scanf("%s",s+1);
for(int i=1;i<=n;++i)a[i]=s[i]-'a'+1;
for(int i=1;i<=m;++i)
for(int j=1;j<=m;++j)
dis[i][j]=rd();
for(int k=1;k<=m;++k)
for(int i=1;i<=m;++i)
for(int j=1;j<=m;++j)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
sum[i][j]=sum[i-1][j]+dis[a[i]][j];
for(int i=1;i<=n;++i) {
dp[i]=inf;
if(i>=k*2) {
for(int j=1;j<=m;++j)
f[j]=min(f[j],dp[i-k]-sum[i-k][j]);
}
for(int j=1;j<=m;++j)
dp[i]=min(dp[i],f[j]+sum[i][j]);
}
printf("%d\n",dp[n]);
return 0;
}```
P1053 篝火晚会.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50009;
int n,a[N][2],cnt[N];
int x[N],vis[N],ans=0x3f3f3f3f;
int solve() {
memset(vis,0,sizeof(vis));
int res=0;
for(int i=1;i<=n;++i)
++vis[(i-x[i]+n)%n],res=max(res,vis[(i-x[i]+n)%n]);
return n-res;
}
signed main() {
n=rd();
for(int i=1;i<=n;++i) {
a[i][0]=rd(),a[i][1]=rd();
++cnt[a[i][0]],++cnt[a[i][1]];
}
x[1]=1,x[0]=a[1][0];
for(int i=1;i<=n;++i)x[i+1]=a[x[i]][0]==x[i-1]?a[x[i]][1]:a[x[i]][0];
if((a[x[n]][0]==x[n-1]?a[x[n]][1]:a[x[n]][0])!=x[1])return puts("-1"),0;
ans=min(ans,solve());
x[1]=1,x[0]=a[1][1];
for(int i=1;i<=n;++i)x[i+1]=a[x[i]][0]==x[i-1]?a[x[i]][1]:a[x[i]][0];
ans=min(ans,solve());
printf("%d\n",ans);
return 0;
}
```
P6177 Count on a tree II【模板】树分块.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=40005;
const int S=800;
int n,m,lsh[N],len,a[N],lastans;
int top[N],fa[N],dep[N],siz[N],son[N];
int id[N],tot,mxd[N],up[N];
bitset<N>bs[N/S+5][N/S+5];
int hed[N],et;
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
siz[u]=1,mxd[u]=dep[u];
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v],fa[v]=u;
ckmax(mxd[u],mxd[v]);
if(siz[v]>siz[son[u]])son[u]=v;
}
if(u==1||mxd[u]-dep[u]>S)mxd[u]=dep[u],id[u]=++tot;
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
void dfs(int u,int ft,int lst){
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
if(id[u]){
up[u]=lst,bs[id[u]][id[u]].set(a[u]);
int now=u;
while(now!=fa[lst])bs[id[u]][id[lst]].set(a[now]),now=fa[now];
now=up[lst];
while(now)(bs[id[u]][id[now]]|=bs[id[u]][id[lst]])|=bs[id[lst]][id[now]],now=up[now];
dfs(v,u,u);
}else dfs(v,u,lst);
}
}
int LCA(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
signed main(){
n=read(),m=read();
rep(i,1,n)a[i]=lsh[++len]=read();
sort(lsh+1,lsh+len+1),len=unique(lsh+1,lsh+len+1)-lsh-1;
rep(i,1,n)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dep[1]=1,dfs1(1,0),dfs2(1,1),dfs(1,0,0);
while(m--){
static bitset<N>ans;
int x=read()^lastans,y=read(),lca=LCA(x,y);
ans.reset(),ans.set(a[lca]);
while(!id[x]&&x!=lca)ans.set(a[x]),x=fa[x];
while(!id[y]&&y!=lca)ans.set(a[y]),y=fa[y];
if(x!=lca){
int now=x;
while(up[now]&&dep[up[now]]>dep[lca])now=up[now];
ans|=bs[id[x]][id[now]];
while(now!=lca)ans.set(a[now]),now=fa[now];
}
if(y!=lca){
int now=y;
while(up[now]&&dep[up[now]]>dep[lca])now=up[now];
ans|=bs[id[y]][id[now]];
while(now!=lca)ans.set(a[now]),now=fa[now];
}
printf("%d\n",lastans=ans.count());
}
}```
CF1301F Super Jaber.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 1005
#define K 45
int n,m,k,c[N*N],dis[K][N*N];
vector<int>e[N*N],in[K];
#define id(x,y) ((x-1)*m+y)
void bfs(int col){
static bool pushed[K],vis[N*N];
memset(pushed,0,sizeof(pushed));
memset(vis,0,sizeof(vis));
queue<int>q;
for(int i:in[col])vis[i]=1,q.push(i);
pushed[col]=1;
while(!q.empty()){
int u=q.front();q.pop();
if(!pushed[c[u]]){
for(int v:in[c[u]])if(!vis[v])vis[v]=1,dis[col][v]=dis[col][u]+1,q.push(v);
pushed[c[u]]=1;
}
for(int v:e[u])
if(!vis[v])vis[v]=1,dis[col][v]=dis[col][u]+1,q.push(v);
}
}
signed main(){
n=read(),m=read(),k=read();
for(int i=1;i<=n*m;++i)
in[c[i]=read()].pb(i);
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j){
if(i>1)e[id(i,j)].pb(id(i-1,j)),e[id(i-1,j)].pb(id(i,j));
if(i<n)e[id(i,j)].pb(id(i+1,j)),e[id(i+1,j)].pb(id(i,j));
if(j>1)e[id(i,j)].pb(id(i,j-1)),e[id(i,j-1)].pb(id(i,j));
if(j<m)e[id(i,j)].pb(id(i,j+1)),e[id(i,j+1)].pb(id(i,j));
}
for(int i=1;i<=k;++i)bfs(i);
for(int q=read();q;--q){
int r1=read(),c1=read(),r2=read(),c2=read();
int st=id(r1,c1),ed=id(r2,c2),res=abs(r1-r2)+abs(c1-c2);
for(int i=1;i<=k;++i)res=min(res,dis[i][st]+dis[i][ed]+1);
printf("%d\n",res);
}
return 0;
}
/*
4 4 8
1 2 2 8
1 3 4 7
5 1 7 6
2 3 8 8
4
1 1 2 2
1 1 3 4
1 1 2 4
1 1 4 4
*/```
CF559E Gerald and Path.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
int dp[N][N][2],n,ans;
struct line{
int a,l;
int calc(int dir){return !dir?a:a+l;}
}a[N];
int calc(int id,int dir){return a[id].calc(dir);}
inline bool cmp(const line&a,const line&b){
return a.a<b.a;
}
signed main(){
n=read();
rep(i,1,n)a[i].a=read(),a[i].l=read();
sort(a+1,a+n+1,cmp),a[0].a=-3e8,a[0].l=0;
rep(i,0,n)rep(j,0,i)rep(d1,0,1){
int nw1=j,nw2=d1;
rep(k,i+1,n)rep(d2,0,1){
if(calc(nw1,nw2)<a[k].calc(d2))nw1=k,nw2=d2;
ckmax(dp[k][nw1][nw2],dp[i][j][d1]+calc(nw1,nw2)-calc(k,d2)
+min(calc(k,d2)-calc(j,d1),a[k].l));
}
}
rep(i,1,n)rep(j,1,i)rep(k,0,1)ckmax(ans,dp[i][j][k]);
cout<<ans<<'\n';
return 0;
}```
P1008 三连击.cpp
```#include<bits/stdc++.h>
using namespace std;
int main()
{
int num[10],sum;
for(int i=123;i<=333;i++)
{
sum=0;
memset(num,0,sizeof(num));
int a=i,b=2*i,c=3*i;
num[a%10]++;a/=10;
num[a%10]++;a/=10;
num[a%10]++;
num[b%10]++;b/=10;
num[b%10]++;b/=10;
num[b%10]++;
num[c%10]++;c/=10;
num[c%10]++;c/=10;
num[c%10]++;
for(int j=1;j<=9;j++)
if(num[j])sum++;
if(sum==9)cout<<i<<" "<<i*2<<" "<<i*3<<endl;
}
return 0;
} ```
P3205 [HNOI2010]合唱队.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
const int N=1005;
const int mod=19650827;
int dp[N][N][2],n,a[N],ans;
void fmod(int&x){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=read(),dp[i][i][0]=1;
for(int len=2;len<=n;++len){
for(int l=1;;++l){
int r=l+len-1;
if(r>n)break;
if(a[l]<a[l+1])fmod(dp[l][r][0]+=dp[l+1][r][0]);
if(a[l]<a[r])fmod(dp[l][r][0]+=dp[l+1][r][1]);
if(a[r]>a[r-1])fmod(dp[l][r][1]+=dp[l][r-1][1]);
if(a[r]>a[l])fmod(dp[l][r][1]+=dp[l][r-1][0]);
}
}
fmod(ans=dp[1][n][0]+dp[1][n][1]),printf("%d\n",ans);
return 0;
}```
P3163 [CQOI2014]危桥.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=55;
const int M=N*N*2;
const int inf=0x3f3f3f3f;
int n,a1,a2,an,b1,b2,bn;
int hed[N],et=1,S,T,maxflow,cur[N],dis[N];
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].nx=hed[u],e[et].to=v,e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,T)dis[i]=0,cur[i]=hed[i];
dis[s]=1,q.push(s);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl=0,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl)e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
}
}
return used;
}
void Main(){
fill(hed,hed+n+3,0),et=1,S=n+1,T=S+1;
a1=read()+1,a2=read()+1,an=read(),b1=read()+1,b2=read()+1,bn=read();
rep(i,1,n){
rep(j,1,n){
char ch=getchar();
while(ch!='O'&&ch!='N'&&ch!='X')ch=getchar();
if(ch=='X')continue;
if(ch=='O')adde(i,j,1);
else adde(i,j,inf);
}
}
hed[S]=hed[T]=maxflow=0;
adde(S,a1,an),adde(a2,T,an),adde(S,b1,bn),adde(b2,T,bn);
while(bfs(S,T))maxflow+=dfs(S,inf);
if(maxflow!=an+bn)return puts("No"),void();
hed[S]=hed[T]=maxflow=0;
rep(i,1,et)if(!(i&1))e[i^1].fl+=e[i].fl,e[i].fl=0;
adde(S,a1,an),adde(a2,T,an),adde(S,b2,bn),adde(b1,T,bn);
while(bfs(S,T))maxflow+=dfs(S,inf);
if(maxflow!=an+bn)return puts("No"),void();
puts("Yes");
}
signed main(){while(scanf("%d",&n)!=EOF)Main();}```
AT2005 [AGC003E] Sequential operations on Sequence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,tot,m;
LL q[N],a[N],cpy[N],ans[N];
void add(LL x,LL tim){
if(!x)return;
int i=upper_bound(a+1,a+tot+1,x)-a-1;
if(!i)ans[x]+=tim;
else cpy[i]+=x/a[i]*tim,add(x%a[i],tim);
}
signed main(){
scanf("%d%d",&n,&m);
rep(i,1,m)scanf("%lld",&q[i]);
q[0]=n,a[tot=1]=q[m];
per(i,m-1,0)if(q[i]<a[tot])a[++tot]=q[i];
reverse(a+1,a+tot+1);
cpy[tot]=1;
per(i,tot,2)add(a[i]%a[i-1],cpy[i]+=a[i+1]/a[i]*cpy[i+1]);
ans[a[1]]+=cpy[1]+=a[2]/a[1]*cpy[2];
per(i,n,1)ans[i]+=ans[i+1];
rep(i,1,n)printf("%lld\n",ans[i]);
return 0;
}```
P4464 [国家集训队]JZPKIL.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
LL mul(LL x,LL y,LL zky){
LL res=x*y-(long long)((long double)x/zky*y+0.5)*zky;
return res<0?res+zky:res;
}
LL qpow(LL n,LL k,LL zky){
LL res=1;for(;k;k>>=1,n=mul(n,n,zky))if(k&1)res=mul(res,n,zky);
return res;
}
LL gcd(LL x,LL y){
while(y){LL t=x%y;x=y,y=t;}
return x;
}
namespace MR{
static const int P[8]={2,3,5,7,11,19,61,233};
bool mr(LL x,LL p){
if(x%p==0||qpow(p,x-1,x)!=1)return 0;
LL k=x-1;
while(!(k&1)){
LL t=qpow(p,k>>=1,x);
if(t!=1&&t!=x-1)return 0;
if(t==x-1)break;
}
return 1;
}
bool test(LL x){
for(int i=0;i<8;++i){
if(x==P[i])return 1;
if(!mr(x,P[i]))return 0;
}
return 1;
}
}
namespace PR{
LL s[150],d[150];
int tot;
mt19937_64 rnd(679);
#define rad(l,r) (rnd()%((r)-(l)+1)+(l))
LL pr(LL x,LL c){
if(x==4)return 2;
LL v0=c,v1=mul(v0,v0,x)+c,g=1;int len=0;
while(1){
s[++len]=v1-v0,g=mul(g,v1-v0,x);
if(len==127){if(gcd(g,x)>1)break;len=0;}
v0=mul(v0,v0,x)+c,v1=mul(v1,v1,x)+c,v1=mul(v1,v1,x)+c;
}
for(int i=1;i<=len;++i)if((g=gcd(s[i],x))>1)return g;
return x;
}
void solve(LL x){
if(x==1)return;
if(MR::test(x))return d[++tot]=x,void();
LL y=x;while(y==x)y=pr(x,rad(1,x-1));
solve(x/y),solve(y);
}
void work(LL x){tot=0,solve(x),sort(d+1,d+tot+1);}
}
#define zky 1000000007
void fmod(int&x){x-=zky,x+=x>>31&zky;}
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%zky)if(k&1)res=1ll*n*res%zky;return res;}
int B[3005],fac[3005],ifc[3005],a[3005],inv[3005];
int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%zky*ifc[n-m]%zky;}
LL n;
int x,y,ans;
void Main(){
ans=0;
scanf("%lld%d%d",&n,&x,&y);
rep(i,0,y)a[y-i+1]=1ll*B[i]*comb(y+1,i)%zky*inv[y+1]%zky;
++a[y];
PR::work(n);
rep(t,1,y+1){
int l=1,r=0,res=1;
while(l<=PR::tot){
while(r<PR::tot&&PR::d[r+1]==PR::d[l])++r;
LL p=PR::d[l];
int k=r-l+1,tmp=0,iv,now,bs,tem;
tem=p%zky,now=qpow(tem,t*(k-1)),iv=qpow(qpow(tem,t),zky-2),bs=qpow(tem,x);
rep(i,0,k-1)fmod(tmp+=now),now=1ll*now*bs%zky*iv%zky;
tmp=1ll*tmp*(zky-qpow(tem,y))%zky;
now=qpow(tem,t*k);
rep(i,0,k)fmod(tmp+=now),now=1ll*now*bs%zky*iv%zky;
res=1ll*res*tmp%zky,l=r+1;
}
fmod(ans+=1ll*a[t]*res%zky);
}
ans=1ll*ans*qpow(n%zky,y)%zky;
printf("%d\n",ans);
}
signed main(){
B[0]=fac[0]=ifc[0]=inv[1]=1;
rep(i,1,3003)fac[i]=1ll*fac[i-1]*i%zky,ifc[i]=qpow(fac[i],zky-2);
rep(i,2,3003)inv[i]=1ll*inv[zky%i]*(zky-zky/i)%zky;
rep(i,1,3003){
int res=0;
rep(j,0,i-1)fmod(res+=1ll*B[j]*comb(i+1,j)%zky);
B[i]=1ll*(zky-res)*qpow(i+1,zky-2)%zky;
}
for(int T=read();T;--T)Main();
}
/*
5
6 0 0
6 0 1
6 1 0
6 1 1
1000000000 50 50
*/```
CF264C Choosing Balls.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
int n,q,v[N],c[N];
LL dp[N],f[N];
void solve(int a,int b){
memset(f,-0x3f,sizeof(f));
f[0]=0;
int id[2];
id[0]=0,id[1]=-1;
for(int i=1;i<=n;++i){
dp[i]=f[c[i]]+1ll*a*v[i];
if(id[0]!=c[i])dp[i]=max(dp[i],f[id[0]]+1ll*b*v[i]);
else if(~id[1])dp[i]=max(dp[i],f[id[1]]+1ll*b*v[i]);
if(dp[i]>f[c[i]]){
f[c[i]]=dp[i];
if(id[0]==c[i])continue;
if(f[id[0]]<f[c[i]])id[1]=id[0],id[0]=c[i];
else if(f[id[1]]<f[c[i]])id[1]=c[i];
}
}
LL res=0;
for(int i=0;i<=n;++i)res=max(res,dp[i]);
printf("%lld\n",res);
}
signed main(){
n=read(),q=read();
for(int i=1;i<=n;++i)v[i]=read();
for(int i=1;i<=n;++i)c[i]=read();
while(q--){
int x=read(),y=read();
solve(x,y);
}
}```
SP8093 JZPGYZ - Sevenk Love Oimaster.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define T (N<<1)
#define M 360005
int n,m;
int trans[T][26],link[T],mxlen[T],tot=1,tag[T],cnt[T];
string S[10005];
int extend(int c,int lst){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;++i){
cin>>S[i];
for(int lst=1,len=S[i].length(),j=0;j<len;++j)
lst=extend(S[i][j]-'a',lst);
}
for(int i=1;i<=n;++i){
static int now,u;
now=1;
for(int j=0,len=S[i].length();j<len;++j){
now=trans[now][S[i][j]-'a'],u=now;
while(u&&tag[u]!=i)tag[u]=i,++cnt[u],u=link[u];
}
}
while(m--){
int u=1;string S;
cin>>S;
for(int i=0,len=S.length();i<len;++i)u=trans[u][S[i]-'a'];
printf("%d\n",cnt[u]);
}
return 0;
}```
P6378 [PA2010]Riddle.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=4000010;
const int M=N*6;
int n,m,k,cnt,a[N];
struct edge {
int nxt,to;
}e[M];
int head[N],num_edge;
void addedge(int fr,int to) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
int dfn[N],timer,low[N],scc[N],st[N],top,Col;
void tarjan(int u) {
dfn[u]=low[u]=++timer,st[++top]=u;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]) {
scc[u]=++Col;
while(st[top]!=u)scc[st[top--]]=Col;
--top;
}
}
//1->n:key
//n+1->2n:not key
//2n+1->3n:pre key
//3n+1->4n:no key pre
signed main() {
n=rd(),m=rd(),k=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
addedge(x+n,y),addedge(y+n,x);
}
for(int i=1;i<=k;++i) {
for(int j=1,num=rd();j<=num;++j) {
a[j]=rd();
addedge(a[j]+3*n,a[j]+n);
addedge(a[j],a[j]+2*n);
if(j==1)continue;
addedge(a[j],a[j-1]+3*n);
addedge(a[j-1]+2*n,a[j]+n);
addedge(a[j-1]+2*n,a[j]+2*n);
addedge(a[j]+3*n,a[j-1]+3*n);
}
}
for(int i=1;i<=(n<<2);++i)if(!dfn[i])tarjan(i);
for(int i=1;i<=n;++i)if(scc[i]==scc[i+n]||scc[i+2*n]==scc[i+3*n])return puts("NIE"),0;
return puts("TAK"),0;
}```
P2052 [NOI2011]道路修建.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e6+10;
int n,siz[N];
LL ans;
int head[N],num_edge;
struct edge {
int val,to,nxt;
}e[N<<1];
void addedge(int from,int to,int val) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
e[num_edge].val=val;
head[from]=num_edge;
}
void dfs(int u,int ft) {
siz[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs(v,u);
siz[u]+=siz[v];
ans+=1ll*e[i].val*abs(n-(siz[v]<<1));
}
}
signed main() {
n=rd();
for(rint i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
dfs(1,0);
cout<<ans<<endl;
return 0;
}
```
CF1030E Vasya and Good Sequences.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n,c[N],cnt[2],s[N];
LL ans;
signed main(){
scanf("%d",&n);
rep(i,1,n){
LL x;scanf("%lld",&x);
while(x)x^=x&-x,++c[i];
s[i]=s[i-1]^(c[i]&1);
}
rep(i,1,n){
int mx=0,sum=0;
per(j,i,max(i-63,1)){
ckmax(mx,c[j]),sum+=c[j];
if(mx*2<=sum&&s[j-1]==s[i])++ans;
}
if(i>=64)ans+=cnt[s[i]],++cnt[s[i-64]];
}
printf("%lld\n",ans);
return 0;
}```
P5280 [ZJOI2019]线段树.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N = 100005;
const int T = N << 3;
LL f[T], g[T], tg1[T], tg2[T], sum[T], pw;
int n, m;
#define lc(p) ((p) << 1)
#define rc(p) ((p) << 1 | 1)
void pushup(int p) {
sum[p] = (sum[lc(p)] + sum[rc(p)] + f[p]) % mod;
}
void build(int l = 1, int r = n, int p = 1) {
f[p] = 0, g[p] = 1, tg1[p] = tg2[p] = 1, sum[p] = 0;
if(l == r) return;
int mid = (l + r) >>1;
build(l, mid, lc(p)), build(mid + 1, r, rc(p));
}
void addtg1(int p, int d) {
tg1[p] = 1ll * tg1[p] * d % mod;
f[p] = 1ll * f[p] * d % mod;
sum[p] = 1ll * sum[p] * d % mod;
}
void addtg2(int p, int d) {
tg2[p] = 1ll * tg2[p] * d % mod;
g[p] = 1ll * g[p] * d % mod;
}
void pushdown(int p) {
if(tg1[p] != 1)
addtg1(lc(p), tg1[p]), addtg1(rc(p), tg1[p]), tg1[p] = 1;
if(tg2[p] != 1)
addtg2(lc(p), tg2[p]), addtg2(rc(p), tg2[p]), tg2[p] = 1;
}
void update(int ql, int qr, int l = 1, int r = n, int p = 1) {
pushdown(p);
if(ql <= l && r <= qr) {
f[p] = (f[p] + pw) % mod;
addtg1(lc(p), 2), addtg1(rc(p), 2), pushup(p);
return;
}
int mid = (l + r) >> 1;
g[p] = (g[p] + pw) % mod;
if(qr <= mid) {
update(ql, qr, l, mid, lc(p));
f[rc(p)] = (pw - g[rc(p)] + f[rc(p)] + mod) % mod, g[rc(p)] = 2ll * g[rc(p)] % mod;
pushdown(rc(p));
addtg1(lc(rc(p)), 2), addtg2(lc(rc(p)), 2);
addtg1(rc(rc(p)), 2), addtg2(rc(rc(p)), 2);
pushup(rc(p)), pushup(p);
return;
}
if(ql > mid) {
update(ql, qr, mid + 1, r, rc(p));
f[lc(p)] = (pw - g[lc(p)] + f[lc(p)] + mod) % mod, g[lc(p)] = 2ll * g[lc(p)] % mod;
pushdown(lc(p));
addtg1(lc(lc(p)), 2), addtg2(lc(lc(p)), 2);
addtg1(rc(lc(p)), 2), addtg2(rc(lc(p)), 2);
pushup(lc(p)), pushup(p);
return;
}
update(ql, qr, l, mid, lc(p)), update(ql, qr, mid + 1, r, rc(p));
pushup(p);
}
signed main() {
n = read(), m = read();
build(), pw = 1;
for(int i = 1; i <= m; ++i) {
int op = read();
if(op == 2) printf("%lld\n", sum[1]);
else {
int x = read(), y = read();
update(x, y), pw = (pw + pw) % mod;
}
}
}```
CF666E Forensic Examination.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 550005
int n,m;
char str[N];
namespace seg{
#define T (N*21*2)
int ls[T],rs[T],tot;
struct node{
int mx,id;
node(){mx=id=0;}
node(int mx_,int id_){mx=mx_,id=id_;}
inline bool operator < (const node&t)const{return mx==t.mx?id>t.id:mx<t.mx;}
}v[T];
void pushup(int p){v[p]=max(v[ls[p]],v[rs[p]]);}
void update(int&p,int id,int l=1,int r=m){
if(!p)p=++tot;
if(l==r)return v[p]=node(++v[p].mx,id),void();
int mid=(l+r)>>1;
if(id<=mid)update(ls[p],id,l,mid);
else update(rs[p],id,mid+1,r);
pushup(p);
}
int merge(int x,int y,int l=1,int r=m){
if(!x||!y)return x|y;
if(l==r)return v[++tot]=node(v[x].mx+v[y].mx,v[x].id),tot;
int mid=(l+r)>>1,p=++tot;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return pushup(p),p;
}
node query(int p,int ql,int qr,int l=1,int r=m){
if(!p)return node(0,0);
if(ql<=l&&r<=qr)return v[p];
int mid=(l+r)>>1;
if(qr<=mid)return query(ls[p],ql,qr,l,mid);
if(mid<ql)return query(rs[p],ql,qr,mid+1,r);
return max(query(ls[p],ql,qr,l,mid),query(rs[p],ql,qr,mid+1,r));
}
#undef T
}
namespace sam{
#define T (N<<1)
int trans[T][26],link[T],mxlen[T],tot=1,lst,to[N];
int fa[20][T],rt[T];
vector<int>e[T];
int extend(int c,int id,int index){
if(trans[lst][c]){
int p=lst,q=trans[lst][c];
if(mxlen[p]+1==mxlen[q]){
if(id)seg::update(rt[q],id);
else to[index]=q;
return q;
}else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
if(id)seg::update(rt[nq],id);
else to[index]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
if(id)seg::update(rt[np],id);
else to[index]=np;
return np;
}
void insert(char*str,int id){
lst=1;
for(int i=0,n=strlen(str);i<n;++i)lst=extend(str[i]-'a',id,i);
}
void dfs(int u,int dep){
for(int i=1;1<<i<=dep;++i)fa[i][u]=fa[i-1][fa[i-1][u]];
for(int v:e[u])fa[0][v]=u,dfs(v,dep+1),rt[u]=seg::merge(rt[u],rt[v]);
}
void init(){
for(int i=1;i<=tot;++i)e[link[i]].pb(i);
dfs(1,1);
}
void solve(int l,int r,int pl,int pr){
int u=to[pr-1];
for(int i=19;i>=0;--i)if(mxlen[fa[i][u]]>=pr-pl+1)u=fa[i][u];
seg::node tmp=seg::query(rt[u],l,r);
if(tmp.id)printf("%d %d\n",tmp.id,tmp.mx);
else printf("%d 0\n",l);
}
#undef T
}
signed main(){
scanf("%s",str),n=strlen(str),sam::insert(str,0);
m=read();
for(int i=1;i<=m;++i)
scanf("%s",str),sam::insert(str,i);
sam::init();
for(int q=read();q;--q){
int l=read(),r=read(),pl=read(),pr=read();
sam::solve(l,r,pl,pr);
}
return 0;
}```
松式基排.cpp
```void Sort(unsigned int*a,int n){
static unsigned int _b[N];
static unsigned int*b=_b;
static int cnt[256];
for(int i=0;i<32;i+=8){
memset(cnt,0,sizeof(cnt));
for(int j=n-1;j>=0;--j)++cnt[(a[j]>>i)&255];
for(int j=0;j<256;++j)cnt[j]+=cnt[j-1];
for(int j=n-1;j>=0;--j)b[--cnt[(a[j]>>i)&255]]=a[j];
swap(a,b);
}
}```
CF1101G (Zero XOR Subset)-less.cpp
```//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse")
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
int n,a[N],d[35],ele;
void add(int x) {
for(rint i=30;i>=0;--i) {
if(x&(1<<i)) {
if(d[i])x^=d[i];
else {++ele,d[i]=x;break;}
}
}
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd()^a[i-1];
if(!a[n])return puts("-1"),0;
for(rint i=1;i<=n;++i)add(a[i]);
printf("%d\n",ele);
return 0;
}```
CF515C Drazil and Factorial.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 20
char s[N];
int n,cnt[N];
void f(int x){
if(x==2)++cnt[2];
else if(x==3)++cnt[3];
else if(x==4)++cnt[3],cnt[2]+=2;
else if(x==5)++cnt[5];
else if(x==6)++cnt[5],++cnt[3];
else if(x==7)++cnt[7];
else if(x==8)++cnt[7],cnt[2]+=3;
else if(x==9)++cnt[7],cnt[3]+=2,++cnt[2];
}
signed main(){
n=read(),scanf("%s",s+1);
for(int i=1;i<=n;++i)f(s[i]-'0');
for(int i=1;i<=cnt[7];++i)putchar('7');
for(int i=1;i<=cnt[5];++i)putchar('5');
for(int i=1;i<=cnt[3];++i)putchar('3');
for(int i=1;i<=cnt[2];++i)putchar('2');
puts("");
}```
CF321B Ciel and Duel.cpp
```#include<bits/stdc++.h>
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
char rdc(){
char ch=getchar();
while(ch!='A'&&ch!='D')ch=getchar();
return ch;
}
#define pb push_back
#define sz(v) (int)v.size()
const int N=105;
int n,m,ans;
bool vis[N];
std::vector<int>A,D,V;
int solve1(){//不打完
int res=0;
for(int i=sz(V)-1,j=0;i>=0&&j<sz(A)&&V[i]>=A[j];--i,++j)res+=V[i]-A[j];
return res;
}
int solve2(){//打完
memset(vis,0,sizeof(vis));
int i,j,res=0;
for(i=0,j=0;j<sz(D);++i,++j){
while(i<sz(V)&&(V[i]<=D[j]||vis[i]))++i;
if(i>=sz(V))return 0;
vis[i]=1;
}
for(i=0,j=0;j<sz(A);++i,++j){
while(i<sz(V)&&(V[i]<A[j]||vis[i]))++i;
if(i>=sz(V))return 0;
vis[i]=1,res+=V[i]-A[j];
}
for(i=0;i<sz(V);++i)if(!vis[i])res+=V[i];
return res;
}
signed main(){
n=read(),m=read();
for(int i=0;i<n;++i)
if(rdc()=='A')A.pb(read());
else D.pb(read());
for(int i=0;i<m;++i)V.pb(read());
std::sort(V.begin(),V.end());
std::sort(A.begin(),A.end());
std::sort(D.begin(),D.end());
printf("%d\n",std::max(solve1(),solve2()));
}//```
CF455B A Lot of Games.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,k,tot,ch[N][26],fa[N];
char str[N];
bool can[2][N];
void insert(char*str){
int len=strlen(str),u=0,dep=0;
rep(i,0,len-1){
int c=str[i]-'a';
if(!ch[u][c])ch[u][c]=++tot,fa[tot]=u;
u=ch[u][c],++dep;
}
can[0][u]=1,can[1][u]=0;//can[0][i]:存在必败策略；can[1][i]：存在必胜策略
}
signed main(){
n=read(),k=read();
rep(i,1,n){
static char str[N];
scanf("%s",str),insert(str);
}
per(i,tot,1)can[0][fa[i]]|=!can[0][i],can[1][fa[i]]|=!can[1][i];
if(can[0][0]&&can[1][0])puts("First");
else if(!can[0][0]&&can[1][0])puts(k&1?"First":"Second");
else puts("Second");
}```
P5824 十二重计数法.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
const int N=200005;
const int M=N<<2;
int n,m;
int S2[M],zkyAK[M];
namespace math{
int fac[M],ifc[M],inv[M];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
void initmath(const int&n=M-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using namespace math;
namespace poly{
int rev[M],rt[M],lim;
void initpoly(const int&n){
static int lg;
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
for(int i=1;i<lim;i<<=1){
int w=qpow(3,(mod-1)/(i<<1));rt[i]=1;
for(int j=1;j<i;++j)rt[i+j]=1ll*rt[i+j-1]*w%mod;
}
}
void NTT(int*a,int op){
if(!op)reverse(a+1,a+lim);
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
for(int j=0;j<lim;j+=i<<1){
for(int k=0;k<i;++k){
const int X=a[j+k],Y=1ll*rt[i+k]*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(!op)for(int i=0,iv=qpow(lim,mod-2);i<lim;++i)a[i]=1ll*iv*a[i]%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];initpoly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void poly_inv(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=qpow(f[0],mod-2),void();
poly_inv(g,f,(n+1)>>1),initpoly(n<<1);
cpy(A,f,n),clr(A+n,lim-n),clr(g+n,lim-n);
NTT(A,1),NTT(g,1);
for(int i=0;i<lim;++i)g[i]=1ll*g[i]*(2+mod-1ll*A[i]*g[i]%mod)%mod;
NTT(g,0),clr(g+n,lim-n);
}
void dao(int*g,int*f,int n){
for(int i=0;i<n;++i)g[i]=1ll*f[i+1]*(i+1)%mod;g[n-1]=0;
}
void jif(int*g,int*f,int n){
for(int i=1;i<=n;++i)g[i]=1ll*f[i-1]*inv[i]%mod;g[0]=0;
}
void poly_ln(int*g,int*f,int n){
static int A[M];
clr(A,n),poly_inv(A,f,n),dao(g,f,n),poly_mul(A,g,A,n,n),jif(g,A,n);
}
void poly_exp(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=1,void();
poly_exp(g,f,(n+1)>>1);
poly_ln(A,g,n);
A[0]=1;for(int i=1;i<n;++i)A[i]=(f[i]-A[i]+mod)%mod;
poly_mul(A,g,g,n,n),clr(g+n,lim-n);
}
void stirling2_row(int*g,int n){
static int A[M];
for(int i=0;i<=n;++i)A[i]=1ll*qpow(i,n)*ifc[i]%mod;
for(int i=0;i<=n;++i)g[i]=i&1?mod-ifc[i]:ifc[i];
poly_mul(A,g,A,n+1,n+1);
cpy(g,A,n+1);
}
void initpart4(int*g,int n,int m){
static int A[M];
clr(A,n);
for(int i=1;i<=m;++i)
for(int j=1;i*j<n;++j)
fmod(A[i*j]+=inv[j]);
clr(g,n),poly_exp(g,A,n);
}
}
void solve1(){printf("%d\n",qpow(m,n));}
void solve2(){printf("%lld\n",1ll*comb(m,n)*fac[n]%mod);}
void solve3(){printf("%lld\n",1ll*fac[m]*S2[m]%mod);}
void solve4(){
int res=0;
for(int i=1;i<=m;++i)res=(res+S2[i])%mod;
printf("%d\n",res);
}
void solve5(){printf("%d\n",n<=m?1:0);}
void solve6(){printf("%d\n",S2[m]);}
void solve7(){printf("%d\n",comb(n+m-1,m-1));}
void solve8(){printf("%d\n",comb(m,n));}
void solve9(){printf("%d\n",n<m?0:comb(n-1,m-1));}
void solve10(){printf("%d\n",zkyAK[n]);}
void solve11(){printf("%d\n",n>m?0:1);}
void solve12(){printf("%d\n",n<m?0:zkyAK[n-m]);}
signed main(){
initmath();
n=read(),m=read();
poly::stirling2_row(S2,n);
poly::initpart4(zkyAK,n+1,m);
solve1(),solve2(),solve3(),solve4(),solve5(),solve6(),
solve7(),solve8(),solve9(),solve10(),solve11(),solve12();
}```
CF1344A Hilbert's Hotel.cpp
```#include<bits/stdc++.h>
#define ll long long
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define _rep(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define db double
#define N 200005
int n,cnt[N];
signed main(){
int T;std::cin>>T;
while(T--){
std::cin>>n;
for(int i=0;i<n;++i)cnt[i]=0;;
for(int i=0,x;i<n;++i){
std::cin>>x,x+=i;
++cnt[(x%n+n)%n];
}
bool flg=0;
for(int i=0;i<n;++i)if(cnt[i]>1){flg=1;break;}
if(flg)std::cout<<"NO\n";
else std::cout<<"YES\n";
}
return 0;
}```
CF527D Clique Problem.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,las=-1e9-7,ans;
struct node{
int l,r;
}a[N];
bool cmp(const node &a,const node &b) {
return a.r^b.r?a.r<b.r:a.l<b.l;
}
int main() {
scanf("%d",&n);
for(int i=1,x,w;i<=n;++i)
scanf("%d%d",&x,&w),a[i].l=x-w,a[i].r=x+w;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)
if(las<=a[i].l)++ans,las=a[i].r;
printf("%d\n",ans);
return 0;
}```
AT2686 [ARC080A] 4-adjacent.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int a[N],n,cnt[4],b[N];
int change(int x){
int res=0;
while(!(x&1))x>>=1,++res;
return ckmin(res,2),res;
}
signed main(){
n=read();
rep(i,1,n)++cnt[a[i]=change(read())];
if(cnt[0]){
if(cnt[1]){
if(!cnt[2])return puts("No"),0;
--cnt[2];
}
puts(cnt[2]+1>=cnt[0]?"Yes":"No");
}else{
if(!cnt[2]&&cnt[1]==1)puts("No");
else puts("Yes");
}
return 0;
}```
P4199 万径人踪灭.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
const int mod=998244353;
const int P=1e9+7;
int qpow(int n,int k,int p=mod) {
int res=1;
while(k) {
if(k&1)res=1ll*res*n%p;
n=1ll*n*n%p,k>>=1;
}
return res;
}
const int G=3;
const int IG=qpow(G,mod-2);
int A[N],B[N],n,ans,C[N];
char s[N],t[N];
int lim,lg,rev[N];
int hw[N],m;
void init(int n) {
for(lim=1,lg=0;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int g,int op=0) {
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1) {
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=(i<<1)) {
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod) {
int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(!op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
void change() {
t[m++]='~',t[m++]='|';
for(int i=0;i<n;++i)t[m++]=s[i],t[m++]='|';
t[m++]=0;
}
void manacher() {
change();
int mxr=0,mid=0,sum=0;
for(int i=0;i<m;++i) {
if(i<mxr)hw[i]=min(mxr-i,hw[(mid<<1)-i]);
while(t[i+hw[i]]==t[i-hw[i]])++hw[i];
if(i+hw[i]>mxr)mxr=i+hw[i],mid=i;
sum=(sum+(hw[i]>>1))%P;
}
ans=(ans-sum)%P;
}
signed main() {
scanf("%s",s),n=strlen(s);
for(int i=0;i<n;++i)A[i]=s[i]=='a',B[i]=s[i]=='b';
init(n<<1),NTT(A,G),NTT(B,G);
for(int i=0;i<lim;++i)A[i]=1ll*A[i]*A[i]%mod,B[i]=1ll*B[i]*B[i]%mod;
NTT(A,IG,1),NTT(B,IG,1);
for(int i=0;i<lim;++i)C[i]=((A[i]+1)>>1)+((B[i]+1)>>1);
for(int i=0;i<lim;++i)ans=(ans+qpow(2,C[i],P)-1)%P;
manacher();
printf("%d\n",(ans%P+P)%P);
return 0;
}
```
CF1096E The Top Scorer.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int mod=998244353;
const int N=10005;
int p,s,r,ans;
int jc[N],jv[N],inv[N];
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void init(const int&N){
jc[0]=1;
for(int i=1;i<=N;++i)jc[i]=1ll*jc[i-1]*i%mod;
jv[N]=qpow(jc[N],mod-2);
for(int i=N-1;i>=0;--i)jv[i]=1ll*jv[i+1]*(i+1)%mod;
inv[1]=1;
for(int i=2;i<=N;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
}
int C(int n,int m){return 1ll*jc[n]*jv[m]%mod*jv[n-m]%mod;}
int g(int n,int m){return C(n+m-1,m-1);}//sum of m non-neg integers=n
int f(int x,int y,int z){//number=x,sum=y,limit=z
if(!x&&!y)return 1;
int res=0,flg=(x&1)?-1:1;
for(int i=0;i<=x;++i,flg*=-1)
if(y-(z+1)*(x-i)>=0)res=(res+1ll*flg*C(x,i)*g(y-(z+1)*(x-i),x)%mod)%mod;
return res;
}
signed main(){
init(6000);
p=read(),s=read(),r=read();
for(int i=r;i<=s;++i){
for(int j=0;(j+1)*i<=s&&j<p;++j){
ans=(ans+1ll*C(p-1,j)*f(p-j-1,s-(j+1)*i,i-1)%mod*inv[j+1]%mod)%mod;
}
}
ans=1ll*ans*qpow(C(s-r+p-1,p-1),mod-2)%mod;
printf("%d\n",ans);
return 0;
}```
P5025 [SNOI2017]炸弹.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500010;
const int M=N<<2;
const int mod=1e9+7;
int n,pos[N],ans;
LL x[N],r[N];
int lp[M],rp[M],Lp[M],Rp[M];
int head[M],num_edge;
int dfn[M],low[M],timer,st[M],top,C,scc[M];
int ind[M],numnode;
struct edge {
int nxt,to;
}e[N*25];
vector<int>g[M];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
#define lc (p<<1)
#define rc (p<<1|1)
void build(int l,int r,int p) {
lp[p]=l,rp[p]=r,numnode=max(numnode,p);
if(l==r)return void(pos[l]=p);
int mid=(l+r)>>1;
addedge(p,lc),addedge(p,rc);
build(l,mid,lc),build(mid+1,r,rc);
}
void update(int ql,int qr,int l,int r,int p,int k) {
if(ql<=l&&r<=qr) {
addedge(k,p);return;
}
int mid=(l+r)>>1;
if(mid>=ql)update(ql,qr,l,mid,lc,k);
if(mid<qr)update(ql,qr,mid+1,r,rc,k);
}
void tarjan(int u) {
dfn[u]=low[u]=++timer,st[++top]=u;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u]) {
scc[u]=++C,Lp[C]=lp[u],Rp[C]=rp[u];
while(st[top]!=u)scc[st[top]]=C,Lp[C]=min(Lp[C],lp[st[top]]),Rp[C]=max(Rp[C],rp[st[top]]),--top;
--top;
}
}
void buildDAG() {
for(rint u=1;u<=numnode;++u) {
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(scc[u]!=scc[v])g[scc[v]].pb(scc[u]),++ind[scc[u]];
}
}
}
void topo() {
queue<int>q;
for(rint i=1;i<=C;++i)if(!ind[i])q.push(i);
while(!q.empty()) {
int u=q.front();q.pop();
for(uint i=0;i<g[u].size();++i) {
int v=g[u][i];
Lp[v]=min(Lp[v],Lp[u]);
Rp[v]=max(Rp[v],Rp[u]);
--ind[v];
if(!ind[v])q.push(v);
}
}
}
signed main() {
n=rd();build(1,n,1);
for(rint i=1;i<=n;++i)x[i]=rd(),r[i]=rd();
for(rint i=1;i<=n;++i) {
int lp=lower_bound(x+1,x+i+1,x[i]-r[i])-x;
int rp=upper_bound(x+i,x+n+1,x[i]+r[i])-x-1;
update(lp,rp,1,n,1,pos[i]);
}
tarjan(1),buildDAG(),topo();
for(rint i=1;i<=n;++i)ans=(ans+(Rp[scc[pos[i]]]-Lp[scc[pos[i]]]+1)*i)%mod;
printf("%lld\n",ans);
return 0;
}```
README.md
```# my source code
I'm a OIer, and I practice almost everyday. One day one of my friends met a problem that each program he coded couldn't be extracted. This reminds me that recording my programs is necessary.I will move programs to this repository continously and this repository isn't completed yet.The repository will include several thousands charactors when it is completed. Most of the problems are found on <www.luogu.com.cn>
我用这个仓库来存储自己平时训练所做的题,以防丢失,毕竟自己几千k的代码也是笔财富(.
代码还没搬全.
以 [洛谷](www.luogu.com.cn) 的题为主。
```
P7328 [w33z-2018] Dream and Machine Learning.py
```class nd:
e = 0
r = 0
N = 100005
a = [nd() for i in range(N)]
# nmd, I is a English men. I don't know how to use sort!!!
def msort(l, r) :
if (r - l <= 1) :
return
mid = (l + r) / 2
msort(l, mid)
msort(mid, r)
i = l
j = mid
b=[]
while i < mid and j < r :
if a[i].e < a[j].e :
b.append(a[i])
i += 1
else :
b.append(a[j])
j += 1
while i < mid :
b.append(a[i])
i += 1
while j < r :
b.append(a[j])
j += 1
for i in range(l, r) :
a[i] = b[i - l]
def gcd(x, y) :
while y > 0 :
t = x % y
x = y
y = t
return x
s = raw_input().split()
b = int(s[0])
n = int(s[1])
q = int(s[2])
for i in range(n) :
s = raw_input().split()
a[i].e = int(s[0])
a[i].r = int(s[1])
msort(0, n)
c = []
cnt = 0
for i in range(n - 1) :
if a[i].e > 1000 and a[i + 1].e - a[i].e < 10000 :
c.append(a[i].r * pow(b, a[i + 1].e - a[i].e) - a[i + 1].r)
cnt += 1
if cnt >= 5 :
break
m = c[0]
for i in c :
m = gcd(m, i)
for i in range(q) :
x = int(input())
print pow(b, x, m)```
CF388D Fox and Perfect Sets.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
inline int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,dp[35][35][2],ans;
signed main(){
cin>>n;
dp[30][0][1]=1;
for(int i=30;i>=1;--i){
for(int j=30;j>=0;--j){
fmod(dp[i-1][j][0]+=(1ll<<j)*dp[i][j][0]%mod);
fmod(dp[i-1][j+1][0]+=dp[i][j][0]);
int x,y;
if(!j)x=1,y=0;
else x=y=1ll<<(j-1);
if(!(n>>(i-1)&1)){
fmod(dp[i-1][j][1]+=1ll*x*dp[i][j][1]%mod);
}else{
fmod(dp[i-1][j+1][1]+=dp[i][j][1]);
fmod(dp[i-1][j][0]+=1ll*x*dp[i][j][1]%mod);
fmod(dp[i-1][j][1]+=1ll*y*dp[i][j][1]%mod);
}
}
}
for(int i=0;i<=30;++i)fmod(ans+=dp[0][i][0]),fmod(ans+=dp[0][i][1]);
cout<<ans<<'\n';
}```
P2144 [FJOI2007]轮状病毒.py
```def det(n, a):
res = 1
for i in range(n):
for j in range(i + 1, n):
while a[j][i] != 0:
div = a[i][i] / a[j][i]
for k in range(i, n):
a[i][k] -= a[j][k] * div
tmp = a[i][k]
a[i][k] = a[j][k]
a[j][k] = tmp
res *= -1
res *= a[i][i]
return res
n = int(input())
if n == 1:
print 1
exit()
if n == 2:
print 5
exit()
a = [[0 for i in range(n + 1)]for i in range(n + 1)]
for i in range(0, n):
a[i][i] = 3
if i == 0:
a[i][n - 1] = -1
else:
a[i][i - 1] = -1
if i == n - 1:
a[i][0] = -1
else:
a[i][i + 1] = -1
a[i][n] = -1
a[n][n] = n
for i in range(0, n):
a[n][i] = -1
print det(n, a)```
P5686 [CSP-SJX2019]和积和.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
const int mod=1e9+7;
int fmod(int&x){x-=mod,x+=x>>31&mod;}
int n,a[N],b[N];
int ans[N],sa,sb,lst,sum;
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=read();
for(int i=1;i<=n;++i)b[i]=read();
for(int i=1;i<=n;++i){
fmod(ans[i]+=1ll*a[i]*b[i]%mod*i%mod);
fmod(ans[i]+=1ll*a[i]*sb%mod);
fmod(ans[i]+=1ll*b[i]*sa%mod);
fmod(sa+=1ll*i*a[i]%mod),fmod(sb+=1ll*i*b[i]%mod);
fmod(ans[i]+=ans[i-1]);
}
for(int i=1;i<=n;++i)fmod(sum+=ans[i]);
printf("%d\n",sum);
return 0;
}```
P2152 [SDOI2009]SuperGCD.py
```
def gcd(x, y) :
while y > 0 :
t = x % y
x = y
y = t
return x
x=input()
y=input()
print gcd(x,y)```
CF522D Closest Equals.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=500005;
int n,m,a[N],ans[N],bel[N],S,num,L[N],R[N],lsh[N],len,nxt[N],pre[N],id[N],now;
struct QUE{int l,r,id;}q[N];
inline bool cmp(const QUE&a,const QUE&b){
return bel[a.l]==bel[b.l]?a.r<b.r:a.l<b.l;
}
void brute(int k){
int res=N;
rep(i,q[k].l,q[k].r)if(pre[i]>=q[k].l)ckmin(res,i-pre[i]);
ans[q[k].id]=res==N?-1:res;
}
void addr(int i,int l){if(pre[i]>=l)ckmin(now,i-pre[i]);}
void addl(int i,int r){if(nxt[i]<=r)ckmin(now,nxt[i]-i);}
signed main(){
n=read(),m=read(),S=sqrt(n-1)+1,num=(n-1)/S+1;
rep(i,1,n)a[i]=lsh[i]=read();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
rep(i,1,n)a[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
fill(id+1,id+len+1,0);rep(i,1,n)pre[i]=id[a[i]],id[a[i]]=i;
fill(id+1,id+len+1,n+1);per(i,n,1)nxt[i]=id[a[i]],id[a[i]]=i;
rep(i,1,num)L[i]=R[i-1]+1,R[i]=i*S;R[num]=n;
rep(i,1,num)rep(j,L[i],R[i])bel[j]=i;
rep(i,1,m)q[i].id=i,q[i].l=read(),q[i].r=read();
sort(q+1,q+m+1,cmp);
for(int i=1,l=1,r=0,lst=0;i<=m;++i){
if(bel[q[i].l]==bel[q[i].r]){brute(i);continue;}
if(lst!=bel[q[i].l])lst=bel[q[i].l],now=N,l=R[bel[q[i].l]]+1,r=l-1;
while(r<q[i].r)addr(++r,l);
int l_=l,tmp=now;
while(l_>q[i].l)addl(--l_,r);
ans[q[i].id]=now==N?-1:now,now=tmp;
}
rep(i,1,m)printf("%d\n",ans[i]);
return 0;
}```
CF1081B Farewell Party.cpp
```// Problem: B. Farewell Party
// Contest: Codeforces - Avito Cool Challenge 2018
// URL: https://codeforces.com/contest/1081/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,a[N],b[N],col,ans[N];
vector<int>v[N];
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=n-read(),v[a[i]].pb(i);
for(int i=1;i<=n;++i){
if(!v[i].size())continue;
if(v[i].size()%i)return puts("Impossible"),0;
for(int j=0,up=sz(v[i]);j<up;j+=i){
++col;
for(int k=j;k<j+i;++k)ans[v[i][k]]=col;
}
}
puts("Possible");
rep(i,1,n)printf("%d ",ans[i]);
return 0;
}```
P3920 [WC2014]紫荆花之恋.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline int min(const int &a,const int &b) {return a<b?a:b;}
inline int max(const int &a,const int &b) {return a>b?a:b;}
const int N=100010;
const int M=4000010;
const int mod=1000000000;
const double alpha=0.8;
const double beta=0.7;
int n,val[N];
LL ans;
int head[N],num_edge;
int fa[18][N],bin[18],dep[N],dist[N];
int mx[N],siz[N],root,vt[N],totsize;
bool used[N];
int rub[M],rub_top,st[M],st_top,num_node;
int sz[M],ch[M][2],key[M];
int t1[N],t2[N];
vector<int>to[N];
struct egde {
int to,nxt;
}e[N<<1];
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
int lca(int x,int y) {
if(dep[x]<dep[y])x^=y^=x^=y;
int delta=dep[x]-dep[y];
for(rint i=17;i>=0;--i)if(delta&bin[i])x=fa[i][x];
if(x==y)return x;
for(rint i=17;i>=0;--i)if(fa[i][x]!=fa[i][y])x=fa[i][x],y=fa[i][y];
return fa[0][x];
}
LL dis(int x,int y) {return dist[x]+dist[y]-(dist[lca(x,y)]<<1);}
void push_in_rub(int u) {
if(!u)return;
push_in_rub(ch[u][0]);
rub[++rub_top]=u;
push_in_rub(ch[u][1]);
ch[u][0]=ch[u][1]=sz[u]=key[u]=0;
}
void pushup(int u) {
sz[u]=sz[ch[u][0]]+sz[ch[u][1]]+1;
}
void push_in_st(int u) {
if(!u)return;
push_in_st(ch[u][0]);
st[++st_top]=u;
push_in_st(ch[u][1]);
ch[u][0]=ch[u][1]=0;
}
int getnew() {
return rub_top?rub[rub_top--]:++num_node;
}
void build(int &x,int l,int r) {
if(l>r)return;
int mid=(l+r)>>1;
x=st[mid];sz[x]=r-l+1;
build(ch[x][0],l,mid-1);
build(ch[x][1],mid+1,r);
}
void rebuild(int &u) {
st_top=0;push_in_st(u);
build(u,1,st_top);
}
void insert(int &u,int val) {
if(!u) {u=getnew(),key[u]=val,sz[u]=1;return;}
if(val<=key[u])insert(ch[u][0],val);
else insert(ch[u][1],val);
pushup(u);
if(sz[ch[u][0]]>1.0*sz[u]*beta)rebuild(u);
if(sz[ch[u][1]]>1.0*sz[u]*beta)rebuild(u);
}
int rk(int u,int val) {
int res=0,now=u;
while(now) {
if(key[now]<val)res+=sz[ch[now][0]]+1,now=ch[now][1];
else now=ch[now][0];
}
return res;
}
void getroot(int u,int ft) {
mx[u]=0,siz[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||used[v])continue;
getroot(v,u);
siz[u]+=siz[v];
mx[u]=max(mx[u],siz[v]);
}
mx[u]=max(mx[u],totsize-siz[u]);
if(mx[root]>mx[u])root=u;
}
void calc(int u,int ft,int Vt) {
insert(t1[Vt],dis(u,Vt)-val[u]);
if(vt[Vt])insert(t2[Vt],dis(u,vt[Vt])-val[u]);
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft||used[v])continue;
calc(v,u,Vt);
}
}
void dfs_build(int u) {
calc(u,0,u);used[u]=1;
for(rint i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(used[v])continue;
totsize=siz[v];
root=0;
getroot(v,0);
vt[root]=u;
to[u].push_back(root);
dfs_build(root);
}
}
void dfs_pia(int u) {
++totsize;used[u]=0;
push_in_rub(t1[u]);
push_in_rub(t2[u]);
t1[u]=t2[u]=0;
for(rint i=0;i<to[u].size();++i)
dfs_pia(to[u][i]);
to[u].clear();
}
void dfs_rebuild(int u) {
totsize=0;dfs_pia(u);root=0;getroot(u,0);
if(vt[u])
for(rint i=0;i<to[vt[u]].size();++i)
if(to[vt[u]][i]==u)to[vt[u]][i]=root;
vt[root]=vt[u];dfs_build(root);
}
void dfs_insert(int x) {
for(rint i=x;vt[i];i=vt[i]) {
int tmp=val[x]-dis(x,vt[i])+1;
ans+=rk(t1[vt[i]],tmp)-rk(t2[i],tmp);
}
for(rint i=x;i;i=vt[i]) {
insert(t1[i],dis(i,x)-val[x]);
if(vt[i])insert(t2[i],dis(x,vt[i])-val[x]);
}
int res=0;
for(rint i=x;vt[i];i=vt[i])
if(sz[t1[i]]>1.0*sz[t1[vt[i]]]*alpha)res=vt[i];
if(res)dfs_rebuild(res);
}
signed main() {
rd(),n=rd();
bin[0]=1;for(rint i=1;i<=17;++i)bin[i]=bin[i-1]<<1;
mx[root=0]=n;
for(rint i=1;i<=n;++i) {
vt[i]=fa[0][i]=(rd()^(ans%mod));
int c=rd();val[i]=rd();used[i]=1;
dep[i]=dep[fa[0][i]]+1;
dist[i]=dist[fa[0][i]]+c;
for(rint j=1;j<=17;++j)fa[j][i]=fa[j-1][fa[j-1][i]];
if(vt[i])to[vt[i]].push_back(i),addedge(i,fa[0][i]),addedge(fa[0][i],i);
dfs_insert(i);printf("%lld\n",ans);
}
return 0;
}
```
P3603 雪辉.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=30005;
const int S=600;
template<int N>struct Bitset{
typedef unsigned long long ull;
static const int O=(N-1)/64+1;
static const ull ULL_MAX=18446744073709551615ull;
ull a[O];
Bitset(){memset(a,0,sizeof(a));}
void reset(){memset(a,0,sizeof(a));}
void set(int x){a[(x>>6)]|=1ull<<(x&63);}
Bitset&operator |= (const Bitset&t){
for(int i=0;i<O;++i)a[i]|=t.a[i];
return *this;
}
Bitset operator | (const Bitset&t){
Bitset res;
for(int i=0;i<O;++i)res.a[i]=a[i]|t.a[i];
return res;
}
int count(){
int res=0;
for(int i=0;i<O;++i)res+=__builtin_popcountll(a[i]);
return res;
}
int mex(){
for(int i=0;i<O;++i)if(a[i]<ULL_MAX)
for(int j=0;j<64;++j)if(!(a[i]>>j&1ull))return (i<<6)|j;
return N+1;
}
};
Bitset<M>bs[N/S+5][N/S+5];
int n,m,f,lastans,a[N];
int siz[N],fa[N],top[N],son[N],dep[N],mxd[N];
int id[N],tot,up[N];
int et,hed[N];
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
void dfs1(int u,int ft){
mxd[u]=dep[u],siz[u]=1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dep[v]=dep[u]+1,dfs1(v,u);
fa[v]=u,siz[u]+=siz[v];
ckmax(mxd[u],mxd[v]);
if(siz[v]>siz[son[u]])son[u]=v;
}
if(u==1||mxd[u]-dep[u]>S)id[u]=++tot,mxd[u]=dep[u];
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
void dfs(int u,int ft,int lst){
if(id[u]){
up[u]=lst,bs[id[u]][id[u]].set(a[u]);
if(lst){
int now=u;
while(now!=lst)bs[id[u]][id[lst]].set(a[now]),now=fa[now];
now=up[lst];
while(now)(bs[id[u]][id[now]]=bs[id[u]][id[lst]])|=bs[id[lst]][id[now]],now=up[now];
}
}
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
dfs(v,u,id[u]?u:lst);
}
}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
signed main(){
n=read(),m=read(),f=read();
rep(i,1,n)a[i]=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
dep[1]=1,dfs1(1,0),dfs2(1,1),dfs(1,0,0);
while(m--){
int q=read(),mex,sum;
static Bitset<M>ans;
ans.reset();
rep(i,1,q){
int x=read(),y=read();
if(f)x^=lastans,y^=lastans;
int lca=LCA(x,y);
ans.set(a[lca]);
while(!id[x]&&x!=lca)ans.set(a[x]),x=fa[x];
while(!id[y]&&y!=lca)ans.set(a[y]),y=fa[y];
if(x!=lca){
int now=x;
while(dep[up[now]]>=dep[lca])now=up[now];
ans|=bs[id[x]][id[now]];
while(now!=lca)ans.set(a[now]),now=fa[now];
}
if(y!=lca){
int now=y;
while(dep[up[now]]>=dep[lca])now=up[now];
ans|=bs[id[y]][id[now]];
while(now!=lca)ans.set(a[now]),now=fa[now];
}
}
lastans=(sum=ans.count())+(mex=ans.mex()),printf("%d %d\n",sum,mex);
}
}```
P5236 【模板】静态仙人掌.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
typedef double db;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int n,m,q,tot;
namespace Tree{
#define N 20005
int fa[N],top[N],son[N],dep[N],siz[N],dis[N],sum[N];
struct edge{int nxt,to,val;}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to,int val){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void dfs1(int u,int ft){
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dep[v]=dep[u]+1,dis[v]=dis[u]+e[i].val;
dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int jump(int u,int anc){
int res=0;
while(top[u]!=top[anc])res=top[u],u=fa[top[u]];
return u==anc?res:son[anc];
}
int LCA(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
int query(int u,int v){
int lca=LCA(u,v);
if(lca<=n)return dis[u]+dis[v]-(dis[lca]<<1);
int x=jump(u,lca),y=jump(v,lca);
return dis[u]-dis[x]+dis[v]-dis[y]+min(abs(sum[x]-sum[y]),sum[lca]-abs(sum[x]-sum[y]));
}
#undef N
}
namespace cac{
#define N 10005
#define M 20005
using Tree::sum;
int dfn[N],low[N],tmr,val[N],fa[N];
struct edge{int nxt,to,val;}e[M<<1];
int head[N],num_edge;
void addedge(int fr,int to,int val){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
void build(int u,int v,int w){
int now=v;
while(now!=fa[u])sum[now]=w,w+=val[now],now=fa[now];
++tot,sum[tot]=sum[u];
now=v;
while(now!=fa[u]){
int tmp=min(sum[now],sum[tot]-sum[now]);
Tree::addedge(tot,now,tmp),Tree::addedge(now,tot,tmp);
now=fa[now];
}
}
void tarjan(int u,int ft){
dfn[u]=low[u]=++tmr;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
if(!dfn[v])fa[v]=u,val[v]=e[i].val,tarjan(v,u),low[u]=min(low[u],low[v]);
else low[u]=min(low[u],dfn[v]);
if(dfn[u]<low[v])Tree::addedge(u,v,e[i].val),Tree::addedge(v,u,e[i].val);
}
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(fa[v]==u||dfn[v]<=dfn[u])continue;
build(u,v,e[i].val);
}
}
#undef N
#undef M
}
signed main(){
tot=n=read(),m=read(),q=read();
for(int i=1;i<=m;++i){
int x=read(),y=read(),z=read();
cac::addedge(x,y,z),cac::addedge(y,x,z);
}
cac::tarjan(1,0),Tree::dfs1(1,0),Tree::dfs2(1,1);
while(q--){
int x=read(),y=read();
printf("%d\n",Tree::query(x,y));
}
return 0;
}```
P6005 [USACO20JAN]Time is Mooney G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,m,c,dp[1409][1009],ans,p[1009];
vector<int>g[1009];
signed main() {
n=rd(),m=rd(),c=rd();
for(int i=1;i<=n;++i)p[i]=rd();
for(int i=1;i<=m;++i){
int x=rd(),y=rd();
g[y].pb(x);
}
memset(dp,-0x3f,sizeof(dp));
dp[0][1]=0;
for(int i=1;i<=1400;++i) {
for(int u=1;u<=n;++u) {
for(int v:g[u])dp[i][u]=max(dp[i][u],dp[i-1][v]);
dp[i][u]+=p[u];
}
ans=max(ans,dp[i][1]-i*i*c);
}
printf("%d\n",ans);
return 0;
}
```
P1772 [ZJOI2006]物流运输.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=105;
const int M=25;
const int inf=1000000007;
int n,m,k,E,d;
int dp[N];
int head[M],num_edge;
int dis[M],vis[M];
bitset<N>bs[M];
bitset<M>book;
struct node {
int p,op;
node(){p=op=0;}
node(int p_,int o_){p=p_,op=o_;}
};
struct edge {
int nxt,to,val;
}e[M*M*2];
struct Dij{
int u,dis;
Dij(){u=dis=0;}
Dij(int u_,int d_){u=u_,dis=d_;}
bool operator < (const Dij &rhs)const{return dis>rhs.dis;}
};
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
e[num_edge].val=val;
head[fr]=num_edge;
}
bool cmp(const node &a,const node &b) {
return a.op<b.op;
}
int dij() {
priority_queue<Dij>q;q.push(Dij(1,0));
for(int i=1;i<=m;++i)dis[i]=inf,vis[i]=0;
dis[1]=0;
while(!q.empty()) {
Dij now=q.top();q.pop();
int u=now.u;
if(vis[u])continue;
vis[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(book[v])continue;
if(dis[v]>dis[u]+e[i].val) {
dis[v]=dis[u]+e[i].val;
if(!vis[v])q.push(Dij(v,dis[v]));
}
}
}
return dis[m];
}
signed main() {
n=rd(),m=rd(),k=rd(),E=rd();
for(int i=1;i<=E;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
d=rd();
for(int i=1;i<=d;++i) {
int p=rd(),a=rd(),b=rd();
for(int j=a;j<=b;++j)bs[p][j]=1;
}
dp[0]=-k;
for(int i=1;i<=n;++i) {
dp[i]=inf,book.reset();
for(int j=i;j>0;--j) {
for(int l=1;l<=m;++l)if(bs[l][j])book[l]=1;
int t=dij();
if(t==inf)break;
dp[i]=min(dp[i],dp[j-1]+(i-j+1)*t+k);
}
}
printf("%d\n",dp[n]);return 0;
}
```
P4383 [八省联考2018]林克卡特树.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=300010;
int n,m;
LL ans,ANS;
struct node {
int k;LL val;
node(){}
node(int o,LL v){k=o,val=v;}
node operator + (const node &rhs)const{return node(k+rhs.k,val+rhs.val);}
node operator + (const LL &v)const{return node(k,val+v);}
bool operator < (const node &rhs)const{return val!=rhs.val?val<rhs.val:k<rhs.k;}
}dp[N][3];
int head[N],num_edge;
struct edge {
int nxt,val,to;
}e[N<<1];
void addedge(int fr,int to,int val) {
++num_edge;
e[num_edge].val=val;
e[num_edge].to=to;
e[num_edge].nxt=head[fr];
head[fr]=num_edge;
}
void dfs(int u,int ft,LL sl) {
dp[u][0]=dp[u][1]=node(0,0);
if(sl<0)dp[u][2]=node(1,-sl);
else dp[u][2]=node(0,0);
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs(v,u,sl);
dp[u][2]=max(dp[u][2],max(dp[u][2]+dp[v][0],dp[u][1]+dp[v][1]+e[i].val+node(1,-sl)));
dp[u][1]=max(dp[u][1],max(dp[u][1]+dp[v][0],dp[u][0]+dp[v][1]+e[i].val));
dp[u][0]=max(dp[u][0],dp[u][0]+dp[v][0]);
}
dp[u][0]=max(dp[u][0],max(node(0,0),max(dp[u][1]+node(1,-sl),dp[u][2])));
}
int check(LL sl) {
dfs(1,0,sl);
ANS=dp[1][0].val;return dp[1][0].k;
}
signed main() {
n=rd(),m=rd()+1;
for(int i=1;i<n;++i) {
int u=rd(),v=rd(),d=rd();
addedge(u,v,d),addedge(v,u,d);
}
LL l=-1e13,r=1e13;
while(l<=r) {
LL mid=(l+r)>>1;int k=check(mid);
if(k>=m)ans=ANS+1ll*mid*m,l=mid+1;
else r=mid-1;
}
printf("%lld\n",ans);
return 0;
}```
CF1158C Permutation recovery.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500005;
int n,cnt,ans[N],stk[N],top;
struct node {
int id,p;
}a[N];
inline bool cmp(const node&a,const node&b){return a.p!=b.p?a.p>b.p:a.id<b.id;}
void Main() {
n=rd(),cnt=0;
for(int i=1;i<=n;++i){
a[i].id=i,a[i].p=rd();
}
stk[top=1]=n+1;
for(int i=1;i<=n;++i) {
while(stk[top]<=i)--top;
if(a[i].p>stk[top])return puts("-1"),void();
if(~a[i].p)stk[++top]=a[i].p;
}
for(int i=1;i<=n;++i)if(!~a[i].p)a[i].p=i+1;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;++i)ans[a[i].id]=n-i+1;
for(int i=1;i<=n;++i)printf("%d ",ans[i]);
puts("");
}
signed main() {
for(int T=rd();T;--T)Main();
}
```
P5787 二分图 【模板】线段树分治.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=N<<1;
const int T=N<<2;
int n,m,k,ans[N];
vector<pair<int,int> >upd[T];
namespace dsu{
int F[M],siz[M];
vector<int>stk;
void init(const int&n){
rep(i,1,n)F[i]=i,siz[i]=1;
}
int anc(int x){while(x!=F[x])x=F[x];return x;}
void merge(int x,int y){
x=anc(x),y=anc(y);
if(x==y)return;
if(siz[x]<siz[y])swap(x,y);
F[y]=x,siz[x]+=siz[y],stk.pb(y);
}
void undo(){
assert(stk.size());
int x=stk.back();stk.pop_back();
siz[F[x]]-=siz[x],F[x]=x;
}
}
#define lc (p<<1)
#define rc (p<<1|1)
void update(int ql,int qr,int x,int y,int l=1,int r=k,int p=1){
if(ql<=l&&r<=qr)return upd[p].pb(mkp(x,y)),void();
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,x,y,l,mid,lc);
if(mid<qr)update(ql,qr,x,y,mid+1,r,rc);
}
void solve(int l,int r,int p){
int tmp=sz(dsu::stk),flg=1;
for(int i=0,up=sz(upd[p]);i<up;++i){
int x=upd[p][i].fi,y=upd[p][i].se;
if(dsu::anc(x)==dsu::anc(y)){flg=0;rep(i,l,r)ans[i]=0;;break;}
dsu::merge(x+n,y),dsu::merge(y+n,x);
}
if(l==r)ans[l]=flg;
else if(flg){int mid=(l+r)>>1;solve(l,mid,lc),solve(mid+1,r,rc);}
while(sz(dsu::stk)>tmp)dsu::undo();
}
signed main(){
n=read(),m=read(),k=read();
rep(i,1,m){
int x=read(),y=read(),l=read(),r=read();
if(l==r)continue;update(l+1,r,x,y);
}
dsu::init(n<<1),solve(1,k,1);
rep(i,1,k)puts(ans[i]?"Yes":"No");
return 0;
}```
P3558 [POI2013]BAJ-Bytecomputer.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000009;
const int inf=0x3f3f3f3f;
int n,dp[N][3],a[N],ans;
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
dp[1][0]=dp[1][1]=dp[1][2]=inf,dp[1][a[1]+1]=0;
for(int i=2;i<=n;++i) {
if(a[i]==-1) {
dp[i][0]=dp[i-1][0];
if(a[i-1]==1)dp[i][1]=min(dp[i-1][0],dp[i-1][1])+1;
else dp[i][1]=inf;
if(a[i-1]==1)dp[i][2]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+2;
else dp[i][2]=dp[i-1][2]+2;
} else if(a[i]==0) {
dp[i][0]=dp[i-1][0]+1;
dp[i][1]=min(dp[i-1][0],dp[i-1][1]);
if(a[i-1]==1)dp[i][2]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+1;
else dp[i][2]=dp[i-1][2]+1;
} else {
dp[i][0]=dp[i-1][0]+2;
if(a[i-1]==-1)dp[i][1]=min(dp[i-1][0],dp[i-1][1])+1;
else dp[i][1]=dp[i-1][0]+1;
dp[i][2]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]));
}
}
ans=min(dp[n][0],min(dp[n][1],dp[n][2]));
if(ans==inf)puts("BRAK");
else printf("%d\n",ans);
return 0;
}
```
CF1421C Palindromifier.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int rdc() {
char ch=getchar();
while(ch!='0'&&ch!='1'&&ch!='S'&&ch!='F')ch=getchar();
if(ch=='0')return 0;
if(ch=='1')return 1;
return -1;
}
int n;
char s[100005];
signed main(){
scanf("%s",s),n=strlen(s);
puts("3");
printf("R %d\n",n-1);
printf("L %d\n",n);
printf("L 2\n");
return 0;
}```
P6822 [PA2012]Tax.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=400005;
int n,m,S,T;
LL dis[N];
bool vis[N];
struct edge{
int v,w,id;
inline bool operator < (const edge&t)const{return w<t.w;}
edge(){v=w=id=0;}
edge(int v_,int w_,int i_){v=v_,w=w_,id=i_;}
};
vector<edge>E[N];
vector<pair<LL,int> >e[N];
void Dij(){
priority_queue<pair<LL,int> >pq;
memset(dis,0x3f,sizeof(dis));
pq.push(mkp(dis[S]=0,S));
while(!pq.empty()){
int u=pq.top().se;pq.pop();
if(vis[u])continue;
vis[u]=1;
for(int i=0,up=sz(e[u]);i<up;++i){
int v=e[u][i].se;
if(dis[v]>dis[u]+e[u][i].fi){
dis[v]=dis[u]+e[u][i].fi;
if(!vis[v])pq.push(mkp(-dis[v],v));
}
}
}
}
signed main(){
n=read(),m=read(),S=m*2+2,T=S+1;
rep(i,1,m){
int x=read(),y=read(),z=read();
assert(z<=2000000);
E[x].pb(edge(y,z,i<<1)),E[y].pb(edge(x,z,i<<1|1));
}
rep(u,1,n){
sort(E[u].begin(),E[u].end());
for(int i=0,up=sz(E[u]);i<up;++i){
int v=E[u][i].v,w=E[u][i].w,id=E[u][i].id;
if(i)e[id].pb(mkp(0,E[u][i-1].id)),e[E[u][i-1].id].pb(mkp(w-E[u][i-1].w,id));
if(u==1)e[S].pb(mkp(w,id));
if(v==n)e[id].pb(mkp(w,T));
e[id].pb(mkp(w,id^1));
}
}
Dij();
printf("%lld\n",dis[T]);
return 0;
}```
CF1474B Different Divisors.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int d;
bool vis[N];
int pri[N/10],pct;
void Sieve(const int&n=N-1){
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
}
void Main(){
d=read();
int A,B;
for(int i=d+1;;++i)if(!vis[i]){A=i;break;}
for(int i=A+d;;++i)if(!vis[i]){B=i;break;}
printf("%lld\n",1ll*A*B);
}
signed main(){Sieve();
for(int T=read();T;--T)Main();}
/*
5
1
0
3
011
3
110
6
111000
6
001011
*/```
CF1137C Museums Tour.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
inline int rdc() {
char ch=getchar();
while(!isdigit(ch))ch=getchar();
return ch-'0';
}
typedef long long LL;
const int L=100005;
const int M=55;
const int N=L*M;
int n,m,d,k;
LL msk[L];
int dp[N],vis[N];
int scc[N],dfn[N],low[N],timer,stk[N],top,COL,siz[N];
vector<int>g[N],e[N];
int id(int x,int y){return (x-1)*d+y+1;}
inline void tarjan(int u) {
stk[++top]=u,dfn[u]=low[u]=++timer;
for(int v:g[u])
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
if(low[u]==dfn[u]) {
++COL;
while(stk[top+1]!=u)scc[stk[top--]]=COL;
}
}
inline void dfs(int u) {
if(dp[u])return;
for(int v:e[u])dfs(v),dp[u]=max(dp[u],dp[v]);
dp[u]+=siz[u];
}
signed main(){
n=rd(),m=rd(),d=rd(),k=n*d;
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();
for(int j=0;j<d;++j)g[id(x,j)].push_back(id(y,(j+1)%d));
}
for(int i=1;i<=n;++i)
for(int j=0;j<d;++j)rdc()&&(msk[i]|=1ll<<j);
for(int i=1;i<=k;++i)if(!dfn[i])tarjan(i);
for(int i=1;i<=n;++i) {
for(int j=0;j<d;++j) {
int u=id(i,j);
if(msk[i]>>j&1&&vis[scc[u]]!=i)vis[scc[u]]=i,++siz[scc[u]];
for(int v:g[u])if(scc[u]!=scc[v])e[scc[u]].push_back(scc[v]);
}
}
dfs(scc[id(1,0)]),printf("%d\n",dp[scc[id(1,0)]]);
return 0;
}```
CF1296E1 String Coloring (easy version).cpp
```#include<bits/stdc++.h>
using namespace std;
int l0,l1,n;
string ans,s;
int main()
{
cin>>n>>s;
for(int i=0;i<n;++i)
{
if(s[i]>=l0)ans+='0',l0=s[i];
else if(s[i]>=l1)ans+='1',l1=s[i];
else return puts("NO"),0;
}
puts("YES");cout<<ans<<endl;
return 0;
}```
P4762 [CERC2014]Virus synthesis.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
char strr[N];
int n,len[N],tr[N][4],fail[N],tot,las,trans[N],ans,dp[N],str[N];
inline int gfail(int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
inline int gtrans(int x,int i,int lim){
while((len[x]+2)*2>lim||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
void Main(){
scanf("%s",strr),n=strlen(strr);
for(int i=0;i<n;++i){
if(strr[i]=='A')str[i]=0;
else if(strr[i]=='G')str[i]=1;
else if(strr[i]=='C')str[i]=2;
else str[i]=3;
}
memset(len,0,(n+3)<<2);
memset(fail,0,(n+3)<<2);
memset(trans,0,(n+3)<<2);
for(int i=0;i<=n+3;++i)
memset(tr[i],0,sizeof(tr[i]));
len[0]=0,len[1]=-1,fail[0]=1,fail[1]=0,tot=1,las=0;
for(int i=0;i<n;++i){
int c=str[i],f=gfail(las,i);
if(!tr[f][c]){
fail[++tot]=tr[gfail(fail[f],i)][c];
tr[f][c]=tot,len[tot]=len[f]+2;
if(len[tot]<=2)trans[tot]=fail[tot];
else trans[tot]=tr[gtrans(trans[f],i,len[tot])][c];
dp[tot]=len[tot];
}
las=tr[f][c];
}
queue<int>q;
q.push(0),dp[0]=1,ans=n;
while(!q.empty()){
int u=q.front();q.pop();
ckmin(dp[u],dp[trans[u]]+1+len[u]/2-len[trans[u]]);
ckmin(ans,n-len[u]+dp[u]);
for(int i=0;i<4;++i){
int v=tr[u][i];
if(!v)continue;
ckmin(dp[v],dp[u]+1),q.push(v);
}
}
printf("%d\n",ans);
}
signed main(){
for(int T=read();T;--T)Main();
}```
CF1138B Circus.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=5009;
int n,sum;
char s[N],t[N];
#define sz(s) ((int)s.size())
vector<int>g[3];
signed main() {
scanf("%d%s%s",&n,s+1,t+1);
for(int i=1;i<=n;++i) {
int x=s[i]-'0',y=t[i]-'0';
sum+=y,g[x+y].push_back(i);
}
for(int t2=0;t2<=sz(g[2]);++t2) {
int t1=sum-t2*2,t0=n/2-t2-t1;
if(t0<0||t1<0||t0>sz(g[0])||t1>sz(g[1]))continue;
for(int j=0;j<t0;++j)printf("%d ",g[0][j]);
for(int j=0;j<t1;++j)printf("%d ",g[1][j]);
for(int j=0;j<t2;++j)printf("%d ",g[2][j]);
return 0;
}
puts("-1");
}```
P4103 [HEOI2014]大工程.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
int n,q,m,h[N],ans2,ans3,f[N];
LL dp[N],ans1;
int sz[N];
bool book[N];
int et,hed[N];
struct edge{int nx,to;}e[N<<1];
void adde(int u,int v){e[++et].nx=hed[u],e[et].to=v,hed[u]=et;}
vector<int>G[N];
namespace Tree{
int top[N],fa[N],dep[N],siz[N],tmr,dfn[N],son[N];
void dfs1(int u,int ft){
siz[u]=1,dep[u]=dep[ft]+1;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr;
if(son[u])dfs2(son[u],tp);
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
int dis(int x,int y){return dep[x]+dep[y]-(dep[LCA(x,y)]<<1);}
void init(){dfs1(1,0),dfs2(1,1);}
}
using Tree::LCA;
using Tree::dfn;
using Tree::dep;
using Tree::dis;
inline bool cmp(const int&a,const int&b){return dfn[a]<dfn[b];}
int build(int*h,int m){
static int stk[N],top,a[N];
memcpy(a,h,(m+1)<<2);
sort(a+1,a+m+1,cmp);
stk[top=1]=a[1];
rep(i,2,m){
int lca=LCA(stk[top],a[i]);
while(top>1&&dep[stk[top-1]]>=dep[lca])G[stk[top-1]].pb(stk[top]),--top;
if(lca!=stk[top])G[lca].pb(stk[top]),stk[top]=lca;
stk[++top]=a[i];
}
while(--top)G[stk[top]].pb(stk[top+1]);
return stk[1];
}
void dfs1(int u){
if(book[u])sz[u]=1;
else sz[u]=0;
for(int v:G[u])dfs1(v),sz[u]+=sz[v];
}
void dfs2(int u){
if(book[u])ans1+=dp[u];
for(int v:G[u]){
dp[v]=dp[u]+1ll*(m-2*sz[v])*(dep[v]-dep[u]);
dfs2(v);
}
}
void dfs3(int u){
f[u]=0;
for(int v:G[u]){
dfs3(v);
ckmax(ans3,f[u]+f[v]+dep[v]-dep[u]);
ckmax(f[u],f[v]+dep[v]-dep[u]);
}
}
void dfs4(int u){
if(book[u])f[u]=0;
else f[u]=1919810;
for(int v:G[u]){
dfs4(v);
ckmin(ans2,f[u]+f[v]+dep[v]-dep[u]);
ckmin(f[u],f[v]+dep[v]-dep[u]);
}
dp[u]=book[u]=0,G[u].clear();
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
Tree::init();
for(q=read();q;--q){
m=read();
rep(i,1,m)h[i]=read(),book[h[i]]=1;
int rt=build(h,m);
rep(i,1,m)dp[rt]+=dep[h[i]]-dep[rt];
ans1=0,ans2=n,ans3=0;
dfs1(rt),dfs2(rt),dfs3(rt),dfs4(rt);
printf("%lld %d %d\n",ans1/2ll,ans2,ans3);
}
}```
P4071 [SDOI2016]排列计数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
const int N=1000005;
const int mod=1e9+7;
int f[N],fac[N],ifc[N];
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;
return res;
}
void init(const int&N){
fac[0]=1;
for(int i=1;i<=N;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[N]=qpow(fac[N],mod-2);
for(int i=N-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
f[0]=1,f[1]=0,f[2]=1;
for(int i=3;i<=N;++i)f[i]=1ll*(i-1)*(f[i-1]+f[i-2])%mod;
}
int C(int n,int m){
return 1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;
}
signed main(){
init(N-5);
for(int T=read();T;--T){
int n=read(),m=read();
if(n<m)puts("0");
else printf("%lld\n",1ll*C(n,m)*f[n-m]%mod);
}
return 0;
}```
P7296 [USACO21JAN] Uddered but not Herd G.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int f[1<<20],n,c[30],m,mp[20][20],a[100005];
char str[100005];
int calc(int msk,int x){
int res=mp[x][x];
for(int i=0;i<m;++i)if(msk>>i&1)
res+=mp[x][i];
return res;
}
signed main(){
scanf("%s",str+1),n=strlen(str+1);
rep(i,1,n)a[i]=str[i]-'a';
memset(c,-1,sizeof(c));
for(int i=1;i<=n;++i){
if(!~c[a[i]])c[a[i]]=m++;
if(i>1)++mp[c[a[i-1]]][c[a[i]]];
}
//rep(i,1,n)cerr<<c[a[i]]<<' ';cerr<<'\n';
memset(f,0x3f,sizeof(f));
f[0]=1;
for(int msk=0;msk<1<<m;++msk){
for(int i=0;i<m;++i){
if(msk>>i&1)continue;
ckmin(f[msk|(1<<i)],f[msk]+calc(msk,i));
}
}
printf("%d\n",f[(1<<m)-1]);
return 0;
}```
P3233 [HNOI2014]世界树.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
int n,q,m,h[N],d[N],f[N],ans[N];
bool book[N];
vector<int>g[N],e[N];
int bz[20][N],dep[N],dfn[N],tmr,siz[N];
void dfs(int u,int ft){
dep[u]=dep[ft]+1,bz[0][u]=ft,dfn[u]=++tmr,siz[u]=1;
for(int i=1;1<<i<dep[u];++i)bz[i][u]=bz[i-1][bz[i-1][u]];
for(int v:e[u])if(v!=ft)dfs(v,u),siz[u]+=siz[v];
}
int LCA(int x,int y){
if(dep[x]<dep[y])x^=y^=x^=y;
int del=dep[x]-dep[y];
for(int i=19;i>=0;--i)if(del>>i&1)x=bz[i][x];
if(x==y)return x;
for(int i=19;i>=0;--i)if(bz[i][x]!=bz[i][y])x=bz[i][x],y=bz[i][y];
return bz[0][x];
}
int kthanc(int x,int k){
for(int i=19;i>=0;--i)if(k>>i&1)x=bz[i][x];
return x;
}
inline bool cmp(const int&a,const int&b){return dfn[a]<dfn[b];}
int build(){
static int stk[N],top,a[N];
memcpy(a,h,(n+1)<<2);
sort(a+1,a+m+1,cmp);
stk[top=1]=a[1];
rep(i,2,m){
int lca=LCA(stk[top],a[i]);
while(top>1&&dep[stk[top-1]]>=dep[lca])g[stk[top-1]].pb(stk[top])
/*,cerr<<"edge:"<<stk[top-1]<<' '<<stk[top]<<'\n'*/,--top;
if(stk[top]!=lca)g[lca].pb(stk[top])/*,cerr<<"edge:"<<lca<<' '<<stk[top]<<'\n'*/,stk[top]=lca;
stk[++top]=a[i];
}
while(--top)g[stk[top]].pb(stk[top+1])/*,cerr<<"edge:"<<stk[top]<<' '<<stk[top+1]<<'\n'*/;
return stk[1];
}
void dfs1(int u){
if(book[u])f[u]=u,d[u]=0;
else f[u]=d[u]=n+1;
for(int v:g[u]){
dfs1(v);
if(ckmin(d[u],d[v]+dep[v]-dep[u]))f[u]=f[v];
else if(d[u]==d[v]+dep[v]-dep[u])ckmin(f[u],f[v]);
}
}
void dfs2(int u){
for(int v:g[u]){
if(ckmin(d[v],d[u]+dep[v]-dep[u]))f[v]=f[u];
else if(d[v]==d[u]+dep[v]-dep[u])ckmin(f[v],f[u]);
dfs2(v);
}
}
void dfs3(int u){
ans[f[u]]+=siz[u];
for(int v:g[u])ans[f[u]]-=siz[kthanc(v,dep[v]-dep[u]-1)],dfs3(v);
}
void dfs4(int u){
for(int v:g[u]){
if(f[u]==f[v])ans[f[u]]+=siz[kthanc(v,dep[v]-dep[u]-1)]-siz[v];
else{
int o=dep[f[v]]+dep[u]-d[u],t=v;
if(o&1)o=(o+1)>>1;
else o=f[v]<f[u]?(o>>1):(o>>1)+1;
for(int i=19;i>=0;--i)if(dep[bz[i][t]]>=o)t=bz[i][t];
ans[f[u]]+=siz[kthanc(v,dep[v]-dep[u]-1)]-siz[t];
ans[f[v]]+=siz[t]-siz[v];
}
dfs4(v);
}
g[u].clear(),f[u]=d[u]=0;
}
signed main(){
n=read();
rep(i,2,n){
int x=read(),y=read();
e[x].pb(y),e[y].pb(x);
}
dfs(1,0);
for(q=read();q;--q){
m=read();
rep(i,1,m)h[i]=read(),book[h[i]]=1;
int rt=build();
dfs1(rt),dfs2(rt);
ans[f[rt]]+=siz[1]-siz[rt];
dfs3(rt),dfs4(rt);
rep(i,1,m)printf("%d%c",ans[h[i]]," \n"[i==m]);
rep(i,1,m)book[h[i]]=ans[h[i]]=0;
}
}```
P7263 Something Comforting.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1000005;
#define mod 998244353
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
int n,s,fac[N],ifc[N],ans;
char str[N];
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
signed main(){
scanf("%d%s",&n,str+1);
for(int i=1,now=0;i<=n<<1;++i){
str[i]==')'?--now:++now;
s+=!now;
}
fac[0]=1;rep(i,1,n<<1)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n<<1]=qpow(fac[n<<1],mod-2);per(i,n*2-1,0)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
ans=1ll*fac[n<<1]*qpow(comb(2*n-1,n-1),mod-2)%mod;
ans=1ll*ans*qpow(2,s-1)%mod;
ans=1ll*ans*qpow(fac[n<<1],mod-2)%mod;
cout<<ans<<'\n';
}```
P3761 [TJOI2017]城市.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=5010;
const int inf=1000000007;
struct edge{
int nxt,to,val;
}e[N<<1];
int n,ans=inf;
int head[N],num_edge;
vector<int>d,w;
void addedge(int fr,int to,int val) {
++num_edge,
e[num_edge].nxt=head[fr],
e[num_edge].to=to,
e[num_edge].val=val,
head[fr]=num_edge;
}
int f[N],ff[N],g[N],gg[N],S,T,res;
void dfs(int u,int ft,int&res) {
ff[u]=u,gg[u]=u;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfs(v,u,res);
if(f[v]+e[i].val>=f[u])g[u]=f[u],gg[u]=ff[u],f[u]=f[v]+e[i].val,ff[u]=ff[v];
else if(f[v]+e[i].val>g[u])g[u]=f[v]+e[i].val,gg[u]=ff[v];
if(f[u]+g[u]>res)res=f[u]+g[u],S=ff[u],T=gg[u];
}
}
int dfsd(int u,int ft,int tar) {
if(u==tar) {d.pb(u);return 1;}
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
if(dfsd(v,u,tar)) {d.pb(u),w.pb(e[i].val);return 1;}
}
return 0;
}
void dfsr(int u,int ft,int&dis,int tp) {
dis=min(dis,max(tp,f[u]));
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dfsr(v,u,dis,e[i].val+max(f[v]+e[i].val==f[u]?g[u]:f[u],tp));
}
}
void clear() {
res=0;
memset(f,0,sizeof(f));
memset(g,0,sizeof(g));
}
signed main() {
n=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd(),z=rd();
addedge(x,y,z),addedge(y,x,z);
}
dfs(1,0,res),dfsd(S,0,T);
for(uint i=0;i<d.size()-1;++i) {
int x=d[i],y=d[i+1],r1=inf,r2=inf,d1=0,d2=0;
clear(),dfs(x,y,d1),dfsr(x,y,r1,0);if(r1+w[i]>ans)continue;
clear(),dfs(y,x,d2),dfsr(y,x,r2,0),ans=min(ans,max(max(d1,d2),r1+r2+w[i]));
}
printf("%d\n",ans);
return 0;
}```
P1903 [国家集训队]数颜色 维护队列.cpp
```#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline void write(int w,char text=-1){
if(!w)putchar(48);
else{
int d[10];
for(d[0]=0;w;d[++d[0]]=w%10,w/=10);
for(;d[0];putchar(d[d[0]--]^48));
}
if(~text)putchar(text);
}
const int N=150000;
const int M=1000010;
int a[N],n,m,bel[N],len,ans[N],nowsum,nowupd,numq,numu,cnt[M];
struct QUE {
int id,l,r,pre;
}que[N];
struct UPD {
int id,pos,k;
}upd[N];
bool cmp(const QUE &a,const QUE &b) {
return bel[a.l]!=bel[b.l]?bel[a.l]<bel[b.l]:bel[a.r]!=bel[b.r]?bel[a.l]&1?bel[a.r]<bel[b.r]:bel[a.r]>bel[b.r]:a.pre<b.pre;
}
inline void pop(int x) {nowsum-=!--cnt[x];}
inline void add(int x) {nowsum+=!cnt[x]++;}
inline void swap(int &x,int &y) {x^=y^=x^=y;}
inline void modify(int x,int y) {
if(que[y].l<=upd[x].pos&&upd[x].pos<=que[y].r)
pop(a[upd[x].pos]),add(upd[x].k);
swap(upd[x].k,a[upd[x].pos]);
}
signed main() {
n=rd(),m=rd(),len=ceil(pow(n,0.666));
for(rint i=1;i<=n;++i)a[i]=rd(),bel[i]=(i-1)/len+1;
for(rint i=1;i<=m;++i) {
char ch=getchar();
while(ch!='Q'&&ch!='R')ch=getchar();
if(ch=='Q') {
++numq;
que[numq].id=numq;
que[numq].l=rd();
que[numq].r=rd();
que[numq].pre=numu;
} else {
++numu;
upd[numu].id=numu;
upd[numu].pos=rd();
upd[numu].k=rd();
}
}
sort(que+1,que+numq+1,cmp);
for(rint i=1,l=1,r=0;i<=numq;++i) {
while(l<que[i].l)pop(a[l++]);
while(l>que[i].l)add(a[--l]);
while(r<que[i].r)add(a[++r]);
while(r>que[i].r)pop(a[r--]);
while(nowupd<que[i].pre)modify(++nowupd,i);
while(nowupd>que[i].pre)modify(nowupd--,i);
ans[que[i].id]=nowsum;
}
for(rint i=1;i<=numq;++i)write(ans[i],10);
return 0;
}
```
P2341 [USACO03FALL][HAOI2006]受欢迎的牛 G.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
typedef long long LL;
const int N=100009;
int n,m,ans;
int scc[N],dfn[N],low[N],timer,stk[N],top,COL,siz[N],ind[N];
vector<int>g[N];
void tarjan(int u) {
stk[++top]=u,dfn[u]=low[u]=++timer;
for(int v:g[u])
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
if(low[u]==dfn[u]) {
++COL;
while(stk[top+1]!=u)scc[stk[top--]]=COL,++siz[COL];
}
}
signed main(){
n=rd(),m=rd();
for(int i=1;i<=m;++i) {
int x=rd(),y=rd();g[y].push_back(x);
}
for(int i=1;i<=n;++i)if(!dfn[i])tarjan(i);
for(int u=1;u<=n;++u)
for(int v:g[u])if(scc[u]!=scc[v])++ind[scc[v]];
for(int i=1,k=0;i<=COL;++i)if(!ind[i]){
++k;if(k>1)return puts("0"),0;
ans+=siz[i];
}
printf("%d\n",ans);
return 0;
}```
P7075 儒略日.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
LL n;
int y,m,d;
const int y4=1461;
const int y100=36524;
const int y400=146097;
int mon[]={-1,31,0,31,30,31,30,31,31,30,31,30,31};
void run1(int&d,int&m,int&y,int n){
while(n>mon[m]){
n-=mon[m],++m;
if(m==2){
if(y<0)mon[2]=-y%4==1?29:28;
else {
if(y<=1582)mon[2]=y%4==0?29:28;
else{
if(y%400==0)mon[2]=29;
else if(y%4==0&&y%100!=0)mon[2]=29;
else mon[2]=28;
}
}
}
if(m==13)m=1,++y;
if(!y)++y;
}
d=n;
}
void run2(int&d,int&m,int&y,int n){
static int cnt;
cnt=1;
while(cnt<=n){
++cnt,++d;
if(d==mon[m]+1)++m,d=1;
if(m==2){
if(y<0)mon[2]=-y%4==1?29:28;
else {
if(y<=1582)mon[2]=y%4==0?29:28;
else{
if(y%400==0)mon[2]=29;
else if(y%4==0&&y%100!=0)mon[2]=29;
else mon[2]=28;
}
}
}
if(m==13)m=1,++y;
if(!y)++y;
}
}
void Main(){
scanf("%lld",&n);
LL tmp=n;
y=-4713,m=1,d=1;
if(n<=2299160){
y+=4*(n/y4);
n-=(n/y4)*y4;
if(y>=0)++y;
m=1,d=1;
run1(d,m,y,n+1);
if(y<0)printf("%d %d %d BC\n",d,m,-y);
else printf("%d %d %d\n",d,m,y);
return;
}
n-=2299161;
y=1582,m=10,d=15;
if(n<=6653){
run2(d,m,y,n);
printf("%d %d %d\n",d,m,y);
return;
}
n-=6653,y=1601,m=1,d=1;
y+=400*(n/y400);
n-=y400*(n/y400);
if(n==y400-1){
y+=400-1,m=12,d=31;
printf("%d %d %d\n",d,m,y);
return;
}
y+=100*(n/y100);
n-=y100*(n/y100);
y+=4*(n/y4);
n-=y4*(n/y4);
run1(d,m,y,n+1);
// if(tmp==913512802)cerr<<d<<' '<<m<<' '<<y<<'\n';
printf("%d %d %d\n",d,m,y);
}
signed main(){
for(int T=read();T;--T)Main();
}```
P6476 [NOI Online #2 提高组]涂色游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int gcd(int x,int y) {return !y?x:gcd(y,x%y); }
signed main(){
for (int T = read(); T; -- T) {
int a = read(), b = read(), k = read(), g = gcd(a, b);
if (k == 1) {puts("No"); continue; }
a /= g, b /= g;
if (a > b) std::swap(a, b);
if ((b - 2) / a + 1 >= k) puts("No");
else puts("Yes");
}
return 0;
}```
P6851 onu.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,m,c,ans[N];
LL sum;
vector<pair<int,int> >v[N],p[N];
bool book[N];
#define X(v) (v).first
#define Y(v) (v).second
signed main(){
n=read(),m=read(),c=read(),sum=read();
for(int i=1;i<=n;++i){
int a=read(),b=read();
v[a].pb(mkp(b,i));
}
for(int i=1;i<=m;++i){
int a=read(),b=read();
p[a].pb(mkp(b,i));
}
for(int i=1;i<N;++i){
if(!p[i].size())continue;
sort(v[i].begin(),v[i].end()),reverse(v[i].begin(),v[i].end());
sort(p[i].begin(),p[i].end()),reverse(p[i].begin(),p[i].end());
int j=0,k=0;
while(j<v[i].size()&&k<p[i].size()){
if(X(v[i][j])>=X(p[i][k]))sum+=X(v[i][j])+c,book[Y(p[i][k])]=1,ans[Y(p[i][k])]=Y(v[i][j]),++j;
++k;
}
k=0;
while(j<v[i].size()&&k<p[i].size()){
while(k<p[i].size()&&book[Y(p[i][k])])++k;
if(j==p[i].size())break;
sum+=X(v[i][j])-c,ans[Y(p[i][k])]=Y(v[i][j]),book[Y(p[i][k])]=1;
++j,++k;
}
for(k=0;k<p[i].size();++k)if(!book[Y(p[i][k])])ans[Y(p[i][k])]=-1,sum-=c;
}
printf("%lld\n",sum);
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
CF208E Blood Cousins.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
const int M=18*N;
vector<int>g[N];
int n,fa[18][N],m,dep[N],ans[N];
int root[N],val[M],ls[M],rs[M],tot;
struct QUE {
int id,x;
QUE(){}
QUE(int id_,int x_){id=id_,x=x_;}
};
vector<QUE>q[N];
int kth_fa(int x,int k) {
int res=x;
for(int i=0;i<17;++i)
if(k>>i&1)res=fa[i][res];
return res;
}
void change(int&p,int l,int r,int pos,int k) {
if(!p)p=++tot;
if(l==r){val[p]+=k;return;}
int mid=(l+r)>>1;
if(pos<=mid)change(ls[p],l,mid,pos,k);
else change(rs[p],mid+1,r,pos,k);
}
int merge(int x,int y) {
if(!x||!y)return x|y;
val[x]+=val[y];
ls[x]=merge(ls[x],ls[y]);
rs[x]=merge(rs[x],rs[y]);
return x;
}
int ask(int p,int l,int r,int pos) {
if(l==r)return val[p];
int mid=(l+r)>>1;
if(pos<=mid)return ask(ls[p],l,mid,pos);
else return ask(rs[p],mid+1,r,pos);
}
void dfs(int u) {
for(int v:g[u])
dep[v]=dep[u]+1,dfs(v),root[u]=merge(root[u],root[v]);
if(u)change(root[u],1,n,dep[u],1);
for(QUE i:q[u])ans[i.id]=ask(root[u],1,n,dep[i.x])-1;
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)g[fa[0][i]=rd()].pb(i);
for(int i=1;i<=17;++i)
for(int j=1;j<=n;++j)
fa[i][j]=fa[i-1][fa[i-1][j]];
m=rd();
for(int i=1;i<=m;++i){
int x=rd(),k=rd(),p=kth_fa(x,k);
if(p)q[p].pb(QUE(i,x));
}
dfs(0);
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
tarjan缩点.cpp
```int low[N],dfn[N],tmr,stk[N],top;
void tarjan(int u) {
low[u]=dfn[u]=++tmr,stk[++top]=u;
for(int i=hed[u];i;i=e[i].nxt) {
int v=e[i].to;
if(!dfn[v])tarjan(v),low[u]=min(low[u],low[v]);
else if(!scc[v])low[u]=min(low[u],dfn[v]);
}
if(low[u]==dfn[u]) {
scc[u]=++C;
while(stk[top]!=u)scc[stk[top--]]=C;
--top;
}
}```
CF893F Subtree Minimum Query.cpp
```// Problem: F. Subtree Minimum Query
// Contest: Codeforces - Educational Codeforces Round 33 (Rated for Div. 2)
// URL: https://codeforces.com/contest/893/problem/F
// Memory Limit: 512 MB
// Time Limit: 6000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int T=N*60;
const int inf=0x3f3f3f3f;
vector<int>g[N];
int n,q,dep[N],las,rt[N],a[N],r;
int ls[T],rs[T],val[T],tot;
void pushup(int p){
val[p]=min(val[ls[p]],val[rs[p]]);
}
void update(int&p,int pos,int k,int l=1,int r=n){
if(!p)p=++tot;
if(l==r)return val[p]=k,void();
int mid=(l+r)>>1;
if(pos<=mid)update(ls[p],pos,k,l,mid);
else update(rs[p],pos,k,mid+1,r);
pushup(p);
}
int query(int p,int ql,int qr,int l=1,int r=n){
if(!p)return inf;
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=inf;
if(ql<=mid)ckmin(res,query(ls[p],ql,qr,l,mid));
if(mid<qr)ckmin(res,query(rs[p],ql,qr,mid+1,r));
return res;
}
int merge(int x,int y,int l,int r){
if(!x||!y)return x|y;
if(l==r)return val[++tot]=min(val[x],val[y]),tot;
int mid=(l+r)>>1,p=++tot;
ls[p]=merge(ls[x],ls[y],l,mid);
rs[p]=merge(rs[x],rs[y],mid+1,r);
return pushup(p),p;
}
void dfs(int u,int ft){
dep[u]=dep[ft]+1;
update(rt[u],dep[u],a[u]);
for(int v:g[u]){
if(v==ft)continue;
dfs(v,u);
rt[u]=merge(rt[u],rt[v],1,n);
}
}
signed main(){
n=read(),r=read();
val[0]=inf;
rep(i,1,n)a[i]=read();
rep(i,2,n){
int x=read(),y=read();
g[x].pb(y),g[y].pb(x);
}
dfs(r,0);
q=read();
rep(t,1,q){
int x=read(),y=read();
x=(las+x)%n+1,y=(las+y)%n;
printf("%d\n",las=query(rt[x],dep[x],dep[x]+y));
}
}```
P4022 [CTSC2012]熟悉的文章.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N (11000005)
#define S (N<<1)
int n,m;
int ma[N];
int trans[S][2],mxlen[S],link[S],tot=1;
int q[N],H,T,dp[N];
int extend(int c,int lst){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[p]+1==mxlen[q])return q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
trans[nq][0]=trans[q][0],trans[nq][1]=trans[q][1];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
trans[nq][0]=trans[q][0],trans[nq][1]=trans[q][1];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
int check(int L,int len){
H=1,T=0,dp[0]=0;
for(int i=1;i<=len;++i){
if(i>=L){
while(H<=T&&dp[q[T]]-q[T]<=dp[i-L]-(i-L))--T;
q[++T]=i-L;
}
if(ma[i]<L){dp[i]=dp[i-1];continue;}
while(H<=T&&i-ma[i]>q[H])++H;
if(H<=T)dp[i]=max(dp[q[H]]+i-q[H],ma[i]);
dp[i]=max(dp[i-1],dp[i]);
}
return dp[len];
}
signed main(){
n=read(),m=read();
for(int i=1;i<=m;++i){
static char str[N];
scanf("%s",str);
for(int j=0,len=strlen(str),lst=1;j<len;++j)lst=extend(str[j]-'0',lst);
}
while(n--){
static char str[N];
static int u,len,now;
scanf("%s",str+1),len=strlen(str+1),u=1,now=0;
for(int i=1;i<=len;++i){
int c=str[i]-'0';
if(trans[u][c])u=trans[u][c],++now;
else{
for(;u&&!trans[u][c];u=link[u]);
if(!u)u=1,now=0;
else now=mxlen[u]+1,u=trans[u][c];
}
ma[i]=now;
}
int l=1,r=len,res=0;
while(l<=r){
int mid=(l+r)>>1;
if(check(mid,len)*10>=len*9)res=mid,l=mid+1;
else r=mid-1;
}
printf("%d\n",res);
}
return 0;
}```
CF995C Leaving the Bar.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define N 100009
const int lim=1500000ll*1500000ll;
int n,X,Y,ans[N];
struct node {
int id,x,y;
}a[N];
int dis(int x,int y) {
return x*x+y*y;
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i].x=rd(),a[i].y=rd(),a[i].id=i;
while("fyyAKIOI") {
random_shuffle(a+1,a+n+1),X=0,Y=0;
for(int i=1;i<=n;++i)
if(dis(X+a[i].x,Y+a[i].y)<dis(X-a[i].x,Y-a[i].y))ans[a[i].id]=1,X+=a[i].x,Y+=a[i].y;
else ans[a[i].id]=-1,X-=a[i].x,Y-=a[i].y;
if(dis(X,Y)<=lim) {
for(int i=1;i<=n;++i)printf("%lld ",ans[i]);
return 0;
}
}
}```
P3303 [SDOI2013]淘金.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//Start---------------------------
//Wanrning!!! I define int long long----------------------------------
#define int long long
//Wanrning!!! I define int long long----------------------------------
const int N=8287;
int n,k,ans;
int num[15],tot;
LL dp[15][N],a[N],cnt;
map<LL,int>mp;
const int zky=1000000007;
int v[N];
struct node {
int x,y;
node(){x=y=0;}
node(int x_,int y_){x=x_,y=y_;}
inline bool operator <(const node &rhs)const{return 1.*a[x]/a[rhs.y]<1.*a[rhs.x]/a[y];}
};
priority_queue<node>q;
namespace pre_work {
set<int>s1,s2;set<LL>S;
int f(int x) {
int res=1;
while(x)res*=x%10,x/=10;
return res;
}
void main() {
for(int i=1;i<=1e6;++i)s1.insert(f(i));
s2=s1;
for(int i:s1)
for(int j:s2)
S.insert(1ll*i*j);
for(LL i:S)v[++cnt]=i,mp[i]=cnt;
}
}
LL dfs(int pos,int limit,LL now) {
if(!pos)return now==1;
if(!limit&&~dp[pos][mp[now]])return dp[pos][mp[now]];
int up=limit?num[pos]:9;LL res=0;
for(int i=1;i<=up;++i)
if(now%i==0)res+=dfs(pos-1,limit&&i==up,now/i);
if(!limit)dp[pos][mp[now]]=res;
return res;
}
void solve(LL x) {
memset(dp,-1,sizeof(dp));
while(x)num[++tot]=x%10,x/=10;
for(int i=1;i<=cnt;++i)
for(int j=1;j<=tot;++j)a[i]+=dfs(j,j==tot,v[i]);
}
inline bool cmp(const LL &a,const LL &b) {return a>b;}
signed main() {
pre_work::main();
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n>>k;
solve(n);
sort(a+1,a+cnt+1,cmp);
for(int i=1;i<=cnt;++i)q.push(node(i,1));
while(k--) {
node u=q.top();q.pop();
ans=(ans+((a[u.x]%zky)*(a[u.y]%zky))%zky)%zky;
if(u.y+1<=cnt)q.push(node(u.x,u.y+1));
}
cout<<ans<<endl;
return 0;
}```
CF1313C2 Skyscrapers (hard version).cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define int long long
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=500005;
const int inf=100000000000000;
int dp1[N],dp2[N],n,a[N],ans[N],pre[N],suf[N],lp[N],rp[N],st[N],top,p,sum;
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=1;i<=n;++i) {
while(top&&a[st[top]]>a[i])--top;
lp[i]=st[top];st[++top]=i;
}
top=0,st[++top]=n+1;
for(rint i=n;i>=1;--i) {
while(top&&a[st[top]]>a[i])--top;
rp[i]=st[top];st[++top]=i;
}
for(rint i=1;i<=n;++i)dp1[i]=(i-lp[i])*a[i]+dp1[lp[i]];
for(rint i=n;i>=1;--i)dp2[i]=(rp[i]-i)*a[i]+dp2[rp[i]];
for(rint i=1;i<=n;++i)if(dp1[i]+dp2[i]-a[i]>sum)sum=dp1[i]+dp2[i]-a[i],p=i;
for(rint i=p,tmp=a[p];i>=1;--i)ans[i]=min(a[i],tmp),tmp=ans[i];
for(rint i=p,tmp=a[p];i<=n;++i)ans[i]=min(a[i],tmp),tmp=ans[i];
for(rint i=1;i<=n;++i)printf("%lld ",ans[i]);
return 0;
}```
P4983 忘情.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int inf=1e9;
int n,m,a[N],s[N];
int dp[N],cnt[N],ANS,ans,q[N],H,T;
int X(int i){return s[i];}
int Y(int i){return dp[i]+s[i]*s[i]-2*s[i];}
double slope(int i,int j) {
return 1.0*(Y(i)-Y(j))/(X(i)-X(j));
}
int val(int l,int r) {
return (s[r]-s[l-1]+1)*(s[r]-s[l-1]+1);
}
int check(int x) {
q[H=T=1]=0;
for(int i=1;i<=n;++i) {
while(H<T&&slope(q[H],q[H+1])<=2*s[i])++H;
int j=q[H];cnt[i]=cnt[j]+1,dp[i]=dp[j]+val(j+1,i)+x;
while(H<T&&slope(q[T-1],q[T])>=slope(q[T],i))--T;
q[++T]=i;
}
ANS=dp[n];return cnt[n];
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd(),s[i]=s[i-1]+a[i];
int l=0,r=1e15;
while(l<=r) {
int mid=(l+r)>>1,k=check(mid);
if(k>=m)ans=ANS-m*mid,l=mid+1;
else r=mid-1;
}
printf("%lld\n",ans);
return 0;
}```
CF1392D Omkar and Bed Wars.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int inf=1e9+7;
int n,T,a[N],ans,st;
char s[N];
void Main() {
n=rd(),ans=0,st=-1;
scanf("%s",s);
for(int i=0;i<n-1;++i)if(s[i]!=s[i+1]){st=i+1;break;}
if(!~st)return printf("%lld\n",(n+2)/3),void();
for(int i=st,j=1;j<=n;++i,++j)a[j]=s[i%n]=='R';
a[n+1]=a[1];
for(int i=1,len=0;i<=n;++i) {
++len;
if(a[i]!=a[i+1]) ans+=len/3,len=0;
}
printf("%lld\n",ans);
}
signed main() {for(T=rd();T;--T)Main();}```
CF893C Rumor.cpp
```// Problem: C. Rumor
// Contest: Codeforces - Educational Codeforces Round 33 (Rated for Div. 2)
// URL: https://codeforces.com/contest/893/problem/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m,a[N],val[N],F[N],ans;
int anc(int x){return x==F[x]?x:F[x]=anc(F[x]);}
signed main(){
n=read(),m=read();
rep(i,1,n)a[i]=read(),val[i]=a[i],F[i]=i;
rep(i,1,m){
int x=read(),y=read();
ckmin(val[anc(y)],val[anc(x)]);
F[anc(x)]=anc(y);
}
rep(i,1,n)if(anc(i)==i)ans+=val[i];
cout<<ans<<'\n';
}```
CF1333C Eugene and an array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
inline LL rd(){
LL x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
LL n,a[N],ans;
map<LL,int>mp;
signed main() {
n=rd();mp[0]=0;
for(rint i=1;i<=n;++i) a[i]=rd()+a[i-1];
for(rint i=1,pos=0;i<=n;++i) {
if(mp.count(a[i]))pos=max(pos,mp[a[i]]+1);
ans+=i-pos;
mp[a[i]]=i;
}
printf("%lld\n",ans);
return 0;
}```
CF1139D Steps to One.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define mod 1000000007
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*res*n%mod;return res;}
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int m,mu[N],pri[N],cnt,f[N],dp[N],inv[N],ans;
bool vis[N];
vector<int>d[N];
void Sieve(const int&K){
mu[1]=1;
for(int i=2;i<=K;++i){
if(!vis[i])mu[i]=-1,pri[++cnt]=i;
for(int j=1;i*pri[j]<=K;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0){mu[i*pri[j]]=0;break;}
mu[i*pri[j]]=-mu[i];
}
}
for(int i=1;i<=K;++i)
for(int j=1;i*j<=K;++j)
d[i*j].pb(i);
inv[1]=1;
for(int i=2;i<=K;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
}
signed main(){
cin>>m,Sieve(m);
dp[1]=0;
for(int i=2;i<=m;++i){
int res=m;
for(int j:d[i])
fmod(res+=1ll*(m/j)*f[j]%mod);
dp[i]=1ll*res*inv[m-m/i]%mod;
for(int j=1;i*j<=m;++j)
fmod(f[i*j]+=dp[i]*mu[j]);
}
ans=m;
for(int i=1;i<=m;++i)fmod(ans+=dp[i]);
printf("%lld\n",1ll*ans*inv[m]%mod);
return 0;
}```
P2822 组合数问题.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=2005;
int T,k,n,m,C[N][N];
void init(const int N=2000){
C[0][0]=1;
for(int i=1;i<=N;++i){
C[i][0]=1;
for(int j=1;j<=i;++j)C[i][j]=(C[i-1][j]+C[i-1][j-1])%k;
}
// for(int i=0;i<=10;++i){
// for(int j=0;j<=10;++j)std::cerr<<C[i][j]<<' ';
// std::cerr<<'\n';
// }
// std::cerr<<'\n';
for(int i=0;i<=N;++i)
for(int j=0;j<=i;++j)C[i][j]=!C[i][j];
// for(int i=0;i<=10;++i){
// for(int j=0;j<=10;++j)std::cerr<<C[i][j]<<' ';
// std::cerr<<'\n';
// }
// std::cerr<<'\n';
for(int i=0;i<=N;++i)
for(int j=0;j<=N;++j){
if(i)C[i][j]+=C[i-1][j];
if(j)C[i][j]+=C[i][j-1];
if(i&&j)C[i][j]-=C[i-1][j-1];
}
// for(int i=0;i<=10;++i){
// for(int j=0;j<=10;++j)std::cerr<<C[i][j]<<' ';
// std::cerr<<'\n';
// }
}
signed main(){
T=read(),k=read();
init();
while(T--)n=read(),m=read(),printf("%d\n",C[n][m]);
return 0;
}
/*
2 5
4 5
6 7
*/```
CF980D Perfect Groups.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=5005;
int n,a[N],pre[N],ans[N];
void f(int&n){
int tmp=abs(n);
for(int i=2;i*i<=tmp;++i)
while(n%(i*i)==0)n/=i*i;
}
signed main(){
n=read();
rep(i,1,n)f(a[i]=read());
rep(i,1,n)per(j,i-1,1)if(a[j]==a[i]){pre[i]=j;break;}
rep(i,1,n){
int now=0;
rep(j,i,n){
if(pre[j]<i&&a[j])++now;
now?++ans[now]:++ans[1];
}
}
rep(i,1,n)printf("%d ",ans[i]);
return 0;
}```
CF235C Cyclical Quest.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 1000005
#define T (N<<1)
int n, Q, m, tag[T];
char str[N];
int trans[T][26], link[T], mxlen[T], tot = 1;
int cnt[T], q[T], t[N];
int extend(int c,int lst){
int p = lst, np = ++ tot; mxlen[np] = mxlen[p] + 1;
for (;p && !trans[p][c]; p = link[p]) trans[p][c] = np;
if (!p) link[np] = 1;
else {
int q = trans[p][c];
if(mxlen[p] + 1 == mxlen[q]) link[np] = q;
else{
int nq = ++ tot; mxlen[nq] = mxlen[p] + 1;
for(int i = 0; i < 26; ++ i) trans[nq][i] = trans[q][i];
link[nq] = link[q], link[q] = link[np] = nq;
for(; p && trans[p][c] == q; p = link[p]) trans[p][c] = nq;
}
}
return ++cnt[np], np;
}
signed main(){
scanf("%s%d", str, &Q), n = strlen(str);
for (int i = 0, lst = 1; i < n; ++ i) lst = extend(str[i] - 'a', lst);
for (int i = 1; i <= tot; ++ i) ++ t[mxlen[i]];
for (int i = 1; i <= n; ++ i) t[i] += t[i - 1];
for (int i = 1; i <= tot; ++ i) q[t[mxlen[i]] -- ] = i;
for (int i = tot; i >= 1; -- i) cnt[link[q[i]]] += cnt[q[i]];
for (int t = 1; t <= Q; ++ t) {
static char S[T];
scanf("%s", S), m = strlen(S);
for (int i = 0; i < m; ++ i) S[i + m] = S[i];
int p = 1, now = 0, res = 0;
for (int i = 0; i < m << 1; ++ i) {
int c = S[i] - 'a';
if (trans[p][c]) p = trans[p][c], ++ now;
else {
for (; p && ! trans[p][c]; p = link[p]);
if (!p) now = 0, p = 1;
else now = mxlen[p] + 1, p = trans[p][c];
}
if (now >= m){
while (mxlen[link[p]] >= m) now = mxlen[link[p]], p = link[p];
if (tag[p] != t) res += cnt[p], tag[p] = t;
}
}
printf("%d\n", res);
}
}
/*
baabaabaaa
5
a
ba
baa
aabaa
aaba
*/```
P3810 【模板】三维偏序（陌上花开）（cdq分治）.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,k,f[N],tr[N],ans[N],tot;
struct node{
int a,b,c,s,id;
node(){a=b=c=id=0;}
inline bool operator == (const node&t)const{return a==t.a&&b==t.b&&c==t.c;}
}a[N],cpy[N];
inline bool cmp1(const node&a,const node&b){return a.a!=b.a?a.a<b.a:a.b!=b.b?a.b<b.b:a.c<b.c;}
inline bool cmp2(const node&a,const node&b){return a.b!=b.b?a.b<b.b:a.c<b.c;}
void add(int x,int d){for(int i=x;i<=k;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
void merge(int l,int mid,int r){
int i=l,j=mid+1,k=l;
while(i<=mid&&j<=r){
if(cmp2(a[i],a[j]))cpy[k++]=a[i++];
else cpy[k++]=a[j++];
}
while(i<=mid)cpy[k++]=a[i++];
while(j<=r)cpy[k++]=a[j++];
for(int i=l;i<=r;++i)a[i]=cpy[i];
}
void cdq(int l,int r){
if(l==r)return;
int mid=(l+r)>>1,i,j;
cdq(l,mid),cdq(mid+1,r);
//sort(a+l,a+mid+1,cmp2),sort(a+mid+1,a+r+1,cmp2);
for(i=mid+1,j=l;i<=r;++i){
for(;j<=mid&&a[j].b<=a[i].b;++j)add(a[j].c,a[j].s);
f[a[i].id]+=ask(a[i].c);
}
for(--j;j>=l;--j)add(a[j].c,-a[j].s);
merge(l,mid,r);
}
signed main(){
n=read(),k=read();
rep(i,1,n)a[i].a=read(),a[i].b=read(),a[i].c=read();
sort(a+1,a+n+1,cmp1);
for(int i=1;i<=n;){
int j=i;
while(j+1<=n&&a[j+1]==a[i])++j;
cpy[++tot]=a[i],cpy[tot].s=j-i+1,cpy[tot].id=tot,f[tot]=j-i;
i=j+1;
}
rep(i,1,tot)a[i]=cpy[i];
cdq(1,tot);
for(int i=1;i<=tot;++i)ans[f[a[i].id]]+=a[i].s;
for(int i=0;i<n;++i)printf("%d\n",ans[i]);
return 0;
}```
P5633 最小度限制生成树.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=50010;
const int M=500010;
struct node {
int u,v,d;
}a[M],b[M],c[M];
int n,m,need,s;
int cnta,cntb,cntc;
LL sumval,ans;
int fa[N];
int find(int x) {return x==fa[x]?x:fa[x]=find(fa[x]);}
int cns(const node &a) {return a.u==s||a.v==s;}
bool cmp(const node &a,const node &b) {return a.d<b.d;}
void msort(node *a,node *b) {
int i=1,j=1;cntc=0;
while(i<=cnta&&j<=cntb) {
if(a[i].d<=b[j].d)c[++cntc]=a[i++];
else c[++cntc]=b[j++];
}
while(i<=cnta)c[++cntc]=a[i++];
while(j<=cntb)c[++cntc]=b[j++];
}
int check(int x) {
for(int i=1;i<=n;++i)fa[i]=i;
for(int i=1;i<=cnta;++i)a[i].d+=x;
msort(a,b);
int res=0,num=0;sumval=0;
for(int i=1;i<=m&&num<n-1;++i) {
int fx=find(c[i].u),fy=find(c[i].v);
if(fx!=fy)sumval+=c[i].d,res+=cns(c[i]),fa[fx]=fy,++num;
}
for(int i=1;i<=cnta;++i)a[i].d-=x;
return res;
}
signed main() {
n=rd(),m=rd(),s=rd(),need=rd();
int l=0,r=0,res;
for(int i=1;i<=m;++i) {
int x=rd(),y=rd(),z=rd();
if(x==s||y==s)++cnta,a[cnta].u=x,a[cnta].v=y,a[cnta].d=z;
else ++cntb,b[cntb].u=x,b[cntb].v=y,b[cntb].d=z;
r=max(r,z);
}
l=-r;
sort(a+1,a+cnta+1,cmp);
sort(b+1,b+cntb+1,cmp);
if(check(l)<need)return puts("Impossible"),0;
if(check(r)>need)return puts("Impossible"),0;
while(l<=r) {
int mid=(l+r)>>1,k=check(mid);
if(k>=need)res=mid,l=mid+1;
else r=mid-1;
}
check(res);
printf("%lld\n",sumval-1ll*res*need);
return 0;
}
```
CF1207G Indie Album.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int rdc(){
char ch=getchar();
while(!isalpha(ch))ch=getchar();
return ch-'a';
}
#define N 400005
int n,m,ch[N][26],ed[N],to[N],ln[N],rn[N],tmr,tr[N],tot,ans[N],fail[N],trie[N][26],cnt;
vector<int>e[N],q[N];
void insert(char*str,int id){
int u=0;
for(int i=0,len=strlen(str);i<len;++i){
int c=str[i]-'a';
if(!ch[u][c])ch[u][c]=++cnt;
u=ch[u][c];
}
ed[id]=u;
}
void build_fail(){
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()){
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=cnt;++i)e[fail[i]].pb(i);
}
void dfs1(int u){
ln[u]=++tmr;
for(int v:e[u])dfs1(v);
rn[u]=tmr;
}
void add(int x,int d){if(!x)return;for(int i=x;i<=tmr;i+=i&-i)tr[i]+=d;}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)res+=tr[i];return res;}
void dfs2(int u1,int u2){
// cerr<<"dfs2:"<<u1<<' '<<u2<<'\n';
// cerr<<u2<<' '<<ln[u2]<<'\n';
add(ln[u2],1);
for(int i:q[u1])ans[i]=ask(rn[ed[i]])-ask(ln[ed[i]]-1);
for(int i=0;i<26;++i)if(trie[u1][i])dfs2(trie[u1][i],ch[u2][i]);
add(ln[u2],-1);
}
signed main(){
n=read();
for(int i=1;i<=n;++i){
int op=read(),pre=0,x;
if(op==2)pre=read();
x=rdc();
if(!trie[to[pre]][x])trie[to[pre]][x]=++tot;
to[i]=trie[to[pre]][x];
}
m=read();
for(int i=1;i<=m;++i){
int x=read();static char str[N];
scanf("%s",str);
insert(str,i),q[to[x]].pb(i);
}
// cerr<<"qwq\n";
build_fail(),dfs1(0),dfs2(0,0);
for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
return 0;
}```
CF555E Case of Computer Network.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
const int M=N<<1;
int n,m,q,ans=1;
int hed[N],et=1;
struct edge{int nx,to;}e[M];
inline void adde(int u,int v){e[++et].to=v,e[et].nx=hed[u],hed[u]=et;}
int dfn[N],low[N],tmr,bel[N],D;
int col[N],C;
bool bri[M];
vector<int>g[N];
int bz[20][N],dep[N],df0[N],df1[N];
void tarjan(int u,int ft){
dfn[u]=low[u]=++tmr,bel[u]=D;
bool flg=0;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(v==ft&&!flg){flg=1;continue;}
if(!dfn[v]){
tarjan(v,u),ckmin(low[u],low[v]);
if(low[v]>dfn[u])bri[i]=bri[i^1]=1;
}else ckmin(low[u],dfn[v]);
}
}
void dfsc(int u){
if(col[u])return;
col[u]=C;
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(!bri[i])dfsc(v);
else {
if(col[v])g[col[u]].pb(col[v]),g[col[v]].pb(col[u]);
}
}
}
void dfs1(int u,int ft){
dep[u]=dep[bz[0][u]=ft]+1;
for(int i=1;1<<i<dep[u];++i)bz[i][u]=bz[i-1][bz[i-1][u]];
for(int v:g[u]){
if(v==ft)continue;
dfs1(v,u);
}
}
inline int LCA(int x,int y){
if(dep[x]<dep[y])x^=y^=x^=y;
for(int i=0,j=dep[x]-dep[y];i<=19;++i)
if(j>>i&1)x=bz[i][x];
if(x==y)return x;
for(int i=19;i>=0;--i)
if(bz[i][x]!=bz[i][y])x=bz[i][x],y=bz[i][y];
return bz[0][x];
}
void dfs2(int u,int ft){
for(int v:g[u]){
if(v==ft)continue;
dfs2(v,u);
df0[u]+=df0[v],df1[u]+=df1[v];
}
if(u!=1)ans&=!df0[u]||!df1[u];
}
signed main(){
n=read(),m=read(),q=read();
rep(i,1,m){
int x=read(),y=read();
adde(x,y),adde(y,x);
}
rep(i,1,n)if(!dfn[i])++D,tarjan(i,0);
rep(i,1,n)if(!col[i])++C,dfsc(i);
rep(i,1,C)sort(g[i].begin(),g[i].end()),
g[i].resize(unique(g[i].begin(),g[i].end())-g[i].begin());
rep(i,1,n)if(!dep[i])dfs1(i,0);
rep(i,1,q){
int x=read(),y=read();
if(bel[x]!=bel[y])return puts("No")&0;
if(col[x]==col[y])continue;
int lca=LCA(col[x],col[y]);
++df0[col[x]],--df0[lca];
++df1[col[y]],--df1[lca];
}
rep(i,1,n)if(dep[i]==1)dfs2(i,0);
puts(ans?"Yes":"No");
return 0;
}```
P1005 矩阵取数游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
#define N 85
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
string plu(string a,string b) {
string res="";
while(a.length()<b.length())a='0'+a;
while(b.length()<a.length())b='0'+b;
int jw=0,tmp=0;
for(rint i=a.length()-1;i>=0;--i) {
tmp=jw+a[i]-'0'+b[i]-'0';
jw=tmp/10,tmp%=10;
res=(char)(tmp+'0')+res;
}
if(jw)res=(char)(jw+'0')+res;
return res;
}
int x[45],y[45];
string mul(string a,int b) {
string res="";
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
int jw=0;
for(rint i=a.length()-1;i>=0;--i)
x[i]=a[a.length()-i-1]-'0';
for(rint i=0;i<a.length();++i) {
y[i]=b*x[i]+jw;
jw=y[i]/10,y[i]%=10;
}
int top=a.length()-1;
while(jw>0)y[++top]=jw%10,jw/=10;
while(!y[top]&&top>=1)--top;
for(rint i=0;i<=top;++i)
res=(char)(y[i]+'0')+res;
return res;
}
string max(string a,string b) {
if(a.length()<b.length())return b;
if(a.length()>b.length())return a;
for(rint i=0;i<a.length();++i)
if(a[i]^b[i])return a[i]<b[i]?b:a;
return a;
}
int n,m;
string bin[N],ans="0",dp[N][N];
int a[N];
int main() {
n=rd(),m=rd();
bin[0]="1";for(rint i=1;i<=m;++i)bin[i]=mul(bin[i-1],2);
while(n--) {
for(rint i=1;i<=m;++i)a[i]=rd();
for(rint i=1;i<=m;++i)
for(rint j=1;j<=m;++j)
dp[i][j]="0";
for(rint i=1;i<=m;++i)
for(rint j=m;j>=i;--j) {
dp[i][j]="0";
dp[i][j]=max(dp[i][j],plu(dp[i-1][j],mul(bin[m-j+i-1],a[i-1])));
dp[i][j]=max(dp[i][j],plu(dp[i][j+1],mul(bin[m-j+i-1],a[j+1])));
}
string tmp="0";
for(rint i=1;i<=m;++i)
tmp=max(tmp,plu(dp[i][i],mul(bin[m],a[i])));
ans=plu(ans,tmp);
}
cout<<ans<<endl;
return 0;
} ```
P6292 区间本质不同子串个数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
template<int L>
struct Suffix_Automation{
#define N (L+5)
#define S (N<<1)
int trans[S][26],tot,mxlen[S],link[S],to[S];
int q[S],t[S],rt[S];
int New(){++tot;memset(trans[tot],0,sizeof(trans[tot]));mxlen[tot]=link[tot]=0;return tot;}
Suffix_Automation(){tot=0,New();}
void clear(){tot=0;New();}
int extend(int c,int lst,int id,int op=0){
int p=lst,np=New();mxlen[np]=mxlen[p]+1;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[p]+1==mxlen[q])link[np]=q;
else{
int nq=New();mxlen[nq]=mxlen[p]+1;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void insert(char*str,int op=0){
int n=strlen(str);
for(int i=0,lst=1;i<n;++i)lst=extend(str[i]-'a',lst,i+1),to[i+1]=lst;
}
void rsort(){
for(int i=1;i<=tot;++i)t[i]=0;
for(int i=1;i<=tot;++i)++t[mxlen[i]];
for(int i=1;i<=tot;++i)t[i]+=t[i-1];
for(int i=1;i<=tot;++i)q[t[mxlen[i]]--]=i;
}
LL distinct_substring(){
LL res=0;
for(int i=1;i<=tot;++i)res+=mxlen[i]-mxlen[link[i]];
return res;
}
#undef S
#undef N
};
template<int N,class typ>
struct SegmentTree{
#define T (N<<2)
typ sum[T],mx[T],tag[T];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){sum[p]=sum[lc]+sum[rc],mx[p]=max(mx[lc],mx[rc]);}
void clear(int p=1,int l=1,int r=N){
sum[p]=mx[p]=tag[p]=0;
if(l==r)return;
int mid=(l+r)>>1;
clear(lc,l,mid),clear(rc,mid+1,r);
}
void build(typ*a,int p=1,int l=1,int r=N){
sum[p]=mx[p]=tag[p]=0;
if(l==r){
sum[p]=mx[p]=a[l];
return;
}
int mid=(l+r)>>1;
build(a,lc,l,mid),build(a,rc,mid+1,r);
pushup(p);
}
void pushdown(int p,int l,int r){
if(tag[p]){
int mid=(l+r)>>1;
tag[lc]+=tag[p],tag[rc]+=tag[p];
sum[lc]+=tag[p]*(mid-l+1),sum[rc]+=tag[p]*(r-mid);
mx[lc]+=tag[p],mx[rc]+=tag[p];
tag[p]=0;
}
}
void update(int ql,int qr,typ k,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr){
sum[p]+=k*(r-l+1),mx[p]+=k,tag[p]+=k;
return;
}
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,k,lc,l,mid);
if(mid<qr)update(ql,qr,k,rc,mid+1,r);
pushup(p);
}
typ query_sum(int ql,int qr,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr)return sum[p];
pushdown(p,l,r);
int mid=(l+r)>>1;
if(qr<=mid)return query_sum(ql,qr,lc,l,mid);
if(mid<ql)return query_sum(ql,qr,rc,mid+1,r);
return query_sum(ql,qr,lc,l,mid)+query_sum(ql,qr,rc,mid+1,r);
}
typ query_max(int ql,int qr,int p=1,int l=1,int r=N){
if(ql<=l&&r<=qr)return mx[p];
pushdown(p,l,r);
int mid=(l+r)>>1;
if(qr<=mid)return query_max(ql,qr,lc,l,mid);
if(mid<ql)return query_max(ql,qr,rc,mid+1,r);
return max(query_max(ql,qr,lc,l,mid),query_max(ql,qr,rc,mid+1,r));
}
#undef lc
#undef rc
#undef T
};
template<int N>
struct Link_Cut_Tree{
static const int O=N+5;
int ch[O][2],fa[O],sum[O],val[O],id[O],tag[O];
bool fl[O];
Link_Cut_Tree(){
memset(ch,0,sizeof(ch));
memset(fa,0,sizeof(fa));
memset(val,0,sizeof(val));
memset(sum,0,sizeof(sum));
memset(id,0,sizeof(id));
memset(fl,0,sizeof(fl));
memset(tag,0,sizeof(tag));
}
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){}
void addtag(int x,int d){
val[x]=d,tag[x]=d;
}
void pushdown(int x){
if(fl[x]){
fl[x]^=1,fl[ch[x][0]]^=1,fl[ch[x][1]]^=1;
swap(ch[x][0],ch[x][1]);
}
if(tag[x]){
if(ch[x][0])addtag(ch[x][0],tag[x]);
if(ch[x][1])addtag(ch[x][1],tag[x]);
tag[x]=0;
}
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;
fa[y]=x,fa[x]=z;
pushup(y);
}
void splay(int x){
static int stk[O],top;
int y=x,z;stk[top=1]=y;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[z][1]==y)^(ch[y][1]==x)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){
access(x),splay(x),fl[x]^=1;
}
int findroot(int x){
access(x),splay(x);
while(ch[x][0])pushdown(x),x=ch[x][0];
return splay(x),x;
}
void split(int x,int y){
makeroot(x),access(y),splay(y);
}
void link(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)!=x)splay(y),fa[x]=y;
}else makeroot(x),fa[x]=y;
}
void cut(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)==x&&fa[y]==x&&!ch[y][0])
fa[y]=ch[x][1]=0;
}else split(x,y),fa[x]=ch[y][0]=0,pushup(y);
}
int ask_sum(int x,int y){return split(x,y),sum[y];}
pair<int,int>ask_max(int x,int y){return split(x,y),mkp(val[id[y]],id[y]);}
};
/*第一次拉板子呢，有点激动.草草草错光了是什么鬼啊*/
const int N=200000;
int n,m;
LL ans[N+5];
char str[N+5];
vector<pair<int,int> >q[N+5];
Suffix_Automation<N>sam;
SegmentTree<N,LL>seg;
Link_Cut_Tree<N*2>lct;
void Newaccess(int x,int id){
int y=0;
for(;x;x=lct.fa[y=x]){
lct.splay(x);
int tmp=lct.val[x];
if(tmp)seg.update(tmp-sam.mxlen[x]+1,tmp-sam.mxlen[lct.fa[x]],-1);
lct.ch[x][1]=y;
}
lct.addtag(y,id),seg.update(1,id,1);
}
signed main(){
scanf("%s%d",str+1,&m),n=strlen(str+1),sam.insert(str+1),seg.clear();
for(int i=1;i<=sam.tot;++i)lct.fa[i]=sam.link[i];
for(int i=1;i<=m;++i){
int l=read(),r=read();
q[r].pb(mkp(l,i));
}
for(int i=1;i<=n;++i){
Newaccess(sam.to[i],i);
for(int j=0;j<sz(q[i]);++j)
ans[q[i][j].se]=seg.query_sum(q[i][j].fi,i);
}
for(int i=1;i<=m;++i)printf("%lld\n",ans[i]);
}```
AT2045 [AGC004E] Salvage Robots.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
inline char rdc(){
char ch=getchar();
while (ch!='.'&&ch!='o'&&ch!='E')ch=getchar();
return ch;
}
const int N=102;
int n,m,sx,sy;
short s1[N][N],s2[N][N],dp[N][N][N][N],a[N][N],ans;
signed main(){
n=read(),m=read();
rep(i,1,n)rep(j,1,m){
char x=rdc();
if(x=='E')sx=i,sy=j;
s1[i][j]=s1[i-1][j]+(x=='o');
s2[i][j]=s2[i][j-1]+(x=='o');
}
for(int l=0;l<=sy-1;++l)
for(int r=0;r<=m-sy;++r)
for(int u=0;u<=sx-1;++u)
for(int d=0;d<=n-sx;++d){
ckmax(ans,dp[l][r][u][d]);
if(u+d<sx-1)ckmax(dp[l][r][u+1][d],short(dp[l][r][u][d]+s2[sx-u-1][min(m-l,sy+r)]-s2[sx-u-1][max(r,sy-l-1)]));
if(u+d<n-sx)ckmax(dp[l][r][u][d+1],short(dp[l][r][u][d]+s2[sx+d+1][min(m-l,sy+r)]-s2[sx+d+1][max(r,sy-l-1)]));
if(l+r<sy-1)ckmax(dp[l+1][r][u][d],short(dp[l][r][u][d]+s1[min(n-u,sx+d)][sy-l-1]-s1[max(d,sx-u-1)][sy-l-1]));
if(l+r<m-sy)ckmax(dp[l][r+1][u][d],short(dp[l][r][u][d]+s1[min(n-u,sx+d)][sy+r+1]-s1[max(d,sx-u-1)][sy+r+1]));
}
printf("%d\n",ans);
return 0;
}```
CF1304C Air Conditioner.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=110;
int T,t[N],l[N],r[N],n,m,L,R;
bool flag;
int main() {
T=rd();
while(T--) {
n=rd(),m=rd();L=R=m;flag=1;
for(rint i=1;i<=n;++i)t[i]=rd(),l[i]=rd(),r[i]=rd();
for(rint i=1;i<=n;++i) {
L-=t[i]-t[i-1],R+=t[i]-t[i-1];
if(L>r[i]||R<l[i]) {flag=0;break;}
L=max(L,l[i]),R=min(R,r[i]);
}
puts(flag?"YES":"NO");
}
return 0;
}```
P4081 [USACO17DEC]Standing Out from the Herd P.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pb(x) push_back(x)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define N 100005
#define T (N<<1)
int n,tag[T],trans[T][26],mxlen[T],link[T],tot=1,lst;
LL ans[N];
vector<int>e[T];
int extend(int c,int id){
if(trans[lst][c]){
int p=lst,q=trans[p][c];
if(mxlen[q]==mxlen[p]+1)return tag[q]=-1,q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
tag[nq]=id;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
return nq;
}
}
int p=lst,np=++tot;mxlen[np]=mxlen[p]+1;tag[np]=id;
for(;p&&!trans[p][c];p=link[p])trans[p][c]=np;
if(!p)link[np]=1;
else{
int q=trans[p][c];
if(mxlen[q]==mxlen[p]+1)link[np]=q;
else{
int nq=++tot;mxlen[nq]=mxlen[p]+1;
tag[nq]=id;
for(int i=0;i<26;++i)trans[nq][i]=trans[q][i];
link[nq]=link[q],link[q]=link[np]=nq;
for(;p&&trans[p][c]==q;p=link[p])trans[p][c]=nq;
}
}
return np;
}
void dfs(int u){
for(int v:e[u]){
dfs(v);
if(tag[v]!=tag[u])tag[u]=-1;
}
}
signed main(){
n=read();
for(int i=1;i<=n;++i){
static char str[N];
scanf("%s",str),lst=1;
for(int j=0,m=strlen(str);j<m;++j)lst=extend(str[j]-'a',i);
}
for(int i=1;i<=tot;++i)e[link[i]].pb(i);
dfs(1);
for(int i=1;i<=tot;++i)if(~tag[i])ans[tag[i]]+=mxlen[i]-mxlen[link[i]];
for(int i=1;i<=n;++i)printf("%lld\n",ans[i]);
return 0;
}```
CF1406D Three Sequences.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
int n,a[N],now;
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=n;i>1;--i)a[i]-=a[i-1],now+=max(0ll,a[i]);
printf("%lld\n",(now+a[1]+1)>>1);
for(int q=rd();q;--q) {
int l=rd(),r=rd(),x=rd();
if(l>1)now-=max(0ll,a[l]),now+=max(0ll,a[l]+=x);
else a[1]+=x;
if(r<n)now-=max(0ll,a[r+1]),now+=max(0ll,a[r+1]-=x);
printf("%lld\n",(now+a[1]+1)>>1);
}
return 0;
}
```
CF1131A Sea Battle.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
signed main(){
int a=read(),b=read(),c=read(),d=read();
printf("%d\n",(b+d+max(a,c))*2+4);
return 0;
}```
P2825 [HEOI2016 TJOI2016]游戏.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,y,x) for(int i=y,i##end=x;i>=i##end;--i)
#define broken cerr<<"lqx AK:"<<__LINE__<<' '<<__FUNCTION__<<endl
#define outedge cerr<<u<<' '<<v<<' '<<fl<<'\n'
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int K=55;
const int N=5005;
const int M=N*4*2;
const int inf=0x3f3f3f3f;
int n,m,a[K][K],idx[K][K],idy[K][K],tot;
int dis[N],cur[N],mf,S,T,hed[N],et=1;
struct edge{int nx,to,fl;}e[M];
void addedge(int u,int v,int fl){e[++et].to=v,e[et].nx=hed[u],e[et].fl=fl,hed[u]=et;}
void adde(int u,int v,int fl){addedge(u,v,fl),addedge(v,u,0);}
bool bfs(int s,int t){
queue<int>q;
rep(i,1,tot)cur[i]=hed[i],dis[i]=0;
q.push(s),dis[s]=1;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=hed[u];i;i=e[i].nx){
int v=e[i].to;
if(e[i].fl&&!dis[v]){
dis[v]=dis[u]+1,q.push(v);
if(v==t)return 1;
}
}
}
return 0;
}
int dfs(int u,int fl){
if(u==T)return fl;
int rl,used=0;
for(int i=cur[u];i;i=e[i].nx){
int v=e[i].to;cur[u]=i;
if(e[i].fl&&dis[v]==dis[u]+1){
rl=dfs(v,min(e[i].fl,fl-used));
if(rl){
e[i].fl-=rl,e[i^1].fl+=rl,used+=rl;
if(used==fl)break;
}
}
}
return used;
}
signed main(){
n=read(),m=read(),S=++tot,T=++tot;
memset(a,-1,sizeof(a));
rep(i,1,n)rep(j,1,m){
char ch=getchar();
while(ch!='x'&&ch!='*'&&ch!='#')ch=getchar();
if(ch=='#')a[i][j]=-1;
else if(ch=='x')a[i][j]=0;
else a[i][j]=1;
}
rep(i,1,n)rep(j,1,m){
if(!~a[i][j])continue;
if(!~a[i][j-1])idx[i][j]=++tot,adde(S,tot,1);
else idx[i][j]=idx[i][j-1];
}
rep(j,1,m)rep(i,1,n){
if(!~a[i][j])continue;
if(!~a[i-1][j])idy[i][j]=++tot,adde(tot,T,1);
else idy[i][j]=idy[i-1][j];
}
rep(i,1,n)rep(j,1,m)if(a[i][j]==1)adde(idx[i][j],idy[i][j],1);
while(bfs(S,T))mf+=dfs(S,inf);
printf("%d\n",mf);
return 0;
}```
SP1553 BACKUP - Backup Files.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
const int inf=1e13;
int n,m,a[N];
LL ans=-1145141919810,f[N],g[N],ANS;
int check(int x){
for(int i=1;i<=n;++i)a[i]+=x;
if(a[1]>=0)f[1]=a[1],g[1]=1;
else f[1]=0,g[1]=0;
for(int i=2;i<=n;++i) {
if(f[i-1]>f[i-2]+a[i])f[i]=f[i-1],g[i]=g[i-1];
else f[i]=f[i-2]+a[i],g[i]=g[i-2]+1;
}
for(int i=1;i<=n;++i)a[i]-=x;
ANS=f[n];return g[n];
}
void Main() {
n=rd(),m=rd();
int l=0,r=0;
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<n;++i)a[i]=a[i]-a[i+1];
--n;
l=-inf,r=inf;
while(l<=r) {
int mid=(l+r)>>1,k=check(mid);
if(k>=m)ans=ANS-1ll*m*mid,r=mid-1;
else l=mid+1;
}
printf("%lld\n",-ans);
}
signed main() {
for(int T=rd();T;--T)Main();
}```
P3250 [HNOI2016]网络.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
const int M = 200005;
int n, m, nu, nq, ans[M], tr[N], id[M];
int st[N], ed[N], tmr, top[N], fa[N], dep[N], son[N], siz[N];
struct edge{ int nx, to; } e[N << 1];
int hed[N], et;
inline void adde(int u, int v) {
e[++et].nx = hed[u], e[et].to = v, hed[u] = et;
}
struct UPD {
int l, r, x, y, v, lca;
}A[M];
struct ASK {
int tim, x, id;
}B[M], B1[M], B2[M];
struct node {
int tim, id, op;
}C[M << 1];
void dfs1(int u, int ft) {
st[u] = ++tmr, fa[u] = ft, dep[u] = dep[ft] + 1, siz[u] = 1;
for(int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to; if(v == ft) continue;
dfs1(v, u), siz[u] += siz[v];
if(siz[v] > siz[son[u]]) son[u] = v;
}
ed[u] = tmr;
}
void dfs2(int u, int tp) {
top[u] = tp;
if(son[u]) dfs2(son[u], tp);
for(int i = hed[u]; i; i = e[i].nx) {
int v = e[i].to; if(v == fa[u] || v == son[u]) continue;
dfs2(v, v);
}
}
inline int LCA(int x, int y) {
while(top[x] != top[y])
dep[top[x]] >= dep[top[y]] ? x = fa[top[x]] : y = fa[top[y]];
return dep[x] < dep[y] ? x : y;
}
inline bool cmp1(const UPD &a, const UPD &b) {
return a.v < b.v;
}
inline bool cmp2(const node &a,const node &b) {
return a.tim < b.tim;
}
inline void add(int x, int d) {
if(!x)return;
for(int i = x; i <= n; i += i & -i) tr[i] += d;
}
inline int ask(int x) {
int res = 0;
for(int i = x; i > 0; i -= i & -i) res += tr[i];
return res;
}
inline int ask(int l, int r) {
return ask(r) - ask(l - 1);
}
void solve(int l, int r, int x, int y) {
if(x > y) return;
if(l == r) {
for(int i = x; i <= y; ++i) ans[B[i].id] = A[l].v;
return;
}
int mid = (l + r) >> 1, tot = 0, t1 = 0, t2 = 0, t = x;
for(int i = mid + 1; i <= r; ++i)
C[++tot].tim = A[i].l, C[tot].id = i, C[tot].op = 1,
C[++tot].tim = A[i].r, C[tot].id = i, C[tot].op = -1;
for(int i = x; i <= y; ++i)
C[++tot].tim = B[i].tim, C[tot].id = i, C[tot].op = 0;
sort(C + 1, C + tot + 1, cmp2);
for(int i = 1, now = 0; i <= tot; ++i) {
if(C[i].op) {
int id = C[i].id, x = A[id].x, y = A[id].y, lca = A[id].lca, o = C[i].op;
add(st[x], o), add(st[y], o);
add(st[lca], -o), add(st[fa[lca]], -o), now+= o;
} else {
int id = C[i].id, x = B[id].x;
if(ask(st[x], ed[x]) == now) B1[++t1] = B[id];
else B2[++t2] = B[id];
}
}
for(int i = 1; i <= t1; ++i) B[t++] = B1[i];
for(int i = 1; i <= t2; ++i) B[t++] = B2[i];
solve(l, mid, x, x + t1 - 1), solve(mid + 1, r, x + t1, y);
}
signed main(){
n = read(), m = read();
rep(i, 2, n) {
int x = read(), y = read();
adde(x, y), adde(y, x);
}
dfs1(1, 0), dfs2(1, 1);
rep(i, 1, m) {
int opt = read();
if(opt == 0) {
int x = read(), y = read(), z = read();
A[++nu].l = i, A[nu].r = m + 1, A[nu].v = z,
A[nu].x = x, A[nu].y = y, A[nu].lca = LCA(x, y), id[i] = nu;
} else if(opt == 1) {
int x = read(); A[id[x]].r = i;
} else if(opt == 2) {
int x = read();
B[++nq].x = x, B[nq].tim = i, B[nq].id = nq;
}
}
sort(A + 1, A + nu + 1, cmp1), A[0].v = -1;
solve(0, nu, 1, nq);
for(int i = 1; i <= nq; ++i) printf("%d\n", ans[i]);
return 0;
}```
UVA393 The Doors.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=85;
const db eps=1e-9;
const db inf=1e12;
int n;
db x[N],a[4][N],mp[N][N];
int id(int x,int y){return (x-1)*4+y+1;}
struct vec{
db x,y;
vec(){x=y=0;}
vec(db x_,db y_){x=x_,y=y_;}
vec operator + (const vec&t)const{return vec(x+t.x,y+t.y);}
vec operator - (const vec&t)const{return vec(x-t.x,y-t.y);}
db operator * (const vec&t){return x*t.x+y*t.y;}
db operator & (const vec&t){return x*t.y-y*t.x;}
friend db dis(const vec&a,const vec&b){return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}
}p[N<<2];
db dis(db a1,db b1,db a2,db b2){return sqrt((a1-a2)*(a1-a2)+(b1-b2)*(b1-b2));}
void Main(){
n=read();
if(!~n)exit(0);
rep(i,0,n*4+1)rep(j,0,n*4+1)mp[i][j]=inf;
rep(i,1,n){
scanf("%lf%lf%lf%lf%lf",&x[i],&a[0][i],&a[1][i],&a[2][i],&a[3][i]);
rep(j,1,i-1){
rep(o,0,3)rep(p,0,3){
db k=(a[o][i]-a[p][j])/(x[i]-x[j]),b=a[o][i]-k*x[i];bool flg=1;
rep(l,j+1,i-1){
db tmp=k*x[l]+b;
if(tmp<a[0][l]||(a[1][l]<tmp&&tmp<a[2][l])||(tmp>a[3][l])){flg=0;break;}
}
if(flg)mp[id(i,o)][id(j,p)]=dis(x[i],a[o][i],x[j],a[p][j]),mp[id(j,p)][id(i,o)]=dis(x[i],a[o][i],x[j],a[p][j]);
// cerr<<id(j,p)<<' '<<id(i,o)<<' '<<dis(x[i],a[o][i],x[j],a[p][j])<<'\n';
}
}
}
bool fyyyyds=1;
rep(i,1,n)
if(5<a[0][i]||(a[1][i]<5&&5<a[2][i])||5>a[3][i]){fyyyyds=0;break;}
if(fyyyyds)return puts("10.00"),void();
rep(i,1,n){
rep(o,0,3){
db k=(a[o][i]-5)/(x[i]-0),b=a[o][i]-k*x[i];bool flg=1;
rep(l,1,i-1){
db tmp=k*x[l]+b;
if(tmp<a[0][l]||(a[1][l]<tmp&&tmp<a[2][l])||(tmp>a[3][l])){flg=0;break;}
}
if(flg)mp[0][id(i,o)]=dis(0,5,x[i],a[o][i]),mp[id(i,o)][0]=dis(x[i],a[o][i],0,5);
// cerr<<0<<' '<<id(i,o)<<' '<<dis(x[i],a[o][i],0,5)<<'\n';
}
}
rep(i,1,n){
rep(o,0,3){
db k=(a[o][i]-5)/(x[i]-10),b=a[o][i]-k*x[i];bool flg=1;
rep(l,i+1,n){
db tmp=k*x[l]+b;
if(tmp<a[0][l]||(a[1][l]<tmp&&tmp<a[2][l])||(tmp>a[3][l])){flg=0;break;}
}
if(flg)mp[n*4+1][id(i,o)]=dis(10,5,x[i],a[o][i]),mp[id(i,o)][n*4+1]=dis(x[i],a[o][i],10,5);
// cerr<<n*4+1<<' '<<id(i,o)<<' '<<dis(x[i],a[o][i],10,5)<<'\n';
}
}
rep(k,0,4*n+1)rep(i,0,4*n+1)rep(j,0,4*n+1)ckmin(mp[i][j],mp[i][k]+mp[k][j]);
printf("%.2lf\n",mp[0][4*n+1]);
}
signed main(){
while("fyy AK IOI")Main();
}```
P4451 [国家集训队]整数的lqp拆分.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define int long long
#define mod 1000000007
const int is2=59713600;
inline int modread(const int&p){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=(x*10ll+ch-'0')%p,ch=getchar();
return x;
}
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
signed main(){
int n=modread(mod-1),ans=(qpow(1+is2,n)-qpow(mod+1-is2,n)+mod)%mod*qpow(is2*2%mod,mod-2)%mod;
cout<<ans<<'\n';
}```
P7345 【DSOI 2021】吟唱的金色花海.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define x0 fyyAKIOI
#define y0 FyyAKIOI
int t,x0,y0,k;
int ask(int x,int y){
printf("0 %d %d\n",x,y),fflush(stdout);
return read();
}
void print(int x,int y){
printf("1 %d %d\n",x,y),fflush(stdout);
}
void Main(){
t=read(),x0=read(),y0=read(),k=read();
if(!t)return print(x0,y0);
int a1=ask(x0,y0+1),a2=ask(x0-1,y0),a3,a4,l,r,o=t>>1,res;
a3=!a1,a4=!a2;
if(a1&&a2){
l=x0-t-o,r=x0-o;
while(l<=r){
int mid=(l+r)>>1;
if(ask(mid,(mid-x0)+y0+t))res=mid,r=mid-1;
else l=mid+1;
}
res+=o,print(res,(res-x0)+y0+t);
}
else if(a2&&a3){
l=x0-t+o,r=x0+o;
while(l<=r){
int mid=(l+r)>>1;
if(ask(mid,-(mid-x0)+y0-t))res=mid,l=mid+1;
else r=mid-1;
}
res-=o,print(res,-(res-x0)+y0-t);
}
else if(a3&&a4){
l=x0-o,r=x0+t-o;
while(l<=r){
int mid=(l+r)>>1;
if(ask(mid,(mid-x0)+y0-t))res=mid,r=mid-1;
else l=mid+1;
}
res+=o,print(res,(res-x0)+y0-t);
}
else if(a4&&a1){
l=x0+o,r=x0+t+o;
while(l<=r){
int mid=(l+r)>>1;
if(ask(mid,-(mid-x0)+y0+t))res=mid,l=mid+1;
else r=mid-1;
}
res-=o,print(res,-(res-x0)+y0+t);
}
}
signed main(){for(int T=read();T;--T)Main();}```
P5396 第二类斯特林数·列.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=270000;
const int M=N<<2;
#define mod 167772161
namespace math{
int inv[N],fac[N],ifc[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void fmod(int&x){x-=mod,x+=x>>31&mod;}
void initmath(const int&n=N-1){
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
}
}
using math::qpow;
using math::fmod;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<=n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:qpow(3,mod-2);
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void poly_inv(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=qpow(f[0],mod-2),void();
poly_inv(g,f,(n+1)>>1),init_poly(n<<1);
cpy(A,f,n),clr(A+n,lim-n),clr(g+n,lim-n);
NTT(A,1),NTT(g,1);
for(int i=0;i<lim;++i)g[i]=1ll*g[i]*(2-1ll*A[i]*g[i]%mod+mod)%mod;
NTT(g,0),clr(g+n,lim-n);
}
void poly_sqrt(int*g,int*f,int pw){
static int A[M];
if(pw==1)return g[0]=1,void();
poly_sqrt(g,f,(pw+1)>>1);
clr(A,pw),poly_inv(A,g,pw),poly_mul(A,f,A,pw,pw);
for(int i=0,iv2=math::inv[2];i<pw;++i)g[i]=1ll*(g[i]+A[i])*iv2%mod;
}
void jif(int*g,int*f,int n){
for(int i=1;i<=n;++i)g[i]=1ll*f[i-1]*math::inv[i]%mod;g[0]=0;
}
void dao(int*g,int*f,int n){
for(int i=0;i<n-1;++i)g[i]=1ll*(i+1)*f[i+1]%mod;g[n-1]=0;
}
void poly_ln(int*g,int*f,int n){
static int A[M],B[M];
dao(A,f,n),clr(B,n),poly_inv(B,f,n),poly_mul(A,B,A,n,n),jif(g,A,n);
}
void poly_exp(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=1,void();
poly_exp(g,f,(n+1)>>1);
clr(A,n),poly_ln(A,g,n);
for(int i=0;i<n;++i)fmod(A[i]=(!i)+f[i]-A[i]+mod);
poly_mul(g,A,g,n,n),clr(g+n,lim-n);
}
void poly_qpow(int*g,int *f,int k,int n){
static int A[M];
clr(A,n),poly_ln(A,f,n);
for(int i=0;i<n;++i)A[i]=1ll*A[i]*k%mod;
poly_exp(g,A,n);
}
void stirling2_row(int*g,int n){//注意！这个函数左闭右闭
static int A[M],B[M];
for(int i=0;i<=n;++i)A[i]=1ll*qpow(i,n)*math::ifc[i]%mod;
for(int i=0;i<=n;++i)B[i]=i&1?mod-math::ifc[i]:math::ifc[i];
poly_mul(A,B,A,n+1,n+1);
for(int i=0;i<=n;++i)g[i]=A[i];
}
void poly_shift(int*g,int*f,int n,int c){
static int A[M],B[M];
for(int i=0;i<n;++i)A[i]=1ll*math::fac[i]*f[i]%mod;
for(int i=0,j=1;i<n;++i,j=1ll*j*c%mod)B[i]=1ll*j*math::ifc[i]%mod;
reverse(B,B+n),poly_mul(A,B,A,n,n);
for(int i=0;i<n;++i)g[i]=1ll*A[n+i-1]*math::ifc[i]%mod;
}
void up_pow(int*g,int n){//注意！这个函数左闭右闭
static int A[M];
if(n==1)return g[0]=0,g[1]=1,void();
if(n&1){
up_pow(g,n-1);
for(int i=n;i>0;--i)g[i]=(g[i-1]+1ll*(n-1)*g[i]%mod)%mod;
}else{
up_pow(g,n/2);
clr(A,n/2+1),poly_shift(A,g,n/2+1,n/2),poly_mul(A,g,g,n/2+1,n/2+1);
}
}
void stirling1_row(int*g,int n){up_pow(g,n);}//注意！这个函数左闭右闭
void stirling1_column(int*g,int n,int k){//注意！这个函数左闭右闭
if(n<k){
for(int i=0;i<=n;++i)g[i]=0;
return;
}
static int A[M];
for(int i=0;i<=n;++i)A[i]=math::inv[i+1];
clr(g,n+1),poly_qpow(g,A,k,n+1);
for(int i=n;i>=k;--i)g[i]=g[i-k];
for(int i=0;i<k;++i)g[i]=0;
for(int i=k;i<=n;++i)g[i]=1ll*g[i]*math::fac[i]%mod*math::ifc[k]%mod;
}
void down_pow(int*g,int n){//注意！这个函数左闭右闭
static int A[M];
if(n==1)return g[0]=0,g[1]=1,void();
if(n&1){
down_pow(g,n-1);
for(int i=n;i>0;--i)g[i]=(g[i-1]+1ll*(mod-n+1)*g[i]%mod)%mod;
}else{
down_pow(g,n/2);
clr(A,n/2+1),poly_shift(A,g,n/2+1,mod-n/2),poly_mul(A,g,g,n/2+1,n/2+1);
}
}
void stirling2_column(int*g,int n,int k){//注意！这个函数左闭右闭
static int A[M];
if(n<k){
for(int i=0;i<=n;++i)g[i]=0;
return;
}
clr(A,k+2),down_pow(A,k+1);
for(int i=0;i<k+1;++i)A[i]=A[i+1];A[k+1]=0;
reverse(A,A+k+1);
clr(g,k+1),poly_inv(g,A,n-k+1);
for(int i=n;i>=k;--i)g[i]=g[i-k];
for(int i=0;i<k;++i)g[i]=0;
}
}
int n,k,g[M];
signed main(){
math::initmath();
n=read(),k=read();
poly::stirling2_column(g,n,k);
rep(i,0,n)printf("%d ",g[i]);
return 0;
}```
P5177 签到.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline LL read() {
LL x=0;int f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10ll+(ch^48),ch=getchar();
return f?x:-x;
}
const int mod=1e9+7;
LL n;int ans,f[80];
void fmod(int&x){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
int ask(LL x){
return x%=mod,1ll*x*(x-1)%mod;
}
signed main(){
for(int i=1,o=1;i<=64;++i,fmod(o<<=1))f[i]=1ll*o*(o-1)%mod;
for(int T=read(),i;T;--T){
n=read(),ans=0;
for(LL o=1,s=0,i=1;s<n;s+=o,o<<=1,++i)
s+o>n?fmod(ans+=ask(n-s)):fmod(ans+=f[i]);
printf("%d\n",ans);
}
}
/*
0 2
0 2 4 6
0 2 4 6 8 10 12 14
0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30
*/
/*
1
1000000000000000000
343301962
*/```
P6178 【模板】Matrix-Tree 定理.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=305;
#define mod 1000000007
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int n,m,t,a[N][N],ans=1;
void Gauss(){
rep(i,2,n){
rep(j,i+1,n){
while(a[j][i]){
int div=a[i][i]/a[j][i];
rep(k,i,n)fmod(a[i][k]-=1ll*div*a[j][k]%mod),swap(a[i][k],a[j][k]);
ans*=-1;
}
}
}
}
signed main(){
n=read(),m=read(),t=read();
rep(i,1,m){
int x=read(),y=read(),z=read();
if(!t){
fmod(a[x][x]+=z),fmod(a[y][y]+=z);
fmod(a[x][y]-=z),fmod(a[y][x]-=z);
}else{
fmod(a[y][y]+=z),fmod(a[x][y]-=z);
}
}
//rep(i,1,n)rep(j,1,n)printf("%-10d%c",a[i][j]," \n"[j==n]);
Gauss();
//rep(i,1,n)rep(j,1,n)printf("%-10d%c",a[i][j]," \n"[j==n]);
rep(i,2,n)ans=1ll*ans*a[i][i]%mod;
fmod(ans);
printf("%d\n",ans);
return 0;
}```
CF1469C Building a Fence.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=200005;
int n,k,h[N],dp[N][2];
void Main(){
n=read(),k=read();
rep(i,1,n)h[i]=read();
dp[1][0]=h[1],dp[1][1]=h[1];
for(int i=2;i<=n;++i){
dp[i][0]=max(h[i],dp[i-1][0]-k+1);
dp[i][1]=min(h[i]+k-1,dp[i-1][1]+k-1);
if(dp[i][0]>dp[i][1])return puts("NO"),void();
}
if(dp[n][0]!=h[n])puts("NO");
else puts("YES");
}
signed main(){for(int T=read();T;--T)Main();}//???UKE???```
CF300D Painting Square.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int mod=7340033;
int n,k,f[35][1005],g[35][1005];
void fmod(int&x){x-=mod,x+=x>>31&mod;}
signed main(){
for(int i=0;i<=33;++i)f[i][0]=g[i][0]=1;
for(int i=1;i<=33;++i){
for(int j=1;j<=1000;++j)
for(int k=0;k<j;++k)
fmod(f[i][j]+=1ll*g[i-1][k]*g[i-1][j-k-1]%mod);
for(int j=1;j<=1000;++j)
for(int k=0;k<=j;++k)
fmod(g[i][j]+=1ll*f[i][k]*f[i][j-k]%mod);
}
for(int T=read();T;--T){
n=read(),k=read();
int cnt=0;
while(n&1&&n>2)n>>=1,++cnt;
printf("%d\n",f[cnt][k]);
}
return 0;
}```
P1525 关押罪犯.cpp
```#include<bits/stdc++.h>
using namespace std;
const int M=100005;
const int N=20005;
int n,m,num_edge,head[N],ans,l,r;
struct edge {
int to,nxt,val;
} e[M<<1];
void add(int from,int to,int val) {
++num_edge;
e[num_edge].val=val;
e[num_edge].to=to;
e[num_edge].nxt=head[from];
head[from]=num_edge;
}
bool pd(int mid) {
queue<int>q;
int col[N];
memset(col,0,sizeof(col));
for(int i=1; i<=n; ++i) {
if(col[i])continue;
col[i]=1;
q.push(i);
while(!q.empty()) {
int u=q.front();
q.pop();
for(int i=head[u]; i; i=e[i].nxt) {
int v=e[i].to,w=e[i].val;
if(w>mid) {
if(!col[v]) {
col[v]=col[u]^3;
q.push(v);
} else if(col[v]==col[u])return false;
}
}
}
}
return true;
}
int main() {
scanf("%d%d",&n,&m);
for(int i=1,a,b,c; i<=m; ++i) {
scanf("%d%d%d",&a,&b,&c);
add(a,b,c);add(b,a,c);r=max(r,c);
}
while(l<=r) {
int mid=(l+r)>>1;
if(pd(mid))r=mid-1,ans=mid;
else l=mid+1;
}
printf("%d\n",ans);
return 0;
}
```
P3413 SAC#1 - 萌数.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
#define int long long
const int N=1009;
const int mod=1000000007;
char s[N],t[N];
int num[N],tot;
int ans,dp[N][10][10];
int dfs(int pos,int limit,int lead,int pre1,int pre2) {
if(!pos)return 1;
if(!limit&&!lead&&~pre1&&~pre2&&~dp[pos][pre1][pre2])return dp[pos][pre1][pre2];
int up=limit?num[pos]:9,res=0;
for(int i=0;i<=up;++i)
if(lead)res=(res+dfs(pos-1,limit&&i==up,lead&&!i,!i?-1:i,-1))%mod;
else if(i!=pre1&&i!=pre2&&!lead)res=(res+dfs(pos-1,limit&&i==up,0,i,pre1))%mod;
if(!limit&&!lead&&~pre1&&~pre2)dp[pos][pre1][pre2]=res;
return res;
}
int solve(char*s) {
tot=0;
int res=0;
for(int len=strlen(s+1),i=len;i>0;--i)num[++tot]=s[i]-'0';
return dfs(tot,1,1,-1,-1);
}
int ok(char*s) {
int len=strlen(s+1);
for(int i=2;i<=len;++i)if(s[i]==s[i-1]||s[i]==s[i-2])return 1;
return 0;
}
int to_num(char*s) {
int res=0,len=strlen(s+1);
for(int i=1;i<=len;++i)res=1ll*(res*10+s[i]-'0')%mod;
return res;
}
signed main() {
memset(dp,-1,sizeof(dp));
scanf("%s%s",s+1,t+1);
printf("%lld\n",(to_num(t)-to_num(s)+1+mod-(solve(t)-(solve(s)+ok(s)-1)+mod)%mod+mod)%mod);
return 0;
}```
P3802 小魔女帕琪.cpp
```#include<bits/stdc++.h>
using namespace std;
double cynAK=5040;
int n,a[7];
signed main(){
for(int i=0;i<7;++i)std::cin>>a[i],n+=a[i];
for(int i=0;i<7;++i)
if(i<6)cynAK*=1.*a[i]/(n-i);
else cynAK*=a[i];
printf("%.3lf\n",cynAK);
return 0;
}```
P6007 [USACO20JAN]Springboards G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int w,n,o,dp[N],dis[N];
struct node {
int opt,x,y,id;//opt=1:modify;opt=0:query
}p[N<<1],q[N<<1];
inline bool cmpx(const node&a,const node&b) {
if(a.x==b.x&&a.y==b.y)return a.opt>b.opt;
return a.x!=b.x?a.x<b.x:a.y<b.y;
}
inline bool cmpy(const node&a,const node&b) {
if(a.x==b.x&&a.y==b.y)return a.opt>b.opt;
return a.y!=b.y?a.y<b.y:a.x<b.x;
}
void cdq(int l,int r) {
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid),sort(p+mid+1,p+r+1,cmpy);
for(int i=mid+1,j=l,mx=0;i<=r;++i) {
if(p[i].opt)continue;
for(;j<=mid&&p[j].y<=p[i].y;++j)
if(p[j].opt)mx=max(mx,dp[p[j].id]);
dp[p[i].id]=max(dp[p[i].id],mx+dis[p[i].id]);
}
sort(p+mid+1,p+r+1,cmpx),cdq(mid+1,r);
sort(p+l,p+r+1,cmpy);
}
signed main() {
w=rd(),n=rd();
for(int i=1,sx,sy,tx,ty;i<=n;++i)
sx=rd(),sy=rd(),tx=rd(),ty=rd(),
dis[i]=tx-sx+ty-sy,
++o,p[o].id=i,p[o].opt=0,p[o].x=sx,p[o].y=sy,
++o,p[o].id=i,p[o].opt=1,p[o].x=tx,p[o].y=ty;
++o,p[o].id=0,p[o].opt=1,p[o].x=0,p[o].y=0;
++o,p[o].id=n+1,p[o].opt=0,p[o].x=w,p[o].y=w;
sort(p+1,p+o+1,cmpx);
cdq(1,o);
printf("%d\n",w*2-dp[n+1]);
return 0;
}
```
CF1042D Petya and Array.cpp
```#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200005;
int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int n,t,ans,rt,tot,a[N],sum[N];
int siz[N],ch[N][2],val[N],rnd[N];
void pushup(int u) {
siz[u]=siz[ch[u][0]]+siz[ch[u][1]]+1;
}
int newnode(int x) {
++tot;
rnd[tot]=rand();
val[tot]=x;
siz[tot]=1;
return tot;
}
int merge(int x,int y) {
if(!x||!y)return x+y;
if(rnd[x]<rnd[y]) {
ch[x][1]=merge(ch[x][1],y);
pushup(x);
return x;
} else {
ch[y][0]=merge(x,ch[y][0]);
pushup(y);
return y;
}
}
void split(int u,int k,int &x,int &y) {
if(!u) {
x=y=0;
return;
}
if(val[u]<=k)
x=u,split(ch[u][1],k,ch[u][1],y);
else
y=u,split(ch[u][0],k,x,ch[u][0]);
pushup(u);
}
void insert(int x) {
int a,b;
split(rt,x,a,b);
rt=merge(merge(a,newnode(x)),b);
}
void del(int x) {
int a,b,c;
split(rt,x,a,b);
split(a,x-1,a,c);
c=merge(ch[c][0],ch[c][1]);
rt=merge(merge(a,c),b);
}
signed main() {
n=rd(),t=rd();
for(int i=1;i<=n;++i)a[i]=rd(),sum[i]=sum[i-1]+a[i];
insert(0);for(int i=1;i<=n;++i)insert(sum[i]);
for(int i=n;i>=1;--i) {
del(sum[i]);
int a,b;
split(rt,sum[i]-t,a,b);
ans+=siz[b];
rt=merge(a,b);
}
printf("%lld\n",ans);
return 0;
}```
AT2004 [AGC003D] Anticube.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,ans;
int pct,pri[N];
bool vis[N];
LL a[N];
map<LL,LL>to;
map<LL,int>num;
void Sieve(const int&n){
for(int i=2;i<=n;++i){
if(!vis[i])pri[++pct]=i;
for(int j=1;j<=pct&&i*pri[j]<=n;++j){
vis[i*pri[j]]=1;
if(i%pri[j]==0)break;
}
}
}
void insert(LL x){
static int cnt_1=0;
LL pre=x,iv=1;
for(int i=1;i<=pct;++i){
if(pri[i]>2155)break;
if(x%pri[i])continue;
LL tmp=1ll*pri[i]*pri[i]*pri[i];
while(x%tmp==0)x/=tmp,pre/=tmp;
if(x%pri[i])continue;
while(x%pri[i]==0)x/=pri[i],tmp/=pri[i];
iv*=tmp;
}
if(x>100000){
LL tmp=sqrt(x);
if(tmp*tmp==x)iv*=tmp;
else iv=-1;
}else{
iv*=x*x;
}
if(pre>1)to[pre]=iv,++num[pre];
else ans+=cnt_1^1,cnt_1=1;
}
signed main(){
scanf("%d",&n);
Sieve(100000);
rep(i,1,n)scanf("%lld",&a[i]),insert(a[i]);
for(auto i:to){
if(num[i.first]>=num[i.second])ans+=num[i.first],num[i.second]=0;
}
printf("%d\n",ans);
return 0;
}```
P3703 [SDOI2017]树点涂色.cpp
```#include<bits/stdc++.h>
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,m;
int num_edge,head[N];
struct edge{
int nxt,to;
}e[N<<1];
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
namespace Tree{
int rev[N],dfn[N],tmr,siz[N],fa[N],top[N],son[N],dep[N],ed[N];
const int T=N<<2;
void dfs1(int u,int ft){
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp){
top[u]=tp,rev[dfn[u]=++tmr]=u;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
ed[u]=tmr;
}
int LCA(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
#define lc (p<<1)
#define rc (p<<1|1)
int tag[T],val[T];
void pushup(int p){val[p]=std::max(val[lc],val[rc]);}
void build(int l,int r,int p=1){
if(l==r)return val[p]=dep[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void pushdown(int p){
if(tag[p]){
val[lc]+=tag[p];
val[rc]+=tag[p];
tag[lc]+=tag[p];
tag[rc]+=tag[p];
tag[p]=0;
}
}
void update(int ql,int qr,int k,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p]+=k,tag[p]+=k,void();
int mid=(l+r)>>1;
pushdown(p);
if(ql<=mid)update(ql,qr,k,l,mid,lc);
if(mid<qr)update(ql,qr,k,mid+1,r,rc);
pushup(p);
}
int query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p];
pushdown(p);
int mid=(l+r)>>1,res=0;
if(ql<=mid)res=std::max(res,query(ql,qr,l,mid,lc));
if(mid<qr)res=std::max(res,query(ql,qr,mid+1,r,rc));
return res;
}
}
namespace LCT{
int fa[N],ch[N][2];
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;fa[y]=x,fa[x]=z;
}
void splay(int x){
int y=x,z;
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[y][1]==x)^(ch[z][1]==y)?x:y);
rotate(x);
}
}
int findroot(int x){
while(ch[x][0])x=ch[x][0];
return x;
}
void access(int x){
for(int y=0,s;x;x=fa[y=x]){
splay(x);
if(ch[x][1])s=findroot(ch[x][1]),Tree::update(Tree::dfn[s],Tree::ed[s],1);
if(y)s=findroot(y),Tree::update(Tree::dfn[s],Tree::ed[s],-1);
ch[x][1]=y;
}
}
}
signed main(){
n=read(),m=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
Tree::dep[1]=1,Tree::dfs1(1,0),Tree::dfs2(1,1),Tree::build(1,n);
for(int i=1;i<=n;++i)LCT::fa[i]=Tree::fa[i];
while(m--){
int op=read(),x=read(),y,lca;
if(op==1)LCT::access(x);
else if(op==2){
y=read(),lca=Tree::LCA(x,y);
printf("%d\n",Tree::query(Tree::dfn[x],Tree::dfn[x])+Tree::query(Tree::dfn[y],Tree::dfn[y])-2*Tree::query(Tree::dfn[lca],Tree::dfn[lca])+1);
}
else printf("%d\n",Tree::query(Tree::dfn[x],Tree::ed[x]));
}
return 0;
}```
P2660 zzc 种田.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
LL n,m,ans;
signed main() {
n=rd(),m=rd();
while(n&&m) {
if(n>m)n^=m^=n^=m;
int k=m/n;
ans+=k*4*n;
m-=k*n;
}
printf("%lld\n",ans);
return 0;
}```
CF656E Out of Controls.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=11;
int g[N][N],n,ans;
signed main() {
scanf("%d",&n);
f\
o\
r(int i=1;i<=n;++i)
f\
o\
r(int j=1;j<=n;++j)scanf("%d",&g[i][j]);
f\
o\
r(int k=1;k<=n;++k)
f\
o\
r(int i=1;i<=n;++i)
f\
o\
r(int j=1;j<=n;++j)g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
f\
o\
r(int i=1;i<=n;++i)
f\
o\
r(int j=1;j<=n;++j)ans=max(ans,g[i][j]);
printf("%d\n",ans);
}
```
CF1137D Cooperative Game.cpp
```#include<bits/stdc++.h>
using namespace std;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1009;
int n;
char s[12];
signed main() {
while("fyyAKIOI") {
printf("next 0\n");
fflush(stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%s",s);
printf("next 0 1\n");
fflush(stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%s",s);
if(n==2)break;
}
while("fyyAKIOI") {
printf("next 0 1 2 3 4 5 6 7 8 9\n");
fflush(stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%s",s);
if(n==1)break;
}
printf("done\n");
fflush(stdout);
}```
P1052 过河.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int L,S,T,m,dp[500000],now,flg[500000],ans=114514,x[114];
signed main() {
L=rd(),S=rd(),T=rd(),m=rd();
for(int i=1;i<=m;++i)x[i]=rd();
sort(x+1,x+m+1);
if(S==T) {
ans=0;
for(int i=1;i<=m;++i)if(x[i]%S==0)++ans;
return printf("%d\n",ans),0;
}
for(int i=1,lst=0;i<=m;++i) {
if(x[i]-lst<=2520)now+=x[i]-lst,flg[now]=1;
else now+=2520,flg[now]=1;
lst=x[i];
}
memset(dp,0x3f,sizeof(dp));
dp[0]=0,now+=10;
for(int i=1;i<=now;++i) {
for(int j=S;j<=T;++j)
if(i-j>-1)dp[i]=min(dp[i],dp[i-j]);
dp[i]+=flg[i];
}
for(int i=now-9;i<=now;++i)ans=min(ans,dp[i]);
printf("%d\n",ans);
return 0;
}
```
P4463 [集训队互测2012] calc.cpp
```/*
|------- |-----|
| | |
| | |
| | | * |
|------ |----| --- ----- \ / ----- --- |-----| | | --- ----- | | --|--
| | | |/ \ | | \ / | | |/ \ | | | |/ \ | | | | |
| | | | ----- \ / ----- | | | | | |---- | | | |
| | | | | \ / | | | | | | | | | | |
| |----| | ----/ - ---/ | _____ | |----| | ----| |----| | --/
\ / \ / |----\ ------
\ / \ / | \ |
\ / \ / | \ |
\-/ \-/ | | ------
| | | | |
| | | / |
| | | / |
| | |----/ ------
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=505;
int k,n,mod,f[N],g[N];
namespace math{
int fac[N],ifc[N],inv[N];
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*ifc[i+1]*(i+1)%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using math::qpow;
using math::fmod;
int lagrange(int n,int k){//前n项k次幂和
static int pre[N],suf[N],sum[N],res;
sum[0]=res=0;
rep(i,1,k+2)fmod(sum[i]=sum[i-1]+qpow(i,k));
if(n<=k+2)return sum[n];
pre[0]=1;for(int i=1;i<=k+2;++i)pre[i]=1ll*pre[i-1]*(n-i)%mod;
suf[k+3]=1;for(int i=k+2;i>=1;--i)suf[i]=1ll*suf[i+1]*(n-i)%mod;
for(int i=1;i<=k+2;++i){
int A=1ll*pre[i-1]*suf[i+1]%mod;
int B=1ll*math::ifc[i-1]*math::ifc[k+2-i]%mod;
if((k+2-i)&1)B=mod-B;
fmod(res+=1ll*A*B%mod*sum[i]%mod);
}
return res;
}
void poly_exp(int*g,int*f,int n){
g[0]=1;
for(int i=1;i<n;++i){
g[i]=0;
for(int j=0;j<i;++j)fmod(g[i]+=1ll*(j+1)*f[j+1]%mod*g[i-1-j]%mod);
g[i]=1ll*g[i]*math::inv[i]%mod;
}
}
signed main(){
k=read(),n=read(),mod=read(),math::initmath();
for(int i=1;i<=n;++i)f[i]=1ll*lagrange(k,i)*(i&1?math::inv[i]:mod-math::inv[i])%mod;
poly_exp(g,f,n+1);
printf("%lld\n",1ll*g[n]*math::fac[n]%mod);
return 0;
}```
CF665E Beautiful Subarrays.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000005;
const int M=N*31;
int n,k,a[N],ch[M][2],tot=1,siz[M];
LL ans;
void insert(int x) {
int u=1;
for(int i=30;~i;--i) {
int c=x>>i&1;
if(!ch[u][c])ch[u][c]=++tot;
u=ch[u][c],++siz[u];
}
}
int query(int x) {
int u=1,res=0,i;
for(i=30;~i;--i) {
int c=x>>i&1;
if(k>>i&1)u=ch[u][!c];
else res+=siz[ch[u][!c]],u=ch[u][c];
}
res+=siz[u];
return res;
}
signed main() {
n=rd(),k=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<=n;++i)a[i]^=a[i-1];
for(int i=1;i<=n;++i)insert(a[i-1]),ans+=query(a[i]);
printf("%lld\n",ans);
return 0;
}
```
AT2043 [AGC004C] AND Grid.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
const int N=505;
int n,m;
char a[N][N],b[N][N],c[N][N];
signed main(){
n=read(),m=read();
rep(i,1,n)scanf("%s",a[i]+1);
rep(i,1,n)rep(j,1,m)b[i][j]=c[i][j]='.';
rep(j,1,m)b[1][j]='#',c[n][j]='#';
for(int j=1;j<=m;j+=2)rep(i,1,n-1)b[i][j]='#';
for(int j=2;j<=m;j+=2)per(i,n,2)c[i][j]='#';
rep(i,1,n)rep(j,1,m)if(a[i][j]=='#')b[i][j]=c[i][j]='#';
rep(i,1,n){rep(j,1,m)putchar(b[i][j]);puts("");}
puts("");
rep(i,1,n){rep(j,1,m)putchar(c[i][j]);puts("");}
return 0;
}```
CF1268A Long Beautiful Integer.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200009;
int n,k,a[N];
char s[N];
signed main() {
n=rd(),k=rd(),scanf("%s",s+1);
int flg=1;
for(int i=1;i<=n;++i)a[i]=s[i]-'0';
for(int i=1;i<=n;++i) {
if(a[(i-1)%k+1]<s[i]-'0'){flg=0;break;}
else if(a[(i-1)%k+1]>s[i]-'0')break;
}
if(flg){
printf("%d\n",n);
for(int i=1;i<=n;++i)printf("%d",a[(i-1)%k+1]);
return 0;
}
++a[k];
for(int i=k;i>=1;--i)
if(a[i]==10)a[i]=0,++a[i-1];
else break;
printf("%d\n",n);
for(int i=1;i<=n;++i)printf("%d",a[(i-1)%k+1]);
return 0;
}```
P5401 [CTS2019]珍珠.cpp
```// Problem: P5401 [CTS2019]珍珠
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P5401
// Memory Limit: 500 MB
// Time Limit: 1000 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=N<<2;
#define mod 998244353
namespace math{
int fac[N],ifc[N],inv[N];
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
}
}
using namespace math;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<n;++lg,lim<<=1);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
a[j+k]=(X+Y)%mod,a[i+j+k]=(X-Y+mod)%mod;
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
}
int D,n,m,f[M],g[M],ans;
signed main(){
initmath();
D=read(),n=read(),m=read();
for(int i=0;i<=D;++i)f[i]=ifc[i];
for(int i=0;i<=D;++i)g[i]=(1ll*qpow(D-2*i,n)*ifc[i]%mod+mod)%mod;
poly::poly_mul(f,g,f,D+1,D+1);
for(int i=0;i<=D;++i)f[i]=1ll*f[i]*fac[i]%mod;
for(int i=0,j=1;i<=D;++i,j=1ll*j*inv[2]%mod)f[i]=1ll*comb(D,i)*j%mod*f[i]%mod;
for(int i=0;i<=D;++i)f[i]=1ll*f[i]*fac[i]%mod;
for(int i=0;i<=D;++i)g[i]=i&1?mod-ifc[i]:ifc[i];
reverse(g,g+D+1);
poly::poly_mul(f,g,f,D+1,D+1);
for(int i=0;i<=D;++i)g[i]=1ll*ifc[i]*f[D+i]%mod;
for(int i=max(0,D-(n-2*m));i<=D;++i)ans=(ans+g[i])%mod;
printf("%d\n",ans);
return 0;
}```
CF55D Beautiful numbers.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
int T;
LL l,r;
LL dp[20][2520][48];
int num[20],tot;
int lsh[48]={
1,2,3,4,5,6,7,8,
9,10,12,14,15,18,20,21,
24,28,30,35,36,40,42,45,
56,60,63,70,72,84,90,105,
120,126,140,168,180,210,252,280,
315,360,420,504,630,840,1260,2520
},rev[2521];
int gcd(int x,int y) {return !y?x:gcd(y,x%y);}
LL dfs(int pos,int limit,int rem,int lcm) {
if(!pos)return !(rem%lcm);
if(!limit&&~dp[pos][rem][rev[lcm]])return dp[pos][rem][rev[lcm]];
int up=limit?num[pos]:9;LL res=0;
for(int i=0;i<=up;++i)
res+=dfs(pos-1,limit&(i==up),(rem*10+i)%2520,i?lcm*i/gcd(lcm,i):lcm);
if(!limit)dp[pos][rem][rev[lcm]]=res;
return res;
}
LL solve(LL x) {
tot=0;
while(x)num[++tot]=x%10,x/=10;
return dfs(tot,1,0,1);
}
void init() {for(int i=0;i<48;++i)rev[lsh[i]]=i;}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
init(),cin>>T;
memset(dp,-1,sizeof(dp));
while(T--)cin>>l>>r,cout<<solve(r)-solve(l-1)<<'\n';
return 0;
}```
CF1131B Draw!.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
#define N 10005
int n,a[N],b[N],ans;
signed main(){
n=read();
int lst=1;
for(int i=1;i<=n;++i){
a[i]=read(),b[i]=read();
if(min(a[i],b[i])>=max(a[i-1],b[i-1]))ans+=min(a[i],b[i])-max(a[i-1],b[i-1])+lst;
lst=a[i]!=b[i];
}
printf("%lld\n",ans);
return 0;
}```
CF916E Jamie and Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(a) push_back(a)
#define mkp(a,y) make_pair(a,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int a=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))a=a*10+(ch^48),ch=getchar();
return a*f;
}
#define int long long
#define N 100009
int n,m,root=1;
int st[N],rev[N],top[N],fa[N],siz[N],son[N],dep[N],a[N],ed[N],timer;
int val[N<<2],tag[N<<2];
vector<int>g[N];
void dfs1(int u,int ft) {
siz[u]=1;
for(int v:g[u]) {
if(v==ft)continue;
fa[v]=u,dep[v]=dep[u]+1,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
top[u]=tp,st[u]=++timer,rev[timer]=u;
if(son[u])dfs2(son[u],tp);
for(int v:g[u]) {
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
ed[u]=timer;
}
int LCA(int x,int y) {
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
x=fa[top[x]];
}
return dep[x]<dep[y]?x:y;
}
int findnex(int u,int f) {
int res=0;
while(top[u]!=top[f])u=fa[res=top[u]];
return u==f?res:son[f];
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {val[p]=val[lc]+val[rc];}
void build(int l,int r,int p) {
if(l==r)return val[p]=a[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void pushdown(int p,int l,int r) {
if(tag[p]) {
int mid=(l+r)>>1;
tag[lc]+=tag[p],val[lc]+=tag[p]*(mid-l+1);
tag[rc]+=tag[p],val[rc]+=tag[p]*(r-mid);
tag[p]=0;
}
}
void update(int ql,int qr,int l,int r,int k,int p) {
if(ql<=l&&r<=qr)return tag[p]+=k,val[p]+=k*(r-l+1),void();
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,k,lc);
if(qr>mid)update(ql,qr,mid+1,r,k,rc);
pushup(p);
}
int query(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1,res=0;
pushdown(p,l,r);
if(ql<=mid)res+=query(ql,qr,l,mid,lc);
if(qr>mid)res+=query(ql,qr,mid+1,r,rc);
return res;
}
void modify(int x,int z) {
if(x==root)update(1,n,1,n,z,1);
else {
int lca=LCA(root,x);
if(lca!=x)update(st[x],ed[x],1,n,z,1);
else {
int t=findnex(root,x);
if(st[t]!=1)update(1,st[t]-1,1,n,z,1);
if(ed[t]!=n)update(ed[t]+1,n,1,n,z,1);
}
}
}
int ask(int x) {
if(x==root)return query(1,n,1,n,1);
else {
int lca=LCA(root,x);
if(lca!=x)return query(st[x],ed[x],1,n,1);
else {
int t=findnex(root,x),res=0;
if(st[t]!=1)res+=query(1,st[t]-1,1,n,1);
if(ed[t]!=n)res+=query(ed[t]+1,n,1,n,1);
return res;
}
}
}
int dis(int x,int y){return dep[x]+dep[y]-(dep[LCA(x,y)]<<1);}
int LCA_ex(int x,int y) {
int f=LCA(x,y),g=LCA(x,root),h=LCA(y,root),res=f;
if(dep[g]>dep[res])res=g;
if(dep[h]>dep[res])res=h;
return res;
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=1;i<n;++i) {
int x=rd(),y=rd();
g[x].pb(y),g[y].pb(x);
}
dfs1(1,0),dfs2(1,1),build(1,n,1);
while(m--) {
int opt=rd(),x=rd(),y,z;
if(opt==1)root=x;
else if(opt==2)y=rd(),z=rd(),modify(LCA_ex(x,y),z);
else printf("%lld\n",ask(x));
}
return 0;
}```
P1452【模板】旋转卡壳.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=5e4+10;
const int inf=1e18;
int n,ans;
int cv[N],top;
struct point {
int x,y;
point(){x=y=0;}
point(int x_,int y_){x=x_,y=y_;}
}p[N];
int crs(const point &a,const point &b,const point &c,const point &d) {
point x=point(b.x-a.x,b.y-a.y),y=point(d.x-c.x,d.y-c.y);
return x.x*y.y-x.y*y.x;
}
int crs(const point &a,const point &b,const point &c) {
return crs(a,b,a,c);
}
int dis(const point &a,const point &b) {
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
bool cmp(const point &a,const point &b) {
double k=crs(p[1],a,b);
if(k>0)return 1;
if(k==0&&dis(p[1],a)<dis(p[1],b))return 1;
return 0;
}
void convex() {
int k=1;
for(rint i=2;i<=n;++i)
if(p[i].x<p[k].x||(p[i].x==p[k].x&&p[i].y<p[k].y))k=i;
swap(p[1],p[k]),sort(p+2,p+n+1,cmp),cv[++top]=1;
for(rint i=1;i<=n;++i) {
while(top>1&&crs(p[cv[top-1]],p[cv[top]],p[i])<=0)--top;
cv[++top]=i;
}
}
void rotating() {
ans=0;
if(top==2){ans=dis(p[cv[1]],p[cv[2]]);return;}
cv[top+1]=1;
for(rint i=1,j=2;i<=top;++i) {
while(crs(p[cv[i]],p[cv[i+1]],p[cv[j]])<crs(p[cv[i]],p[cv[i+1]],p[cv[j+1]]))j=(j+1>=top?1:j+1);
ans=max(ans,max(dis(p[cv[i]],p[cv[j]]),dis(p[cv[i+1]],p[cv[j]])));
}
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)p[i].x=rd(),p[i].y=rd();
convex();
rotating();
printf("%lld\n",ans);
return 0;
}
```
P6834 [Cnoi2020]梦原.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
void fmod(int&x){x-=mod,x+=x>>31&mod;}
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
const int N=1000005;
int n,k,a[N],ans,b[N],lsh[N],len;
struct BIT{
int tr[N];
BIT(){memset(tr,0,sizeof(tr));}
void add(int x,int d){for(int i=x;i<=n;i+=i&-i)fmod(tr[i]+=d);}
int ask(int x){int res=0;for(int i=x;i>0;i-=i&-i)fmod(res+=tr[i]);return res;}
}tr[2];
signed main(){
n=read(),k=read();
rep(i,1,n)a[i]=lsh[i]=read();
sort(lsh+1,lsh+n+1),len=unique(lsh+1,lsh+n+1)-lsh-1;
rep(i,1,n)b[i]=lower_bound(lsh+1,lsh+len+1,a[i])-lsh;
ans=a[1],tr[0].add(b[1],a[1]),tr[1].add(b[1],1);
rep(i,2,n){
int num=i-max(i-k,1),sum=(1ll*tr[1].ask(b[i])*a[i]%mod-tr[0].ask(b[i])+mod)%mod;
fmod(ans+=1ll*sum*qpow(num,mod-2)%mod);
if(i>k)tr[0].add(b[i-k],mod-a[i-k]),tr[1].add(b[i-k],-1);
tr[0].add(b[i],a[i]),tr[1].add(b[i],1);
}
printf("%d\n",ans);
return 0;
}```
旋转卡壳.cpp
```#define int long long
const int N=5e5+10;
const int inf=1e18;
int n,ans;
int cv[N],top;
struct point {
int x,y;
point(){x=y=0;}
point(int x_,int y_){x=x_,y=y_;}
}p[N];
int crs(const point &a,const point &b,const point &c,const point &d) {
point x=point(b.x-a.x,b.y-a.y),y=point(d.x-c.x,d.y-c.y);
return x.x*y.y-x.y*y.x;
}
int crs(const point &a,const point &b,const point &c) {
return crs(a,b,a,c);
}
int dis(const point &a,const point &b) {
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
bool cmp(const point &a,const point &b) {
double k=crs(p[1],a,b);
if(k>0)return 1;
if(k==0&&dis(p[1],a)<dis(p[1],b))return 1;
return 0;
}
void convex() {
int k=1;
for(rint i=2;i<=n;++i)
if(p[i].x<p[k].x||(p[i].x==p[k].x&&p[i].y<p[k].y))k=i;
swap(p[1],p[k]),sort(p+2,p+n+1,cmp),cv[++top]=1;
for(rint i=1;i<=n;++i) {
while(top>1&&crs(p[cv[top-1]],p[cv[top]],p[i])<=0)--top;
cv[++top]=i;
}
}
void rotating() {
ans=0;
if(top==2){ans=dis(p[cv[1]],p[cv[2]]);return;}
cv[top+1]=1;
for(rint i=1,j=2;i<=top;++i) {
while(crs(p[cv[i]],p[cv[i+1]],p[cv[j]])<crs(p[cv[i]],p[cv[i+1]],p[cv[j+1]]))j=(j+1>=top?1:j+1);
ans=max(ans,max(dis(p[cv[i]],p[cv[j]]),dis(p[cv[i+1]],p[cv[j]])));
}
}```
CF1198F GCD Groups 2.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
int n,ans[N];
struct node {
int x,id;
}a[N];
int gcd(int x,int y){return !y?x:gcd(y,x%y);}
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i].x=read(),a[i].id=i;
clock_t st=clock();
while(0.45>1.*(clock()-st)/CLOCKS_PER_SEC) {
random_shuffle(a+1,a+n+1);
int x=0,y=0;
for(int i=1;i<=n;++i) {
if(!x){ans[a[i].id]=1,x=a[i].x;continue;}
int g=gcd(a[i].x,x);
if(a[i].x%x==0)y=gcd(a[i].x,y),ans[a[i].id]=2;
else x=g,ans[a[i].id]=1;
}
if(x==1&&y==1){puts("YES");for(int i=1;i<=n;++i)printf("%d ",ans[i]);return puts(""),0;}
}
puts("NO");
}
```
P5221 Product.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000005;
const int mod=104857601;
int n,fz=1,fm=1,ans;
int pri[785050],cnt,phi[N];
bool vis[N];
inline int qpow(int x,int y,int ret=1){
for(;y;y>>=1,x=1ll*x*x%mod) if(y&1)
ret=1ll*ret*x%mod; return ret;
}
void qmod(int&x,int mod){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
void Sieve(const int&N) {
phi[1]=1;
for (int i=2;i<=N;++i){
if(!vis[i])pri[++cnt]=i,phi[i]=i-1;
for (int j=1;j<=cnt&&i*pri[j]<=N;++j) {
vis[i*pri[j]]=1;
if (i%pri[j]==0){phi[i*pri[j]]=phi[i]*pri[j];break;}
phi[i*pri[j]]=phi[i]*phi[pri[j]];
}
}
for(int i=1;i<=N;++i)qmod(phi[i]+=phi[i-1],mod-1);
}
signed main(){
n=read(),Sieve(n);
for(int i=1;i<=n;++i)fz=1ll*i*fz%mod;fz=qpow(fz,n<<1);
for(int i=1;i<=n;++i)fm=1ll*fm*qpow(i,(phi[n/i]<<1)-1)%mod;
fm=qpow(fm,mod-2);
ans=1ll*fz*fm%mod*fm%mod,printf("%d\n",ans);
return 0;
}```
CF960G Bandit Blues.cpp
```// Problem: G. Bandit Blues
// Contest: Codeforces - Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)
// URL: https://codeforces.com/problemset/problem/960/G
// Memory Limit: 256 MB
// Time Limit: 3500 ms
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
const int M = N << 2;
#define mod 998244353
namespace math{
inline int qpow(int n, int k) {
int res = 1;
for (; k; k >>= 1, n = 1ll * n * n % mod)
if (k & 1) res = 1ll * n * res % mod;
return res;
}
int inv[N], fac[N], ifc[N];
void initmath(const int &n = N-1) {
inv[1] = 1; for (int i = 2 ;i <= n; ++i) inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
fac[0] = 1; for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
ifc[n] = qpow(fac[n], mod - 2); for(int i = n - 1; i >= 0; --i) ifc[i] =1ll * (i + 1) * ifc[i + 1] % mod;
}
}
using namespace math;
namespace poly{
int rev[M], lg, lim;
void init_poly(const int &n) {
for (lg = 0, lim = 1; lim < n; ++lg, lim <<= 1);
for (int i = 0; i < lim; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (lg - 1));
}
void NTT(int *a, int op) {
for (int i = 0; i < lim; ++i)
if (i > rev[i]) swap(a[i], a[rev[i]]);
const int g = op ? 3 : inv[3];
for (int i = 1; i < lim; i <<= 1) {
const int wn = qpow(g, (mod - 1) / (i << 1));
for (int j = 0; j < lim; j += i << 1) {
int w0 = 1;
for (int k = 0; k < i; ++k, w0 = 1ll * w0 * wn % mod) {
const int X = a[j + k], Y = 1ll * w0 * a[i + j + k] % mod;
a[j + k] = (X + Y) % mod, a[i + j + k] = (X - Y + mod) % mod;
}
}
}
if (op) return; const int ilim = qpow(lim, mod - 2);
for (int i = 0; i < lim; ++i) a[i] = 1ll * ilim * a[i] % mod;
}
#define clr(a, n) memset(a, 0, sizeof(int) * (n))
#define cpy(a, b, n) memcpy(a, b, sizeof(int) * (n))
void poly_mul(int *f, int *g, int *ans, int n, int m) {
static int A[M], B[M]; init_poly(n + m);
cpy(A, f, n), clr(A + n, lim - n), NTT(A, 1);
cpy(B, g, m), clr(B + m, lim - m), NTT(B, 1);
for (int i = 0; i < lim; ++i) ans[i] = 1ll * A[i] * B[i] % mod;
NTT(ans, 0);
}
void poly_shift(int *g, int*f, int n, int c) {
static int A[M], B[M];
for (int i = 0; i < n; ++i) A[i] = 1ll * f[i] * fac[i] % mod;
for (int i = 0, j = 1; i < n; ++i, j = 1ll * j * c % mod) B[i] = 1ll * j * ifc[i] % mod;
reverse(B, B + n), poly_mul(A, B, A, n, n);
for (int i = 0; i < n; ++i) g[i] = 1ll * ifc[i] * A[i + n - 1] % mod;
}
void up_pow(int *g, int n) {
static int A[M];
if (n == 1) return g[0] = 0, g[1] = 1, void();
if (n & 1) {
up_pow(g, n - 1);
for (int i = n; i > 0; --i) g[i] = (g[i - 1] + 1ll * g[i] * (n - 1) % mod) % mod;
} else {
up_pow(g, n / 2);
poly_shift(A, g, n / 2 + 1, n / 2);
poly_mul(g, A, g, n / 2 + 1, n / 2 + 1);
}
}
void stirling1_row(int *g, int n) { up_pow(g, n); }
}
int n, A, B, ans, sti[M];
signed main() {
initmath();
n = read(), A = read(), B = read();
if (!A || !B || A + B - 2 > n - 1) return puts("0"), 0;
if (n == 1) return puts("1"), 0;
ans = 1ll * fac[A + B - 2] * ifc[A - 1] % mod * ifc[B - 1] % mod;
poly::stirling1_row(sti, n - 1);
ans = 1ll * ans * sti[A + B - 2] % mod;
printf("%d\n", ans);
return 0;
}```
CF1239E Turtle.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=30;
const int M=5e4+5;
int n,sum;
int a[N<<1],dp[N][M*N],flg[N<<1],tmp[2];
vector<int>v;
signed main() {
n=rd();
for(rint i=1;i<=(n<<1);++i)a[i]=rd(),sum+=a[i];
sort(a+1,a+(n<<1)+1);sum-=a[1]+a[2],--n;
tmp[0]=a[1],tmp[1]=a[2];
for(rint i=1;i<=(n<<1);++i)a[i]=a[i+2];
dp[0][0]='F'*'Y'*'Y'*'A'*'K'*'I'*'O'*'I';
for(rint i=1;i<=(n<<1);++i) {
for(rint j=1,mx=min(i,n);j<=mx;++j) {
for(rint k=a[i];k<=sum;++k) {
if(dp[j][k])continue;
if(dp[j-1][k-a[i]]&&dp[j-1][k-a[i]]!=i)dp[j][k]=i;
}
}
}
for(rint i=sum>>1;i>=0;--i) {
if(!dp[n][i])continue;
int now=i;
for(rint j=n;j>=1;--j)
v.pb(a[dp[j][now]]),flg[dp[j][now]]=1,now-=a[dp[j][now]];
break;
}
sort(v.begin(),v.end());
printf("%d",tmp[0]);for(uint i=0;i<v.size();++i)printf(" %d",v[i]);puts("");
for(rint i=(n<<1);i>=1;--i)if(!flg[i])printf("%d ",a[i]);printf("%d\n",tmp[1]);
return 0;
}```
多项式全家桶（基础部分）.cpp
```const int N=100005;
const int M=N<<2;
#define mod 998244353
namespace math{
inline int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
int fac[N],ifc[N],inv[N];
void initmath(const int&n=N-1){
fac[0]=1;for(int i=1;i<=n;++i)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);for(int i=n-1;i>=0;--i)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
inv[1]=1;for(int i=2;i<=n;++i)inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
}
}
using math::qpow;
using math::fmod;
namespace poly{
int rev[M],lg,lim;
void init_poly(const int&n){
for(lg=0,lim=1;lim<n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
const int g=op?3:math::inv[3];
for(int i=1;i<lim;i<<=1){
const int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=mod+X-Y);
}
}
}
if(op)return;const int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*a[i]*ilim%mod;
}
#define clr(a,n) memset(a,0,sizeof(int)*(n))
#define cpy(a,b,n) memcpy(a,b,sizeof(int)*(n))
void poly_mul(int*f,int*g,int*ans,int n,int m){
static int A[M],B[M];init_poly(n+m);
cpy(A,f,n),clr(A+n,lim-n),NTT(A,1);
cpy(B,g,m),clr(B+m,lim-m),NTT(B,1);
for(int i=0;i<lim;++i)ans[i]=1ll*A[i]*B[i]%mod;
NTT(ans,0);
}
void poly_inv(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=qpow(f[0],mod-2),void();
poly_inv(g,f,(n+1)>>1);
init_poly(n<<1);
cpy(A,f,n),clr(A+n,lim-n),clr(g+n,lim-n);
NTT(A,1),NTT(g,1);
for(int i=0;i<lim;++i)g[i]=1ll*g[i]*(2-1ll*g[i]*A[i]%mod+mod)%mod;
NTT(g,0),clr(g+n,lim-n);
}
void poly_sqrt(int*g,int*f,int pw){
static int A[M];
if(pw==1)return g[0]=1,void();
poly_sqrt(g,f,(pw+1)>>1);
clr(A,pw),poly_inv(A,g,pw),poly_mul(A,f,A,pw,pw);
for(int i=0,iv2=math::inv[2];i<pw;++i)g[i]=1ll*(g[i]+A[i])*iv2%mod;
}
void dao(int*g,int*f,int n){
for(int i=0;i<n-1;++i)g[i]=1ll*f[i+1]*(i+1)%mod;g[n-1]=0;
}
void jif(int*g,int*f,int n){
for(int i=1;i<=n;++i)g[i]=1ll*f[i-1]*math::inv[i]%mod;g[0]=0;
}
void poly_ln(int*g,int*f,int n){
static int A[M],B[M];
dao(A,f,n),clr(B,n),poly_inv(B,f,n),poly_mul(A,B,A,n,n),jif(g,A,n);
}
void poly_exp(int*g,int*f,int n){
static int A[M];
if(n==1)return g[0]=1,void();
poly_exp(g,f,(n+1)>>1);
clr(A,n),poly_ln(A,g,n);
for(int i=0;i<n;++i)fmod(A[i]=(!i)-A[i]+f[i]+mod);
poly_mul(A,g,g,n,n),clr(g+n,lim-n);
}
void poly_qpow(int*g,int*f,int n,int k){
static int A[M];
clr(A,n),poly_ln(A,f,n);
for(int i=0;i<n;++i)A[i]=1ll*A[i]*k%mod;
clr(g,n),poly_exp(g,A,n);
}
}```
AT2041 [AGC004A] Divide a Cuboid.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef long double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return x;
}
LL ans,A,B,C;
signed main(){
A=read(),B=read(),C=read();
ans=1e18;
ckmin(ans,(A%2)*(B*C));
ckmin(ans,(B%2)*(A*C));
ckmin(ans,(C%2)*(A*B));
printf("%lld\n",ans);
return 0;
}```
CF1131D Gourmet choice.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
int rdc(){
char ch=getchar();
while(ch!='='&&ch!='>'&&ch!='<')ch=getchar();
if(ch=='>')return 1;
else if(ch=='<')return -1;
return 0;
}
#define N 2005
int n,m,a[N][N],fa[N],ind[N],val[N];
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
int head[N],num_edge;
struct edge{int nxt,to;}e[N*N];
void addedge(int fr,int to){
if(fr==to)puts("NO"),exit(0);
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
void topo(){
queue<int>q;
for(int i=1;i<=n+m;++i)if(!ind[find(i)]&&find(i)==i)q.push(i),val[i]=1;
while(!q.empty()){
int u=q.front();q.pop();
// cerr<<u<<' '<<ind[u]<<'\n';
if(ind[u]<0)puts("No"),exit(0);
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
val[v]=max(val[u]+1,val[v]);
if(--ind[v]<=0)q.push(v);
}
}
for(int i=1;i<=n+m;++i)if(ind[i])puts("No"),exit(0);
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
a[i][j]=rdc();
for(int i=1;i<=n+m;++i)fa[i]=i;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(!a[i][j])fa[find(i)]=find(j+n);
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
if(a[i][j]==-1)addedge(find(i),find(j+n)),++ind[find(j+n)];
else if(a[i][j]==1)addedge(find(j+n),find(i)),++ind[find(i)];
topo();
puts("Yes");
for(int i=1;i<=n;++i)printf("%d ",val[find(i)]);puts("");
for(int i=1;i<=m;++i)printf("%d ",val[find(i+n)]);puts("");
return 0;
}```
CF1140F Extending Set of Points.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=300005;
const int C=N-5;
int n,x[N],y[N],L[N],R[N],F[N<<1],sx[N<<1],sy[N<<1];
LL now,ans[N];
map<pair<int,int>,int>mp;
#define lc (p<<1)
#define rc (p<<1|1)
vector<pair<int,int> >v[N<<2];
void update(int ql,int qr,pair<int,int>d,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return v[p].pb(d),void();
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,d,l,mid,lc);
if(mid<qr)update(ql,qr,d,mid+1,r,rc);
}
vector<int>stk;
int anc(int x){while(x!=F[x])x=F[x];return x;}
void merge(int x,int y){
int fx=anc(x),fy=anc(y);
if(fx==fy)return;
now-=1ll*sx[fx]*sy[fx];
now-=1ll*sx[fy]*sy[fy];
if(sx[fx]+sy[fx]<sx[fy]+sy[fy])swap(fx,fy);
stk.pb(fy),F[fy]=fx,sx[fx]+=sx[fy],sy[fx]+=sy[fy];
now+=1ll*sx[fx]*sy[fx];
}
void undo(){
int x=stk.back(),y=F[x];stk.pop_back();
now-=1ll*sx[y]*sy[y];
sx[y]-=sx[x],sy[y]-=sy[x],F[x]=x;
now+=1ll*sx[x]*sy[x];
now+=1ll*sx[y]*sy[y];
}
void solve(int l,int r,int p){
int nowsize=sz(stk);
for(vector<pair<int,int> >::iterator i=v[p].begin();i!=v[p].end();++i){
int x=i->fi,y=i->se+C;
merge(x,y);
}
if(l==r)ans[l]=now;
else{
int mid=(l+r)>>1;
solve(l,mid,lc),solve(mid+1,r,rc);
}
while(sz(stk)>nowsize)undo();
}
signed main(){
rep(i,1,C)F[i]=i,sx[i]=1,sy[i]=0;
rep(i,C+1,C<<1)F[i]=i,sx[i]=0,sy[i]=1;
n=read();
rep(i,1,n){
x[i]=read(),y[i]=read();
if(!mp[mkp(x[i],y[i])])L[i]=i,R[i]=n,mp[mkp(x[i],y[i])]=i;
else R[mp[mkp(x[i],y[i])]]=i-1,mp[mkp(x[i],y[i])]=0;
}
rep(i,1,n)if(L[i]==i)update(L[i],R[i],mkp(x[i],y[i]));
solve(1,n,1);
rep(i,1,n)printf("%lld ",ans[i]);
return 0;
}```
P2831 愤怒的小鸟.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=18;
const int M=(1<<N)+5;
int n,dp[M],inc[N][N],bit[M];
double x[N],y[N],eps=1e-9;
int calc(int i,int j) {
double div=x[j]/x[i];
double a=(y[j]-y[i]*div)/(x[j]*x[j]-x[i]*x[i]*div);
double b=(y[i]-a*x[i]*x[i])/x[i];
if(a>-eps)return 0;
int res=0;
for(int i=0;i<n;++i)if(fabs(a*x[i]*x[i]+b*x[i]-y[i])<eps)res|=1<<i;
return res;
}
void Main() {
n=rd(),rd();
memset(dp,0x3f,sizeof(dp));
for(int i=0;i<n;++i)scanf("%lf%lf",&x[i],&y[i]);
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
inc[i][j]=calc(i,j);
dp[0]=0;
for(int msk=0,t;msk<1<<n;++msk) {
for(int i=0;i<n;++i) {
dp[msk|(1<<i)]=min(dp[msk|(1<<i)],dp[msk]+1);
int t=inc[bit[msk]][i];
if(bit[msk]<n)dp[msk|t]=min(dp[msk|t],dp[msk]+1);
}
}
printf("%d\n",dp[(1<<n)-1]);
}
signed main() {
for(int i=0;i<1<<18;++i) {
for(int j=0;;++j)
if(!(i&(1<<j))){bit[i]=j;break;}
}
for(int T=rd();T;--T)Main();
}
```
P1383 高级打字机.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
char rdc() {
char ch=getchar();
while(!isalpha(ch))ch=getchar();
return ch;
}
const int N=100010;
const int M=22*N;
int n,cnt,tot;
int root[N],len[N];
char val[M];
int ls[M],rs[M];
void update(int pre,int &now,int l,int r,int pos) {
now=++tot;
rs[now]=rs[pre],ls[now]=ls[pre];
if(l==r){val[now]=rdc();return;}
int mid=(l+r)>>1;
if(pos<=mid)update(ls[pre],ls[now],l,mid,pos);
else update(rs[pre],rs[now],mid+1,r,pos);
}
char query(int now,int l,int r,int k) {
if(l==r)return val[now];
int mid=(l+r)>>1;
if(k<=mid)return query(ls[now],l,mid,k);
else return query(rs[now],mid+1,r,k);
}
signed main() {
n=rd();
for(rint T=1;T<=n;++T){
char ch=rdc();int x;
if(ch=='T') {
++cnt,len[cnt]=len[cnt-1]+1;
update(root[cnt-1],root[cnt],1,n,len[cnt]);
} else if(ch=='U') {
++cnt,x=rd(),root[cnt]=root[cnt-x-1],len[cnt]=len[cnt-x-1];
} else printf("%c\n",query(root[cnt],1,n,rd()));
}
return 0;
}
```
CF1355C Count Triangles.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
int A,B,C,D;
LL ans;
signed main() {
A=rd(),B=rd(),C=rd(),D=rd();
for(int i=max(A+B,C+1);i<=B+C;++i) {
int x=min(B,i-B)-max(A,i-C)+1;
int z=min(i-1,D)-C+1;
ans+=1ll*x*z;
}
cout<<ans<<endl;
}```
SP20644 ZQUERY - Zero Query.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 100005;
const int S = 250;
const int B = N / S + 3;
int n, m, a[N], L[B], R[B], num, bel[N], ans[N];
int ri[N],le[N];
struct QUE{
int id, l, r;
QUE(){ id = l = r = 0; }
inline bool operator < (const QUE & t) const { return bel[l] != bel[t.l] ? l < t.l : r < t.r; }
}q[N];
void brute(int l, int r, int id){
static int col[N], lst[N], inited = 0;
if (!inited) memset(col, 0, sizeof(col)), inited = 1;
int res = 0;
for (int i = l; i <= r; ++ i)
if (col[a[i]] != id) col[a[i]] = id, lst[a[i]] = i;
else ckmax(res, i - lst[a[i]]);
ans[id]=res;
}
signed main(){
n = read() + 1, m = read(), num = (n -1) / S + 1;
rep (i, 2, n) a[i] = read() + a[i-1];
rep (i, 1, n) a[i] += n + 1;
rep (i, 1, num) L[i] = R[i - 1] + 1, R[i] = i * S; R[num] = n;
rep (i, 1, num) rep(j, L[i], R[i]) bel[j] = i;
rep (i, 1, m) q[i].l = read(), q[i].r = read() + 1, q[i].id = i;
sort(q + 1, q + m + 1);
// rep (i, 1, n) cerr << a[i] << ' '; cerr << '\n';
for (int i = 1, j = 1; i <= num; ++i){
int r = R[i], res = 0;
static int lst[N];
fill(le, le + (n << 1) + 1, n), fill(ri, ri + (n << 1) + 1, 0);
for (; bel[q[j].l] == i; ++j){
if (bel[q[j].l] == bel[q[j].r]) {brute(q[j].l, q[j].r, q[j].id); continue;}
while (r < q[j].r) ++r, ckmin(le[a[r]], r), ckmax(ri[a[r]], r), ckmax(res, r - le[a[r]]);
int tmp = res;
for (int k = q[j].l; k <= R[i]; ++ k) lst[a[k]] = 0;
for (int k = R[i]; k >= q[j].l; -- k) ckmax(lst[a[k]], k), ckmax(tmp, max(ri[a[k]], lst[a[k]]) - k);
ans[q[j].id] = tmp;
}
}
rep (i, 1, m) printf("%d\n", ans[i]);
return 0;
}
/*
20 1
1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1
7 12
*/```
P1471 方差.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1000010;
double s1[N<<2],s2[N<<2],tag[N<<2],a[N];
int n,m;
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {
s1[p]=s1[lc]+s1[rc],s2[p]=s2[lc]+s2[rc];
}
void build(int l,int r,int p) {
if(l==r) {
s1[p]=a[l];
s2[p]=a[l]*a[l];
return;
}
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void addtag(int p,int l,int r,double d) {
s2[p]+=2*d*s1[p]+d*d*(r-l+1);
s1[p]+=d*(r-l+1);
tag[p]+=d;
}
void pushdown(int p,int l,int r) {
int mid=(l+r)>>1;
addtag(lc,l,mid,tag[p]);
addtag(rc,mid+1,r,tag[p]);
tag[p]=0;
}
void update(int ql,int qr,int l,int r,int p,double k) {
if(ql<=l&&r<=qr) {
addtag(p,l,r,k);return;
}
pushdown(p,l,r);
int mid=(l+r)>>1;
if(mid>=ql)update(ql,qr,l,mid,lc,k);
if(mid<qr)update(ql,qr,mid+1,r,rc,k);
pushup(p);
}
double query1(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return s1[p];
pushdown(p,l,r);
int mid=(l+r)>>1;double res=0;
if(mid>=ql)res+=query1(ql,qr,l,mid,lc);
if(mid<qr)res+=query1(ql,qr,mid+1,r,rc);
return res;
}
double query2(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return s2[p];
pushdown(p,l,r);
int mid=(l+r)>>1;double res=0;
if(mid>=ql)res+=query2(ql,qr,l,mid,lc);
if(mid<qr)res+=query2(ql,qr,mid+1,r,rc);
return res;
}
signed main() {
n=rd(),m=rd();
for(rint i=1;i<=n;++i)scanf("%lf",&a[i]);
build(1,n,1);
while(m--) {
int opt=rd(),x=rd(),y=rd();double z;
if(opt==1) scanf("%lf",&z),update(x,y,1,n,1,z);
else if(opt==2)printf("%.4lf\n",query1(x,y,1,n,1)/(y-x+1));
else {
double sum=query1(x,y,1,n,1),ave=sum/(y-x+1);
printf("%.4lf\n",(query2(x,y,1,n,1)-2*sum*ave+(y-x+1)*ave*ave)/(y-x+1));
}
}
return 0;
}
```
P3935 Calculating.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define pb push_back
#define mkp(x,y) make_pair(x,y)
#define db double
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
#define int long long
const int mod=998244353;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int sum(int x) {
int res=0;
for(int l=1,r;l<=x;l=r+1)
r=x/(x/l),res=(res+(r-l+1)*(x/l))%mod;
return res;
}
signed main() {
int x=rd(),y=rd();
printf("%lld\n",(sum(y)-sum(x-1)+mod)%mod);
return 0;
}```
CF865D Buy Low Sell High.cpp
```
#include<bits/stdc++.h>
using namespace std;
#define N 300005
int n,a[N];
long long ans;
priority_queue<int,vector<int>,greater<int> >q;
signed main(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&a[i]);
q.push(a[i]),q.push(a[i]);
ans+=a[i]-q.top(),q.pop();
}
printf("%lld\n",ans);
return 0;
}```
P1006 传纸条.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define fyy_AK_IOI return 0
#define rint register int
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=60;
int dp[N*2][N][N],n,m,a[N<<1][N];
signed main() {
m=rd(),n=rd();
for(rint i=1;i<=m;++i)
for(rint j=1;j<=n;++j)
a[i][j]=rd();
memset(dp,-1,sizeof(dp));
dp[2][1][1]=0;
for(rint i=3;i<=m+n-1;++i) {
for(rint j=1;j<=n;++j) {
for(rint k=j+1;k<=n;++k) {
int tmp=-1;
tmp=max(dp[i-1][j-1][k-1],max(dp[i-1][j-1][k],max(dp[i-1][j][k-1],dp[i-1][j][k])));
if(tmp!=-1)dp[i][j][k]=tmp+a[i-j][j]+a[i-k][k];
}
}
}
printf("%d\n",dp[n+m-1][n-1][n]);
return 0;
}```
P3239 [HNOI2015]亚瑟王.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=225;
const int R=140;
int n,r,d[N];
db dp[N][R],p[N],ans;
db qpow(db n,int k){db res=1;for(;k;k>>=1,n=n*n)if(k&1)res=res*n;return res;}
void Main(){
n=read(),r=read();
rep(i,1,n)scanf("%lf%d",&p[i],&d[i]);
dp[1][0]=qpow(1-p[1],r),dp[1][1]=1-dp[1][0];
rep(i,2,n)rep(j,0,min(i,r)){
dp[i][j]=0;
if(i!=j)dp[i][j]=dp[i-1][j]*qpow(1-p[i],r-j);
if(j)dp[i][j]+=dp[i-1][j-1]*(1-qpow(1-p[i],r-j+1));
}
ans=0;
rep(i,1,n){
db res=0;
if(i==1)res=1-qpow(1-p[1],r);
else rep(j,0,min(i-1,r))res+=dp[i-1][j]*(1-qpow(1-p[i],r-j));
ans+=res*d[i];
}
printf("%.10lf\n",ans);
}
signed main(){for(int T=read();T;--T)Main();}```
CF682C Alyona and the Tree.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
const int inf=1000000007;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int n,a[N],siz[N],ans;
vector<pair<int,int> >g[N];
void dfs1(int u) {
siz[u]=1;
for(rint i=0;i<g[u].size();++i) {
dfs1(g[u][i].first);
siz[u]+=siz[g[u][i].first];
}
}
void dfs2(int u,LL sum) {
if(a[u]<sum) {ans+=siz[u];return;}
for(rint i=0;i<g[u].size();++i)
dfs2(g[u][i].first,max((LL)g[u][i].second,sum+g[u][i].second));
}
signed main() {
n=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
for(rint i=2,x,y;i<=n;++i) {
x=rd(),y=rd();
g[x].push_back(make_pair(i,y));
}
dfs1(1),dfs2(1,0);
printf("%d\n",ans);
return 0;
}```
P6075 [JSOI2015]子集选取.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return f?x:-x;
}
int n,k;
const int mod=1e9+7;
int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;
return res;
}
signed main(){
cin>>n>>k,cout<<qpow(2,1ll*n*k%(mod-1));
}```
CF475D CGCDSSQ.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rint register int
#define il inline
il int rd(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
return x*f;
}
const int N=100005;
map<int,ll>mp[3];
#define IT map<int,ll>::iterator
int n,a[N],u;
int gcd(const int &x,const int &y) {
return y?gcd(y,x%y):x;
}
int main() {
n=rd();
for(rint i=1,x;i<=n;++i) {
x=rd();u^=1;
mp[u].clear();
++mp[u][x];
for(IT it=mp[u^1].begin();it!=mp[u^1].end();++it)
mp[u][gcd(it->first,x)]+=it->second;
for(IT it=mp[u].begin();it!=mp[u].end();++it)
mp[2][it->first]+=it->second;
}
for(rint i=rd();i>=1;--i)
printf("%lld\n",mp[2][rd()]);
return 0;
} ```
P4390 [BOI2007]Mokia 摩基亚.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200009;
const int M=2000009;
int n,w,ans[N],cnt,tr[M];
bool isquery[N];
struct ASK {
int id,opt,c,x,y,val;
inline bool operator < (const ASK&rhs)const{return x<rhs.x;}
}p[N],q[N];
void add(int x,int d) {
if(!x)return;
for(int i=x;i<=w;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
void clear(int x) {
if(!x)return;
for(int i=x;i<=w;i+=i&-i)tr[i]=0;
}
void cdq(int l,int r) {
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid),cdq(mid+1,r);
for(int i=mid+1,j=l;i<=r;++i) {
if(p[i].opt)continue;
for(;j<=mid&&p[j].x<=p[i].x;++j)
if(p[j].opt)add(p[j].y,p[j].val);
ans[p[i].id]+=p[i].c*ask(p[i].y);
}
for(int i=l;i<=mid;++i)if(p[i].opt)clear(p[i].y);
merge(p+l,p+mid+1,p+mid+1,p+r+1,q+l);
for(int i=l;i<=r;++i)p[i]=q[i];
}
signed main() {
rd(),w=rd();
while("fyyAKIOI") {
int opt=rd(),x,y,z,k;
if(opt==3)break;
opt&=1,++cnt,x=rd(),y=rd(),z=rd();
if(opt)++n,p[n].opt=opt,p[n].x=x,p[n].y=y,p[n].id=cnt,p[n].val=z;
else {
isquery[cnt]=1,k=rd();
++n,p[n].opt=opt,p[n].x=z,p[n].y=k,p[n].id=cnt,p[n].c=1;
++n,p[n].opt=opt,p[n].x=x-1,p[n].y=y-1,p[n].id=cnt,p[n].c=1;
++n,p[n].opt=opt,p[n].x=x-1,p[n].y=k,p[n].id=cnt,p[n].c=-1;
++n,p[n].opt=opt,p[n].x=z,p[n].y=y-1,p[n].id=cnt,p[n].c=-1;
}
}
cdq(1,n);
for(int i=1;i<=cnt;++i)if(isquery[i])printf("%d\n",ans[i]);
return 0;
}
```
P4172 [WC2006]水管局长.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define fi first
#define se second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
template<int N>
struct Link_Cut_Tree{
static const int O=N+5;
int ch[O][2],fa[O],sum[O],val[O],id[O];
bool fl[O];
Link_Cut_Tree(){
memset(ch,0,sizeof(ch));
memset(fa,0,sizeof(fa));
memset(val,0,sizeof(val));
memset(sum,0,sizeof(sum));
memset(id,0,sizeof(id));
memset(fl,0,sizeof(fl));
}
bool nroot(int x){return ch[fa[x]][0]==x||ch[fa[x]][1]==x;}
void pushup(int x){
sum[x]=sum[ch[x][0]]+val[x]+sum[ch[x][1]];
id[x]=x;
if(ch[x][0]&&val[id[ch[x][0]]]>val[id[x]])id[x]=id[ch[x][0]];
if(ch[x][1]&&val[id[ch[x][1]]]>val[id[x]])id[x]=id[ch[x][1]];
}
void pushdown(int x){
if(fl[x]){
fl[x]^=1,fl[ch[x][0]]^=1,fl[ch[x][1]]^=1;
swap(ch[x][0],ch[x][1]);
}
}
void rotate(int x){
int y=fa[x],z=fa[y],k=ch[y][1]==x,w=ch[x][!k];
if(nroot(y))ch[z][ch[z][1]==y]=x;
ch[x][!k]=y,ch[y][k]=w;
if(w)fa[w]=y;
fa[y]=x,fa[x]=z;
pushup(y);
}
void splay(int x){
static int stk[O],top;
int y=x,z;stk[top=1]=y;
while(nroot(y))stk[++top]=y=fa[y];
while(top)pushdown(stk[top--]);
while(nroot(x)){
y=fa[x],z=fa[y];
if(nroot(y))rotate((ch[z][1]==y)^(ch[y][1]==x)?x:y);
rotate(x);
}
pushup(x);
}
void access(int x){
for(int y=0;x;x=fa[y=x])
splay(x),ch[x][1]=y,pushup(x);
}
void makeroot(int x){access(x),splay(x),fl[x]^=1;}
int findroot(int x){
access(x),splay(x);
while(ch[x][0])pushdown(x),x=ch[x][0];
return splay(x),x;
}
void split(int x,int y){
makeroot(x),access(y),splay(y);
}
void link(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)!=x)splay(y),fa[x]=y;
}else makeroot(x),fa[x]=y;
}
void cut(int x,int y,int op=0){
if(op){
makeroot(x);
if(findroot(y)==x&&fa[y]==x&&!ch[y][0])
fa[y]=ch[x][1]=0;
}else split(x,y),fa[x]=ch[y][0]=0,pushup(y);
}
int ask_sum(int x,int y){return split(x,y),sum[y];}
pair<int,int>ask_max(int x,int y){return split(x,y),mkp(val[id[y]],id[y]);}
};
Link_Cut_Tree<200000>lct;
map<pair<int,int>,int>H;
const int N=100005;
int n,m,q,ans[N];
int F[N];
int broken[N];
struct edge {
int u,v,d;
}a[N];
struct node {
int opt,x,y;
}qu[N];
int find(int x) {
return F[x]==x?x:F[x]=find(F[x]);
}
bool cmp(const edge &a,const edge &b) {
return a.d<b.d;
}
signed main() {
n=read(),m=read(),q=read();
for(int i=1;i<=m;++i) {
a[i].u=read(),a[i].v=read(),a[i].d=read(),F[i]=i;
if(a[i].u>a[i].v)swap(a[i].u,a[i].v);
}
sort(a+1,a+m+1,cmp);
for(int i=1;i<=m;++i)H[mkp(a[i].u,a[i].v)]=i;
for(int i=1;i<=q;++i) {
qu[i].opt=read(),qu[i].x=read(),qu[i].y=read();
if(qu[i].x>qu[i].y)swap(qu[i].x,qu[i].y);
if(qu[i].opt==2)broken[H[mkp(qu[i].x,qu[i].y)]]=1;
}
for(int i=n+1;i<=n+m;++i)lct.val[i]=a[i-n].d;
for(int i=1;i<=m;++i) {
if(broken[i])continue;
int u=a[i].u,v=a[i].v;
int fx=find(u),fy=find(v);
if(fx!=fy)F[fx]=fy,lct.link(u,i+n),lct.link(i+n,v);
}
for(int i=q;i;--i) {
int x=qu[i].x,y=qu[i].y;
if(qu[i].opt==1)ans[i]=lct.ask_max(x,y).fi;
else {
lct.split(x,y);int ID=H[mkp(x,y)],tmp=lct.id[y];
if(lct.val[tmp]>a[ID].d) {
lct.cut(a[tmp-n].u,tmp),lct.cut(tmp,a[tmp-n].v);
lct.link(x,ID+n),lct.link(ID+n,y);
}
}
}
for(int i=1;i<=q;++i)if(qu[i].opt==1)printf("%d\n",ans[i]);
return 0;
} ```
P4737 [CERC2017]Buffalo Barricades.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 300005;
const int inf = 0x3f3f3f3f;
int n, m, cnt[N], nxt[N], ans[N], to[N], F[N];
inline int anc(int x) { while(x != F[x]) x = F[x] = F[F[x]]; return x; }
struct node {
int x, y, op;
node(){ x = y = op = 0; }
node(int x_, int y_, int op_) { x = x_, y = y_, op = op_; }
} a[N << 1];
set <pair<int, int> > s;
inline bool cmp(const node &a, const node &b) {
return a.y != b.y ? a.y > b.y : a.op > b.op;
}
signed main(){
n=read();
rep(i, 1, n)
a[i].x = read(), a[i].y = read(), a[i].op = 0;
m = read();
rep(i, n + 1, n + m)
a[i].x = read(), a[i].y = read(), a[i].op = i - n;
sort(a + 1, a + n + m + 1, cmp);
s.insert(mkp(inf, m + 1));
rep(i, 1, n + m) {
if(!a[i].op) {
++cnt[s.lower_bound(mkp(a[i].x, 0))->se];
} else {
s.insert(mkp(a[i].x, a[i].op));
nxt[a[i].op] = s.upper_bound(mkp(a[i].x, a[i].op))->se;
while("fyy AKK AKK") {
auto it = s.lower_bound(mkp(a[i].x, a[i].op));
if(it == s.begin())break;
--it;
if(it->se < a[i].op) break;
s.erase(it);
}
}
}
rep(i, 1, m) F[i] = i;
for(int i = m; i >= 1; --i) {
ans[i] = cnt[anc(i)];
if(nxt[i] <= m) {
int f = anc(nxt[i]), x = anc(i);
cnt[f] += cnt[x], F[x] = f;
}
}
for(int i = 1; i <= m; ++i) printf("%d\n", ans[i]);
return 0;
}```
P4149 [IOI2011]Race.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=200005;
const int K=1000006;
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int n,k,ans,cnt[K];
struct egde{
int nxt,to,val;
}e[N<<1];
int head[N],num_edge;
inline void add(int from,int to,int val)
{
++num_edge;
e[num_edge].to=to;
e[num_edge].nxt=head[from];
e[num_edge].val=val;
head[from]=num_edge;
}
int rt,sum,mx[N],size[N],dist[N];
bool used[N];
void getrt(int u,int fa)
{
mx[u]=0,size[u]=1;
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(v==fa||used[v])continue;
getrt(v,u);
size[u]+=size[v];
mx[u]=max(mx[u],size[v]);
}
mx[u]=max(sum-mx[u],mx[u]);
if(mx[u]<mx[rt])rt=u;
}
void getdis(int u,int fa,int dep)
{
if(dist[u]>=0&&dist[u]<=k)ans=min(ans,dep+cnt[k-dist[u]]);
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(used[v]||v==fa)continue;
dist[v]=dist[u]+e[i].val;
getdis(v,u,dep+1);
}
}
void upd(int u,int fa,int dep,int o)
{
if(dist[u]>=0&&dist[u]<=k)
{
if(o)cnt[dist[u]]=min(cnt[dist[u]],dep);
else cnt[dist[u]]=n;
}
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(v==fa||used[v])continue;
upd(v,u,dep+1,o);
}
}
void calc(int u)
{
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(used[v])continue;
dist[v]=e[i].val;
getdis(v,u,1);
upd(v,u,1,1);
}
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(used[v])continue;
upd(v,u,1,0);
}
}
void solve(int u)
{
used[u]=true;calc(u);
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(used[v])continue;
rt=0;
sum=size[v];
getrt(v,u);
solve(rt);
}
}
int main()
{
scanf("%d%d",&n,&k);ans=n;
for(int i=1,x,y,z;i<n;++i)
scanf("%d%d%d",&x,&y,&z),++x,++y,add(x,y,z),add(y,x,z);
for(int i=1;i<=k;++i)cnt[i]=n;
sum=n,mx[rt=0]=n,getrt(1,0),solve(rt);
ans=ans==n?-1:ans;
printf("%d\n",ans);
return 0;
}```
P1919【模板】A×B（FFT快速傅里叶）.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=4000010;
struct num {
int a[N],len;
num(){memset(a,0,sizeof(a)),len=0;}
void read() {
char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))a[len++]=ch-'0',ch=getchar();
reverse(a,a+len);
}
void print(char c=-1) {
printf("%d",a[len-1]);
for(rint i=len-2;i>=0;--i)putchar(a[i]+'0');
if(~c)putchar(c);
}
};
struct cp {
double x,y;
cp(){x=y=0;}
cp(double x_,double y_){x=x_,y=y_;}
cp operator + (const cp &t) {return cp(x+t.x,y+t.y);}
cp operator - (const cp &t) {return cp(x-t.x,y-t.y);}
cp operator * (const cp &t) {return cp(x*t.x-y*t.y,x*t.y+y*t.x);}
}A[N],B[N];
const double pi=acos(-1.0);
int rev[N],lg,lim;
void init(int n) {
for(lim=1,lg=0;lim<=n;lim<<=1,++lg);
for(rint i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void FFT(cp *a,int o) {
for(rint i=0;i<lim;++i)
if(rev[i]<i)swap(a[rev[i]],a[i]);
for(rint i=1;i<lim;i<<=1) {
cp wn=cp(cos(pi/i),o*sin(pi/i));
for(rint j=0;j<lim;j+=(i<<1)) {
cp w0=cp(1,0);
for(rint k=0;k<i;++k,w0=w0*wn) {
cp X=a[j+k],Y=w0*a[i+j+k];
a[j+k]=X+Y;
a[i+j+k]=X-Y;
}
}
}
}
num fastmul(const num &a,const num &b) {
num c;int len=a.len+b.len;init(len),c.len=lim;
for(rint i=0,mx=a.len;i<mx;++i)A[i]=cp(a.a[i],0);for(rint i=a.len;i<lim;++i)A[i]=cp(0,0);
for(rint i=0,mx=b.len;i<mx;++i)B[i]=cp(b.a[i],0);for(rint i=b.len;i<lim;++i)B[i]=cp(0,0);
FFT(A,1),FFT(B,1);
for(rint i=0;i<lim;++i)A[i]=A[i]*B[i];
FFT(A,-1);
for(rint i=0;i<lim;++i)c.a[i]=(int)(A[i].x/lim+0.5);
for(rint i=0;i<lim;++i)if(c.a[i]>=10)c.a[i+1]+=c.a[i]/10,c.a[i]%=10;
while(c.len&&!c.a[c.len-1])--c.len;
return c;
}
signed main() {
num a,b;
a.read(),b.read();
a=fastmul(a,b);
a.print();
}
```
CF433C Ryouko's Memory Note.cpp
```#include <bits/stdc++.h>
using namespace std;
#define rint register int
const int N=100010;
int n,m,a[N];
long long ans,s;
vector<int>v[N];
int main() {
scanf("%d%d",&n,&m);
for(rint i=1;i<=m;++i)scanf("%d",&a[i]);
for(rint i=1;i<m;++i) {
s+=abs(a[i]-a[i+1]);
if(a[i]!=a[i+1]) {
v[a[i]].push_back(a[i+1]);
v[a[i+1]].push_back(a[i]);
}
}
ans=s;
long long sum,lst;
for(rint i=1;i<=n;++i) {
if(!v[i].size())continue;
sum=lst=0;
for(rint j=0;j<v[i].size();++j)
lst+=abs(i-v[i][j]);
int mid=v[i].size()/2;
nth_element(v[i].begin(),v[i].begin()+mid,v[i].end());
for(rint j=0;j<v[i].size();++j)
sum+=abs(v[i][mid]-v[i][j]);
ans=min(ans,s-lst+sum);
}
printf("%lld\n",ans);
return 0;
}```
P2414 [NOI2011]阿狸的打字机.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int num,tot,Q;
int ans[N];
int tr[N];
int ln[N],rn[N],timer;
int ch[N][26],fa[N],fail[N],ed[N];
char s[N];
vector<int>g[N];
struct node {
int id,x;
node(){}
node(int a,int b){id=a,x=b;}
};
vector<node>q[N];
void Build_Trie(char*s) {
int u=0,len=strlen(s);
for(int i=0;i<len;++i) {
if(s[i]=='B') u=fa[u];
else if(s[i]=='P')ed[++num]=u;
else {
int c=s[i]-'a';
if(!ch[u][c])ch[u][c]=++tot;
fa[ch[u][c]]=u,u=ch[u][c];
}
}
}
void build_fail() {
queue<int>q;
for(int i=0;i<26;++i)if(ch[0][i])q.push(ch[0][i]);
while(!q.empty()) {
int u=q.front();q.pop();
for(int i=0;i<26;++i)
if(ch[u][i])fail[ch[u][i]]=ch[fail[u]][i],q.push(ch[u][i]);
else ch[u][i]=ch[fail[u]][i];
}
for(int i=1;i<=tot;++i)g[fail[i]].pb(i);
}
void dfs(int u) {
ln[u]=++timer;
for(int v:g[u])dfs(v);
rn[u]=timer;
}
void add(int x,int d){
for(int i=x;i<=timer;i+=i&-i)tr[i]+=d;
}
int ask(int x){
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
void solve() {
int len=strlen(s),u=0,nq=0;
for(int i=0;i<len;++i) {
if(s[i]=='P') {
++nq;
for(uint j=0;j<q[nq].size();++j) {
int id=q[nq][j].id,x=q[nq][j].x;
ans[id]=ask(rn[ed[x]])-ask(ln[ed[x]]-1);
}
} else if(s[i]=='B')add(ln[u],-1),u=fa[u];
else u=ch[u][s[i]-'a'],add(ln[u],1);
}
}
signed main() {
scanf("%s",s);
Build_Trie(s),build_fail(),dfs(0);
Q=rd();
for(int i=1;i<=Q;++i) {
int x=rd(),y=rd();
q[y].pb(node(i,x));
}
solve();
for(int i=1;i<=Q;++i)printf("%d\n",ans[i]);
return 0;
}```
P5488 差分与前缀和.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
const int M=N<<2;
#define mod 1004535809
void fmod(int&x){x+=x>>31&mod,x-=mod,x+=x>>31&mod;}
int qpow(int n,int k){int res=1;for(;k;k>>=1,n=1ll*n*n%mod)if(k&1)res=1ll*n*res%mod;return res;}
inline int exread(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=(1ll*x*10+ch-'0')%mod,ch=getchar();
return x;
}
int rev[M],lg,lim;
void init(const int&n){
for(lg=0,lim=1;lim<=n;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
void NTT(int*a,int op){
int g=op?3:qpow(3,mod-2);
for(int i=0;i<lim;++i)if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1){
int wn=qpow(g,(mod-1)/(i<<1));
for(int j=0;j<lim;j+=i<<1){
int w0=1;
for(int k=0;k<i;++k,w0=1ll*w0*wn%mod){
const int X=a[j+k],Y=1ll*w0*a[i+j+k]%mod;
fmod(a[j+k]=X+Y),fmod(a[i+j+k]=X-Y+mod);
}
}
}
if(op)return;int ilim=qpow(lim,mod-2);
for(int i=0;i<lim;++i)a[i]=1ll*ilim*a[i]%mod;
}
int n,k,t,a[M],f[M];
namespace solve1{
signed main(){
f[0]=1;for(int i=1;i<n;++i)f[i]=1ll*f[i-1]*(k+i-1)%mod*qpow(i,mod-2)%mod;
init(n<<1),NTT(a,1),NTT(f,1);
for(int i=0;i<lim;++i)f[i]=1ll*a[i]*f[i]%mod;
NTT(f,0);
for(int i=0;i<n;++i)fmod(f[i]),printf("%d ",f[i]);
return 0;
}
}
namespace solve2{
signed main(){
f[0]=1;for(int i=1;i<n;++i)f[i]=-1ll*f[i-1]*(k-i+1)%mod*qpow(i,mod-2)%mod;
init(n<<1),NTT(a,1),NTT(f,1);
for(int i=0;i<lim;++i)f[i]=1ll*a[i]*f[i]%mod;
NTT(f,0);
for(int i=0;i<n;++i)fmod(f[i]),printf("%d ",f[i]);
return 0;
}
}
signed main(){
n=read(),k=exread(),t=read();
for(int i=0;i<n;++i)a[i]=read();
if(!t)solve1::main();else solve2::main();
return 0;
}```
CF1469E A Bit Similar.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
struct Rand{
unsigned long long sa,sb,sc;
static const int basic=(1<<30)-1;
Rand(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
void init(){
srand(time(0));
sa=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sb=1ull*::rand()*::rand();
for(int i=1,up=::rand()%100;i<=up;++i)::rand();
srand(::rand()^clock());
sc=1ull*::rand()*::rand();
}
inline int rand(){
sa^=sa<<32,sa^=sa>>13,sa^=sa<<1;
unsigned long long t=sa;
sa=sb,sb=sc,sc^=t^sa;
return static_cast<int>(sc&basic)+1;
}
int rad(int l,int r){return rand()%(r-l+1)+l;}
};
template<int N>
struct String_Hash{
static const int O=N+5;
LL H1[O],H2[O],pw1[O],pw2[O],mod1,mod2;
int base1,base2;
String_Hash(){
static const int base[8]={31,37,41,43,47,53,59,61};
static const LL mod[8]={100000000000031ll,100000000000367ll,100000000000169ll,100000000000261ll,
10000000000000069ll,10000000000000639ll,10000000000000753ll,10000000000000669ll};
static Rand maker;
base1=base[maker.rand()&7];
while((base2=base[maker.rand()&7])==base1);
mod1=mod[maker.rand()&7];
while((mod2=mod[maker.rand()&7])==mod1);
pw1[0]=1;for(int i=1;i<=N;++i)pw1[i]=pw1[i-1]*base1%mod1;
pw2[0]=1;for(int i=1;i<=N;++i)pw2[i]=pw2[i-1]*base2%mod2;
}
void insert(char*str,int n){
H1[0]=H2[0]=0;
for(int i=1;i<=n;++i)H1[i]=(H1[i-1]*base1+str[i]-'0'+1)%mod1;
for(int i=1;i<=n;++i)H2[i]=(H2[i-1]*base2+str[i]-'0'+1)%mod2;
}
LL mul(LL x,LL y,LL mod){
LL res=x*y-(LL)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
pair<LL,LL>Hash_val(int l,int r){
LL v1=(H1[r]-mul(H1[l-1],pw1[r-l+1],mod1)+mod1)%mod1;
LL v2=(H2[r]-mul(H2[l-1],pw2[r-l+1],mod2)+mod2)%mod2;
return mkp(v1,v2);
}
};
const int N=1000005;
String_Hash<N>hs;
int n,k,ans[N];
char S[N],T[N];
void Main(){
scanf("%d%d%s",&n,&k,S+1);
for(int i=1;i<=n;++i)T[i]='1'-S[i]+'0';
map<pair<LL,LL>,bool>mp;
hs.insert(T,n);
for(int i=1;i<=n-k+1;++i)mp[hs.Hash_val(i,i+k-1)]=1;//,cerr<<hs.Hash_val(i,i+k-1).fi<<' '<<hs.Hash_val(i,i+k-1).se<<'\n';
// rep(i,1,n)cerr<<hs.H1[i]<<' ';cerr<<'\n';
// rep(i,1,n)cerr<<hs.H2[i]<<' ';cerr<<'\n';
LL h1=0,h2=0;
for(int i=1;i<=k;++i)h1=(h1*hs.base1+1)%hs.mod1;
for(int i=1;i<=k;++i)h2=(h2*hs.base2+1)%hs.mod2;
for(int i=0;i<=k;++i)ans[i]=0;
for(int i=0;i<=n-k+1;++i){
// for(int j=1;j<=k;++j)putchar(ans[j]+'0');cerr<<":"<<h1<<' '<<h2<<'\n';
if(!mp[mkp(h1,h2)]){
puts("YES");
for(int j=1;j<=k;++j)putchar(ans[j]+'0');
puts("");
return;
}
++ans[k],h1=(h1+1)%hs.mod1,h2=(h2+1)%hs.mod2;
int j=k;
while(ans[j]>1){
ans[j]=0,++ans[j-1];
h1=(h1+hs.pw1[k-j+1]-2ll*hs.pw1[k-j]%hs.mod1+hs.mod1)%hs.mod1;
h2=(h2+hs.pw2[k-j+1]-2ll*hs.pw2[k-j]%hs.mod2+hs.mod2)%hs.mod2;
--j;
}
if(j<=0)break;
}
puts("NO");
}
signed main(){for(int T=read();T;--T)Main();}```
CF725D Contest Balloons.cpp
```#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=300005;
struct node {
int t,w;
friend bool operator < (const node &a,const node &b) {
return a.w-a.t>b.w-b.t;
}
} a[N];
bool cmp(const node &a,const node &b) {
return a.t>b.t;
}
int n,ans;
priority_queue<node>q;
signed main() {
scanf("%lld",&n);
for(int i=1; i<=n; ++i)
scanf("%lld%lld",&a[i].t,&a[i].w);
sort(a+2,a+n+1,cmp);
int it=2,sum=0;
while("fyy ak ioi") {
while(a[it].t>a[1].t&&it<=n)q.push(a[it++]);
ans=max(ans,n-it+1+sum);
if(!q.empty()&&q.top().w-q.top().t+1<=a[1].t)
a[1].t-=q.top().w-q.top().t+1,q.pop(),++sum;
else break;
}
printf("%lld\n",n-ans);
return 0;
}```
P1003 铺地毯.cpp
```#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll x,y,n,a[10005],b[10005],g[10005],k[10005],status=-1;
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld%lld%lld",&a[i],&b[i],&g[i],&k[i]);
}
scanf("%lld%lld",&x,&y);
for(int i=1;i<=n;i++)
{
if(a[i]<=x&&b[i]<=y&&g[i]+a[i]>=x&&k[i]+b[i]>=y)status=i;
}
printf("%lld\n",status);
return 0;
}```
P5024 保卫王国.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100005;
const int M=N<<2;
const LL inf=1e12;
int n,m;
LL p[N];
int siz[N],dfn[N],tmr,son[N],fa[N],top[N],rev[N],ed[N],f[N][2];
char cynAKIOI[114514];
struct edge{
int nxt,to;
}e[N<<1];
int head[N],num_edge;
void addedge(int fr,int to){
++num_edge;
e[num_edge].nxt=head[fr];
e[num_edge].to=to;
head[fr]=num_edge;
}
struct Matrix{
LL p[2][2];
Matrix(){p[0][0]=p[0][1]=p[1][0]=p[1][1]=-inf;}
LL*operator[](const int&k){return p[k];}
Matrix operator * (const Matrix&b){
Matrix res;
// for(int i=0;i<2;++i)
// for(int j=0;j<2;++j)
// for(int k=0;k<2;++k)
// res.p[i][j]=max(res.p[i][j],p[i][k]+b.p[k][j]);
res[0][0]=max(p[0][0]+b.p[0][0],p[0][1]+b.p[1][0]);
res[0][1]=max(p[0][0]+b.p[0][1],p[0][1]+b.p[1][1]);
res[1][0]=max(p[1][0]+b.p[0][0],p[1][1]+b.p[1][0]);
res[1][1]=max(p[1][0]+b.p[0][1],p[1][1]+b.p[1][1]);
return res;
}
}mat[N],val[M];
void dfs1(int u,int ft){
siz[u]=1,f[u][1]=p[u];
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;if(v==ft)continue;
fa[v]=u,dfs1(v,u),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
f[u][0]+=max(f[v][0],f[v][1]);
f[u][1]+=f[v][0];
}
}
void dfs2(int u,int tp){
top[u]=tp,dfn[u]=++tmr,rev[tmr]=u,ed[tp]=tmr;
if(son[u])dfs2(son[u],tp);
LL g[2];g[0]=0,g[1]=p[u];
for(int i=head[u];i;i=e[i].nxt){
int v=e[i].to;
if(v==son[u]||v==fa[u])continue;
dfs2(v,v);
g[0]+=max(f[v][0],f[v][1]);
g[1]+=f[v][0];
}
mat[u][0][0]=g[0],mat[u][0][1]=g[0];
mat[u][1][0]=g[1],mat[u][1][1]=-inf;
}
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p){val[p]=val[lc]*val[rc];}
void build(int l,int r,int p){
if(l==r)return val[p]=mat[rev[l]],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
Matrix query(int ql,int qr,int l=1,int r=n,int p=1){
if(ql<=l&&r<=qr)return val[p];
int mid=(l+r)>>1;
if(qr<=mid)return query(ql,qr,l,mid,lc);
if(mid<ql)return query(ql,qr,mid+1,r,rc);
return query(ql,qr,l,mid,lc)*query(ql,qr,mid+1,r,rc);
}
void change(int pos,int l=1,int r=n,int p=1){
if(l==r)return val[p]=mat[rev[l]],void();
int mid=(l+r)>>1;
if(pos<=mid)change(pos,l,mid,lc);
else change(pos,mid+1,r,rc);
pushup(p);
}
void update(int x,LL v){
mat[x][1][0]+=v,p[x]+=v;
while(x){
Matrix lst=query(dfn[top[x]],ed[top[x]]);
change(dfn[x]);
Matrix now=query(dfn[top[x]],ed[top[x]]);
x=fa[top[x]];
mat[x][0][0]+=max(now[0][0],now[1][0])-max(lst[0][0],lst[1][0]);
mat[x][0][1]=mat[x][0][0];
mat[x][1][0]+=now[0][0]-lst[0][0];
}
}
signed main(){
n=read(),m=read(),scanf("%s",cynAKIOI);
for(int i=1;i<=n;++i)p[0]+=(p[i]=read());
for(int i=1;i<n;++i){
int x=read(),y=read();
addedge(x,y),addedge(y,x);
}
dfs1(1,0),dfs2(1,1),build(1,n,1);
while(m--){
int a=read(),x=read(),b=read(),y=read();
LL ad1=x?-inf:inf,out1=x?0:inf;
LL ad2=y?-inf:inf,out2=y?0:inf;
update(a,ad1),update(b,ad2);
Matrix res=query(dfn[1],ed[1]);
LL out=p[0]-max(res[0][0],res[1][0])+out1+out2;
out<inf?printf("%lld\n",out):puts("-1");
update(a,-ad1),update(b,-ad2);
}
return 0;
}```
P4718 【模板】Pollard-Rho算法.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
LL mul(LL x,LL y,LL mod){
LL res=x*y-(LL)((long double)x/mod*y+0.5)*mod;
return res<0?res+mod:res;
}
LL qpow(LL n,LL k,LL mod){
LL res=1;for(;k;k>>=1,n=mul(n,n,mod))if(k&1)res=mul(res,n,mod);return res;
}
LL gcd(LL x,LL y){
while(y){LL t=x%y;x=y,y=t;}
return x;
}
namespace MR{
static const int pri[10]={2,3,5,7,11,13,17,19,61,233};
bool mr(LL x,LL p){
if(x%p==0||qpow(p,x-1,x)!=1)return 0;
LL k=x-1;
while(!(k&1)){
LL t=qpow(p,k>>=1,x);
if(t!=1&&t!=x-1)return 0;
if(t==x-1)break;
}
return 1;
}
bool test(LL x){
for(int i=0;i<10;++i){
if(x==pri[i])return 1;
if(!mr(x,pri[i]))return 0;
}
return 1;
}
}
namespace PR{
int tot;
LL d[150],ans;
mt19937_64 rnd(673);
#define rad(l,r) (rnd()%((r)-(l)+1)+l)
LL pr(LL x,LL c){
if(x==4)return 2;
LL v0=c,v1=mul(v0,v0,x)+c,g=1;tot=0;
while(1){
d[++tot]=v1-v0,g=mul(g,v1-v0,x);
if(tot==127){if(gcd(g,x)>1)break;tot=0;}
v0=mul(v0,v0,x)+c,v1=mul(v1,v1,x)+c,v1=mul(v1,v1,x)+c;
}
for(int i=1;i<=tot;++i){g=gcd(d[i],x);if(g>1)return g;}
return x;
}
void solve(LL x){
if(x<=ans)return;
if(MR::test(x))return ckmax(ans,x),void();
LL y=x;while(y==x)y=pr(x,rad(1,x-1));
while(x%y==0)x/=y;solve(x),solve(y);
}
LL work(LL x){return ans=1,solve(x),ans;}
}
signed main(){
for(int T=read();T;--T){
LL x,y;scanf("%lld",&x),y=PR::work(x);
if(y==x)puts("Prime");else printf("%lld\n",y);
}
}```
CF1267E Elections.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double db;
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=105;
int n,m,a[N][N],ans,id;
pair<int,int> b[N][N];
signed main(){
n=read(),m=read(),ans=m+1;
for(int i=1;i<=m;++i)
for(int j=1;j<=n;++j)
a[i][j]=read(),b[j][i].first=a[i][j];
for(int i=1;i<n;++i){
for(int j=1;j<=m;++j)
b[i][j].first=b[i][j].first-b[n][j].first,b[i][j].second=j;
sort(b[i]+1,b[i]+m+1);
// rep(j,1,m)printf("%d%c",b[i][j].second," \n"[j==m]);
int now=m,sum=0;
for(int j=m;j>=1;--j){
sum+=b[i][j].first;
if(sum<0)break;
--now;
}
if(now<ans)id=i,ans=now;
}
printf("%d\n",ans);
for(int j=1;j<=ans;++j)printf("%d ",b[id][j].second);
return 0;
}```
P4426 [HNOI AHOI2018]毒瘤.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
#define mod 998244353
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
vector<int>e1[N],e2[N],e[N];
int n,m,U[20],V[20],num,tr[N],tot,ans;
int fa[N],top[N],son[N],siz[N],dep[N],dfn[N],tmr;
int fir[N][2],dp[N][2],fa2[N],a0[N][2],a1[N][2];
bool vis[N],bok[N];
void dfs1(int u){
vis[u]=1,siz[u]=1;
for(int v:e[u]){
if(vis[v]&&dep[v]>dep[u])U[num]=u,V[num++]=v,bok[u]=bok[v]=1;
else if(!vis[v]){
e1[u].pb(v),dep[v]=dep[u]+1,fa[v]=u,dfs1(v),siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
}
void dfs2(int u,int tp){
fir[u][0]=fir[u][1]=1;
dfn[u]=++tmr,top[u]=tp;
if(son[u]){
dfs2(son[u],tp),bok[u]|=bok[son[u]];
if(!bok[son[u]]){
fir[u][0]=1ll*fir[u][0]*(fir[son[u]][0]+fir[son[u]][1])%mod;
fir[u][1]=1ll*fir[u][1]*fir[son[u]][0]%mod;
}
}
for(int v:e1[u]){
if(v==son[u])continue;
dfs2(v,v),bok[u]|=bok[v];
if(!bok[v]){
fir[u][0]=1ll*fir[u][0]*(fir[v][0]+fir[v][1])%mod;
fir[u][1]=1ll*fir[u][1]*fir[v][0]%mod;
}
}
}
inline int LCA(int x,int y){
while(top[x]!=top[y])dep[top[x]]>dep[top[y]]?x=fa[top[x]]:y=fa[top[y]];
return dep[x]<dep[y]?x:y;
}
inline bool cmp(const int&a,const int&b){return dfn[a]<dfn[b];}
void build(){
static int a[N],top,stk[N],m;
memset(vis,0,sizeof(vis));
for(int i=0;i<num;++i){
if(!vis[U[i]])vis[U[i]]=1,a[++m]=U[i];
if(!vis[V[i]])vis[V[i]]=1,a[++m]=V[i];
}
if(!vis[1])a[++m]=1;
sort(a+1,a+m+1,cmp),stk[top=1]=a[1];
for(int i=1;i<=m;++i)tr[++tot]=a[i];
rep(i,2,m){
int lca=LCA(a[i],stk[top]);tr[++tot]=lca;
while(top>1&&dep[stk[top-1]]>=dep[lca])
e2[stk[top-1]].pb(stk[top]),fa2[stk[top]]=stk[top-1],--top;
if(stk[top]!=lca)e2[lca].pb(stk[top]),fa2[stk[top]]=lca,stk[top]=lca;
stk[++top]=a[i];
}
while(--top)e2[stk[top]].pb(stk[top+1]),fa2[stk[top+1]]=stk[top];
}
void dfs4(int u,int av){
dp[u][0]=dp[u][1]=1;
for(int v:e1[u]){
if(v==av)continue;
dfs4(v,-1);
dp[u][0]=1ll*dp[u][0]*(dp[v][0]+dp[v][1])%mod;
dp[u][1]=1ll*dp[u][1]*dp[v][0]%mod;
}
}
void calc(int u){
int x=u;
a0[u][0]=a1[u][1]=1;
while(fa[x]!=fa2[u]){
dfs4(fa[x],x);
int a10=a1[u][0],a11=a1[u][1],a00=a0[u][0],a01=a0[u][1];
a0[u][0]=1ll*dp[fa[x]][0]*(a00+a10)%mod;
a0[u][1]=1ll*dp[fa[x]][0]*(a01+a11)%mod;
a1[u][0]=1ll*dp[fa[x]][1]*a00%mod;
a1[u][1]=1ll*dp[fa[x]][1]*a01%mod;
x=fa[x];
}
int a10=a1[u][0],a11=a1[u][1],a00=a0[u][0],a01=a0[u][1];
a0[u][0]=(a00+a10)%mod;
a0[u][1]=(a01+a11)%mod;
a1[u][0]=a00;
a1[u][1]=a01;
}
void dfs3(int u){
calc(u);
for(int v:e2[u])dfs3(v);
}
void dfs5(int u){
for(int v:e2[u]){
dfs5(v);
dp[u][0]=1ll*dp[u][0]*(1ll*dp[v][0]*a0[v][0]%mod+1ll*dp[v][1]*a0[v][1]%mod)%mod;
dp[u][1]=1ll*dp[u][1]*(1ll*dp[v][0]*a1[v][0]%mod+1ll*dp[v][1]*a1[v][1]%mod)%mod;
}
}
signed main(){
n=read(),m=read();
rep(i,1,m){
int x=read(),y=read();
e[x].pb(y),e[y].pb(x);
}
dfs1(1),dfs2(1,1),build();
dfs3(1);
for(int msk=0;msk<1<<num;++msk){
for(int i=1;i<=tot;++i)
dp[tr[i]][0]=fir[tr[i]][0],dp[tr[i]][1]=fir[tr[i]][1];
for(int i=0;i<num;++i)
if(msk>>i&1)dp[U[i]][1]=0,dp[V[i]][0]=0;
else dp[V[i]][1]=0;
dfs5(1),fmod(ans+=dp[1][0]),fmod(ans+=dp[1][1]);
}
cout<<ans<<'\n';
}```
CF77C Beavermuncher-0xFF.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
int n,rt,k[N];
LL ans,dp[N];
std::vector<int>e[N];
int dfs(int u,int ft){
LL lef=0;
std::vector<LL>v;
for(int t:e[u])if(t!=ft)
lef+=dfs(t,u),v.pb(dp[t]);
std::sort(v.begin(),v.end()),std::reverse(v.begin(),v.end());
if(u!=rt)--k[u];
for(LL i:v)if(k[u])--k[u],dp[u]+=i+2;else break;
dp[u]+=std::min((LL)k[u],lef)*2,k[u]-=std::min((LL)k[u],lef);
return k[u];
}
signed main(){
n=read();
for(int i=1;i<=n;++i)k[i]=read();
for(int i=1;i<n;++i){
int x=read(),y=read();
e[x].pb(y),e[y].pb(x);
}
dfs(rt=read(),0);
printf("%lld\n",dp[rt]);
return 0;
}```
CF1296A Array with Odd Sum.cpp
```#include<bits/stdc++.h>
using namespace std;
const int N=2005;
int T,n,a[N],sum;
int main()
{
scanf("%d",&T);
while(T--)
{
bool f[2];
sum=f[0]=f[1]=0;
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
f[a[i]%2]=true;
sum+=a[i];
}
if(sum%2)puts("YES");
else if(f[0]&&f[1])puts("YES");
else puts("NO");
}
return 0;
} ```
P7109 滴水不漏.cpp
```//Orz cyn2006
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=1005;
int n,s[N],it=1;
int ask(int x,int y){printf("? %d %d\n",x,y),fflush(stdout);return read();}
void solve(int x){
while(it<x)if(ask(it++,x)){--it;break;}
int l=1,r=it,res=0;
while(l<=r){
int mid=(l+r)>>1;
if(ask(it,mid))l=mid+1,res=mid;
else r=mid-1;
ask(mid,it);
}
s[x]=res;
rep(i,it+1,x)s[x]+=i;
// cerr<<it<<' '<<x<<' '<<s[x]<<'\n';
}
signed main(){
n=read();
s[1]=ask(1,1);
for(int i=2;i<=n;++i)solve(i);
printf("!");rep(i,1,n)printf(" %d",s[i]-s[i-1]);puts(""),fflush(stdout);
}```
CF1439C Greedy Shopping.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N = 200005;
const int T = N << 2;
int n, m, a[N], ans;
LL y;
int miv[T], tag[T];
LL sum[T];
#define lc (p << 1)
#define rc (p << 1 | 1)
inline void pushup(int p) {
miv[p] = min(miv[lc], miv[rc]);
sum[p] = sum[lc] + sum[rc];
}
void build(int l = 1, int r = n, int p = 1) {
if(l == r) {
sum[p] = miv[p] = a[l];
return;
}
int mid = (l + r) >> 1;
build(l, mid, lc), build(mid + 1, r, rc);
pushup(p);
}
inline void pushdown(int p, int l, int r) {
if(tag[p]) {
int mid = (l + r) >> 1;
tag[lc] = tag[p], sum[lc] = 1ll * (mid - l + 1) * tag[p], miv[lc] = tag[p];
tag[rc] = tag[p], sum[rc] = 1ll * (r - mid) * tag[p], miv[rc] = tag[p];
tag[p] = 0;
}
}
int solve1(int d, int l = 1, int r = n, int p = 1) {
if(l == r) return l;
int mid = (l + r) >> 1;
pushdown(p, l, r);
if(d >= miv[lc]) return solve1(d, l, mid, lc);
else return solve1(d, mid + 1, r, rc);
}
void cov(int ql, int qr, int d, int l = 1, int r = n, int p = 1) {
if(ql > qr) return;
if(ql <= l && r <= qr) {
miv[p] = d, sum[p] = 1ll * d * (r - l + 1), tag[p] = d;
return;
}
pushdown(p, l, r);
int mid = (l + r) >> 1;
if(ql <= mid) cov(ql, qr, d, l, mid, lc);
if(mid < qr) cov(ql, qr, d, mid + 1, r, rc);
pushup(p);
}
inline LL query_sum(int ql, int qr, int l = 1, int r = n, int p = 1) {
if(ql > qr) return 0;
if(ql <= l && r <= qr) return sum[p];
pushdown(p, l, r);
int mid = (l + r) >> 1; LL res = 0;
if(ql <= mid) res += query_sum(ql, qr, l, mid, lc);
if(mid < qr) res += query_sum(ql, qr, mid + 1, r, rc);
return res;
}
inline void solve(int l = 1, int r = n, int p = 1) {
if(sum[p] <= y)return y -= sum[p], ans += r - l + 1, void();
if(l == r) return;
pushdown(p, l, r);
if(miv[p] <= y) {
int mid = (l + r) >> 1;
if(miv[lc] <= y) solve(l, mid, lc);
if(miv[rc] <= y) solve(mid + 1, r, rc);
}
}
signed main() {
n = read(), m = read();
rep(i, 1, n) a[i] = read();
build();
while(m--) {
int opt = read(), x = read(); y = read();
if(opt == 1) cov(solve1(y), x, y);
else y += query_sum(1, x - 1), ans = 0,
solve(), printf("%d\n", ans - x + 1);
}
return 0;
}```
P6098 [USACO19FEB]Cow Land G.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int n,q,v[N];
struct edge {
int to,nxt;
}e[N<<1];
int head[N],num_edge;
int top[N],fa[N],dfn[N],timer,dep[N],siz[N],son[N];
namespace BIT {
int tr[N];
#define lt(i) (i&(-i))
void add(int x,int d) {for(int i=x;i<=n;i+=lt(i))tr[i]^=d;}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=lt(i))res^=tr[i];
return res;
}
int ask(int l,int r) {
return ask(r)^ask(l-1);
}
}
void addedge(int from,int to) {
++num_edge;
e[num_edge].nxt=head[from];
e[num_edge].to=to;
head[from]=num_edge;
}
void dfs1(int u,int ft) {
siz[u]=1;
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==ft)continue;
dep[v]=dep[u]+1;
fa[v]=u;
dfs1(v,u);
siz[u]+=siz[v];
if(siz[v]>siz[son[u]])son[u]=v;
}
}
void dfs2(int u,int tp) {
top[u]=tp;
dfn[u]=++timer;
if(son[u])dfs2(son[u],tp);
for(int i=head[u];i;i=e[i].nxt) {
int v=e[i].to;
if(v==fa[u]||v==son[u])continue;
dfs2(v,v);
}
}
int query(int x,int y) {
int res=0;
while(top[x]!=top[y]) {
if(dep[top[x]]<dep[top[y]])x^=y^=x^=y;
res^=BIT::ask(dfn[top[x]],dfn[x]),x=fa[top[x]];
}
if(dfn[x]>dfn[y])x^=y^=x^=y;
res^=BIT::ask(dfn[x],dfn[y]);
return res;
}
signed main() {
n=rd(),q=rd();
for(int i=1;i<=n;++i)v[i]=rd();
for(int i=1,x,y;i<n;++i)
x=rd(),y=rd(),addedge(x,y),addedge(y,x);
dep[1]=1,dfs1(1,0),dfs2(1,1);
for(int i=1;i<=n;++i)BIT::add(dfn[i],v[i]);
while(q--) {
int opt=rd(),x=rd(),y=rd();
if(opt==1)BIT::add(dfn[x],y^v[x]),v[x]=y;
else printf("%d\n",query(x,y));
}
return 0;
}```
CF321E Ciel and Gondolas.cpp
```#include<bits/stdc++.h>
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
typedef long long LL;
const int N=4005;
const LL inf=1e11;
int n,k,s[N][N],a[N][N],g[N];
LL f[N],ANS,ans;
int check(int m){
for(int i=1;i<=n;++i){
f[i]=inf;
for(int j=0;j<i;++j){
LL pre=f[j]+s[j+1][i]+m;
// std::cerr<<j<<' '<<pre<<' '<<f[j]<<' '<<g[j]<<'\n';
if(pre<f[i])f[i]=pre,g[i]=g[j]+1;
else if(pre==f[i]&&g[j]+1<g[i])g[i]=g[j]+1;
}
// std::cerr<<i<<' '<<f[i]<<' '<<g[i]<<'\n';
}
return ANS=f[n],g[n];
}
signed main(){
n=read(),k=read();
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
a[i][j]=read()+a[i][j-1];
// for(int i=1;i<=n;++i){
// for(int j=1;j<=n;++j)std::cerr<<a[i][j]<<' ';
// std::cerr<<'\n';
// }
// puts("---------------");
for(int i=1;i<=n;++i)
for(int j=i;j<=n;++j)
s[i][j]=s[i][j-1]+a[j][j]-a[j][i-1];
// for(int i=1;i<=n;++i){
// for(int j=1;j<=n;++j)std::cerr<<s[i][j]<<' ';
// std::cerr<<'\n';
// }
// puts("---------------");
// for(int i=1;i<=n;++i)std::cerr<<f[i]<<' ';std::cerr<<'\n';
// for(int i=1;i<=n;++i)std::cerr<<g[i]<<' ';std::cerr<<'\n';
int l=0,r=s[1][n];
while(l<=r){
int mid=(l+r)>>1,m=check(mid);
// std::cerr<<mid<<' '<<m<<' '<<ANS<<'\n';
if(m<=k)ans=ANS-1ll*k*mid,r=mid-1;
else l=mid+1;
}
printf("%lld\n",ans);
return 0;
}```
P4999 烦人的数学作业.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define fyyAKNOI return 0;
//Start----------------------------------------------------------------------------
const int lqx=1000000007;
int T;
LL l,r;
int num[20],tot;
int dp[20][200];
int dfs(int pos,int limit,int val) {
if(!pos)return val;
if(!limit&&~dp[pos][val])return dp[pos][val];
int up=limit?num[pos]:9,res=0;
for(int i=0;i<=up;++i)
res=(res+dfs(pos-1,limit&&i==up,val+i))%lqx;
if(!limit)dp[pos][val]=res;
return res;
}
int solve(LL x) {
tot=0;
while(x)num[++tot]=x%10,x/=10;
return dfs(tot,1,0);
}
void Main() {
cin>>l>>r;
cout<<(solve(r)-solve(l-1)+lqx)%lqx<<endl;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>T;
memset(dp,-1,sizeof(dp));
while(T-->0)Main();
fyyAKNOI
}```
CF1136E Nastya Hasn't Written a Legend.cpp
```#pragma GCC optimize("Ofast","-funroll-loops","-fdelete-null-pointer-checks")
#pragma GCC target("ssse3","sse3","sse2","sse","avx2","avx")
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
#define N 100009
const int inf=1e18;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline int rdc() {
char ch=getchar();
while(ch!='+'&&ch!='s')ch=getchar();
return ch=='s';
}
int a[N],k[N],s[N],v[N],n,ss[N];
int val[N<<2],tag[N<<2],miv[N<<2];
#define lc (p<<1)
#define rc (p<<1|1)
void pushup(int p) {
val[p]=val[lc]+val[rc],miv[p]=std::min(miv[lc],miv[rc]);
}
void build(int l,int r,int p) {
tag[p]=inf;
if(l==r)return val[p]=miv[p]=v[l],void();
int mid=(l+r)>>1;
build(l,mid,lc),build(mid+1,r,rc);
pushup(p);
}
void pushdown(int p,int l,int r) {
if(tag[p]==inf)return;
int mid=(l+r)>>1;
tag[lc]=tag[rc]=tag[p];
miv[lc]=miv[rc]=tag[p];
val[lc]=tag[p]*(mid-l+1);
val[rc]=tag[p]*(r-mid);
tag[p]=inf;
}
int query(int ql,int qr,int l,int r,int p) {
if(ql<=l&&r<=qr)return val[p];
pushdown(p,l,r);
int mid=(l+r)>>1,res=0;
if(ql<=mid)res+=query(ql,qr,l,mid,lc);
if(mid<qr)res+=query(ql,qr,mid+1,r,rc);
return res;
}
void update(int ql,int qr,int l,int r,int p,int k) {
if(ql<=l&&r<=qr) {
tag[p]=miv[p]=k,val[p]=k*(r-l+1);return;
}
pushdown(p,l,r);
int mid=(l+r)>>1;
if(ql<=mid)update(ql,qr,l,mid,lc,k);
if(mid<qr)update(ql,qr,mid+1,r,rc,k);
pushup(p);
}
int ask(int v,int l,int r,int p) {
if(l==r)return l;
pushdown(p,l,r);
int mid=(l+r)>>1;
if(miv[rc]<=v)return ask(v,mid+1,r,rc);
else return ask(v,l,mid,lc);
}
signed main() {
n=rd();
for(int i=1;i<=n;++i)a[i]=rd();
for(int i=2;i<=n;++i)k[i]=rd(),s[i]=s[i-1]+k[i],ss[i]=ss[i-1]+s[i];
for(int i=1;i<=n;++i)v[i]=a[i]-s[i];
build(1,n,1);
for(int q=rd();q;--q) {
int opt=rdc(),x=rd(),y=rd();
if(opt)printf("%lld\n",query(x,y,1,n,1)+ss[y]-ss[x-1]);
else {
int now=query(x,x,1,n,1);
update(x,ask(now+y,1,n,1),1,n,1,now+y);
}
}
return 0;
}
//zky txdy!```
CF616E Sum of Remainders.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
#define int long long
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 1000000007
const int iv2=(mod+1)>>1;
int n,m,ans;
inline int calc(int l,int r){
return 1ll*((l+r)%mod)*((r-l+1)%mod)%mod*iv2%mod;
}
signed main(){
cin>>n>>m;
ans=1ll*(n%mod)*(min(n,m)%mod)%mod;
for(int l=1,r;l<=min(n,m);l=r+1){
r=min(m,n/(n/l)),ans=(ans-1ll*calc(l,r)*((n/l)%mod)%mod+mod)%mod;
}
if(n<m){
ans=(ans+1ll*((m-n)%mod)*(n%mod)%mod+mod)%mod;
}
cout<<ans<<'\n';
}```
CF1096F Inversion Expectation.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int read() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200005;
const int mod=998244353;
int n,a[N],tr[N],m,ans,cnt[N];
void add(int x,int d){
for(int i=x;i<=n;i+=i&-i)tr[i]+=d;
}
int ask(int x){
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
void fmod(int&x){
x+=x>>31&mod,x-=mod,x+=x>>31&mod;
}
int qpow(int x,int y,int ret=1){
for(;y;y>>=1,x=1ll*x*x%mod) if(y&1)
ret=1ll*ret*x%mod; return ret;
}
signed main(){
n=read();
for(int i=1;i<=n;++i)a[i]=read(),m+=!~a[i];
ans=1ll*m*(m-1)/2%mod*((mod+1)>>1)%mod;
for(int i=n;i>=1;--i)if(~a[i])fmod(ans+=ask(a[i])),add(a[i],1),++cnt[a[i]];
for(int i=1;i<=n;++i)cnt[i]+=cnt[i-1];
int sum=0;
for(int i=1,t=0;i<=n;++i)
if(~a[i])fmod(sum+=1ll*t*(m-a[i]+cnt[a[i]])%mod);
else ++t;
for(int i=n,t=0;i>=1;--i)
if(~a[i])fmod(sum+=1ll*t*(a[i]-cnt[a[i]])%mod);
else ++t;
fmod(ans+=1ll*sum*qpow(m,mod-2)%mod);
std::cout<<ans<<'\n';
return 0;
}
/*
10
-1 2 -1 4 5 -1 10 -1 9 -1
199648886
*/```
CF17E Palisection.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 51123987
const int N=2000005;
vector<int>tr[N];
int n,len[N],fail[N],tot,las,num[N];
char str[N];
LL ans,pre[N],suf[N];
inline int gfail(int x,int i){
while(i-len[x]-1<0||str[i-len[x]-1]!=str[i])x=fail[x];
return x;
}
inline int fnd(int u,int c){
for(int i:tr[u])if(i/N==c)return i%N;
return 0;
}
signed main(){
scanf("%d%s",&n,str);
LL sum;
sum=0;
len[0]=0,len[1]=-1,fail[0]=1,fail[1]=0,las=0,tot=1;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=gfail(las,i);
if(!fnd(f,c)){
fail[++tot]=fnd(gfail(fail[f],i),c);
tr[f].pb(c*N+tot),len[tot]=len[f]+2,num[tot]=num[fail[tot]]+1;
}
las=fnd(f,c),sum=(sum+num[las])%mod,pre[i]=num[las];
}
ans=sum*(sum-1)/2%mod;
reverse(str,str+n);
memset(fail,0,sizeof(fail));
memset(num,0,sizeof(num));
memset(len,0,sizeof(len));
for(int i=0;i<n;++i)tr[i].clear();
sum=0;
len[0]=0,len[1]=-1,fail[0]=1,fail[1]=0,las=0,tot=1;
for(int i=0;i<n;++i){
int c=str[i]-'a',f=gfail(las,i);
if(!fnd(f,c)){
fail[++tot]=fnd(gfail(fail[f],i),c);
tr[f].pb(c*N+tot),len[tot]=len[f]+2,num[tot]=num[fail[tot]]+1;
}
las=fnd(f,c),sum=(sum+num[las])%mod,suf[n-i-1]=sum;
}
// for(int i=0;i<n;++i)cout<<pre[i]<<' ';cout<<'\n';
// for(int i=0;i<n;++i)cout<<suf[i]<<' ';cout<<'\n';
for(int i=0;i<n-1;++i)ans=(ans-pre[i]*suf[i+1]%mod+mod)%mod;
cout<<ans<<'\n';
}```
CF848C Goodbye Souvenir.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100009;
int n,m,o,a[N],pre[N],suf[N],numq,tr[N];
LL ans[N];
set<int>s[N];
struct node {
int opt,x,y,v,id;
inline bool operator < (const node&rhs)const{return x<rhs.x;}
}p[N*7],q[N*7];
#define IT set<int>::iterator
int suf_(int v,int x){
return *s[v].upper_bound(x);
}
int pre_(int v,int x){
IT it=s[v].lower_bound(x);--it;return *it;
}
void link(int x,int y) {
++o,p[o].opt=0,p[o].x=x,p[o].y=pre[x],p[o].v=pre[x]-x,p[o].id=0;
pre[x]=y;
++o,p[o].opt=0,p[o].x=x,p[o].y=pre[x],p[o].v=x-pre[x],p[o].id=0;
}
void add(int x,int d) {
if(!x)return;
for(int i=x;i<=n;i+=i&-i)tr[i]+=d;
}
int ask(int x) {
int res=0;
for(int i=x;i>0;i-=i&-i)res+=tr[i];
return res;
}
void clear(int x) {
if(!x)return;
for(int i=x;i<=n;i+=i&-i)tr[i]=0;
}
void cdq(int l,int r) {
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid),cdq(mid+1,r);
for(int i=mid+1,j=l;i<=r;++i) {
if(!p[i].opt)continue;
for(;j<=mid&&p[j].x<=p[i].x;++j)
if(!p[j].opt)add(p[j].y,p[j].v);
ans[p[i].id]+=ask(n)-ask(p[i].y-1);
}
for(int i=l;i<=mid;++i)if(!p[i].opt)clear(p[i].y);
merge(p+l,p+mid+1,p+mid+1,p+r+1,q+l);
for(int i=l;i<=r;++i)p[i]=q[i];
}
signed main() {
n=rd(),m=rd();
for(int i=1;i<=n;++i)a[i]=rd(),s[a[i]].insert(i);
for(int i=1;i<=n;++i)s[i].insert(0),s[i].insert(n+1);
for(int i=1;i<=n;++i)
pre[i]=pre_(a[i],i),suf[i]=suf_(a[i],i),
++o,p[o].opt=0,p[o].x=i,p[o].y=pre[i],p[o].v=i-pre[i],p[o].id=0;
for(int i=1;i<=m;++i) {
int opt=rd(),x=rd(),y=rd();
if(opt==2)++o,++numq,p[o].opt=1,p[o].x=y,p[o].y=x,p[o].id=numq;
else {
if(y==a[x])continue;
int P=pre_(y,x),S=suf_(y,x);
s[y].insert(x),s[a[x]].erase(x),a[x]=y;
if(suf[x]!=n+1)link(suf[x],pre[x]);
if(pre[x])suf[pre[x]]=suf[x];
if(S!=n+1)link(S,x);
if(P)suf[P]=x;
link(x,P);
suf[x]=S;
}
}
cdq(1,o);
for(int i=1;i<=numq;++i)printf("%lld\n",ans[i]);
return 0;
}
```
P2474 [SCOI2008]天平.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=55;
int n,A,B,f[N][N],g[N][N],ans[3];
char s[N];
signed main() {
n=rd(),A=rd(),B=rd();
for(int i=1;i<=n;++i) {
scanf("%s",s+1);
for(int j=1;j<=n;++j) {
if(i==j)f[i][j]=g[i][j]=0;
else if(s[j]=='+')f[i][j]=1,g[i][j]=2;
else if(s[j]=='-')f[i][j]=-2,g[i][j]=-1;
else if(s[j]=='=')f[i][j]=g[i][j]=0;
else f[i][j]=-2,g[i][j]=2;
}
}
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f[i][j]=max(f[i][j],f[i][k]+f[k][j]),
g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
for(int i=1;i<=n;++i) {
if(i==A||i==B)continue;
for(int j=1;j<=n;++j) {
if(j==A||j==B||i==j)continue;
if(f[A][i]>g[j][B]||f[A][j]>g[i][B])++ans[0];//A+B>i+j,A-i>j-B||A-j>i-B
if((f[A][i]==g[A][i]&&f[j][B]==g[j][B]&&f[A][i]==f[j][B])||
(f[A][j]==g[A][j]&&g[i][B]==f[i][B]&&f[A][j]==f[i][B]))++ans[1];//A+B=i+j,A-i=j-B||A-j=i-B
if(g[A][i]<f[j][B]||g[A][j]<f[i][B])++ans[2];//A+B<i+j,A-i<j-B||A-j<i-B
}
}
printf("%d %d %d\n",ans[0]/2,ans[1]/2,ans[2]/2);
return 0;
}```
CF1178D Prime Graph.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
int n,m;
bool isp(int x) {
for(rint i=2;i*i<=x;++i)
if(x%i==0)return 0;
return 1;
}
signed main() {
n=rd();
for(m=n;;++m)if(isp(m))break;
printf("%d\n",m);
for(rint i=1;i<=n;++i)printf("%d %d\n",i,i%n+1);
for(rint i=1;i<=m-n;++i)printf("%d %d\n",i,(i+n/2-1)%n+1);
return 0;
}```
CF4D Mysterious Present.cpp
```#include<bits/stdc++.h>
using namespace std;
int n,w,v,cnt,dp[5005],pre[5005],fir,ans;
struct node{
int x,y,id;
}a[5005];
bool cmp(node a,node b)
{
if(a.x!=b.x)return a.x<b.x;
return a.y<b.y;
}
void print(int u)
{
if(u==-1)return;
print(pre[u]);
printf("%d ",a[u].id);
}
int main()
{
scanf("%d%d%d",&n,&w,&v);
for(int i=1;i<=n;i++)
{
int wi,vi;
scanf("%d%d",&wi,&vi);
if(wi>w&&vi>v)
{
a[++cnt].x=wi;
a[cnt].y=vi;
a[cnt].id=i;
}
}
if(!cnt){puts("0");return 0;}
sort(a+1,a+cnt+1,cmp);
for(int i=1;i<=n;i++)
dp[i]=1,pre[i]=-1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<i;j++)
{
if(a[i].x>a[j].x&&a[i].y>a[j].y&&dp[i]<dp[j]+1)
{
pre[i]=j;
dp[i]=dp[j]+1;
}
}
if(dp[i]>ans)
{
ans=dp[i];
fir=i;
}
}
printf("%d\n",ans);
print(fir);
return 0;
}```
T158449 【DSOI 2021】侦察.cpp
```#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
const int N=100005;
int n,num[N],m,a[N],mi[N],F[N],flg=1,ans,sum[N];
vector<pair<int,int> >e[N];
multiset<int>vc[N];
inline int anc(int x){return x==F[x]?x:F[x]=anc(F[x]);}
void merge(int x,int y,int lim){
static vector<int>tmp;
x=anc(x),y=anc(y);
if(sz(vc[x])<sz(vc[y]))x^=y^=x^=y;
F[y]=x;
// cerr<<"merge:"<<x<<' '<<y<<' '<<lim<<'\n';
// for(int i:vc[x])cerr<<i<<' ';cerr<<'\n';
// for(int i:vc[y])cerr<<i<<' ';cerr<<'\n';
for(int i:vc[y])vc[x].insert(i);
while(sz(vc[x])>lim)vc[x].erase(vc[x].begin());
// for(int i:vc[x])cerr<<i<<' ';cerr<<'\n';
}
void dfs1(int u,int ft){
if(sz(e[u])>1&&a[u])num[u]=1,sum[u]=sz(e[u])-1;
for(pair<int,int>i:e[u]){
int w=i.fi,v=i.se;
if(v==ft)continue;
a[v]|=a[u],mi[v]=min(w,mi[u]);
dfs1(v,u);
num[u]+=num[v],sum[u]+=sum[v];
}
// cerr<<u<<' '<<mi[u]<<' '<<num[u]<<' '<<sum[u]<<'\n';
if(num[u]>mi[u])flg=0;
}
void dfs2(int u,int ft){
if(u!=1&&sz(e[u])==1)return;
if(u!=1&&a[u])vc[u].insert(sz(e[u])-1);
for(pair<int,int>i:e[u]){
int w=i.fi,v=i.se;
if(v==ft)continue;
dfs2(v,u);
if(u!=1){
merge(u,v,mi[u]);
}else{
for(int j:vc[anc(v)])ans-=j;
}
}
// cerr<<u<<":";for(int i:vc[u])cerr<<i<<' ';cerr<<'\n';
}
signed main(){
n=read(),m=read();
rep(i,1,n)F[i]=i;
rep(i,2,n){
int x=read(),y=read(),z=read();
e[x].pb(mkp(z,y)),e[y].pb(mkp(z,x));
}
rep(i,1,m)a[read()]=1;
mi[1]=n-1;
dfs1(1,0);
// rep(i,1,n)cerr<<mi[i]<<' ';cerr<<'\n';
if(flg)return cout<<"Yes\n"<<num[1]<<'\n',0;
ans=sum[1];
dfs2(1,0);
cout<<"No\n"<<ans<<'\n';
}
/*
14 2
1 2 1
2 3 1
2 6 1
3 4 1
3 5 1
1 7 1
7 8 1
7 9 1
8 10 1
8 11 1
9 12 1
9 13 1
3 14 1
2 8
*/
```
CF1292A NEKO's Maze Game.cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rint register int
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=100010;
int ans,f[2][N],q,n;
signed main() {
n=rd(),q=rd();
while(q--) {
int x=rd()-1,y=rd();
if(f[x][y]) {
ans-=f[!x][y+1]+f[!x][y-1]+f[!x][y];
} else {
ans+=f[!x][y+1]+f[!x][y-1]+f[!x][y];
}
f[x][y]^=1;
puts(ans?"No":"Yes");
f[0][0]=0;
f[1][0]=0;
f[0][n+1]=0;
f[1][n+1]=0;
}
return 0;
}```
P4135 作诗.cpp
```#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
#define rint register int
#define pb push_back
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2) EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=1e5+10;
const int M=320;
int n,c,m,a[N],bel[N],L[N],R[N],cnt[M][N],val[M][M],num,size,tmp[N],lastans;
void init() {
size=sqrt(n),num=(n-1)/size+1;
for(rint i=1;i<=num;++i)L[i]=(i-1)*size+1,R[i]=i*size;R[num]=n;
for(rint i=1;i<=num;++i)
for(rint j=L[i];j<=R[i];++j)
bel[j]=i;
for(rint i=1;i<=num;++i) {
int now=0;
for(rint j=L[i];j<=n;++j) {
++cnt[i][a[j]];
if(cnt[i][a[j]]>1&&(cnt[i][a[j]]&1))--now;
else if(!(cnt[i][a[j]]&1))++now;
if(R[bel[j]]==j)val[i][bel[j]]=now;
}
}
}
int brute(int l,int r) {
int res=0;
for(rint i=l;i<=r;++i) {
++tmp[a[i]];
if(tmp[a[i]]>1&&(tmp[a[i]]&1))--res;
else if(!(tmp[a[i]]&1))++res;
}
for(rint i=l;i<=r;++i)--tmp[a[i]];
return res;
}
#define app(x,y,z) (cnt[x][z]-cnt[y+1][z])
int query(int l,int r) {
if(bel[r]-bel[l]<2)return brute(l,r);
int res=val[bel[l]+1][bel[r]-1];
for(rint i=l;i<=R[bel[l]];++i) {
++tmp[a[i]];
int fyy=tmp[a[i]]+app(bel[l]+1,bel[r]-1,a[i]);
if(fyy>1&&(fyy&1))--res;
else if(!(fyy&1))++res;
}
for(rint i=L[bel[r]];i<=r;++i) {
++tmp[a[i]];
int fyy=tmp[a[i]]+app(bel[l]+1,bel[r]-1,a[i]);
if(fyy>1&&(fyy&1))--res;
else if(!(fyy&1))++res;
}
for(rint i=l;i<=R[bel[l]];++i)--tmp[a[i]];
for(rint i=L[bel[r]];i<=r;++i)--tmp[a[i]];
return res;
}
signed main() {
n=rd(),c=rd(),m=rd();
for(rint i=1;i<=n;++i)a[i]=rd();
init();
while(m--) {
int l=(rd()+lastans)%n+1,r=(rd()+lastans)%n+1;
if(l>r)l^=r^=l^=r;
printf("%d\n",lastans=query(l,r));
}
return 0;
}
```
CF514D R2D2 and Droid Army.cpp
```#include<bits/stdc++.h>
typedef long long LL;
typedef double db;
#define x first
#define y second
#define sz(v) (int)v.size()
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
inline int read(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)){if(c=='-')f=0;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f?x:-x;
}
const int N=100005;
int n,m,k,ans,idl,idr;
int lg[N],pw[30];
struct ST_TABLE{
int ST[20][N];
void init(){
for(int i=1;i<=lg[n];++i)
for(int j=1;j+pw[i]-1<=n;++j)
ST[i][j]=std::max(ST[i-1][j],ST[i-1][j+pw[i-1]]);
}
int ask(int l,int r){int t=lg[r-l+1];return std::max(ST[t][l],ST[t][r-pw[t]+1]);}
}ST[5];
void init(){
pw[0]=1,lg[0]=-1;
for(int i=1;i<=n;++i)lg[i]=lg[i>>1]+1;
for(int i=1;i<=25;++i)pw[i]=pw[i-1]<<1;
}
int ask(int l,int r){
int res=0;
for(int i=0;i<m;++i)res+=ST[i].ask(l,r);
return res;
}
signed main(){
n=read(),m=read(),k=read(),init();
for(int i=1;i<=n;++i)
for(int j=0;j<m;++j)ST[j].ST[0][i]=read();
for(int i=0;i<m;++i)ST[i].init();
for(int i=1;i<=n;++i){
int l=1,r=i,res=n+1919810;
while(l<=r){
int mid=(l+r)>>1;
if(ask(mid,i)<=k)res=mid,r=mid-1;
else l=mid+1;
}
if(i-res+1>ans)ans=i-res+1,idl=res,idr=i;
}
if(!ans)for(int i=0;i<m;++i)printf("0 ");
else for(int i=0;i<m;++i)printf("%d ",ST[i].ask(idl,idr));
return 0;
}```
CF780C Andryusha and Colored Balloons.cpp
```#include<bits/stdc++.h>
using namespace std;
#define rint register int
typedef long long LL;
const int inf=1000000007;
inline int rd(){
int x=0,f=1;
char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
vector<int>g[N];
int n,deg[N],ans,col[N];
void dfs(int u,int ft) {
int tmp=0;
for(rint i=0;i<g[u].size();++i) {
int v=g[u][i];
if(v==ft)continue;
++tmp;
while(tmp==col[ft]||tmp==col[u])++tmp;
col[v]=tmp;
dfs(v,u);
}
}
signed main() {
n=rd();
for(rint i=1,x,y;i<n;++i) {
x=rd(),y=rd();
g[x].push_back(y);
g[y].push_back(x);
++deg[y],++deg[x];
}
for(rint i=1;i<=n;++i)ans=max(ans,deg[i]);
col[1]=1;dfs(1,0);
printf("%d\n",ans+1);
for(rint i=1;i<=n;++i)printf("%d ",col[i]);
return 0;
}```
CF958F3 Lightsabers (hard).cpp
```#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int uint;
typedef double db;
typedef unsigned long long ull;
#define pb(x) push_back(x)
#define mkp(x,y) make_pair(x,y)
#define int long long
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1=buf,*p2=buf;
inline int rd() {
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+(ch^48),ch=getchar();
return x*f;
}
const int N=200010;
const int L=400010;
const db pi=acos(-1.0);
const int mod=1009;
int n,m,k,a[N],cnt;
struct node {
vector<int>a;int n;
bool operator < (const node &rhs)const{return n>rhs.n;}
};
priority_queue<node>q;
node make(int len) {
node res;
res.n=len,res.a.resize(len+5);
for(int i=0;i<=len;++i)res.a[i]=1;
return res;
}
int lim,lg,rev[L];
void init(int len){
for(lim=1,lg=0;lim<=len;lim<<=1,++lg);
for(int i=0;i<lim;++i)rev[i]=(rev[i>>1]>>1)|((i&1)<<(lg-1));
}
struct cp {
db x,y;
cp(){x=y=0;}
cp(db x_,db y_){x=x_,y=y_;}
cp operator + (const cp &rhs){return cp(x+rhs.x,y+rhs.y);}
cp operator - (const cp &rhs){return cp(x-rhs.x,y-rhs.y);}
cp operator * (const cp &rhs){return cp(x*rhs.x-y*rhs.y,x*rhs.y+y*rhs.x);}
}A[L],B[L];
void FFT(cp*a,int o) {
for(int i=0;i<lim;++i)
if(i>rev[i])swap(a[i],a[rev[i]]);
for(int i=1;i<lim;i<<=1) {
cp wn=cp(cos(pi/i),o*sin(pi/i));
for(int j=0;j<lim;j+=(i<<1)) {
cp w0=cp(1,0);
for(int k=0;k<i;++k,w0=w0*wn) {
cp X=a[j+k],Y=w0*a[i+j+k];
a[j+k]=X+Y,a[i+j+k]=X-Y;
}
}
}
if(~o)return;
for(int i=0;i<lim;++i)a[i].x=(LL)(a[i].x/lim+0.5)%mod;
}
node merge(const node &a,const node &b) {
int n=a.n,m=b.n;init(n+m);
for(int i=0;i<=n;++i)A[i]=cp(a.a[i],0);for(int i=n+1;i<lim;++i)A[i]=cp(0,0);
for(int i=0;i<=m;++i)B[i]=cp(b.a[i],0);for(int i=m+1;i<lim;++i)B[i]=cp(0,0);
FFT(A,1),FFT(B,1);
for(int i=0;i<lim;++i)A[i]=A[i]*B[i];
FFT(A,-1);
node res;res.n=min(n+m,k),res.a.resize(res.n+5);
for(int i=0;i<=res.n;++i)res.a[i]=A[i].x;
return res;
}
signed main() {
n=rd(),m=rd(),k=rd();
for(int i=1;i<=n;++i)++a[rd()];
for(int i=1;i<=m;++i)if(a[i])q.push(make(a[i])),++cnt;
for(;cnt>1;--cnt) {
node t1=q.top();q.pop();
node t2=q.top();q.pop();
q.push(merge(t1,t2));
}
node ans=q.top();
printf("%lld\n",ans.a[k]);
return 0;
}```
|
zzerii/zzerii
|
zzerii/zzerii
README.md
```### Hi there 👋😎
<h3 align="center">🛠Introduce🛠</h3>
<p align="center">To infinity Cloud… and beyond!</p>
<p align="center">
<img src="https://github.com/zzerii/zzerii/assets/61822411/3339839b-0efb-45ee-931d-7f79f0a5f340"/>
</p>    
<!---->
<!--(https://github.com/anuraghazra/github-readme-stats)-->
<!--[](https://github.com/anuraghazra/github-readme-stats)-->
<!--<img src="https://img.shields.io/badge/Linux-FCC624?style=flat-square&logo=Python&logoColor=white"/> 
<img src="https://img.shields.io/badge/Python-3776AB?style=flat-square&logo=Python&logoColor=white"/> 
<img src="https://img.shields.io/badge/Shell-FFD500?style=flat-square&logo=Python&logoColor=white"/> 
<img src="https://img.shields.io/badge/Amazon AWS-232F3E?style=flat-square&logo=AWS&logoColor=white"/> 
<img src="https://img.shields.io/badge/Amazon EKS-FF9900?style=flat-square&logo=AWS&logoColor=white"/> 
<img src="https://img.shields.io/badge/Docker-2496ED?style=flat-square&logo=Docker&logoColor=white"/> 
<img src="https://img.shields.io/badge/Kubernetes-326CE5?style=flat-square&logo=Kubernetes&logoColor=white"/> 
<img src="https://img.shields.io/badge/Helm-0F1689?style=flat-square&logo=Kubernetes&logoColor=white"/> 
<img src="https://img.shields.io/badge/Terraform-7952B3?style=flat-square&logo=Terraform&logoColor=white"/> 
<img src="https://img.shields.io/badge/GitLab-FC6D26?style=flat-square&logo=Terraform&logoColor=white"/> -->
```
|
zzfd97/Battery-Capacity-Tester
|
zzfd97/Battery-Capacity-Tester
MainWindow.xaml.cs
```using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows;
using System.Windows.Controls;
using System.Windows.Data;
using System.Windows.Documents;
using System.Windows.Input;
using System.Windows.Media;
using System.Windows.Media.Imaging;
using System.Windows.Navigation;
using System.Windows.Shapes;
using System.IO.Ports;
using System.Collections.ObjectModel;
using System.Windows.Controls.DataVisualization.Charting;
namespace Battery_Capacity_Tester
{
/// <summary>
/// Interaction logic for MainWindow.xaml
/// </summary>
public partial class MainWindow : Window
{
System.IO.Ports.SerialPort _serialPort;
string currentFile = "";
Boolean fileStarted = false;
Boolean filePaused = false;
Boolean portOpened = false;
DateTime lastReading, startTime;
ObservableCollection<MeasurementObject> pastReadings = new ObservableCollection<MeasurementObject> { };
MeasurementObject latestRecording;
public MainWindow()
{
InitializeComponent();
}
private void btnConnectToReLoad_Click(object sender, RoutedEventArgs e)
{
if (CBPortsSelection.SelectedIndex >= 0)
{
if (((string)btnConnectToReLoad.Content) == "Connect")
{
string portName = (string)CBPortsSelection.Items[CBPortsSelection.SelectedIndex];
_serialPort = new SerialPort(portName, 115200);
_serialPort.DataReceived += _serialPort_DataReceived;
_serialPort.Open();
DateTime start = DateTime.Now;
while (lastReading == null || (DateTime.Now - lastReading).TotalSeconds > 3)
{
if ((DateTime.Now - start).TotalSeconds > 3)
_serialPort.WriteLine("monitor 1000");//send the monitor command
if ((DateTime.Now - start).TotalSeconds > 10)
{
_serialPort.Close();
return;
}
System.Threading.Thread.Sleep(1000);
}
vStopUpDown.IsEnabled = true;
iSetUpDown.IsEnabled = true;
btnStartStopLogging.IsEnabled = true;
btnpause.IsEnabled = true;
btnConnectToReLoad.Content = "Disconnect";
portOpened = true;
}
else
{
_serialPort.DataReceived -= _serialPort_DataReceived;
lock (_serialPort)
{
_serialPort.Close();
_serialPort = null;
}
portOpened = false;
btnConnectToReLoad.Content = "Connect";
}
}
}
void _serialPort_DataReceived(object sender, SerialDataReceivedEventArgs e)
{
//we have recieved data
while (_serialPort.BytesToRead > 0)
{
string rec = _serialPort.ReadLine().Replace("\r", "").Replace("\n", "");
string[] words = rec.Split(' ');
switch (words[0])
{
case "read":
{
lastReading = DateTime.Now;
//file isnt paused, log results
addreading(words);
}
break;
default:
break;
}
}
}
private void addreading(string[] data)
{//process the incoming data
double voltage, current, mah, mwh;
voltage = current = mah = mwh = 0;
current = double.Parse(data[1]);
voltage = double.Parse(data[2]) / 1000;
mah = double.Parse(data[3]) / 1000;
mwh = double.Parse(data[4]) / 1000;
MeasurementObject m = new MeasurementObject(DateTime.Now, startTime, voltage, current, mah, mwh);
//add the entry to the list
latestRecording = m;
if (m.Current != 0 && fileStarted && !filePaused)
{
lock (pastReadings)
{
try
{
Application.Current.Dispatcher.BeginInvoke(new Action(() => addReading(m)));
}
catch { }
// pastReadings.Add(m);
m.Append(currentFile, startTime);
}
//write it out to the save file
}
updateDisplay();
}
private void addReading(MeasurementObject m)
{
lock (pastReadings)
{
if (pastReadings.Count % ((int)this.Width/2) == 0)
{
List<MeasurementObject> oldData = new List<MeasurementObject> { };
oldData.AddRange(pastReadings);
pastReadings.Clear();
for (int i = 0; i < oldData.Count; i += 2)
{
var a = oldData[i];
var b = oldData[i];
if (i != oldData.Count)
b = oldData[i + 1];
MeasurementObject mn = new MeasurementObject(b.CaptureTime, a.startTime, (a.Voltage + b.Voltage) / 2, (a.Current + b.Current) / 2, b.mAh, b.mWh);
pastReadings.Add(mn);
}
}
pastReadings.Add(m);
}
}
private void updateDisplay()
{
if (portOpened)
{
lblCurrentVoltage.Dispatcher.Invoke(new Action(() => lblCurrentVoltage.Content = string.Format("{0} V", latestRecording.Voltage)));
lblCurrentCurrent.Dispatcher.Invoke(new Action(() => lblCurrentCurrent.Content = string.Format("{0} A", latestRecording.Current / 1000)));
lblCurrentCapacity.Dispatcher.Invoke(new Action(() => lblCurrentCapacity.Content = string.Format("{0} mAh", latestRecording.mAh)));
lblCurrentWattHours.Dispatcher.Invoke(new Action(() => lblCurrentWattHours.Content = string.Format("{0} mWh", latestRecording.mWh)));
lblCurrentRuntime.Dispatcher.Invoke(new Action(() => lblCurrentRuntime.Content = string.Format("{0}", ((lastReading - startTime).TotalSeconds / 60))));
}
}
private void Window_Loaded(object sender, RoutedEventArgs e)
{
CBPortsSelection.Items.Clear();
foreach (var port in System.IO.Ports.SerialPort.GetPortNames())
CBPortsSelection.Items.Add(port);
if (CBPortsSelection.Items.Count > 0)
CBPortsSelection.SelectedIndex = 0;
}
private void btnStartStopLogging_Click(object sender, RoutedEventArgs e)
{
if (((string)btnStartStopLogging.Content) == "Start")
{//starting logging
if (txtFileName.Text.Length > 0)
{
if (!System.IO.Directory.Exists("Results"))
System.IO.Directory.CreateDirectory("Results");
if (!System.IO.Directory.Exists("Results\\" + txtFileName.Text + "\\"))
System.IO.Directory.CreateDirectory("Results\\" + txtFileName.Text + "\\");
string fName = "Results\\" + txtFileName.Text + "\\" + iSetUpDown.Value.ToString() + ".csv";
if (System.IO.File.Exists(fName))
{
MessageBoxResult result = MessageBox.Show("Overwrite Existing File?", "Confirmation", MessageBoxButton.YesNo, MessageBoxImage.Question);
if (result == MessageBoxResult.No)
{
return;
}
}
//if we get here then the user is okay to overwrite the file
currentFile = fName;
using (System.IO.StreamWriter sw = new System.IO.StreamWriter(currentFile, false))//no append here
{
sw.WriteLine(String.Format("Recording,{0}", txtFileName.Text));
sw.WriteLine(String.Format("Current Setpoint,{0}", iSetUpDown.Value));
sw.WriteLine(String.Format("Low Voltage Stop,{0}", vStopUpDown.Value));
sw.WriteLine("Seconds, Voltage, Current, mAh, mWh");
}
startTime = DateTime.Now;
_serialPort.WriteLine("set " + iSetUpDown.Value.ToString());
_serialPort.WriteLine("uvlo " + vStopUpDown.Value.ToString());
iSetUpDown.IsEnabled = false;
vStopUpDown.IsEnabled = false;
pastReadings.Clear();
chart.DataContext = pastReadings;
btnStartStopLogging.Content = "Stop";
fileStarted = true; filePaused = false;
}
}
else
{//stopping logging
fileStarted = false; filePaused = false;
_serialPort.WriteLine("set 0");
iSetUpDown.IsEnabled = true;
vStopUpDown.IsEnabled = true;
btnStartStopLogging.Content = "Start";
}
}
private void btnpause_Click(object sender, RoutedEventArgs e)
{
}
/// <summary>
/// used to turn axis on and off
/// </summary>
/// <param name="sender"></param>
/// <param name="e"></param>
private void CheckBox_Click(object sender, RoutedEventArgs e)
{
CheckBox chk = (sender as CheckBox);
LineSeries ls = chart.Series.Cast<LineSeries>().Where(s => s.Title.ToString() == chk.Tag.ToString()).ElementAtOrDefault(0);
if (chk.IsChecked.Value)
chk.Opacity = ls.Opacity = 1;
else
{
chk.Opacity = 0.5;
ls.Opacity = 0;
}
}
}
class MeasurementObject
{
public DateTime startTime;
public double TimeStamp { get { return (CaptureTime - startTime).TotalSeconds; } }
public DateTime CaptureTime { get; set; }
public double Voltage { get; set; }
public double Current { get; set; }
public double mAh { get; set; }
public double mWh { get; set; }
public MeasurementObject(DateTime time, DateTime start, double voltage, double current, double mah, double mwh)
{
startTime = start;
Voltage = voltage;
CaptureTime = time;
Current = current;
mAh = mah;
mWh = mwh;
}
public string toString(DateTime startTime)
{
return String.Format("{0},{1},{2},{3},{4}", (CaptureTime - startTime).TotalSeconds, Voltage, Current, mAh, mWh);
}
public void Append(string fileName, DateTime startTime)
{
using (System.IO.StreamWriter sw = new System.IO.StreamWriter(fileName, true))
{
sw.WriteLine(toString(startTime));
}
}
}
}
```
|
zzhokay/dugujiujian
|
zzhokay/dugujiujian
DugujiujianApp.java
```package com.atguigu.jianfa;
public class DugujiujianApp {
public static void main(String[] args) {
System.out.println("独孤九剑");
}
}
```
|
zzhu41/MP3-Submission
|
zzhu41/MP3-Submission
tasks.js
```var express = require('express'),
router = express.Router(),
task = require('../models/task');
router.get('/', function(req, res){
var query = task.find({});
if (req.query.hasOwnProperty('where')) query = query.find(JSON.parse(req.query.where));
if (req.query.hasOwnProperty('skip')) query = query.skip(JSON.parse(req.query.skip));
if (req.query.hasOwnProperty('limit')) query = query.limit(JSON.parse(req.query.limit));
if (req.query.hasOwnProperty('sort')) query = query.sort(JSON.parse(req.query.sort));
if (req.query.hasOwnProperty('select')) query = query.select(JSON.parse(req.query.select));
if (req.query.hasOwnProperty('count')) query = query.count(JSON.parse(req.query.count));
// var query = task.find(JSON.parse(req.query.where)).limit(req.query.limit).sort(req.query.sort).select(req.query.select).skip(req.query.skip);
query.exec(function(err, tasks) {
if (err) {
res.status(500).send({
massage: 'Server Error',
data: []
});
}else{
res.status(200).send({
message: 'OK',
data: tasks
});
}
});
});
router.post('/', function(req, res){
var taskPost = {
name: req.body.name,
description: req.body.description,
deadline: req.body.deadline,
completed: req.body.completed,
assignedUser: req.body.assignedUser,
assignedUserName: req.body.assignedUserName,
}
task.create(taskPost, function(err, tasks){
if (err){
res.status(500).send({
message: 'Server Error',
data: []
});
}else{//sucess
res.status(201).send({
message: 'OK',
data: tasks
});
}
});
});
router.get('/:id', function(req, res){
var query = task.findById(req.params.id);
if (req.query.hasOwnProperty('where')) query = query.find(JSON.parse(req.query.where));
if (req.query.hasOwnProperty('skip')) query = query.skip(JSON.parse(req.query.skip));
if (req.query.hasOwnProperty('limit')) query = query.limit(JSON.parse(req.query.limit));
if (req.query.hasOwnProperty('sort')) query = query.sort(JSON.parse(req.query.sort));
if (req.query.hasOwnProperty('select')) query = query.select(JSON.parse(req.query.select));
if (req.query.hasOwnProperty('count')) query = query.count(JSON.parse(req.query.count));
query.exec(function(err, tasks) {
// task.findById(req.params.id, function(err, tasks){
if (err){
res.status(404).send({
message: 'Server Error',
data: []
});
}else if (!tasks){
res.status(404).send({
message: "Invalid ID",
data: []
});
}else{
res.status(200).send({
message: 'OK',
data: tasks
});
}
});
});
router.put('/:id', function(req, res){
var taskPost = {
name: req.body.name,
description: (!req.body.description?'':req.body.description),
deadline: req.body.deadline,
completed: (!req.body.completed?false:req.body.completed),
assignedUser: (!req.body.assignedUser?'':req.body.assignedUser),
assignedUserName: (!req.body.assignedUserName?'':req.body.assignedUserName)
}
task.findOneAndUpdate(req.params.id, taskPost,{new : true}, function(err, tasks){
if (err){
res.status(404).send({
message: 'Server Error',
data: []
});
}
else if (!task.length){
res.status(404).send({
message: "Invalid ID",
data: []
});
}
else{
res.status(200).send({
message:'OK',
data: tasks
});
}
});
});
//TODO: Delete
router.delete('/:id', function(req, res){
task.findByIdAndRemove({ _id: req.params.id}, function(err, tasks){
// task.remove({ _id: req.params.id}, function(err, tasks){
if(err){
res.status(404).send({
message: 'Server Error',
data: []
});
}else if (!tasks){
res.status(404).send({
message: "Invalid ID",
data: []
});
}else{
res.status(200).send({
message: 'resource deleted.',
data: []
});
}
});
});
module.exports = router;```
users.js
```var express = require('express'),
router = express.Router(),
user = require('../models/user');
router.get('/', function(req, res){
//check what does query has, at here
// var query = user.find( Object.keys(req.query.where).length === 0 ? JSON.parse(req.query.where):{}).limit(Object.keys(req.query.limit).length === 0?JSON.parse(req.query.limit):{}).sort(Object.keys(req.query.sort).length === 0?JSON.parse(req.query.sort):{}).select(Object.keys(req.query.select).length === 0?JSON.parse(req.query.select):{}).skip(Object.keys(req.query.skip).length === 0?JSON.parse(req.query.skip):{});
var query = user.find({});
if (req.query.hasOwnProperty('where')) query = query.find(JSON.parse(req.query.where));
if (req.query.hasOwnProperty('skip')) query = query.skip(JSON.parse(req.query.skip));
if (req.query.hasOwnProperty('limit')) query = query.limit(JSON.parse(req.query.limit));
if (req.query.hasOwnProperty('sort')) query = query.sort(JSON.parse(req.query.sort));
if (req.query.hasOwnProperty('select')) query = query.select(JSON.parse(req.query.select));
if (req.query.hasOwnProperty('count')) query = query.count(JSON.parse(req.query.count));
query.exec(function(err, users) {
// user.find({}, function(err, users) {
if (err) {
res.status(500).send({
massage: 'Server Error',
data: []
});
}else{
res.status(200).send({
message: 'OK',
data: users
});
}
});
});
router.post('/', function(req, res){
var userPost = {
name: req.body.name,
email: req.body.email,
pendingTasks: req.body.pendingTasks
}
user.find({email: req.body.email}, function(err, users){
if (users.length > 0){
res.status(500).send({
message: 'Duplicate email address',
data: []
});
}else{
user.create(userPost, function(err, users){
if (err){
res.status(500).send({
message: 'Server Error',
data: []
});
}else{//sucess
res.status(201).send({
message: 'OK',
data: users
});
}
});
}
});
});
router.get('/:id', function(req, res){
var query = user.findById(req.params.id);
if (req.query.hasOwnProperty('where')) query = query.find(JSON.parse(req.query.where));
if (req.query.hasOwnProperty('skip')) query = query.skip(JSON.parse(req.query.skip));
if (req.query.hasOwnProperty('limit')) query = query.limit(JSON.parse(req.query.limit));
if (req.query.hasOwnProperty('sort')) query = query.sort(JSON.parse(req.query.sort));
if (req.query.hasOwnProperty('select')) query = query.select(JSON.parse(req.query.select));
if (req.query.hasOwnProperty('count')) query = query.count(JSON.parse(req.query.count));
query.exec(function(err, users) {
// user.findById(req.params.id, function(err, users){
if (err){
res.status(500).send({
message: 'Server Error',
data: []
});
}else if (!users){
res.status(404).send({
message: "Invalid ID",
data: []
});
}else{
res.status(200).send({
message: 'OK',
data: users
});
}
});
});
router.put('/:id', function(req, res){
var userPost = {
name: req.body.name,
email: req.body.email,
pendingTasks: (!req.body.pendingTasks?[]:req.body.pendingTasks)
}
user.findOneAndUpdate(req.params.id, userPost,{new : true}, function(err, users){
if (err){
res.status(500).send({
message: 'Server Error',
data: []
});
}
else if (!user.length){
res.status(404).send({
message: "Invalid ID",
data: []
});
}
else{
res.status(200).send({
message:'OK',
data: users
});
}
});
});
//TODO: Delete
router.delete('/:id', function(req, res){
user.find({ _id: req.params.id},function(err, users){
if(err){
res.status(500).send({
message: 'Server Error',
data: []
});
}else if (!users.length){
res.status(404).send({
message: 'Delete Invalid data',
data: []
});
}else{
user.remove({ _id: req.params.id},function(err){
if(err){
res.status(500).send({
message: 'Server Error',
data: []
});
}else{
res.status(200).send({
message: 'resource deleted.',
data: []
});
}
});
}
});
});
module.exports = router;```
|
zzmzzmgithub/junit-test
|
zzmzzmgithub/junit-test
Testcc.java
```package spring.test;
import javax.annotation.Resource;
import org.junit.Test;
import org.springframework.beans.factory.annotation.Autowired;
import service.HelloJava;
import servise.Helloword;
public class Testcc extends TestCave {
@Resource
private Helloword helloword;
@Autowired
private HelloJava hellojava;
@Test
public void yy() {
helloword.sayHello();
}
@Test
public void aa(){
hellojava.name();
}
}
```
HelloJava.java
```package service;
public interface HelloJava {
public void name();
}
```
Testbb.java
```package servise;
import javax.annotation.Resource;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.springframework.test.context.ContextConfiguration;
import org.springframework.test.context.junit4.AbstractJUnit4SpringContextTests;
import org.springframework.test.context.junit4.SpringJUnit4ClassRunner;
import servise.Helloword;
@RunWith(SpringJUnit4ClassRunner.class)
@ContextConfiguration("/spring/spring-helloword.xml")
public class Testbb extends AbstractJUnit4SpringContextTests {
@Resource
private Helloword helloword;
@Test
public void yy(){
helloword.sayHello();
}
}
```
Testaa.java
```package spring.test;
import javax.annotation.Resource;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.springframework.test.context.ContextConfiguration;
import org.springframework.test.context.junit4.AbstractJUnit4SpringContextTests;
import org.springframework.test.context.junit4.SpringJUnit4ClassRunner;
import servise.Helloword;
@RunWith(SpringJUnit4ClassRunner.class)
@ContextConfiguration("classpath:spring/spring-helloword.xml")
public class Testaa extends AbstractJUnit4SpringContextTests {
@Resource
private Helloword helloword;
@Test
public void yy(){
helloword.sayHello();
}
}
```
TestString.java
```package service;
import org.junit.Test;
public class TestString {
@Test
public void yy() {
String tt = "Linux 上使用Eclipse 管理github";
System.out.println(tt.substring(5, tt.length()));
}
}
```
TsetToString.java
```package servise;
import java.util.ArrayList;
import java.util.List;
import model.Student;
import org.apache.commons.lang3.builder.ToStringBuilder;
import org.apache.commons.lang3.builder.ToStringStyle;
import org.junit.Test;
import common.TestUtil;
public class TsetToString {
@Test
public void tt() {
Student ss = new Student("张三", "081210");
// 对象及其属性一行显示
System.out.println(ToStringBuilder.reflectionToString(ss));
System.out.println(ToStringBuilder.reflectionToString(ss,
ToStringStyle.DEFAULT_STYLE));
// 属性换行显示
System.out.println(ToStringBuilder.reflectionToString(ss,
ToStringStyle.MULTI_LINE_STYLE));
// 不显示属性名，只显示属性值，同一行显示
System.out.println(ToStringBuilder.reflectionToString(ss,
ToStringStyle.NO_FIELD_NAMES_STYLE));
// 对象名称简写
System.out.println(ToStringBuilder.reflectionToString(ss,
ToStringStyle.SHORT_PREFIX_STYLE));
// 只显示属性
System.out.println(ToStringBuilder.reflectionToString(ss,
ToStringStyle.SIMPLE_STYLE));
}
@Test
public void yy(){
Student ss = new Student("张三", "69");
TestUtil.modelToString(ss);
}
@Test
public void ww(){
Student ss = new Student("张三", "69");
Student aa = new Student("张四", "659");
List<Student> sdList = new ArrayList<Student>();
sdList.add(aa);
sdList.add(ss);
TestUtil.ListModelToString(sdList);
}
}
```
TestCave.java
```package spring.test;
import org.junit.runner.RunWith;
import org.springframework.test.context.ContextConfiguration;
import org.springframework.test.context.junit4.SpringJUnit4ClassRunner;
@RunWith(SpringJUnit4ClassRunner.class)
@ContextConfiguration
({
"classpath:spring/spring-helloword.xml",
"classpath:springtestsource/spring-hellojava.xml"
})
public class TestCave {
}
```
HelloWordImpl.java
```package servise;
import java.util.Date;
public class HelloWordImpl implements Helloword {
@Override
public void sayHello() {
System.out.println( new Date ());
}
}
```
README.md
```# junit-test
#原生态的使用git，到用eclipse使用插件
```
TestHello.java
```package servise;
import org.springframework.context.support.ClassPathXmlApplicationContext;
public class TestHello {
private static ClassPathXmlApplicationContext context;
// 加载 spring配置文件
public static void init() {
}
public static void main(String[] args) {
init();
context = new ClassPathXmlApplicationContext("spring/spring-helloword.xml");
context.start();
//HelloWordImpl hell =new HelloWordImpl();
HelloWordImpl hell =(HelloWordImpl)context.getBean("helloword");
hell.sayHello();
}
}
```
HelloJavaImpl.java
```package service;
import org.springframework.beans.factory.annotation.Autowired;
import servise.Helloword;
public class HelloJavaImpl implements HelloJava {
private String name;
@Autowired
private Helloword helloword;
public void setName(String name) {
this.name = name;
}
@Override
public void name() {
System.out.println(this.name);
helloword.sayHello();
}
}
```
TradePortalUtil.java
```package common;
import java.lang.reflect.Field;
import java.text.SimpleDateFormat;
import java.util.Calendar;
import java.util.Date;
import java.util.Map;
import java.util.UUID;
import org.apache.commons.lang3.StringUtils;
/**
* 交易前置系统专用工具类
* @create Aug 15, 2012 12:16:49 PM
* @update Sep 27, 2012 3:07:09 PM
* @author 玄玉<http://blog.csdn/net/jadyer>
* @version v2.0
* @history v1.7.2-->新增<code>getHexSign()</code>通过指定算法签名字符串方法
* @history v1.7.2-->新增<code>getString()</code>字节数组转为字符串方法
* @history v1.7.3-->修改<code>getSysJournalNo()</code>实现细节为<code>java.util.UUID.randomUUID()</code>
* @history v1.7.4-->新增<code>getHexSign()</code>根据指定的签名密钥和算法签名Map<String,String>
* @history v1.7.5-->新增<code>getStringSimple()</code>获取一个字符串的简明效果,返回的字符串格式类似于"abcd***hijk"
* @history v2.0-->局部的StringBuffer一律StringBuilder之(本思路提示自坦克<captmjc@gmail.com>)
*/
public class TradePortalUtil {
private TradePortalUtil(){}
/**
* 获取系统流水号
* @see 若欲指定返回值的长度or是否全由数字组成等,you can call {@link TradePortalUtil#getSysJournalNo(int, boolean)}
* @return 长度为20的全数字
*/
public static String getSysJournalNo(){
return getSysJournalNo(20, true);
}
/**
* 获取系统流水号
* @param length 指定流水号长度
* @param toNumber 指定流水号是否全由数字组成
*/
public static String getSysJournalNo(int length, boolean isNumber){
//replaceAll()之后返回的是一个由十六进制形式组成的且长度为32的字符串
String uuid = UUID.randomUUID().toString().replaceAll("-", "");
if(uuid.length() > length){
uuid = uuid.substring(0, length);
}else if(uuid.length() < length){
for(int i=0; i<length-uuid.length(); i++){
uuid = uuid + Math.round(Math.random()*9);
}
}
if(isNumber){
return uuid.replaceAll("a", "1").replaceAll("b", "2").replaceAll("c", "3").replaceAll("d", "4").replaceAll("e", "5").replaceAll("f", "6");
}else{
return uuid;
}
}
/**
* 判断输入的字符串参数是否为空
* @return boolean 空则返回true,非空则flase
*/
public static boolean isEmpty(String input) {
return null==input || 0==input.length() || 0==input.replaceAll("\\s", "").length();
}
/**
* 判断输入的字节数组是否为空
* @return boolean 空则返回true,非空则flase
*/
public static boolean isEmpty(byte[] bytes){
return null==bytes || 0==bytes.length;
}
/**
* 获取实体类中的属性
* @see 本方法用到了反射,其适用于所有的属性类型均为byte[]的JavaBean
* @return String field11=value11 field22=value22 field33=value33
*/
public static String getStringFromObjectForByte(Object obj){
StringBuilder sb = new StringBuilder(); //局部的StringBuffer一律StringBuilder之
sb.append(obj.getClass().getName()).append("@").append(obj.hashCode()).append("[");
for(Field field : obj.getClass().getDeclaredFields()){
String methodName = "get" + StringUtils.capitalize(field.getName()); //构造getter方法
Object fieldValue = null;
try{
fieldValue = obj.getClass().getDeclaredMethod(methodName).invoke(obj); //执行getter方法,获取其返回值
}catch(Exception e){
//一旦发生异常,便将属性值置为UnKnown,故此处没必要一一捕获所有异常
sb.append("\n").append(field.getName()).append("=UnKnown");
continue;
}
if(fieldValue == null){
sb.append("\n").append(field.getName()).append("=null");
}else{
sb.append("\n").append(field.getName()).append("=").append(new String((byte[])fieldValue));
}
}
return sb.append("\n]").toString();
}
/**
* 获取Map中的属性
* @see 由于Map.toString()打印出来的参数值对,是横着一排的...参数多的时候,不便于查看各参数值
* @see 故此仿照commons-lang.jar中的ReflectionToStringBuilder.toString()编写了本方法
* @return String key11=value11 \n key22=value22 \n key33=value33 \n......
*/
public static String getStringFromMap(Map<String, String> map){
StringBuilder sb = new StringBuilder();
sb.append(map.getClass().getName()).append("@").append(map.hashCode()).append("[");
for(Map.Entry<String,String> entry : map.entrySet()){
sb.append("\n").append(entry.getKey()).append("=").append(entry.getValue());
}
return sb.append("\n]").toString();
}
/**
* 获取Map中的属性
* @see 该方法的参数适用于打印Map<String, byte[]>的情况
* @return String key11=value11 \n key22=value22 \n key33=value33 \n......
*/
public static String getStringFromMapForByte(Map<String, byte[]> map){
StringBuilder sb = new StringBuilder();
sb.append(map.getClass().getName()).append("@").append(map.hashCode()).append("[");
for(Map.Entry<String,byte[]> entry : map.entrySet()){
sb.append("\n").append(entry.getKey()).append("=").append(new String(entry.getValue()));
}
return sb.append("\n]").toString();
}
/**
* 获取Map中的属性
* @see 该方法的参数适用于打印Map<String, Object>的情况
* @return String key11=value11 \n key22=value22 \n key33=value33 \n......
*/
public static String getStringFromMapForObject(Map<String, Object> map){
StringBuilder sb = new StringBuilder();
sb.append(map.getClass().getName()).append("@").append(map.hashCode()).append("[");
for(Map.Entry<String,Object> entry : map.entrySet()){
sb.append("\n").append(entry.getKey()).append("=").append(entry.getValue().toString());
}
return sb.append("\n]").toString();
}
/**
* 金额元转分
* @see 注意:该方法可处理贰仟万以内的金额,且若有小数位,则不限小数位的长度
* @see 注意:如果你的金额达到了贰仟万以上,则不推荐使用该方法,否则计算出来的结果会令人大吃一惊
* @param amount 金额的元进制字符串
* @return String 金额的分进制字符串
*/
public static String moneyYuanToFen(String amount){
if(isEmpty(amount)){
return amount;
}
//传入的金额字符串代表的是一个整数
if(-1 == amount.indexOf(".")){
return Integer.parseInt(amount) * 100 + "";
}
//传入的金额字符串里面含小数点-->取小数点前面的字符串,并将之转换成单位为分的整数表示
int money_fen = Integer.parseInt(amount.substring(0, amount.indexOf("."))) * 100;
//取到小数点后面的字符串
String pointBehind = (amount.substring(amount.indexOf(".") + 1));
//amount=12.3
if(pointBehind.length() == 1){
return money_fen + Integer.parseInt(pointBehind)*10 + "";
}
//小数点后面的第一位字符串的整数表示
int pointString_1 = Integer.parseInt(pointBehind.substring(0, 1));
//小数点后面的第二位字符串的整数表示
int pointString_2 = Integer.parseInt(pointBehind.substring(1, 2));
//amount==12.03,amount=12.00,amount=12.30
if(pointString_1 == 0){
return money_fen + pointString_2 + "";
}else{
return money_fen + pointString_1*10 + pointString_2 + "";
}
}
/**
* 金额元转分
* @see 该方法会将金额中小数点后面的数值,四舍五入后只保留两位....如12.345-->12.35
* @see 注意:该方法可处理贰仟万以内的金额
* @see 注意:如果你的金额达到了贰仟万以上,则非常不建议使用该方法,否则计算出来的结果会令人大吃一惊
* @param amount 金额的元进制字符串
* @return String 金额的分进制字符串
*/
public static String moneyYuanToFenByRound(String amount){
if(isEmpty(amount)){
return amount;
}
if(-1 == amount.indexOf(".")){
return Integer.parseInt(amount) * 100 + "";
}
int money_fen = Integer.parseInt(amount.substring(0, amount.indexOf("."))) * 100;
String pointBehind = (amount.substring(amount.indexOf(".") + 1));
if(pointBehind.length() == 1){
return money_fen + Integer.parseInt(pointBehind)*10 + "";
}
int pointString_1 = Integer.parseInt(pointBehind.substring(0, 1));
int pointString_2 = Integer.parseInt(pointBehind.substring(1, 2));
//下面这种方式用于处理pointBehind=245,286,295,298,995,998等需要四舍五入的情况
if(pointBehind.length() > 2){
int pointString_3 = Integer.parseInt(pointBehind.substring(2, 3));
if(pointString_3 >= 5){
if(pointString_2 == 9){
if(pointString_1 == 9){
money_fen = money_fen + 100;
pointString_1 = 0;
pointString_2 = 0;
}else{
pointString_1 = pointString_1 + 1;
pointString_2 = 0;
}
}else{
pointString_2 = pointString_2 + 1;
}
}
}
if(pointString_1 == 0){
return money_fen + pointString_2 + "";
}else{
return money_fen + pointString_1*10 + pointString_2 + "";
}
}
/**
* 金额分转元
* @see 注意:如果传入的参数中含小数点,则直接原样返回
* @see 该方法返回的金额字符串格式为<code>00.00</code>,其整数位有且至少有一个,小数位有且长度固定为2
* @param amount 金额的分进制字符串
* @return String 金额的元进制字符串
*/
public static String moneyFenToYuan(String amount){
if(isEmpty(amount)){
return amount;
}
if(amount.indexOf(".") > -1){
return amount;
}
if(amount.length() == 1){
return "0.0" + amount;
}else if(amount.length() == 2){
return "0." + amount;
}else{
return amount.substring(0, amount.length()-2) + "." + amount.substring(amount.length()-2);
}
}
/**
* 获取一个字符串的简明效果
* @return String 返回的字符串格式类似于"abcd***hijk"
*/
public static String getStringSimple(String data){
return data.substring(0,4) + "***" + data.substring(data.length()-4);
}
/**
* 获取前一天日期yyyyMMdd
* @see 经测试，针对闰年02月份或跨年等情况，该代码仍有效。测试代码如下
* @see calendar.set(Calendar.YEAR, 2013);
* @see calendar.set(Calendar.MONTH, 0);
* @see calendar.set(Calendar.DATE, 1);
* @see 测试时，将其放到<code>calendar.add(Calendar.DATE, -1);</code>前面即可
* @return 返回的日期格式为yyyyMMdd
*/
public static String getYestoday(){
Calendar calendar = Calendar.getInstance();
calendar.add(Calendar.DATE, -1);
return new SimpleDateFormat("yyyyMMdd").format(calendar.getTime());
}
/**
* 获取当前的日期yyyyMMdd
*/
public static String getCurrentDate(){
return new SimpleDateFormat("yyyyMMdd").format(new Date());
}
/**
* 获取当前的时间yyyyMMddHHmmss
*/
public static String getCurrentTime(){
return new SimpleDateFormat("yyyyMMddHHmmss").format(new Date());
}
/**
* HTML字符转义
* @see 对输入参数中的敏感字符进行过滤替换,防止用户利用JavaScript等方式输入恶意代码
* @see String input = <img src='http://t1.baidu.com/it/fm=0&gp=0.jpg'/>
* @see HtmlUtils.htmlEscape(input); //from spring.jar
* @see StringEscapeUtils.escapeHtml(input); //from commons-lang.jar
* @see 尽管Spring和Apache都提供了字符转义的方法,但Apache的StringEscapeUtils功能要更强大一些
* @see StringEscapeUtils提供了对HTML,Java,JavaScript,SQL,XML等字符的转义和反转义
* @see 但二者在转义HTML字符时,都不会对单引号和空格进行转义,而本方法则提供了对它们的转义
* @return String 过滤后的字符串
*/
public static String htmlEscape(String input) {
if(isEmpty(input)){
return input;
}
input = input.replaceAll("&", "&");
input = input.replaceAll("<", "<");
input = input.replaceAll(">", ">");
input = input.replaceAll(" ", " ");
input = input.replaceAll("'", "'"); //IE暂不支持单引号的实体名称,而支持单引号的实体编号,故单引号转义成实体编号,其它字符转义成实体名称
input = input.replaceAll("\"", """); //双引号也需要转义，所以加一个斜线对其进行转义
input = input.replaceAll("\n", "<br/>"); //不能把\n的过滤放在前面，因为还要对<和>过滤，这样就会导致<br/>失效了
return input;
}
}
```
|
zzwar2009/react-dva-demo
|
zzwar2009/react-dva-demo
api.js
```// ajax函数将返回Promise对象:
function ajax(method, url, data) {
var request = new XMLHttpRequest();
return new Promise(function (resolve, reject) {
request.onreadystatechange = function () {
if (request.readyState === 4) {
if (request.status === 200) {
resolve(request.responseText);
} else {
reject(request.status);
}
}
};
request.open(method, url);
request.send(data);
});
}
function request(){
return ajax('GET', 'https://www.tianqiapi.com/api/?version=v1&cityid=101110101&appid=1001&appsecret=5566');
}
export {
request
}```
index.js
```import React ,{Component} from 'react';
import { connect } from 'dva';
// import styles from './Weather.less'
class Weather extends Component {
state = {
};
//https://www.tianqiapi.com/api/
componentDidMount() {
const { dispatch } = this.props;
dispatch({
type: 'weather/queryList',
});
}
render() {
let {city,data} = this.props.weather;
data = data || [];
var arr = data.map( (item,i) => {
return (<li key ={i} >
<span>{item.day}</span>
<span>{item.date}</span>
<span>{item.week}</span>
<span>{item.wea}</span>
</li>)
})
return (<div>
<p>{city}</p>
<ul>
{arr}
</ul>
</div>
);
}
}
export default connect((state) =>
{
// debugger
const { weather} = state;
return {
weather,
}
})(Weather);```
app.js
```import "@babel/polyfill";
var ReactDOM = require("react-dom");
import React, { Component } from 'react';
import {Router,Route} from 'dva/router';
import "../styles/app.scss";
import Weather from '../page/weather';
import Counter from '../page/counter';
import Home from '../page/home';
import dva, { connect } from 'dva';
import weatherModel from '@/models/weather'
import counterModel from '@/models/counter'
const app = dva();
app.model(weatherModel);
app.model(counterModel);
// 4. Router
app.router(({history})=>(
<Router history={history}>
<>
<Route path="/" exact={true} component={Home}/>
<Route path="/counter" component={Counter}/>
<Route path="/weather" component={Weather}/>
</>
</Router>
));
// 5. Start
app.start('#root');```
weather.js
```// import { parse, stringify } from 'qs';
// import { routerRedux } from 'dva/router';
// ajax函数将返回Promise对象:
import {request} from '@/service/api';
const Model = {
namespace: 'weather',
state: {
data: [],
city:''
},
effects: {
*queryList(_, { call, put }) {
try {
const response = yield call(request);
const { city, data} = response ? JSON.parse(response) : {};
yield put({
type: 'updateList',
payload: {
data,
city
},
});
} catch (e) {
console.error(e.stack);
message.error(e.stack);
}
},
},
reducers: {
updateList(state, { payload }) {
return { ...state, ...payload};
},
},
};
export default Model;
```
travis.sh
```#!/bin/bash
CUR_SHA=`git rev-parse HEAD`
CUR_TAG=`git tag --points-at $CUR_SHA`
echo $CUR_TAG
if [ $CUR_TAG ] && [ "$CUR_TAG"x != ""x ]; then
echo ''
echo '[is a tag] start packing'
echo 'packing......'
rm -r ./$CUR_TAG
mkdir $CUR_TAG
rm -r ./build
rm *.zip
npm run build
cd build
cp -r *.css *.jpg *.png *.js *.html ../$CUR_TAG
cd ..
zip -r $CUR_TAG.zip $CUR_TAG
pwd
curl -v -F r=releases -F hasPom=false -F e=zip -F g=com.easemob.kefu.fe.rs -F a=kefu-fe-emticket-mgt -F v=$CUR_TAG -F p=zip -F 'file=@'$CUR_TAG'.zip' -u ci-deploy:Xyc-R5c-SdS-2Qr http://hk.nexus.op.easemob.com/nexus/service/local/artifact/maven/content
else
echo ''
echo '[not a tag] exit packing.'
fi
```
counter.js
```// import { delay, takeLatest } from 'redux-saga'
const Model = {
namespace: 'counter',
state: {
value:100
},
effects: {
*asyncAdd(_, { put }) {
// yield delay(1000);
yield put({
type: 'add',
payload: {
},
});
},
},
reducers: {
add(state, { payload }) {
return {
value:state.value+1
};
},
minus(state, { payload }) {
return {
value:state.value-1
};
}
},
};
export default Model;
```
bundle.d82be8557e06c97e2ed6.js
```!function(n){var r={};function o(t){if(r[t])return r[t].exports;var e=r[t]={i:t,l:!1,exports:{}};return n[t].call(e.exports,e,e.exports,o),e.l=!0,e.exports}o.m=n,o.c=r,o.d=function(t,e,n){o.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:n})},o.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},o.t=function(e,t){if(1&t&&(e=o(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var n=Object.create(null);if(o.r(n),Object.defineProperty(n,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var r in e)o.d(n,r,function(t){return e[t]}.bind(null,r));return n},o.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return o.d(e,"a",e),e},o.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},o.p="",o(o.s=527)}([function(t,e,n){t.exports=n(414)()},function(t,e,n){var v=n(3),y=n(11),m=n(21),g=n(18),b=n(25),w="prototype",x=function(t,e,n){var r,o,i,a,u=t&x.F,c=t&x.G,l=t&x.S,s=t&x.P,f=t&x.B,p=c?v:l?v[e]||(v[e]={}):(v[e]||{})[w],d=c?y:y[e]||(y[e]={}),h=d[w]||(d[w]={});for(r in c&&(n=e),n)i=((o=!u&&p&&void 0!==p[r])?p:n)[r],a=f&&o?b(i,v):s&&"function"==typeof i?b(Function.call,i):i,p&&g(p,r,i,t&x.U),d[r]!=i&&m(d,r,a),s&&h[r]!=i&&(h[r]=i)};v.core=y,x.F=1,x.G=2,x.S=4,x.P=8,x.B=16,x.W=32,x.U=64,x.R=128,t.exports=x},function(t,e,n){"use strict";t.exports=n(411)},function(t,e){var n=t.exports="undefined"!=typeof window&&window.Math==Math?window:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")();"number"==typeof __g&&(__g=n)},function(t,e){t.exports=function(t){try{return!!t()}catch(t){return!0}}},function(t,e,n){var r=n(6);t.exports=function(t){if(!r(t))throw TypeError(t+" is not an object!");return t}},function(t,e){t.exports=function(t){return"object"==typeof t?null!==t:"function"==typeof t}},function(t,e,n){"use strict";t.exports=function(t,e,n,r,o,i,a,u){if(!t){var c;if(void 0===e)c=new Error("Minified exception occurred; use the non-minified dev environment for the full error message and additional helpful warnings.");else{var l=[n,r,o,i,a,u],s=0;(c=new Error(e.replace(/%s/g,function(){return l[s++]}))).name="Invariant Violation"}throw c.framesToPop=1,c}}},function(t,e,n){var r=n(90)("wks"),o=n(43),i=n(3).Symbol,a="function"==typeof i;(t.exports=function(t){return r[t]||(r[t]=a&&i[t]||(a?i:o)("Symbol."+t))}).store=r},function(t,e,n){var r=n(27),o=Math.min;t.exports=function(t){return 0<t?o(r(t),9007199254740991):0}},function(t,e,n){"use strict";var r=function(){};t.exports=r},function(t,e){var n=t.exports={version:"2.6.9"};"number"==typeof __e&&(__e=n)},function(t,e,n){t.exports=!n(4)(function(){return 7!=Object.defineProperty({},"a",{get:function(){return 7}}).a})},function(t,e,n){var r=n(5),o=n(158),i=n(39),a=Object.defineProperty;e.f=n(12)?Object.defineProperty:function(t,e,n){if(r(t),e=i(e,!0),r(n),o)try{return a(t,e,n)}catch(t){}if("get"in n||"set"in n)throw TypeError("Accessors not supported!");return"value"in n&&(t[e]=n.value),t}},function(t,e){var n=t.exports={version:"2.6.9"};"number"==typeof __e&&(__e=n)},function(t,e,n){var r=n(33);t.exports=function(t){return Object(r(t))}},function(t,e){var n=t.exports="undefined"!=typeof window&&window.Math==Math?window:"undefined"!=typeof self&&self.Math==Math?self:Function("return this")();"number"==typeof __g&&(__g=n)},function(t,e,n){var r=n(142)("wks"),o=n(104),i=n(16).Symbol,a="function"==typeof i;(t.exports=function(t){return r[t]||(r[t]=a&&i[t]||(a?i:o)("Symbol."+t))}).store=r},function(t,e,n){var i=n(3),a=n(21),u=n(20),c=n(43)("src"),r=n(240),o="toString",l=(""+r).split(o);n(11).inspectSource=function(t){return r.call(t)},(t.exports=function(t,e,n,r){var o="function"==typeof n;o&&(u(n,"name")||a(n,"name",e)),t[e]!==n&&(o&&(u(n,c)||a(n,c,t[e]?""+t[e]:l.join(String(e)))),t===i?t[e]=n:r?t[e]?t[e]=n:a(t,e,n):(delete t[e],a(t,e,n)))})(Function.prototype,o,function(){return"function"==typeof this&&this[c]||r.call(this)})},function(t,e,n){function r(t,e,n,r){var o=String(a(t)),i="<"+e;return""!==n&&(i+=" "+n+'="'+String(r).replace(u,""")+'"'),i+">"+o+"</"+e+">"}var o=n(1),i=n(4),a=n(33),u=/"/g;t.exports=function(e,t){var n={};n[e]=t(r),o(o.P+o.F*i(function(){var t=""[e]('"');return t!==t.toLowerCase()||3<t.split('"').length}),"String",n)}},function(t,e){var n={}.hasOwnProperty;t.exports=function(t,e){return n.call(t,e)}},function(t,e,n){var r=n(13),o=n(42);t.exports=n(12)?function(t,e,n){return r.f(t,e,o(1,n))}:function(t,e,n){return t[e]=n,t}},function(t,e,n){var r=n(74),o=n(33);t.exports=function(t){return r(o(t))}},function(t,e){t.exports=function(t){return t&&t.__esModule?t:{default:t}}},function(t,e,n){"use strict";var r=n(4);t.exports=function(t,e){return!!t&&r(function(){e?t.call(null,function(){},1):t.call(null)})}},function(t,e,n){var i=n(26);t.exports=function(r,o,t){if(i(r),void 0===o)return r;switch(t){case 1:return function(t){return r.call(o,t)};case 2:return function(t,e){return r.call(o,t,e)};case 3:return function(t,e,n){return r.call(o,t,e,n)}}return function(){return r.apply(o,arguments)}}},function(t,e){t.exports=function(t){if("function"!=typeof t)throw TypeError(t+" is not a function!");return t}},function(t,e){var n=Math.ceil,r=Math.floor;t.exports=function(t){return isNaN(t=+t)?0:(0<t?r:n)(t)}},function(t,e,n){var r=n(75),o=n(42),i=n(22),a=n(39),u=n(20),c=n(158),l=Object.getOwnPropertyDescriptor;e.f=n(12)?l:function(t,e){if(t=i(t),e=a(e,!0),c)try{return l(t,e)}catch(t){}if(u(t,e))return o(!r.f.call(t,e),t[e])}},function(t,e,n){var o=n(1),i=n(11),a=n(4);t.exports=function(t,e){var n=(i.Object||{})[t]||Object[t],r={};r[t]=e(n),o(o.S+o.F*a(function(){n(1)}),"Object",r)}},function(t,e,n){var b=n(25),w=n(74),x=n(15),E=n(9),r=n(174);t.exports=function(f,t){var p=1==f,d=2==f,h=3==f,v=4==f,y=6==f,m=5==f||y,g=t||r;return function(t,e,n){for(var r,o,i=x(t),a=w(i),u=b(e,n,3),c=E(a.length),l=0,s=p?g(t,c):d?g(t,0):void 0;l<c;l++)if((m||l in a)&&(o=u(r=a[l],l,i),f))if(p)s[l]=o;else if(o)switch(f){case 3:return!0;case 5:return r;case 6:return l;case 2:s.push(r)}else if(v)return!1;return y?-1:h||v?v:s}}},function(t,e,n){"use strict";var r=n(233),o="object"==typeof self&&self&&self.Object===Object&&self,i=(r.a||o||Function("return this")()).Symbol,a=Object.prototype,u=a.hasOwnProperty,c=a.toString,l=i?i.toStringTag:void 0;var s=function(t){var e=u.call(t,l),n=t[l];try{var r=!(t[l]=void 0)}catch(t){}var o=c.call(t);return r&&(e?t[l]=n:delete t[l]),o},f=Object.prototype.toString;var p=function(t){return f.call(t)},d=i?i.toStringTag:void 0;var h=function(t){return null==t?void 0===t?"[object Undefined]":"[object Null]":d&&d in Object(t)?s(t):p(t)};var v=function(e,n){return function(t){return e(n(t))}}(Object.getPrototypeOf,Object);var y=function(t){return null!=t&&"object"==typeof t},m=Function.prototype,g=Object.prototype,b=m.toString,w=g.hasOwnProperty,x=b.call(Object);e.a=function(t){if(!y(t)||"[object Object]"!=h(t))return!1;var e=v(t);if(null===e)return!0;var n=w.call(e,"constructor")&&e.constructor;return"function"==typeof n&&n instanceof n&&b.call(n)==x}},function(t,e){var n={}.toString;t.exports=function(t){return n.call(t).slice(8,-1)}},function(t,e){t.exports=function(t){if(null==t)throw TypeError("Can't call method on "+t);return t}},function(t,e,n){"use strict";if(n(12)){var m=n(44),g=n(3),b=n(4),w=n(1),x=n(101),r=n(137),h=n(25),E=n(61),o=n(42),S=n(21),i=n(62),a=n(27),_=n(9),k=n(185),u=n(46),c=n(39),l=n(20),O=n(76),T=n(6),v=n(15),y=n(129),P=n(47),C=n(49),j=n(48).f,R=n(131),s=n(43),f=n(8),p=n(30),d=n(91),A=n(77),N=n(133),M=n(59),L=n(94),I=n(60),F=n(132),U=n(176),D=n(13),W=n(28),z=D.f,H=W.f,q=g.RangeError,B=g.TypeError,V=g.Uint8Array,$="ArrayBuffer",G="Shared"+$,Y="BYTES_PER_ELEMENT",K="prototype",Q=Array[K],X=r.ArrayBuffer,J=r.DataView,Z=p(0),tt=p(2),et=p(3),nt=p(4),rt=p(5),ot=p(6),it=d(!0),at=d(!1),ut=N.values,ct=N.keys,lt=N.entries,st=Q.lastIndexOf,ft=Q.reduce,pt=Q.reduceRight,dt=Q.join,ht=Q.sort,vt=Q.slice,yt=Q.toString,mt=Q.toLocaleString,gt=f("iterator"),bt=f("toStringTag"),wt=s("typed_constructor"),xt=s("def_constructor"),Et=x.CONSTR,St=x.TYPED,_t=x.VIEW,kt="Wrong length!",Ot=p(1,function(t,e){return Rt(A(t,t[xt]),e)}),Tt=b(function(){return 1===new V(new Uint16Array([1]).buffer)[0]}),Pt=!!V&&!!V[K].set&&b(function(){new V(1).set({})}),Ct=function(t,e){var n=a(t);if(n<0||n%e)throw q("Wrong offset!");return n},jt=function(t){if(T(t)&&St in t)return t;throw B(t+" is not a typed array!")},Rt=function(t,e){if(!(T(t)&&wt in t))throw B("It is not a typed array constructor!");return new t(e)},At=function(t,e){return Nt(A(t,t[xt]),e)},Nt=function(t,e){for(var n=0,r=e.length,o=Rt(t,r);n<r;)o[n]=e[n++];return o},Mt=function(t,e,n){z(t,e,{get:function(){return this._d[n]}})},Lt=function(t,e,n){var r,o,i,a,u,c,l=v(t),s=arguments.length,f=1<s?e:void 0,p=void 0!==f,d=R(l);if(null!=d&&!y(d)){for(c=d.call(l),i=[],r=0;!(u=c.next()).done;r++)i.push(u.value);l=i}for(p&&2<s&&(f=h(f,n,2)),r=0,o=_(l.length),a=Rt(this,o);r<o;r++)a[r]=p?f(l[r],r):l[r];return a},It=function(){for(var t=0,e=arguments.length,n=Rt(this,e);t<e;)n[t]=arguments[t++];return n},Ft=!!V&&b(function(){mt.call(new V(1))}),Ut=function(){return mt.apply(Ft?vt.call(jt(this)):jt(this),arguments)},Dt={copyWithin:function(t,e,n){return U.call(jt(this),t,e,2<arguments.length?n:void 0)},every:function(t,e){return nt(jt(this),t,1<arguments.length?e:void 0)},fill:function(t){return F.apply(jt(this),arguments)},filter:function(t,e){return At(this,tt(jt(this),t,1<arguments.length?e:void 0))},find:function(t,e){return rt(jt(this),t,1<arguments.length?e:void 0)},findIndex:function(t,e){return ot(jt(this),t,1<arguments.length?e:void 0)},forEach:function(t,e){Z(jt(this),t,1<arguments.length?e:void 0)},indexOf:function(t,e){return at(jt(this),t,1<arguments.length?e:void 0)},includes:function(t,e){return it(jt(this),t,1<arguments.length?e:void 0)},join:function(t){return dt.apply(jt(this),arguments)},lastIndexOf:function(t){return st.apply(jt(this),arguments)},map:function(t,e){return Ot(jt(this),t,1<arguments.length?e:void 0)},reduce:function(t){return ft.apply(jt(this),arguments)},reduceRight:function(t){return pt.apply(jt(this),arguments)},reverse:function(){for(var t,e=this,n=jt(e).length,r=Math.floor(n/2),o=0;o<r;)t=e[o],e[o++]=e[--n],e[n]=t;return e},some:function(t,e){return et(jt(this),t,1<arguments.length?e:void 0)},sort:function(t){return ht.call(jt(this),t)},subarray:function(t,e){var n=jt(this),r=n.length,o=u(t,r);return new(A(n,n[xt]))(n.buffer,n.byteOffset+o*n.BYTES_PER_ELEMENT,_((void 0===e?r:u(e,r))-o))}},Wt=function(t,e){return At(this,vt.call(jt(this),t,e))},zt=function(t,e){jt(this);var n=Ct(e,1),r=this.length,o=v(t),i=_(o.length),a=0;if(r<i+n)throw q(kt);for(;a<i;)this[n+a]=o[a++]},Ht={entries:function(){return lt.call(jt(this))},keys:function(){return ct.call(jt(this))},values:function(){return ut.call(jt(this))}},qt=function(t,e){return T(t)&&t[St]&&"symbol"!=typeof e&&e in t&&String(+e)==String(e)},Bt=function(t,e){return qt(t,e=c(e,!0))?o(2,t[e]):H(t,e)},Vt=function(t,e,n){return!(qt(t,e=c(e,!0))&&T(n)&&l(n,"value"))||l(n,"get")||l(n,"set")||n.configurable||l(n,"writable")&&!n.writable||l(n,"enumerable")&&!n.enumerable?z(t,e,n):(t[e]=n.value,t)};Et||(W.f=Bt,D.f=Vt),w(w.S+w.F*!Et,"Object",{getOwnPropertyDescriptor:Bt,defineProperty:Vt}),b(function(){yt.call({})})&&(yt=mt=function(){return dt.call(this)});var $t=i({},Dt);i($t,Ht),S($t,gt,Ht.values),i($t,{slice:Wt,set:zt,constructor:function(){},toString:yt,toLocaleString:Ut}),Mt($t,"buffer","b"),Mt($t,"byteOffset","o"),Mt($t,"byteLength","l"),Mt($t,"length","e"),z($t,bt,{get:function(){return this[St]}}),t.exports=function(t,f,e,o){function p(t,e){z(t,e,{get:function(){return function(t,e){var n=t._d;return n.v[r](e*f+n.o,Tt)}(this,e)},set:function(t){return function(t,e,n){var r=t._d;o&&(n=(n=Math.round(n))<0?0:255<n?255:255&n),r.v[i](e*f+r.o,n,Tt)}(this,e,t)},enumerable:!0})}var d=t+((o=!!o)?"Clamped":"")+"Array",r="get"+t,i="set"+t,h=g[d],a=h||{},n=h&&C(h),u=!h||!x.ABV,c={},l=h&&h[K];u?(h=e(function(t,e,n,r){E(t,h,d,"_d");var o,i,a,u,c=0,l=0;if(T(e)){if(!(e instanceof X||(u=O(e))==$||u==G))return St in e?Nt(h,e):Lt.call(h,e);o=e,l=Ct(n,f);var s=e.byteLength;if(void 0===r){if(s%f)throw q(kt);if((i=s-l)<0)throw q(kt)}else if(s<(i=_(r)*f)+l)throw q(kt);a=i/f}else a=k(e),o=new X(i=a*f);for(S(t,"_d",{b:o,o:l,l:i,e:a,v:new J(o)});c<a;)p(t,c++)}),l=h[K]=P($t),S(l,"constructor",h)):b(function(){h(1)})&&b(function(){new h(-1)})&&L(function(t){new h,new h(null),new h(1.5),new h(t)},!0)||(h=e(function(t,e,n,r){var o;return E(t,h,d),T(e)?e instanceof X||(o=O(e))==$||o==G?void 0!==r?new a(e,Ct(n,f),r):void 0!==n?new a(e,Ct(n,f)):new a(e):St in e?Nt(h,e):Lt.call(h,e):new a(k(e))}),Z(n!==Function.prototype?j(a).concat(j(n)):j(a),function(t){t in h||S(h,t,a[t])}),h[K]=l,m||(l.constructor=h));var s=l[gt],v=!!s&&("values"==s.name||null==s.name),y=Ht.values;S(h,wt,!0),S(l,St,d),S(l,_t,!0),S(l,xt,h),(o?new h(1)[bt]==d:bt in l)||z(l,bt,{get:function(){return d}}),c[d]=h,w(w.G+w.W+w.F*(h!=a),c),w(w.S,d,{BYTES_PER_ELEMENT:f}),w(w.S+w.F*b(function(){a.of.call(h,1)}),d,{from:Lt,of:It}),Y in l||S(l,Y,f),w(w.P,d,Dt),I(d),w(w.P+w.F*Pt,d,{set:zt}),w(w.P+w.F*!v,d,Ht),m||l.toString==yt||(l.toString=yt),w(w.P+w.F*b(function(){new h(1).slice()}),d,{slice:Wt}),w(w.P+w.F*(b(function(){return[1,2].toLocaleString()!=new h([1,2]).toLocaleString()})||!b(function(){l.toLocaleString.call([1,2])})),d,{toLocaleString:Ut}),M[d]=v?s:y,m||v||S(l,gt,y)}}else t.exports=function(){}},function(t,e,n){var v=n(16),y=n(14),m=n(78),g=n(52),b=n(54),w="prototype",x=function(t,e,n){var r,o,i,a=t&x.F,u=t&x.G,c=t&x.S,l=t&x.P,s=t&x.B,f=t&x.W,p=u?y:y[e]||(y[e]={}),d=p[w],h=u?v:c?v[e]:(v[e]||{})[w];for(r in u&&(n=e),n)(o=!a&&h&&void 0!==h[r])&&b(p,r)||(i=o?h[r]:n[r],p[r]=u&&"function"!=typeof h[r]?n[r]:s&&o?m(i,v):f&&h[r]==i?function(r){function t(t,e,n){if(this instanceof r){switch(arguments.length){case 0:return new r;case 1:return new r(t);case 2:return new r(t,e)}return new r(t,e,n)}return r.apply(this,arguments)}return t[w]=r[w],t}(i):l&&"function"==typeof i?m(Function.call,i):i,l&&((p.virtual||(p.virtual={}))[r]=i,t&x.R&&d&&!d[r]&&g(d,r,i)))};x.F=1,x.G=2,x.S=4,x.P=8,x.B=16,x.W=32,x.U=64,x.R=128,t.exports=x},function(t,e,n){var r=n(37),o=n(190),i=n(139),a=Object.defineProperty;e.f=n(41)?Object.defineProperty:function(t,e,n){if(r(t),e=i(e,!0),r(n),o)try{return a(t,e,n)}catch(t){}if("get"in n||"set"in n)throw TypeError("Accessors not supported!");return"value"in n&&(t[e]=n.value),t}},function(t,e,n){var r=n(53);t.exports=function(t){if(!r(t))throw TypeError(t+" is not an object!");return t}},function(t,e,n){"use strict";e.__esModule=!0;var r=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t},o="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t};e.check=function(t,e,n){if(!e(t))throw g("error","uncaught at check",n),new Error(n)},e.hasOwn=p,e.remove=function(t,e){var n=t.indexOf(e);0<=n&&t.splice(n,1)},e.deferred=h,e.arrayOfDeffered=function(t){for(var e=[],n=0;n<t;n++)e.push(h());return e},e.delay=function(e){var n=!(1<arguments.length&&void 0!==arguments[1])||arguments[1],r=void 0,t=new Promise(function(t){r=setTimeout(function(){return t(n)},e)});return t[c]=function(){return clearTimeout(r)},t},e.createMockTask=function(){var t,e=!0,n=void 0,r=void 0;return(t={})[a]=!0,t.isRunning=function(){return e},t.result=function(){return n},t.error=function(){return r},t.setRunning=function(t){return e=t},t.setResult=function(t){return n=t},t.setError=function(t){return r=t},t},e.autoInc=v,e.makeIterator=function(t){var e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:y,n={name:2<arguments.length&&void 0!==arguments[2]?arguments[2]:"",next:t,throw:e,return:m};arguments[3]&&(n[u]=!0);"undefined"!=typeof Symbol&&(n[Symbol.iterator]=function(){return n});return n},e.log=g,e.deprecate=function(t,e){return function(){return t.apply(void 0,arguments)}};var i=e.sym=function(t){return"@@redux-saga/"+t},a=e.TASK=i("TASK"),u=e.HELPER=i("HELPER"),c=(e.MATCH=i("MATCH"),e.CANCEL=i("CANCEL_PROMISE")),l=e.SAGA_ACTION=i("SAGA_ACTION"),s=(e.SELF_CANCELLATION=i("SELF_CANCELLATION"),e.konst=function(t){return function(){return t}});e.kTrue=s(!0),e.kFalse=s(!1),e.noop=function(){},e.ident=function(t){return t};var f=Object.prototype.hasOwnProperty;function p(t,e){return d.notUndef(t)&&f.call(t,e)}var d=e.is={undef:function(t){return null==t},notUndef:function(t){return null!=t},func:function(t){return"function"==typeof t},number:function(t){return"number"==typeof t},string:function(t){return"string"==typeof t},array:Array.isArray,object:function(t){return t&&!d.array(t)&&"object"===(void 0===t?"undefined":o(t))},promise:function(t){return t&&d.func(t.then)},iterator:function(t){return t&&d.func(t.next)&&d.func(t.throw)},iterable:function(t){return t&&d.func(Symbol)?d.func(t[Symbol.iterator]):d.array(t)},task:function(t){return t&&t[a]},observable:function(t){return t&&d.func(t.subscribe)},buffer:function(t){return t&&d.func(t.isEmpty)&&d.func(t.take)&&d.func(t.put)},pattern:function(t){return t&&(d.string(t)||"symbol"===(void 0===t?"undefined":o(t))||d.func(t)||d.array(t))},channel:function(t){return t&&d.func(t.take)&&d.func(t.close)},helper:function(t){return t&&t[u]},stringableFunc:function(t){return d.func(t)&&p(t,"toString")}};e.object={assign:function(t,e){for(var n in e)p(e,n)&&(t[n]=e[n])}};e.array={from:function(t){var e=Array(t.length);for(var n in t)p(t,n)&&(e[n]=t[n]);return e}};function h(){var n=r({},0<arguments.length&&void 0!==arguments[0]?arguments[0]:{}),t=new Promise(function(t,e){n.resolve=t,n.reject=e});return n.promise=t,n}function v(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:0;return function(){return++t}}e.uid=v();var y=function(t){throw t},m=function(t){return{value:t,done:!0}};function g(t,e){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:"";"undefined"==typeof window?console.log("redux-saga "+t+": "+e+"\n"+(n&&n.stack||n)):console[t](e,n)}e.updateIncentive=function(t,e){return t+" has been deprecated in favor of "+e+", please update your code"},e.internalErr=function(t){return new Error("\n redux-saga: Error checking hooks detected an inconsistent state. This is likely a bug\n in redux-saga code and not yours. Thanks for reporting this in the project's github repo.\n Error: "+t+"\n")},e.createSetContextWarning=function(t,e){return(t?t+".":"")+"setContext(props): argument "+e+" is not a plain object"},e.wrapSagaDispatch=function(e){return function(t){return e(Object.defineProperty(t,l,{value:!0}))}},e.cloneableGenerator=function i(a){return function(){for(var t=arguments.length,n=Array(t),e=0;e<t;e++)n[e]=arguments[e];var r=[],o=a.apply(void 0,n);return{next:function(t){return r.push(t),o.next(t)},clone:function(){var e=i(a).apply(void 0,n);return r.forEach(function(t){return e.next(t)}),e},return:function(t){return o.return(t)},throw:function(t){return o.throw(t)}}}}},function(t,e,n){var o=n(6);t.exports=function(t,e){if(!o(t))return t;var n,r;if(e&&"function"==typeof(n=t.toString)&&!o(r=n.call(t)))return r;if("function"==typeof(n=t.valueOf)&&!o(r=n.call(t)))return r;if(!e&&"function"==typeof(n=t.toString)&&!o(r=n.call(t)))return r;throw TypeError("Can't convert object to primitive value")}},function(t,e,n){function r(t){u(t,o,{value:{i:"O"+ ++c,w:{}}})}var o=n(43)("meta"),i=n(6),a=n(20),u=n(13).f,c=0,l=Object.isExtensible||function(){return!0},s=!n(4)(function(){return l(Object.preventExtensions({}))}),f=t.exports={KEY:o,NEED:!1,fastKey:function(t,e){if(!i(t))return"symbol"==typeof t?t:("string"==typeof t?"S":"P")+t;if(!a(t,o)){if(!l(t))return"F";if(!e)return"E";r(t)}return t[o].i},getWeak:function(t,e){if(!a(t,o)){if(!l(t))return!0;if(!e)return!1;r(t)}return t[o].w},onFreeze:function(t){return s&&f.NEED&&l(t)&&!a(t,o)&&r(t),t}}},function(t,e,n){t.exports=!n(79)(function(){return 7!=Object.defineProperty({},"a",{get:function(){return 7}}).a})},function(t,e){t.exports=function(t,e){return{enumerable:!(1&t),configurable:!(2&t),writable:!(4&t),value:e}}},function(t,e){var n=0,r=Math.random();t.exports=function(t){return"Symbol(".concat(void 0===t?"":t,")_",(++n+r).toString(36))}},function(t,e){t.exports=!1},function(t,e,n){var r=n(160),o=n(116);t.exports=Object.keys||function(t){return r(t,o)}},function(t,e,n){var r=n(27),o=Math.max,i=Math.min;t.exports=function(t,e){return(t=r(t))<0?o(t+e,0):i(t,e)}},function(t,e,r){function o(){}var i=r(5),a=r(161),u=r(116),c=r(115)("IE_PROTO"),l="prototype",s=function(){var t,e=r(113)("iframe"),n=u.length;for(e.style.display="none",r(117).appendChild(e),e.src="javascript:",(t=e.contentWindow.document).open(),t.write("<script>document.F=Object<\/script>"),t.close(),s=t.F;n--;)delete s[l][u[n]];return s()};t.exports=Object.create||function(t,e){var n;return null!==t?(o[l]=i(t),n=new o,o[l]=null,n[c]=t):n=s(),void 0===e?n:a(n,e)}},function(t,e,n){var r=n(160),o=n(116).concat("length","prototype");e.f=Object.getOwnPropertyNames||function(t){return r(t,o)}},function(t,e,n){var r=n(20),o=n(15),i=n(115)("IE_PROTO"),a=Object.prototype;t.exports=Object.getPrototypeOf||function(t){return t=o(t),r(t,i)?t[i]:"function"==typeof t.constructor&&t instanceof t.constructor?t.constructor.prototype:t instanceof Object?a:null}},function(t,e,n){var r=n(8)("unscopables"),o=Array.prototype;null==o[r]&&n(21)(o,r,{}),t.exports=function(t){o[r][t]=!0}},function(t,e,n){var r=n(6);t.exports=function(t,e){if(!r(t)||t._t!==e)throw TypeError("Incompatible receiver, "+e+" required!");return t}},function(t,e,n){var r=n(36),o=n(80);t.exports=n(41)?function(t,e,n){return r.f(t,e,o(1,n))}:function(t,e,n){return t[e]=n,t}},function(t,e){t.exports=function(t){return"object"==typeof t?null!==t:"function"==typeof t}},function(t,e){var n={}.hasOwnProperty;t.exports=function(t,e){return n.call(t,e)}},function(t,e,n){var r=n(425),o=n(140);t.exports=function(t){return r(o(t))}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),Object.defineProperty(e,"isPlainObject",{enumerable:!0,get:function(){return o.default}}),e.findIndex=e.noop=e.returnSelf=e.isFunction=e.isArray=void 0;var o=r(n(479)),i=Array.isArray.bind(Array);e.isArray=i;e.isFunction=function(t){return"function"==typeof t};e.returnSelf=function(t){return t};e.noop=function(){};e.findIndex=function(t,e){for(var n=0,r=t.length;n<r;n++)if(e(t[n],n))return n;return-1}},function(t,e,n){var r=n(13).f,o=n(20),i=n(8)("toStringTag");t.exports=function(t,e,n){t&&!o(t=n?t:t.prototype,i)&&r(t,i,{configurable:!0,value:e})}},function(t,e,n){function r(t,e,n){var r={},o=u(function(){return!!c[t]()||"
"!="
"[t]()}),i=r[t]=o?e(f):c[t];n&&(r[n]=i),a(a.P+a.F*o,"String",r)}var a=n(1),o=n(33),u=n(4),c=n(119),i="["+c+"]",l=RegExp("^"+i+i+"*"),s=RegExp(i+i+"*$"),f=r.trim=function(t,e){return t=String(o(t)),1&e&&(t=t.replace(l,"")),2&e&&(t=t.replace(s,"")),t};t.exports=r},function(t,e){t.exports={}},function(t,e,n){"use strict";var r=n(3),o=n(13),i=n(12),a=n(8)("species");t.exports=function(t){var e=r[t];i&&e&&!e[a]&&o.f(e,a,{configurable:!0,get:function(){return this}})}},function(t,e){t.exports=function(t,e,n,r){if(!(t instanceof e)||void 0!==r&&r in t)throw TypeError(n+": incorrect invocation!");return t}},function(t,e,n){var o=n(18);t.exports=function(t,e,n){for(var r in e)o(t,r,e[r],n);return t}},function(t,e){t.exports={}},function(t,e,n){t.exports=n(206)},function(t,e,n){"use strict";e.__esModule=!0,e.asEffect=e.takem=e.detach=void 0,e.take=S,e.put=_,e.all=k,e.race=function(t){return x(c,t)},e.call=function(t){for(var e=arguments.length,n=Array(1<e?e-1:0),r=1;r<e;r++)n[r-1]=arguments[r];return x(l,O("call",t,n))},e.apply=function(t,e){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:[];return x(l,O("apply",{context:t,fn:e},n))},e.cps=function(t){for(var e=arguments.length,n=Array(1<e?e-1:0),r=1;r<e;r++)n[r-1]=arguments[r];return x(s,O("cps",t,n))},e.fork=T,e.spawn=function(t){for(var e=arguments.length,n=Array(1<e?e-1:0),r=1;r<e;r++)n[r-1]=arguments[r];return E(T.apply(void 0,[t].concat(n)))},e.join=function e(){for(var t=arguments.length,n=Array(t),r=0;r<t;r++)n[r]=arguments[r];if(1<n.length)return k(n.map(function(t){return e(t)}));var o=n[0];(0,a.check)(o,a.is.notUndef,"join(task): argument task is undefined");(0,a.check)(o,a.is.task,"join(task): argument "+o+" is not a valid Task object "+w);return x(p,o)},e.cancel=function e(){for(var t=arguments.length,n=Array(t),r=0;r<t;r++)n[r]=arguments[r];if(1<n.length)return k(n.map(function(t){return e(t)}));var o=n[0];1===n.length&&((0,a.check)(o,a.is.notUndef,"cancel(task): argument task is undefined"),(0,a.check)(o,a.is.task,"cancel(task): argument "+o+" is not a valid Task object "+w));return x(d,o||a.SELF_CANCELLATION)},e.select=function(t){for(var e=arguments.length,n=Array(1<e?e-1:0),r=1;r<e;r++)n[r-1]=arguments[r];0===arguments.length?t=a.ident:((0,a.check)(t,a.is.notUndef,"select(selector,[...]): argument selector is undefined"),(0,a.check)(t,a.is.func,"select(selector,[...]): argument "+t+" is not a function"));return x(h,{selector:t,args:n})},e.actionChannel=function(t,e){(0,a.check)(t,a.is.notUndef,"actionChannel(pattern,...): argument pattern is undefined"),1<arguments.length&&((0,a.check)(e,a.is.notUndef,"actionChannel(pattern, buffer): argument buffer is undefined"),(0,a.check)(e,a.is.buffer,"actionChannel(pattern, buffer): argument "+e+" is not a valid buffer"));return x(v,{pattern:t,buffer:e})},e.cancelled=function(){return x(y,{})},e.flush=function(t){return(0,a.check)(t,a.is.channel,"flush(channel): argument "+t+" is not valid channel"),x(m,t)},e.getContext=function(t){return(0,a.check)(t,a.is.string,"getContext(prop): argument "+t+" is not a string"),x(g,t)},e.setContext=function(t){return(0,a.check)(t,a.is.object,(0,a.createSetContextWarning)(null,t)),x(b,t)};var a=n(38),r=(0,a.sym)("IO"),o="TAKE",i="PUT",u="ALL",c="RACE",l="CALL",s="CPS",f="FORK",p="JOIN",d="CANCEL",h="SELECT",v="ACTION_CHANNEL",y="CANCELLED",m="FLUSH",g="GET_CONTEXT",b="SET_CONTEXT",w="\n(HINT: if you are getting this errors in tests, consider using createMockTask from redux-saga/utils)",x=function(t,e){var n;return(n={})[r]=!0,n[t]=e,n},E=e.detach=function(t){return(0,a.check)(C.fork(t),a.is.object,"detach(eff): argument must be a fork effect"),t[f].detached=!0,t};function S(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:"*";if(arguments.length&&(0,a.check)(arguments[0],a.is.notUndef,"take(patternOrChannel): patternOrChannel is undefined"),a.is.pattern(t))return x(o,{pattern:t});if(a.is.channel(t))return x(o,{channel:t});throw new Error("take(patternOrChannel): argument "+String(t)+" is not valid channel or a valid pattern")}S.maybe=function(){var t=S.apply(void 0,arguments);return t[o].maybe=!0,t};e.takem=(0,a.deprecate)(S.maybe,(0,a.updateIncentive)("takem","take.maybe"));function _(t,e){return 1<arguments.length?((0,a.check)(t,a.is.notUndef,"put(channel, action): argument channel is undefined"),(0,a.check)(t,a.is.channel,"put(channel, action): argument "+t+" is not a valid channel"),(0,a.check)(e,a.is.notUndef,"put(channel, action): argument action is undefined")):((0,a.check)(t,a.is.notUndef,"put(action): argument action is undefined"),e=t,t=null),x(i,{channel:t,action:e})}function k(t){return x(u,t)}function O(t,e,n){(0,a.check)(e,a.is.notUndef,t+": argument fn is undefined");var r=null;if(a.is.array(e)){var o=e;r=o[0],e=o[1]}else if(e.fn){var i=e;r=i.context,e=i.fn}return r&&a.is.string(e)&&a.is.func(r[e])&&(e=r[e]),(0,a.check)(e,a.is.func,t+": argument "+e+" is not a function"),{context:r,fn:e,args:n}}function T(t){for(var e=arguments.length,n=Array(1<e?e-1:0),r=1;r<e;r++)n[r-1]=arguments[r];return x(f,O("fork",t,n))}_.resolve=function(){var t=_.apply(void 0,arguments);return t[i].resolve=!0,t},_.sync=(0,a.deprecate)(_.resolve,(0,a.updateIncentive)("put.sync","put.resolve"));function P(e){return function(t){return t&&t[r]&&t[e]}}var C=e.asEffect={take:P(o),put:P(i),all:P(u),race:P(c),call:P(l),cps:P(s),fork:P(f),join:P(p),cancel:P(d),select:P(h),actionChannel:P(v),cancelled:P(y),flush:P(m),getContext:P(g),setContext:P(b)}},function(t,e){t.exports=function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}},function(t,e){function r(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,r.key,r)}}t.exports=function(t,e,n){return e&&r(t.prototype,e),n&&r(t,n),t}},function(t,e,n){var r=n(419),o=n(420);t.exports=function(t,e){return!e||"object"!==r(e)&&"function"!=typeof e?o(t):e}},function(e,t){function n(t){return e.exports=n=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)},n(t)}e.exports=n},function(t,e,n){var r=n(421);t.exports=function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),e&&r(t,e)}},function(t,e,n){t.exports=n(422),t.exports.connect=n(227).connect},function(t,i,a){"use strict";(function(t,e){var n,r=a(232);n="undefined"!=typeof self?self:"undefined"!=typeof window?window:void 0!==t?t:e;var o=Object(r.a)(n);i.a=o}).call(this,a(81),a(466)(t))},function(t,e,n){t.exports=n(189)},function(t,e,n){var r=n(32);t.exports=Object("z").propertyIsEnumerable(0)?Object:function(t){return"String"==r(t)?t.split(""):Object(t)}},function(t,e){e.f={}.propertyIsEnumerable},function(t,e,n){var o=n(32),i=n(8)("toStringTag"),a="Arguments"==o(function(){return arguments}());t.exports=function(t){var e,n,r;return void 0===t?"Undefined":null===t?"Null":"string"==typeof(n=function(t,e){try{return t[e]}catch(t){}}(e=Object(t),i))?n:a?o(e):"Object"==(r=o(e))&&"function"==typeof e.callee?"Arguments":r}},function(t,e,n){var o=n(5),i=n(26),a=n(8)("species");t.exports=function(t,e){var n,r=o(t).constructor;return void 0===r||null==(n=o(r)[a])?e:i(n)}},function(t,e,n){var i=n(102);t.exports=function(r,o,t){if(i(r),void 0===o)return r;switch(t){case 1:return function(t){return r.call(o,t)};case 2:return function(t,e){return r.call(o,t,e)};case 3:return function(t,e,n){return r.call(o,t,e,n)}}return function(){return r.apply(o,arguments)}}},function(t,e){t.exports=function(t){try{return!!t()}catch(t){return!0}}},function(t,e){t.exports=function(t,e){return{enumerable:!(1&t),configurable:!(2&t),writable:!(4&t),value:e}}},function(t,e){var n;n=function(){return this}();try{n=n||new Function("return this")()}catch(t){"object"==typeof window&&(n=window)}t.exports=n},function(t,e){var n={}.toString;t.exports=function(t){return n.call(t).slice(8,-1)}},function(t,e){t.exports=!0},function(t,e,n){"use strict";var r=n(442)(!0);n(208)(String,"String",function(t){this._t=String(t),this._i=0},function(){var t,e=this._t,n=this._i;return n>=e.length?{value:void 0,done:!0}:(t=r(e,n),this._i+=t.length,{value:t,done:!1})})},function(t,e,n){t.exports=n(469)},function(t,e,n){var o=n(218),i=n(471),a=n(64),u=n(472);t.exports=function(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{},r=a(n);"function"==typeof i&&(r=r.concat(i(n).filter(function(t){return o(n,t).enumerable}))),r.forEach(function(t){u(e,t,n[t])})}return e}},function(t,e,n){"use strict";e.__esModule=!0,e.UNDEFINED_INPUT_ERROR=e.INVALID_BUFFER=e.isEnd=e.END=void 0;var r=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};e.emitter=function(){var o=[];return{subscribe:function(t){return o.push(t),function(){return(0,u.remove)(o,t)}},emit:function(t){for(var e=o.slice(),n=0,r=e.length;n<r;n++)e[n](t)}}},e.channel=p,e.eventChannel=d,e.stdChannel=function(t){var n=d(function(e){return t(function(t){t[u.SAGA_ACTION]?e(t):(0,o.asap)(function(){return e(t)})})});return r({},n,{take:function(t,e){1<arguments.length&&((0,u.check)(e,u.is.func,"channel.take's matcher argument must be a function"),t[u.MATCH]=e),n.take(t)}})};var u=n(38),c=n(152),o=n(219),i="@@redux-saga/CHANNEL_END",l=e.END={type:i},a=e.isEnd=function(t){return t&&t.type===i};var s=e.INVALID_BUFFER="invalid buffer passed to channel factory function",f=e.UNDEFINED_INPUT_ERROR="Saga was provided with an undefined action";function p(){var r=0<arguments.length&&void 0!==arguments[0]?arguments[0]:c.buffers.fixed(),o=!1,i=[];function a(){if(o&&i.length)throw(0,u.internalErr)("Cannot have a closed channel with pending takers");if(i.length&&!r.isEmpty())throw(0,u.internalErr)("Cannot have pending takers with non empty buffer")}return(0,u.check)(r,u.is.buffer,s),{take:function(t){a(),(0,u.check)(t,u.is.func,"channel.take's callback must be a function"),o&&r.isEmpty()?t(l):r.isEmpty()?(i.push(t),t.cancel=function(){return(0,u.remove)(i,t)}):t(r.take())},put:function(t){if(a(),(0,u.check)(t,u.is.notUndef,f),!o){if(!i.length)return r.put(t);for(var e=0;e<i.length;e++){var n=i[e];if(!n[u.MATCH]||n[u.MATCH](t))return i.splice(e,1),n(t)}}},flush:function(t){a(),(0,u.check)(t,u.is.func,"channel.flush' callback must be a function"),o&&r.isEmpty()?t(l):t(r.flush())},close:function(){if(a(),!o&&(o=!0,i.length)){var t=i;i=[];for(var e=0,n=t.length;e<n;e++)t[e](l)}},get __takers__(){return i},get __closed__(){return o}}}function d(t){var e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:c.buffers.none(),n=arguments[2];2<arguments.length&&(0,u.check)(n,u.is.func,"Invalid match function passed to eventChannel");function r(){o.__closed__||(i&&i(),o.close())}var o=p(e),i=t(function(t){a(t)?r():n&&!n(t)||o.put(t)});if(o.__closed__&&i(),!u.is.func(i))throw new Error("in eventChannel: subscribe should return a function to unsubscribe");return{take:o.take,flush:o.flush,close:r}}},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0}),e.NAMESPACE_SEP=void 0;e.NAMESPACE_SEP="/"},function(t,e,n){t.exports=n(526),t.exports.routerRedux=n(228)},function(t,e,n){var r=n(11),o=n(3),i="__core-js_shared__",a=o[i]||(o[i]={});(t.exports=function(t,e){return a[t]||(a[t]=void 0!==e?e:{})})("versions",[]).push({version:r.version,mode:n(44)?"pure":"global",copyright:"© 2019 Denis Pushkarev (zloirock.ru)"})},function(t,e,n){var c=n(22),l=n(9),s=n(46);t.exports=function(u){return function(t,e,n){var r,o=c(t),i=l(o.length),a=s(n,i);if(u&&e!=e){for(;a<i;)if((r=o[a++])!=r)return!0}else for(;a<i;a++)if((u||a in o)&&o[a]===e)return u||a||0;return!u&&-1}}},function(t,e){e.f=Object.getOwnPropertySymbols},function(t,e,n){var r=n(32);t.exports=Array.isArray||function(t){return"Array"==r(t)}},function(t,e,n){var i=n(8)("iterator"),a=!1;try{var r=[7][i]();r.return=function(){a=!0},Array.from(r,function(){throw 2})}catch(t){}t.exports=function(t,e){if(!e&&!a)return!1;var n=!1;try{var r=[7],o=r[i]();o.next=function(){return{done:n=!0}},r[i]=function(){return o},t(r)}catch(t){}return n}},function(t,e,n){"use strict";var r=n(5);t.exports=function(){var t=r(this),e="";return t.global&&(e+="g"),t.ignoreCase&&(e+="i"),t.multiline&&(e+="m"),t.unicode&&(e+="u"),t.sticky&&(e+="y"),e}},function(t,e,n){"use strict";var o=n(76),i=RegExp.prototype.exec;t.exports=function(t,e){var n=t.exec;if("function"==typeof n){var r=n.call(t,e);if("object"!=typeof r)throw new TypeError("RegExp exec method returned something other than an Object or null");return r}if("RegExp"!==o(t))throw new TypeError("RegExp#exec called on incompatible receiver");return i.call(t,e)}},function(t,e,n){"use strict";n(178);var s=n(18),f=n(21),p=n(4),d=n(33),h=n(8),v=n(134),y=h("species"),m=!p(function(){var t=/./;return t.exec=function(){var t=[];return t.groups={a:"7"},t},"7"!=="".replace(t,"$<a>")}),g=function(){var t=/(?:)/,e=t.exec;t.exec=function(){return e.apply(this,arguments)};var n="ab".split(t);return 2===n.length&&"a"===n[0]&&"b"===n[1]}();t.exports=function(n,t,e){var r=h(n),i=!p(function(){var t={};return t[r]=function(){return 7},7!=""[n](t)}),o=i?!p(function(){var t=!1,e=/a/;return e.exec=function(){return t=!0,null},"split"===n&&(e.constructor={},e.constructor[y]=function(){return e}),e[r](""),!t}):void 0;if(!i||!o||"replace"===n&&!m||"split"===n&&!g){var a=/./[r],u=e(d,r,""[n],function(t,e,n,r,o){return e.exec===v?i&&!o?{done:!0,value:a.call(e,n,r)}:{done:!0,value:t.call(n,e,r)}:{done:!1}}),c=u[0],l=u[1];s(String.prototype,n,c),f(RegExp.prototype,r,2==t?function(t,e){return l.call(t,this,e)}:function(t){return l.call(t,this)})}}},function(t,e,n){var p=n(25),d=n(173),h=n(129),v=n(5),y=n(9),m=n(131),g={},b={};(e=t.exports=function(t,e,n,r,o){var i,a,u,c,l=o?function(){return t}:m(t),s=p(n,r,e?2:1),f=0;if("function"!=typeof l)throw TypeError(t+" is not iterable!");if(h(l)){for(i=y(t.length);f<i;f++)if((c=e?s(v(a=t[f])[0],a[1]):s(t[f]))===g||c===b)return c}else for(u=l.call(t);!(a=u.next()).done;)if((c=d(u,s,a.value,e))===g||c===b)return c}).BREAK=g,e.RETURN=b},function(t,e,n){var r=n(3).navigator;t.exports=r&&r.userAgent||""},function(t,e,n){"use strict";var m=n(3),g=n(1),b=n(18),w=n(62),x=n(40),E=n(98),S=n(61),_=n(6),k=n(4),O=n(94),T=n(57),P=n(120);t.exports=function(r,t,e,n,o,i){function a(t){var n=s[t];b(s,t,"delete"==t?function(t){return!(i&&!_(t))&&n.call(this,0===t?0:t)}:"has"==t?function(t){return!(i&&!_(t))&&n.call(this,0===t?0:t)}:"get"==t?function(t){return i&&!_(t)?void 0:n.call(this,0===t?0:t)}:"add"==t?function(t){return n.call(this,0===t?0:t),this}:function(t,e){return n.call(this,0===t?0:t,e),this})}var u=m[r],c=u,l=o?"set":"add",s=c&&c.prototype,f={};if("function"==typeof c&&(i||s.forEach&&!k(function(){(new c).entries().next()}))){var p=new c,d=p[l](i?{}:-0,1)!=p,h=k(function(){p.has(1)}),v=O(function(t){new c(t)}),y=!i&&k(function(){for(var t=new c,e=5;e--;)t[l](e,e);return!t.has(-0)});v||(((c=t(function(t,e){S(t,c,r);var n=P(new u,t,c);return null!=e&&E(e,o,n[l],n),n})).prototype=s).constructor=c),(h||y)&&(a("delete"),a("has"),o&&a("get")),(y||d)&&a(l),i&&s.clear&&delete s.clear}else c=n.getConstructor(t,r,o,l),w(c.prototype,e),x.NEED=!0;return T(c,r),f[r]=c,g(g.G+g.W+g.F*(c!=u),f),i||n.setStrong(c,r,o),c}},function(t,e,n){for(var r,o=n(3),i=n(21),a=n(43),u=a("typed_array"),c=a("view"),l=!(!o.ArrayBuffer||!o.DataView),s=l,f=0,p="Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array".split(",");f<9;)(r=o[p[f++]])?(i(r.prototype,u,!0),i(r.prototype,c,!0)):s=!1;t.exports={ABV:l,CONSTR:s,TYPED:u,VIEW:c}},function(t,e){t.exports=function(t){if("function"!=typeof t)throw TypeError(t+" is not a function!");return t}},function(t,e,n){"use strict";(function t(){if("undefined"!=typeof __REACT_DEVTOOLS_GLOBAL_HOOK__&&"function"==typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE)try{__REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(t)}catch(t){console.error(t)}})(),t.exports=n(410)},function(t,e){var n=0,r=Math.random();t.exports=function(t){return"Symbol(".concat(void 0===t?"":t,")_",(++n+r).toString(36))}},function(t,e,n){var r=n(36).f,o=n(54),i=n(17)("toStringTag");t.exports=function(t,e,n){t&&!o(t=n?t:t.prototype,i)&&r(t,i,{configurable:!0,value:e})}},function(t,e,n){var r=n(201),o=n(148);t.exports=Object.keys||function(t){return r(t,o)}},function(t,e,n){var r=n(140);t.exports=function(t){return Object(r(t))}},function(t,e,n){n(445);for(var r=n(16),o=n(52),i=n(63),a=n(17)("toStringTag"),u="CSSRuleList,CSSStyleDeclaration,CSSValueList,ClientRectList,DOMRectList,DOMStringList,DOMTokenList,DataTransferItemList,FileList,HTMLAllCollection,HTMLCollection,HTMLFormElement,HTMLSelectElement,MediaList,MimeTypeArray,NamedNodeMap,NodeList,PaintRequestList,Plugin,PluginArray,SVGLengthList,SVGNumberList,SVGPathSegList,SVGPointList,SVGStringList,SVGTransformList,SourceBufferList,StyleSheetList,TextTrackCueList,TextTrackList,TouchList".split(","),c=0;c<u.length;c++){var l=u[c],s=r[l],f=s&&s.prototype;f&&!f[a]&&o(f,a,l),i[l]=i.Array}},function(t,e,n){"use strict";t.exports=function(){}},function(t,e,n){"use strict";n.r(e);var r="Invariant failed";e.default=function(t,e){if(!t)throw new Error(r)}},function(t,e,n){var p=n(416);t.exports=a,t.exports.parse=r,t.exports.compile=function(t,e){return o(r(t,e))},t.exports.tokensToFunction=o,t.exports.tokensToRegExp=i;var _=new RegExp(["(\\\\.)","([\\/.])?(?:(?:\\:(\\w+)(?:\\(((?:\\\\.|[^\\\\()])+)\\))?|\\(((?:\\\\.|[^\\\\()])+)\\))([+*?])?|(\\*))"].join("|"),"g");function r(t,e){for(var n,r,o=[],i=0,a=0,u="",c=e&&e.delimiter||"/";null!=(n=_.exec(t));){var l=n[0],s=n[1],f=n.index;if(u+=t.slice(a,f),a=f+l.length,s)u+=s[1];else{var p=t[a],d=n[2],h=n[3],v=n[4],y=n[5],m=n[6],g=n[7];u&&(o.push(u),u="");var b=null!=d&&null!=p&&p!==d,w="+"===m||"*"===m,x="?"===m||"*"===m,E=n[2]||c,S=v||y;o.push({name:h||i++,prefix:d||"",delimiter:E,optional:x,repeat:w,partial:b,asterisk:!!g,pattern:S?(r=S,r.replace(/([=!:$\/()])/g,"\\$1")):g?".*":"[^"+k(E)+"]+?"})}}return a<t.length&&(u+=t.substr(a)),u&&o.push(u),o}function d(t){return encodeURI(t).replace(/[\/?#]/g,function(t){return"%"+t.charCodeAt(0).toString(16).toUpperCase()})}function o(s){for(var f=new Array(s.length),t=0;t<s.length;t++)"object"==typeof s[t]&&(f[t]=new RegExp("^(?:"+s[t].pattern+")$"));return function(t,e){for(var n="",r=t||{},o=(e||{}).pretty?d:encodeURIComponent,i=0;i<s.length;i++){var a=s[i];if("string"!=typeof a){var u,c=r[a.name];if(null==c){if(a.optional){a.partial&&(n+=a.prefix);continue}throw new TypeError('Expected "'+a.name+'" to be defined')}if(p(c)){if(!a.repeat)throw new TypeError('Expected "'+a.name+'" to not repeat, but received `'+JSON.stringify(c)+"`");if(0===c.length){if(a.optional)continue;throw new TypeError('Expected "'+a.name+'" to not be empty')}for(var l=0;l<c.length;l++){if(u=o(c[l]),!f[i].test(u))throw new TypeError('Expected all "'+a.name+'" to match "'+a.pattern+'", but received `'+JSON.stringify(u)+"`");n+=(0===l?a.prefix:a.delimiter)+u}}else{if(u=a.asterisk?encodeURI(c).replace(/[?#]/g,function(t){return"%"+t.charCodeAt(0).toString(16).toUpperCase()}):o(c),!f[i].test(u))throw new TypeError('Expected "'+a.name+'" to match "'+a.pattern+'", but received "'+u+'"');n+=a.prefix+u}}else n+=a}return n}}function k(t){return t.replace(/([.+*?=^!:${}()[\]|\/\\])/g,"\\$1")}function h(t,e){return t.keys=e,t}function v(t){return t.sensitive?"":"i"}function i(t,e,n){p(e)||(n=e||n,e=[]);for(var r=(n=n||{}).strict,o=!1!==n.end,i="",a=0;a<t.length;a++){var u=t[a];if("string"==typeof u)i+=k(u);else{var c=k(u.prefix),l="(?:"+u.pattern+")";e.push(u),u.repeat&&(l+="(?:"+c+l+")*"),i+=l=u.optional?u.partial?c+"("+l+")?":"(?:"+c+"("+l+"))?":c+"("+l+")"}}var s=k(n.delimiter||"/"),f=i.slice(-s.length)===s;return r||(i=(f?i.slice(0,-s.length):i)+"(?:"+s+"(?=$))?"),i+=o?"$":r&&f?"":"(?="+s+"|$)",h(new RegExp("^"+i,v(n)),e)}function a(t,e,n){return p(e)||(n=e||n,e=[]),n=n||{},t instanceof RegExp?function(t,e){var n=t.source.match(/\((?!\?)/g);if(n)for(var r=0;r<n.length;r++)e.push({name:r,prefix:null,delimiter:null,optional:!1,repeat:!1,partial:!1,asterisk:!1,pattern:null});return h(t,e)}(t,e):p(t)?function(t,e,n){for(var r=[],o=0;o<t.length;o++)r.push(a(t[o],e,n).source);return h(new RegExp("(?:"+r.join("|")+")",v(n)),e)}(t,e,n):function(t,e,n){return i(r(t,n),e,n)}(t,e,n)}},function(t,e,n){"use strict";var l={childContextTypes:!0,contextTypes:!0,defaultProps:!0,displayName:!0,getDefaultProps:!0,getDerivedStateFromProps:!0,mixins:!0,propTypes:!0,type:!0},s={name:!0,length:!0,prototype:!0,caller:!0,callee:!0,arguments:!0,arity:!0},f=Object.defineProperty,p=Object.getOwnPropertyNames,d=Object.getOwnPropertySymbols,h=Object.getOwnPropertyDescriptor,v=Object.getPrototypeOf,y=v&&v(Object);t.exports=function t(e,n,r){if("string"==typeof n)return e;if(y){var o=v(n);o&&o!==y&&t(e,o,r)}var i=p(n);d&&(i=i.concat(d(n)));for(var a=0;a<i.length;++a){var u=i[a];if(!(l[u]||s[u]||r&&r[u])){var c=h(n,u);try{f(e,u,c)}catch(t){}}}return e}},function(t,e,n){var r=n(6),o=n(3).document,i=r(o)&&r(o.createElement);t.exports=function(t){return i?o.createElement(t):{}}},function(t,e,n){e.f=n(8)},function(t,e,n){var r=n(90)("keys"),o=n(43);t.exports=function(t){return r[t]||(r[t]=o(t))}},function(t,e){t.exports="constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf".split(",")},function(t,e,n){var r=n(3).document;t.exports=r&&r.documentElement},function(t,e,o){function i(t,e){if(r(t),!n(e)&&null!==e)throw TypeError(e+": can't set as prototype!")}var n=o(6),r=o(5);t.exports={set:Object.setPrototypeOf||("__proto__"in{}?function(t,n,r){try{(r=o(25)(Function.call,o(28).f(Object.prototype,"__proto__").set,2))(t,[]),n=!(t instanceof Array)}catch(t){n=!0}return function(t,e){return i(t,e),n?t.__proto__=e:r(t,e),t}}({},!1):void 0),check:i}},function(t,e){t.exports="\t\n\v\f\r \u2028\u2029\ufeff"},function(t,e,n){var i=n(6),a=n(118).set;t.exports=function(t,e,n){var r,o=e.constructor;return o!==n&&"function"==typeof o&&(r=o.prototype)!==n.prototype&&i(r)&&a&&a(t,r),t}},function(t,e,n){"use strict";var o=n(27),i=n(33);t.exports=function(t){var e=String(i(this)),n="",r=o(t);if(r<0||r==1/0)throw RangeError("Count can't be negative");for(;0<r;(r>>>=1)&&(e+=e))1&r&&(n+=e);return n}},function(t,e){t.exports=Math.sign||function(t){return 0==(t=+t)||t!=t?t:t<0?-1:1}},function(t,e){var n=Math.expm1;t.exports=!n||22025.465794806718<n(10)||n(10)<22025.465794806718||-2e-17!=n(-2e-17)?function(t){return 0==(t=+t)?t:-1e-6<t&&t<1e-6?t+t*t/2:Math.exp(t)-1}:n},function(t,e,n){var c=n(27),l=n(33);t.exports=function(u){return function(t,e){var n,r,o=String(l(t)),i=c(e),a=o.length;return i<0||a<=i?u?"":void 0:(n=o.charCodeAt(i))<55296||56319<n||i+1===a||(r=o.charCodeAt(i+1))<56320||57343<r?u?o.charAt(i):n:u?o.slice(i,i+2):r-56320+(n-55296<<10)+65536}}},function(t,e,n){"use strict";function b(){return this}var w=n(44),x=n(1),E=n(18),S=n(21),_=n(59),k=n(172),O=n(57),T=n(49),P=n(8)("iterator"),C=!([].keys&&"next"in[].keys()),j="values";t.exports=function(t,e,n,r,o,i,a){k(n,e,r);function u(t){if(!C&&t in h)return h[t];switch(t){case"keys":case j:return function(){return new n(this,t)}}return function(){return new n(this,t)}}var c,l,s,f=e+" Iterator",p=o==j,d=!1,h=t.prototype,v=h[P]||h["@@iterator"]||o&&h[o],y=v||u(o),m=o?p?u("entries"):y:void 0,g="Array"==e&&h.entries||v;if(g&&(s=T(g.call(new t)))!==Object.prototype&&s.next&&(O(s,f,!0),w||"function"==typeof s[P]||S(s,P,b)),p&&v&&v.name!==j&&(d=!0,y=function(){return v.call(this)}),w&&!a||!C&&!d&&h[P]||S(h,P,y),_[e]=y,_[f]=b,o)if(c={values:p?y:u(j),keys:i?y:u("keys"),entries:m},a)for(l in c)l in h||E(h,l,c[l]);else x(x.P+x.F*(C||d),e,c);return c}},function(t,e,n){var r=n(127),o=n(33);t.exports=function(t,e,n){if(r(e))throw TypeError("String#"+n+" doesn't accept regex!");return String(o(t))}},function(t,e,n){var r=n(6),o=n(32),i=n(8)("match");t.exports=function(t){var e;return r(t)&&(void 0!==(e=t[i])?!!e:"RegExp"==o(t))}},function(t,e,n){var r=n(8)("match");t.exports=function(e){var n=/./;try{"/./"[e](n)}catch(t){try{return n[r]=!1,!"/./"[e](n)}catch(t){}}return!0}},function(t,e,n){var r=n(59),o=n(8)("iterator"),i=Array.prototype;t.exports=function(t){return void 0!==t&&(r.Array===t||i[o]===t)}},function(t,e,n){"use strict";var r=n(13),o=n(42);t.exports=function(t,e,n){e in t?r.f(t,e,o(0,n)):t[e]=n}},function(t,e,n){var r=n(76),o=n(8)("iterator"),i=n(59);t.exports=n(11).getIteratorMethod=function(t){if(null!=t)return t[o]||t["@@iterator"]||i[r(t)]}},function(t,e,n){"use strict";var l=n(15),s=n(46),f=n(9);t.exports=function(t,e,n){for(var r=l(this),o=f(r.length),i=arguments.length,a=s(1<i?e:void 0,o),u=2<i?n:void 0,c=void 0===u?o:s(u,o);a<c;)r[a++]=t;return r}},function(t,e,n){"use strict";var r=n(50),o=n(177),i=n(59),a=n(22);t.exports=n(125)(Array,"Array",function(t,e){this._t=a(t),this._i=0,this._k=e},function(){var t=this._t,e=this._k,n=this._i++;return!t||n>=t.length?(this._t=void 0,o(1)):o(0,"keys"==e?n:"values"==e?t[n]:[n,t[n]])},"values"),i.Arguments=i.Array,r("keys"),r("values"),r("entries")},function(t,e,n){"use strict";var r,o,a=n(95),u=RegExp.prototype.exec,c=String.prototype.replace,i=u,l="lastIndex",s=(r=/a/,o=/b*/g,u.call(r,"a"),u.call(o,"a"),0!==r[l]||0!==o[l]),f=void 0!==/()??/.exec("")[1];(s||f)&&(i=function(t){var e,n,r,o,i=this;return f&&(n=new RegExp("^"+i.source+"$(?!\\s)",a.call(i))),s&&(e=i[l]),r=u.call(i,t),s&&r&&(i[l]=i.global?r.index+r[0].length:e),f&&r&&1<r.length&&c.call(r[0],n,function(){for(o=1;o<arguments.length-2;o++)void 0===arguments[o]&&(r[o]=void 0)}),r}),t.exports=i},function(t,e,n){"use strict";var r=n(124)(!0);t.exports=function(t,e,n){return e+(n?r(t,e).length:1)}},function(t,e,n){function r(){var t=+this;if(b.hasOwnProperty(t)){var e=b[t];delete b[t],e()}}function o(t){r.call(t.data)}var i,a,u,c=n(25),l=n(166),s=n(117),f=n(113),p=n(3),d=p.process,h=p.setImmediate,v=p.clearImmediate,y=p.MessageChannel,m=p.Dispatch,g=0,b={},w="onreadystatechange";h&&v||(h=function(t){for(var e=[],n=1;n<arguments.length;)e.push(arguments[n++]);return b[++g]=function(){l("function"==typeof t?t:Function(t),e)},i(g),g},v=function(t){delete b[t]},"process"==n(32)(d)?i=function(t){d.nextTick(c(r,t,1))}:m&&m.now?i=function(t){m.now(c(r,t,1))}:y?(u=(a=new y).port2,a.port1.onmessage=o,i=c(u.postMessage,u,1)):p.addEventListener&&"function"==typeof postMessage&&!p.importScripts?(i=function(t){p.postMessage(t+"","*")},p.addEventListener("message",o,!1)):i=w in f("script")?function(t){s.appendChild(f("script"))[w]=function(){s.removeChild(this),r.call(t)}}:function(t){setTimeout(c(r,t,1),0)}),t.exports={set:h,clear:v}},function(t,e,n){"use strict";var r=n(3),o=n(12),i=n(44),a=n(101),u=n(21),c=n(62),l=n(4),s=n(61),f=n(27),p=n(9),d=n(185),h=n(48).f,v=n(13).f,y=n(132),m=n(57),g="ArrayBuffer",b="DataView",w="prototype",x="Wrong index!",E=r[g],S=r[b],_=r.Math,k=r.RangeError,O=r.Infinity,T=E,P=_.abs,C=_.pow,j=_.floor,R=_.log,A=_.LN2,N="byteLength",M="byteOffset",L=o?"_b":"buffer",I=o?"_l":N,F=o?"_o":M;function U(t,e,n){var r,o,i,a=new Array(n),u=8*n-e-1,c=(1<<u)-1,l=c>>1,s=23===e?C(2,-24)-C(2,-77):0,f=0,p=t<0||0===t&&1/t<0?1:0;for((t=P(t))!=t||t===O?(o=t!=t?1:0,r=c):(r=j(R(t)/A),t*(i=C(2,-r))<1&&(r--,i*=2),2<=(t+=1<=r+l?s/i:s*C(2,1-l))*i&&(r++,i/=2),c<=r+l?(o=0,r=c):1<=r+l?(o=(t*i-1)*C(2,e),r+=l):(o=t*C(2,l-1)*C(2,e),r=0));8<=e;a[f++]=255&o,o/=256,e-=8);for(r=r<<e|o,u+=e;0<u;a[f++]=255&r,r/=256,u-=8);return a[--f]|=128*p,a}function D(t,e,n){var r,o=8*n-e-1,i=(1<<o)-1,a=i>>1,u=o-7,c=n-1,l=t[c--],s=127&l;for(l>>=7;0<u;s=256*s+t[c],c--,u-=8);for(r=s&(1<<-u)-1,s>>=-u,u+=e;0<u;r=256*r+t[c],c--,u-=8);if(0===s)s=1-a;else{if(s===i)return r?NaN:l?-O:O;r+=C(2,e),s-=a}return(l?-1:1)*r*C(2,s-e)}function W(t){return t[3]<<24|t[2]<<16|t[1]<<8|t[0]}function z(t){return[255&t]}function H(t){return[255&t,t>>8&255]}function q(t){return[255&t,t>>8&255,t>>16&255,t>>24&255]}function B(t){return U(t,52,8)}function V(t){return U(t,23,4)}function $(t,e,n){v(t[w],e,{get:function(){return this[n]}})}function G(t,e,n,r){var o=d(+n);if(o+e>t[I])throw k(x);var i=t[L]._b,a=o+t[F],u=i.slice(a,a+e);return r?u:u.reverse()}function Y(t,e,n,r,o,i){var a=d(+n);if(a+e>t[I])throw k(x);for(var u=t[L]._b,c=a+t[F],l=r(+o),s=0;s<e;s++)u[c+s]=l[i?s:e-s-1]}if(a.ABV){if(!l(function(){E(1)})||!l(function(){new E(-1)})||l(function(){return new E,new E(1.5),new E(NaN),E.name!=g})){for(var K,Q=(E=function(t){return s(this,E),new T(d(t))})[w]=T[w],X=h(T),J=0;X.length>J;)(K=X[J++])in E||u(E,K,T[K]);i||(Q.constructor=E)}var Z=new S(new E(2)),tt=S[w].setInt8;Z.setInt8(0,2147483648),Z.setInt8(1,2147483649),!Z.getInt8(0)&&Z.getInt8(1)||c(S[w],{setInt8:function(t,e){tt.call(this,t,e<<24>>24)},setUint8:function(t,e){tt.call(this,t,e<<24>>24)}},!0)}else E=function(t){s(this,E,g);var e=d(t);this._b=y.call(new Array(e),0),this[I]=e},S=function(t,e,n){s(this,S,b),s(t,E,b);var r=t[I],o=f(e);if(o<0||r<o)throw k("Wrong offset!");if(r<o+(n=void 0===n?r-o:p(n)))throw k("Wrong length!");this[L]=t,this[F]=o,this[I]=n},o&&($(E,N,"_l"),$(S,"buffer","_b"),$(S,N,"_l"),$(S,M,"_o")),c(S[w],{getInt8:function(t){return G(this,1,t)[0]<<24>>24},getUint8:function(t){return G(this,1,t)[0]},getInt16:function(t,e){var n=G(this,2,t,e);return(n[1]<<8|n[0])<<16>>16},getUint16:function(t,e){var n=G(this,2,t,e);return n[1]<<8|n[0]},getInt32:function(t,e){return W(G(this,4,t,e))},getUint32:function(t,e){return W(G(this,4,t,e))>>>0},getFloat32:function(t,e){return D(G(this,4,t,e),23,4)},getFloat64:function(t,e){return D(G(this,8,t,e),52,8)},setInt8:function(t,e){Y(this,1,t,z,e)},setUint8:function(t,e){Y(this,1,t,z,e)},setInt16:function(t,e,n){Y(this,2,t,H,e,n)},setUint16:function(t,e,n){Y(this,2,t,H,e,n)},setInt32:function(t,e,n){Y(this,4,t,q,e,n)},setUint32:function(t,e,n){Y(this,4,t,q,e,n)},setFloat32:function(t,e,n){Y(this,4,t,V,e,n)},setFloat64:function(t,e,n){Y(this,8,t,B,e,n)}});m(E,g),m(S,b),u(S[w],a.VIEW,!0),e[g]=E,e[b]=S},function(t,e,n){var r=n(53),o=n(16).document,i=r(o)&&r(o.createElement);t.exports=function(t){return i?o.createElement(t):{}}},function(t,e,n){var o=n(53);t.exports=function(t,e){if(!o(t))return t;var n,r;if(e&&"function"==typeof(n=t.toString)&&!o(r=n.call(t)))return r;if("function"==typeof(n=t.valueOf)&&!o(r=n.call(t)))return r;if(!e&&"function"==typeof(n=t.toString)&&!o(r=n.call(t)))return r;throw TypeError("Can't convert object to primitive value")}},function(t,e){t.exports=function(t){if(null==t)throw TypeError("Can't call method on "+t);return t}},function(t,e){e.f={}.propertyIsEnumerable},function(t,e,n){var r=n(14),o=n(16),i="__core-js_shared__",a=o[i]||(o[i]={});(t.exports=function(t,e){return a[t]||(a[t]=void 0!==e?e:{})})("versions",[]).push({version:r.version,mode:n(83)?"pure":"global",copyright:"© 2019 Denis Pushkarev (zloirock.ru)"})},function(t,e,n){e.f=n(17)},function(t,e,n){var r=n(16),o=n(14),i=n(83),a=n(143),u=n(36).f;t.exports=function(t){var e=o.Symbol||(o.Symbol=i?{}:r.Symbol||{});"_"==t.charAt(0)||t in e||u(e,t,{value:a.f(t)})}},function(t,e,n){var r=n(146),o=Math.min;t.exports=function(t){return 0<t?o(r(t),9007199254740991):0}},function(t,e){var n=Math.ceil,r=Math.floor;t.exports=function(t){return isNaN(t=+t)?0:(0<t?r:n)(t)}},function(t,e,n){var r=n(142)("keys"),o=n(104);t.exports=function(t){return r[t]||(r[t]=o(t))}},function(t,e){t.exports="constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf".split(",")},function(t,e,n){var r=n(150),o=n(17)("iterator"),i=n(63);t.exports=n(14).getIteratorMethod=function(t){if(null!=t)return t[o]||t["@@iterator"]||i[r(t)]}},function(t,e,n){var o=n(82),i=n(17)("toStringTag"),a="Arguments"==o(function(){return arguments}());t.exports=function(t){var e,n,r;return void 0===t?"Undefined":null===t?"Null":"string"==typeof(n=function(t,e){try{return t[e]}catch(t){}}(e=Object(t),i))?n:a?o(e):"Object"==(r=o(e))&&"function"==typeof e.callee?"Arguments":r}},function(t,e,n){t.exports=n(197)},function(t,e,n){"use strict";e.__esModule=!0,e.buffers=e.BUFFER_OVERFLOW=void 0;var r=n(38),f=e.BUFFER_OVERFLOW="Channel's Buffer overflow!",o={isEmpty:r.kTrue,put:r.noop,take:r.noop};function i(t,e){function n(t){u[l]=t,l=(l+1)%i,c++}function r(){if(0!=c){var t=u[s];return u[s]=null,c--,s=(s+1)%i,t}}function o(){for(var t=[];c;)t.push(r());return t}var i=0<arguments.length&&void 0!==t?t:10,a=e,u=new Array(i),c=0,l=0,s=0;return{isEmpty:function(){return 0==c},put:function(t){if(c<i)n(t);else{var e=void 0;switch(a){case 1:throw new Error(f);case 3:u[l]=t,s=l=(l+1)%i;break;case 4:e=2*i,u=o(),c=u.length,l=u.length,s=0,u.length=e,i=e,n(t)}}},take:r,flush:o}}e.buffers={none:function(){return o},fixed:function(t){return i(t,1)},dropping:function(t){return i(t,2)},sliding:function(t){return i(t,3)},expanding:function(t){return i(t,4)}}},function(t,e,n){var r=n(486),o=n(487),i=n(490);t.exports=function(t){return r(t)||o(t)||i()}},function(t,e,n){"use strict";e.__esModule=!0,e.qEnd=void 0,e.safeName=function(t){return r.is.channel(t)?"channel":Array.isArray(t)?String(t.map(function(t){return String(t)})):String(t)},e.default=function(a,t){var e=2<arguments.length&&void 0!==arguments[2]?arguments[2]:"iterator",u=void 0,c=t;function n(t,e){if(c===s)return l;if(e)throw c=s,e;u&&u(t);var n=a[c](),r=n[0],o=n[1],i=n[2];return u=i,(c=r)===s?l:o}return(0,r.makeIterator)(n,function(t){return n(null,t)},e,!0)};var r=n(38),l={done:!0,value:void 0},s=e.qEnd={}},function(t,e,n){"use strict";var o=n(102);function r(t){var n,r;this.promise=new t(function(t,e){if(void 0!==n||void 0!==r)throw TypeError("Bad Promise constructor");n=t,r=e}),this.resolve=o(n),this.reject=o(r)}t.exports.f=function(t){return new r(t)}},function(t,e,n){"use strict";function d(t){return"/"===t.charAt(0)}function h(t,e){for(var n=e,r=n+1,o=t.length;r<o;n+=1,r+=1)t[n]=t[r];t.pop()}n.r(e),e.default=function(t){var e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:"",n=t&&t.split("/")||[],r=e&&e.split("/")||[],o=t&&d(t),i=e&&d(e),a=o||i;if(t&&d(t)?r=n:n.length&&(r.pop(),r=r.concat(n)),!r.length)return"/";var u=void 0;if(r.length){var c=r[r.length-1];u="."===c||".."===c||""===c}else u=!1;for(var l=0,s=r.length;0<=s;s--){var f=r[s];"."===f?h(r,s):".."===f?(h(r,s),l++):l&&(h(r,s),l--)}if(!a)for(;l--;)r.unshift("..");!a||""===r[0]||r[0]&&d(r[0])||r.unshift("");var p=r.join("/");return u&&"/"!==p.substr(-1)&&(p+="/"),p}},function(t,e,n){"use strict";n.r(e);var c="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t};e.default=function n(e,r){if(e===r)return!0;if(null==e||null==r)return!1;if(Array.isArray(e))return Array.isArray(r)&&e.length===r.length&&e.every(function(t,e){return n(t,r[e])});var t=void 0===e?"undefined":c(e);if(t!==(void 0===r?"undefined":c(r)))return!1;if("object"!==t)return!1;var o=e.valueOf(),i=r.valueOf();if(o!==e||i!==r)return n(o,i);var a=Object.keys(e),u=Object.keys(r);return a.length===u.length&&a.every(function(t){return n(e[t],r[t])})}},function(t,e,n){t.exports=!n(12)&&!n(4)(function(){return 7!=Object.defineProperty(n(113)("div"),"a",{get:function(){return 7}}).a})},function(t,e,n){var r=n(3),o=n(11),i=n(44),a=n(114),u=n(13).f;t.exports=function(t){var e=o.Symbol||(o.Symbol=i?{}:r.Symbol||{});"_"==t.charAt(0)||t in e||u(e,t,{value:a.f(t)})}},function(t,e,n){var a=n(20),u=n(22),c=n(91)(!1),l=n(115)("IE_PROTO");t.exports=function(t,e){var n,r=u(t),o=0,i=[];for(n in r)n!=l&&a(r,n)&&i.push(n);for(;e.length>o;)a(r,n=e[o++])&&(~c(i,n)||i.push(n));return i}},function(t,e,n){var a=n(13),u=n(5),c=n(45);t.exports=n(12)?Object.defineProperties:function(t,e){u(t);for(var n,r=c(e),o=r.length,i=0;i<o;)a.f(t,n=r[i++],e[n]);return t}},function(t,e,n){var r=n(22),o=n(48).f,i={}.toString,a="object"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];t.exports.f=function(t){return a&&"[object Window]"==i.call(t)?function(t){try{return o(t)}catch(t){return a.slice()}}(t):o(r(t))}},function(t,e,n){"use strict";var p=n(12),d=n(45),h=n(92),v=n(75),y=n(15),m=n(74),o=Object.assign;t.exports=!o||n(4)(function(){var t={},e={},n=Symbol(),r="abcdefghijklmnopqrst";return t[n]=7,r.split("").forEach(function(t){e[t]=t}),7!=o({},t)[n]||Object.keys(o({},e)).join("")!=r})?function(t,e){for(var n=y(t),r=arguments.length,o=1,i=h.f,a=v.f;o<r;)for(var u,c=m(arguments[o++]),l=i?d(c).concat(i(c)):d(c),s=l.length,f=0;f<s;)u=l[f++],p&&!a.call(c,u)||(n[u]=c[u]);return n}:o},function(t,e){t.exports=Object.is||function(t,e){return t===e?0!==t||1/t==1/e:t!=t&&e!=e}},function(t,e,n){"use strict";var i=n(26),a=n(6),u=n(166),c=[].slice,l={};t.exports=Function.bind||function(e){var n=i(this),r=c.call(arguments,1),o=function(){var t=r.concat(c.call(arguments));return this instanceof o?function(t,e,n){if(!(e in l)){for(var r=[],o=0;o<e;o++)r[o]="a["+o+"]";l[e]=Function("F,a","return new F("+r.join(",")+")")}return l[e](t,n)}(n,t.length,t):u(n,t,e)};return a(n.prototype)&&(o.prototype=n.prototype),o}},function(t,e){t.exports=function(t,e,n){var r=void 0===n;switch(e.length){case 0:return r?t():t.call(n);case 1:return r?t(e[0]):t.call(n,e[0]);case 2:return r?t(e[0],e[1]):t.call(n,e[0],e[1]);case 3:return r?t(e[0],e[1],e[2]):t.call(n,e[0],e[1],e[2]);case 4:return r?t(e[0],e[1],e[2],e[3]):t.call(n,e[0],e[1],e[2],e[3])}return t.apply(n,e)}},function(t,e,n){var r=n(3).parseInt,o=n(58).trim,i=n(119),a=/^[-+]?0[xX]/;t.exports=8!==r(i+"08")||22!==r(i+"0x16")?function(t,e){var n=o(String(t),3);return r(n,e>>>0||(a.test(n)?16:10))}:r},function(t,e,n){var r=n(3).parseFloat,o=n(58).trim;t.exports=1/r(n(119)+"-0")!=-1/0?function(t){var e=o(String(t),3),n=r(e);return 0===n&&"-"==e.charAt(0)?-0:n}:r},function(t,e,n){var r=n(32);t.exports=function(t,e){if("number"!=typeof t&&"Number"!=r(t))throw TypeError(e);return+t}},function(t,e,n){var r=n(6),o=Math.floor;t.exports=function(t){return!r(t)&&isFinite(t)&&o(t)===t}},function(t,e){t.exports=Math.log1p||function(t){return-1e-8<(t=+t)&&t<1e-8?t-t*t/2:Math.log(1+t)}},function(t,e,n){"use strict";var r=n(47),o=n(42),i=n(57),a={};n(21)(a,n(8)("iterator"),function(){return this}),t.exports=function(t,e,n){t.prototype=r(a,{next:o(1,n)}),i(t,e+" Iterator")}},function(t,e,n){var i=n(5);t.exports=function(e,t,n,r){try{return r?t(i(n)[0],n[1]):t(n)}catch(t){var o=e.return;throw void 0!==o&&i(o.call(e)),t}}},function(t,e,n){var r=n(330);t.exports=function(t,e){return new(r(t))(e)}},function(t,e,n){var s=n(26),f=n(15),p=n(74),d=n(9);t.exports=function(t,e,n,r,o){s(e);var i=f(t),a=p(i),u=d(i.length),c=o?u-1:0,l=o?-1:1;if(n<2)for(;;){if(c in a){r=a[c],c+=l;break}if(c+=l,o?c<0:u<=c)throw TypeError("Reduce of empty array with no initial value")}for(;o?0<=c:c<u;c+=l)c in a&&(r=e(r,a[c],c,i));return r}},function(t,e,n){"use strict";var s=n(15),f=n(46),p=n(9);t.exports=[].copyWithin||function(t,e,n){var r=s(this),o=p(r.length),i=f(t,o),a=f(e,o),u=2<arguments.length?n:void 0,c=Math.min((void 0===u?o:f(u,o))-a,o-i),l=1;for(a<i&&i<a+c&&(l=-1,a+=c-1,i+=c-1);0<c--;)a in r?r[i]=r[a]:delete r[i],i+=l,a+=l;return r}},function(t,e){t.exports=function(t,e){return{value:e,done:!!t}}},function(t,e,n){"use strict";var r=n(134);n(1)({target:"RegExp",proto:!0,forced:r!==/./.exec},{exec:r})},function(t,e,n){n(12)&&"g"!=/./g.flags&&n(13).f(RegExp.prototype,"flags",{configurable:!0,get:n(95)})},function(t,e,n){"use strict";function r(){}function f(t){var e;return!(!y(t)||"function"!=typeof(e=t.then))&&e}function o(s,n){if(!s._n){s._n=!0;var r=s._c;E(function(){for(var c=s._v,l=1==s._s,t=0,e=function(t){var e,n,r,o=l?t.ok:t.fail,i=t.resolve,a=t.reject,u=t.domain;try{o?(l||(2==s._h&&U(s),s._h=1),!0===o?e=c:(u&&u.enter(),e=o(c),u&&(u.exit(),r=!0)),e===t.promise?a(P("Promise-chain cycle")):(n=f(e))?n.call(e,i,a):i(e)):a(c)}catch(t){u&&!r&&u.exit(),a(t)}};r.length>t;)e(r[t++]);s._c=[],s._n=!1,n&&!s._h&&I(s)})}}function i(t){var e=this;e._d||(e._d=!0,(e=e._w||e)._v=t,e._s=2,e._a||(e._a=e._c.slice()),o(e,!0))}var a,u,c,l,s=n(44),p=n(3),d=n(25),h=n(76),v=n(1),y=n(6),m=n(26),g=n(61),b=n(98),w=n(77),x=n(136).set,E=n(350)(),S=n(181),_=n(351),k=n(99),O=n(182),T="Promise",P=p.TypeError,C=p.process,j=C&&C.versions,R=j&&j.v8||"",A=p[T],N="process"==h(C),M=u=S.f,L=!!function(){try{var t=A.resolve(1),e=(t.constructor={})[n(8)("species")]=function(t){t(r,r)};return(N||"function"==typeof PromiseRejectionEvent)&&t.then(r)instanceof e&&0!==R.indexOf("6.6")&&-1===k.indexOf("Chrome/66")}catch(t){}}(),I=function(i){x.call(p,function(){var t,e,n,r=i._v,o=F(i);if(o&&(t=_(function(){N?C.emit("unhandledRejection",r,i):(e=p.onunhandledrejection)?e({promise:i,reason:r}):(n=p.console)&&n.error&&n.error("Unhandled promise rejection",r)}),i._h=N||F(i)?2:1),i._a=void 0,o&&t.e)throw t.v})},F=function(t){return 1!==t._h&&0===(t._a||t._c).length},U=function(e){x.call(p,function(){var t;N?C.emit("rejectionHandled",e):(t=p.onrejectionhandled)&&t({promise:e,reason:e._v})})},D=function(t){var n,r=this;if(!r._d){r._d=!0,r=r._w||r;try{if(r===t)throw P("Promise can't be resolved itself");(n=f(t))?E(function(){var e={_w:r,_d:!1};try{n.call(t,d(D,e,1),d(i,e,1))}catch(t){i.call(e,t)}}):(r._v=t,r._s=1,o(r,!1))}catch(t){i.call({_w:r,_d:!1},t)}}};L||(A=function(t){g(this,A,T,"_h"),m(t),a.call(this);try{t(d(D,this,1),d(i,this,1))}catch(t){i.call(this,t)}},(a=function(t){this._c=[],this._a=void 0,this._s=0,this._d=!1,this._v=void 0,this._h=0,this._n=!1}).prototype=n(62)(A.prototype,{then:function(t,e){var n=M(w(this,A));return n.ok="function"!=typeof t||t,n.fail="function"==typeof e&&e,n.domain=N?C.domain:void 0,this._c.push(n),this._a&&this._a.push(n),this._s&&o(this,!1),n.promise},catch:function(t){return this.then(void 0,t)}}),c=function(){var t=new a;this.promise=t,this.resolve=d(D,t,1),this.reject=d(i,t,1)},S.f=M=function(t){return t===A||t===l?new c(t):u(t)}),v(v.G+v.W+v.F*!L,{Promise:A}),n(57)(A,T),n(60)(T),l=n(11)[T],v(v.S+v.F*!L,T,{reject:function(t){var e=M(this);return(0,e.reject)(t),e.promise}}),v(v.S+v.F*(s||!L),T,{resolve:function(t){return O(s&&this===l?A:this,t)}}),v(v.S+v.F*!(L&&n(94)(function(t){A.all(t).catch(r)})),T,{all:function(t){var a=this,e=M(a),u=e.resolve,c=e.reject,n=_(function(){var r=[],o=0,i=1;b(t,!1,function(t){var e=o++,n=!1;r.push(void 0),i++,a.resolve(t).then(function(t){n||(n=!0,r[e]=t,--i||u(r))},c)}),--i||u(r)});return n.e&&c(n.v),e.promise},race:function(t){var e=this,n=M(e),r=n.reject,o=_(function(){b(t,!1,function(t){e.resolve(t).then(n.resolve,r)})});return o.e&&r(o.v),n.promise}})},function(t,e,n){"use strict";var o=n(26);function r(t){var n,r;this.promise=new t(function(t,e){if(void 0!==n||void 0!==r)throw TypeError("Bad Promise constructor");n=t,r=e}),this.resolve=o(n),this.reject=o(r)}t.exports.f=function(t){return new r(t)}},function(t,e,n){var r=n(5),o=n(6),i=n(181);t.exports=function(t,e){if(r(t),o(e)&&e.constructor===t)return e;var n=i.f(t);return(0,n.resolve)(e),n.promise}},function(t,e,n){"use strict";function a(t,e){var n,r=h(e);if("F"!==r)return t._i[r];for(n=t._f;n;n=n.n)if(n.k==e)return n}var u=n(13).f,c=n(47),l=n(62),s=n(25),f=n(61),p=n(98),r=n(125),o=n(177),i=n(60),d=n(12),h=n(40).fastKey,v=n(51),y=d?"_s":"size";t.exports={getConstructor:function(t,i,n,r){var o=t(function(t,e){f(t,o,i,"_i"),t._t=i,t._i=c(null),t._f=void 0,t._l=void 0,t[y]=0,null!=e&&p(e,n,t[r],t)});return l(o.prototype,{clear:function(){for(var t=v(this,i),e=t._i,n=t._f;n;n=n.n)n.r=!0,n.p&&(n.p=n.p.n=void 0),delete e[n.i];t._f=t._l=void 0,t[y]=0},delete:function(t){var e=v(this,i),n=a(e,t);if(n){var r=n.n,o=n.p;delete e._i[n.i],n.r=!0,o&&(o.n=r),r&&(r.p=o),e._f==n&&(e._f=r),e._l==n&&(e._l=o),e[y]--}return!!n},forEach:function(t,e){v(this,i);for(var n,r=s(t,1<arguments.length?e:void 0,3);n=n?n.n:this._f;)for(r(n.v,n.k,this);n&&n.r;)n=n.p},has:function(t){return!!a(v(this,i),t)}}),d&&u(o.prototype,"size",{get:function(){return v(this,i)[y]}}),o},def:function(t,e,n){var r,o,i=a(t,e);return i?i.v=n:(t._l=i={i:o=h(e,!0),k:e,v:n,p:r=t._l,n:void 0,r:!1},t._f||(t._f=i),r&&(r.n=i),t[y]++,"F"!==o&&(t._i[o]=i)),t},getEntry:a,setStrong:function(t,n,e){r(t,n,function(t,e){this._t=v(t,n),this._k=e,this._l=void 0},function(){for(var t=this,e=t._k,n=t._l;n&&n.r;)n=n.p;return t._t&&(t._l=n=n?n.n:t._t._f)?o(0,"keys"==e?n.k:"values"==e?n.v:[n.k,n.v]):(t._t=void 0,o(1))},e?"entries":"values",!e,!0),i(n)}}},function(t,e,n){"use strict";function a(t){return t._l||(t._l=new m)}function r(t,e){return h(t.a,function(t){return t[0]===e})}var u=n(62),c=n(40).getWeak,o=n(5),l=n(6),s=n(61),f=n(98),i=n(30),p=n(20),d=n(51),h=i(5),v=i(6),y=0,m=function(){this.a=[]};m.prototype={get:function(t){var e=r(this,t);if(e)return e[1]},has:function(t){return!!r(this,t)},set:function(t,e){var n=r(this,t);n?n[1]=e:this.a.push([t,e])},delete:function(e){var t=v(this.a,function(t){return t[0]===e});return~t&&this.a.splice(t,1),!!~t}},t.exports={getConstructor:function(t,n,r,o){var i=t(function(t,e){s(t,i,n,"_i"),t._t=n,t._i=y++,t._l=void 0,null!=e&&f(e,r,t[o],t)});return u(i.prototype,{delete:function(t){if(!l(t))return!1;var e=c(t);return!0===e?a(d(this,n)).delete(t):e&&p(e,this._i)&&delete e[this._i]},has:function(t){if(!l(t))return!1;var e=c(t);return!0===e?a(d(this,n)).has(t):e&&p(e,this._i)}}),i},def:function(t,e,n){var r=c(o(e),!0);return!0===r?a(t).set(e,n):r[t._i]=n,t},ufstore:a}},function(t,e,n){var r=n(27),o=n(9);t.exports=function(t){if(void 0===t)return 0;var e=r(t),n=o(e);if(e!==n)throw RangeError("Wrong length!");return n}},function(t,e,n){var r=n(48),o=n(92),i=n(5),a=n(3).Reflect;t.exports=a&&a.ownKeys||function(t){var e=r.f(i(t)),n=o.f;return n?e.concat(n(t)):e}},function(t,e,n){var s=n(9),f=n(121),p=n(33);t.exports=function(t,e,n,r){var o=String(p(t)),i=o.length,a=void 0===n?" ":String(n),u=s(e);if(u<=i||""==a)return o;var c=u-i,l=f.call(a,Math.ceil(c/a.length));return l.length>c&&(l=l.slice(0,c)),r?l+o:o+l}},function(t,e,n){var c=n(12),l=n(45),s=n(22),f=n(75).f;t.exports=function(u){return function(t){for(var e,n=s(t),r=l(n),o=r.length,i=0,a=[];i<o;)e=r[i++],c&&!f.call(n,e)||a.push(u?[e,n[e]]:n[e]);return a}}},function(t,e,n){var r=function(i){"use strict";var c,t=Object.prototype,l=t.hasOwnProperty,e="function"==typeof Symbol?Symbol:{},o=e.iterator||"@@iterator",n=e.asyncIterator||"@@asyncIterator",r=e.toStringTag||"@@toStringTag";function a(t,e,n,r){var o=e&&e.prototype instanceof u?e:u,i=Object.create(o.prototype),a=new T(r||[]);return i._invoke=function(i,a,u){var c=f;return function(t,e){if(c===d)throw new Error("Generator is already running");if(c===h){if("throw"===t)throw e;return C()}for(u.method=t,u.arg=e;;){var n=u.delegate;if(n){var r=_(n,u);if(r){if(r===v)continue;return r}}if("next"===u.method)u.sent=u._sent=u.arg;else if("throw"===u.method){if(c===f)throw c=h,u.arg;u.dispatchException(u.arg)}else"return"===u.method&&u.abrupt("return",u.arg);c=d;var o=s(i,a,u);if("normal"===o.type){if(c=u.done?h:p,o.arg===v)continue;return{value:o.arg,done:u.done}}"throw"===o.type&&(c=h,u.method="throw",u.arg=o.arg)}}}(t,n,a),i}function s(t,e,n){try{return{type:"normal",arg:t.call(e,n)}}catch(t){return{type:"throw",arg:t}}}i.wrap=a;var f="suspendedStart",p="suspendedYield",d="executing",h="completed",v={};function u(){}function y(){}function m(){}var g={};g[o]=function(){return this};var b=Object.getPrototypeOf,w=b&&b(b(P([])));w&&w!==t&&l.call(w,o)&&(g=w);var x=m.prototype=u.prototype=Object.create(g);function E(t){["next","throw","return"].forEach(function(e){t[e]=function(t){return this._invoke(e,t)}})}function S(c){var e;this._invoke=function(n,r){function t(){return new Promise(function(t,e){!function e(t,n,r,o){var i=s(c[t],c,n);if("throw"!==i.type){var a=i.arg,u=a.value;return u&&"object"==typeof u&&l.call(u,"__await")?Promise.resolve(u.__await).then(function(t){e("next",t,r,o)},function(t){e("throw",t,r,o)}):Promise.resolve(u).then(function(t){a.value=t,r(a)},function(t){return e("throw",t,r,o)})}o(i.arg)}(n,r,t,e)})}return e=e?e.then(t,t):t()}}function _(t,e){var n=t.iterator[e.method];if(n===c){if(e.delegate=null,"throw"===e.method){if(t.iterator.return&&(e.method="return",e.arg=c,_(t,e),"throw"===e.method))return v;e.method="throw",e.arg=new TypeError("The iterator does not provide a 'throw' method")}return v}var r=s(n,t.iterator,e.arg);if("throw"===r.type)return e.method="throw",e.arg=r.arg,e.delegate=null,v;var o=r.arg;return o?o.done?(e[t.resultName]=o.value,e.next=t.nextLoc,"return"!==e.method&&(e.method="next",e.arg=c),e.delegate=null,v):o:(e.method="throw",e.arg=new TypeError("iterator result is not an object"),e.delegate=null,v)}function k(t){var e={tryLoc:t[0]};1 in t&&(e.catchLoc=t[1]),2 in t&&(e.finallyLoc=t[2],e.afterLoc=t[3]),this.tryEntries.push(e)}function O(t){var e=t.completion||{};e.type="normal",delete e.arg,t.completion=e}function T(t){this.tryEntries=[{tryLoc:"root"}],t.forEach(k,this),this.reset(!0)}function P(e){if(e){var t=e[o];if(t)return t.call(e);if("function"==typeof e.next)return e;if(!isNaN(e.length)){var n=-1,r=function t(){for(;++n<e.length;)if(l.call(e,n))return t.value=e[n],t.done=!1,t;return t.value=c,t.done=!0,t};return r.next=r}}return{next:C}}function C(){return{value:c,done:!0}}return y.prototype=x.constructor=m,m.constructor=y,m[r]=y.displayName="GeneratorFunction",i.isGeneratorFunction=function(t){var e="function"==typeof t&&t.constructor;return!!e&&(e===y||"GeneratorFunction"===(e.displayName||e.name))},i.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,m):(t.__proto__=m,r in t||(t[r]="GeneratorFunction")),t.prototype=Object.create(x),t},i.awrap=function(t){return{__await:t}},E(S.prototype),S.prototype[n]=function(){return this},i.AsyncIterator=S,i.async=function(t,e,n,r){var o=new S(a(t,e,n,r));return i.isGeneratorFunction(e)?o:o.next().then(function(t){return t.done?t.value:o.next()})},E(x),x[r]="Generator",x[o]=function(){return this},x.toString=function(){return"[object Generator]"},i.keys=function(n){var r=[];for(var t in n)r.push(t);return r.reverse(),function t(){for(;r.length;){var e=r.pop();if(e in n)return t.value=e,t.done=!1,t}return t.done=!0,t}},i.values=P,T.prototype={constructor:T,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=c,this.done=!1,this.delegate=null,this.method="next",this.arg=c,this.tryEntries.forEach(O),!t)for(var e in this)"t"===e.charAt(0)&&l.call(this,e)&&!isNaN(+e.slice(1))&&(this[e]=c)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if("throw"===t.type)throw t.arg;return this.rval},dispatchException:function(n){if(this.done)throw n;var r=this;function t(t,e){return i.type="throw",i.arg=n,r.next=t,e&&(r.method="next",r.arg=c),!!e}for(var e=this.tryEntries.length-1;0<=e;--e){var o=this.tryEntries[e],i=o.completion;if("root"===o.tryLoc)return t("end");if(o.tryLoc<=this.prev){var a=l.call(o,"catchLoc"),u=l.call(o,"finallyLoc");if(a&&u){if(this.prev<o.catchLoc)return t(o.catchLoc,!0);if(this.prev<o.finallyLoc)return t(o.finallyLoc)}else if(a){if(this.prev<o.catchLoc)return t(o.catchLoc,!0)}else{if(!u)throw new Error("try statement without catch or finally");if(this.prev<o.finallyLoc)return t(o.finallyLoc)}}}},abrupt:function(t,e){for(var n=this.tryEntries.length-1;0<=n;--n){var r=this.tryEntries[n];if(r.tryLoc<=this.prev&&l.call(r,"finallyLoc")&&this.prev<r.finallyLoc){var o=r;break}}o&&("break"===t||"continue"===t)&&o.tryLoc<=e&&e<=o.finallyLoc&&(o=null);var i=o?o.completion:{};return i.type=t,i.arg=e,o?(this.method="next",this.next=o.finallyLoc,v):this.complete(i)},complete:function(t,e){if("throw"===t.type)throw t.arg;return"break"===t.type||"continue"===t.type?this.next=t.arg:"return"===t.type?(this.rval=this.arg=t.arg,this.method="return",this.next="end"):"normal"===t.type&&e&&(this.next=e),v},finish:function(t){for(var e=this.tryEntries.length-1;0<=e;--e){var n=this.tryEntries[e];if(n.finallyLoc===t)return this.complete(n.completion,n.afterLoc),O(n),v}},catch:function(t){for(var e=this.tryEntries.length-1;0<=e;--e){var n=this.tryEntries[e];if(n.tryLoc===t){var r=n.completion;if("throw"===r.type){var o=r.arg;O(n)}return o}}throw new Error("illegal catch attempt")},delegateYield:function(t,e,n){return this.delegate={iterator:P(t),resultName:e,nextLoc:n},"next"===this.method&&(this.arg=c),v}},i}(t.exports);try{regeneratorRuntime=r}catch(t){Function("r","regeneratorRuntime = r")(r)}},function(t,e,n){t.exports=!n(41)&&!n(79)(function(){return 7!=Object.defineProperty(n(138)("div"),"a",{get:function(){return 7}}).a})},function(t,e,n){"use strict";
/*
object-assign
(c) Sindre Sorhus
@license MIT
*/var c=Object.getOwnPropertySymbols,l=Object.prototype.hasOwnProperty,s=Object.prototype.propertyIsEnumerable;t.exports=function(){try{if(!Object.assign)return!1;var t=new String("abc");if(t[5]="de","5"===Object.getOwnPropertyNames(t)[0])return!1;for(var e={},n=0;n<10;n++)e["_"+String.fromCharCode(n)]=n;if("0123456789"!==Object.getOwnPropertyNames(e).map(function(t){return e[t]}).join(""))return!1;var r={};return"abcdefghijklmnopqrst".split("").forEach(function(t){r[t]=t}),"abcdefghijklmnopqrst"===Object.keys(Object.assign({},r)).join("")}catch(t){return!1}}()?Object.assign:function(t,e){for(var n,r,o=function(t){if(null==t)throw new TypeError("Object.assign cannot be called with null or undefined");return Object(t)}(t),i=1;i<arguments.length;i++){for(var a in n=Object(arguments[i]))l.call(n,a)&&(o[a]=n[a]);if(c){r=c(n);for(var u=0;u<r.length;u++)s.call(n,r[u])&&(o[r[u]]=n[r[u]])}}return o}},function(t,e,n){t.exports=n(193)},function(t,e,n){n(424);var r=n(14).Object;t.exports=function(t,e){return r.getOwnPropertyDescriptor(t,e)}},function(t,e,n){var r=n(141),o=n(80),i=n(55),a=n(139),u=n(54),c=n(190),l=Object.getOwnPropertyDescriptor;e.f=n(41)?l:function(t,e){if(t=i(t),e=a(e,!0),c)try{return l(t,e)}catch(t){}if(u(t,e))return o(!r.f.call(t,e),t[e])}},function(t,e,n){var o=n(35),i=n(14),a=n(79);t.exports=function(t,e){var n=(i.Object||{})[t]||Object[t],r={};r[t]=e(n),o(o.S+o.F*a(function(){n(1)}),"Object",r)}},function(t,e,n){t.exports=n(197)},function(t,e,n){n(426);var r=n(14).Object;t.exports=function(t,e,n){return r.defineProperty(t,e,n)}},function(t,e,n){n(199),t.exports=n(14).Object.getOwnPropertySymbols},function(t,e,n){"use strict";function r(t){var e=G[t]=j(D[H]);return e._k=t,e}function o(t,e){_(t);for(var n,r=E(e=T(e)),o=0,i=r.length;o<i;)et(t,n=r[o++],e[n]);return t}function i(t){var e=V.call(this,t=P(t,!0));return!(this===K&&s(G,t)&&!s(Y,t))&&(!(e||!s(this,t)||!s(G,t)||s(this,q)&&this[q][t])||e)}function a(t,e){if(t=T(t),e=P(e,!0),t!==K||!s(G,e)||s(Y,e)){var n=I(t,e);return!n||!s(G,e)||s(t,q)&&t[q][e]||(n.enumerable=!0),n}}function u(t){for(var e,n=U(T(t)),r=[],o=0;n.length>o;)s(G,e=n[o++])||e==q||e==h||r.push(e);return r}function c(t){for(var e,n=t===K,r=U(n?Y:T(t)),o=[],i=0;r.length>i;)!s(G,e=r[i++])||n&&!s(K,e)||o.push(G[e]);return o}var l=n(16),s=n(54),f=n(41),p=n(35),d=n(200),h=n(430).KEY,v=n(79),y=n(142),m=n(105),g=n(104),b=n(17),w=n(143),x=n(144),E=n(431),S=n(434),_=n(37),k=n(53),O=n(107),T=n(55),P=n(139),C=n(80),j=n(203),R=n(436),A=n(194),N=n(202),M=n(36),L=n(106),I=A.f,F=M.f,U=R.f,D=l.Symbol,W=l.JSON,z=W&&W.stringify,H="prototype",q=b("_hidden"),B=b("toPrimitive"),V={}.propertyIsEnumerable,$=y("symbol-registry"),G=y("symbols"),Y=y("op-symbols"),K=Object[H],Q="function"==typeof D&&!!N.f,X=l.QObject,J=!X||!X[H]||!X[H].findChild,Z=f&&v(function(){return 7!=j(F({},"a",{get:function(){return F(this,"a",{value:7}).a}})).a})?function(t,e,n){var r=I(K,e);r&&delete K[e],F(t,e,n),r&&t!==K&&F(K,e,r)}:F,tt=Q&&"symbol"==typeof D.iterator?function(t){return"symbol"==typeof t}:function(t){return t instanceof D},et=function(t,e,n){return t===K&&et(Y,e,n),_(t),e=P(e,!0),_(n),s(G,e)?(n.enumerable?(s(t,q)&&t[q][e]&&(t[q][e]=!1),n=j(n,{enumerable:C(0,!1)})):(s(t,q)||F(t,q,C(1,{})),t[q][e]=!0),Z(t,e,n)):F(t,e,n)};Q||(d((D=function(t){if(this instanceof D)throw TypeError("Symbol is not a constructor!");var e=g(0<arguments.length?t:void 0),n=function(t){this===K&&n.call(Y,t),s(this,q)&&s(this[q],e)&&(this[q][e]=!1),Z(this,e,C(1,t))};return f&&J&&Z(K,e,{configurable:!0,set:n}),r(e)})[H],"toString",function(){return this._k}),A.f=a,M.f=et,n(205).f=R.f=u,n(141).f=i,N.f=c,f&&!n(83)&&d(K,"propertyIsEnumerable",i,!0),w.f=function(t){return r(b(t))}),p(p.G+p.W+p.F*!Q,{Symbol:D});for(var nt="hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables".split(","),rt=0;nt.length>rt;)b(nt[rt++]);for(var ot=L(b.store),it=0;ot.length>it;)x(ot[it++]);p(p.S+p.F*!Q,"Symbol",{for:function(t){return s($,t+="")?$[t]:$[t]=D(t)},keyFor:function(t){if(!tt(t))throw TypeError(t+" is not a symbol!");for(var e in $)if($[e]===t)return e},useSetter:function(){J=!0},useSimple:function(){J=!1}}),p(p.S+p.F*!Q,"Object",{create:function(t,e){return void 0===e?j(t):o(j(t),e)},defineProperty:et,defineProperties:o,getOwnPropertyDescriptor:a,getOwnPropertyNames:u,getOwnPropertySymbols:c});var at=v(function(){N.f(1)});p(p.S+p.F*at,"Object",{getOwnPropertySymbols:function(t){return N.f(O(t))}}),W&&p(p.S+p.F*(!Q||v(function(){var t=D();return"[null]"!=z([t])||"{}"!=z({a:t})||"{}"!=z(Object(t))})),"JSON",{stringify:function(t){for(var e,n,r=[t],o=1;o<arguments.length;)r.push(arguments[o++]);if(n=e=r[1],(k(e)||void 0!==t)&&!tt(t))return S(e)||(e=function(t,e){if("function"==typeof n&&(e=n.call(this,t,e)),!tt(e))return e}),r[1]=e,z.apply(W,r)}}),D[H][B]||n(52)(D[H],B,D[H].valueOf),m(D,"Symbol"),m(Math,"Math",!0),m(l.JSON,"JSON",!0)},function(t,e,n){t.exports=n(52)},function(t,e,n){var a=n(54),u=n(55),c=n(432)(!1),l=n(147)("IE_PROTO");t.exports=function(t,e){var n,r=u(t),o=0,i=[];for(n in r)n!=l&&a(r,n)&&i.push(n);for(;e.length>o;)a(r,n=e[o++])&&(~c(i,n)||i.push(n));return i}},function(t,e){e.f=Object.getOwnPropertySymbols},function(t,e,r){function o(){}var i=r(37),a=r(435),u=r(148),c=r(147)("IE_PROTO"),l="prototype",s=function(){var t,e=r(138)("iframe"),n=u.length;for(e.style.display="none",r(204).appendChild(e),e.src="javascript:",(t=e.contentWindow.document).open(),t.write("<script>document.F=Object<\/script>"),t.close(),s=t.F;n--;)delete s[l][u[n]];return s()};t.exports=Object.create||function(t,e){var n;return null!==t?(o[l]=i(t),n=new o,o[l]=null,n[c]=t):n=s(),void 0===e?n:a(n,e)}},function(t,e,n){var r=n(16).document;t.exports=r&&r.documentElement},function(t,e,n){var r=n(201),o=n(148).concat("length","prototype");e.f=Object.getOwnPropertyNames||function(t){return r(t,o)}},function(t,e,n){n(438),t.exports=n(14).Object.keys},function(t,e,n){n(84),n(108),t.exports=n(143).f("iterator")},function(t,e,n){"use strict";function b(){return this}var w=n(83),x=n(35),E=n(200),S=n(52),_=n(63),k=n(443),O=n(105),T=n(444),P=n(17)("iterator"),C=!([].keys&&"next"in[].keys()),j="values";t.exports=function(t,e,n,r,o,i,a){k(n,e,r);function u(t){if(!C&&t in h)return h[t];switch(t){case"keys":case j:return function(){return new n(this,t)}}return function(){return new n(this,t)}}var c,l,s,f=e+" Iterator",p=o==j,d=!1,h=t.prototype,v=h[P]||h["@@iterator"]||o&&h[o],y=v||u(o),m=o?p?u("entries"):y:void 0,g="Array"==e&&h.entries||v;if(g&&(s=T(g.call(new t)))!==Object.prototype&&s.next&&(O(s,f,!0),w||"function"==typeof s[P]||S(s,P,b)),p&&v&&v.name!==j&&(d=!0,y=function(){return v.call(this)}),w&&!a||!C&&!d&&h[P]||S(h,P,y),_[e]=y,_[f]=b,o)if(c={values:p?y:u(j),keys:i?y:u("keys"),entries:m},a)for(l in c)l in h||E(h,l,c[l]);else x(x.P+x.F*(C||d),e,c);return c}},function(t,e,n){n(199),n(210),n(449),n(450),t.exports=n(14).Symbol},function(t,e){},function(t,e,n){n(84),n(455),t.exports=n(14).Array.from},function(t,e,n){var i=n(37);t.exports=function(e,t,n,r){try{return r?t(i(n)[0],n[1]):t(n)}catch(t){var o=e.return;throw void 0!==o&&i(o.call(e)),t}}},function(t,e,n){var r=n(63),o=n(17)("iterator"),i=Array.prototype;t.exports=function(t){return void 0!==t&&(r.Array===t||i[o]===t)}},function(t,e,n){var i=n(17)("iterator"),a=!1;try{var r=[7][i]();r.return=function(){a=!0},Array.from(r,function(){throw 2})}catch(t){}t.exports=function(t,e){if(!e&&!a)return!1;var n=!1;try{var r=[7],o=r[i]();o.next=function(){return{done:n=!0}},r[i]=function(){return o},t(r)}catch(t){}return n}},function(t,e,n){n(108),n(84),t.exports=n(458)},function(t,e,n){"use strict";n.r(e);e.default=function(t,e){}},function(t,e,n){var o=n(218),i=n(151);t.exports=function(t){if(t&&t.__esModule)return t;var e={};if(null!=t)for(var n in t)if(Object.prototype.hasOwnProperty.call(t,n)){var r=i&&o?o(t,n):{};r.get||r.set?i(e,n,r):e[n]=t[n]}return e.default=t,e}},function(t,e,n){t.exports=n(193)},function(t,e,n){"use strict";e.__esModule=!0,e.asap=function(t){r.push(t),o||(a(),c())},e.suspend=a,e.flush=c;var r=[],o=0;function i(t){try{a(),t()}finally{u()}}function a(){o++}function u(){o--}function c(){u();for(var t=void 0;!o&&void 0!==(t=r.shift());)i(t)}},function(e,t,n){var r=n(477),o=n(478);function i(t){return(i="function"==typeof o&&"symbol"==typeof r?function(t){return typeof t}:function(t){return t&&"function"==typeof o&&t.constructor===o&&t!==o.prototype?"symbol":typeof t})(t)}function a(t){return"function"==typeof o&&"symbol"===i(r)?e.exports=a=function(t){return i(t)}:e.exports=a=function(t){return t&&"function"==typeof o&&t.constructor===o&&t!==o.prototype?"symbol":i(t)},a(t)}e.exports=a},function(t,e,n){"use strict";e.__esModule=!0,e.throttleHelper=e.takeLatestHelper=e.takeEveryHelper=e.throttle=e.takeLatest=e.takeEvery=void 0;var r=u(n(499)),o=u(n(500)),i=u(n(501)),a=n(38);function u(t){return t&&t.__esModule?t:{default:t}}function c(t){return"import { "+t+" } from 'redux-saga' has been deprecated in favor of import { "+t+" } from 'redux-saga/effects'.\nThe latter will not work with yield*, as helper effects are wrapped automatically for you in fork effect.\nTherefore yield "+t+" will return task descriptor to your saga and execute next lines of code."}var l=(0,a.deprecate)(r.default,c("takeEvery")),s=(0,a.deprecate)(o.default,c("takeLatest")),f=(0,a.deprecate)(i.default,c("throttle"));e.takeEvery=l,e.takeLatest=s,e.throttle=f,e.takeEveryHelper=r.default,e.takeLatestHelper=o.default,e.throttleHelper=i.default},function(t,e,n){"use strict";Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(t,e){var n="".concat(e.namespace).concat(o.NAMESPACE_SEP).concat(t),r=n.replace(/\/@@[^/]+?$/,"");if(e.reducers&&e.reducers[r]||e.effects&&e.effects[r])return n;return t};var o=n(88)},function(t,e,n){var o=n(37),i=n(102),a=n(17)("species");t.exports=function(t,e){var n,r=o(t).constructor;return void 0===r||null==(n=o(r)[a])?e:i(n)}},function(t,e,n){function r(){var t=+this;if(b.hasOwnProperty(t)){var e=b[t];delete b[t],e()}}function o(t){r.call(t.data)}var i,a,u,c=n(78),l=n(514),s=n(204),f=n(138),p=n(16),d=p.process,h=p.setImmediate,v=p.clearImmediate,y=p.MessageChannel,m=p.Dispatch,g=0,b={},w="onreadystatechange";h&&v||(h=function(t){for(var e=[],n=1;n<arguments.length;)e.push(arguments[n++]);return b[++g]=function(){l("function"==typeof t?t:Function(t),e)},i(g),g},v=function(t){delete b[t]},"process"==n(82)(d)?i=function(t){d.nextTick(c(r,t,1))}:m&&m.now?i=function(t){m.now(c(r,t,1))}:y?(u=(a=new y).port2,a.port1.onmessage=o,i=c(u.postMessage,u,1)):p.addEventListener&&"function"==typeof postMessage&&!p.importScripts?(i=function(t){p.postMessage(t+"","*")},p.addEventListener("message",o,!1)):i=w in f("script")?function(t){s.appendChild(f("script"))[w]=function(){s.removeChild(this),r.call(t)}}:function(t){setTimeout(c(r,t,1),0)}),t.exports={set:h,clear:v}},function(t,e){t.exports=function(t){try{return{e:!1,v:t()}}catch(t){return{e:!0,v:t}}}},function(t,e,n){var r=n(37),o=n(53),i=n(155);t.exports=function(t,e){if(r(t),o(e)&&e.constructor===t)return e;var n=i.f(t);return(0,n.resolve)(e),n.promise}},function(t,e,n){"use strict";n.r(e);var x=n(2),r=n(0),a=n.n(r),E=a.a.shape({trySubscribe:a.a.func.isRequired,tryUnsubscribe:a.a.func.isRequired,notifyNestedSubs:a.a.func.isRequired,isSubscribed:a.a.func.isRequired}),S=a.a.shape({subscribe:a.a.func.isRequired,dispatch:a.a.func.isRequired,getState:a.a.func.isRequired});function o(){var t,r,o=0<arguments.length&&void 0!==arguments[0]?arguments[0]:"store",e=arguments[1]||o+"Subscription",n=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(i,r=x.Component),i.prototype.getChildContext=function(){var t;return(t={})[o]=this[o],t[e]=null,t},i.prototype.render=function(){return x.Children.only(this.props.children)},i);function i(t,e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,i);var n=function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,r.call(this,t,e));return n[o]=t.store,n}return n.propTypes={store:S.isRequired,children:a.a.element.isRequired},n.childContextTypes=((t={})[o]=S.isRequired,t[e]=E,t),n}var i=o(),u=n(112),_=n.n(u),c=n(7),k=n.n(c);var l={notify:function(){}};var O=(s.prototype.addNestedSub=function(t){return this.trySubscribe(),this.listeners.subscribe(t)},s.prototype.notifyNestedSubs=function(){this.listeners.notify()},s.prototype.isSubscribed=function(){return Boolean(this.unsubscribe)},s.prototype.trySubscribe=function(){this.unsubscribe||(this.unsubscribe=this.parentSub?this.parentSub.addNestedSub(this.onStateChange):this.store.subscribe(this.onStateChange),this.listeners=function(){var n=[],r=[];return{clear:function(){n=r=null},notify:function(){for(var t=n=r,e=0;e<t.length;e++)t[e]()},get:function(){return r},subscribe:function(t){var e=!0;return r===n&&(r=n.slice()),r.push(t),function(){e&&null!==n&&(e=!1,r===n&&(r=n.slice()),r.splice(r.indexOf(t),1))}}}}())},s.prototype.tryUnsubscribe=function(){this.unsubscribe&&(this.unsubscribe(),this.unsubscribe=null,this.listeners.clear(),this.listeners=l)},s);function s(t,e,n){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,s),this.store=t,this.parentSub=e,this.onStateChange=n,this.unsubscribe=null,this.listeners=l}var T=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};var P=0,C={};function j(){}function f(u){var t,e,n=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},r=n.getDisplayName,c=void 0===r?function(t){return"ConnectAdvanced("+t+")"}:r,o=n.methodName,l=void 0===o?"connectAdvanced":o,i=n.renderCountProp,s=void 0===i?void 0:i,a=n.shouldHandleStateChanges,f=void 0===a||a,p=n.storeKey,d=void 0===p?"store":p,h=n.withRef,v=void 0!==h&&h,y=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(n,["getDisplayName","methodName","renderCountProp","shouldHandleStateChanges","storeKey","withRef"]),m=d+"Subscription",g=P++,b=((t={})[d]=S,t[m]=E,t),w=((e={})[m]=E,e);return function(e){k()("function"==typeof e,"You must pass a component to the function returned by "+l+". Instead received "+JSON.stringify(e));var r,t=e.displayName||e.name||"Component",o=c(t),n=T({},y,{getDisplayName:c,methodName:l,renderCountProp:s,shouldHandleStateChanges:f,storeKey:d,withRef:v,displayName:o,wrappedComponentName:t,WrappedComponent:e}),i=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(a,r=x.Component),a.prototype.getChildContext=function(){var t,e=this.propsMode?null:this.subscription;return(t={})[m]=e||this.context[m],t},a.prototype.componentDidMount=function(){f&&(this.subscription.trySubscribe(),this.selector.run(this.props),this.selector.shouldComponentUpdate&&this.forceUpdate())},a.prototype.componentWillReceiveProps=function(t){this.selector.run(t)},a.prototype.shouldComponentUpdate=function(){return this.selector.shouldComponentUpdate},a.prototype.componentWillUnmount=function(){this.subscription&&this.subscription.tryUnsubscribe(),this.subscription=null,this.notifyNestedSubs=j,this.store=null,this.selector.run=j,this.selector.shouldComponentUpdate=!1},a.prototype.getWrappedInstance=function(){return k()(v,"To access the wrapped instance, you need to specify { withRef: true } in the options argument of the "+l+"() call."),this.wrappedInstance},a.prototype.setWrappedInstance=function(t){this.wrappedInstance=t},a.prototype.initSelector=function(){var t=u(this.store.dispatch,n);this.selector=function(n,r){var o={run:function(t){try{var e=n(r.getState(),t);e===o.props&&!o.error||(o.shouldComponentUpdate=!0,o.props=e,o.error=null)}catch(t){o.shouldComponentUpdate=!0,o.error=t}}};return o}(t,this.store),this.selector.run(this.props)},a.prototype.initSubscription=function(){if(f){var t=(this.propsMode?this.props:this.context)[m];this.subscription=new O(this.store,t,this.onStateChange.bind(this)),this.notifyNestedSubs=this.subscription.notifyNestedSubs.bind(this.subscription)}},a.prototype.onStateChange=function(){this.selector.run(this.props),this.selector.shouldComponentUpdate?(this.componentDidUpdate=this.notifyNestedSubsOnComponentDidUpdate,this.setState(C)):this.notifyNestedSubs()},a.prototype.notifyNestedSubsOnComponentDidUpdate=function(){this.componentDidUpdate=void 0,this.notifyNestedSubs()},a.prototype.isSubscribed=function(){return Boolean(this.subscription)&&this.subscription.isSubscribed()},a.prototype.addExtraProps=function(t){if(!(v||s||this.propsMode&&this.subscription))return t;var e=T({},t);return v&&(e.ref=this.setWrappedInstance),s&&(e[s]=this.renderCount++),this.propsMode&&this.subscription&&(e[m]=this.subscription),e},a.prototype.render=function(){var t=this.selector;if(t.shouldComponentUpdate=!1,t.error)throw t.error;return Object(x.createElement)(e,this.addExtraProps(t.props))},a);function a(t,e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,a);var n=function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,r.call(this,t,e));return n.version=g,n.state={},n.renderCount=0,n.store=t[d]||e[d],n.propsMode=Boolean(t[d]),n.setWrappedInstance=n.setWrappedInstance.bind(n),k()(n.store,'Could not find "'+d+'" in either the context or props of "'+o+'". Either wrap the root component in a <Provider>, or explicitly pass "'+d+'" as a prop to "'+o+'".'),n.initSelector(),n.initSubscription(),n}return i.WrappedComponent=e,i.displayName=o,i.childContextTypes=w,i.contextTypes=b,i.propTypes=b,_()(i,e)}}var p=Object.prototype.hasOwnProperty;function d(t,e){return t===e?0!==t||0!==e||1/t==1/e:t!=t&&e!=e}function R(t,e){if(d(t,e))return!0;if("object"!=typeof t||null===t||"object"!=typeof e||null===e)return!1;var n=Object.keys(t),r=Object.keys(e);if(n.length!==r.length)return!1;for(var o=0;o<n.length;o++)if(!p.call(e,n[o])||!d(t[n[o]],e[n[o]]))return!1;return!0}n(31),n(72);function h(t,e){return function(){return e(t.apply(void 0,arguments))}}Object.assign;function v(o){return function(t,e){var n=o(t,e);function r(){return n}return r.dependsOnOwnProps=!1,r}}function y(t){return null!==t.dependsOnOwnProps&&void 0!==t.dependsOnOwnProps?Boolean(t.dependsOnOwnProps):1!==t.length}function m(o){return function(t,e){e.displayName;var r=function(t,e){return r.dependsOnOwnProps?r.mapToProps(t,e):r.mapToProps(t)};return r.dependsOnOwnProps=!0,r.mapToProps=function(t,e){r.mapToProps=o,r.dependsOnOwnProps=y(o);var n=r(t,e);return"function"==typeof n&&(r.mapToProps=n,r.dependsOnOwnProps=y(n),n=r(t,e)),n},r}}var g=[function(t){return"function"==typeof t?m(t):void 0},function(t){return t?void 0:v(function(t){return{dispatch:t}})},function(e){return e&&"object"==typeof e?v(function(t){return function(t,e){if("function"==typeof t)return h(t,e);if("object"!=typeof t||null===t)throw new Error("bindActionCreators expected an object or a function, instead received "+(null===t?"null":typeof t)+'. Did you write "import ActionCreators from" instead of "import * as ActionCreators from"?');for(var n=Object.keys(t),r={},o=0;o<n.length;o++){var i=n[o],a=t[i];"function"==typeof a&&(r[i]=h(a,e))}return r}(e,t)}):void 0}];var A=[function(t){return"function"==typeof t?m(t):void 0},function(t){return t?void 0:v(function(){return{}})}],b=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function w(t,e,n){return b({},n,t,e)}var N=[function(t){return"function"==typeof t?function(c){return function(t,e){e.displayName;var o=e.pure,i=e.areMergedPropsEqual,a=!1,u=void 0;return function(t,e,n){var r=c(t,e,n);return a?o&&i(r,u)||(u=r):(a=!0,u=r),u}}}(t):void 0},function(t){return t?void 0:function(){return w}}];function M(n,r,o,i){return function(t,e){return o(n(t,e),r(i,e),e)}}function L(o,i,a,u,t){var c=t.areStatesEqual,l=t.areOwnPropsEqual,s=t.areStatePropsEqual,n=!1,f=void 0,p=void 0,d=void 0,h=void 0,v=void 0;function r(t,e){var n=!l(e,p),r=!c(t,f);return f=t,p=e,n&&r?(d=o(f,p),i.dependsOnOwnProps&&(h=i(u,p)),v=a(d,h,p)):n?(o.dependsOnOwnProps&&(d=o(f,p)),i.dependsOnOwnProps&&(h=i(u,p)),v=a(d,h,p)):r?function(){var t=o(f,p),e=!s(t,d);return d=t,e&&(v=a(d,h,p)),v}():v}return function(t,e){return n?r(t,e):function(t,e){return d=o(f=t,p=e),h=i(u,p),v=a(d,h,p),n=!0,v}(t,e)}}function I(t,e){var n=e.initMapStateToProps,r=e.initMapDispatchToProps,o=e.initMergeProps,i=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(e,["initMapStateToProps","initMapDispatchToProps","initMergeProps"]),a=n(t,i),u=r(t,i),c=o(t,i);return(i.pure?L:M)(a,u,c,t,i)}var F=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function U(n,t,r){for(var e=t.length-1;0<=e;e--){var o=t[e](n);if(o)return o}return function(t,e){throw new Error("Invalid value of type "+typeof n+" for "+r+" argument when connecting component "+e.wrappedComponentName+".")}}function D(t,e){return t===e}var W=function(t){var e=0<arguments.length&&void 0!==t?t:{},n=e.connectHOC,b=void 0===n?f:n,r=e.mapStateToPropsFactories,w=void 0===r?A:r,o=e.mapDispatchToPropsFactories,x=void 0===o?g:o,i=e.mergePropsFactories,E=void 0===i?N:i,a=e.selectorFactory,S=void 0===a?I:a;return function(t,e,n,r){var o=3<arguments.length&&void 0!==r?r:{},i=o.pure,a=void 0===i||i,u=o.areStatesEqual,c=void 0===u?D:u,l=o.areOwnPropsEqual,s=void 0===l?R:l,f=o.areStatePropsEqual,p=void 0===f?R:f,d=o.areMergedPropsEqual,h=void 0===d?R:d,v=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(o,["pure","areStatesEqual","areOwnPropsEqual","areStatePropsEqual","areMergedPropsEqual"]),y=U(t,w,"mapStateToProps"),m=U(e,x,"mapDispatchToProps"),g=U(n,E,"mergeProps");return b(S,F({methodName:"connect",getDisplayName:function(t){return"Connect("+t+")"},shouldHandleStateChanges:Boolean(t),initMapStateToProps:y,initMapDispatchToProps:m,initMergeProps:g,pure:a,areStatesEqual:c,areOwnPropsEqual:s,areStatePropsEqual:p,areMergedPropsEqual:h},v))}}();n.d(e,"Provider",function(){return i}),n.d(e,"createProvider",function(){return o}),n.d(e,"connectAdvanced",function(){return f}),n.d(e,"connect",function(){return W})},function(t,e,n){"use strict";n.r(e);var r=n(2),o=n.n(r),i=n(0),a=n.n(i),u=n(230),c=n.n(u),l=n(7),s=n.n(l),f=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function p(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var d,h=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(v,d=o.a.Component),v.prototype.getChildContext=function(){return{router:f({},this.context.router,{history:this.props.history,route:{location:this.props.history.location,match:this.state.match}})}},v.prototype.computeMatch=function(t){return{path:"/",url:"/",params:{},isExact:"/"===t}},v.prototype.componentWillMount=function(){var t=this,e=this.props,n=e.children,r=e.history;s()(null==n||1===o.a.Children.count(n),"A <Router> may have only one child element"),this.unlisten=r.listen(function(){t.setState({match:t.computeMatch(r.location.pathname)})})},v.prototype.componentWillReceiveProps=function(t){c()(this.props.history===t.history,"You cannot change <Router history>")},v.prototype.componentWillUnmount=function(){this.unlisten()},v.prototype.render=function(){var t=this.props.children;return t?o.a.Children.only(t):null},v);function v(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,v);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=p(this,d.call.apply(d,[this].concat(r)))).state={match:e.computeMatch(e.props.history.location.pathname)},p(e,t)}h.propTypes={history:a.a.object.isRequired,children:a.a.node},h.contextTypes={router:a.a.object},h.childContextTypes={router:a.a.object.isRequired};var y=h,m=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t},g="@@router/LOCATION_CHANGE",b={location:null};function w(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:b,e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},n=e.type,r=e.payload;return n===g?m({},t,{location:r}):t}function x(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var E,S=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(_,E=r.Component),_.prototype.componentWillMount=function(){var t=this.props,e=t.store,n=t.history,r=t.isSSR;this.store=e||this.context.store,this.handleLocationChange(n.location),r||(this.unsubscribeFromHistory=n.listen(this.handleLocationChange))},_.prototype.componentWillUnmount=function(){this.unsubscribeFromHistory&&this.unsubscribeFromHistory()},_.prototype.render=function(){return o.a.createElement(y,this.props)},_);function _(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,_);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=x(this,E.call.apply(E,[this].concat(r)))).handleLocationChange=function(t){e.store.dispatch({type:g,payload:t})},x(e,t)}S.propTypes={store:a.a.object,history:a.a.object.isRequired,children:a.a.node,isSSR:a.a.bool},S.contextTypes={store:a.a.object};function k(t){return t.router.location}function O(r){var o=null,i=null;return function(t){var e=(k(t)||{}).pathname;if(e===o)return i;var n=A(o=e,r);return n&&i&&n.url===i.url||(i=n),i}}var T=S,P=n(231),C=n.n(P),j={},R=0,A=function(t,e,n){var r=1<arguments.length&&void 0!==e?e:{},o=n;"string"==typeof r&&(r={path:r});var i=r,a=i.path,u=i.exact,c=void 0!==u&&u,l=i.strict,s=void 0!==l&&l,f=i.sensitive;if(null==a)return o;var p=function(t,e){var n=""+e.end+e.strict+e.sensitive,r=j[n]||(j[n]={});if(r[t])return r[t];var o=[],i={re:C()(t,o,e),keys:o};return R<1e4&&(r[t]=i,R++),i}(a,{end:c,strict:s,sensitive:void 0!==f&&f}),d=p.re,h=p.keys,v=d.exec(t);if(!v)return null;var y=v[0],m=v.slice(1),g=t===y;return c&&!g?null:{path:a,url:"/"===a&&""===y?"/":y,isExact:g,params:h.reduce(function(t,e,n){return t[e.name]=m[n],t},{})}},N="@@router/CALL_HISTORY_METHOD";function M(r){return function(){for(var t=arguments.length,e=Array(t),n=0;n<t;n++)e[n]=arguments[n];return{type:N,payload:{method:r,args:e}}}}var L=M("push"),I=M("replace"),F=M("go"),U=M("goBack"),D=M("goForward"),W={push:L,replace:I,go:F,goBack:U,goForward:D};function z(i){return function(){return function(o){return function(t){if(t.type!==N)return o(t);var e=t.payload,n=e.method,r=e.args;i[n].apply(i,r)}}}}n.d(e,"ConnectedRouter",function(){return T}),n.d(e,"getLocation",function(){return k}),n.d(e,"createMatchSelector",function(){return O}),n.d(e,"LOCATION_CHANGE",function(){return g}),n.d(e,"routerReducer",function(){return w}),n.d(e,"CALL_HISTORY_METHOD",function(){return N}),n.d(e,"push",function(){return L}),n.d(e,"replace",function(){return I}),n.d(e,"go",function(){return F}),n.d(e,"goBack",function(){return U}),n.d(e,"goForward",function(){return D}),n.d(e,"routerActions",function(){return W}),n.d(e,"routerMiddleware",function(){return z})},function(t,e,n){"use strict";n.r(e);var d=n(31),h=n(72),g={INIT:"@@redux/INIT"};function v(t,e,n){var r;if("function"==typeof e&&void 0===n&&(n=e,e=void 0),void 0!==n){if("function"!=typeof n)throw new Error("Expected the enhancer to be a function.");return n(v)(t,e)}if("function"!=typeof t)throw new Error("Expected the reducer to be a function.");var o=t,i=e,a=[],u=a,c=!1;function l(){u===a&&(u=a.slice())}function s(){return i}function f(e){if("function"!=typeof e)throw new Error("Expected listener to be a function.");var n=!0;return l(),u.push(e),function(){if(n){n=!1,l();var t=u.indexOf(e);u.splice(t,1)}}}function p(t){if(!Object(d.a)(t))throw new Error("Actions must be plain objects. Use custom middleware for async actions.");if(void 0===t.type)throw new Error('Actions may not have an undefined "type" property. Have you misspelled a constant?');if(c)throw new Error("Reducers may not dispatch actions.");try{c=!0,i=o(i,t)}finally{c=!1}for(var e=a=u,n=0;n<e.length;n++){(0,e[n])()}return t}return p({type:g.INIT}),(r={dispatch:p,subscribe:f,getState:s,replaceReducer:function(t){if("function"!=typeof t)throw new Error("Expected the nextReducer to be a function.");o=t,p({type:g.INIT})}})[h.a]=function(){var t,n=f;return(t={subscribe:function(t){if("object"!=typeof t)throw new TypeError("Expected the observer to be an object.");function e(){t.next&&t.next(s())}return e(),{unsubscribe:n(e)}}})[h.a]=function(){return this},t},r}function r(t){for(var e=Object.keys(t),v={},n=0;n<e.length;n++){var r=e[n];0,"function"==typeof t[r]&&(v[r]=t[r])}var y=Object.keys(v);var m=void 0;try{!function(n){Object.keys(n).forEach(function(t){var e=n[t];if(void 0===e(void 0,{type:g.INIT}))throw new Error('Reducer "'+t+"\" returned undefined during initialization. If the state passed to the reducer is undefined, you must explicitly return the initial state. The initial state may not be undefined. If you don't want to set a value for this reducer, you can use null instead of undefined.");if(void 0===e(void 0,{type:"@@redux/PROBE_UNKNOWN_ACTION_"+Math.random().toString(36).substring(7).split("").join(".")}))throw new Error('Reducer "'+t+"\" returned undefined when probed with a random type. Don't try to handle "+g.INIT+' or other actions in "redux/*" namespace. They are considered private. Instead, you must return the current state for any unknown actions, unless it is undefined, in which case you must return the initial state, regardless of the action type. The initial state may not be undefined, but can be null.')})}(v)}catch(t){m=t}return function(t,e){var n=0<arguments.length&&void 0!==t?t:{},r=e;if(m)throw m;for(var o,i,a,u=!1,c={},l=0;l<y.length;l++){var s=y[l],f=v[s],p=n[s],d=f(p,r);if(void 0===d){var h=(o=s,a=void 0,"Given action "+((a=(i=r)&&i.type)&&'"'+a.toString()+'"'||"an action")+', reducer "'+o+'" returned undefined. To ignore an action, you must explicitly return the previous state. If you want this reducer to hold no value, you can return null instead of undefined.');throw new Error(h)}c[s]=d,u=u||d!==p}return u?c:n}}function u(t,e){return function(){return e(t.apply(void 0,arguments))}}function o(t,e){if("function"==typeof t)return u(t,e);if("object"!=typeof t||null===t)throw new Error("bindActionCreators expected an object or a function, instead received "+(null===t?"null":typeof t)+'. Did you write "import ActionCreators from" instead of "import * as ActionCreators from"?');for(var n=Object.keys(t),r={},o=0;o<n.length;o++){var i=n[o],a=t[i];"function"==typeof a&&(r[i]=u(a,e))}return r}function l(){for(var t=arguments.length,e=Array(t),n=0;n<t;n++)e[n]=arguments[n];return 0===e.length?function(t){return t}:1===e.length?e[0]:e.reduce(function(t,e){return function(){return t(e.apply(void 0,arguments))}})}var s=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function i(){for(var t=arguments.length,c=Array(t),e=0;e<t;e++)c[e]=arguments[e];return function(u){return function(t,e,n){var r,o=u(t,e,n),i=o.dispatch,a={getState:o.getState,dispatch:function(t){return i(t)}};return r=c.map(function(t){return t(a)}),i=l.apply(void 0,r)(o.dispatch),s({},o,{dispatch:i})}}}n.d(e,"createStore",function(){return v}),n.d(e,"combineReducers",function(){return r}),n.d(e,"bindActionCreators",function(){return o}),n.d(e,"applyMiddleware",function(){return i}),n.d(e,"compose",function(){return l})},function(t,e,n){"use strict";var r=function(){};t.exports=r},function(t,e,n){var p=n(417);t.exports=a,t.exports.parse=r,t.exports.compile=function(t,e){return o(r(t,e))},t.exports.tokensToFunction=o,t.exports.tokensToRegExp=i;var _=new RegExp(["(\\\\.)","([\\/.])?(?:(?:\\:(\\w+)(?:\\(((?:\\\\.|[^\\\\()])+)\\))?|\\(((?:\\\\.|[^\\\\()])+)\\))([+*?])?|(\\*))"].join("|"),"g");function r(t,e){for(var n,r,o=[],i=0,a=0,u="",c=e&&e.delimiter||"/";null!=(n=_.exec(t));){var l=n[0],s=n[1],f=n.index;if(u+=t.slice(a,f),a=f+l.length,s)u+=s[1];else{var p=t[a],d=n[2],h=n[3],v=n[4],y=n[5],m=n[6],g=n[7];u&&(o.push(u),u="");var b=null!=d&&null!=p&&p!==d,w="+"===m||"*"===m,x="?"===m||"*"===m,E=n[2]||c,S=v||y;o.push({name:h||i++,prefix:d||"",delimiter:E,optional:x,repeat:w,partial:b,asterisk:!!g,pattern:S?(r=S,r.replace(/([=!:$\/()])/g,"\\$1")):g?".*":"[^"+k(E)+"]+?"})}}return a<t.length&&(u+=t.substr(a)),u&&o.push(u),o}function d(t){return encodeURI(t).replace(/[\/?#]/g,function(t){return"%"+t.charCodeAt(0).toString(16).toUpperCase()})}function o(s){for(var f=new Array(s.length),t=0;t<s.length;t++)"object"==typeof s[t]&&(f[t]=new RegExp("^(?:"+s[t].pattern+")$"));return function(t,e){for(var n="",r=t||{},o=(e||{}).pretty?d:encodeURIComponent,i=0;i<s.length;i++){var a=s[i];if("string"!=typeof a){var u,c=r[a.name];if(null==c){if(a.optional){a.partial&&(n+=a.prefix);continue}throw new TypeError('Expected "'+a.name+'" to be defined')}if(p(c)){if(!a.repeat)throw new TypeError('Expected "'+a.name+'" to not repeat, but received `'+JSON.stringify(c)+"`");if(0===c.length){if(a.optional)continue;throw new TypeError('Expected "'+a.name+'" to not be empty')}for(var l=0;l<c.length;l++){if(u=o(c[l]),!f[i].test(u))throw new TypeError('Expected all "'+a.name+'" to match "'+a.pattern+'", but received `'+JSON.stringify(u)+"`");n+=(0===l?a.prefix:a.delimiter)+u}}else{if(u=a.asterisk?encodeURI(c).replace(/[?#]/g,function(t){return"%"+t.charCodeAt(0).toString(16).toUpperCase()}):o(c),!f[i].test(u))throw new TypeError('Expected "'+a.name+'" to match "'+a.pattern+'", but received "'+u+'"');n+=a.prefix+u}}else n+=a}return n}}function k(t){return t.replace(/([.+*?=^!:${}()[\]|\/\\])/g,"\\$1")}function h(t,e){return t.keys=e,t}function v(t){return t.sensitive?"":"i"}function i(t,e,n){p(e)||(n=e||n,e=[]);for(var r=(n=n||{}).strict,o=!1!==n.end,i="",a=0;a<t.length;a++){var u=t[a];if("string"==typeof u)i+=k(u);else{var c=k(u.prefix),l="(?:"+u.pattern+")";e.push(u),u.repeat&&(l+="(?:"+c+l+")*"),i+=l=u.optional?u.partial?c+"("+l+")?":"(?:"+c+"("+l+"))?":c+"("+l+")"}}var s=k(n.delimiter||"/"),f=i.slice(-s.length)===s;return r||(i=(f?i.slice(0,-s.length):i)+"(?:"+s+"(?=$))?"),i+=o?"$":r&&f?"":"(?="+s+"|$)",h(new RegExp("^"+i,v(n)),e)}function a(t,e,n){return p(e)||(n=e||n,e=[]),n=n||{},t instanceof RegExp?function(t,e){var n=t.source.match(/\((?!\?)/g);if(n)for(var r=0;r<n.length;r++)e.push({name:r,prefix:null,delimiter:null,optional:!1,repeat:!1,partial:!1,asterisk:!1,pattern:null});return h(t,e)}(t,e):p(t)?function(t,e,n){for(var r=[],o=0;o<t.length;o++)r.push(a(t[o],e,n).source);return h(new RegExp("(?:"+r.join("|")+")",v(n)),e)}(t,e,n):function(t,e,n){return i(r(t,n),e,n)}(t,e,n)}},function(t,e,n){"use strict";function r(t){var e,n=t.Symbol;return"function"==typeof n?n.observable?e=n.observable:(e=n("observable"),n.observable=e):e="@@observable",e}n.d(e,"a",function(){return r})},function(t,n,e){"use strict";(function(t){var e="object"==typeof t&&t&&t.Object===Object&&t;n.a=e}).call(this,e(81))},function(t,e,n){var o=n(525);t.exports=function(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{},r=Object.keys(n);"function"==typeof Object.getOwnPropertySymbols&&(r=r.concat(Object.getOwnPropertySymbols(n).filter(function(t){return Object.getOwnPropertyDescriptor(n,t).enumerable}))),r.forEach(function(t){o(e,t,n[t])})}return e}},,function(t,e,n){"use strict";n(237);var r,o=(r=n(408))&&r.__esModule?r:{default:r};o.default._babelPolyfill&&"undefined"!=typeof console&&console.warn&&console.warn("@babel/polyfill is loaded more than once on this page. This is probably not desirable/intended and may have consequences if different versions of the polyfills are applied sequentially. If you do need to load the polyfill more than once, use @babel/polyfill/noConflict instead to bypass the warning."),o.default._babelPolyfill=!0},function(t,e,n){"use strict";n(238),n(381),n(383),n(386),n(388),n(390),n(392),n(394),n(396),n(398),n(400),n(402),n(404),n(189)},function(t,e,n){n(239),n(242),n(243),n(244),n(245),n(246),n(247),n(248),n(249),n(250),n(251),n(252),n(253),n(254),n(255),n(256),n(257),n(258),n(259),n(260),n(261),n(262),n(263),n(264),n(265),n(266),n(267),n(268),n(269),n(270),n(271),n(272),n(273),n(274),n(275),n(276),n(277),n(278),n(279),n(280),n(281),n(282),n(283),n(285),n(286),n(287),n(288),n(289),n(290),n(291),n(292),n(293),n(294),n(295),n(296),n(297),n(298),n(299),n(300),n(301),n(302),n(303),n(304),n(305),n(306),n(307),n(308),n(309),n(310),n(311),n(312),n(313),n(314),n(315),n(316),n(317),n(318),n(320),n(321),n(323),n(324),n(325),n(326),n(327),n(328),n(329),n(331),n(332),n(333),n(334),n(335),n(336),n(337),n(338),n(339),n(340),n(341),n(342),n(343),n(133),n(344),n(178),n(345),n(179),n(346),n(347),n(348),n(349),n(180),n(352),n(353),n(354),n(355),n(356),n(357),n(358),n(359),n(360),n(361),n(362),n(363),n(364),n(365),n(366),n(367),n(368),n(369),n(370),n(371),n(372),n(373),n(374),n(375),n(376),n(377),n(378),n(379),n(380),t.exports=n(11)},function(t,e,n){"use strict";function r(t){var e=G[t]=j(D[H]);return e._k=t,e}function o(t,e){_(t);for(var n,r=E(e=T(e)),o=0,i=r.length;o<i;)et(t,n=r[o++],e[n]);return t}function i(t){var e=V.call(this,t=P(t,!0));return!(this===K&&s(G,t)&&!s(Y,t))&&(!(e||!s(this,t)||!s(G,t)||s(this,q)&&this[q][t])||e)}function a(t,e){if(t=T(t),e=P(e,!0),t!==K||!s(G,e)||s(Y,e)){var n=I(t,e);return!n||!s(G,e)||s(t,q)&&t[q][e]||(n.enumerable=!0),n}}function u(t){for(var e,n=U(T(t)),r=[],o=0;n.length>o;)s(G,e=n[o++])||e==q||e==h||r.push(e);return r}function c(t){for(var e,n=t===K,r=U(n?Y:T(t)),o=[],i=0;r.length>i;)!s(G,e=r[i++])||n&&!s(K,e)||o.push(G[e]);return o}var l=n(3),s=n(20),f=n(12),p=n(1),d=n(18),h=n(40).KEY,v=n(4),y=n(90),m=n(57),g=n(43),b=n(8),w=n(114),x=n(159),E=n(241),S=n(93),_=n(5),k=n(6),O=n(15),T=n(22),P=n(39),C=n(42),j=n(47),R=n(162),A=n(28),N=n(92),M=n(13),L=n(45),I=A.f,F=M.f,U=R.f,D=l.Symbol,W=l.JSON,z=W&&W.stringify,H="prototype",q=b("_hidden"),B=b("toPrimitive"),V={}.propertyIsEnumerable,$=y("symbol-registry"),G=y("symbols"),Y=y("op-symbols"),K=Object[H],Q="function"==typeof D&&!!N.f,X=l.QObject,J=!X||!X[H]||!X[H].findChild,Z=f&&v(function(){return 7!=j(F({},"a",{get:function(){return F(this,"a",{value:7}).a}})).a})?function(t,e,n){var r=I(K,e);r&&delete K[e],F(t,e,n),r&&t!==K&&F(K,e,r)}:F,tt=Q&&"symbol"==typeof D.iterator?function(t){return"symbol"==typeof t}:function(t){return t instanceof D},et=function(t,e,n){return t===K&&et(Y,e,n),_(t),e=P(e,!0),_(n),s(G,e)?(n.enumerable?(s(t,q)&&t[q][e]&&(t[q][e]=!1),n=j(n,{enumerable:C(0,!1)})):(s(t,q)||F(t,q,C(1,{})),t[q][e]=!0),Z(t,e,n)):F(t,e,n)};Q||(d((D=function(t){if(this instanceof D)throw TypeError("Symbol is not a constructor!");var e=g(0<arguments.length?t:void 0),n=function(t){this===K&&n.call(Y,t),s(this,q)&&s(this[q],e)&&(this[q][e]=!1),Z(this,e,C(1,t))};return f&&J&&Z(K,e,{configurable:!0,set:n}),r(e)})[H],"toString",function(){return this._k}),A.f=a,M.f=et,n(48).f=R.f=u,n(75).f=i,N.f=c,f&&!n(44)&&d(K,"propertyIsEnumerable",i,!0),w.f=function(t){return r(b(t))}),p(p.G+p.W+p.F*!Q,{Symbol:D});for(var nt="hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables".split(","),rt=0;nt.length>rt;)b(nt[rt++]);for(var ot=L(b.store),it=0;ot.length>it;)x(ot[it++]);p(p.S+p.F*!Q,"Symbol",{for:function(t){return s($,t+="")?$[t]:$[t]=D(t)},keyFor:function(t){if(!tt(t))throw TypeError(t+" is not a symbol!");for(var e in $)if($[e]===t)return e},useSetter:function(){J=!0},useSimple:function(){J=!1}}),p(p.S+p.F*!Q,"Object",{create:function(t,e){return void 0===e?j(t):o(j(t),e)},defineProperty:et,defineProperties:o,getOwnPropertyDescriptor:a,getOwnPropertyNames:u,getOwnPropertySymbols:c});var at=v(function(){N.f(1)});p(p.S+p.F*at,"Object",{getOwnPropertySymbols:function(t){return N.f(O(t))}}),W&&p(p.S+p.F*(!Q||v(function(){var t=D();return"[null]"!=z([t])||"{}"!=z({a:t})||"{}"!=z(Object(t))})),"JSON",{stringify:function(t){for(var e,n,r=[t],o=1;o<arguments.length;)r.push(arguments[o++]);if(n=e=r[1],(k(e)||void 0!==t)&&!tt(t))return S(e)||(e=function(t,e){if("function"==typeof n&&(e=n.call(this,t,e)),!tt(e))return e}),r[1]=e,z.apply(W,r)}}),D[H][B]||n(21)(D[H],B,D[H].valueOf),m(D,"Symbol"),m(Math,"Math",!0),m(l.JSON,"JSON",!0)},function(t,e,n){t.exports=n(90)("native-function-to-string",Function.toString)},function(t,e,n){var u=n(45),c=n(92),l=n(75);t.exports=function(t){var e=u(t),n=c.f;if(n)for(var r,o=n(t),i=l.f,a=0;o.length>a;)i.call(t,r=o[a++])&&e.push(r);return e}},function(t,e,n){var r=n(1);r(r.S,"Object",{create:n(47)})},function(t,e,n){var r=n(1);r(r.S+r.F*!n(12),"Object",{defineProperty:n(13).f})},function(t,e,n){var r=n(1);r(r.S+r.F*!n(12),"Object",{defineProperties:n(161)})},function(t,e,n){var r=n(22),o=n(28).f;n(29)("getOwnPropertyDescriptor",function(){return function(t,e){return o(r(t),e)}})},function(t,e,n){var r=n(15),o=n(49);n(29)("getPrototypeOf",function(){return function(t){return o(r(t))}})},function(t,e,n){var r=n(15),o=n(45);n(29)("keys",function(){return function(t){return o(r(t))}})},function(t,e,n){n(29)("getOwnPropertyNames",function(){return n(162).f})},function(t,e,n){var r=n(6),o=n(40).onFreeze;n(29)("freeze",function(e){return function(t){return e&&r(t)?e(o(t)):t}})},function(t,e,n){var r=n(6),o=n(40).onFreeze;n(29)("seal",function(e){return function(t){return e&&r(t)?e(o(t)):t}})},function(t,e,n){var r=n(6),o=n(40).onFreeze;n(29)("preventExtensions",function(e){return function(t){return e&&r(t)?e(o(t)):t}})},function(t,e,n){var r=n(6);n(29)("isFrozen",function(e){return function(t){return!r(t)||!!e&&e(t)}})},function(t,e,n){var r=n(6);n(29)("isSealed",function(e){return function(t){return!r(t)||!!e&&e(t)}})},function(t,e,n){var r=n(6);n(29)("isExtensible",function(e){return function(t){return!!r(t)&&(!e||e(t))}})},function(t,e,n){var r=n(1);r(r.S+r.F,"Object",{assign:n(163)})},function(t,e,n){var r=n(1);r(r.S,"Object",{is:n(164)})},function(t,e,n){var r=n(1);r(r.S,"Object",{setPrototypeOf:n(118).set})},function(t,e,n){"use strict";var r=n(76),o={};o[n(8)("toStringTag")]="z",o+""!="[object z]"&&n(18)(Object.prototype,"toString",function(){return"[object "+r(this)+"]"},!0)},function(t,e,n){var r=n(1);r(r.P,"Function",{bind:n(165)})},function(t,e,n){var r=n(13).f,o=Function.prototype,i=/^\s*function ([^ (]*)/;"name"in o||n(12)&&r(o,"name",{configurable:!0,get:function(){try{return(""+this).match(i)[1]}catch(t){return""}}})},function(t,e,n){"use strict";var r=n(6),o=n(49),i=n(8)("hasInstance"),a=Function.prototype;i in a||n(13).f(a,i,{value:function(t){if("function"!=typeof this||!r(t))return!1;if(!r(this.prototype))return t instanceof this;for(;t=o(t);)if(this.prototype===t)return!0;return!1}})},function(t,e,n){var r=n(1),o=n(167);r(r.G+r.F*(parseInt!=o),{parseInt:o})},function(t,e,n){var r=n(1),o=n(168);r(r.G+r.F*(parseFloat!=o),{parseFloat:o})},function(t,e,n){"use strict";function r(t){var e=s(t,!1);if("string"==typeof e&&2<e.length){var n,r,o,i=(e=b?e.trim():d(e,3)).charCodeAt(0);if(43===i||45===i){if(88===(n=e.charCodeAt(2))||120===n)return NaN}else if(48===i){switch(e.charCodeAt(1)){case 66:case 98:r=2,o=49;break;case 79:case 111:r=8,o=55;break;default:return+e}for(var a,u=e.slice(2),c=0,l=u.length;c<l;c++)if((a=u.charCodeAt(c))<48||o<a)return NaN;return parseInt(u,r)}}return+e}var o=n(3),i=n(20),a=n(32),u=n(120),s=n(39),c=n(4),l=n(48).f,f=n(28).f,p=n(13).f,d=n(58).trim,h="Number",v=o[h],y=v,m=v.prototype,g=a(n(47)(m))==h,b="trim"in String.prototype;if(!v(" 0o1")||!v("0b1")||v("+0x1")){v=function(t){var e=arguments.length<1?0:t,n=this;return n instanceof v&&(g?c(function(){m.valueOf.call(n)}):a(n)!=h)?u(new y(r(e)),n,v):r(e)};for(var w,x=n(12)?l(y):"MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger".split(","),E=0;x.length>E;E++)i(y,w=x[E])&&!i(v,w)&&p(v,w,f(y,w));(v.prototype=m).constructor=v,n(18)(o,h,v)}},function(t,e,n){"use strict";function l(t,e){for(var n=-1,r=e;++n<6;)r+=t*a[n],a[n]=r%1e7,r=i(r/1e7)}function s(t){for(var e=6,n=0;0<=--e;)n+=a[e],a[e]=i(n/t),n=n%t*1e7}function f(){for(var t=6,e="";0<=--t;)if(""!==e||0===t||0!==a[t]){var n=String(a[t]);e=""===e?n:e+h.call("0",7-n.length)+n}return e}var r=n(1),p=n(27),d=n(169),h=n(121),o=1..toFixed,i=Math.floor,a=[0,0,0,0,0,0],v="Number.toFixed: incorrect invocation!",y=function(t,e,n){return 0===e?n:e%2==1?y(t,e-1,n*t):y(t*t,e/2,n)};r(r.P+r.F*(!!o&&("0.000"!==8e-5.toFixed(3)||"1"!==.9.toFixed(0)||"1.25"!==1.255.toFixed(2)||"1000000000000000128"!==(0xde0b6b3a7640080).toFixed(0))||!n(4)(function(){o.call({})})),"Number",{toFixed:function(t){var e,n,r,o,i=d(this,v),a=p(t),u="",c="0";if(a<0||20<a)throw RangeError(v);if(i!=i)return"NaN";if(i<=-1e21||1e21<=i)return String(i);if(i<0&&(u="-",i=-i),1e-21<i)if(n=(e=function(t){for(var e=0,n=t;4096<=n;)e+=12,n/=4096;for(;2<=n;)e+=1,n/=2;return e}(i*y(2,69,1))-69)<0?i*y(2,-e,1):i/y(2,e,1),n*=4503599627370496,0<(e=52-e)){for(l(0,n),r=a;7<=r;)l(1e7,0),r-=7;for(l(y(10,r,1),0),r=e-1;23<=r;)s(1<<23),r-=23;s(1<<r),l(1,1),s(2),c=f()}else l(0,n),l(1<<-e,0),c=f()+h.call("0",a);return c=0<a?u+((o=c.length)<=a?"0."+h.call("0",a-o)+c:c.slice(0,o-a)+"."+c.slice(o-a)):u+c}})},function(t,e,n){"use strict";var r=n(1),o=n(4),i=n(169),a=1..toPrecision;r(r.P+r.F*(o(function(){return"1"!==a.call(1,void 0)})||!o(function(){a.call({})})),"Number",{toPrecision:function(t){var e=i(this,"Number#toPrecision: incorrect invocation!");return void 0===t?a.call(e):a.call(e,t)}})},function(t,e,n){var r=n(1);r(r.S,"Number",{EPSILON:Math.pow(2,-52)})},function(t,e,n){var r=n(1),o=n(3).isFinite;r(r.S,"Number",{isFinite:function(t){return"number"==typeof t&&o(t)}})},function(t,e,n){var r=n(1);r(r.S,"Number",{isInteger:n(170)})},function(t,e,n){var r=n(1);r(r.S,"Number",{isNaN:function(t){return t!=t}})},function(t,e,n){var r=n(1),o=n(170),i=Math.abs;r(r.S,"Number",{isSafeInteger:function(t){return o(t)&&i(t)<=9007199254740991}})},function(t,e,n){var r=n(1);r(r.S,"Number",{MAX_SAFE_INTEGER:9007199254740991})},function(t,e,n){var r=n(1);r(r.S,"Number",{MIN_SAFE_INTEGER:-9007199254740991})},function(t,e,n){var r=n(1),o=n(168);r(r.S+r.F*(Number.parseFloat!=o),"Number",{parseFloat:o})},function(t,e,n){var r=n(1),o=n(167);r(r.S+r.F*(Number.parseInt!=o),"Number",{parseInt:o})},function(t,e,n){var r=n(1),o=n(171),i=Math.sqrt,a=Math.acosh;r(r.S+r.F*!(a&&710==Math.floor(a(Number.MAX_VALUE))&&a(1/0)==1/0),"Math",{acosh:function(t){return(t=+t)<1?NaN:94906265.62425156<t?Math.log(t)+Math.LN2:o(t-1+i(t-1)*i(t+1))}})},function(t,e,n){var r=n(1),o=Math.asinh;r(r.S+r.F*!(o&&0<1/o(0)),"Math",{asinh:function t(e){return isFinite(e=+e)&&0!=e?e<0?-t(-e):Math.log(e+Math.sqrt(e*e+1)):e}})},function(t,e,n){var r=n(1),o=Math.atanh;r(r.S+r.F*!(o&&1/o(-0)<0),"Math",{atanh:function(t){return 0==(t=+t)?t:Math.log((1+t)/(1-t))/2}})},function(t,e,n){var r=n(1),o=n(122);r(r.S,"Math",{cbrt:function(t){return o(t=+t)*Math.pow(Math.abs(t),1/3)}})},function(t,e,n){var r=n(1);r(r.S,"Math",{clz32:function(t){return(t>>>=0)?31-Math.floor(Math.log(t+.5)*Math.LOG2E):32}})},function(t,e,n){var r=n(1),o=Math.exp;r(r.S,"Math",{cosh:function(t){return(o(t=+t)+o(-t))/2}})},function(t,e,n){var r=n(1),o=n(123);r(r.S+r.F*(o!=Math.expm1),"Math",{expm1:o})},function(t,e,n){var r=n(1);r(r.S,"Math",{fround:n(284)})},function(t,e,n){var i=n(122),r=Math.pow,a=r(2,-52),u=r(2,-23),c=r(2,127)*(2-u),l=r(2,-126);t.exports=Math.fround||function(t){var e,n,r=Math.abs(t),o=i(t);return r<l?o*function(t){return t+1/a-1/a}(r/l/u)*l*u:c<(n=(e=(1+u/a)*r)-(e-r))||n!=n?o*(1/0):o*n}},function(t,e,n){var r=n(1),c=Math.abs;r(r.S,"Math",{hypot:function(t,e){for(var n,r,o=0,i=0,a=arguments.length,u=0;i<a;)u<(n=c(arguments[i++]))?(o=o*(r=u/n)*r+1,u=n):o+=0<n?(r=n/u)*r:n;return u===1/0?1/0:u*Math.sqrt(o)}})},function(t,e,n){var r=n(1),o=Math.imul;r(r.S+r.F*n(4)(function(){return-5!=o(4294967295,5)||2!=o.length}),"Math",{imul:function(t,e){var n=+t,r=+e,o=65535&n,i=65535&r;return 0|o*i+((65535&n>>>16)*i+o*(65535&r>>>16)<<16>>>0)}})},function(t,e,n){var r=n(1);r(r.S,"Math",{log10:function(t){return Math.log(t)*Math.LOG10E}})},function(t,e,n){var r=n(1);r(r.S,"Math",{log1p:n(171)})},function(t,e,n){var r=n(1);r(r.S,"Math",{log2:function(t){return Math.log(t)/Math.LN2}})},function(t,e,n){var r=n(1);r(r.S,"Math",{sign:n(122)})},function(t,e,n){var r=n(1),o=n(123),i=Math.exp;r(r.S+r.F*n(4)(function(){return-2e-17!=!Math.sinh(-2e-17)}),"Math",{sinh:function(t){return Math.abs(t=+t)<1?(o(t)-o(-t))/2:(i(t-1)-i(-t-1))*(Math.E/2)}})},function(t,e,n){var r=n(1),o=n(123),i=Math.exp;r(r.S,"Math",{tanh:function(t){var e=o(t=+t),n=o(-t);return e==1/0?1:n==1/0?-1:(e-n)/(i(t)+i(-t))}})},function(t,e,n){var r=n(1);r(r.S,"Math",{trunc:function(t){return(0<t?Math.floor:Math.ceil)(t)}})},function(t,e,n){var r=n(1),i=n(46),a=String.fromCharCode,o=String.fromCodePoint;r(r.S+r.F*(!!o&&1!=o.length),"String",{fromCodePoint:function(t){for(var e,n=[],r=arguments.length,o=0;o<r;){if(e=+arguments[o++],i(e,1114111)!==e)throw RangeError(e+" is not a valid code point");n.push(e<65536?a(e):a(55296+((e-=65536)>>10),e%1024+56320))}return n.join("")}})},function(t,e,n){var r=n(1),a=n(22),u=n(9);r(r.S,"String",{raw:function(t){for(var e=a(t.raw),n=u(e.length),r=arguments.length,o=[],i=0;i<n;)o.push(String(e[i++])),i<r&&o.push(String(arguments[i]));return o.join("")}})},function(t,e,n){"use strict";n(58)("trim",function(t){return function(){return t(this,3)}})},function(t,e,n){"use strict";var r=n(124)(!0);n(125)(String,"String",function(t){this._t=String(t),this._i=0},function(){var t,e=this._t,n=this._i;return n>=e.length?{value:void 0,done:!0}:(t=r(e,n),this._i+=t.length,{value:t,done:!1})})},function(t,e,n){"use strict";var r=n(1),o=n(124)(!1);r(r.P,"String",{codePointAt:function(t){return o(this,t)}})},function(t,e,n){"use strict";var r=n(1),u=n(9),c=n(126),l="endsWith",s=""[l];r(r.P+r.F*n(128)(l),"String",{endsWith:function(t,e){var n=c(this,t,l),r=1<arguments.length?e:void 0,o=u(n.length),i=void 0===r?o:Math.min(u(r),o),a=String(t);return s?s.call(n,a,i):n.slice(i-a.length,i)===a}})},function(t,e,n){"use strict";var r=n(1),o=n(126);r(r.P+r.F*n(128)("includes"),"String",{includes:function(t,e){return!!~o(this,t,"includes").indexOf(t,1<arguments.length?e:void 0)}})},function(t,e,n){var r=n(1);r(r.P,"String",{repeat:n(121)})},function(t,e,n){"use strict";var r=n(1),i=n(9),a=n(126),u="startsWith",c=""[u];r(r.P+r.F*n(128)(u),"String",{startsWith:function(t,e){var n=a(this,t,u),r=i(Math.min(1<arguments.length?e:void 0,n.length)),o=String(t);return c?c.call(n,o,r):n.slice(r,r+o.length)===o}})},function(t,e,n){"use strict";n(19)("anchor",function(e){return function(t){return e(this,"a","name",t)}})},function(t,e,n){"use strict";n(19)("big",function(t){return function(){return t(this,"big","","")}})},function(t,e,n){"use strict";n(19)("blink",function(t){return function(){return t(this,"blink","","")}})},function(t,e,n){"use strict";n(19)("bold",function(t){return function(){return t(this,"b","","")}})},function(t,e,n){"use strict";n(19)("fixed",function(t){return function(){return t(this,"tt","","")}})},function(t,e,n){"use strict";n(19)("fontcolor",function(e){return function(t){return e(this,"font","color",t)}})},function(t,e,n){"use strict";n(19)("fontsize",function(e){return function(t){return e(this,"font","size",t)}})},function(t,e,n){"use strict";n(19)("italics",function(t){return function(){return t(this,"i","","")}})},function(t,e,n){"use strict";n(19)("link",function(e){return function(t){return e(this,"a","href",t)}})},function(t,e,n){"use strict";n(19)("small",function(t){return function(){return t(this,"small","","")}})},function(t,e,n){"use strict";n(19)("strike",function(t){return function(){return t(this,"strike","","")}})},function(t,e,n){"use strict";n(19)("sub",function(t){return function(){return t(this,"sub","","")}})},function(t,e,n){"use strict";n(19)("sup",function(t){return function(){return t(this,"sup","","")}})},function(t,e,n){var r=n(1);r(r.S,"Date",{now:function(){return(new Date).getTime()}})},function(t,e,n){"use strict";var r=n(1),o=n(15),i=n(39);r(r.P+r.F*n(4)(function(){return null!==new Date(NaN).toJSON()||1!==Date.prototype.toJSON.call({toISOString:function(){return 1}})}),"Date",{toJSON:function(t){var e=o(this),n=i(e);return"number"!=typeof n||isFinite(n)?e.toISOString():null}})},function(t,e,n){var r=n(1),o=n(319);r(r.P+r.F*(Date.prototype.toISOString!==o),"Date",{toISOString:o})},function(t,e,n){"use strict";function r(t){return 9<t?t:"0"+t}var o=n(4),i=Date.prototype.getTime,a=Date.prototype.toISOString;t.exports=o(function(){return"0385-07-25T07:06:39.999Z"!=a.call(new Date(-5e13-1))})||!o(function(){a.call(new Date(NaN))})?function(){if(!isFinite(i.call(this)))throw RangeError("Invalid time value");var t=this.getUTCFullYear(),e=this.getUTCMilliseconds(),n=t<0?"-":9999<t?"+":"";return n+("00000"+Math.abs(t)).slice(n?-6:-4)+"-"+r(this.getUTCMonth()+1)+"-"+r(this.getUTCDate())+"T"+r(this.getUTCHours())+":"+r(this.getUTCMinutes())+":"+r(this.getUTCSeconds())+"."+(99<e?e:"0"+r(e))+"Z"}:a},function(t,e,n){var r=Date.prototype,o="Invalid Date",i=r.toString,a=r.getTime;new Date(NaN)+""!=o&&n(18)(r,"toString",function(){var t=a.call(this);return t==t?i.call(this):o})},function(t,e,n){var r=n(8)("toPrimitive"),o=Date.prototype;r in o||n(21)(o,r,n(322))},function(t,e,n){"use strict";var r=n(5),o=n(39);t.exports=function(t){if("string"!==t&&"number"!==t&&"default"!==t)throw TypeError("Incorrect hint");return o(r(this),"number"!=t)}},function(t,e,n){var r=n(1);r(r.S,"Array",{isArray:n(93)})},function(t,e,n){"use strict";var h=n(25),r=n(1),v=n(15),y=n(173),m=n(129),g=n(9),b=n(130),w=n(131);r(r.S+r.F*!n(94)(function(t){Array.from(t)}),"Array",{from:function(t,e,n){var r,o,i,a,u=v(t),c="function"==typeof this?this:Array,l=arguments.length,s=1<l?e:void 0,f=void 0!==s,p=0,d=w(u);if(f&&(s=h(s,2<l?n:void 0,2)),null==d||c==Array&&m(d))for(o=new c(r=g(u.length));p<r;p++)b(o,p,f?s(u[p],p):u[p]);else for(a=d.call(u),o=new c;!(i=a.next()).done;p++)b(o,p,f?y(a,s,[i.value,p],!0):i.value);return o.length=p,o}})},function(t,e,n){"use strict";var r=n(1),o=n(130);r(r.S+r.F*n(4)(function(){function t(){}return!(Array.of.call(t)instanceof t)}),"Array",{of:function(){for(var t=0,e=arguments.length,n=new("function"==typeof this?this:Array)(e);t<e;)o(n,t,arguments[t++]);return n.length=e,n}})},function(t,e,n){"use strict";var r=n(1),o=n(22),i=[].join;r(r.P+r.F*(n(74)!=Object||!n(24)(i)),"Array",{join:function(t){return i.call(o(this),void 0===t?",":t)}})},function(t,e,n){"use strict";var r=n(1),o=n(117),l=n(32),s=n(46),f=n(9),p=[].slice;r(r.P+r.F*n(4)(function(){o&&p.call(o)}),"Array",{slice:function(t,e){var n=f(this.length),r=l(this);if(e=void 0===e?n:e,"Array"==r)return p.call(this,t,e);for(var o=s(t,n),i=s(e,n),a=f(i-o),u=new Array(a),c=0;c<a;c++)u[c]="String"==r?this.charAt(o+c):this[o+c];return u}})},function(t,e,n){"use strict";var r=n(1),o=n(26),i=n(15),a=n(4),u=[].sort,c=[1,2,3];r(r.P+r.F*(a(function(){c.sort(void 0)})||!a(function(){c.sort(null)})||!n(24)(u)),"Array",{sort:function(t){return void 0===t?u.call(i(this)):u.call(i(this),o(t))}})},function(t,e,n){"use strict";var r=n(1),o=n(30)(0),i=n(24)([].forEach,!0);r(r.P+r.F*!i,"Array",{forEach:function(t,e){return o(this,t,e)}})},function(t,e,n){var r=n(6),o=n(93),i=n(8)("species");t.exports=function(t){var e;return o(t)&&("function"!=typeof(e=t.constructor)||e!==Array&&!o(e.prototype)||(e=void 0),r(e)&&null===(e=e[i])&&(e=void 0)),void 0===e?Array:e}},function(t,e,n){"use strict";var r=n(1),o=n(30)(1);r(r.P+r.F*!n(24)([].map,!0),"Array",{map:function(t,e){return o(this,t,e)}})},function(t,e,n){"use strict";var r=n(1),o=n(30)(2);r(r.P+r.F*!n(24)([].filter,!0),"Array",{filter:function(t,e){return o(this,t,e)}})},function(t,e,n){"use strict";var r=n(1),o=n(30)(3);r(r.P+r.F*!n(24)([].some,!0),"Array",{some:function(t,e){return o(this,t,e)}})},function(t,e,n){"use strict";var r=n(1),o=n(30)(4);r(r.P+r.F*!n(24)([].every,!0),"Array",{every:function(t,e){return o(this,t,e)}})},function(t,e,n){"use strict";var r=n(1),o=n(175);r(r.P+r.F*!n(24)([].reduce,!0),"Array",{reduce:function(t,e){return o(this,t,arguments.length,e,!1)}})},function(t,e,n){"use strict";var r=n(1),o=n(175);r(r.P+r.F*!n(24)([].reduceRight,!0),"Array",{reduceRight:function(t,e){return o(this,t,arguments.length,e,!0)}})},function(t,e,n){"use strict";var r=n(1),o=n(91)(!1),i=[].indexOf,a=!!i&&1/[1].indexOf(1,-0)<0;r(r.P+r.F*(a||!n(24)(i)),"Array",{indexOf:function(t,e){return a?i.apply(this,arguments)||0:o(this,t,e)}})},function(t,e,n){"use strict";var r=n(1),i=n(22),a=n(27),u=n(9),c=[].lastIndexOf,l=!!c&&1/[1].lastIndexOf(1,-0)<0;r(r.P+r.F*(l||!n(24)(c)),"Array",{lastIndexOf:function(t,e){if(l)return c.apply(this,arguments)||0;var n=i(this),r=u(n.length),o=r-1;for(1<arguments.length&&(o=Math.min(o,a(e))),o<0&&(o=r+o);0<=o;o--)if(o in n&&n[o]===t)return o||0;return-1}})},function(t,e,n){var r=n(1);r(r.P,"Array",{copyWithin:n(176)}),n(50)("copyWithin")},function(t,e,n){var r=n(1);r(r.P,"Array",{fill:n(132)}),n(50)("fill")},function(t,e,n){"use strict";var r=n(1),o=n(30)(5),i=!0;"find"in[]&&Array(1).find(function(){i=!1}),r(r.P+r.F*i,"Array",{find:function(t,e){return o(this,t,1<arguments.length?e:void 0)}}),n(50)("find")},function(t,e,n){"use strict";var r=n(1),o=n(30)(6),i="findIndex",a=!0;i in[]&&Array(1)[i](function(){a=!1}),r(r.P+r.F*a,"Array",{findIndex:function(t,e){return o(this,t,1<arguments.length?e:void 0)}}),n(50)(i)},function(t,e,n){n(60)("Array")},function(t,e,n){var r=n(3),i=n(120),o=n(13).f,a=n(48).f,u=n(127),c=n(95),l=r.RegExp,s=l,f=l.prototype,p=/a/g,d=/a/g,h=new l(p)!==p;if(n(12)&&(!h||n(4)(function(){return d[n(8)("match")]=!1,l(p)!=p||l(d)==d||"/a/i"!=l(p,"i")}))){l=function(t,e){var n=this instanceof l,r=u(t),o=void 0===e;return!n&&r&&t.constructor===l&&o?t:i(h?new s(r&&!o?t.source:t,e):s((r=t instanceof l)?t.source:t,r&&o?c.call(t):e),n?this:f,l)};function v(e){e in l||o(l,e,{configurable:!0,get:function(){return s[e]},set:function(t){s[e]=t}})}for(var y=a(s),m=0;y.length>m;)v(y[m++]);(f.constructor=l).prototype=f,n(18)(r,"RegExp",l)}n(60)("RegExp")},function(t,e,n){"use strict";n(179);function r(t){n(18)(RegExp.prototype,u,t,!0)}var o=n(5),i=n(95),a=n(12),u="toString",c=/./[u];n(4)(function(){return"/a/b"!=c.call({source:"a",flags:"b"})})?r(function(){var t=o(this);return"/".concat(t.source,"/","flags"in t?t.flags:!a&&t instanceof RegExp?i.call(t):void 0)}):c.name!=u&&r(function(){return c.call(this)})},function(t,e,n){"use strict";var f=n(5),p=n(9),d=n(135),h=n(96);n(97)("match",1,function(r,o,l,s){return[function(t){var e=r(this),n=null==t?void 0:t[o];return void 0!==n?n.call(t,e):new RegExp(t)[o](String(e))},function(t){var e=s(l,t,this);if(e.done)return e.value;var n=f(t),r=String(this);if(!n.global)return h(n,r);for(var o,i=n.unicode,a=[],u=n.lastIndex=0;null!==(o=h(n,r));){var c=String(o[0]);""===(a[u]=c)&&(n.lastIndex=d(r,p(n.lastIndex),i)),u++}return 0===u?null:a}]})},function(t,e,n){"use strict";var _=n(5),r=n(15),k=n(9),O=n(27),T=n(135),P=n(96),C=Math.max,j=Math.min,p=Math.floor,d=/\$([$&`']|\d\d?|<[^>]*>)/g,h=/\$([$&`']|\d\d?)/g;n(97)("replace",2,function(o,i,x,E){return[function(t,e){var n=o(this),r=null==t?void 0:t[i];return void 0!==r?r.call(t,n,e):x.call(String(n),t,e)},function(t,e){var n=E(x,t,this,e);if(n.done)return n.value;var r=_(t),o=String(this),i="function"==typeof e;i||(e=String(e));var a=r.global;if(a){var u=r.unicode;r.lastIndex=0}for(var c=[];;){var l=P(r,o);if(null===l)break;if(c.push(l),!a)break;""===String(l[0])&&(r.lastIndex=T(o,k(r.lastIndex),u))}for(var s,f="",p=0,d=0;d<c.length;d++){l=c[d];for(var h=String(l[0]),v=C(j(O(l.index),o.length),0),y=[],m=1;m<l.length;m++)y.push(void 0===(s=l[m])?s:String(s));var g=l.groups;if(i){var b=[h].concat(y,v,o);void 0!==g&&b.push(g);var w=String(e.apply(void 0,b))}else w=S(h,o,v,y,g,e);p<=v&&(f+=o.slice(p,v)+w,p=v+h.length)}return f+o.slice(p)}];function S(i,a,u,c,l,t){var s=u+i.length,f=c.length,e=h;return void 0!==l&&(l=r(l),e=d),x.call(t,e,function(t,e){var n;switch(e.charAt(0)){case"$":return"$";case"&":return i;case"`":return a.slice(0,u);case"'":return a.slice(s);case"<":n=l[e.slice(1,-1)];break;default:var r=+e;if(0==r)return t;if(f<r){var o=p(r/10);return 0===o?t:o<=f?void 0===c[o-1]?e.charAt(1):c[o-1]+e.charAt(1):t}n=c[r-1]}return void 0===n?"":n})}})},function(t,e,n){"use strict";var c=n(5),l=n(164),s=n(96);n(97)("search",1,function(r,o,a,u){return[function(t){var e=r(this),n=null==t?void 0:t[o];return void 0!==n?n.call(t,e):new RegExp(t)[o](String(e))},function(t){var e=u(a,t,this);if(e.done)return e.value;var n=c(t),r=String(this),o=n.lastIndex;l(o,0)||(n.lastIndex=0);var i=s(n,r);return l(n.lastIndex,o)||(n.lastIndex=o),null===i?-1:i.index}]})},function(t,e,n){"use strict";var f=n(127),b=n(5),w=n(77),x=n(135),E=n(9),S=n(96),p=n(134),r=n(4),_=Math.min,d=[].push,a="split",h="length",v="lastIndex",k=4294967295,O=!r(function(){RegExp(k,"y")});n(97)("split",2,function(o,i,y,m){var g;return g="c"=="abbc"[a](/(b)*/)[1]||4!="test"[a](/(?:)/,-1)[h]||2!="ab"[a](/(?:ab)*/)[h]||4!="."[a](/(.?)(.?)/)[h]||1<"."[a](/()()/)[h]||""[a](/.?/)[h]?function(t,e){var n=String(this);if(void 0===t&&0===e)return[];if(!f(t))return y.call(n,t,e);for(var r,o,i,a=[],u=(t.ignoreCase?"i":"")+(t.multiline?"m":"")+(t.unicode?"u":"")+(t.sticky?"y":""),c=0,l=void 0===e?k:e>>>0,s=new RegExp(t.source,u+"g");(r=p.call(s,n))&&!(c<(o=s[v])&&(a.push(n.slice(c,r.index)),1<r[h]&&r.index<n[h]&&d.apply(a,r.slice(1)),i=r[0][h],c=o,a[h]>=l));)s[v]===r.index&&s[v]++;return c===n[h]?!i&&s.test("")||a.push(""):a.push(n.slice(c)),a[h]>l?a.slice(0,l):a}:"0"[a](void 0,0)[h]?function(t,e){return void 0===t&&0===e?[]:y.call(this,t,e)}:y,[function(t,e){var n=o(this),r=null==t?void 0:t[i];return void 0!==r?r.call(t,n,e):g.call(String(n),t,e)},function(t,e){var n=m(g,t,this,e,g!==y);if(n.done)return n.value;var r=b(t),o=String(this),i=w(r,RegExp),a=r.unicode,u=(r.ignoreCase?"i":"")+(r.multiline?"m":"")+(r.unicode?"u":"")+(O?"y":"g"),c=new i(O?r:"^(?:"+r.source+")",u),l=void 0===e?k:e>>>0;if(0==l)return[];if(0===o.length)return null===S(c,o)?[o]:[];for(var s=0,f=0,p=[];f<o.length;){c.lastIndex=O?f:0;var d,h=S(c,O?o:o.slice(f));if(null===h||(d=_(E(c.lastIndex+(O?0:f)),o.length))===s)f=x(o,f,a);else{if(p.push(o.slice(s,f)),p.length===l)return p;for(var v=1;v<=h.length-1;v++)if(p.push(h[v]),p.length===l)return p;f=s=d}}return p.push(o.slice(s)),p}]})},function(t,e,n){var u=n(3),c=n(136).set,l=u.MutationObserver||u.WebKitMutationObserver,s=u.process,f=u.Promise,p="process"==n(32)(s);t.exports=function(){function t(){var t,e;for(p&&(t=s.domain)&&t.exit();n;){e=n.fn,n=n.next;try{e()}catch(t){throw n?o():r=void 0,t}}r=void 0,t&&t.enter()}var n,r,o;if(p)o=function(){s.nextTick(t)};else if(!l||u.navigator&&u.navigator.standalone)if(f&&f.resolve){var e=f.resolve(void 0);o=function(){e.then(t)}}else o=function(){c.call(u,t)};else{var i=!0,a=document.createTextNode("");new l(t).observe(a,{characterData:!0}),o=function(){a.data=i=!i}}return function(t){var e={fn:t,next:void 0};r&&(r.next=e),n||(n=e,o()),r=e}}},function(t,e){t.exports=function(t){try{return{e:!1,v:t()}}catch(t){return{e:!0,v:t}}}},function(t,e,n){"use strict";var r=n(183),o=n(51);t.exports=n(100)("Map",function(e){return function(t){return e(this,0<arguments.length?t:void 0)}},{get:function(t){var e=r.getEntry(o(this,"Map"),t);return e&&e.v},set:function(t,e){return r.def(o(this,"Map"),0===t?0:t,e)}},r,!0)},function(t,e,n){"use strict";var r=n(183),o=n(51);t.exports=n(100)("Set",function(e){return function(t){return e(this,0<arguments.length?t:void 0)}},{add:function(t){return r.def(o(this,"Set"),t=0===t?0:t,t)}},r)},function(t,e,n){"use strict";function r(e){return function(t){return e(this,0<arguments.length?t:void 0)}}var i,o=n(3),a=n(30)(0),u=n(18),c=n(40),l=n(163),s=n(184),f=n(6),p=n(51),d=n(51),h=!o.ActiveXObject&&"ActiveXObject"in o,v="WeakMap",y=c.getWeak,m=Object.isExtensible,g=s.ufstore,b={get:function(t){if(f(t)){var e=y(t);return!0===e?g(p(this,v)).get(t):e?e[this._i]:void 0}},set:function(t,e){return s.def(p(this,v),t,e)}},w=t.exports=n(100)(v,r,b,s,!0,!0);d&&h&&(l((i=s.getConstructor(r,v)).prototype,b),c.NEED=!0,a(["delete","has","get","set"],function(r){var t=w.prototype,o=t[r];u(t,r,function(t,e){if(!f(t)||m(t))return o.call(this,t,e);this._f||(this._f=new i);var n=this._f[r](t,e);return"set"==r?this:n})}))},function(t,e,n){"use strict";var r=n(184),o=n(51);n(100)("WeakSet",function(e){return function(t){return e(this,0<arguments.length?t:void 0)}},{add:function(t){return r.def(o(this,"WeakSet"),t,!0)}},r,!1,!0)},function(t,e,n){"use strict";var r=n(1),o=n(101),i=n(137),l=n(5),s=n(46),f=n(9),a=n(6),u=n(3).ArrayBuffer,p=n(77),d=i.ArrayBuffer,h=i.DataView,c=o.ABV&&u.isView,v=d.prototype.slice,y=o.VIEW,m="ArrayBuffer";r(r.G+r.W+r.F*(u!==d),{ArrayBuffer:d}),r(r.S+r.F*!o.CONSTR,m,{isView:function(t){return c&&c(t)||a(t)&&y in t}}),r(r.P+r.U+r.F*n(4)(function(){return!new d(2).slice(1,void 0).byteLength}),m,{slice:function(t,e){if(void 0!==v&&void 0===e)return v.call(l(this),t);for(var n=l(this).byteLength,r=s(t,n),o=s(void 0===e?n:e,n),i=new(p(this,d))(f(o-r)),a=new h(this),u=new h(i),c=0;r<o;)u.setUint8(c++,a.getUint8(r++));return i}}),n(60)(m)},function(t,e,n){var r=n(1);r(r.G+r.W+r.F*!n(101).ABV,{DataView:n(137).DataView})},function(t,e,n){n(34)("Int8",1,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Uint8",1,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Uint8",1,function(r){return function(t,e,n){return r(this,t,e,n)}},!0)},function(t,e,n){n(34)("Int16",2,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Uint16",2,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Int32",4,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Uint32",4,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Float32",4,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){n(34)("Float64",8,function(r){return function(t,e,n){return r(this,t,e,n)}})},function(t,e,n){var r=n(1),i=n(26),a=n(5),u=(n(3).Reflect||{}).apply,c=Function.apply;r(r.S+r.F*!n(4)(function(){u(function(){})}),"Reflect",{apply:function(t,e,n){var r=i(t),o=a(n);return u?u(r,e,o):c.call(r,e,o)}})},function(t,e,n){var r=n(1),c=n(47),l=n(26),s=n(5),f=n(6),o=n(4),p=n(165),d=(n(3).Reflect||{}).construct,h=o(function(){function t(){}return!(d(function(){},[],t)instanceof t)}),v=!o(function(){d(function(){})});r(r.S+r.F*(h||v),"Reflect",{construct:function(t,e,n){l(t),s(e);var r=arguments.length<3?t:l(n);if(v&&!h)return d(t,e,r);if(t==r){switch(e.length){case 0:return new t;case 1:return new t(e[0]);case 2:return new t(e[0],e[1]);case 3:return new t(e[0],e[1],e[2]);case 4:return new t(e[0],e[1],e[2],e[3])}var o=[null];return o.push.apply(o,e),new(p.apply(t,o))}var i=r.prototype,a=c(f(i)?i:Object.prototype),u=Function.apply.call(t,a,e);return f(u)?u:a}})},function(t,e,n){var r=n(13),o=n(1),i=n(5),a=n(39);o(o.S+o.F*n(4)(function(){Reflect.defineProperty(r.f({},1,{value:1}),1,{value:2})}),"Reflect",{defineProperty:function(t,e,n){i(t),e=a(e,!0),i(n);try{return r.f(t,e,n),!0}catch(t){return!1}}})},function(t,e,n){var r=n(1),o=n(28).f,i=n(5);r(r.S,"Reflect",{deleteProperty:function(t,e){var n=o(i(t),e);return!(n&&!n.configurable)&&delete t[e]}})},function(t,e,n){"use strict";function r(t){this._t=i(t),this._i=0;var e,n=this._k=[];for(e in t)n.push(e)}var o=n(1),i=n(5);n(172)(r,"Object",function(){var t,e=this._k;do{if(this._i>=e.length)return{value:void 0,done:!0}}while(!((t=e[this._i++])in this._t));return{value:t,done:!1}}),o(o.S,"Reflect",{enumerate:function(t){return new r(t)}})},function(t,e,n){var a=n(28),u=n(49),c=n(20),r=n(1),l=n(6),s=n(5);r(r.S,"Reflect",{get:function t(e,n){var r,o,i=arguments.length<3?e:arguments[2];return s(e)===i?e[n]:(r=a.f(e,n))?c(r,"value")?r.value:void 0!==r.get?r.get.call(i):void 0:l(o=u(e))?t(o,n,i):void 0}})},function(t,e,n){var r=n(28),o=n(1),i=n(5);o(o.S,"Reflect",{getOwnPropertyDescriptor:function(t,e){return r.f(i(t),e)}})},function(t,e,n){var r=n(1),o=n(49),i=n(5);r(r.S,"Reflect",{getPrototypeOf:function(t){return o(i(t))}})},function(t,e,n){var r=n(1);r(r.S,"Reflect",{has:function(t,e){return e in t}})},function(t,e,n){var r=n(1),o=n(5),i=Object.isExtensible;r(r.S,"Reflect",{isExtensible:function(t){return o(t),!i||i(t)}})},function(t,e,n){var r=n(1);r(r.S,"Reflect",{ownKeys:n(186)})},function(t,e,n){var r=n(1),o=n(5),i=Object.preventExtensions;r(r.S,"Reflect",{preventExtensions:function(t){o(t);try{return i&&i(t),!0}catch(t){return!1}}})},function(t,e,n){var c=n(13),l=n(28),s=n(49),f=n(20),r=n(1),p=n(42),d=n(5),h=n(6);r(r.S,"Reflect",{set:function t(e,n,r){var o,i,a=arguments.length<4?e:arguments[3],u=l.f(d(e),n);if(!u){if(h(i=s(e)))return t(i,n,r,a);u=p(0)}if(f(u,"value")){if(!1===u.writable||!h(a))return!1;if(o=l.f(a,n)){if(o.get||o.set||!1===o.writable)return!1;o.value=r,c.f(a,n,o)}else c.f(a,n,p(0,r));return!0}return void 0!==u.set&&(u.set.call(a,r),!0)}})},function(t,e,n){var r=n(1),o=n(118);o&&r(r.S,"Reflect",{setPrototypeOf:function(t,e){o.check(t,e);try{return o.set(t,e),!0}catch(t){return!1}}})},function(t,e,n){n(382),t.exports=n(11).Array.includes},function(t,e,n){"use strict";var r=n(1),o=n(91)(!0);r(r.P,"Array",{includes:function(t,e){return o(this,t,1<arguments.length?e:void 0)}}),n(50)("includes")},function(t,e,n){n(384),t.exports=n(11).Array.flatMap},function(t,e,n){"use strict";var r=n(1),i=n(385),a=n(15),u=n(9),c=n(26),l=n(174);r(r.P,"Array",{flatMap:function(t,e){var n,r,o=a(this);return c(t),n=u(o.length),r=l(o,0),i(r,o,o,n,0,1,t,e),r}}),n(50)("flatMap")},function(t,e,n){"use strict";var h=n(93),v=n(6),y=n(9),m=n(25),g=n(8)("isConcatSpreadable");t.exports=function t(e,n,r,o,i,a,u,c){for(var l,s,f=i,p=0,d=!!u&&m(u,c,3);p<o;){if(p in r){if(l=d?d(r[p],p,n):r[p],s=!1,v(l)&&(s=void 0!==(s=l[g])?!!s:h(l)),s&&0<a)f=t(e,n,l,y(l.length),f,a-1)-1;else{if(9007199254740991<=f)throw TypeError();e[f]=l}f++}p++}return f}},function(t,e,n){n(387),t.exports=n(11).String.padStart},function(t,e,n){"use strict";var r=n(1),o=n(187),i=n(99),a=/Version\/10\.\d+(\.\d+)?( Mobile\/\w+)? Safari\//.test(i);r(r.P+r.F*a,"String",{padStart:function(t,e){return o(this,t,1<arguments.length?e:void 0,!0)}})},function(t,e,n){n(389),t.exports=n(11).String.padEnd},function(t,e,n){"use strict";var r=n(1),o=n(187),i=n(99),a=/Version\/10\.\d+(\.\d+)?( Mobile\/\w+)? Safari\//.test(i);r(r.P+r.F*a,"String",{padEnd:function(t,e){return o(this,t,1<arguments.length?e:void 0,!1)}})},function(t,e,n){n(391),t.exports=n(11).String.trimLeft},function(t,e,n){"use strict";n(58)("trimLeft",function(t){return function(){return t(this,1)}},"trimStart")},function(t,e,n){n(393),t.exports=n(11).String.trimRight},function(t,e,n){"use strict";n(58)("trimRight",function(t){return function(){return t(this,2)}},"trimEnd")},function(t,e,n){n(395),t.exports=n(114).f("asyncIterator")},function(t,e,n){n(159)("asyncIterator")},function(t,e,n){n(397),t.exports=n(11).Object.getOwnPropertyDescriptors},function(t,e,n){var r=n(1),c=n(186),l=n(22),s=n(28),f=n(130);r(r.S,"Object",{getOwnPropertyDescriptors:function(t){for(var e,n,r=l(t),o=s.f,i=c(r),a={},u=0;i.length>u;)void 0!==(n=o(r,e=i[u++]))&&f(a,e,n);return a}})},function(t,e,n){n(399),t.exports=n(11).Object.values},function(t,e,n){var r=n(1),o=n(188)(!1);r(r.S,"Object",{values:function(t){return o(t)}})},function(t,e,n){n(401),t.exports=n(11).Object.entries},function(t,e,n){var r=n(1),o=n(188)(!0);r(r.S,"Object",{entries:function(t){return o(t)}})},function(t,e,n){"use strict";n(180),n(403),t.exports=n(11).Promise.finally},function(t,e,n){"use strict";var r=n(1),o=n(11),i=n(3),a=n(77),u=n(182);r(r.P+r.R,"Promise",{finally:function(e){var n=a(this,o.Promise||i.Promise),t="function"==typeof e;return this.then(t?function(t){return u(n,e()).then(function(){return t})}:e,t?function(t){return u(n,e()).then(function(){throw t})}:e)}})},function(t,e,n){n(405),n(406),n(407),t.exports=n(11)},function(t,e,n){function r(o){return function(t,e){var n=2<arguments.length,r=n&&u.call(arguments,2);return o(n?function(){("function"==typeof t?t:Function(t)).apply(this,r)}:t,e)}}var o=n(3),i=n(1),a=n(99),u=[].slice,c=/MSIE .\./.test(a);i(i.G+i.B+i.F*c,{setTimeout:r(o.setTimeout),setInterval:r(o.setInterval)})},function(t,e,n){var r=n(1),o=n(136);r(r.G+r.B,{setImmediate:o.set,clearImmediate:o.clear})},function(t,e,n){for(var r=n(133),o=n(45),i=n(18),a=n(3),u=n(21),c=n(59),l=n(8),s=l("iterator"),f=l("toStringTag"),p=c.Array,d={CSSRuleList:!0,CSSStyleDeclaration:!1,CSSValueList:!1,ClientRectList:!1,DOMRectList:!1,DOMStringList:!1,DOMTokenList:!0,DataTransferItemList:!1,FileList:!1,HTMLAllCollection:!1,HTMLCollection:!1,HTMLFormElement:!1,HTMLSelectElement:!1,MediaList:!0,MimeTypeArray:!1,NamedNodeMap:!1,NodeList:!0,PaintRequestList:!1,Plugin:!1,PluginArray:!1,SVGLengthList:!1,SVGNumberList:!1,SVGPathSegList:!1,SVGPointList:!1,SVGStringList:!1,SVGTransformList:!1,SourceBufferList:!1,StyleSheetList:!0,TextTrackCueList:!1,TextTrackList:!1,TouchList:!1},h=o(d),v=0;v<h.length;v++){var y,m=h[v],g=d[m],b=a[m],w=b&&b.prototype;if(w&&(w[s]||u(w,s,p),w[f]||u(w,f,m),c[m]=p,g))for(y in r)w[y]||i(w,y,r[y],!0)}},function(t,e,n){n(409),t.exports=n(14).global},function(t,e,n){var r=n(35);r(r.G,{global:n(16)})},function(t,e,n){"use strict";
/** @license React v16.8.6
* react-dom.production.min.js
*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/var r=n(2),g=n(191),u=n(412);function b(t){for(var e=arguments.length-1,n="https://reactjs.org/docs/error-decoder.html?invariant="+t,r=0;r<e;r++)n+="&args[]="+encodeURIComponent(arguments[r+1]);!function(t,e,n,r,o,i,a,u){if(!t){if((t=void 0)===e)t=Error("Minified exception occurred; use the non-minified dev environment for the full error message and additional helpful warnings.");else{var c=[n,r,o,i,a,u],l=0;(t=Error(e.replace(/%s/g,function(){return c[l++]}))).name="Invariant Violation"}throw t.framesToPop=1,t}}(!1,"Minified React error #"+t+"; visit %s for the full message or use the non-minified dev environment for full errors and additional helpful warnings. ",n)}r||b("227");var s=!1,f=null,p=!1,d=null,l={onError:function(t){s=!0,f=t}};function h(t,e,n,r,o,i,a,u,c){s=!1,f=null,function(t,e,n,r,o,i,a,u,c){var l=Array.prototype.slice.call(arguments,3);try{e.apply(n,l)}catch(t){this.onError(t)}}.apply(l,arguments)}var v=null,y={};function o(){if(v)for(var t in y){var e=y[t],n=v.indexOf(t);if(-1<n||b("96",t),!w[n])for(var r in e.extractEvents||b("97",t),n=(w[n]=e).eventTypes){var o=void 0,i=n[r],a=e,u=r;x.hasOwnProperty(u)&&b("99",u);var c=(x[u]=i).phasedRegistrationNames;if(c){for(o in c)c.hasOwnProperty(o)&&m(c[o],a,u);o=!0}else o=!!i.registrationName&&(m(i.registrationName,a,u),!0);o||b("98",r,t)}}}function m(t,e,n){E[t]&&b("100",t),E[t]=e,c[t]=e.eventTypes[n].dependencies}var w=[],x={},E={},c={},i=null,a=null,S=null;function _(t,e,n){var r=t.type||"unknown-event";t.currentTarget=S(n),function(t,e,n,r,o,i,a,u,c){if(h.apply(this,arguments),s){if(s){var l=f;s=!1,f=null}else b("198"),l=void 0;p||(p=!0,d=l)}}(r,e,void 0,t),t.currentTarget=null}function k(t,e){return null==e&&b("30"),null==t?e:Array.isArray(t)?(Array.isArray(e)?t.push.apply(t,e):t.push(e),t):Array.isArray(e)?[t].concat(e):[t,e]}function O(t,e,n){Array.isArray(t)?t.forEach(e,n):t&&e.call(n,t)}var T=null;function P(t){if(t){var e=t._dispatchListeners,n=t._dispatchInstances;if(Array.isArray(e))for(var r=0;r<e.length&&!t.isPropagationStopped();r++)_(t,e[r],n[r]);else e&&_(t,e,n);t._dispatchListeners=null,t._dispatchInstances=null,t.isPersistent()||t.constructor.release(t)}}var C={injectEventPluginOrder:function(t){v&&b("101"),v=Array.prototype.slice.call(t),o()},injectEventPluginsByName:function(t){var e,n=!1;for(e in t)if(t.hasOwnProperty(e)){var r=t[e];y.hasOwnProperty(e)&&y[e]===r||(y[e]&&b("102",e),y[e]=r,n=!0)}n&&o()}};function j(t,e){var n=t.stateNode;if(!n)return null;var r=i(n);if(!r)return null;n=r[e];t:switch(e){case"onClick":case"onClickCapture":case"onDoubleClick":case"onDoubleClickCapture":case"onMouseDown":case"onMouseDownCapture":case"onMouseMove":case"onMouseMoveCapture":case"onMouseUp":case"onMouseUpCapture":(r=!r.disabled)||(r=!("button"===(t=t.type)||"input"===t||"select"===t||"textarea"===t)),t=!r;break t;default:t=!1}return t?null:(n&&"function"!=typeof n&&b("231",e,typeof n),n)}function R(t){if(null!==t&&(T=k(T,t)),t=T,T=null,t&&(O(t,P),T&&b("95"),p))throw t=d,p=!1,d=null,t}var A=Math.random().toString(36).slice(2),N="__reactInternalInstance$"+A,M="__reactEventHandlers$"+A;function L(t){if(t[N])return t[N];for(;!t[N];){if(!t.parentNode)return null;t=t.parentNode}return 5===(t=t[N]).tag||6===t.tag?t:null}function I(t){return!(t=t[N])||5!==t.tag&&6!==t.tag?null:t}function F(t){if(5===t.tag||6===t.tag)return t.stateNode;b("33")}function U(t){return t[M]||null}function D(t){for(;(t=t.return)&&5!==t.tag;);return t||null}function W(t,e,n){(e=j(t,n.dispatchConfig.phasedRegistrationNames[e]))&&(n._dispatchListeners=k(n._dispatchListeners,e),n._dispatchInstances=k(n._dispatchInstances,t))}function z(t){if(t&&t.dispatchConfig.phasedRegistrationNames){for(var e=t._targetInst,n=[];e;)n.push(e),e=D(e);for(e=n.length;0<e--;)W(n[e],"captured",t);for(e=0;e<n.length;e++)W(n[e],"bubbled",t)}}function H(t,e,n){t&&n&&n.dispatchConfig.registrationName&&(e=j(t,n.dispatchConfig.registrationName))&&(n._dispatchListeners=k(n._dispatchListeners,e),n._dispatchInstances=k(n._dispatchInstances,t))}function q(t){t&&t.dispatchConfig.registrationName&&H(t._targetInst,null,t)}function B(t){O(t,z)}var V=!("undefined"==typeof window||!window.document||!window.document.createElement);function $(t,e){var n={};return n[t.toLowerCase()]=e.toLowerCase(),n["Webkit"+t]="webkit"+e,n["Moz"+t]="moz"+e,n}var G={animationend:$("Animation","AnimationEnd"),animationiteration:$("Animation","AnimationIteration"),animationstart:$("Animation","AnimationStart"),transitionend:$("Transition","TransitionEnd")},Y={},K={};function Q(t){if(Y[t])return Y[t];if(!G[t])return t;var e,n=G[t];for(e in n)if(n.hasOwnProperty(e)&&e in K)return Y[t]=n[e];return t}V&&(K=document.createElement("div").style,"AnimationEvent"in window||(delete G.animationend.animation,delete G.animationiteration.animation,delete G.animationstart.animation),"TransitionEvent"in window||delete G.transitionend.transition);var X=Q("animationend"),J=Q("animationiteration"),Z=Q("animationstart"),tt=Q("transitionend"),et="abort canplay canplaythrough durationchange emptied encrypted ended error loadeddata loadedmetadata loadstart pause play playing progress ratechange seeked seeking stalled suspend timeupdate volumechange waiting".split(" "),nt=null,rt=null,ot=null;function it(){if(ot)return ot;var t,e,n=rt,r=n.length,o="value"in nt?nt.value:nt.textContent,i=o.length;for(t=0;t<r&&n[t]===o[t];t++);var a=r-t;for(e=1;e<=a&&n[r-e]===o[i-e];e++);return ot=o.slice(t,1<e?1-e:void 0)}function at(){return!0}function ut(){return!1}function ct(t,e,n,r){for(var o in this.dispatchConfig=t,this._targetInst=e,this.nativeEvent=n,t=this.constructor.Interface)t.hasOwnProperty(o)&&((e=t[o])?this[o]=e(n):"target"===o?this.target=r:this[o]=n[o]);return this.isDefaultPrevented=(null!=n.defaultPrevented?n.defaultPrevented:!1===n.returnValue)?at:ut,this.isPropagationStopped=ut,this}function lt(t,e,n,r){if(this.eventPool.length){var o=this.eventPool.pop();return this.call(o,t,e,n,r),o}return new this(t,e,n,r)}function st(t){t instanceof this||b("279"),t.destructor(),this.eventPool.length<10&&this.eventPool.push(t)}function ft(t){t.eventPool=[],t.getPooled=lt,t.release=st}g(ct.prototype,{preventDefault:function(){this.defaultPrevented=!0;var t=this.nativeEvent;t&&(t.preventDefault?t.preventDefault():"unknown"!=typeof t.returnValue&&(t.returnValue=!1),this.isDefaultPrevented=at)},stopPropagation:function(){var t=this.nativeEvent;t&&(t.stopPropagation?t.stopPropagation():"unknown"!=typeof t.cancelBubble&&(t.cancelBubble=!0),this.isPropagationStopped=at)},persist:function(){this.isPersistent=at},isPersistent:ut,destructor:function(){var t,e=this.constructor.Interface;for(t in e)this[t]=null;this.nativeEvent=this._targetInst=this.dispatchConfig=null,this.isPropagationStopped=this.isDefaultPrevented=ut,this._dispatchInstances=this._dispatchListeners=null}}),ct.Interface={type:null,target:null,currentTarget:function(){return null},eventPhase:null,bubbles:null,cancelable:null,timeStamp:function(t){return t.timeStamp||Date.now()},defaultPrevented:null,isTrusted:null},ct.extend=function(t){function e(){}function n(){return r.apply(this,arguments)}var r=this;e.prototype=r.prototype;var o=new e;return g(o,n.prototype),((n.prototype=o).constructor=n).Interface=g({},r.Interface,t),n.extend=r.extend,ft(n),n},ft(ct);var pt=ct.extend({data:null}),dt=ct.extend({data:null}),ht=[9,13,27,32],vt=V&&"CompositionEvent"in window,yt=null;V&&"documentMode"in document&&(yt=document.documentMode);var mt=V&&"TextEvent"in window&&!yt,gt=V&&(!vt||yt&&8<yt&&yt<=11),bt=String.fromCharCode(32),wt={beforeInput:{phasedRegistrationNames:{bubbled:"onBeforeInput",captured:"onBeforeInputCapture"},dependencies:["compositionend","keypress","textInput","paste"]},compositionEnd:{phasedRegistrationNames:{bubbled:"onCompositionEnd",captured:"onCompositionEndCapture"},dependencies:"blur compositionend keydown keypress keyup mousedown".split(" ")},compositionStart:{phasedRegistrationNames:{bubbled:"onCompositionStart",captured:"onCompositionStartCapture"},dependencies:"blur compositionstart keydown keypress keyup mousedown".split(" ")},compositionUpdate:{phasedRegistrationNames:{bubbled:"onCompositionUpdate",captured:"onCompositionUpdateCapture"},dependencies:"blur compositionupdate keydown keypress keyup mousedown".split(" ")}},xt=!1;function Et(t,e){switch(t){case"keyup":return-1!==ht.indexOf(e.keyCode);case"keydown":return 229!==e.keyCode;case"keypress":case"mousedown":case"blur":return!0;default:return!1}}function St(t){return"object"==typeof(t=t.detail)&&"data"in t?t.data:null}var _t=!1;var kt={eventTypes:wt,extractEvents:function(t,e,n,r){var o=void 0,i=void 0;if(vt)t:{switch(t){case"compositionstart":o=wt.compositionStart;break t;case"compositionend":o=wt.compositionEnd;break t;case"compositionupdate":o=wt.compositionUpdate;break t}o=void 0}else _t?Et(t,n)&&(o=wt.compositionEnd):"keydown"===t&&229===n.keyCode&&(o=wt.compositionStart);return i=o?(gt&&"ko"!==n.locale&&(_t||o!==wt.compositionStart?o===wt.compositionEnd&&_t&&(i=it()):(rt="value"in(nt=r)?nt.value:nt.textContent,_t=!0)),o=pt.getPooled(o,e,n,r),i?o.data=i:null!==(i=St(n))&&(o.data=i),B(o),o):null,(t=mt?function(t,e){switch(t){case"compositionend":return St(e);case"keypress":return 32!==e.which?null:(xt=!0,bt);case"textInput":return(t=e.data)===bt&&xt?null:t;default:return null}}(t,n):function(t,e){if(_t)return"compositionend"===t||!vt&&Et(t,e)?(t=it(),ot=rt=nt=null,_t=!1,t):null;switch(t){case"paste":return null;case"keypress":if(!(e.ctrlKey||e.altKey||e.metaKey)||e.ctrlKey&&e.altKey){if(e.char&&1<e.char.length)return e.char;if(e.which)return String.fromCharCode(e.which)}return null;case"compositionend":return gt&&"ko"!==e.locale?null:e.data;default:return null}}(t,n))?((e=dt.getPooled(wt.beforeInput,e,n,r)).data=t,B(e)):e=null,null===i?e:null===e?i:[i,e]}},Ot=null,Tt=null,Pt=null;function Ct(t){if(t=a(t)){"function"!=typeof Ot&&b("280");var e=i(t.stateNode);Ot(t.stateNode,t.type,e)}}function jt(t){Tt?Pt?Pt.push(t):Pt=[t]:Tt=t}function Rt(){if(Tt){var t=Tt,e=Pt;if(Pt=Tt=null,Ct(t),e)for(t=0;t<e.length;t++)Ct(e[t])}}function At(t,e){return t(e)}function Nt(t,e,n){return t(e,n)}function Mt(){}var Lt=!1;function It(t,e){if(Lt)return t(e);Lt=!0;try{return At(t,e)}finally{Lt=!1,null===Tt&&null===Pt||(Mt(),Rt())}}var Ft={color:!0,date:!0,datetime:!0,"datetime-local":!0,email:!0,month:!0,number:!0,password:!0,range:!0,search:!0,tel:!0,text:!0,time:!0,url:!0,week:!0};function Ut(t){var e=t&&t.nodeName&&t.nodeName.toLowerCase();return"input"===e?!!Ft[t.type]:"textarea"===e}function Dt(t){return(t=t.target||t.srcElement||window).correspondingUseElement&&(t=t.correspondingUseElement),3===t.nodeType?t.parentNode:t}function Wt(t){if(!V)return!1;var e=(t="on"+t)in document;return e||((e=document.createElement("div")).setAttribute(t,"return;"),e="function"==typeof e[t]),e}function zt(t){var e=t.type;return(t=t.nodeName)&&"input"===t.toLowerCase()&&("checkbox"===e||"radio"===e)}function Ht(t){t._valueTracker||(t._valueTracker=function(t){var e=zt(t)?"checked":"value",n=Object.getOwnPropertyDescriptor(t.constructor.prototype,e),r=""+t[e];if(!t.hasOwnProperty(e)&&void 0!==n&&"function"==typeof n.get&&"function"==typeof n.set){var o=n.get,i=n.set;return Object.defineProperty(t,e,{configurable:!0,get:function(){return o.call(this)},set:function(t){r=""+t,i.call(this,t)}}),Object.defineProperty(t,e,{enumerable:n.enumerable}),{getValue:function(){return r},setValue:function(t){r=""+t},stopTracking:function(){t._valueTracker=null,delete t[e]}}}}(t))}function qt(t){if(!t)return!1;var e=t._valueTracker;if(!e)return!0;var n=e.getValue(),r="";return t&&(r=zt(t)?t.checked?"true":"false":t.value),(t=r)!==n&&(e.setValue(t),!0)}var Bt=r.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;Bt.hasOwnProperty("ReactCurrentDispatcher")||(Bt.ReactCurrentDispatcher={current:null});var Vt=/^(.*)[\\\/]/,$t="function"==typeof Symbol&&Symbol.for,Gt=$t?Symbol.for("react.element"):60103,Yt=$t?Symbol.for("react.portal"):60106,Kt=$t?Symbol.for("react.fragment"):60107,Qt=$t?Symbol.for("react.strict_mode"):60108,Xt=$t?Symbol.for("react.profiler"):60114,Jt=$t?Symbol.for("react.provider"):60109,Zt=$t?Symbol.for("react.context"):60110,te=$t?Symbol.for("react.concurrent_mode"):60111,ee=$t?Symbol.for("react.forward_ref"):60112,ne=$t?Symbol.for("react.suspense"):60113,re=$t?Symbol.for("react.memo"):60115,oe=$t?Symbol.for("react.lazy"):60116,ie="function"==typeof Symbol&&Symbol.iterator;function ae(t){return null===t||"object"!=typeof t?null:"function"==typeof(t=ie&&t[ie]||t["@@iterator"])?t:null}function ue(t){if(null==t)return null;if("function"==typeof t)return t.displayName||t.name||null;if("string"==typeof t)return t;switch(t){case te:return"ConcurrentMode";case Kt:return"Fragment";case Yt:return"Portal";case Xt:return"Profiler";case Qt:return"StrictMode";case ne:return"Suspense"}if("object"==typeof t)switch(t.$$typeof){case Zt:return"Context.Consumer";case Jt:return"Context.Provider";case ee:var e=t.render;return e=e.displayName||e.name||"",t.displayName||(""!==e?"ForwardRef("+e+")":"ForwardRef");case re:return ue(t.type);case oe:if(t=1===t._status?t._result:null)return ue(t)}return null}function ce(t){var e="";do{t:switch(t.tag){case 3:case 4:case 6:case 7:case 10:case 9:var n="";break t;default:var r=t._debugOwner,o=t._debugSource,i=ue(t.type);n=null,r&&(n=ue(r.type)),r=i,i="",o?i=" (at "+o.fileName.replace(Vt,"")+":"+o.lineNumber+")":n&&(i=" (created by "+n+")"),n="\n in "+(r||"Unknown")+i}e+=n,t=t.return}while(t);return e}var le=/^[:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD][:A-Z_a-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD\-.0-9\u00B7\u0300-\u036F\u203F-\u2040]*$/,se=Object.prototype.hasOwnProperty,fe={},pe={};function de(t,e,n,r,o){this.acceptsBooleans=2===e||3===e||4===e,this.attributeName=r,this.attributeNamespace=o,this.mustUseProperty=n,this.propertyName=t,this.type=e}var he={};"children dangerouslySetInnerHTML defaultValue defaultChecked innerHTML suppressContentEditableWarning suppressHydrationWarning style".split(" ").forEach(function(t){he[t]=new de(t,0,!1,t,null)}),[["acceptCharset","accept-charset"],["className","class"],["htmlFor","for"],["httpEquiv","http-equiv"]].forEach(function(t){var e=t[0];he[e]=new de(e,1,!1,t[1],null)}),["contentEditable","draggable","spellCheck","value"].forEach(function(t){he[t]=new de(t,2,!1,t.toLowerCase(),null)}),["autoReverse","externalResourcesRequired","focusable","preserveAlpha"].forEach(function(t){he[t]=new de(t,2,!1,t,null)}),"allowFullScreen async autoFocus autoPlay controls default defer disabled formNoValidate hidden loop noModule noValidate open playsInline readOnly required reversed scoped seamless itemScope".split(" ").forEach(function(t){he[t]=new de(t,3,!1,t.toLowerCase(),null)}),["checked","multiple","muted","selected"].forEach(function(t){he[t]=new de(t,3,!0,t,null)}),["capture","download"].forEach(function(t){he[t]=new de(t,4,!1,t,null)}),["cols","rows","size","span"].forEach(function(t){he[t]=new de(t,6,!1,t,null)}),["rowSpan","start"].forEach(function(t){he[t]=new de(t,5,!1,t.toLowerCase(),null)});var ve=/[\-:]([a-z])/g;function ye(t){return t[1].toUpperCase()}function me(t,e,n,r){var o=he.hasOwnProperty(e)?he[e]:null;(null!==o?0!==o.type:r||(!(2<e.length)||"o"!==e[0]&&"O"!==e[0]||"n"!==e[1]&&"N"!==e[1]))&&(function(t,e,n,r){if(null==e||function(t,e,n,r){if(null!==n&&0===n.type)return!1;switch(typeof e){case"function":case"symbol":return!0;case"boolean":return!r&&(null!==n?!n.acceptsBooleans:"data-"!==(t=t.toLowerCase().slice(0,5))&&"aria-"!==t);default:return!1}}(t,e,n,r))return!0;if(r)return!1;if(null!==n)switch(n.type){case 3:return!e;case 4:return!1===e;case 5:return isNaN(e);case 6:return isNaN(e)||e<1}return!1}(e,n,o,r)&&(n=null),r||null===o?function(t){return!!se.call(pe,t)||!se.call(fe,t)&&(le.test(t)?pe[t]=!0:!(fe[t]=!0))}(e)&&(null===n?t.removeAttribute(e):t.setAttribute(e,""+n)):o.mustUseProperty?t[o.propertyName]=null===n?3!==o.type&&"":n:(e=o.attributeName,r=o.attributeNamespace,null===n?t.removeAttribute(e):(n=3===(o=o.type)||4===o&&!0===n?"":""+n,r?t.setAttributeNS(r,e,n):t.setAttribute(e,n))))}function ge(t){switch(typeof t){case"boolean":case"number":case"object":case"string":case"undefined":return t;default:return""}}function be(t,e){var n=e.checked;return g({},e,{defaultChecked:void 0,defaultValue:void 0,value:void 0,checked:null!=n?n:t._wrapperState.initialChecked})}function we(t,e){var n=null==e.defaultValue?"":e.defaultValue,r=null!=e.checked?e.checked:e.defaultChecked;n=ge(null!=e.value?e.value:n),t._wrapperState={initialChecked:r,initialValue:n,controlled:"checkbox"===e.type||"radio"===e.type?null!=e.checked:null!=e.value}}function xe(t,e){null!=(e=e.checked)&&me(t,"checked",e,!1)}function Ee(t,e){xe(t,e);var n=ge(e.value),r=e.type;if(null!=n)"number"===r?(0===n&&""===t.value||t.value!=n)&&(t.value=""+n):t.value!==""+n&&(t.value=""+n);else if("submit"===r||"reset"===r)return void t.removeAttribute("value");e.hasOwnProperty("value")?_e(t,e.type,n):e.hasOwnProperty("defaultValue")&&_e(t,e.type,ge(e.defaultValue)),null==e.checked&&null!=e.defaultChecked&&(t.defaultChecked=!!e.defaultChecked)}function Se(t,e,n){if(e.hasOwnProperty("value")||e.hasOwnProperty("defaultValue")){var r=e.type;if(!("submit"!==r&&"reset"!==r||void 0!==e.value&&null!==e.value))return;e=""+t._wrapperState.initialValue,n||e===t.value||(t.value=e),t.defaultValue=e}""!==(n=t.name)&&(t.name=""),t.defaultChecked=!t.defaultChecked,t.defaultChecked=!!t._wrapperState.initialChecked,""!==n&&(t.name=n)}function _e(t,e,n){"number"===e&&t.ownerDocument.activeElement===t||(null==n?t.defaultValue=""+t._wrapperState.initialValue:t.defaultValue!==""+n&&(t.defaultValue=""+n))}"accent-height alignment-baseline arabic-form baseline-shift cap-height clip-path clip-rule color-interpolation color-interpolation-filters color-profile color-rendering dominant-baseline enable-background fill-opacity fill-rule flood-color flood-opacity font-family font-size font-size-adjust font-stretch font-style font-variant font-weight glyph-name glyph-orientation-horizontal glyph-orientation-vertical horiz-adv-x horiz-origin-x image-rendering letter-spacing lighting-color marker-end marker-mid marker-start overline-position overline-thickness paint-order panose-1 pointer-events rendering-intent shape-rendering stop-color stop-opacity strikethrough-position strikethrough-thickness stroke-dasharray stroke-dashoffset stroke-linecap stroke-linejoin stroke-miterlimit stroke-opacity stroke-width text-anchor text-decoration text-rendering underline-position underline-thickness unicode-bidi unicode-range units-per-em v-alphabetic v-hanging v-ideographic v-mathematical vector-effect vert-adv-y vert-origin-x vert-origin-y word-spacing writing-mode xmlns:xlink x-height".split(" ").forEach(function(t){var e=t.replace(ve,ye);he[e]=new de(e,1,!1,t,null)}),"xlink:actuate xlink:arcrole xlink:href xlink:role xlink:show xlink:title xlink:type".split(" ").forEach(function(t){var e=t.replace(ve,ye);he[e]=new de(e,1,!1,t,"http://www.w3.org/1999/xlink")}),["xml:base","xml:lang","xml:space"].forEach(function(t){var e=t.replace(ve,ye);he[e]=new de(e,1,!1,t,"http://www.w3.org/XML/1998/namespace")}),["tabIndex","crossOrigin"].forEach(function(t){he[t]=new de(t,1,!1,t.toLowerCase(),null)});var ke={change:{phasedRegistrationNames:{bubbled:"onChange",captured:"onChangeCapture"},dependencies:"blur change click focus input keydown keyup selectionchange".split(" ")}};function Oe(t,e,n){return(t=ct.getPooled(ke.change,t,e,n)).type="change",jt(n),B(t),t}var Te=null,Pe=null;function Ce(t){R(t)}function je(t){if(qt(F(t)))return t}function Re(t,e){if("change"===t)return e}var Ae=!1;function Ne(){Te&&(Te.detachEvent("onpropertychange",Me),Pe=Te=null)}function Me(t){"value"===t.propertyName&&je(Pe)&&It(Ce,t=Oe(Pe,t,Dt(t)))}function Le(t,e,n){"focus"===t?(Ne(),Pe=n,(Te=e).attachEvent("onpropertychange",Me)):"blur"===t&&Ne()}function Ie(t){if("selectionchange"===t||"keyup"===t||"keydown"===t)return je(Pe)}function Fe(t,e){if("click"===t)return je(e)}function Ue(t,e){if("input"===t||"change"===t)return je(e)}V&&(Ae=Wt("input")&&(!document.documentMode||9<document.documentMode));var De={eventTypes:ke,_isInputEventSupported:Ae,extractEvents:function(t,e,n,r){var o=e?F(e):window,i=void 0,a=void 0,u=o.nodeName&&o.nodeName.toLowerCase();if("select"===u||"input"===u&&"file"===o.type?i=Re:Ut(o)?Ae?i=Ue:(i=Ie,a=Le):!(u=o.nodeName)||"input"!==u.toLowerCase()||"checkbox"!==o.type&&"radio"!==o.type||(i=Fe),i=i&&i(t,e))return Oe(i,n,r);a&&a(t,o,e),"blur"===t&&(t=o._wrapperState)&&t.controlled&&"number"===o.type&&_e(o,"number",o.value)}},We=ct.extend({view:null,detail:null}),ze={Alt:"altKey",Control:"ctrlKey",Meta:"metaKey",Shift:"shiftKey"};function He(t){var e=this.nativeEvent;return e.getModifierState?e.getModifierState(t):!!(t=ze[t])&&!!e[t]}function qe(){return He}var Be=0,Ve=0,$e=!1,Ge=!1,Ye=We.extend({screenX:null,screenY:null,clientX:null,clientY:null,pageX:null,pageY:null,ctrlKey:null,shiftKey:null,altKey:null,metaKey:null,getModifierState:qe,button:null,buttons:null,relatedTarget:function(t){return t.relatedTarget||(t.fromElement===t.srcElement?t.toElement:t.fromElement)},movementX:function(t){if("movementX"in t)return t.movementX;var e=Be;return Be=t.screenX,$e?"mousemove"===t.type?t.screenX-e:0:($e=!0,0)},movementY:function(t){if("movementY"in t)return t.movementY;var e=Ve;return Ve=t.screenY,Ge?"mousemove"===t.type?t.screenY-e:0:(Ge=!0,0)}}),Ke=Ye.extend({pointerId:null,width:null,height:null,pressure:null,tangentialPressure:null,tiltX:null,tiltY:null,twist:null,pointerType:null,isPrimary:null}),Qe={mouseEnter:{registrationName:"onMouseEnter",dependencies:["mouseout","mouseover"]},mouseLeave:{registrationName:"onMouseLeave",dependencies:["mouseout","mouseover"]},pointerEnter:{registrationName:"onPointerEnter",dependencies:["pointerout","pointerover"]},pointerLeave:{registrationName:"onPointerLeave",dependencies:["pointerout","pointerover"]}},Xe={eventTypes:Qe,extractEvents:function(t,e,n,r){var o="mouseover"===t||"pointerover"===t,i="mouseout"===t||"pointerout"===t;if(o&&(n.relatedTarget||n.fromElement)||!i&&!o)return null;if(o=r.window===r?r:(o=r.ownerDocument)?o.defaultView||o.parentWindow:window,i?(i=e,e=(e=n.relatedTarget||n.toElement)?L(e):null):i=null,i===e)return null;var a=void 0,u=void 0,c=void 0,l=void 0;"mouseout"===t||"mouseover"===t?(a=Ye,u=Qe.mouseLeave,c=Qe.mouseEnter,l="mouse"):"pointerout"!==t&&"pointerover"!==t||(a=Ke,u=Qe.pointerLeave,c=Qe.pointerEnter,l="pointer");var s=null==i?o:F(i);if(o=null==e?o:F(e),(t=a.getPooled(u,i,n,r)).type=l+"leave",t.target=s,t.relatedTarget=o,(n=a.getPooled(c,e,n,r)).type=l+"enter",n.target=o,n.relatedTarget=s,r=e,i&&r)t:{for(o=r,l=0,a=e=i;a;a=D(a))l++;for(a=0,c=o;c;c=D(c))a++;for(;0<l-a;)e=D(e),l--;for(;0<a-l;)o=D(o),a--;for(;l--;){if(e===o||e===o.alternate)break t;e=D(e),o=D(o)}e=null}else e=null;for(o=e,e=[];i&&i!==o&&(null===(l=i.alternate)||l!==o);)e.push(i),i=D(i);for(i=[];r&&r!==o&&(null===(l=r.alternate)||l!==o);)i.push(r),r=D(r);for(r=0;r<e.length;r++)H(e[r],"bubbled",t);for(r=i.length;0<r--;)H(i[r],"captured",n);return[t,n]}};function Je(t,e){return t===e&&(0!==t||1/t==1/e)||t!=t&&e!=e}var Ze=Object.prototype.hasOwnProperty;function tn(t,e){if(Je(t,e))return!0;if("object"!=typeof t||null===t||"object"!=typeof e||null===e)return!1;var n=Object.keys(t),r=Object.keys(e);if(n.length!==r.length)return!1;for(r=0;r<n.length;r++)if(!Ze.call(e,n[r])||!Je(t[n[r]],e[n[r]]))return!1;return!0}function en(t){var e=t;if(t.alternate)for(;e.return;)e=e.return;else{if(0!=(2&e.effectTag))return 1;for(;e.return;)if(0!=(2&(e=e.return).effectTag))return 1}return 3===e.tag?2:3}function nn(t){2!==en(t)&&b("188")}function rn(t){if(!(t=function(t){var e=t.alternate;if(!e)return 3===(e=en(t))&&b("188"),1===e?null:t;for(var n=t,r=e;;){var o=n.return,i=o?o.alternate:null;if(!o||!i)break;if(o.child===i.child){for(var a=o.child;a;){if(a===n)return nn(o),t;if(a===r)return nn(o),e;a=a.sibling}b("188")}if(n.return!==r.return)n=o,r=i;else{a=!1;for(var u=o.child;u;){if(u===n){a=!0,n=o,r=i;break}if(u===r){a=!0,r=o,n=i;break}u=u.sibling}if(!a){for(u=i.child;u;){if(u===n){a=!0,n=i,r=o;break}if(u===r){a=!0,r=i,n=o;break}u=u.sibling}a||b("189")}}n.alternate!==r&&b("190")}return 3!==n.tag&&b("188"),n.stateNode.current===n?t:e}(t)))return null;for(var e=t;;){if(5===e.tag||6===e.tag)return e;if(e.child)e=(e.child.return=e).child;else{if(e===t)break;for(;!e.sibling;){if(!e.return||e.return===t)return null;e=e.return}e.sibling.return=e.return,e=e.sibling}}return null}var on=ct.extend({animationName:null,elapsedTime:null,pseudoElement:null}),an=ct.extend({clipboardData:function(t){return"clipboardData"in t?t.clipboardData:window.clipboardData}}),un=We.extend({relatedTarget:null});function cn(t){var e=t.keyCode;return"charCode"in t?0===(t=t.charCode)&&13===e&&(t=13):t=e,10===t&&(t=13),32<=t||13===t?t:0}var ln={Esc:"Escape",Spacebar:" ",Left:"ArrowLeft",Up:"ArrowUp",Right:"ArrowRight",Down:"ArrowDown",Del:"Delete",Win:"OS",Menu:"ContextMenu",Apps:"ContextMenu",Scroll:"ScrollLock",MozPrintableKey:"Unidentified"},sn={8:"Backspace",9:"Tab",12:"Clear",13:"Enter",16:"Shift",17:"Control",18:"Alt",19:"Pause",20:"CapsLock",27:"Escape",32:" ",33:"PageUp",34:"PageDown",35:"End",36:"Home",37:"ArrowLeft",38:"ArrowUp",39:"ArrowRight",40:"ArrowDown",45:"Insert",46:"Delete",112:"F1",113:"F2",114:"F3",115:"F4",116:"F5",117:"F6",118:"F7",119:"F8",120:"F9",121:"F10",122:"F11",123:"F12",144:"NumLock",145:"ScrollLock",224:"Meta"},fn=We.extend({key:function(t){if(t.key){var e=ln[t.key]||t.key;if("Unidentified"!==e)return e}return"keypress"===t.type?13===(t=cn(t))?"Enter":String.fromCharCode(t):"keydown"===t.type||"keyup"===t.type?sn[t.keyCode]||"Unidentified":""},location:null,ctrlKey:null,shiftKey:null,altKey:null,metaKey:null,repeat:null,locale:null,getModifierState:qe,charCode:function(t){return"keypress"===t.type?cn(t):0},keyCode:function(t){return"keydown"===t.type||"keyup"===t.type?t.keyCode:0},which:function(t){return"keypress"===t.type?cn(t):"keydown"===t.type||"keyup"===t.type?t.keyCode:0}}),pn=Ye.extend({dataTransfer:null}),dn=We.extend({touches:null,targetTouches:null,changedTouches:null,altKey:null,metaKey:null,ctrlKey:null,shiftKey:null,getModifierState:qe}),hn=ct.extend({propertyName:null,elapsedTime:null,pseudoElement:null}),vn=Ye.extend({deltaX:function(t){return"deltaX"in t?t.deltaX:"wheelDeltaX"in t?-t.wheelDeltaX:0},deltaY:function(t){return"deltaY"in t?t.deltaY:"wheelDeltaY"in t?-t.wheelDeltaY:"wheelDelta"in t?-t.wheelDelta:0},deltaZ:null,deltaMode:null}),yn=[["abort","abort"],[X,"animationEnd"],[J,"animationIteration"],[Z,"animationStart"],["canplay","canPlay"],["canplaythrough","canPlayThrough"],["drag","drag"],["dragenter","dragEnter"],["dragexit","dragExit"],["dragleave","dragLeave"],["dragover","dragOver"],["durationchange","durationChange"],["emptied","emptied"],["encrypted","encrypted"],["ended","ended"],["error","error"],["gotpointercapture","gotPointerCapture"],["load","load"],["loadeddata","loadedData"],["loadedmetadata","loadedMetadata"],["loadstart","loadStart"],["lostpointercapture","lostPointerCapture"],["mousemove","mouseMove"],["mouseout","mouseOut"],["mouseover","mouseOver"],["playing","playing"],["pointermove","pointerMove"],["pointerout","pointerOut"],["pointerover","pointerOver"],["progress","progress"],["scroll","scroll"],["seeking","seeking"],["stalled","stalled"],["suspend","suspend"],["timeupdate","timeUpdate"],["toggle","toggle"],["touchmove","touchMove"],[tt,"transitionEnd"],["waiting","waiting"],["wheel","wheel"]],mn={},gn={};function bn(t,e){var n=t[0],r="on"+((t=t[1])[0].toUpperCase()+t.slice(1));e={phasedRegistrationNames:{bubbled:r,captured:r+"Capture"},dependencies:[n],isInteractive:e},mn[t]=e,gn[n]=e}[["blur","blur"],["cancel","cancel"],["click","click"],["close","close"],["contextmenu","contextMenu"],["copy","copy"],["cut","cut"],["auxclick","auxClick"],["dblclick","doubleClick"],["dragend","dragEnd"],["dragstart","dragStart"],["drop","drop"],["focus","focus"],["input","input"],["invalid","invalid"],["keydown","keyDown"],["keypress","keyPress"],["keyup","keyUp"],["mousedown","mouseDown"],["mouseup","mouseUp"],["paste","paste"],["pause","pause"],["play","play"],["pointercancel","pointerCancel"],["pointerdown","pointerDown"],["pointerup","pointerUp"],["ratechange","rateChange"],["reset","reset"],["seeked","seeked"],["submit","submit"],["touchcancel","touchCancel"],["touchend","touchEnd"],["touchstart","touchStart"],["volumechange","volumeChange"]].forEach(function(t){bn(t,!0)}),yn.forEach(function(t){bn(t,!1)});var wn={eventTypes:mn,isInteractiveTopLevelEventType:function(t){return void 0!==(t=gn[t])&&!0===t.isInteractive},extractEvents:function(t,e,n,r){var o=gn[t];if(!o)return null;switch(t){case"keypress":if(0===cn(n))return null;case"keydown":case"keyup":t=fn;break;case"blur":case"focus":t=un;break;case"click":if(2===n.button)return null;case"auxclick":case"dblclick":case"mousedown":case"mousemove":case"mouseup":case"mouseout":case"mouseover":case"contextmenu":t=Ye;break;case"drag":case"dragend":case"dragenter":case"dragexit":case"dragleave":case"dragover":case"dragstart":case"drop":t=pn;break;case"touchcancel":case"touchend":case"touchmove":case"touchstart":t=dn;break;case X:case J:case Z:t=on;break;case tt:t=hn;break;case"scroll":t=We;break;case"wheel":t=vn;break;case"copy":case"cut":case"paste":t=an;break;case"gotpointercapture":case"lostpointercapture":case"pointercancel":case"pointerdown":case"pointermove":case"pointerout":case"pointerover":case"pointerup":t=Ke;break;default:t=ct}return B(e=t.getPooled(o,e,n,r)),e}},xn=wn.isInteractiveTopLevelEventType,En=[];function Sn(t){var e=t.targetInst,n=e;do{if(!n){t.ancestors.push(n);break}var r;for(r=n;r.return;)r=r.return;if(!(r=3!==r.tag?null:r.stateNode.containerInfo))break;t.ancestors.push(n),n=L(r)}while(n);for(n=0;n<t.ancestors.length;n++){e=t.ancestors[n];var o=Dt(t.nativeEvent);r=t.topLevelType;for(var i=t.nativeEvent,a=null,u=0;u<w.length;u++){var c=w[u];(c=c&&c.extractEvents(r,e,i,o))&&(a=k(a,c))}R(a)}}var _n=!0;function kn(t,e){if(!e)return null;var n=(xn(t)?Tn:Pn).bind(null,t);e.addEventListener(t,n,!1)}function On(t,e){if(!e)return null;var n=(xn(t)?Tn:Pn).bind(null,t);e.addEventListener(t,n,!0)}function Tn(t,e){Nt(Pn,t,e)}function Pn(t,e){if(_n){var n=Dt(e);if(null===(n=L(n))||"number"!=typeof n.tag||2===en(n)||(n=null),En.length){var r=En.pop();r.topLevelType=t,r.nativeEvent=e,r.targetInst=n,t=r}else t={topLevelType:t,nativeEvent:e,targetInst:n,ancestors:[]};try{It(Sn,t)}finally{t.topLevelType=null,t.nativeEvent=null,t.targetInst=null,t.ancestors.length=0,En.length<10&&En.push(t)}}}var Cn={},jn=0,Rn="_reactListenersID"+(""+Math.random()).slice(2);function An(t){return Object.prototype.hasOwnProperty.call(t,Rn)||(t[Rn]=jn++,Cn[t[Rn]]={}),Cn[t[Rn]]}function Nn(e){if(void 0===(e=e||("undefined"!=typeof document?document:void 0)))return null;try{return e.activeElement||e.body}catch(t){return e.body}}function Mn(t){for(;t&&t.firstChild;)t=t.firstChild;return t}function Ln(t,e){var n,r=Mn(t);for(t=0;r;){if(3===r.nodeType){if(n=t+r.textContent.length,t<=e&&e<=n)return{node:r,offset:e-t};t=n}t:{for(;r;){if(r.nextSibling){r=r.nextSibling;break t}r=r.parentNode}r=void 0}r=Mn(r)}}function In(){for(var t=window,e=Nn();e instanceof t.HTMLIFrameElement;){try{var n="string"==typeof e.contentWindow.location.href}catch(t){n=!1}if(!n)break;e=Nn((t=e.contentWindow).document)}return e}function Fn(t){var e=t&&t.nodeName&&t.nodeName.toLowerCase();return e&&("input"===e&&("text"===t.type||"search"===t.type||"tel"===t.type||"url"===t.type||"password"===t.type)||"textarea"===e||"true"===t.contentEditable)}function Un(t){var e=In(),n=t.focusedElem,r=t.selectionRange;if(e!==n&&n&&n.ownerDocument&&function t(e,n){return!(!e||!n)&&(e===n||(!e||3!==e.nodeType)&&(n&&3===n.nodeType?t(e,n.parentNode):"contains"in e?e.contains(n):!!e.compareDocumentPosition&&!!(16&e.compareDocumentPosition(n))))}(n.ownerDocument.documentElement,n)){if(null!==r&&Fn(n))if(e=r.start,void 0===(t=r.end)&&(t=e),"selectionStart"in n)n.selectionStart=e,n.selectionEnd=Math.min(t,n.value.length);else if((t=(e=n.ownerDocument||document)&&e.defaultView||window).getSelection){t=t.getSelection();var o=n.textContent.length,i=Math.min(r.start,o);r=void 0===r.end?i:Math.min(r.end,o),!t.extend&&r<i&&(o=r,r=i,i=o),o=Ln(n,i);var a=Ln(n,r);o&&a&&(1!==t.rangeCount||t.anchorNode!==o.node||t.anchorOffset!==o.offset||t.focusNode!==a.node||t.focusOffset!==a.offset)&&((e=e.createRange()).setStart(o.node,o.offset),t.removeAllRanges(),r<i?(t.addRange(e),t.extend(a.node,a.offset)):(e.setEnd(a.node,a.offset),t.addRange(e)))}for(e=[],t=n;t=t.parentNode;)1===t.nodeType&&e.push({element:t,left:t.scrollLeft,top:t.scrollTop});for("function"==typeof n.focus&&n.focus(),n=0;n<e.length;n++)(t=e[n]).element.scrollLeft=t.left,t.element.scrollTop=t.top}}var Dn=V&&"documentMode"in document&&document.documentMode<=11,Wn={select:{phasedRegistrationNames:{bubbled:"onSelect",captured:"onSelectCapture"},dependencies:"blur contextmenu dragend focus keydown keyup mousedown mouseup selectionchange".split(" ")}},zn=null,Hn=null,qn=null,Bn=!1;function Vn(t,e){var n=e.window===e?e.document:9===e.nodeType?e:e.ownerDocument;return Bn||null==zn||zn!==Nn(n)?null:(n="selectionStart"in(n=zn)&&Fn(n)?{start:n.selectionStart,end:n.selectionEnd}:{anchorNode:(n=(n.ownerDocument&&n.ownerDocument.defaultView||window).getSelection()).anchorNode,anchorOffset:n.anchorOffset,focusNode:n.focusNode,focusOffset:n.focusOffset},qn&&tn(qn,n)?null:(qn=n,(t=ct.getPooled(Wn.select,Hn,t,e)).type="select",t.target=zn,B(t),t))}var $n={eventTypes:Wn,extractEvents:function(t,e,n,r){var o,i=r.window===r?r.document:9===r.nodeType?r:r.ownerDocument;if(!(o=!i)){t:{i=An(i),o=c.onSelect;for(var a=0;a<o.length;a++){var u=o[a];if(!i.hasOwnProperty(u)||!i[u]){i=!1;break t}}i=!0}o=!i}if(o)return null;switch(i=e?F(e):window,t){case"focus":!Ut(i)&&"true"!==i.contentEditable||(zn=i,Hn=e,qn=null);break;case"blur":qn=Hn=zn=null;break;case"mousedown":Bn=!0;break;case"contextmenu":case"mouseup":case"dragend":return Bn=!1,Vn(n,r);case"selectionchange":if(Dn)break;case"keydown":case"keyup":return Vn(n,r)}return null}};function Gn(t,e){return t=g({children:void 0},e),(e=function(t){var e="";return r.Children.forEach(t,function(t){null!=t&&(e+=t)}),e}(e.children))&&(t.children=e),t}function Yn(t,e,n,r){if(t=t.options,e){e={};for(var o=0;o<n.length;o++)e["$"+n[o]]=!0;for(n=0;n<t.length;n++)o=e.hasOwnProperty("$"+t[n].value),t[n].selected!==o&&(t[n].selected=o),o&&r&&(t[n].defaultSelected=!0)}else{for(n=""+ge(n),e=null,o=0;o<t.length;o++){if(t[o].value===n)return t[o].selected=!0,void(r&&(t[o].defaultSelected=!0));null!==e||t[o].disabled||(e=t[o])}null!==e&&(e.selected=!0)}}function Kn(t,e){return null!=e.dangerouslySetInnerHTML&&b("91"),g({},e,{value:void 0,defaultValue:void 0,children:""+t._wrapperState.initialValue})}function Qn(t,e){var n=e.value;null==n&&(n=e.defaultValue,null!=(e=e.children)&&(null!=n&&b("92"),Array.isArray(e)&&(e.length<=1||b("93"),e=e[0]),n=e),null==n&&(n="")),t._wrapperState={initialValue:ge(n)}}function Xn(t,e){var n=ge(e.value),r=ge(e.defaultValue);null!=n&&((n=""+n)!==t.value&&(t.value=n),null==e.defaultValue&&t.defaultValue!==n&&(t.defaultValue=n)),null!=r&&(t.defaultValue=""+r)}function Jn(t){var e=t.textContent;e===t._wrapperState.initialValue&&(t.value=e)}C.injectEventPluginOrder("ResponderEventPlugin SimpleEventPlugin EnterLeaveEventPlugin ChangeEventPlugin SelectEventPlugin BeforeInputEventPlugin".split(" ")),i=U,a=I,S=F,C.injectEventPluginsByName({SimpleEventPlugin:wn,EnterLeaveEventPlugin:Xe,ChangeEventPlugin:De,SelectEventPlugin:$n,BeforeInputEventPlugin:kt});var Zn={html:"http://www.w3.org/1999/xhtml",mathml:"http://www.w3.org/1998/Math/MathML",svg:"http://www.w3.org/2000/svg"};function tr(t){switch(t){case"svg":return"http://www.w3.org/2000/svg";case"math":return"http://www.w3.org/1998/Math/MathML";default:return"http://www.w3.org/1999/xhtml"}}function er(t,e){return null==t||"http://www.w3.org/1999/xhtml"===t?tr(e):"http://www.w3.org/2000/svg"===t&&"foreignObject"===e?"http://www.w3.org/1999/xhtml":t}var nr,rr=void 0,or=(nr=function(t,e){if(t.namespaceURI!==Zn.svg||"innerHTML"in t)t.innerHTML=e;else{for((rr=rr||document.createElement("div")).innerHTML="<svg>"+e+"</svg>",e=rr.firstChild;t.firstChild;)t.removeChild(t.firstChild);for(;e.firstChild;)t.appendChild(e.firstChild)}},"undefined"!=typeof MSApp&&MSApp.execUnsafeLocalFunction?function(t,e,n,r){MSApp.execUnsafeLocalFunction(function(){return nr(t,e)})}:nr);function ir(t,e){if(e){var n=t.firstChild;if(n&&n===t.lastChild&&3===n.nodeType)return void(n.nodeValue=e)}t.textContent=e}var ar={animationIterationCount:!0,borderImageOutset:!0,borderImageSlice:!0,borderImageWidth:!0,boxFlex:!0,boxFlexGroup:!0,boxOrdinalGroup:!0,columnCount:!0,columns:!0,flex:!0,flexGrow:!0,flexPositive:!0,flexShrink:!0,flexNegative:!0,flexOrder:!0,gridArea:!0,gridRow:!0,gridRowEnd:!0,gridRowSpan:!0,gridRowStart:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnSpan:!0,gridColumnStart:!0,fontWeight:!0,lineClamp:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,tabSize:!0,widows:!0,zIndex:!0,zoom:!0,fillOpacity:!0,floodOpacity:!0,stopOpacity:!0,strokeDasharray:!0,strokeDashoffset:!0,strokeMiterlimit:!0,strokeOpacity:!0,strokeWidth:!0},ur=["Webkit","ms","Moz","O"];function cr(t,e,n){return null==e||"boolean"==typeof e||""===e?"":n||"number"!=typeof e||0===e||ar.hasOwnProperty(t)&&ar[t]?(""+e).trim():e+"px"}function lr(t,e){for(var n in t=t.style,e)if(e.hasOwnProperty(n)){var r=0===n.indexOf("--"),o=cr(n,e[n],r);"float"===n&&(n="cssFloat"),r?t.setProperty(n,o):t[n]=o}}Object.keys(ar).forEach(function(e){ur.forEach(function(t){t=t+e.charAt(0).toUpperCase()+e.substring(1),ar[t]=ar[e]})});var sr=g({menuitem:!0},{area:!0,base:!0,br:!0,col:!0,embed:!0,hr:!0,img:!0,input:!0,keygen:!0,link:!0,meta:!0,param:!0,source:!0,track:!0,wbr:!0});function fr(t,e){e&&(sr[t]&&(null==e.children&&null==e.dangerouslySetInnerHTML||b("137",t,"")),null!=e.dangerouslySetInnerHTML&&(null!=e.children&&b("60"),"object"==typeof e.dangerouslySetInnerHTML&&"__html"in e.dangerouslySetInnerHTML||b("61")),null!=e.style&&"object"!=typeof e.style&&b("62",""))}function pr(t,e){if(-1===t.indexOf("-"))return"string"==typeof e.is;switch(t){case"annotation-xml":case"color-profile":case"font-face":case"font-face-src":case"font-face-uri":case"font-face-format":case"font-face-name":case"missing-glyph":return!1;default:return!0}}function dr(t,e){var n=An(t=9===t.nodeType||11===t.nodeType?t:t.ownerDocument);e=c[e];for(var r=0;r<e.length;r++){var o=e[r];if(!n.hasOwnProperty(o)||!n[o]){switch(o){case"scroll":On("scroll",t);break;case"focus":case"blur":On("focus",t),On("blur",t),n.blur=!0,n.focus=!0;break;case"cancel":case"close":Wt(o)&&On(o,t);break;case"invalid":case"submit":case"reset":break;default:-1===et.indexOf(o)&&kn(o,t)}n[o]=!0}}}function hr(){}var vr=null,yr=null;function mr(t,e){switch(t){case"button":case"input":case"select":case"textarea":return!!e.autoFocus}return!1}function gr(t,e){return"textarea"===t||"option"===t||"noscript"===t||"string"==typeof e.children||"number"==typeof e.children||"object"==typeof e.dangerouslySetInnerHTML&&null!==e.dangerouslySetInnerHTML&&null!=e.dangerouslySetInnerHTML.__html}var br="function"==typeof setTimeout?setTimeout:void 0,wr="function"==typeof clearTimeout?clearTimeout:void 0,xr=u.unstable_scheduleCallback,Er=u.unstable_cancelCallback;function Sr(t){for(t=t.nextSibling;t&&1!==t.nodeType&&3!==t.nodeType;)t=t.nextSibling;return t}function _r(t){for(t=t.firstChild;t&&1!==t.nodeType&&3!==t.nodeType;)t=t.nextSibling;return t}new Set;var kr=[],Or=-1;function Tr(t){Or<0||(t.current=kr[Or],kr[Or]=null,Or--)}function Pr(t,e){kr[++Or]=t.current,t.current=e}var Cr={},jr={current:Cr},Rr={current:!1},Ar=Cr;function Nr(t,e){var n=t.type.contextTypes;if(!n)return Cr;var r=t.stateNode;if(r&&r.__reactInternalMemoizedUnmaskedChildContext===e)return r.__reactInternalMemoizedMaskedChildContext;var o,i={};for(o in n)i[o]=e[o];return r&&((t=t.stateNode).__reactInternalMemoizedUnmaskedChildContext=e,t.__reactInternalMemoizedMaskedChildContext=i),i}function Mr(t){return null!=(t=t.childContextTypes)}function Lr(){Tr(Rr),Tr(jr)}function Ir(){Tr(Rr),Tr(jr)}function Fr(t,e,n){jr.current!==Cr&&b("168"),Pr(jr,e),Pr(Rr,n)}function Ur(t,e,n){var r=t.stateNode;if(t=e.childContextTypes,"function"!=typeof r.getChildContext)return n;for(var o in r=r.getChildContext())o in t||b("108",ue(e)||"Unknown",o);return g({},n,r)}function Dr(t){var e=t.stateNode;return e=e&&e.__reactInternalMemoizedMergedChildContext||Cr,Ar=jr.current,Pr(jr,e),Pr(Rr,Rr.current),!0}function Wr(t,e,n){var r=t.stateNode;r||b("169"),n?(e=Ur(t,e,Ar),r.__reactInternalMemoizedMergedChildContext=e,Tr(Rr),Tr(jr),Pr(jr,e)):Tr(Rr),Pr(Rr,n)}var zr=null,Hr=null;function qr(e){return function(t){try{return e(t)}catch(t){}}}function Br(t,e,n,r){this.tag=t,this.key=n,this.sibling=this.child=this.return=this.stateNode=this.type=this.elementType=null,this.index=0,this.ref=null,this.pendingProps=e,this.contextDependencies=this.memoizedState=this.updateQueue=this.memoizedProps=null,this.mode=r,this.effectTag=0,this.lastEffect=this.firstEffect=this.nextEffect=null,this.childExpirationTime=this.expirationTime=0,this.alternate=null}function Vr(t,e,n,r){return new Br(t,e,n,r)}function $r(t){return!(!(t=t.prototype)||!t.isReactComponent)}function Gr(t,e){var n=t.alternate;return null===n?((n=Vr(t.tag,e,t.key,t.mode)).elementType=t.elementType,n.type=t.type,n.stateNode=t.stateNode,(n.alternate=t).alternate=n):(n.pendingProps=e,n.effectTag=0,n.nextEffect=null,n.firstEffect=null,n.lastEffect=null),n.childExpirationTime=t.childExpirationTime,n.expirationTime=t.expirationTime,n.child=t.child,n.memoizedProps=t.memoizedProps,n.memoizedState=t.memoizedState,n.updateQueue=t.updateQueue,n.contextDependencies=t.contextDependencies,n.sibling=t.sibling,n.index=t.index,n.ref=t.ref,n}function Yr(t,e,n,r,o,i){var a=2;if("function"==typeof(r=t))$r(t)&&(a=1);else if("string"==typeof t)a=5;else t:switch(t){case Kt:return Kr(n.children,o,i,e);case te:return Qr(n,3|o,i,e);case Qt:return Qr(n,2|o,i,e);case Xt:return(t=Vr(12,n,e,4|o)).elementType=Xt,t.type=Xt,t.expirationTime=i,t;case ne:return(t=Vr(13,n,e,o)).elementType=ne,t.type=ne,t.expirationTime=i,t;default:if("object"==typeof t&&null!==t)switch(t.$$typeof){case Jt:a=10;break t;case Zt:a=9;break t;case ee:a=11;break t;case re:a=14;break t;case oe:a=16,r=null;break t}b("130",null==t?t:typeof t,"")}return(e=Vr(a,n,e,o)).elementType=t,e.type=r,e.expirationTime=i,e}function Kr(t,e,n,r){return(t=Vr(7,t,r,e)).expirationTime=n,t}function Qr(t,e,n,r){return t=Vr(8,t,r,e),e=0==(1&e)?Qt:te,t.elementType=e,t.type=e,t.expirationTime=n,t}function Xr(t,e,n){return(t=Vr(6,t,null,e)).expirationTime=n,t}function Jr(t,e,n){return(e=Vr(4,null!==t.children?t.children:[],t.key,e)).expirationTime=n,e.stateNode={containerInfo:t.containerInfo,pendingChildren:null,implementation:t.implementation},e}function Zr(t,e){t.didError=!1;var n=t.earliestPendingTime;0===n?t.earliestPendingTime=t.latestPendingTime=e:n<e?t.earliestPendingTime=e:t.latestPendingTime>e&&(t.latestPendingTime=e),no(e,t)}function to(t,e){t.didError=!1,t.latestPingedTime>=e&&(t.latestPingedTime=0);var n=t.earliestPendingTime,r=t.latestPendingTime;n===e?t.earliestPendingTime=r===e?t.latestPendingTime=0:r:r===e&&(t.latestPendingTime=n),n=t.earliestSuspendedTime,r=t.latestSuspendedTime,0===n?t.earliestSuspendedTime=t.latestSuspendedTime=e:n<e?t.earliestSuspendedTime=e:e<r&&(t.latestSuspendedTime=e),no(e,t)}function eo(t,e){var n=t.earliestPendingTime;return e<n&&(e=n),e<(t=t.earliestSuspendedTime)&&(e=t),e}function no(t,e){var n=e.earliestSuspendedTime,r=e.latestSuspendedTime,o=e.earliestPendingTime,i=e.latestPingedTime;0===(o=0!==o?o:i)&&(0===t||r<t)&&(o=r),0!==(t=o)&&t<n&&(t=n),e.nextExpirationTimeToWorkOn=o,e.expirationTime=t}function ro(t,e){if(t&&t.defaultProps)for(var n in e=g({},e),t=t.defaultProps)void 0===e[n]&&(e[n]=t[n]);return e}var oo=(new r.Component).refs;function io(t,e,n,r){n=null==(n=n(r,e=t.memoizedState))?e:g({},e,n),t.memoizedState=n,null!==(r=t.updateQueue)&&0===t.expirationTime&&(r.baseState=n)}var ao={isMounted:function(t){return!!(t=t._reactInternalFiber)&&2===en(t)},enqueueSetState:function(t,e,n){t=t._reactInternalFiber;var r=Eu(),o=Qi(r=Ka(r,t));o.payload=e,null!=n&&(o.callback=n),qa(),Ji(t,o),Ja(t,r)},enqueueReplaceState:function(t,e,n){t=t._reactInternalFiber;var r=Eu(),o=Qi(r=Ka(r,t));o.tag=Bi,o.payload=e,null!=n&&(o.callback=n),qa(),Ji(t,o),Ja(t,r)},enqueueForceUpdate:function(t,e){t=t._reactInternalFiber;var n=Eu(),r=Qi(n=Ka(n,t));r.tag=Vi,null!=e&&(r.callback=e),qa(),Ji(t,r),Ja(t,n)}};function uo(t,e,n,r,o,i,a){return"function"==typeof(t=t.stateNode).shouldComponentUpdate?t.shouldComponentUpdate(r,i,a):!e.prototype||!e.prototype.isPureReactComponent||(!tn(n,r)||!tn(o,i))}function co(t,e,n){var r=!1,o=Cr,i=e.contextType;return e=new e(n,i="object"==typeof i&&null!==i?Hi(i):(o=Mr(e)?Ar:jr.current,(r=null!=(r=e.contextTypes))?Nr(t,o):Cr)),t.memoizedState=null!==e.state&&void 0!==e.state?e.state:null,e.updater=ao,(t.stateNode=e)._reactInternalFiber=t,r&&((t=t.stateNode).__reactInternalMemoizedUnmaskedChildContext=o,t.__reactInternalMemoizedMaskedChildContext=i),e}function lo(t,e,n,r){t=e.state,"function"==typeof e.componentWillReceiveProps&&e.componentWillReceiveProps(n,r),"function"==typeof e.UNSAFE_componentWillReceiveProps&&e.UNSAFE_componentWillReceiveProps(n,r),e.state!==t&&ao.enqueueReplaceState(e,e.state,null)}function so(t,e,n,r){var o=t.stateNode;o.props=n,o.state=t.memoizedState,o.refs=oo;var i=e.contextType;"object"==typeof i&&null!==i?o.context=Hi(i):(i=Mr(e)?Ar:jr.current,o.context=Nr(t,i)),null!==(i=t.updateQueue)&&(na(t,i,n,o,r),o.state=t.memoizedState),"function"==typeof(i=e.getDerivedStateFromProps)&&(io(t,e,i,n),o.state=t.memoizedState),"function"==typeof e.getDerivedStateFromProps||"function"==typeof o.getSnapshotBeforeUpdate||"function"!=typeof o.UNSAFE_componentWillMount&&"function"!=typeof o.componentWillMount||(e=o.state,"function"==typeof o.componentWillMount&&o.componentWillMount(),"function"==typeof o.UNSAFE_componentWillMount&&o.UNSAFE_componentWillMount(),e!==o.state&&ao.enqueueReplaceState(o,o.state,null),null!==(i=t.updateQueue)&&(na(t,i,n,o,r),o.state=t.memoizedState)),"function"==typeof o.componentDidMount&&(t.effectTag|=4)}var fo=Array.isArray;function po(t,e,n){if(null!==(t=n.ref)&&"function"!=typeof t&&"object"!=typeof t){if(n._owner){n=n._owner;var r=void 0;n&&(1!==n.tag&&b("309"),r=n.stateNode),r||b("147",t);var o=""+t;return null!==e&&null!==e.ref&&"function"==typeof e.ref&&e.ref._stringRef===o?e.ref:((e=function(t){var e=r.refs;e===oo&&(e=r.refs={}),null===t?delete e[o]:e[o]=t})._stringRef=o,e)}"string"!=typeof t&&b("284"),n._owner||b("290",t)}return t}function ho(t,e){"textarea"!==t.type&&b("31","[object Object]"===Object.prototype.toString.call(e)?"object with keys {"+Object.keys(e).join(", ")+"}":e,"")}function vo(f){function p(t,e){if(f){var n=t.lastEffect;null!==n?(n.nextEffect=e,t.lastEffect=e):t.firstEffect=t.lastEffect=e,e.nextEffect=null,e.effectTag=8}}function d(t,e){if(!f)return null;for(;null!==e;)p(t,e),e=e.sibling;return null}function h(t,e){for(t=new Map;null!==e;)null!==e.key?t.set(e.key,e):t.set(e.index,e),e=e.sibling;return t}function a(t,e){return(t=Gr(t,e)).index=0,t.sibling=null,t}function v(t,e,n){return t.index=n,f?null!==(n=t.alternate)?(n=n.index)<e?(t.effectTag=2,e):n:(t.effectTag=2,e):e}function u(t){return f&&null===t.alternate&&(t.effectTag=2),t}function i(t,e,n,r){return null===e||6!==e.tag?(e=Xr(n,t.mode,r)).return=t:(e=a(e,n)).return=t,e}function c(t,e,n,r){return null!==e&&e.elementType===n.type?(r=a(e,n.props)).ref=po(t,e,n):(r=Yr(n.type,n.key,n.props,null,t.mode,r)).ref=po(t,e,n),r.return=t,r}function l(t,e,n,r){return null===e||4!==e.tag||e.stateNode.containerInfo!==n.containerInfo||e.stateNode.implementation!==n.implementation?(e=Jr(n,t.mode,r)).return=t:(e=a(e,n.children||[])).return=t,e}function s(t,e,n,r,o){return null===e||7!==e.tag?(e=Kr(n,t.mode,r,o)).return=t:(e=a(e,n)).return=t,e}function y(t,e,n){if("string"==typeof e||"number"==typeof e)return(e=Xr(""+e,t.mode,n)).return=t,e;if("object"==typeof e&&null!==e){switch(e.$$typeof){case Gt:return(n=Yr(e.type,e.key,e.props,null,t.mode,n)).ref=po(t,null,e),n.return=t,n;case Yt:return(e=Jr(e,t.mode,n)).return=t,e}if(fo(e)||ae(e))return(e=Kr(e,t.mode,n,null)).return=t,e;ho(t,e)}return null}function m(t,e,n,r){var o=null!==e?e.key:null;if("string"==typeof n||"number"==typeof n)return null!==o?null:i(t,e,""+n,r);if("object"==typeof n&&null!==n){switch(n.$$typeof){case Gt:return n.key===o?n.type===Kt?s(t,e,n.props.children,r,o):c(t,e,n,r):null;case Yt:return n.key===o?l(t,e,n,r):null}if(fo(n)||ae(n))return null!==o?null:s(t,e,n,r,null);ho(t,n)}return null}function g(t,e,n,r,o){if("string"==typeof r||"number"==typeof r)return i(e,t=t.get(n)||null,""+r,o);if("object"==typeof r&&null!==r){switch(r.$$typeof){case Gt:return t=t.get(null===r.key?n:r.key)||null,r.type===Kt?s(e,t,r.props.children,o,r.key):c(e,t,r,o);case Yt:return l(e,t=t.get(null===r.key?n:r.key)||null,r,o)}if(fo(r)||ae(r))return s(e,t=t.get(n)||null,r,o,null);ho(e,r)}return null}return function(t,e,n,r){var o="object"==typeof n&&null!==n&&n.type===Kt&&null===n.key;o&&(n=n.props.children);var i="object"==typeof n&&null!==n;if(i)switch(n.$$typeof){case Gt:t:{for(i=n.key,o=e;null!==o;){if(o.key===i){if(7===o.tag?n.type===Kt:o.elementType===n.type){d(t,o.sibling),(e=a(o,n.type===Kt?n.props.children:n.props)).ref=po(t,o,n),e.return=t,t=e;break t}d(t,o);break}p(t,o),o=o.sibling}t=n.type===Kt?((e=Kr(n.props.children,t.mode,r,n.key)).return=t,e):((r=Yr(n.type,n.key,n.props,null,t.mode,r)).ref=po(t,e,n),r.return=t,r)}return u(t);case Yt:t:{for(o=n.key;null!==e;){if(e.key===o){if(4===e.tag&&e.stateNode.containerInfo===n.containerInfo&&e.stateNode.implementation===n.implementation){d(t,e.sibling),(e=a(e,n.children||[])).return=t,t=e;break t}d(t,e);break}p(t,e),e=e.sibling}(e=Jr(n,t.mode,r)).return=t,t=e}return u(t)}if("string"==typeof n||"number"==typeof n)return n=""+n,u(t=((e=null!==e&&6===e.tag?(d(t,e.sibling),a(e,n)):(d(t,e),Xr(n,t.mode,r))).return=t,e));if(fo(n))return function(e,t,n,r){for(var o=null,i=null,a=t,u=t=0,c=null;null!==a&&u<n.length;u++){a.index>u?(c=a,a=null):c=a.sibling;var l=m(e,a,n[u],r);if(null===l){null===a&&(a=c);break}f&&a&&null===l.alternate&&p(e,a),t=v(l,t,u),null===i?o=l:i.sibling=l,i=l,a=c}if(u===n.length)return d(e,a),o;if(null===a){for(;u<n.length;u++)(a=y(e,n[u],r))&&(t=v(a,t,u),null===i?o=a:i.sibling=a,i=a);return o}for(a=h(e,a);u<n.length;u++)(c=g(a,e,u,n[u],r))&&(f&&null!==c.alternate&&a.delete(null===c.key?u:c.key),t=v(c,t,u),null===i?o=c:i.sibling=c,i=c);return f&&a.forEach(function(t){return p(e,t)}),o}(t,e,n,r);if(ae(n))return function(e,t,n,r){var o=ae(n);"function"!=typeof o&&b("150"),null==(n=o.call(n))&&b("151");for(var i=o=null,a=t,u=t=0,c=null,l=n.next();null!==a&&!l.done;u++,l=n.next()){a.index>u?(c=a,a=null):c=a.sibling;var s=m(e,a,l.value,r);if(null===s){a=a||c;break}f&&a&&null===s.alternate&&p(e,a),t=v(s,t,u),null===i?o=s:i.sibling=s,i=s,a=c}if(l.done)return d(e,a),o;if(null===a){for(;!l.done;u++,l=n.next())null!==(l=y(e,l.value,r))&&(t=v(l,t,u),null===i?o=l:i.sibling=l,i=l);return o}for(a=h(e,a);!l.done;u++,l=n.next())null!==(l=g(a,e,u,l.value,r))&&(f&&null!==l.alternate&&a.delete(null===l.key?u:l.key),t=v(l,t,u),null===i?o=l:i.sibling=l,i=l);return f&&a.forEach(function(t){return p(e,t)}),o}(t,e,n,r);if(i&&ho(t,n),void 0===n&&!o)switch(t.tag){case 1:case 0:b("152",(r=t.type).displayName||r.name||"Component")}return d(t,e)}}var yo=vo(!0),mo=vo(!1),go={},bo={current:go},wo={current:go},xo={current:go};function Eo(t){return t===go&&b("174"),t}function So(t,e){Pr(xo,e),Pr(wo,t),Pr(bo,go);var n=e.nodeType;switch(n){case 9:case 11:e=(e=e.documentElement)?e.namespaceURI:er(null,"");break;default:e=er(e=(n=8===n?e.parentNode:e).namespaceURI||null,n=n.tagName)}Tr(bo),Pr(bo,e)}function _o(){Tr(bo),Tr(wo),Tr(xo)}function ko(t){Eo(xo.current);var e=Eo(bo.current),n=er(e,t.type);e!==n&&(Pr(wo,t),Pr(bo,n))}function Oo(t){wo.current===t&&(Tr(bo),Tr(wo))}var To=0,Po=2,Co=4,jo=8,Ro=16,Ao=32,No=64,Mo=128,Lo=Bt.ReactCurrentDispatcher,Io=0,Fo=null,Uo=null,Do=null,Wo=null,zo=null,Ho=null,qo=0,Bo=null,Vo=0,$o=!1,Go=null,Yo=0;function Ko(){b("321")}function Qo(t,e){if(null===e)return!1;for(var n=0;n<e.length&&n<t.length;n++)if(!Je(t[n],e[n]))return!1;return!0}function Xo(t,e,n,r,o,i){if(Io=i,Fo=e,Do=null!==t?t.memoizedState:null,Lo.current=null===Do?si:fi,e=n(r,o),$o){for(;$o=!1,Yo+=1,Do=null!==t?t.memoizedState:null,Ho=Wo,Bo=zo=Uo=null,Lo.current=fi,e=n(r,o),$o;);Go=null,Yo=0}return Lo.current=li,(t=Fo).memoizedState=Wo,t.expirationTime=qo,t.updateQueue=Bo,t.effectTag|=Vo,t=null!==Uo&&null!==Uo.next,Ho=zo=Wo=Do=Uo=Fo=null,Bo=null,Vo=qo=Io=0,t&&b("300"),e}function Jo(){Lo.current=li,Ho=zo=Wo=Do=Uo=Fo=null,$o=!1,Go=Bo=null,Yo=Vo=qo=Io=0}function Zo(){var t={memoizedState:null,baseState:null,queue:null,baseUpdate:null,next:null};return null===zo?Wo=zo=t:zo=zo.next=t,zo}function ti(){if(null!==Ho)Ho=(zo=Ho).next,Do=null!==(Uo=Do)?Uo.next:null;else{null===Do&&b("310");var t={memoizedState:(Uo=Do).memoizedState,baseState:Uo.baseState,queue:Uo.queue,baseUpdate:Uo.baseUpdate,next:null};zo=null===zo?Wo=t:zo.next=t,Do=Uo.next}return zo}function ei(t,e){return"function"==typeof e?e(t):e}function ni(t){var e=ti(),n=e.queue;if(null===n&&b("311"),n.lastRenderedReducer=t,0<Yo){var r=n.dispatch;if(null!==Go){var o=Go.get(n);if(void 0!==o){Go.delete(n);for(var i=e.memoizedState;i=t(i,o.action),null!==(o=o.next););return Je(i,e.memoizedState)||(Ei=!0),e.memoizedState=i,e.baseUpdate===n.last&&(e.baseState=i),[n.lastRenderedState=i,r]}}return[e.memoizedState,r]}r=n.last;var a=e.baseUpdate;if(i=e.baseState,null!==(r=null!==a?(null!==r&&(r.next=null),a.next):null!==r?r.next:null)){var u=o=null,c=r,l=!1;do{var s=c.expirationTime;s<Io?(l||(l=!0,u=a,o=i),qo<s&&(qo=s)):i=c.eagerReducer===t?c.eagerState:t(i,c.action),c=(a=c).next}while(null!==c&&c!==r);l||(u=a,o=i),Je(i,e.memoizedState)||(Ei=!0),e.memoizedState=i,e.baseUpdate=u,e.baseState=o,n.lastRenderedState=i}return[e.memoizedState,n.dispatch]}function ri(t,e,n,r){return t={tag:t,create:e,destroy:n,deps:r,next:null},null===Bo?(Bo={lastEffect:null}).lastEffect=t.next=t:null===(e=Bo.lastEffect)?Bo.lastEffect=t.next=t:(n=e.next,(e.next=t).next=n,Bo.lastEffect=t),t}function oi(t,e,n,r){var o=Zo();Vo|=t,o.memoizedState=ri(e,n,void 0,void 0===r?null:r)}function ii(t,e,n,r){var o=ti();r=void 0===r?null:r;var i=void 0;if(null!==Uo){var a=Uo.memoizedState;if(i=a.destroy,null!==r&&Qo(r,a.deps))return void ri(To,n,i,r)}Vo|=t,o.memoizedState=ri(e,n,i,r)}function ai(t,e){return"function"==typeof e?(t=t(),e(t),function(){e(null)}):null!=e?(t=t(),e.current=t,function(){e.current=null}):void 0}function ui(){}function ci(t,e,n){Yo<25||b("301");var r=t.alternate;if(t===Fo||null!==r&&r===Fo)if($o=!0,t={expirationTime:Io,action:n,eagerReducer:null,eagerState:null,next:null},null===Go&&(Go=new Map),void 0===(n=Go.get(e)))Go.set(e,t);else{for(e=n;null!==e.next;)e=e.next;e.next=t}else{qa();var o=Eu(),i={expirationTime:o=Ka(o,t),action:n,eagerReducer:null,eagerState:null,next:null},a=e.last;if(null===a)i.next=i;else{var u=a.next;null!==u&&(i.next=u),a.next=i}if(e.last=i,0===t.expirationTime&&(null===r||0===r.expirationTime)&&null!==(r=e.lastRenderedReducer))try{var c=e.lastRenderedState,l=r(c,n);if(i.eagerReducer=r,Je(i.eagerState=l,c))return}catch(t){}Ja(t,o)}}var li={readContext:Hi,useCallback:Ko,useContext:Ko,useEffect:Ko,useImperativeHandle:Ko,useLayoutEffect:Ko,useMemo:Ko,useReducer:Ko,useRef:Ko,useState:Ko,useDebugValue:Ko},si={readContext:Hi,useCallback:function(t,e){return Zo().memoizedState=[t,void 0===e?null:e],t},useContext:Hi,useEffect:function(t,e){return oi(516,Mo|No,t,e)},useImperativeHandle:function(t,e,n){return n=null!=n?n.concat([t]):null,oi(4,Co|Ao,ai.bind(null,e,t),n)},useLayoutEffect:function(t,e){return oi(4,Co|Ao,t,e)},useMemo:function(t,e){var n=Zo();return e=void 0===e?null:e,t=t(),n.memoizedState=[t,e],t},useReducer:function(t,e,n){var r=Zo();return e=void 0!==n?n(e):e,r.memoizedState=r.baseState=e,t=(t=r.queue={last:null,dispatch:null,lastRenderedReducer:t,lastRenderedState:e}).dispatch=ci.bind(null,Fo,t),[r.memoizedState,t]},useRef:function(t){return t={current:t},Zo().memoizedState=t},useState:function(t){var e=Zo();return"function"==typeof t&&(t=t()),e.memoizedState=e.baseState=t,t=(t=e.queue={last:null,dispatch:null,lastRenderedReducer:ei,lastRenderedState:t}).dispatch=ci.bind(null,Fo,t),[e.memoizedState,t]},useDebugValue:ui},fi={readContext:Hi,useCallback:function(t,e){var n=ti();e=void 0===e?null:e;var r=n.memoizedState;return null!==r&&null!==e&&Qo(e,r[1])?r[0]:(n.memoizedState=[t,e],t)},useContext:Hi,useEffect:function(t,e){return ii(516,Mo|No,t,e)},useImperativeHandle:function(t,e,n){return n=null!=n?n.concat([t]):null,ii(4,Co|Ao,ai.bind(null,e,t),n)},useLayoutEffect:function(t,e){return ii(4,Co|Ao,t,e)},useMemo:function(t,e){var n=ti();e=void 0===e?null:e;var r=n.memoizedState;return null!==r&&null!==e&&Qo(e,r[1])?r[0]:(t=t(),n.memoizedState=[t,e],t)},useReducer:ni,useRef:function(){return ti().memoizedState},useState:function(t){return ni(ei)},useDebugValue:ui},pi=null,di=null,hi=!1;function vi(t,e){var n=Vr(5,null,null,0);n.elementType="DELETED",n.type="DELETED",n.stateNode=e,n.return=t,n.effectTag=8,null!==t.lastEffect?(t.lastEffect.nextEffect=n,t.lastEffect=n):t.firstEffect=t.lastEffect=n}function yi(t,e){switch(t.tag){case 5:var n=t.type;return null!==(e=1!==e.nodeType||n.toLowerCase()!==e.nodeName.toLowerCase()?null:e)&&(t.stateNode=e,!0);case 6:return null!==(e=""===t.pendingProps||3!==e.nodeType?null:e)&&(t.stateNode=e,!0);case 13:default:return!1}}function mi(t){if(hi){var e=di;if(e){var n=e;if(!yi(t,e)){if(!(e=Sr(n))||!yi(t,e))return t.effectTag|=2,hi=!1,void(pi=t);vi(pi,n)}pi=t,di=_r(e)}else t.effectTag|=2,hi=!1,pi=t}}function gi(t){for(t=t.return;null!==t&&5!==t.tag&&3!==t.tag&&18!==t.tag;)t=t.return;pi=t}function bi(t){if(t!==pi)return!1;if(!hi)return gi(t),!(hi=!0);var e=t.type;if(5!==t.tag||"head"!==e&&"body"!==e&&!gr(e,t.memoizedProps))for(e=di;e;)vi(t,e),e=Sr(e);return gi(t),di=pi?Sr(t.stateNode):null,!0}function wi(){di=pi=null,hi=!1}var xi=Bt.ReactCurrentOwner,Ei=!1;function Si(t,e,n,r){e.child=null===t?mo(e,null,n,r):yo(e,t.child,n,r)}function _i(t,e,n,r,o){n=n.render;var i=e.ref;return zi(e,o),r=Xo(t,e,n,r,i,o),null===t||Ei?(e.effectTag|=1,Si(t,e,r,o),e.child):(e.updateQueue=t.updateQueue,e.effectTag&=-517,t.expirationTime<=o&&(t.expirationTime=0),Ni(t,e,o))}function ki(t,e,n,r,o,i){if(null!==t)return a=t.child,o<i&&(o=a.memoizedProps,(n=null!==(n=n.compare)?n:tn)(o,r)&&t.ref===e.ref)?Ni(t,e,i):(e.effectTag|=1,(t=Gr(a,r)).ref=e.ref,(t.return=e).child=t);var a=n.type;return"function"!=typeof a||$r(a)||void 0!==a.defaultProps||null!==n.compare||void 0!==n.defaultProps?((t=Yr(n.type,null,r,null,e.mode,i)).ref=e.ref,(t.return=e).child=t):(e.tag=15,e.type=a,Oi(t,e,a,r,o,i))}function Oi(t,e,n,r,o,i){return null!==t&&tn(t.memoizedProps,r)&&t.ref===e.ref&&(Ei=!1,o<i)?Ni(t,e,i):Pi(t,e,n,r,i)}function Ti(t,e){var n=e.ref;(null===t&&null!==n||null!==t&&t.ref!==n)&&(e.effectTag|=128)}function Pi(t,e,n,r,o){var i=Mr(n)?Ar:jr.current;return i=Nr(e,i),zi(e,o),n=Xo(t,e,n,r,i,o),null===t||Ei?(e.effectTag|=1,Si(t,e,n,o),e.child):(e.updateQueue=t.updateQueue,e.effectTag&=-517,t.expirationTime<=o&&(t.expirationTime=0),Ni(t,e,o))}function Ci(t,e,n,r,o){if(Mr(n)){var i=!0;Dr(e)}else i=!1;if(zi(e,o),null===e.stateNode)null!==t&&(t.alternate=null,e.alternate=null,e.effectTag|=2),co(e,n,r),so(e,n,r,o),r=!0;else if(null===t){var a=e.stateNode,u=e.memoizedProps;a.props=u;var c=a.context,l=n.contextType;l="object"==typeof l&&null!==l?Hi(l):Nr(e,l=Mr(n)?Ar:jr.current);var s=n.getDerivedStateFromProps,f="function"==typeof s||"function"==typeof a.getSnapshotBeforeUpdate;f||"function"!=typeof a.UNSAFE_componentWillReceiveProps&&"function"!=typeof a.componentWillReceiveProps||u===r&&c===l||lo(e,a,r,l),Gi=!1;var p=e.memoizedState;c=a.state=p;var d=e.updateQueue;null!==d&&(na(e,d,r,a,o),c=e.memoizedState),r=u!==r||p!==c||Rr.current||Gi?("function"==typeof s&&(io(e,n,s,r),c=e.memoizedState),(u=Gi||uo(e,n,u,r,p,c,l))?(f||"function"!=typeof a.UNSAFE_componentWillMount&&"function"!=typeof a.componentWillMount||("function"==typeof a.componentWillMount&&a.componentWillMount(),"function"==typeof a.UNSAFE_componentWillMount&&a.UNSAFE_componentWillMount()),"function"==typeof a.componentDidMount&&(e.effectTag|=4)):("function"==typeof a.componentDidMount&&(e.effectTag|=4),e.memoizedProps=r,e.memoizedState=c),a.props=r,a.state=c,a.context=l,u):("function"==typeof a.componentDidMount&&(e.effectTag|=4),!1)}else a=e.stateNode,u=e.memoizedProps,a.props=e.type===e.elementType?u:ro(e.type,u),c=a.context,l="object"==typeof(l=n.contextType)&&null!==l?Hi(l):Nr(e,l=Mr(n)?Ar:jr.current),(f="function"==typeof(s=n.getDerivedStateFromProps)||"function"==typeof a.getSnapshotBeforeUpdate)||"function"!=typeof a.UNSAFE_componentWillReceiveProps&&"function"!=typeof a.componentWillReceiveProps||(u===r&&c===l||lo(e,a,r,l)),Gi=!1,c=e.memoizedState,p=a.state=c,null!==(d=e.updateQueue)&&(na(e,d,r,a,o),p=e.memoizedState),r=u!==r||c!==p||Rr.current||Gi?("function"==typeof s&&(io(e,n,s,r),p=e.memoizedState),(s=Gi||uo(e,n,u,r,c,p,l))?(f||"function"!=typeof a.UNSAFE_componentWillUpdate&&"function"!=typeof a.componentWillUpdate||("function"==typeof a.componentWillUpdate&&a.componentWillUpdate(r,p,l),"function"==typeof a.UNSAFE_componentWillUpdate&&a.UNSAFE_componentWillUpdate(r,p,l)),"function"==typeof a.componentDidUpdate&&(e.effectTag|=4),"function"==typeof a.getSnapshotBeforeUpdate&&(e.effectTag|=256)):("function"!=typeof a.componentDidUpdate||u===t.memoizedProps&&c===t.memoizedState||(e.effectTag|=4),"function"!=typeof a.getSnapshotBeforeUpdate||u===t.memoizedProps&&c===t.memoizedState||(e.effectTag|=256),e.memoizedProps=r,e.memoizedState=p),a.props=r,a.state=p,a.context=l,s):("function"!=typeof a.componentDidUpdate||u===t.memoizedProps&&c===t.memoizedState||(e.effectTag|=4),"function"!=typeof a.getSnapshotBeforeUpdate||u===t.memoizedProps&&c===t.memoizedState||(e.effectTag|=256),!1);return ji(t,e,n,r,i,o)}function ji(t,e,n,r,o,i){Ti(t,e);var a=0!=(64&e.effectTag);if(!r&&!a)return o&&Wr(e,n,!1),Ni(t,e,i);r=e.stateNode,xi.current=e;var u=a&&"function"!=typeof n.getDerivedStateFromError?null:r.render();return e.effectTag|=1,null!==t&&a?(e.child=yo(e,t.child,null,i),e.child=yo(e,null,u,i)):Si(t,e,u,i),e.memoizedState=r.state,o&&Wr(e,n,!0),e.child}function Ri(t){var e=t.stateNode;e.pendingContext?Fr(0,e.pendingContext,e.pendingContext!==e.context):e.context&&Fr(0,e.context,!1),So(t,e.containerInfo)}function Ai(t,e,n){var r=e.mode,o=e.pendingProps,i=e.memoizedState;if(0==(64&e.effectTag)){i=null;var a=!1}else i={timedOutAt:null!==i?i.timedOutAt:0},a=!0,e.effectTag&=-65;if(null===t)if(a){var u=o.fallback;t=Kr(null,r,0,null),0==(1&e.mode)&&(t.child=null!==e.memoizedState?e.child.child:e.child),r=Kr(u,r,n,null),t.sibling=r,(n=t).return=r.return=e}else n=r=mo(e,null,o.children,n);else null!==t.memoizedState?(u=(r=t.child).sibling,a?(n=o.fallback,o=Gr(r,r.pendingProps),0==(1&e.mode)&&((a=null!==e.memoizedState?e.child.child:e.child)!==r.child&&(o.child=a)),r=o.sibling=Gr(u,n,u.expirationTime),(n=o).childExpirationTime=0,n.return=r.return=e):n=r=yo(e,r.child,o.children,n)):(u=t.child,a?(a=o.fallback,(o=Kr(null,r,0,null)).child=u,0==(1&e.mode)&&(o.child=null!==e.memoizedState?e.child.child:e.child),(r=o.sibling=Kr(a,r,n,null)).effectTag|=2,(n=o).childExpirationTime=0,n.return=r.return=e):r=n=yo(e,u,o.children,n)),e.stateNode=t.stateNode;return e.memoizedState=i,e.child=n,r}function Ni(t,e,n){if(null!==t&&(e.contextDependencies=t.contextDependencies),e.childExpirationTime<n)return null;if(null!==t&&e.child!==t.child&&b("153"),null!==e.child){for(n=Gr(t=e.child,t.pendingProps,t.expirationTime),(e.child=n).return=e;null!==t.sibling;)t=t.sibling,(n=n.sibling=Gr(t,t.pendingProps,t.expirationTime)).return=e;n.sibling=null}return e.child}function Mi(t,e,n){var r=e.expirationTime;if(null!==t){if(t.memoizedProps!==e.pendingProps||Rr.current)Ei=!0;else if(r<n){switch(Ei=!1,e.tag){case 3:Ri(e),wi();break;case 5:ko(e);break;case 1:Mr(e.type)&&Dr(e);break;case 4:So(e,e.stateNode.containerInfo);break;case 10:Di(e,e.memoizedProps.value);break;case 13:if(null!==e.memoizedState)return 0!==(r=e.child.childExpirationTime)&&n<=r?Ai(t,e,n):null!==(e=Ni(t,e,n))?e.sibling:null}return Ni(t,e,n)}}else Ei=!1;switch(e.expirationTime=0,e.tag){case 2:r=e.elementType,null!==t&&(t.alternate=null,e.alternate=null,e.effectTag|=2),t=e.pendingProps;var o=Nr(e,jr.current);if(zi(e,n),o=Xo(null,e,r,t,o,n),e.effectTag|=1,"object"==typeof o&&null!==o&&"function"==typeof o.render&&void 0===o.$$typeof){if(e.tag=1,Jo(),Mr(r)){var i=!0;Dr(e)}else i=!1;e.memoizedState=null!==o.state&&void 0!==o.state?o.state:null;var a=r.getDerivedStateFromProps;"function"==typeof a&&io(e,r,a,t),o.updater=ao,so((e.stateNode=o)._reactInternalFiber=e,r,t,n),e=ji(null,e,r,!0,i,n)}else e.tag=0,Si(null,e,o,n),e=e.child;return e;case 16:switch(o=e.elementType,null!==t&&(t.alternate=null,e.alternate=null,e.effectTag|=2),i=e.pendingProps,t=function(e){var t=e._result;switch(e._status){case 1:return t;case 2:case 0:throw t;default:switch(e._status=0,(t=(t=e._ctor)()).then(function(t){0===e._status&&(t=t.default,e._status=1,e._result=t)},function(t){0===e._status&&(e._status=2,e._result=t)}),e._status){case 1:return e._result;case 2:throw e._result}throw e._result=t}}(o),e.type=t,o=e.tag=function(t){if("function"==typeof t)return $r(t)?1:0;if(null!=t){if((t=t.$$typeof)===ee)return 11;if(t===re)return 14}return 2}(t),i=ro(t,i),a=void 0,o){case 0:a=Pi(null,e,t,i,n);break;case 1:a=Ci(null,e,t,i,n);break;case 11:a=_i(null,e,t,i,n);break;case 14:a=ki(null,e,t,ro(t.type,i),r,n);break;default:b("306",t,"")}return a;case 0:return r=e.type,o=e.pendingProps,Pi(t,e,r,o=e.elementType===r?o:ro(r,o),n);case 1:return r=e.type,o=e.pendingProps,Ci(t,e,r,o=e.elementType===r?o:ro(r,o),n);case 3:return Ri(e),null===(r=e.updateQueue)&&b("282"),o=null!==(o=e.memoizedState)?o.element:null,na(e,r,e.pendingProps,null,n),e=(r=e.memoizedState.element)===o?(wi(),Ni(t,e,n)):(o=e.stateNode,(o=(null===t||null===t.child)&&o.hydrate)&&(di=_r(e.stateNode.containerInfo),pi=e,o=hi=!0),o?(e.effectTag|=2,e.child=mo(e,null,r,n)):(Si(t,e,r,n),wi()),e.child);case 5:return ko(e),null===t&&mi(e),r=e.type,o=e.pendingProps,i=null!==t?t.memoizedProps:null,a=o.children,gr(r,o)?a=null:null!==i&&gr(r,i)&&(e.effectTag|=16),Ti(t,e),e=1!==n&&1&e.mode&&o.hidden?(e.expirationTime=e.childExpirationTime=1,null):(Si(t,e,a,n),e.child);case 6:return null===t&&mi(e),null;case 13:return Ai(t,e,n);case 4:return So(e,e.stateNode.containerInfo),r=e.pendingProps,null===t?e.child=yo(e,null,r,n):Si(t,e,r,n),e.child;case 11:return r=e.type,o=e.pendingProps,_i(t,e,r,o=e.elementType===r?o:ro(r,o),n);case 7:return Si(t,e,e.pendingProps,n),e.child;case 8:case 12:return Si(t,e,e.pendingProps.children,n),e.child;case 10:t:{if(r=e.type._context,o=e.pendingProps,a=e.memoizedProps,Di(e,i=o.value),null!==a){var u=a.value;if(0===(i=Je(u,i)?0:0|("function"==typeof r._calculateChangedBits?r._calculateChangedBits(u,i):1073741823))){if(a.children===o.children&&!Rr.current){e=Ni(t,e,n);break t}}else for(null!==(u=e.child)&&(u.return=e);null!==u;){var c=u.contextDependencies;if(null!==c){a=u.child;for(var l=c.first;null!==l;){if(l.context===r&&0!=(l.observedBits&i)){1===u.tag&&((l=Qi(n)).tag=Vi,Ji(u,l)),u.expirationTime<n&&(u.expirationTime=n),null!==(l=u.alternate)&&l.expirationTime<n&&(l.expirationTime=n),l=n;for(var s=u.return;null!==s;){var f=s.alternate;if(s.childExpirationTime<l)s.childExpirationTime=l,null!==f&&f.childExpirationTime<l&&(f.childExpirationTime=l);else{if(!(null!==f&&f.childExpirationTime<l))break;f.childExpirationTime=l}s=s.return}c.expirationTime<n&&(c.expirationTime=n);break}l=l.next}}else a=10===u.tag&&u.type===e.type?null:u.child;if(null!==a)a.return=u;else for(a=u;null!==a;){if(a===e){a=null;break}if(null!==(u=a.sibling)){u.return=a.return,a=u;break}a=a.return}u=a}}Si(t,e,o.children,n),e=e.child}return e;case 9:return o=e.type,r=(i=e.pendingProps).children,zi(e,n),r=r(o=Hi(o,i.unstable_observedBits)),e.effectTag|=1,Si(t,e,r,n),e.child;case 14:return i=ro(o=e.type,e.pendingProps),ki(t,e,o,i=ro(o.type,i),r,n);case 15:return Oi(t,e,e.type,e.pendingProps,r,n);case 17:return r=e.type,o=e.pendingProps,o=e.elementType===r?o:ro(r,o),null!==t&&(t.alternate=null,e.alternate=null,e.effectTag|=2),e.tag=1,Mr(r)?(t=!0,Dr(e)):t=!1,zi(e,n),co(e,r,o),so(e,r,o,n),ji(null,e,r,!0,t,n)}b("156")}var Li={current:null},Ii=null,Fi=null,Ui=null;function Di(t,e){var n=t.type._context;Pr(Li,n._currentValue),n._currentValue=e}function Wi(t){var e=Li.current;Tr(Li),t.type._context._currentValue=e}function zi(t,e){Ui=Fi=null;var n=(Ii=t).contextDependencies;null!==n&&n.expirationTime>=e&&(Ei=!0),t.contextDependencies=null}function Hi(t,e){return Ui!==t&&!1!==e&&0!==e&&("number"==typeof e&&1073741823!==e||(Ui=t,e=1073741823),e={context:t,observedBits:e,next:null},null===Fi?(null===Ii&&b("308"),Fi=e,Ii.contextDependencies={first:e,expirationTime:0}):Fi=Fi.next=e),t._currentValue}var qi=0,Bi=1,Vi=2,$i=3,Gi=!1;function Yi(t){return{baseState:t,firstUpdate:null,lastUpdate:null,firstCapturedUpdate:null,lastCapturedUpdate:null,firstEffect:null,lastEffect:null,firstCapturedEffect:null,lastCapturedEffect:null}}function Ki(t){return{baseState:t.baseState,firstUpdate:t.firstUpdate,lastUpdate:t.lastUpdate,firstCapturedUpdate:null,lastCapturedUpdate:null,firstEffect:null,lastEffect:null,firstCapturedEffect:null,lastCapturedEffect:null}}function Qi(t){return{expirationTime:t,tag:qi,payload:null,callback:null,next:null,nextEffect:null}}function Xi(t,e){null===t.lastUpdate?t.firstUpdate=t.lastUpdate=e:(t.lastUpdate.next=e,t.lastUpdate=e)}function Ji(t,e){var n=t.alternate;if(null===n){var r=t.updateQueue,o=null;null===r&&(r=t.updateQueue=Yi(t.memoizedState))}else r=t.updateQueue,o=n.updateQueue,null===r?null===o?(r=t.updateQueue=Yi(t.memoizedState),o=n.updateQueue=Yi(n.memoizedState)):r=t.updateQueue=Ki(o):null===o&&(o=n.updateQueue=Ki(r));null===o||r===o?Xi(r,e):null===r.lastUpdate||null===o.lastUpdate?(Xi(r,e),Xi(o,e)):(Xi(r,e),o.lastUpdate=e)}function Zi(t,e){var n=t.updateQueue;null===(n=null===n?t.updateQueue=Yi(t.memoizedState):ta(t,n)).lastCapturedUpdate?n.firstCapturedUpdate=n.lastCapturedUpdate=e:(n.lastCapturedUpdate.next=e,n.lastCapturedUpdate=e)}function ta(t,e){var n=t.alternate;return null!==n&&e===n.updateQueue&&(e=t.updateQueue=Ki(e)),e}function ea(t,e,n,r,o,i){switch(n.tag){case Bi:return"function"==typeof(t=n.payload)?t.call(i,r,o):t;case $i:t.effectTag=-2049&t.effectTag|64;case qi:if(null==(o="function"==typeof(t=n.payload)?t.call(i,r,o):t))break;return g({},r,o);case Vi:Gi=!0}return r}function na(t,e,n,r,o){Gi=!1;for(var i=(e=ta(t,e)).baseState,a=null,u=0,c=e.firstUpdate,l=i;null!==c;){var s=c.expirationTime;s<o?(null===a&&(a=c,i=l),u<s&&(u=s)):(l=ea(t,0,c,l,n,r),null!==c.callback&&(t.effectTag|=32,(c.nextEffect=null)===e.lastEffect?e.firstEffect=e.lastEffect=c:(e.lastEffect.nextEffect=c,e.lastEffect=c))),c=c.next}for(s=null,c=e.firstCapturedUpdate;null!==c;){var f=c.expirationTime;f<o?(null===s&&(s=c,null===a&&(i=l)),u<f&&(u=f)):(l=ea(t,0,c,l,n,r),null!==c.callback&&(t.effectTag|=32,(c.nextEffect=null)===e.lastCapturedEffect?e.firstCapturedEffect=e.lastCapturedEffect=c:(e.lastCapturedEffect.nextEffect=c,e.lastCapturedEffect=c))),c=c.next}null===a&&(e.lastUpdate=null),null===s?e.lastCapturedUpdate=null:t.effectTag|=32,null===a&&null===s&&(i=l),e.baseState=i,e.firstUpdate=a,e.firstCapturedUpdate=s,t.expirationTime=u,t.memoizedState=l}function ra(t,e,n){null!==e.firstCapturedUpdate&&(null!==e.lastUpdate&&(e.lastUpdate.next=e.firstCapturedUpdate,e.lastUpdate=e.lastCapturedUpdate),e.firstCapturedUpdate=e.lastCapturedUpdate=null),oa(e.firstEffect,n),e.firstEffect=e.lastEffect=null,oa(e.firstCapturedEffect,n),e.firstCapturedEffect=e.lastCapturedEffect=null}function oa(t,e){for(;null!==t;){var n=t.callback;if(null!==n){t.callback=null;var r=e;"function"!=typeof n&&b("191",n),n.call(r)}t=t.nextEffect}}function ia(t,e){return{value:t,source:e,stack:ce(e)}}function aa(t){t.effectTag|=4}var ua=void 0,ca=void 0,la=void 0,sa=void 0;ua=function(t,e){for(var n=e.child;null!==n;){if(5===n.tag||6===n.tag)t.appendChild(n.stateNode);else if(4!==n.tag&&null!==n.child){n=(n.child.return=n).child;continue}if(n===e)break;for(;null===n.sibling;){if(null===n.return||n.return===e)return;n=n.return}n.sibling.return=n.return,n=n.sibling}},ca=function(){},la=function(t,e,n,r,o){var i=t.memoizedProps;if(i!==r){var a=e.stateNode;switch(Eo(bo.current),t=null,n){case"input":i=be(a,i),r=be(a,r),t=[];break;case"option":i=Gn(a,i),r=Gn(a,r),t=[];break;case"select":i=g({},i,{value:void 0}),r=g({},r,{value:void 0}),t=[];break;case"textarea":i=Kn(a,i),r=Kn(a,r),t=[];break;default:"function"!=typeof i.onClick&&"function"==typeof r.onClick&&(a.onclick=hr)}fr(n,r),a=n=void 0;var u=null;for(n in i)if(!r.hasOwnProperty(n)&&i.hasOwnProperty(n)&&null!=i[n])if("style"===n){var c=i[n];for(a in c)c.hasOwnProperty(a)&&((u=u||{})[a]="")}else"dangerouslySetInnerHTML"!==n&&"children"!==n&&"suppressContentEditableWarning"!==n&&"suppressHydrationWarning"!==n&&"autoFocus"!==n&&(E.hasOwnProperty(n)?t=t||[]:(t=t||[]).push(n,null));for(n in r){var l=r[n];if(c=null!=i?i[n]:void 0,r.hasOwnProperty(n)&&l!==c&&(null!=l||null!=c))if("style"===n)if(c){for(a in c)!c.hasOwnProperty(a)||l&&l.hasOwnProperty(a)||((u=u||{})[a]="");for(a in l)l.hasOwnProperty(a)&&c[a]!==l[a]&&((u=u||{})[a]=l[a])}else u||(t=t||[]).push(n,u),u=l;else"dangerouslySetInnerHTML"===n?(l=l?l.__html:void 0,c=c?c.__html:void 0,null!=l&&c!==l&&(t=t||[]).push(n,""+l)):"children"===n?c===l||"string"!=typeof l&&"number"!=typeof l||(t=t||[]).push(n,""+l):"suppressContentEditableWarning"!==n&&"suppressHydrationWarning"!==n&&(E.hasOwnProperty(n)?(null!=l&&dr(o,n),t||c===l||(t=[])):(t=t||[]).push(n,l))}u&&(t=t||[]).push("style",u),o=t,(e.updateQueue=o)&&aa(e)}},sa=function(t,e,n,r){n!==r&&aa(e)};var fa="function"==typeof WeakSet?WeakSet:Set;function pa(t,e){var n=e.source,r=e.stack;null===r&&null!==n&&(r=ce(n)),null!==n&&ue(n.type),e=e.value,null!==t&&1===t.tag&&ue(t.type);try{console.error(e)}catch(t){setTimeout(function(){throw t})}}function da(e){var t=e.ref;if(null!==t)if("function"==typeof t)try{t(null)}catch(t){Ya(e,t)}else t.current=null}function ha(t,e,n){if(null!==(n=null!==(n=n.updateQueue)?n.lastEffect:null)){var r=n=n.next;do{if((r.tag&t)!==To){var o=r.destroy;(r.destroy=void 0)!==o&&o()}(r.tag&e)!==To&&(o=r.create,r.destroy=o()),r=r.next}while(r!==n)}}function va(e){switch("function"==typeof Hr&&Hr(e),e.tag){case 0:case 11:case 14:case 15:var t=e.updateQueue;if(null!==t&&null!==(t=t.lastEffect)){var n=t=t.next;do{var r=n.destroy;if(void 0!==r){var o=e;try{r()}catch(t){Ya(o,t)}}n=n.next}while(n!==t)}break;case 1:if(da(e),"function"==typeof(t=e.stateNode).componentWillUnmount)try{t.props=e.memoizedProps,t.state=e.memoizedState,t.componentWillUnmount()}catch(t){Ya(e,t)}break;case 5:da(e);break;case 4:ga(e)}}function ya(t){return 5===t.tag||3===t.tag||4===t.tag}function ma(t){t:{for(var e=t.return;null!==e;){if(ya(e)){var n=e;break t}e=e.return}b("160"),n=void 0}var r=e=void 0;switch(n.tag){case 5:e=n.stateNode,r=!1;break;case 3:case 4:e=n.stateNode.containerInfo,r=!0;break;default:b("161")}16&n.effectTag&&(ir(e,""),n.effectTag&=-17);t:e:for(n=t;;){for(;null===n.sibling;){if(null===n.return||ya(n.return)){n=null;break t}n=n.return}for(n.sibling.return=n.return,n=n.sibling;5!==n.tag&&6!==n.tag&&18!==n.tag;){if(2&n.effectTag)continue e;if(null===n.child||4===n.tag)continue e;n=(n.child.return=n).child}if(!(2&n.effectTag)){n=n.stateNode;break t}}for(var o=t;;){if(5===o.tag||6===o.tag)if(n)if(r){var i=e,a=o.stateNode,u=n;8===i.nodeType?i.parentNode.insertBefore(a,u):i.insertBefore(a,u)}else e.insertBefore(o.stateNode,n);else r?(a=e,u=o.stateNode,8===a.nodeType?(i=a.parentNode).insertBefore(u,a):(i=a).appendChild(u),null!=(a=a._reactRootContainer)||null!==i.onclick||(i.onclick=hr)):e.appendChild(o.stateNode);else if(4!==o.tag&&null!==o.child){o=(o.child.return=o).child;continue}if(o===t)break;for(;null===o.sibling;){if(null===o.return||o.return===t)return;o=o.return}o.sibling.return=o.return,o=o.sibling}}function ga(t){for(var e=t,n=!1,r=void 0,o=void 0;;){if(!n){n=e.return;t:for(;;){switch(null===n&&b("160"),n.tag){case 5:r=n.stateNode,o=!1;break t;case 3:case 4:r=n.stateNode.containerInfo,o=!0;break t}n=n.return}n=!0}if(5===e.tag||6===e.tag){t:for(var i=e,a=i;;)if(va(a),null!==a.child&&4!==a.tag)a.child.return=a,a=a.child;else{if(a===i)break;for(;null===a.sibling;){if(null===a.return||a.return===i)break t;a=a.return}a.sibling.return=a.return,a=a.sibling}o?(i=r,a=e.stateNode,8===i.nodeType?i.parentNode.removeChild(a):i.removeChild(a)):r.removeChild(e.stateNode)}else if(4===e.tag){if(null!==e.child){r=e.stateNode.containerInfo,o=!0,e=(e.child.return=e).child;continue}}else if(va(e),null!==e.child){e=(e.child.return=e).child;continue}if(e===t)break;for(;null===e.sibling;){if(null===e.return||e.return===t)return;4===(e=e.return).tag&&(n=!1)}e.sibling.return=e.return,e=e.sibling}}function ba(t,n){switch(n.tag){case 0:case 11:case 14:case 15:ha(Co,jo,n);break;case 1:break;case 5:var e=n.stateNode;if(null!=e){var r=n.memoizedProps;t=null!==t?t.memoizedProps:r;var o=n.type,i=n.updateQueue;(n.updateQueue=null)!==i&&function(t,e,n,r,o){t[M]=o,"input"===n&&"radio"===o.type&&null!=o.name&&xe(t,o),pr(n,r),r=pr(n,o);for(var i=0;i<e.length;i+=2){var a=e[i],u=e[i+1];"style"===a?lr(t,u):"dangerouslySetInnerHTML"===a?or(t,u):"children"===a?ir(t,u):me(t,a,u,r)}switch(n){case"input":Ee(t,o);break;case"textarea":Xn(t,o);break;case"select":e=t._wrapperState.wasMultiple,t._wrapperState.wasMultiple=!!o.multiple,null!=(n=o.value)?Yn(t,!!o.multiple,n,!1):e!==!!o.multiple&&(null!=o.defaultValue?Yn(t,!!o.multiple,o.defaultValue,!0):Yn(t,!!o.multiple,o.multiple?[]:"",!1))}}(e,i,o,t,r)}break;case 6:null===n.stateNode&&b("162"),n.stateNode.nodeValue=n.memoizedProps;break;case 3:case 12:break;case 13:if(e=n.memoizedState,r=void 0,t=n,null===e?r=!1:(r=!0,t=n.child,0===e.timedOutAt&&(e.timedOutAt=Eu())),null!==t&&function(t,e){for(var n=t;;){if(5===n.tag){var r=n.stateNode;if(e)r.style.display="none";else{r=n.stateNode;var o=n.memoizedProps.style;o=null!=o&&o.hasOwnProperty("display")?o.display:null,r.style.display=cr("display",o)}}else if(6===n.tag)n.stateNode.nodeValue=e?"":n.memoizedProps;else{if(13===n.tag&&null!==n.memoizedState){(r=n.child.sibling).return=n,n=r;continue}if(null!==n.child){n=(n.child.return=n).child;continue}}if(n===t)break;for(;null===n.sibling;){if(null===n.return||n.return===t)return;n=n.return}n.sibling.return=n.return,n=n.sibling}}(t,r),null!==(e=n.updateQueue)){n.updateQueue=null;var a=n.stateNode;null===a&&(a=n.stateNode=new fa),e.forEach(function(t){var e=function(t,e){var n=t.stateNode;null!==n&&n.delete(e),e=Ka(e=Eu(),t),null!==(t=Xa(t,e))&&(Zr(t,e),0!==(e=t.expirationTime)&&Su(t,e))}.bind(null,n,t);a.has(t)||(a.add(t),t.then(e,e))})}break;case 17:break;default:b("163")}}var wa="function"==typeof WeakMap?WeakMap:Map;function xa(t,e,n){(n=Qi(n)).tag=$i,n.payload={element:null};var r=e.value;return n.callback=function(){Au(r),pa(t,e)},n}function Ea(n,r,t){(t=Qi(t)).tag=$i;var o=n.type.getDerivedStateFromError;if("function"==typeof o){var e=r.value;t.payload=function(){return o(e)}}var i=n.stateNode;return null!==i&&"function"==typeof i.componentDidCatch&&(t.callback=function(){"function"!=typeof o&&(null===Ua?Ua=new Set([this]):Ua.add(this));var t=r.value,e=r.stack;pa(n,r),this.componentDidCatch(t,{componentStack:null!==e?e:""})}),t}function Sa(t){switch(t.tag){case 1:Mr(t.type)&&Lr();var e=t.effectTag;return 2048&e?(t.effectTag=-2049&e|64,t):null;case 3:return _o(),Ir(),0!=(64&(e=t.effectTag))&&b("285"),t.effectTag=-2049&e|64,t;case 5:return Oo(t),null;case 13:return 2048&(e=t.effectTag)?(t.effectTag=-2049&e|64,t):null;case 18:return null;case 4:return _o(),null;case 10:return Wi(t),null;default:return null}}var _a=Bt.ReactCurrentDispatcher,ka=Bt.ReactCurrentOwner,Oa=1073741822,Ta=!1,Pa=null,Ca=null,ja=0,Ra=-1,Aa=!1,Na=null,Ma=!1,La=null,Ia=null,Fa=null,Ua=null;function Da(){if(null!==Pa)for(var t=Pa.return;null!==t;){var e=t;switch(e.tag){case 1:var n=e.type.childContextTypes;null!=n&&Lr();break;case 3:_o(),Ir();break;case 5:Oo(e);break;case 4:_o();break;case 10:Wi(e)}t=t.return}ja=0,Aa=!(Ra=-1),Pa=Ca=null}function Wa(){for(;null!==Na;){var t=Na.effectTag;if(16&t&&ir(Na.stateNode,""),128&t){var e=Na.alternate;null!==e&&(null!==(e=e.ref)&&("function"==typeof e?e(null):e.current=null))}switch(14&t){case 2:ma(Na),Na.effectTag&=-3;break;case 6:ma(Na),Na.effectTag&=-3,ba(Na.alternate,Na);break;case 4:ba(Na.alternate,Na);break;case 8:ga(t=Na),t.return=null,t.child=null,t.memoizedState=null,(t.updateQueue=null)!==(t=t.alternate)&&(t.return=null,t.child=null,t.memoizedState=null,t.updateQueue=null)}Na=Na.nextEffect}}function za(){for(;null!==Na;){if(256&Na.effectTag)t:{var t=Na.alternate,e=Na;switch(e.tag){case 0:case 11:case 15:ha(Po,To,e);break t;case 1:if(256&e.effectTag&&null!==t){var n=t.memoizedProps,r=t.memoizedState;e=(t=e.stateNode).getSnapshotBeforeUpdate(e.elementType===e.type?n:ro(e.type,n),r),t.__reactInternalSnapshotBeforeUpdate=e}break t;case 3:case 5:case 6:case 4:case 17:break t;default:b("163")}}Na=Na.nextEffect}}function Ha(t,e){for(;null!==Na;){var n=Na.effectTag;if(36&n){var r=Na.alternate,o=Na,i=e;switch(o.tag){case 0:case 11:case 15:ha(Ro,Ao,o);break;case 1:var a=o.stateNode;if(4&o.effectTag)if(null===r)a.componentDidMount();else{var u=o.elementType===o.type?r.memoizedProps:ro(o.type,r.memoizedProps);a.componentDidUpdate(u,r.memoizedState,a.__reactInternalSnapshotBeforeUpdate)}null!==(r=o.updateQueue)&&ra(0,r,a);break;case 3:if(null!==(r=o.updateQueue)){if((a=null)!==o.child)switch(o.child.tag){case 5:a=o.child.stateNode;break;case 1:a=o.child.stateNode}ra(0,r,a)}break;case 5:i=o.stateNode,null===r&&4&o.effectTag&&mr(o.type,o.memoizedProps)&&i.focus();break;case 6:case 4:case 12:case 13:case 17:break;default:b("163")}}128&n&&(null!==(o=Na.ref)&&(i=Na.stateNode,"function"==typeof o?o(i):o.current=i)),512&n&&(La=t),Na=Na.nextEffect}}function qa(){null!==Ia&&Er(Ia),null!==Fa&&Fa()}function Ba(t,e){Ma=Ta=!0,t.current===e&&b("177");var n=t.pendingCommitExpirationTime;0===n&&b("261"),t.pendingCommitExpirationTime=0;var r=e.expirationTime,o=e.childExpirationTime;for(function(t,e){if(t.didError=!1,0===e)t.earliestPendingTime=0,t.latestPendingTime=0,t.earliestSuspendedTime=0,t.latestSuspendedTime=0,t.latestPingedTime=0;else{e<t.latestPingedTime&&(t.latestPingedTime=0);var n=t.latestPendingTime;0!==n&&(e<n?t.earliestPendingTime=t.latestPendingTime=0:t.earliestPendingTime>e&&(t.earliestPendingTime=t.latestPendingTime)),0===(n=t.earliestSuspendedTime)?Zr(t,e):e<t.latestSuspendedTime?(t.earliestSuspendedTime=0,t.latestSuspendedTime=0,t.latestPingedTime=0,Zr(t,e)):n<e&&Zr(t,e)}no(0,t)}(t,r<o?o:r),ka.current=null,r=void 0,r=1<e.effectTag?null!==e.lastEffect?(e.lastEffect.nextEffect=e).firstEffect:e:e.firstEffect,vr=_n,yr=function(){var t=In();if(Fn(t)){if("selectionStart"in t)var e={start:t.selectionStart,end:t.selectionEnd};else t:{var n=(e=(e=t.ownerDocument)&&e.defaultView||window).getSelection&&e.getSelection();if(n&&0!==n.rangeCount){e=n.anchorNode;var r=n.anchorOffset,o=n.focusNode;n=n.focusOffset;try{e.nodeType,o.nodeType}catch(t){e=null;break t}var i=0,a=-1,u=-1,c=0,l=0,s=t,f=null;e:for(;;){for(var p;s!==e||0!==r&&3!==s.nodeType||(a=i+r),s!==o||0!==n&&3!==s.nodeType||(u=i+n),3===s.nodeType&&(i+=s.nodeValue.length),null!==(p=s.firstChild);)f=s,s=p;for(;;){if(s===t)break e;if(f===e&&++c===r&&(a=i),f===o&&++l===n&&(u=i),null!==(p=s.nextSibling))break;f=(s=f).parentNode}s=p}e=-1===a||-1===u?null:{start:a,end:u}}else e=null}e=e||{start:0,end:0}}else e=null;return{focusedElem:t,selectionRange:e}}(),_n=!1,Na=r;null!==Na;){o=!1;var i=void 0;try{za()}catch(t){o=!0,i=t}o&&(null===Na&&b("178"),Ya(Na,i),null!==Na&&(Na=Na.nextEffect))}for(Na=r;null!==Na;){o=!1,i=void 0;try{Wa()}catch(t){o=!0,i=t}o&&(null===Na&&b("178"),Ya(Na,i),null!==Na&&(Na=Na.nextEffect))}for(Un(yr),_n=!!vr,vr=yr=null,t.current=e,Na=r;null!==Na;){o=!1,i=void 0;try{Ha(t,n)}catch(t){o=!0,i=t}o&&(null===Na&&b("178"),Ya(Na,i),null!==Na&&(Na=Na.nextEffect))}if(null!==r&&null!==La){var a=function(t,e){Fa=Ia=La=null;var n=ou;ou=!0;do{if(512&e.effectTag){var r=!1,o=void 0;try{var i=e;ha(Mo,To,i),ha(To,No,i)}catch(t){r=!0,o=t}r&&Ya(e,o)}e=e.nextEffect}while(null!==e);ou=n,0!==(n=t.expirationTime)&&Su(t,n),su||ou||Pu(1073741823,!1)}.bind(null,t,r);Ia=u.unstable_runWithPriority(u.unstable_NormalPriority,function(){return xr(a)}),Fa=a}Ta=Ma=!1,"function"==typeof zr&&zr(e.stateNode),0===(e=(n=e.expirationTime)<(e=e.childExpirationTime)?e:n)&&(Ua=null),function(t,e){t.expirationTime=e,t.finishedWork=null}(t,e)}function Va(t){for(;;){var e=t.alternate,n=t.return,r=t.sibling;if(0==(1024&t.effectTag)){t:{var o=e,i=ja,a=(e=Pa=t).pendingProps;switch(e.tag){case 2:case 16:break;case 15:case 0:break;case 1:Mr(e.type)&&Lr();break;case 3:_o(),Ir(),(a=e.stateNode).pendingContext&&(a.context=a.pendingContext,a.pendingContext=null),null!==o&&null!==o.child||(bi(e),e.effectTag&=-3),ca(e);break;case 5:Oo(e);var u=Eo(xo.current);if(i=e.type,null!==o&&null!=e.stateNode)la(o,e,i,a,u),o.ref!==e.ref&&(e.effectTag|=128);else if(a){var c=Eo(bo.current);if(bi(e)){o=(a=e).stateNode;var l=a.type,s=a.memoizedProps,f=u;switch(o[N]=a,o[M]=s,i=void 0,u=l){case"iframe":case"object":kn("load",o);break;case"video":case"audio":for(l=0;l<et.length;l++)kn(et[l],o);break;case"source":kn("error",o);break;case"img":case"image":case"link":kn("error",o),kn("load",o);break;case"form":kn("reset",o),kn("submit",o);break;case"details":kn("toggle",o);break;case"input":we(o,s),kn("invalid",o),dr(f,"onChange");break;case"select":o._wrapperState={wasMultiple:!!s.multiple},kn("invalid",o),dr(f,"onChange");break;case"textarea":Qn(o,s),kn("invalid",o),dr(f,"onChange")}for(i in fr(u,s),l=null,s)s.hasOwnProperty(i)&&(c=s[i],"children"===i?"string"==typeof c?o.textContent!==c&&(l=["children",c]):"number"==typeof c&&o.textContent!==""+c&&(l=["children",""+c]):E.hasOwnProperty(i)&&null!=c&&dr(f,i));switch(u){case"input":Ht(o),Se(o,s,!0);break;case"textarea":Ht(o),Jn(o);break;case"select":case"option":break;default:"function"==typeof s.onClick&&(o.onclick=hr)}i=l,a.updateQueue=i,(a=null!==i)&&aa(e)}else{s=e,f=i,o=a,l=9===u.nodeType?u:u.ownerDocument,c===Zn.html&&(c=tr(f)),c===Zn.html?"script"===f?((o=l.createElement("div")).innerHTML="<script><\/script>",l=o.removeChild(o.firstChild)):"string"==typeof o.is?l=l.createElement(f,{is:o.is}):(l=l.createElement(f),"select"===f&&(f=l,o.multiple?f.multiple=!0:o.size&&(f.size=o.size))):l=l.createElementNS(c,f),(o=l)[N]=s,o[M]=a,ua(o,e,!1,!1),f=o;var p=u,d=pr(l=i,s=a);switch(l){case"iframe":case"object":kn("load",f),u=s;break;case"video":case"audio":for(u=0;u<et.length;u++)kn(et[u],f);u=s;break;case"source":kn("error",f),u=s;break;case"img":case"image":case"link":kn("error",f),kn("load",f),u=s;break;case"form":kn("reset",f),kn("submit",f),u=s;break;case"details":kn("toggle",f),u=s;break;case"input":we(f,s),u=be(f,s),kn("invalid",f),dr(p,"onChange");break;case"option":u=Gn(f,s);break;case"select":f._wrapperState={wasMultiple:!!s.multiple},u=g({},s,{value:void 0}),kn("invalid",f),dr(p,"onChange");break;case"textarea":Qn(f,s),u=Kn(f,s),kn("invalid",f),dr(p,"onChange");break;default:u=s}fr(l,u),c=void 0;var h=l,v=f,y=u;for(c in y)if(y.hasOwnProperty(c)){var m=y[c];"style"===c?lr(v,m):"dangerouslySetInnerHTML"===c?null!=(m=m?m.__html:void 0)&&or(v,m):"children"===c?"string"==typeof m?"textarea"===h&&""===m||ir(v,m):"number"==typeof m&&ir(v,""+m):"suppressContentEditableWarning"!==c&&"suppressHydrationWarning"!==c&&"autoFocus"!==c&&(E.hasOwnProperty(c)?null!=m&&dr(p,c):null!=m&&me(v,c,m,d))}switch(l){case"input":Ht(f),Se(f,s,!1);break;case"textarea":Ht(f),Jn(f);break;case"option":null!=s.value&&f.setAttribute("value",""+ge(s.value));break;case"select":(u=f).multiple=!!s.multiple,null!=(f=s.value)?Yn(u,!!s.multiple,f,!1):null!=s.defaultValue&&Yn(u,!!s.multiple,s.defaultValue,!0);break;default:"function"==typeof u.onClick&&(f.onclick=hr)}(a=mr(i,a))&&aa(e),e.stateNode=o}null!==e.ref&&(e.effectTag|=128)}else null===e.stateNode&&b("166");break;case 6:o&&null!=e.stateNode?sa(o,e,o.memoizedProps,a):("string"==typeof a||null===e.stateNode&&b("166"),o=Eo(xo.current),Eo(bo.current),bi(e)?(i=(a=e).stateNode,o=a.memoizedProps,i[N]=a,(a=i.nodeValue!==o)&&aa(e)):(i=e,(a=(9===o.nodeType?o:o.ownerDocument).createTextNode(a))[N]=e,i.stateNode=a));break;case 11:break;case 13:if(a=e.memoizedState,0!=(64&e.effectTag)){e.expirationTime=i,Pa=e;break t}a=null!==a,i=null!==o&&null!==o.memoizedState,null!==o&&!a&&i&&(null!==(o=o.child.sibling)&&(null!==(u=e.firstEffect)?(e.firstEffect=o).nextEffect=u:(e.firstEffect=e.lastEffect=o,o.nextEffect=null),o.effectTag=8)),(a||i)&&(e.effectTag|=4);break;case 7:case 8:case 12:break;case 4:_o(),ca(e);break;case 10:Wi(e);break;case 9:case 14:break;case 17:Mr(e.type)&&Lr();break;case 18:break;default:b("156")}Pa=null}if(e=t,1===ja||1!==e.childExpirationTime){for(a=0,i=e.child;null!==i;)a<(o=i.expirationTime)&&(a=o),a<(u=i.childExpirationTime)&&(a=u),i=i.sibling;e.childExpirationTime=a}if(null!==Pa)return Pa;null!==n&&0==(1024&n.effectTag)&&(null===n.firstEffect&&(n.firstEffect=t.firstEffect),null!==t.lastEffect&&(null!==n.lastEffect&&(n.lastEffect.nextEffect=t.firstEffect),n.lastEffect=t.lastEffect),1<t.effectTag&&(null!==n.lastEffect?n.lastEffect.nextEffect=t:n.firstEffect=t,n.lastEffect=t))}else{if(null!==(t=Sa(t)))return t.effectTag&=1023,t;null!==n&&(n.firstEffect=n.lastEffect=null,n.effectTag|=1024)}if(null!==r)return r;if(null===n)break;t=n}return null}function $a(t){var e=Mi(t.alternate,t,ja);return t.memoizedProps=t.pendingProps,null===e&&(e=Va(t)),ka.current=null,e}function Ga(e,t){Ta&&b("243"),qa(),Ta=!0;var n=_a.current;_a.current=li;var r=e.nextExpirationTimeToWorkOn;r===ja&&e===Ca&&null!==Pa||(Da(),ja=r,Pa=Gr((Ca=e).current,null),e.pendingCommitExpirationTime=0);for(var o=!1;;){try{if(t)for(;null!==Pa&&!Ou();)Pa=$a(Pa);else for(;null!==Pa;)Pa=$a(Pa)}catch(t){if(Ui=Fi=Ii=null,Jo(),null===Pa)o=!0,Au(t);else{null===Pa&&b("271");var i=Pa,a=i.return;if(null!==a){t:{var u=e,c=a,l=i,s=t;if(a=ja,l.effectTag|=1024,l.firstEffect=l.lastEffect=null,null!==s&&"object"==typeof s&&"function"==typeof s.then){var f=s;s=c;var p=-1,d=-1;do{if(13===s.tag){var h=s.alternate;if(null!==h&&null!==(h=h.memoizedState)){d=10*(1073741822-h.timedOutAt);break}"number"==typeof(h=s.pendingProps.maxDuration)&&(h<=0?p=0:(-1===p||h<p)&&(p=h))}s=s.return}while(null!==s);s=c;do{if((h=13===s.tag)&&(h=void 0!==s.memoizedProps.fallback&&null===s.memoizedState),h){if(null===(c=s.updateQueue)?((c=new Set).add(f),s.updateQueue=c):c.add(f),0==(1&s.mode)){s.effectTag|=64,l.effectTag&=-1957,1===l.tag&&(null===l.alternate?l.tag=17:((a=Qi(1073741823)).tag=Vi,Ji(l,a))),l.expirationTime=1073741823;break t}c=a;var v=(l=u).pingCache;null===v?(v=l.pingCache=new wa,h=new Set,v.set(f,h)):void 0===(h=v.get(f))&&(h=new Set,v.set(f,h)),h.has(c)||(h.add(c),l=Qa.bind(null,l,f,c),f.then(l,l)),0<=(u=-1===p?1073741823:(-1===d&&(d=10*(1073741822-eo(u,a))-5e3),d+p))&&Ra<u&&(Ra=u),s.effectTag|=2048,s.expirationTime=a;break t}s=s.return}while(null!==s);s=Error((ue(l.type)||"A React component")+" suspended while rendering, but no fallback UI was specified.\n\nAdd a <Suspense fallback=...> component higher in the tree to provide a loading indicator or placeholder to display."+ce(l))}Aa=!0,s=ia(s,l),u=c;do{switch(u.tag){case 3:u.effectTag|=2048,u.expirationTime=a,Zi(u,a=xa(u,s,a));break t;case 1:if(p=s,d=u.type,l=u.stateNode,0==(64&u.effectTag)&&("function"==typeof d.getDerivedStateFromError||null!==l&&"function"==typeof l.componentDidCatch&&(null===Ua||!Ua.has(l)))){u.effectTag|=2048,u.expirationTime=a,Zi(u,a=Ea(u,p,a));break t}}u=u.return}while(null!==u)}Pa=Va(i);continue}o=!0,Au(t)}}break}if(Ta=!1,_a.current=n,Ui=Fi=Ii=null,Jo(),o)Ca=null,e.finishedWork=null;else if(null!==Pa)e.finishedWork=null;else{if(null===(n=e.current.alternate)&&b("281"),Ca=null,Aa){if(o=e.latestPendingTime,i=e.latestSuspendedTime,a=e.latestPingedTime,0!==o&&o<r||0!==i&&i<r||0!==a&&a<r)return to(e,r),void xu(e,n,r,e.expirationTime,-1);if(!e.didError&&t)return e.didError=!0,r=e.nextExpirationTimeToWorkOn=r,t=e.expirationTime=1073741823,void xu(e,n,r,t,-1)}t&&-1!==Ra?(to(e,r),(t=10*(1073741822-eo(e,r)))<Ra&&(Ra=t),t=10*(1073741822-Eu()),t=Ra-t,xu(e,n,r,e.expirationTime,t<0?0:t)):(e.pendingCommitExpirationTime=r,e.finishedWork=n)}}function Ya(t,e){for(var n=t.return;null!==n;){switch(n.tag){case 1:var r=n.stateNode;if("function"==typeof n.type.getDerivedStateFromError||"function"==typeof r.componentDidCatch&&(null===Ua||!Ua.has(r)))return Ji(n,t=Ea(n,t=ia(e,t),1073741823)),void Ja(n,1073741823);break;case 3:return Ji(n,t=xa(n,t=ia(e,t),1073741823)),void Ja(n,1073741823)}n=n.return}3===t.tag&&(Ji(t,n=xa(t,n=ia(e,t),1073741823)),Ja(t,1073741823))}function Ka(t,e){var n=u.unstable_getCurrentPriorityLevel(),r=void 0;if(0==(1&e.mode))r=1073741823;else if(Ta&&!Ma)r=ja;else{switch(n){case u.unstable_ImmediatePriority:r=1073741823;break;case u.unstable_UserBlockingPriority:r=1073741822-10*(1+((1073741822-t+15)/10|0));break;case u.unstable_NormalPriority:r=1073741822-25*(1+((1073741822-t+500)/25|0));break;case u.unstable_LowPriority:case u.unstable_IdlePriority:r=1;break;default:b("313")}null!==Ca&&r===ja&&--r}return n===u.unstable_UserBlockingPriority&&(0===uu||r<uu)&&(uu=r),r}function Qa(t,e,n){var r=t.pingCache;null!==r&&r.delete(e),null!==Ca&&ja===n?Ca=null:(e=t.earliestSuspendedTime,r=t.latestSuspendedTime,0!==e&&n<=e&&r<=n&&(t.didError=!1,(0===(e=t.latestPingedTime)||n<e)&&(t.latestPingedTime=n),no(n,t),0!==(n=t.expirationTime)&&Su(t,n)))}function Xa(t,e){t.expirationTime<e&&(t.expirationTime=e);var n=t.alternate;null!==n&&n.expirationTime<e&&(n.expirationTime=e);var r=t.return,o=null;if(null===r&&3===t.tag)o=t.stateNode;else for(;null!==r;){if(n=r.alternate,r.childExpirationTime<e&&(r.childExpirationTime=e),null!==n&&n.childExpirationTime<e&&(n.childExpirationTime=e),null===r.return&&3===r.tag){o=r.stateNode;break}r=r.return}return o}function Ja(t,e){null!==(t=Xa(t,e))&&(!Ta&&0!==ja&&ja<e&&Da(),Zr(t,e),Ta&&!Ma&&Ca===t||Su(t,t.expirationTime),yu<mu&&(mu=0,b("185")))}function Za(t,e,n,r,o){return u.unstable_runWithPriority(u.unstable_ImmediatePriority,function(){return t(e,n,r,o)})}var tu=null,eu=null,nu=0,ru=void 0,ou=!1,iu=null,au=0,uu=0,cu=!1,lu=null,su=!1,fu=!1,pu=null,du=u.unstable_now(),hu=1073741822-(du/10|0),vu=hu,yu=50,mu=0,gu=null;function bu(){hu=1073741822-((u.unstable_now()-du)/10|0)}function wu(t,e){if(0!==nu){if(e<nu)return;null!==ru&&u.unstable_cancelCallback(ru)}nu=e,t=u.unstable_now()-du,ru=u.unstable_scheduleCallback(Tu,{timeout:10*(1073741822-e)-t})}function xu(t,e,n,r,o){t.expirationTime=r,0!==o||Ou()?0<o&&(t.timeoutHandle=br(function(t,e,n){t.pendingCommitExpirationTime=n,t.finishedWork=e,bu(),vu=hu,Cu(t,n)}.bind(null,t,e,n),o)):(t.pendingCommitExpirationTime=n,t.finishedWork=e)}function Eu(){return ou||(_u(),0!==au&&1!==au||(bu(),vu=hu)),vu}function Su(t,e){null===t.nextScheduledRoot?(t.expirationTime=e,null===eu?(tu=eu=t,t.nextScheduledRoot=t):(eu=eu.nextScheduledRoot=t).nextScheduledRoot=tu):e>t.expirationTime&&(t.expirationTime=e),ou||(su?fu&&ju(iu=t,au=1073741823,!1):1073741823===e?Pu(1073741823,!1):wu(t,e))}function _u(){var t=0,e=null;if(null!==eu)for(var n=eu,r=tu;null!==r;){var o=r.expirationTime;if(0===o){if(null!==n&&null!==eu||b("244"),r===r.nextScheduledRoot){tu=eu=r.nextScheduledRoot=null;break}if(r===tu)tu=o=r.nextScheduledRoot,eu.nextScheduledRoot=o,r.nextScheduledRoot=null;else{if(r===eu){(eu=n).nextScheduledRoot=tu,r.nextScheduledRoot=null;break}n.nextScheduledRoot=r.nextScheduledRoot,r.nextScheduledRoot=null}r=n.nextScheduledRoot}else{if(t<o&&(t=o,e=r),r===eu)break;if(1073741823===t)break;r=(n=r).nextScheduledRoot}}iu=e,au=t}var ku=!1;function Ou(){return!!ku||!!u.unstable_shouldYield()&&(ku=!0)}function Tu(){try{if(!Ou()&&null!==tu){bu();var t=tu;do{var e=t.expirationTime;0!==e&&hu<=e&&(t.nextExpirationTimeToWorkOn=hu),t=t.nextScheduledRoot}while(t!==tu)}Pu(0,!0)}finally{ku=!1}}function Pu(t,e){if(_u(),e)for(bu(),vu=hu;null!==iu&&0!==au&&t<=au&&!(ku&&au<hu);)ju(iu,au,au<hu),_u(),bu(),vu=hu;else for(;null!==iu&&0!==au&&t<=au;)ju(iu,au,!1),_u();if(e&&(nu=0,ru=null),0!==au&&wu(iu,au),mu=0,(gu=null)!==pu)for(t=pu,pu=null,e=0;e<t.length;e++){var n=t[e];try{n._onComplete()}catch(t){cu||(cu=!0,lu=t)}}if(cu)throw t=lu,lu=null,cu=!1,t}function Cu(t,e){ou&&b("253"),ju(iu=t,au=e,!1),Pu(1073741823,!1)}function ju(t,e,n){if(ou&&b("245"),ou=!0,n){var r=t.finishedWork;null!==r?Ru(t,r,e):(t.finishedWork=null,-1!==(r=t.timeoutHandle)&&(t.timeoutHandle=-1,wr(r)),Ga(t,n),null!==(r=t.finishedWork)&&(Ou()?t.finishedWork=r:Ru(t,r,e)))}else null!==(r=t.finishedWork)?Ru(t,r,e):(t.finishedWork=null,-1!==(r=t.timeoutHandle)&&(t.timeoutHandle=-1,wr(r)),Ga(t,n),null!==(r=t.finishedWork)&&Ru(t,r,e));ou=!1}function Ru(t,e,n){var r=t.firstBatch;if(null!==r&&r._expirationTime>=n&&(null===pu?pu=[r]:pu.push(r),r._defer))return t.finishedWork=e,void(t.expirationTime=0);t.finishedWork=null,t===gu?mu++:(gu=t,mu=0),u.unstable_runWithPriority(u.unstable_ImmediatePriority,function(){Ba(t,e)})}function Au(t){null===iu&&b("246"),iu.expirationTime=0,cu||(cu=!0,lu=t)}function Nu(t,e){var n=su;su=!0;try{return t(e)}finally{(su=n)||ou||Pu(1073741823,!1)}}function Mu(t,e){if(su&&!fu){fu=!0;try{return t(e)}finally{fu=!1}}return t(e)}function Lu(t,e,n){su||ou||0===uu||(Pu(uu,!1),uu=0);var r=su;su=!0;try{return u.unstable_runWithPriority(u.unstable_UserBlockingPriority,function(){return t(e,n)})}finally{(su=r)||ou||Pu(1073741823,!1)}}function Iu(t,e,n,r,o){var i=e.current;t:if(n){e:{2===en(n=n._reactInternalFiber)&&1===n.tag||b("170");var a=n;do{switch(a.tag){case 3:a=a.stateNode.context;break e;case 1:if(Mr(a.type)){a=a.stateNode.__reactInternalMemoizedMergedChildContext;break e}}a=a.return}while(null!==a);b("171"),a=void 0}if(1===n.tag){var u=n.type;if(Mr(u)){n=Ur(n,u,a);break t}}n=a}else n=Cr;return null===e.context?e.context=n:e.pendingContext=n,e=o,(o=Qi(r)).payload={element:t},null!==(e=void 0===e?null:e)&&(o.callback=e),qa(),Ji(i,o),Ja(i,r),r}function Fu(t,e,n,r){var o=e.current;return Iu(t,e,n,o=Ka(Eu(),o),r)}function Uu(t){if(!(t=t.current).child)return null;switch(t.child.tag){case 5:default:return t.child.stateNode}}function Du(t){var e=1073741822-25*(1+((1073741822-Eu()+500)/25|0));Oa<=e&&(e=Oa-1),this._expirationTime=Oa=e,this._root=t,this._callbacks=this._next=null,this._hasChildren=this._didComplete=!1,this._children=null,this._defer=!0}function Wu(){this._callbacks=null,this._didCommit=!1,this._onCommit=this._onCommit.bind(this)}function zu(t,e,n){t={current:e=Vr(3,null,null,e?3:0),containerInfo:t,pendingChildren:null,pingCache:null,earliestPendingTime:0,latestPendingTime:0,earliestSuspendedTime:0,latestSuspendedTime:0,latestPingedTime:0,didError:!1,pendingCommitExpirationTime:0,finishedWork:null,timeoutHandle:-1,context:null,pendingContext:null,hydrate:n,nextExpirationTimeToWorkOn:0,expirationTime:0,firstBatch:null,nextScheduledRoot:null},this._internalRoot=e.stateNode=t}function Hu(t){return!(!t||1!==t.nodeType&&9!==t.nodeType&&11!==t.nodeType&&(8!==t.nodeType||" react-mount-point-unstable "!==t.nodeValue))}function qu(t,e,n,r,o){var i=n._reactRootContainer;if(i){if("function"==typeof o){var a=o;o=function(){var t=Uu(i._internalRoot);a.call(t)}}null!=t?i.legacy_renderSubtreeIntoContainer(t,e,o):i.render(e,o)}else{if(i=n._reactRootContainer=function(t,e){if(e||(e=!(!(e=t?9===t.nodeType?t.documentElement:t.firstChild:null)||1!==e.nodeType||!e.hasAttribute("data-reactroot"))),!e)for(var n;n=t.lastChild;)t.removeChild(n);return new zu(t,!1,e)}(n,r),"function"==typeof o){var u=o;o=function(){var t=Uu(i._internalRoot);u.call(t)}}Mu(function(){null!=t?i.legacy_renderSubtreeIntoContainer(t,e,o):i.render(e,o)})}return Uu(i._internalRoot)}function Bu(t,e){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:null;return Hu(e)||b("200"),function(t,e,n,r){var o=3<arguments.length&&void 0!==r?r:null;return{$$typeof:Yt,key:null==o?null:""+o,children:t,containerInfo:e,implementation:n}}(t,e,null,n)}Ot=function(t,e,n){switch(e){case"input":if(Ee(t,n),e=n.name,"radio"===n.type&&null!=e){for(n=t;n.parentNode;)n=n.parentNode;for(n=n.querySelectorAll("input[name="+JSON.stringify(""+e)+'][type="radio"]'),e=0;e<n.length;e++){var r=n[e];if(r!==t&&r.form===t.form){var o=U(r);o||b("90"),qt(r),Ee(r,o)}}}break;case"textarea":Xn(t,n);break;case"select":null!=(e=n.value)&&Yn(t,!!n.multiple,e,!1)}},Du.prototype.render=function(t){this._defer||b("250"),this._hasChildren=!0,this._children=t;var e=this._root._internalRoot,n=this._expirationTime,r=new Wu;return Iu(t,e,null,n,r._onCommit),r},Du.prototype.then=function(t){if(this._didComplete)t();else{var e=this._callbacks;null===e&&(e=this._callbacks=[]),e.push(t)}},Du.prototype.commit=function(){var t=this._root._internalRoot,e=t.firstBatch;if(this._defer&&null!==e||b("251"),this._hasChildren){var n=this._expirationTime;if(e!==this){this._hasChildren&&(n=this._expirationTime=e._expirationTime,this.render(this._children));for(var r=null,o=e;o!==this;)o=(r=o)._next;null===r&&b("251"),r._next=o._next,this._next=e,t.firstBatch=this}this._defer=!1,Cu(t,n),e=this._next,(this._next=null)!==(e=t.firstBatch=e)&&e._hasChildren&&e.render(e._children)}else this._next=null,this._defer=!1},Du.prototype._onComplete=function(){if(!this._didComplete){this._didComplete=!0;var t=this._callbacks;if(null!==t)for(var e=0;e<t.length;e++)(0,t[e])()}},Wu.prototype.then=function(t){if(this._didCommit)t();else{var e=this._callbacks;null===e&&(e=this._callbacks=[]),e.push(t)}},Wu.prototype._onCommit=function(){if(!this._didCommit){this._didCommit=!0;var t=this._callbacks;if(null!==t)for(var e=0;e<t.length;e++){var n=t[e];"function"!=typeof n&&b("191",n),n()}}},zu.prototype.render=function(t,e){var n=this._internalRoot,r=new Wu;return null!==(e=void 0===e?null:e)&&r.then(e),Fu(t,n,null,r._onCommit),r},zu.prototype.unmount=function(t){var e=this._internalRoot,n=new Wu;return null!==(t=void 0===t?null:t)&&n.then(t),Fu(null,e,null,n._onCommit),n},zu.prototype.legacy_renderSubtreeIntoContainer=function(t,e,n){var r=this._internalRoot,o=new Wu;return null!==(n=void 0===n?null:n)&&o.then(n),Fu(e,r,t,o._onCommit),o},zu.prototype.createBatch=function(){var t=new Du(this),e=t._expirationTime,n=this._internalRoot,r=n.firstBatch;if(null===r)(n.firstBatch=t)._next=null;else{for(n=null;null!==r&&r._expirationTime>=e;)r=(n=r)._next;t._next=r,null!==n&&(n._next=t)}return t},Mt=function(){ou||0===uu||(Pu(uu,!1),uu=0)};var Vu,$u,Gu={createPortal:Bu,findDOMNode:function(t){if(null==t)return null;if(1===t.nodeType)return t;var e=t._reactInternalFiber;return void 0===e&&("function"==typeof t.render?b("188"):b("268",Object.keys(t))),t=null===(t=rn(e))?null:t.stateNode},hydrate:function(t,e,n){return Hu(e)||b("200"),qu(null,t,e,!0,n)},render:function(t,e,n){return Hu(e)||b("200"),qu(null,t,e,!1,n)},unstable_renderSubtreeIntoContainer:function(t,e,n,r){return Hu(n)||b("200"),null!=t&&void 0!==t._reactInternalFiber||b("38"),qu(t,e,n,!1,r)},unmountComponentAtNode:function(t){return Hu(t)||b("40"),!!t._reactRootContainer&&(Mu(function(){qu(null,null,t,!1,function(){t._reactRootContainer=null})}),!0)},unstable_createPortal:function(){return Bu.apply(void 0,arguments)},unstable_batchedUpdates:At=Nu,unstable_interactiveUpdates:Nt=Lu,flushSync:function(t,e){ou&&b("187");var n=su;su=!0;try{return Za(t,e)}finally{su=n,Pu(1073741823,!1)}},unstable_createRoot:function(t,e){return Hu(t)||b("299","unstable_createRoot"),new zu(t,!0,null!=e&&!0===e.hydrate)},unstable_flushControlled:function(t){var e=su;su=!0;try{Za(t)}finally{(su=e)||ou||Pu(1073741823,!1)}},__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED:{Events:[I,F,U,C.injectEventPluginsByName,x,B,function(t){O(t,q)},jt,Rt,Pn,R]}};$u=(Vu={findFiberByHostInstance:L,bundleType:0,version:"16.8.6",rendererPackageName:"react-dom"}).findFiberByHostInstance,function(t){if("undefined"==typeof __REACT_DEVTOOLS_GLOBAL_HOOK__)return;var e=__REACT_DEVTOOLS_GLOBAL_HOOK__;if(e.isDisabled||!e.supportsFiber)return;try{var n=e.inject(t);zr=qr(function(t){return e.onCommitFiberRoot(n,t)}),Hr=qr(function(t){return e.onCommitFiberUnmount(n,t)})}catch(t){}}(g({},Vu,{overrideProps:null,currentDispatcherRef:Bt.ReactCurrentDispatcher,findHostInstanceByFiber:function(t){return null===(t=rn(t))?null:t.stateNode},findFiberByHostInstance:function(t){return $u?$u(t):null}}));var Yu=Gu;t.exports=Yu.default||Yu},function(t,e,n){"use strict";
/** @license React v16.8.6
* react.production.min.js
*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/var s=n(191),r="function"==typeof Symbol&&Symbol.for,f=r?Symbol.for("react.element"):60103,l=r?Symbol.for("react.portal"):60106,o=r?Symbol.for("react.fragment"):60107,i=r?Symbol.for("react.strict_mode"):60108,a=r?Symbol.for("react.profiler"):60114,u=r?Symbol.for("react.provider"):60109,c=r?Symbol.for("react.context"):60110,p=r?Symbol.for("react.concurrent_mode"):60111,d=r?Symbol.for("react.forward_ref"):60112,h=r?Symbol.for("react.suspense"):60113,v=r?Symbol.for("react.memo"):60115,y=r?Symbol.for("react.lazy"):60116,m="function"==typeof Symbol&&Symbol.iterator;function g(t){for(var e=arguments.length-1,n="https://reactjs.org/docs/error-decoder.html?invariant="+t,r=0;r<e;r++)n+="&args[]="+encodeURIComponent(arguments[r+1]);!function(t,e,n,r,o,i,a,u){if(!t){if((t=void 0)===e)t=Error("Minified exception occurred; use the non-minified dev environment for the full error message and additional helpful warnings.");else{var c=[n,r,o,i,a,u],l=0;(t=Error(e.replace(/%s/g,function(){return c[l++]}))).name="Invariant Violation"}throw t.framesToPop=1,t}}(!1,"Minified React error #"+t+"; visit %s for the full message or use the non-minified dev environment for full errors and additional helpful warnings. ",n)}var b={isMounted:function(){return!1},enqueueForceUpdate:function(){},enqueueReplaceState:function(){},enqueueSetState:function(){}},w={};function x(t,e,n){this.props=t,this.context=e,this.refs=w,this.updater=n||b}function E(){}function S(t,e,n){this.props=t,this.context=e,this.refs=w,this.updater=n||b}x.prototype.isReactComponent={},x.prototype.setState=function(t,e){"object"!=typeof t&&"function"!=typeof t&&null!=t&&g("85"),this.updater.enqueueSetState(this,t,e,"setState")},x.prototype.forceUpdate=function(t){this.updater.enqueueForceUpdate(this,t,"forceUpdate")},E.prototype=x.prototype;var _=S.prototype=new E;_.constructor=S,s(_,x.prototype),_.isPureReactComponent=!0;var k={current:null},O={current:null},T=Object.prototype.hasOwnProperty,P={key:!0,ref:!0,__self:!0,__source:!0};function C(t,e,n){var r=void 0,o={},i=null,a=null;if(null!=e)for(r in void 0!==e.ref&&(a=e.ref),void 0!==e.key&&(i=""+e.key),e)T.call(e,r)&&!P.hasOwnProperty(r)&&(o[r]=e[r]);var u=arguments.length-2;if(1===u)o.children=n;else if(1<u){for(var c=Array(u),l=0;l<u;l++)c[l]=arguments[l+2];o.children=c}if(t&&t.defaultProps)for(r in u=t.defaultProps)void 0===o[r]&&(o[r]=u[r]);return{$$typeof:f,type:t,key:i,ref:a,props:o,_owner:O.current}}function j(t){return"object"==typeof t&&null!==t&&t.$$typeof===f}var R=/\/+/g,A=[];function N(t,e,n,r){if(A.length){var o=A.pop();return o.result=t,o.keyPrefix=e,o.func=n,o.context=r,o.count=0,o}return{result:t,keyPrefix:e,func:n,context:r,count:0}}function M(t){t.result=null,t.keyPrefix=null,t.func=null,t.context=null,t.count=0,A.length<10&&A.push(t)}function L(t,e,n){return null==t?0:function t(e,n,r,o){var i=typeof e;"undefined"!==i&&"boolean"!==i||(e=null);var a=!1;if(null===e)a=!0;else switch(i){case"string":case"number":a=!0;break;case"object":switch(e.$$typeof){case f:case l:a=!0}}if(a)return r(o,e,""===n?"."+I(e,0):n),1;if(a=0,n=""===n?".":n+":",Array.isArray(e))for(var u=0;u<e.length;u++){var c=n+I(i=e[u],u);a+=t(i,c,r,o)}else if("function"==typeof(c=null===e||"object"!=typeof e?null:"function"==typeof(c=m&&e[m]||e["@@iterator"])?c:null))for(e=c.call(e),u=0;!(i=e.next()).done;)a+=t(i=i.value,c=n+I(i,u++),r,o);else"object"===i&&g("31","[object Object]"==(r=""+e)?"object with keys {"+Object.keys(e).join(", ")+"}":r,"");return a}(t,"",e,n)}function I(t,e){return"object"==typeof t&&null!==t&&null!=t.key?function(t){var e={"=":"=0",":":"=2"};return"$"+(""+t).replace(/[=:]/g,function(t){return e[t]})}(t.key):e.toString(36)}function F(t,e){t.func.call(t.context,e,t.count++)}function U(t,e,n){var r=t.result,o=t.keyPrefix;t=t.func.call(t.context,e,t.count++),Array.isArray(t)?D(t,r,n,function(t){return t}):null!=t&&(j(t)&&(t=function(t,e){return{$$typeof:f,type:t.type,key:e,ref:t.ref,props:t.props,_owner:t._owner}}(t,o+(!t.key||e&&e.key===t.key?"":(""+t.key).replace(R,"$&/")+"/")+n)),r.push(t))}function D(t,e,n,r,o){var i="";null!=n&&(i=(""+n).replace(R,"$&/")+"/"),L(t,U,e=N(e,i,r,o)),M(e)}function W(){var t=k.current;return null===t&&g("321"),t}var z={Children:{map:function(t,e,n){if(null==t)return t;var r=[];return D(t,r,null,e,n),r},forEach:function(t,e,n){if(null==t)return t;L(t,F,e=N(null,null,e,n)),M(e)},count:function(t){return L(t,function(){return null},null)},toArray:function(t){var e=[];return D(t,e,null,function(t){return t}),e},only:function(t){return j(t)||g("143"),t}},createRef:function(){return{current:null}},Component:x,PureComponent:S,createContext:function(t,e){return void 0===e&&(e=null),(t={$$typeof:c,_calculateChangedBits:e,_currentValue:t,_currentValue2:t,_threadCount:0,Provider:null,Consumer:null}).Provider={$$typeof:u,_context:t},t.Consumer=t},forwardRef:function(t){return{$$typeof:d,render:t}},lazy:function(t){return{$$typeof:y,_ctor:t,_status:-1,_result:null}},memo:function(t,e){return{$$typeof:v,type:t,compare:void 0===e?null:e}},useCallback:function(t,e){return W().useCallback(t,e)},useContext:function(t,e){return W().useContext(t,e)},useEffect:function(t,e){return W().useEffect(t,e)},useImperativeHandle:function(t,e,n){return W().useImperativeHandle(t,e,n)},useDebugValue:function(){},useLayoutEffect:function(t,e){return W().useLayoutEffect(t,e)},useMemo:function(t,e){return W().useMemo(t,e)},useReducer:function(t,e,n){return W().useReducer(t,e,n)},useRef:function(t){return W().useRef(t)},useState:function(t){return W().useState(t)},Fragment:o,StrictMode:i,Suspense:h,createElement:C,cloneElement:function(t,e,n){null==t&&g("267",t);var r=void 0,o=s({},t.props),i=t.key,a=t.ref,u=t._owner;if(null!=e){void 0!==e.ref&&(a=e.ref,u=O.current),void 0!==e.key&&(i=""+e.key);var c=void 0;for(r in t.type&&t.type.defaultProps&&(c=t.type.defaultProps),e)T.call(e,r)&&!P.hasOwnProperty(r)&&(o[r]=void 0===e[r]&&void 0!==c?c[r]:e[r])}if(1===(r=arguments.length-2))o.children=n;else if(1<r){c=Array(r);for(var l=0;l<r;l++)c[l]=arguments[l+2];o.children=c}return{$$typeof:f,type:t.type,key:i,ref:a,props:o,_owner:u}},createFactory:function(t){var e=C.bind(null,t);return e.type=t,e},isValidElement:j,version:"16.8.6",unstable_ConcurrentMode:p,unstable_Profiler:a,__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED:{ReactCurrentDispatcher:k,ReactCurrentOwner:O,assign:s}},H=z;t.exports=H.default||H},function(t,e,n){"use strict";t.exports=n(413)},function(t,D,e){"use strict";(function(t){
/** @license React v0.13.6
* scheduler.production.min.js
*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
Object.defineProperty(D,"__esModule",{value:!0});var a=null,r=!1,u=3,o=-1,c=-1,i=!1,l=!1;function s(){if(!i){var t=a.expirationTime;l?E():l=!0,x(e,t)}}function f(){var t=a,e=a.next;if(a===e)a=null;else{var n=a.previous;a=n.next=e,e.previous=n}t.next=t.previous=null,n=t.callback,e=t.expirationTime,t=t.priorityLevel;var r=u,o=c;u=t,c=e;try{var i=n()}finally{u=r,c=o}if("function"==typeof i)if(i={callback:i,priorityLevel:t,expirationTime:e,next:null,previous:null},null===a)a=i.next=i.previous=i;else{n=null,t=a;do{if(t.expirationTime>=e){n=t;break}t=t.next}while(t!==a);null===n?n=a:n===a&&(a=i,s()),(e=n.previous).next=n.previous=i,i.next=n,i.previous=e}}function p(){if(-1===o&&null!==a&&1===a.priorityLevel){i=!0;try{for(;f(),null!==a&&1===a.priorityLevel;);}finally{i=!1,null!==a?s():l=!1}}}function e(t){i=!0;var e=r;r=t;try{if(t)for(;null!==a;){var n=D.unstable_now();if(!(a.expirationTime<=n))break;for(;f(),null!==a&&a.expirationTime<=n;);}else if(null!==a)for(;f(),null!==a&&!S(););}finally{i=!1,r=e,null!==a?s():l=!1,p()}}var n,d,h=Date,v="function"==typeof setTimeout?setTimeout:void 0,y="function"==typeof clearTimeout?clearTimeout:void 0,m="function"==typeof requestAnimationFrame?requestAnimationFrame:void 0,g="function"==typeof cancelAnimationFrame?cancelAnimationFrame:void 0;function b(e){n=m(function(t){y(d),e(t)}),d=v(function(){g(n),e(D.unstable_now())},100)}if("object"==typeof performance&&"function"==typeof performance.now){var w=performance;D.unstable_now=function(){return w.now()}}else D.unstable_now=function(){return h.now()};var x,E,S,_=null;if("undefined"!=typeof window?_=window:void 0!==t&&(_=t),_&&_._schedMock){var k=_._schedMock;x=k[0],E=k[1],S=k[2],D.unstable_now=k[3]}else if("undefined"==typeof window||"function"!=typeof MessageChannel){var O=null,T=function(t){if(null!==O)try{O(t)}finally{O=null}};x=function(t){null!==O?setTimeout(x,0,t):(O=t,setTimeout(T,0,!1))},E=function(){O=null},S=function(){return!1}}else{"undefined"!=typeof console&&("function"!=typeof m&&console.error("This browser doesn't support requestAnimationFrame. Make sure that you load a polyfill in older browsers. https://fb.me/react-polyfills"),"function"!=typeof g&&console.error("This browser doesn't support cancelAnimationFrame. Make sure that you load a polyfill in older browsers. https://fb.me/react-polyfills"));var P=null,C=!1,j=-1,R=!1,A=!1,N=0,M=33,L=33;S=function(){return N<=D.unstable_now()};var I=new MessageChannel,F=I.port2;I.port1.onmessage=function(){C=!1;var t=P,e=j;P=null,j=-1;var n=D.unstable_now(),r=!1;if(N-n<=0){if(!(-1!==e&&e<=n))return R||(R=!0,b(U)),P=t,void(j=e);r=!0}if(null!==t){A=!0;try{t(r)}finally{A=!1}}};var U=function(t){if(null!==P){b(U);var e=t-N+L;e<L&&M<L?(e<8&&(e=8),L=e<M?M:e):M=e,N=t+L,C||(C=!0,F.postMessage(void 0))}else R=!1};x=function(t,e){P=t,j=e,A||e<0?F.postMessage(void 0):R||(R=!0,b(U))},E=function(){P=null,C=!1,j=-1}}D.unstable_ImmediatePriority=1,D.unstable_UserBlockingPriority=2,D.unstable_NormalPriority=3,D.unstable_IdlePriority=5,D.unstable_LowPriority=4,D.unstable_runWithPriority=function(t,e){switch(t){case 1:case 2:case 3:case 4:case 5:break;default:t=3}var n=u,r=o;u=t,o=D.unstable_now();try{return e()}finally{u=n,o=r,p()}},D.unstable_next=function(t){switch(u){case 1:case 2:case 3:var e=3;break;default:e=u}var n=u,r=o;u=e,o=D.unstable_now();try{return t()}finally{u=n,o=r,p()}},D.unstable_scheduleCallback=function(t,e){var n=-1!==o?o:D.unstable_now();if("object"==typeof e&&null!==e&&"number"==typeof e.timeout)e=n+e.timeout;else switch(u){case 1:e=n+-1;break;case 2:e=n+250;break;case 5:e=n+1073741823;break;case 4:e=n+1e4;break;default:e=n+5e3}if(t={callback:t,priorityLevel:u,expirationTime:e,next:null,previous:null},null===a)a=t.next=t.previous=t,s();else{n=null;var r=a;do{if(r.expirationTime>e){n=r;break}r=r.next}while(r!==a);null===n?n=a:n===a&&(a=t,s()),(e=n.previous).next=n.previous=t,t.next=n,t.previous=e}return t},D.unstable_cancelCallback=function(t){var e=t.next;if(null!==e){if(e===t)a=null;else{t===a&&(a=e);var n=t.previous;(n.next=e).previous=n}t.next=t.previous=null}},D.unstable_wrapCallback=function(n){var r=u;return function(){var t=u,e=o;u=r,o=D.unstable_now();try{return n.apply(this,arguments)}finally{u=t,o=e,p()}}},D.unstable_getCurrentPriorityLevel=function(){return u},D.unstable_shouldYield=function(){return!r&&(null!==a&&a.expirationTime<c||S())},D.unstable_continueExecution=function(){null!==a&&s()},D.unstable_pauseExecution=function(){},D.unstable_getFirstCallbackNode=function(){return a}}).call(this,e(81))},function(t,e,n){"use strict";var u=n(415);function r(){}function o(){}o.resetWarningCache=r,t.exports=function(){function t(t,e,n,r,o,i){if(i!==u){var a=new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");throw a.name="Invariant Violation",a}}function e(){return t}var n={array:t.isRequired=t,bool:t,func:t,number:t,object:t,string:t,symbol:t,any:t,arrayOf:e,element:t,elementType:t,instanceOf:e,node:t,objectOf:e,oneOf:e,oneOfType:e,shape:e,exact:e,checkPropTypes:o,resetWarningCache:r};return n.PropTypes=n}},function(t,e,n){"use strict";t.exports="SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED"},function(t,e){t.exports=Array.isArray||function(t){return"[object Array]"==Object.prototype.toString.call(t)}},function(t,e){t.exports=Array.isArray||function(t){return"[object Array]"==Object.prototype.toString.call(t)}},function(t,e,n){},function(e,t){function n(t){return(n="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}function r(t){return"function"==typeof Symbol&&"symbol"===n(Symbol.iterator)?e.exports=r=function(t){return n(t)}:e.exports=r=function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":n(t)},r(t)}e.exports=r},function(t,e){t.exports=function(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}},function(n,t){function r(t,e){return n.exports=r=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},r(t,e)}n.exports=r},function(t,e,o){"use strict";var n=o(423),r=o(427);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},e=t.history||(0,s.default)(),n={initialReducer:{routing:f.routerReducer},setupMiddlewares:function(t){return[(0,f.routerMiddleware)(e)].concat((0,u.default)(t))},setupApp:function(t){t._history=function(e){var n=e.listen;return e.listen=function(t){return t(e.location),n.call(e,t)},e}(e)}},r=h.create(t,n),o=r.start;return r.router=function(t){(0,l.default)((0,v.isFunction)(t),"[app.router] router should be function, but got ".concat((0,a.default)(t))),r._router=t},r.start=function(t){!function(t){return"string"==typeof t}(t)||(t=p.default.querySelector(t),(0,l.default)(t,"[app.start] container ".concat(t," not found")));(0,l.default)(!t||function(t){return"object"===(0,a.default)(t)&&null!==t&&t.nodeType&&t.nodeName}(t),"[app.start] container should be HTMLElement"),(0,l.default)(r._router,"[app.start] router must be registered before app.start()"),r._store||o.call(r);var e=r._store;{if(r._getProvider=y.bind(null,e,r),!t)return y(e,this,this._router);m(t,e,r,r._router),r._plugin.apply("onHmr")(m.bind(null,t,e,r))}},r};var i=r(o(428)),a=r(o(440)),u=r(o(451)),c=r(o(2)),l=r(o(7)),s=r(o(460)),f=o(228),p=r(o(464)),d=o(227),h=n(o(467)),v=o(56);function y(e,n,r){return function(t){return c.default.createElement(d.Provider,{store:e},r((0,i.default)({app:n,history:n._history},t)))}}function m(t,e,n,r){o(103).render(c.default.createElement(y(e,n,r)),t)}},function(t,e,n){var o=n(192),i=n(196);t.exports=function(t){if(t&&t.__esModule)return t;var e={};if(null!=t)for(var n in t)if(Object.prototype.hasOwnProperty.call(t,n)){var r=i&&o?o(t,n):{};r.get||r.set?i(e,n,r):e[n]=t[n]}return e.default=t,e}},function(t,e,n){var r=n(55),o=n(194).f;n(195)("getOwnPropertyDescriptor",function(){return function(t,e){return o(r(t),e)}})},function(t,e,n){var r=n(82);t.exports=Object("z").propertyIsEnumerable(0)?Object:function(t){return"String"==r(t)?t.split(""):Object(t)}},function(t,e,n){var r=n(35);r(r.S+r.F*!n(41),"Object",{defineProperty:n(36).f})},function(t,e){t.exports=function(t){return t&&t.__esModule?t:{default:t}}},function(t,e,n){var o=n(192),i=n(429),a=n(437),u=n(439);t.exports=function(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{},r=a(n);"function"==typeof i&&(r=r.concat(i(n).filter(function(t){return o(n,t).enumerable}))),r.forEach(function(t){u(e,t,n[t])})}return e}},function(t,e,n){t.exports=n(198)},function(t,e,n){function r(t){u(t,o,{value:{i:"O"+ ++c,w:{}}})}var o=n(104)("meta"),i=n(53),a=n(54),u=n(36).f,c=0,l=Object.isExtensible||function(){return!0},s=!n(79)(function(){return l(Object.preventExtensions({}))}),f=t.exports={KEY:o,NEED:!1,fastKey:function(t,e){if(!i(t))return"symbol"==typeof t?t:("string"==typeof t?"S":"P")+t;if(!a(t,o)){if(!l(t))return"F";if(!e)return"E";r(t)}return t[o].i},getWeak:function(t,e){if(!a(t,o)){if(!l(t))return!0;if(!e)return!1;r(t)}return t[o].w},onFreeze:function(t){return s&&f.NEED&&l(t)&&!a(t,o)&&r(t),t}}},function(t,e,n){var u=n(106),c=n(202),l=n(141);t.exports=function(t){var e=u(t),n=c.f;if(n)for(var r,o=n(t),i=l.f,a=0;o.length>a;)i.call(t,r=o[a++])&&e.push(r);return e}},function(t,e,n){var c=n(55),l=n(145),s=n(433);t.exports=function(u){return function(t,e,n){var r,o=c(t),i=l(o.length),a=s(n,i);if(u&&e!=e){for(;a<i;)if((r=o[a++])!=r)return!0}else for(;a<i;a++)if((u||a in o)&&o[a]===e)return u||a||0;return!u&&-1}}},function(t,e,n){var r=n(146),o=Math.max,i=Math.min;t.exports=function(t,e){return(t=r(t))<0?o(t+e,0):i(t,e)}},function(t,e,n){var r=n(82);t.exports=Array.isArray||function(t){return"Array"==r(t)}},function(t,e,n){var a=n(36),u=n(37),c=n(106);t.exports=n(41)?Object.defineProperties:function(t,e){u(t);for(var n,r=c(e),o=r.length,i=0;i<o;)a.f(t,n=r[i++],e[n]);return t}},function(t,e,n){var r=n(55),o=n(205).f,i={}.toString,a="object"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];t.exports.f=function(t){return a&&"[object Window]"==i.call(t)?function(t){try{return o(t)}catch(t){return a.slice()}}(t):o(r(t))}},function(t,e,n){t.exports=n(206)},function(t,e,n){var r=n(107),o=n(106);n(195)("keys",function(){return function(t){return o(r(t))}})},function(t,e,n){var r=n(196);t.exports=function(t,e,n){return e in t?r(t,e,{value:n,enumerable:!0,configurable:!0,writable:!0}):t[e]=n,t}},function(e,t,n){var r=n(441),o=n(448);function i(t){return(i="function"==typeof o&&"symbol"==typeof r?function(t){return typeof t}:function(t){return t&&"function"==typeof o&&t.constructor===o&&t!==o.prototype?"symbol":typeof t})(t)}function a(t){return"function"==typeof o&&"symbol"===i(r)?e.exports=a=function(t){return i(t)}:e.exports=a=function(t){return t&&"function"==typeof o&&t.constructor===o&&t!==o.prototype?"symbol":i(t)},a(t)}e.exports=a},function(t,e,n){t.exports=n(207)},function(t,e,n){var c=n(146),l=n(140);t.exports=function(u){return function(t,e){var n,r,o=String(l(t)),i=c(e),a=o.length;return i<0||a<=i?u?"":void 0:(n=o.charCodeAt(i))<55296||56319<n||i+1===a||(r=o.charCodeAt(i+1))<56320||57343<r?u?o.charAt(i):n:u?o.slice(i,i+2):r-56320+(n-55296<<10)+65536}}},function(t,e,n){"use strict";var r=n(203),o=n(80),i=n(105),a={};n(52)(a,n(17)("iterator"),function(){return this}),t.exports=function(t,e,n){t.prototype=r(a,{next:o(1,n)}),i(t,e+" Iterator")}},function(t,e,n){var r=n(54),o=n(107),i=n(147)("IE_PROTO"),a=Object.prototype;t.exports=Object.getPrototypeOf||function(t){return t=o(t),r(t,i)?t[i]:"function"==typeof t.constructor&&t instanceof t.constructor?t.constructor.prototype:t instanceof Object?a:null}},function(t,e,n){"use strict";var r=n(446),o=n(447),i=n(63),a=n(55);t.exports=n(208)(Array,"Array",function(t,e){this._t=a(t),this._i=0,this._k=e},function(){var t=this._t,e=this._k,n=this._i++;return!t||n>=t.length?(this._t=void 0,o(1)):o(0,"keys"==e?n:"values"==e?t[n]:[n,t[n]])},"values"),i.Arguments=i.Array,r("keys"),r("values"),r("entries")},function(t,e){t.exports=function(){}},function(t,e){t.exports=function(t,e){return{value:e,done:!!t}}},function(t,e,n){t.exports=n(209)},function(t,e,n){n(144)("asyncIterator")},function(t,e,n){n(144)("observable")},function(t,e,n){var r=n(452),o=n(453),i=n(459);t.exports=function(t){return r(t)||o(t)||i()}},function(t,e){t.exports=function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}},function(t,e,n){var r=n(454),o=n(457);t.exports=function(t){if(o(Object(t))||"[object Arguments]"===Object.prototype.toString.call(t))return r(t)}},function(t,e,n){t.exports=n(211)},function(t,e,n){"use strict";var h=n(78),r=n(35),v=n(107),y=n(212),m=n(213),g=n(145),b=n(456),w=n(149);r(r.S+r.F*!n(214)(function(t){Array.from(t)}),"Array",{from:function(t,e,n){var r,o,i,a,u=v(t),c="function"==typeof this?this:Array,l=arguments.length,s=1<l?e:void 0,f=void 0!==s,p=0,d=w(u);if(f&&(s=h(s,2<l?n:void 0,2)),null==d||c==Array&&m(d))for(o=new c(r=g(u.length));p<r;p++)b(o,p,f?s(u[p],p):u[p]);else for(a=d.call(u),o=new c;!(i=a.next()).done;p++)b(o,p,f?y(a,s,[i.value,p],!0):i.value);return o.length=p,o}})},function(t,e,n){"use strict";var r=n(36),o=n(80);t.exports=function(t,e,n){e in t?r.f(t,e,o(0,n)):t[e]=n}},function(t,e,n){t.exports=n(215)},function(t,e,n){var r=n(150),o=n(17)("iterator"),i=n(63);t.exports=n(14).isIterable=function(t){var e=Object(t);return void 0!==e[o]||"@@iterator"in e||i.hasOwnProperty(r(e))}},function(t,e){t.exports=function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}},function(t,e,n){"use strict";n(461)("createHashHistory"),t.exports=n(462).createHashHistory},function(t,e,n){"use strict";t.exports=function(t){}},function(t,e,n){"use strict";t.exports=n(463)},function(t,e,n){"use strict";function r(t){return t&&"object"==typeof t&&"default"in t?t.default:t}Object.defineProperty(e,"__esModule",{value:!0});var i=r(n(156)),o=r(n(157));n(216);var P=r(n(110));function C(){return(C=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t}).apply(this,arguments)}function j(t){return"/"===t.charAt(0)?t:"/"+t}function a(t){return"/"===t.charAt(0)?t.substr(1):t}function R(t,e){return function(t,e){return new RegExp("^"+e+"(\\/|\\?|#|$)","i").test(t)}(t,e)?t.substr(e.length):t}function A(t){return"/"===t.charAt(t.length-1)?t.slice(0,-1):t}function u(t){var e=t||"/",n="",r="",o=e.indexOf("#");-1!==o&&(r=e.substr(o),e=e.substr(0,o));var i=e.indexOf("?");return-1!==i&&(n=e.substr(i),e=e.substr(0,i)),{pathname:e,search:"?"===n?"":n,hash:"#"===r?"":r}}function N(t){var e=t.pathname,n=t.search,r=t.hash,o=e||"/";return n&&"?"!==n&&(o+="?"===n.charAt(0)?n:"?"+n),r&&"#"!==r&&(o+="#"===r.charAt(0)?r:"#"+r),o}function M(t,e,n,r){var o;"string"==typeof t?(o=u(t)).state=e:(void 0===(o=C({},t)).pathname&&(o.pathname=""),o.search?"?"!==o.search.charAt(0)&&(o.search="?"+o.search):o.search="",o.hash?"#"!==o.hash.charAt(0)&&(o.hash="#"+o.hash):o.hash="",void 0!==e&&void 0===o.state&&(o.state=e));try{o.pathname=decodeURI(o.pathname)}catch(t){throw t instanceof URIError?new URIError('Pathname "'+o.pathname+'" could not be decoded. This is likely caused by an invalid percent-encoding.'):t}return n&&(o.key=n),r?o.pathname?"/"!==o.pathname.charAt(0)&&(o.pathname=i(o.pathname,r.pathname)):o.pathname=r.pathname:o.pathname||(o.pathname="/"),o}function O(t,e){return t.pathname===e.pathname&&t.search===e.search&&t.hash===e.hash&&t.key===e.key&&o(t.state,e.state)}function L(){var i=null,r=[];return{setPrompt:function(t){return i=t,function(){i===t&&(i=null)}},confirmTransitionTo:function(t,e,n,r){if(null!=i){var o="function"==typeof i?i(t,e):i;"string"==typeof o?"function"==typeof n?n(o,r):r(!0):r(!1!==o)}else r(!0)},appendListener:function(t){var e=!0;function n(){e&&t.apply(void 0,arguments)}return r.push(n),function(){e=!1,r=r.filter(function(t){return t!==n})}},notifyListeners:function(){for(var t=arguments.length,e=new Array(t),n=0;n<t;n++)e[n]=arguments[n];r.forEach(function(t){return t.apply(void 0,e)})}}}var I=!("undefined"==typeof window||!window.document||!window.document.createElement);function F(t,e){e(window.confirm(t))}var U="hashchange";function D(){try{return window.history.state||{}}catch(t){return{}}}var T="hashchange",W={hashbang:{encodePath:function(t){return"!"===t.charAt(0)?t:"!/"+a(t)},decodePath:function(t){return"!"===t.charAt(0)?t.substr(1):t}},noslash:{encodePath:a,decodePath:j},slash:{encodePath:j,decodePath:j}};function z(){var t=window.location.href,e=t.indexOf("#");return-1===e?"":t.substring(e+1)}function H(t){var e=window.location.href.indexOf("#");window.location.replace(window.location.href.slice(0,0<=e?e:0)+"#"+t)}function m(t,e,n){return Math.min(Math.max(t,e),n)}e.createBrowserHistory=function(t){void 0===t&&(t={}),I||P(!1);var u=window.history,c=function(){var t=window.navigator.userAgent;return(-1===t.indexOf("Android 2.")&&-1===t.indexOf("Android 4.0")||-1===t.indexOf("Mobile Safari")||-1!==t.indexOf("Chrome")||-1!==t.indexOf("Windows Phone"))&&window.history&&"pushState"in window.history}(),e=!(-1===window.navigator.userAgent.indexOf("Trident")),n=t,r=n.forceRefresh,l=void 0!==r&&r,o=n.getUserConfirmation,s=void 0===o?F:o,i=n.keyLength,a=void 0===i?6:i,f=t.basename?A(j(t.basename)):"";function p(t){var e=t||{},n=e.key,r=e.state,o=window.location,i=o.pathname+o.search+o.hash;return f&&(i=R(i,f)),M(i,r,n)}function d(){return Math.random().toString(36).substr(2,a)}var h=L();function v(t){C(T,t),T.length=u.length,h.notifyListeners(T.location,T.action)}function y(t){!function(t){void 0===t.state&&navigator.userAgent.indexOf("CriOS")}(t)&&b(p(t.state))}function m(){b(p(D()))}var g=!1;function b(e){g?(g=!1,v()):h.confirmTransitionTo(e,"POP",s,function(t){t?v({action:"POP",location:e}):function(t){var e=T.location,n=x.indexOf(e.key);-1===n&&(n=0);var r=x.indexOf(t.key);-1===r&&(r=0);var o=n-r;o&&(g=!0,S(o))}(e)})}var w=p(D()),x=[w.key];function E(t){return f+N(t)}function S(t){u.go(t)}var _=0;function k(t){1===(_+=t)&&1===t?(window.addEventListener("popstate",y),e&&window.addEventListener(U,m)):0===_&&(window.removeEventListener("popstate",y),e&&window.removeEventListener(U,m))}var O=!1,T={length:u.length,action:"POP",location:w,createHref:E,push:function(t,e){var a=M(t,e,d(),T.location);h.confirmTransitionTo(a,"PUSH",s,function(t){if(t){var e=E(a),n=a.key,r=a.state;if(c)if(u.pushState({key:n,state:r},null,e),l)window.location.href=e;else{var o=x.indexOf(T.location.key),i=x.slice(0,-1===o?0:o+1);i.push(a.key),x=i,v({action:"PUSH",location:a})}else window.location.href=e}})},replace:function(t,e){var i=M(t,e,d(),T.location);h.confirmTransitionTo(i,"REPLACE",s,function(t){if(t){var e=E(i),n=i.key,r=i.state;if(c)if(u.replaceState({key:n,state:r},null,e),l)window.location.replace(e);else{var o=x.indexOf(T.location.key);-1!==o&&(x[o]=i.key),v({action:"REPLACE",location:i})}else window.location.replace(e)}})},go:S,goBack:function(){S(-1)},goForward:function(){S(1)},block:function(t){void 0===t&&(t=!1);var e=h.setPrompt(t);return O||(k(1),O=!0),function(){return O&&(O=!1,k(-1)),e()}},listen:function(t){var e=h.appendListener(t);return k(1),function(){k(-1),e()}}};return T},e.createHashHistory=function(t){void 0===t&&(t={}),I||P(!1);var e=window.history,n=(window.navigator.userAgent.indexOf("Firefox"),t),r=n.getUserConfirmation,a=void 0===r?F:r,o=n.hashType,i=void 0===o?"slash":o,u=t.basename?A(j(t.basename)):"",c=W[i],l=c.encodePath,s=c.decodePath;function f(){var t=s(z());return u&&(t=R(t,u)),M(t)}var p=L();function d(t){C(k,t),k.length=e.length,p.notifyListeners(k.location,k.action)}var h=!1,v=null;function y(){var e,t=z(),n=l(t);if(t!==n)H(n);else{var r=f(),o=k.location;if(!h&&O(o,r))return;if(v===N(r))return;v=null,e=r,h?(h=!1,d()):p.confirmTransitionTo(e,"POP",a,function(t){t?d({action:"POP",location:e}):function(t){var e=k.location,n=w.lastIndexOf(N(e));-1===n&&(n=0);var r=w.lastIndexOf(N(t));-1===r&&(r=0);var o=n-r;o&&(h=!0,x(o))}(e)})}}var m=z(),g=l(m);m!==g&&H(g);var b=f(),w=[N(b)];function x(t){e.go(t)}var E=0;function S(t){1===(E+=t)&&1===t?window.addEventListener(T,y):0===E&&window.removeEventListener(T,y)}var _=!1,k={length:e.length,action:"POP",location:b,createHref:function(t){return"#"+l(u+N(t))},push:function(t,e){var i=M(t,void 0,void 0,k.location);p.confirmTransitionTo(i,"PUSH",a,function(t){if(t){var e=N(i),n=l(u+e);if(z()!==n){v=e,function(t){window.location.hash=t}(n);var r=w.lastIndexOf(N(k.location)),o=w.slice(0,-1===r?0:r+1);o.push(e),w=o,d({action:"PUSH",location:i})}else d()}})},replace:function(t,e){var o=M(t,void 0,void 0,k.location);p.confirmTransitionTo(o,"REPLACE",a,function(t){if(t){var e=N(o),n=l(u+e);z()!==n&&(v=e,H(n));var r=w.indexOf(N(k.location));-1!==r&&(w[r]=e),d({action:"REPLACE",location:o})}})},go:x,goBack:function(){x(-1)},goForward:function(){x(1)},block:function(t){void 0===t&&(t=!1);var e=p.setPrompt(t);return _||(S(1),_=!0),function(){return _&&(_=!1,S(-1)),e()}},listen:function(t){var e=p.appendListener(t);return S(1),function(){S(-1),e()}}};return k},e.createMemoryHistory=function(t){void 0===t&&(t={});var e=t,o=e.getUserConfirmation,n=e.initialEntries,r=void 0===n?["/"]:n,i=e.initialIndex,a=void 0===i?0:i,u=e.keyLength,c=void 0===u?6:u,l=L();function s(t){C(y,t),y.length=y.entries.length,l.notifyListeners(y.location,y.action)}function f(){return Math.random().toString(36).substr(2,c)}var p=m(a,0,r.length-1),d=r.map(function(t){return M(t,void 0,"string"==typeof t?f():t.key||f())}),h=N;function v(t){var e=m(y.index+t,0,y.entries.length-1),n=y.entries[e];l.confirmTransitionTo(n,"POP",o,function(t){t?s({action:"POP",location:n,index:e}):s()})}var y={length:d.length,action:"POP",location:d[p],index:p,entries:d,createHref:h,push:function(t,e){var r=M(t,e,f(),y.location);l.confirmTransitionTo(r,"PUSH",o,function(t){if(t){var e=y.index+1,n=y.entries.slice(0);n.length>e?n.splice(e,n.length-e,r):n.push(r),s({action:"PUSH",location:r,index:e,entries:n})}})},replace:function(t,e){var n=M(t,e,f(),y.location);l.confirmTransitionTo(n,"REPLACE",o,function(t){t&&s({action:"REPLACE",location:y.entries[y.index]=n})})},go:v,goBack:function(){v(-1)},goForward:function(){v(1)},canGo:function(t){var e=y.index+t;return 0<=e&&e<y.entries.length},block:function(t){return void 0===t&&(t=!1),l.setPrompt(t)},listen:function(t){return l.appendListener(t)}};return y},e.createLocation=M,e.locationsAreEqual=O,e.parsePath=u,e.createPath=N},function(o,t,i){(function(t){var e,n=void 0!==t?t:"undefined"!=typeof window?window:{},r=i(465);e="undefined"!=typeof document?document:(e=n["__GLOBAL_DOCUMENT_CACHE@4"])||(n["__GLOBAL_DOCUMENT_CACHE@4"]=r),o.exports=e}).call(this,i(81))},function(t,e){},function(t,e){t.exports=function(t){if(!t.webpackPolyfill){var e=Object.create(t);e.children||(e.children=[]),Object.defineProperty(e,"loaded",{enumerable:!0,get:function(){return e.l}}),Object.defineProperty(e,"id",{enumerable:!0,get:function(){return e.i}}),Object.defineProperty(e,"exports",{enumerable:!0}),e.webpackPolyfill=1}return e}},function(t,e,n){t.exports=n(468)},function(t,e,n){"use strict";var r=n(217),o=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.create=function(){var C=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},j=1<arguments.length&&void 0!==arguments[1]?arguments[1]:{},R=j.initialReducer,t=j.setupApp,A=void 0===t?G.noop:t,N=new a.default;N.use((0,a.filterHooks)(C));var M={_models:[(0,i.default)((0,U.default)({},u))],_store:null,_plugin:N,use:N.use.bind(N),model:L,start:function(){function t(t,e){t&&("string"==typeof t&&(t=new Error(t)),t.preventDefault=function(){t._dontReject=!0},N.apply("onError",function(t){throw new Error(t.stack||t)})(t,M._store.dispatch,e))}var e=(0,W.default)(),n=(0,V.default)(M);M._getSaga=q.default.bind(null);var r=[],o=(0,U.default)({},R),i=!0,a=!1,u=void 0;try{for(var c,l=(0,I.default)(M._models);!(i=(c=l.next()).done);i=!0){var s=c.value;o[s.namespace]=(0,B.default)(s.reducers,s.state,N._handleActions),s.effects&&r.push(M._getSaga(s.effects,s,t,N.get("onEffect")))}}catch(t){a=!0,u=t}finally{try{i||null==l.return||l.return()}finally{if(a)throw u}}var f=N.get("onReducer"),p=N.get("extraReducers");(0,z.default)((0,F.default)(p).every(function(t){return!(t in o)}),"[app.start] extraReducers is conflict with other reducers, reducers list: ".concat((0,F.default)(o).join(", ")));var d=M._store=(0,H.default)({reducers:P(),initialState:C.initialState||{},plugin:N,createOpts:j,sagaMiddleware:e,promiseMiddleware:n});d.runSaga=e.run,d.asyncReducers={};var h=N.get("onStateChange"),v=!0,y=!1,m=void 0;try{for(var g,b=function(){var t=g.value;d.subscribe(function(){t(d.getState())})},w=(0,I.default)(h);!(v=(g=w.next()).done);v=!0)b()}catch(t){y=!0,m=t}finally{try{v||null==w.return||w.return()}finally{if(y)throw m}}r.forEach(e.run),A(M);var x={},E=!0,S=!1,_=void 0;try{for(var k,O=(0,I.default)(this._models);!(E=(k=O.next()).done);E=!0){var T=k.value;T.subscriptions&&(x[T.namespace]=(0,$.run)(T.subscriptions,T,M,t))}}catch(t){S=!0,_=t}finally{try{E||null==O.return||O.return()}finally{if(S)throw _}}function P(){return f((0,D.combineReducers)((0,U.default)({},o,p,M._store?M._store.asyncReducers:{})))}M.model=function(t,e,n,r){r=L(r);var o=M._store;o.asyncReducers[r.namespace]=(0,B.default)(r.reducers,r.state,N._handleActions),o.replaceReducer(t()),r.effects&&o.runSaga(M._getSaga(r.effects,r,e,N.get("onEffect")));r.subscriptions&&(n[r.namespace]=(0,$.run)(r.subscriptions,r,M,e))}.bind(M,P,t,x),M.unmodel=function(t,e,n,r){var o=M._store;delete o.asyncReducers[r],delete e[r],o.replaceReducer(t()),o.dispatch({type:"@@dva/UPDATE"}),o.dispatch({type:"".concat(r,"/@@CANCEL_EFFECTS")}),(0,$.unlisten)(n,r),M._models=M._models.filter(function(t){return t.namespace!==r})}.bind(M,P,o,x),M.replaceModel=function(t,e,n,r,o){var i=M._store,a=o.namespace,u=(0,G.findIndex)(M._models,function(t){return t.namespace===a});~u&&(i.dispatch({type:"".concat(a,"/@@CANCEL_EFFECTS")}),delete i.asyncReducers[a],delete e[a],(0,$.unlisten)(n,a),M._models.splice(u,1));M.model(o),i.dispatch({type:"@@dva/UPDATE"})}.bind(M,P,o,x,t)}};return M;function L(t){var e=(0,i.default)((0,U.default)({},t));return M._models.push(e),e}};var I=o(n(85)),F=o(n(64)),U=o(n(86)),D=n(229),W=o(n(473)),z=o(n(7)),i=(o(n(476)),o(n(481))),a=r(n(482)),H=o(n(485)),q=o(n(493)),B=o(n(502)),V=o(n(504)),$=n(521),G=n(56),u={namespace:"@@dva",state:0,reducers:{UPDATE:function(t){return t+1}}}},function(t,e,n){n(108),n(84),t.exports=n(470)},function(t,e,n){var r=n(37),o=n(149);t.exports=n(14).getIterator=function(t){var e=o(t);if("function"!=typeof e)throw TypeError(t+" is not iterable!");return r(e.call(t))}},function(t,e,n){t.exports=n(198)},function(t,e,n){var r=n(151);t.exports=function(t,e,n){return e in t?r(t,e,{value:n,enumerable:!0,configurable:!0,writable:!0}):t[e]=n,t}},function(t,e,n){"use strict";e.__esModule=!0,e.default=function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},e=t.context,o=void 0===e?{}:e,i=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(t,["context"]),a=i.sagaMonitor,u=i.logger,c=i.onError;if(s.is.func(i))throw new Error("Saga middleware no longer accept Generator functions. Use sagaMiddleware.run instead");if(u&&!s.is.func(u))throw new Error("`options.logger` passed to the Saga middleware is not a function!");0;if(c&&!s.is.func(c))throw new Error("`options.onError` passed to the Saga middleware is not a function!");if(i.emitter&&!s.is.func(i.emitter))throw new Error("`options.emitter` passed to the Saga middleware is not a function!");function l(t){var e=t.getState,n=t.dispatch,r=(0,f.emitter)();return r.emit=(i.emitter||s.ident)(r.emit),l.run=p.runSaga.bind(null,{context:o,subscribe:r.subscribe,dispatch:n,getState:e,sagaMonitor:a,logger:u,onError:c}),function(n){return function(t){a&&a.actionDispatched&&a.actionDispatched(t);var e=n(t);return r.emit(t),e}}}return l.run=function(){throw new Error("Before running a Saga, you must mount the Saga middleware on the Store using applyMiddleware")},l.setContext=function(t){(0,s.check)(t,s.is.object,(0,s.createSetContextWarning)("sagaMiddleware",t)),s.object.assign(o,t)},l};var s=n(38),f=n(87),p=n(474)},function(t,e,n){"use strict";e.__esModule=!0,e.runSaga=function(t,e){for(var n=arguments.length,r=Array(2<n?n-2:0),o=2;o<n;o++)r[o-2]=arguments[o];var i=void 0;y.is.iterator(t)?(i=t,t=e):((0,y.check)(e,y.is.func,g),i=e.apply(void 0,r),(0,y.check)(i,y.is.iterator,g));var a=t,u=a.subscribe,c=a.dispatch,l=a.getState,s=a.context,f=a.sagaMonitor,p=a.logger,d=a.onError,h=(0,y.uid)();f&&(f.effectTriggered=f.effectTriggered||y.noop,f.effectResolved=f.effectResolved||y.noop,f.effectRejected=f.effectRejected||y.noop,f.effectCancelled=f.effectCancelled||y.noop,f.actionDispatched=f.actionDispatched||y.noop,f.effectTriggered({effectId:h,root:!0,parentEffectId:0,effect:{root:!0,saga:e,args:r}}));var v=(0,m.default)(i,u,(0,y.wrapSagaDispatch)(c),l,s,{sagaMonitor:f,logger:p,onError:d},h,e.name);f&&f.effectResolved(h,v);return v};var y=n(38),m=r(n(475));function r(t){return t&&t.__esModule?t:{default:t}}var g="runSaga(storeInterface, saga, ...args): saga argument must be a Generator function!"},function(t,e,n){"use strict";e.__esModule=!0,e.TASK_CANCEL=e.CHANNEL_END=e.NOT_ITERATOR_ERROR=void 0;var V=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t},r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t};e.default=function l(r){var s=1<arguments.length&&void 0!==arguments[1]?arguments[1]:function(){return $.noop};var f=2<arguments.length&&void 0!==arguments[2]?arguments[2]:$.noop;var p=3<arguments.length&&void 0!==arguments[3]?arguments[3]:$.noop;var t=4<arguments.length&&void 0!==arguments[4]?arguments[4]:{};var d=5<arguments.length&&void 0!==arguments[5]?arguments[5]:{};var o=6<arguments.length&&void 0!==arguments[6]?arguments[6]:0;var c=7<arguments.length&&void 0!==arguments[7]?arguments[7]:"anonymous";var e=arguments[8];(0,$.check)(r,$.is.iterator,J);var n="[...effects]";var h=(0,$.deprecate)(I,(0,$.updateIncentive)(n,"all("+n+")"));var v=d.sagaMonitor,i=d.logger,a=d.onError;var u=i||$.log;var y=function(t){var e=t.sagaStack;!e&&t.stack&&(e=-1!==t.stack.split("\n")[0].indexOf(t.message)?t.stack:"Error: "+t.message+"\n"+t.stack),u("error","uncaught at "+c,e||t.message||t)};var m=(0,K.stdChannel)(s);var g=Object.create(t);_.cancel=$.noop;var b=B(o,c,r,e);var w={name:c,cancel:E,isRunning:!0};var x=nt(c,w,k);function E(){w.isRunning&&!w.isCancelled&&(w.isCancelled=!0,_(tt))}function S(){r._isRunning&&!r._isCancelled&&(r._isCancelled=!0,x.cancelAll(),k(tt))}e&&(e.cancel=S);r._isRunning=!0;_();return b;function _(t,e){if(!w.isRunning)throw new Error("Trying to resume an already finished generator");try{var n=void 0;(n=e?r.throw(t):t===tt?(w.isCancelled=!0,_.cancel(),$.is.func(r.return)?r.return(tt):{done:!0,value:tt}):t===Z?$.is.func(r.return)?r.return():{done:!0}:r.next(t)).done?(w.isMainRunning=!1,w.cont&&w.cont(n.value)):O(n.value,o,"",_)}catch(t){w.isCancelled&&y(t),w.isMainRunning=!1,w.cont(t,!0)}}function k(e,n){r._isRunning=!1,m.close(),n?(e instanceof Error&&Object.defineProperty(e,"sagaStack",{value:"at "+c+" \n "+(e.sagaStack||e.stack),configurable:!0}),b.cont||(e instanceof Error&&a?a(e):y(e)),r._error=e,r._isAborted=!0,r._deferredEnd&&r._deferredEnd.reject(e)):(r._result=e,r._deferredEnd&&r._deferredEnd.resolve(e)),b.cont&&b.cont(e,n),b.joiners.forEach(function(t){return t.cb(e,n)}),b.joiners=null}function O(t,e){var n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:"",r=arguments[3],o=(0,$.uid)();v&&v.effectTriggered({effectId:o,parentEffectId:e,label:n,effect:t});var i=void 0;function a(t,e){i||(i=!0,r.cancel=$.noop,v&&(e?v.effectRejected(o,t):v.effectResolved(o,t)),r(t,e))}a.cancel=$.noop,r.cancel=function(){if(!i){i=!0;try{a.cancel()}catch(t){y(t)}a.cancel=$.noop,v&&v.effectCancelled(o)}};var u=void 0;return $.is.promise(t)?T(t,a):$.is.helper(t)?N(ot(t),o,a):$.is.iterator(t)?P(t,o,c,a):$.is.array(t)?h(t,o,a):(u=Y.asEffect.take(t))?C(u,a):(u=Y.asEffect.put(t))?j(u,a):(u=Y.asEffect.all(t))?I(u,o,a):(u=Y.asEffect.race(t))?F(u,o,a):(u=Y.asEffect.call(t))?R(u,o,a):(u=Y.asEffect.cps(t))?A(u,a):(u=Y.asEffect.fork(t))?N(u,o,a):(u=Y.asEffect.join(t))?M(u,a):(u=Y.asEffect.cancel(t))?L(u,a):(u=Y.asEffect.select(t))?U(u,a):(u=Y.asEffect.actionChannel(t))?D(u,a):(u=Y.asEffect.flush(t))?z(u,a):(u=Y.asEffect.cancelled(t))?W(u,a):(u=Y.asEffect.getContext(t))?H(u,a):(u=Y.asEffect.setContext(t))?q(u,a):a(t)}function T(t,e){var n=t[$.CANCEL];$.is.func(n)?e.cancel=n:$.is.func(t.abort)&&(e.cancel=function(){return t.abort()}),t.then(e,function(t){return e(t,!0)})}function P(t,e,n,r){l(t,s,f,p,g,d,e,n,r)}function C(t,e){var n=t.channel,r=t.pattern,o=t.maybe;n=n||m;var i=function(t){return t instanceof Error?e(t,!0):(0,K.isEnd)(t)&&!o?e(Z):e(t)};try{n.take(i,et(r))}catch(t){return e(t,!0)}e.cancel=i.cancel}function j(t,e){var n=t.channel,r=t.action,o=t.resolve;(0,G.asap)(function(){var t=void 0;try{t=(n?n.put:f)(r)}catch(t){if(n||o)return e(t,!0);y(t)}if(!o||!$.is.promise(t))return e(t);T(t,e)})}function R(t,e,n){var r=t.context,o=t.fn,i=t.args,a=void 0;try{a=o.apply(r,i)}catch(t){return n(t,!0)}return $.is.promise(a)?T(a,n):$.is.iterator(a)?P(a,e,o.name,n):n(a)}function A(t,n){var e=t.context,r=t.fn,o=t.args;try{var i=function(t,e){return $.is.undef(t)?n(e):n(t,!0)};r.apply(e,o.concat(i)),i.cancel&&(n.cancel=function(){return i.cancel()})}catch(t){return n(t,!0)}}function N(t,e,n){var r=t.context,o=t.fn,i=t.args,a=t.detached,u=rt({context:r,fn:o,args:i});try{(0,G.suspend)();var c=l(u,s,f,p,g,d,e,o.name,a?null:$.noop);a?n(c):u._isRunning?(x.addTask(c),n(c)):u._error?x.abort(u._error):n(c)}finally{(0,G.flush)()}}function M(t,e){if(t.isRunning()){var n={task:b,cb:e};e.cancel=function(){return(0,$.remove)(t.joiners,n)},t.joiners.push(n)}else t.isAborted()?e(t.error(),!0):e(t.result())}function L(t,e){t===$.SELF_CANCELLATION&&(t=b),t.isRunning()&&t.cancel(),e()}function I(e,n,r){var t=Object.keys(e);if(!t.length)return r($.is.array(e)?[]:{});var o=0,i=void 0,a={},u={};function c(){o===t.length&&(i=!0,r($.is.array(e)?$.array.from(V({},a,{length:t.length})):a))}t.forEach(function(n){var t=function(t,e){i||(e||(0,K.isEnd)(t)||t===Z||t===tt?(r.cancel(),r(t,e)):(a[n]=t,o++,c()))};t.cancel=$.noop,u[n]=t}),r.cancel=function(){i||(i=!0,t.forEach(function(t){return u[t].cancel()}))},t.forEach(function(t){return O(e[t],n,t,u[t])})}function F(i,e,a){var u=void 0,c=Object.keys(i),n={};c.forEach(function(o){var t=function(t,e){if(!u)if(e)a.cancel(),a(t,!0);else if(!(0,K.isEnd)(t)&&t!==Z&&t!==tt){var n;a.cancel(),u=!0;var r=((n={})[o]=t,n);a($.is.array(i)?[].slice.call(V({},r,{length:c.length})):r)}};t.cancel=$.noop,n[o]=t}),a.cancel=function(){u||(u=!0,c.forEach(function(t){return n[t].cancel()}))},c.forEach(function(t){u||O(i[t],e,t,n[t])})}function U(t,e){var n=t.selector,r=t.args;try{var o=n.apply(void 0,[p()].concat(r));e(o)}catch(t){e(t,!0)}}function D(t,e){var n=t.pattern,r=t.buffer,o=et(n);o.pattern=n,e((0,K.eventChannel)(s,r||Q.buffers.fixed(),o))}function W(t,e){e(!!w.isCancelled)}function z(t,e){t.flush(e)}function H(t,e){e(g[t])}function q(t,e){$.object.assign(g,t),e()}function B(t,e,n,r){var o,i;return n._deferredEnd=null,(o={})[$.TASK]=!0,o.id=t,o.name=e,"done",(i={}).done=i.done||{},i.done.get=function(){if(n._deferredEnd)return n._deferredEnd.promise;var t=(0,$.deferred)();return n._deferredEnd=t,n._isRunning||(n._error?t.reject(n._error):t.resolve(n._result)),t.promise},o.cont=r,o.joiners=[],o.cancel=S,o.isRunning=function(){return n._isRunning},o.isCancelled=function(){return n._isCancelled},o.isAborted=function(){return n._isAborted},o.result=function(){return n._result},o.error=function(){return n._error},o.setContext=function(t){(0,$.check)(t,$.is.object,(0,$.createSetContextWarning)("task",t)),$.object.assign(g,t)},X(o,i),o}};var $=n(38),G=n(219),Y=n(65),K=n(87),Q=n(152);function X(t,e){for(var n in e){var r=e[n];r.configurable=r.enumerable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(t,n,r)}return t}var J=e.NOT_ITERATOR_ERROR="proc first argument (Saga function result) must be an iterator",Z=e.CHANNEL_END={toString:function(){return"@@redux-saga/CHANNEL_END"}},tt=e.TASK_CANCEL={toString:function(){return"@@redux-saga/TASK_CANCEL"}},o={wildcard:function(){return $.kTrue},default:function(e){return"symbol"===(void 0===e?"undefined":r(e))?function(t){return t.type===e}:function(t){return t.type===String(e)}},array:function(t){return function(e){return t.some(function(t){return et(t)(e)})}},predicate:function(e){return function(t){return e(t)}}};function et(t){return("*"===t?o.wildcard:$.is.array(t)?o.array:$.is.stringableFunc(t)?o.default:$.is.func(t)?o.predicate:o.default)(t)}function nt(t,r,o){var i=[],a=void 0,u=!1;function c(t){n(),o(t,!0)}function e(n){i.push(n),n.cont=function(t,e){u||((0,$.remove)(i,n),n.cont=$.noop,e?c(t):(n===r&&(a=t),i.length||(u=!0,o(a))))}}function n(){u||(u=!0,i.forEach(function(t){t.cont=$.noop,t.cancel()}),i=[])}return e(r),{addTask:e,cancelAll:n,abort:c,getTasks:function(){return i},taskNames:function(){return i.map(function(t){return t.name})}}}function rt(t){var e=t.context,n=t.fn,r=t.args;if($.is.iterator(n))return n;var o,i,a=void 0,u=void 0;try{a=n.apply(e,r)}catch(t){u=t}return $.is.iterator(a)?a:u?(0,$.makeIterator)(function(){throw u}):(0,$.makeIterator)((o=void 0,i={done:!1,value:a},function(t){return o?function(t){return{done:!0,value:t}}(t):(o=!0,i)}))}var ot=function(t){return{fn:t}}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(t,e){var n=t.namespace,r=t.reducers,o=t.effects,i=t.subscriptions;(0,c.default)(n,"[app.model] namespace should be defined"),(0,c.default)("string"==typeof n,"[app.model] namespace should be string, but got ".concat((0,u.default)(n))),(0,c.default)(!e.some(function(t){return t.namespace===n}),"[app.model] namespace should be unique"),r&&((0,c.default)((0,l.isPlainObject)(r)||(0,l.isArray)(r),"[app.model] reducers should be plain object or array, but got ".concat((0,u.default)(r))),(0,c.default)(!(0,l.isArray)(r)||(0,l.isPlainObject)(r[0])&&(0,l.isFunction)(r[1]),"[app.model] reducers with array should be [Object, Function]"));o&&(0,c.default)((0,l.isPlainObject)(o),"[app.model] effects should be plain object, but got ".concat((0,u.default)(o)));i&&((0,c.default)((0,l.isPlainObject)(i),"[app.model] subscriptions should be plain object, but got ".concat((0,u.default)(i))),(0,c.default)(function(e){return(0,a.default)(e).every(function(t){return(0,l.isFunction)(e[t])})}(i),"[app.model] subscription should be function"))};var a=r(n(64)),u=r(n(220)),c=r(n(7)),l=n(56)},function(t,e,n){t.exports=n(207)},function(t,e,n){t.exports=n(209)},function(t,e,n){"use strict";
/*!
* is-plain-object <https://github.com/jonschlinkert/is-plain-object>
*
* Copyright (c) 2014-2017, Jon Schlinkert.
* Released under the MIT License.
*/var r=n(480);function o(t){return!0===r(t)&&"[object Object]"===Object.prototype.toString.call(t)}t.exports=function(t){var e,n;return!1!==o(t)&&("function"==typeof(e=t.constructor)&&(!1!==o(n=e.prototype)&&!1!==n.hasOwnProperty("isPrototypeOf")))}},function(t,e,n){"use strict";
/*!
* isobject <https://github.com/jonschlinkert/isobject>
*
* Copyright (c) 2014-2017, Jon Schlinkert.
* Released under the MIT License.
*/t.exports=function(t){return null!=t&&"object"==typeof t&&!1===Array.isArray(t)}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(t){var e=t.namespace,n=t.reducers,r=t.effects;n&&((0,o.isArray)(n)?t.reducers[0]=c(n[0],e,"reducer"):t.reducers=c(n,e,"reducer"));r&&(t.effects=c(r,e,"effect"));return t};var i=r(n(64)),a=r(n(109)),o=n(56),u=n(88);function c(n,r,o){return(0,i.default)(n).reduce(function(t,e){return(0,a.default)(0!==e.indexOf("".concat(r).concat(u.NAMESPACE_SEP)),"[prefixNamespace]: ".concat(o," ").concat(e," should not be prefixed with namespace ").concat(r)),t["".concat(r).concat(u.NAMESPACE_SEP).concat(e)]=n[e],t},{})}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.filterHooks=function(n){return(0,a.default)(n).reduce(function(t,e){return-1<f.indexOf(e)&&(t[e]=n[e]),t},{})},e.default=void 0;var c=r(n(86)),l=r(n(85)),o=r(n(483)),i=r(n(484)),a=r(n(64)),u=r(n(7)),s=n(56),f=["onError","onStateChange","onAction","onHmr","onReducer","onEffect","extraReducers","extraEnhancers","_handleActions"];var p=function(){function t(){(0,o.default)(this,t),this._handleActions=null,this.hooks=f.reduce(function(t,e){return t[e]=[],t},{})}return(0,i.default)(t,[{key:"use",value:function(t){(0,u.default)((0,s.isPlainObject)(t),"plugin.use: plugin should be plain object");var e=this.hooks;for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&((0,u.default)(e[n],"plugin.use: unknown plugin property: ".concat(n)),"_handleActions"===n?this._handleActions=t[n]:"extraEnhancers"===n?e[n]=t[n]:e[n].push(t[n]))}},{key:"apply",value:function(t,i){var e=this.hooks;(0,u.default)(-1<["onError","onHmr"].indexOf(t),"plugin.apply: hook ".concat(t," cannot be applied"));var a=e[t];return function(){if(a.length){var t=!0,e=!1,n=void 0;try{for(var r,o=(0,l.default)(a);!(t=(r=o.next()).done);t=!0){r.value.apply(void 0,arguments)}}catch(t){e=!0,n=t}finally{try{t||null==o.return||o.return()}finally{if(e)throw n}}}else i&&i.apply(void 0,arguments)}}},{key:"get",value:function(t){var e=this.hooks;return(0,u.default)(t in e,"plugin.get: hook ".concat(t," cannot be got")),"extraReducers"===t?function(t){var e={},n=!0,r=!1,o=void 0;try{for(var i,a=(0,l.default)(t);!(n=(i=a.next()).done);n=!0){var u=i.value;e=(0,c.default)({},e,u)}}catch(t){r=!0,o=t}finally{try{n||null==a.return||a.return()}finally{if(r)throw o}}return e}(e[t]):"onReducer"===t?function(a){return function(t){var e=!0,n=!1,r=void 0;try{for(var o,i=(0,l.default)(a);!(e=(o=i.next()).done);e=!0){t=(0,o.value)(t)}}catch(t){n=!0,r=t}finally{try{e||null==i.return||i.return()}finally{if(n)throw r}}return t}}(e[t]):e[t]}}]),t}();e.default=p},function(t,e){t.exports=function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}},function(t,e,n){var o=n(151);function r(t,e){for(var n=0;n<e.length;n++){var r=e[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),o(t,r.key,r)}}t.exports=function(t,e,n){return e&&r(t.prototype,e),n&&r(t,n),t}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(t){var e=t.reducers,n=t.initialState,r=t.plugin,o=t.sagaMiddleware,i=t.promiseMiddleware,a=t.createOpts.setupMiddlewares,u=void 0===a?g.returnSelf:a,c=r.get("extraEnhancers");(0,y.default)((0,g.isArray)(c),"[app.start] extraEnhancers should be array, but got ".concat((0,d.default)(c)));var l=r.get("onAction"),s=u([i,o].concat((0,p.default)((0,v.default)(l))));0;var f=[h.applyMiddleware.apply(void 0,(0,p.default)(s))].concat((0,p.default)(c),[(m.default.__REDUX_DEVTOOLS_EXTENSION__OPTIONS,function(t){return t})]);return(0,h.createStore)(e,n,h.compose.apply(void 0,(0,p.default)(f)))};var p=r(n(153)),d=r(n(220)),h=n(229),v=r(n(491)),y=r(n(7)),m=r(n(492)),g=n(56)},function(t,e){t.exports=function(t){if(Array.isArray(t)){for(var e=0,n=new Array(t.length);e<t.length;e++)n[e]=t[e];return n}}},function(t,e,n){var r=n(488),o=n(489);t.exports=function(t){if(o(Object(t))||"[object Arguments]"===Object.prototype.toString.call(t))return r(t)}},function(t,e,n){t.exports=n(211)},function(t,e,n){t.exports=n(215)},function(t,e){t.exports=function(){throw new TypeError("Invalid attempt to spread non-iterable instance")}},function(t,e){t.exports=function(t,o){return(o="number"==typeof o?o:1/0)?function n(t,r){return t.reduce(function(t,e){return Array.isArray(e)&&r<o?t.concat(n(e,r+1)):t.concat(e)},[])}(t,1):Array.isArray(t)?t.map(function(t){return t}):t}},function(n,t,e){(function(t){var e;e="undefined"!=typeof window?window:void 0!==t?t:"undefined"!=typeof self?self:{},n.exports=e}).call(this,e(81))},function(t,e,n){"use strict";var r=n(217),o=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(o,i,a,u){return g.default.mark(function t(){var r;return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:t.t0=g.default.keys(o);case 1:if((t.t1=t.t0()).done){t.next=7;break}if(r=t.t1.value,Object.prototype.hasOwnProperty.call(o,r))return t.delegateYield(g.default.mark(function t(){var e,n;return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return e=f(r,o[r],i,a,u),t.next=3,b.fork(e);case 3:return n=t.sent,t.next=6,b.fork(g.default.mark(function t(){return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,b.take("".concat(i.namespace,"/@@CANCEL_EFFECTS"));case 2:return t.next=4,b.cancel(n);case 4:case"end":return t.stop()}},t,this)}));case 6:case"end":return t.stop()}},t,this)})(),"t2",5);t.next=5;break;case 5:t.next=1;break;case 7:case"end":return t.stop()}},t,this)})};var s=o(n(85)),i=o(n(86)),m=o(n(153)),g=o(n(494)),u=o(n(7)),b=r(n(497)),a=o(n(109)),c=n(221),w=n(88),l=o(n(222));function f(f,t,p,d,e){var n,h=g.default.mark(i),v=t,r="takeEvery";if(Array.isArray(t)){v=t[0];var o=t[1];o&&o.type&&"throttle"===(r=o.type)&&((0,u.default)(o.ms,"app.start: opts.ms should be defined if type is throttle"),n=o.ms),(0,u.default)(-1<["watcher","takeEvery","takeLatest","throttle"].indexOf(r),"app.start: effect type should be takeEvery, takeLatest, throttle or watcher")}function y(){}function i(){var e,n,r,o,i,a,u,c,l,s=arguments;return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:for(e=s.length,n=new Array(e),r=0;r<e;r++)n[r]=s[r];return o=0<n.length?n[0]:{},i=o.__dva_resolve,a=void 0===i?y:i,u=o.__dva_reject,c=void 0===u?y:u,t.prev=2,t.next=5,b.put({type:"".concat(f).concat(w.NAMESPACE_SEP,"@@start")});case 5:return t.next=7,v.apply(void 0,(0,m.default)(n.concat(x(p))));case 7:return l=t.sent,t.next=10,b.put({type:"".concat(f).concat(w.NAMESPACE_SEP,"@@end")});case 10:a(l),t.next=17;break;case 13:t.prev=13,t.t0=t.catch(2),d(t.t0,{key:f,effectArgs:n}),t.t0._dontReject||c(t.t0);case 17:case"end":return t.stop()}},h,this,[[2,13]])}var a=function(t,e,n,r){var o=!0,i=!1,a=void 0;try{for(var u,c=(0,s.default)(t);!(o=(u=c.next()).done);o=!0){var l=u.value;e=l(e,b,n,r)}}catch(t){i=!0,a=t}finally{try{o||null==c.return||c.return()}finally{if(i)throw a}}return e}(e,i,p,f);switch(r){case"watcher":return i;case"takeLatest":return g.default.mark(function t(){return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,(0,c.takeLatestHelper)(f,a);case 2:case"end":return t.stop()}},t,this)});case"throttle":return g.default.mark(function t(){return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,(0,c.throttleHelper)(n,f,a);case 2:case"end":return t.stop()}},t,this)});default:return g.default.mark(function t(){return g.default.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,(0,c.takeEveryHelper)(f,a);case 2:case"end":return t.stop()}},t,this)})}}function x(n){function r(t,e){(0,u.default)(t,"dispatch: action should be a plain Object with type"),(0,a.default)(0!==t.indexOf("".concat(n.namespace).concat(w.NAMESPACE_SEP)),"[".concat(e,"] ").concat(t," should not be prefixed with namespace ").concat(n.namespace))}function t(t){var e=t.type;return r(e,"sagaEffects.put"),b.put((0,i.default)({},t,{type:(0,l.default)(e,n)}))}return t.resolve=function(t){var e=t.type;return r(e,"sagaEffects.put.resolve"),b.put.resolve((0,i.default)({},t,{type:(0,l.default)(e,n)}))},(0,i.default)({},b,{put:t,take:function(t){return"string"==typeof t?(r(t,"sagaEffects.take"),b.take((0,l.default)(t,n))):Array.isArray(t)?b.take(t.map(function(t){return"string"==typeof t?(r(t,"sagaEffects.take"),(0,l.default)(t,n)):t})):b.take(t)}})}},function(t,e,n){t.exports=n(495)},function(t,e,n){var r=function(){return this}()||Function("return this")(),o=r.regeneratorRuntime&&0<=Object.getOwnPropertyNames(r).indexOf("regeneratorRuntime"),i=o&&r.regeneratorRuntime;if(r.regeneratorRuntime=void 0,t.exports=n(496),o)r.regeneratorRuntime=i;else try{delete r.regeneratorRuntime}catch(t){r.regeneratorRuntime=void 0}},function(A,t){!function(t){"use strict";var c,e=Object.prototype,l=e.hasOwnProperty,n="function"==typeof Symbol?Symbol:{},o=n.iterator||"@@iterator",r=n.asyncIterator||"@@asyncIterator",i=n.toStringTag||"@@toStringTag",a="object"==typeof A,u=t.regeneratorRuntime;if(u)a&&(A.exports=u);else{(u=t.regeneratorRuntime=a?A.exports:{}).wrap=b;var s="suspendedStart",f="suspendedYield",p="executing",d="completed",h={},v={};v[o]=function(){return this};var y=Object.getPrototypeOf,m=y&&y(y(j([])));m&&m!==e&&l.call(m,o)&&(v=m);var g=S.prototype=x.prototype=Object.create(v);E.prototype=g.constructor=S,S.constructor=E,S[i]=E.displayName="GeneratorFunction",u.isGeneratorFunction=function(t){var e="function"==typeof t&&t.constructor;return!!e&&(e===E||"GeneratorFunction"===(e.displayName||e.name))},u.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,S):(t.__proto__=S,i in t||(t[i]="GeneratorFunction")),t.prototype=Object.create(g),t},u.awrap=function(t){return{__await:t}},_(k.prototype),k.prototype[r]=function(){return this},u.AsyncIterator=k,u.async=function(t,e,n,r){var o=new k(b(t,e,n,r));return u.isGeneratorFunction(e)?o:o.next().then(function(t){return t.done?t.value:o.next()})},_(g),g[i]="Generator",g[o]=function(){return this},g.toString=function(){return"[object Generator]"},u.keys=function(n){var r=[];for(var t in n)r.push(t);return r.reverse(),function t(){for(;r.length;){var e=r.pop();if(e in n)return t.value=e,t.done=!1,t}return t.done=!0,t}},u.values=j,C.prototype={constructor:C,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=c,this.done=!1,this.delegate=null,this.method="next",this.arg=c,this.tryEntries.forEach(P),!t)for(var e in this)"t"===e.charAt(0)&&l.call(this,e)&&!isNaN(+e.slice(1))&&(this[e]=c)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if("throw"===t.type)throw t.arg;return this.rval},dispatchException:function(n){if(this.done)throw n;var r=this;function t(t,e){return i.type="throw",i.arg=n,r.next=t,e&&(r.method="next",r.arg=c),!!e}for(var e=this.tryEntries.length-1;0<=e;--e){var o=this.tryEntries[e],i=o.completion;if("root"===o.tryLoc)return t("end");if(o.tryLoc<=this.prev){var a=l.call(o,"catchLoc"),u=l.call(o,"finallyLoc");if(a&&u){if(this.prev<o.catchLoc)return t(o.catchLoc,!0);if(this.prev<o.finallyLoc)return t(o.finallyLoc)}else if(a){if(this.prev<o.catchLoc)return t(o.catchLoc,!0)}else{if(!u)throw new Error("try statement without catch or finally");if(this.prev<o.finallyLoc)return t(o.finallyLoc)}}}},abrupt:function(t,e){for(var n=this.tryEntries.length-1;0<=n;--n){var r=this.tryEntries[n];if(r.tryLoc<=this.prev&&l.call(r,"finallyLoc")&&this.prev<r.finallyLoc){var o=r;break}}o&&("break"===t||"continue"===t)&&o.tryLoc<=e&&e<=o.finallyLoc&&(o=null);var i=o?o.completion:{};return i.type=t,i.arg=e,o?(this.method="next",this.next=o.finallyLoc,h):this.complete(i)},complete:function(t,e){if("throw"===t.type)throw t.arg;return"break"===t.type||"continue"===t.type?this.next=t.arg:"return"===t.type?(this.rval=this.arg=t.arg,this.method="return",this.next="end"):"normal"===t.type&&e&&(this.next=e),h},finish:function(t){for(var e=this.tryEntries.length-1;0<=e;--e){var n=this.tryEntries[e];if(n.finallyLoc===t)return this.complete(n.completion,n.afterLoc),P(n),h}},catch:function(t){for(var e=this.tryEntries.length-1;0<=e;--e){var n=this.tryEntries[e];if(n.tryLoc===t){var r=n.completion;if("throw"===r.type){var o=r.arg;P(n)}return o}}throw new Error("illegal catch attempt")},delegateYield:function(t,e,n){return this.delegate={iterator:j(t),resultName:e,nextLoc:n},"next"===this.method&&(this.arg=c),h}}}function b(t,e,n,r){var o=e&&e.prototype instanceof x?e:x,i=Object.create(o.prototype),a=new C(r||[]);return i._invoke=function(i,a,u){var c=s;return function(t,e){if(c===p)throw new Error("Generator is already running");if(c===d){if("throw"===t)throw e;return R()}for(u.method=t,u.arg=e;;){var n=u.delegate;if(n){var r=O(n,u);if(r){if(r===h)continue;return r}}if("next"===u.method)u.sent=u._sent=u.arg;else if("throw"===u.method){if(c===s)throw c=d,u.arg;u.dispatchException(u.arg)}else"return"===u.method&&u.abrupt("return",u.arg);c=p;var o=w(i,a,u);if("normal"===o.type){if(c=u.done?d:f,o.arg===h)continue;return{value:o.arg,done:u.done}}"throw"===o.type&&(c=d,u.method="throw",u.arg=o.arg)}}}(t,n,a),i}function w(t,e,n){try{return{type:"normal",arg:t.call(e,n)}}catch(t){return{type:"throw",arg:t}}}function x(){}function E(){}function S(){}function _(t){["next","throw","return"].forEach(function(e){t[e]=function(t){return this._invoke(e,t)}})}function k(c){var e;this._invoke=function(n,r){function t(){return new Promise(function(t,e){!function e(t,n,r,o){var i=w(c[t],c,n);if("throw"!==i.type){var a=i.arg,u=a.value;return u&&"object"==typeof u&&l.call(u,"__await")?Promise.resolve(u.__await).then(function(t){e("next",t,r,o)},function(t){e("throw",t,r,o)}):Promise.resolve(u).then(function(t){a.value=t,r(a)},o)}o(i.arg)}(n,r,t,e)})}return e=e?e.then(t,t):t()}}function O(t,e){var n=t.iterator[e.method];if(n===c){if(e.delegate=null,"throw"===e.method){if(t.iterator.return&&(e.method="return",e.arg=c,O(t,e),"throw"===e.method))return h;e.method="throw",e.arg=new TypeError("The iterator does not provide a 'throw' method")}return h}var r=w(n,t.iterator,e.arg);if("throw"===r.type)return e.method="throw",e.arg=r.arg,e.delegate=null,h;var o=r.arg;return o?o.done?(e[t.resultName]=o.value,e.next=t.nextLoc,"return"!==e.method&&(e.method="next",e.arg=c),e.delegate=null,h):o:(e.method="throw",e.arg=new TypeError("iterator result is not an object"),e.delegate=null,h)}function T(t){var e={tryLoc:t[0]};1 in t&&(e.catchLoc=t[1]),2 in t&&(e.finallyLoc=t[2],e.afterLoc=t[3]),this.tryEntries.push(e)}function P(t){var e=t.completion||{};e.type="normal",delete e.arg,t.completion=e}function C(t){this.tryEntries=[{tryLoc:"root"}],t.forEach(T,this),this.reset(!0)}function j(e){if(e){var t=e[o];if(t)return t.call(e);if("function"==typeof e.next)return e;if(!isNaN(e.length)){var n=-1,r=function t(){for(;++n<e.length;)if(l.call(e,n))return t.value=e[n],t.done=!1,t;return t.value=c,t.done=!0,t};return r.next=r}}return{next:R}}function R(){return{value:c,done:!0}}}(function(){return this}()||Function("return this")())},function(t,e,n){"use strict";e.__esModule=!0;var r=n(65);Object.defineProperty(e,"take",{enumerable:!0,get:function(){return r.take}}),Object.defineProperty(e,"takem",{enumerable:!0,get:function(){return r.takem}}),Object.defineProperty(e,"put",{enumerable:!0,get:function(){return r.put}}),Object.defineProperty(e,"all",{enumerable:!0,get:function(){return r.all}}),Object.defineProperty(e,"race",{enumerable:!0,get:function(){return r.race}}),Object.defineProperty(e,"call",{enumerable:!0,get:function(){return r.call}}),Object.defineProperty(e,"apply",{enumerable:!0,get:function(){return r.apply}}),Object.defineProperty(e,"cps",{enumerable:!0,get:function(){return r.cps}}),Object.defineProperty(e,"fork",{enumerable:!0,get:function(){return r.fork}}),Object.defineProperty(e,"spawn",{enumerable:!0,get:function(){return r.spawn}}),Object.defineProperty(e,"join",{enumerable:!0,get:function(){return r.join}}),Object.defineProperty(e,"cancel",{enumerable:!0,get:function(){return r.cancel}}),Object.defineProperty(e,"select",{enumerable:!0,get:function(){return r.select}}),Object.defineProperty(e,"actionChannel",{enumerable:!0,get:function(){return r.actionChannel}}),Object.defineProperty(e,"cancelled",{enumerable:!0,get:function(){return r.cancelled}}),Object.defineProperty(e,"flush",{enumerable:!0,get:function(){return r.flush}}),Object.defineProperty(e,"getContext",{enumerable:!0,get:function(){return r.getContext}}),Object.defineProperty(e,"setContext",{enumerable:!0,get:function(){return r.setContext}});var o=n(498);Object.defineProperty(e,"takeEvery",{enumerable:!0,get:function(){return o.takeEvery}}),Object.defineProperty(e,"takeLatest",{enumerable:!0,get:function(){return o.takeLatest}}),Object.defineProperty(e,"throttle",{enumerable:!0,get:function(){return o.throttle}})},function(t,e,n){"use strict";e.__esModule=!0,e.takeEvery=function(t,e){for(var n=arguments.length,r=Array(2<n?n-2:0),o=2;o<n;o++)r[o-2]=arguments[o];return a.fork.apply(void 0,[u.takeEveryHelper,t,e].concat(r))},e.takeLatest=function(t,e){for(var n=arguments.length,r=Array(2<n?n-2:0),o=2;o<n;o++)r[o-2]=arguments[o];return a.fork.apply(void 0,[u.takeLatestHelper,t,e].concat(r))},e.throttle=function(t,e,n){for(var r=arguments.length,o=Array(3<r?r-3:0),i=3;i<r;i++)o[i-3]=arguments[i];return a.fork.apply(void 0,[u.throttleHelper,t,e,n].concat(o))};var a=n(65),u=n(221)},function(t,e,n){"use strict";e.__esModule=!0,e.default=function(t,e){for(var n=arguments.length,r=Array(2<n?n-2:0),o=2;o<n;o++)r[o-2]=arguments[o];function i(t){return u=t}var a={done:!1,value:(0,s.take)(t)},u=void 0;return(0,l.default)({q1:function(){return["q2",a,i]},q2:function(){return u===f.END?[c.qEnd]:["q1",function(t){return{done:!1,value:s.fork.apply(void 0,[e].concat(r,[t]))}}(u)]}},"q1","takeEvery("+(0,c.safeName)(t)+", "+e.name+")")};var c=n(154),l=r(c),s=n(65),f=n(87);function r(t){return t&&t.__esModule?t:{default:t}}},function(t,e,n){"use strict";e.__esModule=!0,e.default=function(t,e){for(var n=arguments.length,r=Array(2<n?n-2:0),o=2;o<n;o++)r[o-2]=arguments[o];function i(t){return{done:!1,value:d.fork.apply(void 0,[e].concat(r,[t]))}}function a(t){return l=t}function u(t){return s=t}var c={done:!1,value:(0,d.take)(t)},l=void 0,s=void 0;return(0,p.default)({q1:function(){return["q2",c,u]},q2:function(){return s===h.END?[f.qEnd]:l?["q3",function(t){return{done:!1,value:(0,d.cancel)(t)}}(l)]:["q1",i(s),a]},q3:function(){return["q1",i(s),a]}},"q1","takeLatest("+(0,f.safeName)(t)+", "+e.name+")")};var f=n(154),p=r(f),d=n(65),h=n(87);function r(t){return t&&t.__esModule?t:{default:t}}},function(t,e,n){"use strict";e.__esModule=!0,e.default=function(t,e,n){for(var r=arguments.length,o=Array(3<r?r-3:0),i=3;i<r;i++)o[i-3]=arguments[i];function a(t){return c=t}function u(t){return l=t}var c=void 0,l=void 0,s={done:!1,value:(0,h.actionChannel)(e,y.buffers.sliding(1))},f={done:!1,value:(0,h.call)(m.delay,t)};return(0,d.default)({q1:function(){return["q2",s,u]},q2:function(){return["q3",{done:!1,value:(0,h.take)(l)},a]},q3:function(){return c===v.END?[p.qEnd]:["q4",function(t){return{done:!1,value:h.fork.apply(void 0,[n].concat(o,[t]))}}(c)]},q4:function(){return["q2",f]}},"q1","throttle("+(0,p.safeName)(e)+", "+n.name+")")};var p=n(154),d=r(p),h=n(65),v=n(87),y=n(152),m=n(38);function r(t){return t&&t.__esModule?t:{default:t}}},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(t,e,n){return Array.isArray(t)?t[1]((n||o.default)(t[0],e)):(n||o.default)(t||{},e)};var o=r(n(503))},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=void 0;var o=r(n(153)),i=r(n(64)),a=r(n(7));function u(t){return t}function c(e,t){var n=(0,i.default)(e).map(function(t){return function(r,t){var o=1<arguments.length&&void 0!==t?t:u;return function(t,e){var n=e.type;return(0,a.default)(n,"dispatch: action should be a plain Object with type"),r===n?o(t,e):t}}(t,e[t])}),r=function(){for(var t=arguments.length,e=new Array(t),n=0;n<t;n++)e[n]=arguments[n];return function(t,n){return e.reduce(function(t,e){return e(t,n)},t)}}.apply(void 0,(0,o.default)(n));return function(){return r(0<arguments.length&&void 0!==arguments[0]?arguments[0]:t,1<arguments.length?arguments[1]:void 0)}}e.default=c},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(o){return function(){return function(r){return function(n){return function(t){if(!t||"string"!=typeof t)return!1;var e=t.split(c.NAMESPACE_SEP),n=(0,i.default)(e,1)[0],r=o._models.filter(function(t){return t.namespace===n})[0];if(r&&r.effects&&r.effects[t])return!0;return!1}(n.type)?new u.default(function(t,e){r((0,a.default)({__dva_resolve:t,__dva_reject:e},n))}):r(n)}}}};var i=r(n(505)),a=r(n(86)),u=r(n(509)),c=n(88)},function(t,e,n){var r=n(506),o=n(507),i=n(508);t.exports=function(t,e){return r(t)||o(t,e)||i()}},function(t,e){t.exports=function(t){if(Array.isArray(t))return t}},function(t,e,n){var c=n(85);t.exports=function(t,e){var n=[],r=!0,o=!1,i=void 0;try{for(var a,u=c(t);!(r=(a=u.next()).done)&&(n.push(a.value),!e||n.length!==e);r=!0);}catch(t){o=!0,i=t}finally{try{r||null==u.return||u.return()}finally{if(o)throw i}}return n}},function(t,e){t.exports=function(){throw new TypeError("Invalid attempt to destructure non-iterable instance")}},function(t,e,n){t.exports=n(510)},function(t,e,n){n(210),n(84),n(108),n(511),n(519),n(520),t.exports=n(14).Promise},function(t,e,n){"use strict";function r(){}function f(t){var e;return!(!y(t)||"function"!=typeof(e=t.then))&&e}function o(s,n){if(!s._n){s._n=!0;var r=s._c;E(function(){for(var c=s._v,l=1==s._s,t=0,e=function(t){var e,n,r,o=l?t.ok:t.fail,i=t.resolve,a=t.reject,u=t.domain;try{o?(l||(2==s._h&&U(s),s._h=1),!0===o?e=c:(u&&u.enter(),e=o(c),u&&(u.exit(),r=!0)),e===t.promise?a(P("Promise-chain cycle")):(n=f(e))?n.call(e,i,a):i(e)):a(c)}catch(t){u&&!r&&u.exit(),a(t)}};r.length>t;)e(r[t++]);s._c=[],s._n=!1,n&&!s._h&&I(s)})}}function i(t){var e=this;e._d||(e._d=!0,(e=e._w||e)._v=t,e._s=2,e._a||(e._a=e._c.slice()),o(e,!0))}var a,u,c,l,s=n(83),p=n(16),d=n(78),h=n(150),v=n(35),y=n(53),m=n(102),g=n(512),b=n(513),w=n(223),x=n(224).set,E=n(515)(),S=n(155),_=n(225),k=n(516),O=n(226),T="Promise",P=p.TypeError,C=p.process,j=C&&C.versions,R=j&&j.v8||"",A=p[T],N="process"==h(C),M=u=S.f,L=!!function(){try{var t=A.resolve(1),e=(t.constructor={})[n(17)("species")]=function(t){t(r,r)};return(N||"function"==typeof PromiseRejectionEvent)&&t.then(r)instanceof e&&0!==R.indexOf("6.6")&&-1===k.indexOf("Chrome/66")}catch(t){}}(),I=function(i){x.call(p,function(){var t,e,n,r=i._v,o=F(i);if(o&&(t=_(function(){N?C.emit("unhandledRejection",r,i):(e=p.onunhandledrejection)?e({promise:i,reason:r}):(n=p.console)&&n.error&&n.error("Unhandled promise rejection",r)}),i._h=N||F(i)?2:1),i._a=void 0,o&&t.e)throw t.v})},F=function(t){return 1!==t._h&&0===(t._a||t._c).length},U=function(e){x.call(p,function(){var t;N?C.emit("rejectionHandled",e):(t=p.onrejectionhandled)&&t({promise:e,reason:e._v})})},D=function(t){var n,r=this;if(!r._d){r._d=!0,r=r._w||r;try{if(r===t)throw P("Promise can't be resolved itself");(n=f(t))?E(function(){var e={_w:r,_d:!1};try{n.call(t,d(D,e,1),d(i,e,1))}catch(t){i.call(e,t)}}):(r._v=t,r._s=1,o(r,!1))}catch(t){i.call({_w:r,_d:!1},t)}}};L||(A=function(t){g(this,A,T,"_h"),m(t),a.call(this);try{t(d(D,this,1),d(i,this,1))}catch(t){i.call(this,t)}},(a=function(t){this._c=[],this._a=void 0,this._s=0,this._d=!1,this._v=void 0,this._h=0,this._n=!1}).prototype=n(517)(A.prototype,{then:function(t,e){var n=M(w(this,A));return n.ok="function"!=typeof t||t,n.fail="function"==typeof e&&e,n.domain=N?C.domain:void 0,this._c.push(n),this._a&&this._a.push(n),this._s&&o(this,!1),n.promise},catch:function(t){return this.then(void 0,t)}}),c=function(){var t=new a;this.promise=t,this.resolve=d(D,t,1),this.reject=d(i,t,1)},S.f=M=function(t){return t===A||t===l?new c(t):u(t)}),v(v.G+v.W+v.F*!L,{Promise:A}),n(105)(A,T),n(518)(T),l=n(14)[T],v(v.S+v.F*!L,T,{reject:function(t){var e=M(this);return(0,e.reject)(t),e.promise}}),v(v.S+v.F*(s||!L),T,{resolve:function(t){return O(s&&this===l?A:this,t)}}),v(v.S+v.F*!(L&&n(214)(function(t){A.all(t).catch(r)})),T,{all:function(t){var a=this,e=M(a),u=e.resolve,c=e.reject,n=_(function(){var r=[],o=0,i=1;b(t,!1,function(t){var e=o++,n=!1;r.push(void 0),i++,a.resolve(t).then(function(t){n||(n=!0,r[e]=t,--i||u(r))},c)}),--i||u(r)});return n.e&&c(n.v),e.promise},race:function(t){var e=this,n=M(e),r=n.reject,o=_(function(){b(t,!1,function(t){e.resolve(t).then(n.resolve,r)})});return o.e&&r(o.v),n.promise}})},function(t,e){t.exports=function(t,e,n,r){if(!(t instanceof e)||void 0!==r&&r in t)throw TypeError(n+": incorrect invocation!");return t}},function(t,e,n){var p=n(78),d=n(212),h=n(213),v=n(37),y=n(145),m=n(149),g={},b={};(e=t.exports=function(t,e,n,r,o){var i,a,u,c,l=o?function(){return t}:m(t),s=p(n,r,e?2:1),f=0;if("function"!=typeof l)throw TypeError(t+" is not iterable!");if(h(l)){for(i=y(t.length);f<i;f++)if((c=e?s(v(a=t[f])[0],a[1]):s(t[f]))===g||c===b)return c}else for(u=l.call(t);!(a=u.next()).done;)if((c=d(u,s,a.value,e))===g||c===b)return c}).BREAK=g,e.RETURN=b},function(t,e){t.exports=function(t,e,n){var r=void 0===n;switch(e.length){case 0:return r?t():t.call(n);case 1:return r?t(e[0]):t.call(n,e[0]);case 2:return r?t(e[0],e[1]):t.call(n,e[0],e[1]);case 3:return r?t(e[0],e[1],e[2]):t.call(n,e[0],e[1],e[2]);case 4:return r?t(e[0],e[1],e[2],e[3]):t.call(n,e[0],e[1],e[2],e[3])}return t.apply(n,e)}},function(t,e,n){var u=n(16),c=n(224).set,l=u.MutationObserver||u.WebKitMutationObserver,s=u.process,f=u.Promise,p="process"==n(82)(s);t.exports=function(){function t(){var t,e;for(p&&(t=s.domain)&&t.exit();n;){e=n.fn,n=n.next;try{e()}catch(t){throw n?o():r=void 0,t}}r=void 0,t&&t.enter()}var n,r,o;if(p)o=function(){s.nextTick(t)};else if(!l||u.navigator&&u.navigator.standalone)if(f&&f.resolve){var e=f.resolve(void 0);o=function(){e.then(t)}}else o=function(){c.call(u,t)};else{var i=!0,a=document.createTextNode("");new l(t).observe(a,{characterData:!0}),o=function(){a.data=i=!i}}return function(t){var e={fn:t,next:void 0};r&&(r.next=e),n||(n=e,o()),r=e}}},function(t,e,n){var r=n(16).navigator;t.exports=r&&r.userAgent||""},function(t,e,n){var o=n(52);t.exports=function(t,e,n){for(var r in e)n&&t[r]?t[r]=e[r]:o(t,r,e[r]);return t}},function(t,e,n){"use strict";var r=n(16),o=n(14),i=n(36),a=n(41),u=n(17)("species");t.exports=function(t){var e="function"==typeof o[t]?o[t]:r[t];a&&e&&!e[u]&&i.f(e,u,{configurable:!0,get:function(){return this}})}},function(t,e,n){"use strict";var r=n(35),o=n(14),i=n(16),a=n(223),u=n(226);r(r.P+r.R,"Promise",{finally:function(e){var n=a(this,o.Promise||i.Promise),t="function"==typeof e;return this.then(t?function(t){return u(n,e()).then(function(){return t})}:e,t?function(t){return u(n,e()).then(function(){throw t})}:e)}})},function(t,e,n){"use strict";var r=n(35),o=n(155),i=n(225);r(r.S,"Promise",{try:function(t){var e=o.f(this),n=i(t);return(n.e?e.reject:e.resolve)(n.v),e.promise}})},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.run=function(t,e,n,r){var o=[],i=[];for(var a in t)if(Object.prototype.hasOwnProperty.call(t,a)){var u=(0,t[a])({dispatch:(0,l.default)(n._store.dispatch,e),history:n._history},r);(0,c.isFunction)(u)?o.push(u):i.push(a)}return{funcs:o,nonFuncs:i}},e.unlisten=function(t,e){if(!t[e])return;var n=t[e],r=n.funcs,o=n.nonFuncs;(0,f.default)(0===o.length,"[app.unmodel] subscription should return unlistener function, check these subscriptions ".concat(o.join(", ")));var i=!0,a=!1,u=void 0;try{for(var c,l=(0,s.default)(r);!(i=(c=l.next()).done);i=!0){(0,c.value)()}}catch(t){a=!0,u=t}finally{try{i||null==l.return||l.return()}finally{if(a)throw u}}delete t[e]};var s=r(n(85)),f=r(n(109)),c=n(56),l=r(n(522))},function(t,e,n){"use strict";var r=n(23);Object.defineProperty(e,"__esModule",{value:!0}),e.default=function(n,r){return function(t){var e=t.type;return(0,i.default)(e,"dispatch: action should be a plain Object with type"),(0,a.default)(0!==e.indexOf("".concat(r.namespace).concat(u.NAMESPACE_SEP)),"dispatch: ".concat(e," should not be prefixed with namespace ").concat(r.namespace)),n((0,o.default)({},t,{type:(0,c.default)(e,r)}))}};var o=r(n(86)),i=r(n(7)),a=r(n(109)),u=n(88),c=r(n(222))},function(t,e,n){},function(t,e,n){},function(t,e){t.exports=function(t,e,n){return e in t?Object.defineProperty(t,e,{value:n,enumerable:!0,configurable:!0,writable:!0}):t[e]=n,t}},function(t,e,n){"use strict";n.r(e);var r=n(10),o=n.n(r),i=n(2),h=n.n(i),a=n(0),u=n.n(a);function P(){return(P=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t}).apply(this,arguments)}var c=n(156),l=n(157),C=n(110);function j(t){return"/"===t.charAt(0)?t:"/"+t}function s(t){return"/"===t.charAt(0)?t.substr(1):t}function R(t,e){return function(t,e){return new RegExp("^"+e+"(\\/|\\?|#|$)","i").test(t)}(t,e)?t.substr(e.length):t}function A(t){return"/"===t.charAt(t.length-1)?t.slice(0,-1):t}function N(t){var e=t.pathname,n=t.search,r=t.hash,o=e||"/";return n&&"?"!==n&&(o+="?"===n.charAt(0)?n:"?"+n),r&&"#"!==r&&(o+="#"===r.charAt(0)?r:"#"+r),o}function M(t,e,n,r){var o;"string"==typeof t?(o=function(t){var e=t||"/",n="",r="",o=e.indexOf("#");-1!==o&&(r=e.substr(o),e=e.substr(0,o));var i=e.indexOf("?");return-1!==i&&(n=e.substr(i),e=e.substr(0,i)),{pathname:e,search:"?"===n?"":n,hash:"#"===r?"":r}}(t)).state=e:(void 0===(o=P({},t)).pathname&&(o.pathname=""),o.search?"?"!==o.search.charAt(0)&&(o.search="?"+o.search):o.search="",o.hash?"#"!==o.hash.charAt(0)&&(o.hash="#"+o.hash):o.hash="",void 0!==e&&void 0===o.state&&(o.state=e));try{o.pathname=decodeURI(o.pathname)}catch(t){throw t instanceof URIError?new URIError('Pathname "'+o.pathname+'" could not be decoded. This is likely caused by an invalid percent-encoding.'):t}return n&&(o.key=n),r?o.pathname?"/"!==o.pathname.charAt(0)&&(o.pathname=Object(c.default)(o.pathname,r.pathname)):o.pathname=r.pathname:o.pathname||(o.pathname="/"),o}function O(t,e){return t.pathname===e.pathname&&t.search===e.search&&t.hash===e.hash&&t.key===e.key&&Object(l.default)(t.state,e.state)}function L(){var i=null;var r=[];return{setPrompt:function(t){return i=t,function(){i===t&&(i=null)}},confirmTransitionTo:function(t,e,n,r){if(null!=i){var o="function"==typeof i?i(t,e):i;"string"==typeof o?"function"==typeof n?n(o,r):r(!0):r(!1!==o)}else r(!0)},appendListener:function(t){var e=!0;function n(){e&&t.apply(void 0,arguments)}return r.push(n),function(){e=!1,r=r.filter(function(t){return t!==n})}},notifyListeners:function(){for(var t=arguments.length,e=new Array(t),n=0;n<t;n++)e[n]=arguments[n];r.forEach(function(t){return t.apply(void 0,e)})}}}var I=!("undefined"==typeof window||!window.document||!window.document.createElement);function F(t,e){e(window.confirm(t))}var U="popstate",D="hashchange";function W(){try{return window.history.state||{}}catch(t){return{}}}function f(t){void 0===t&&(t={}),I||Object(C.default)(!1);var u=window.history,c=function(){var t=window.navigator.userAgent;return(-1===t.indexOf("Android 2.")&&-1===t.indexOf("Android 4.0")||-1===t.indexOf("Mobile Safari")||-1!==t.indexOf("Chrome")||-1!==t.indexOf("Windows Phone"))&&(window.history&&"pushState"in window.history)}(),e=!(-1===window.navigator.userAgent.indexOf("Trident")),n=t,r=n.forceRefresh,l=void 0!==r&&r,o=n.getUserConfirmation,s=void 0===o?F:o,i=n.keyLength,a=void 0===i?6:i,f=t.basename?A(j(t.basename)):"";function p(t){var e=t||{},n=e.key,r=e.state,o=window.location,i=o.pathname+o.search+o.hash;return f&&(i=R(i,f)),M(i,r,n)}function d(){return Math.random().toString(36).substr(2,a)}var h=L();function v(t){P(T,t),T.length=u.length,h.notifyListeners(T.location,T.action)}function y(t){!function(t){void 0===t.state&&navigator.userAgent.indexOf("CriOS")}(t)&&b(p(t.state))}function m(){b(p(W()))}var g=!1;function b(e){if(g)g=!1,v();else{h.confirmTransitionTo(e,"POP",s,function(t){t?v({action:"POP",location:e}):function(t){var e=T.location,n=x.indexOf(e.key);-1===n&&(n=0);var r=x.indexOf(t.key);-1===r&&(r=0);var o=n-r;o&&(g=!0,S(o))}(e)})}}var w=p(W()),x=[w.key];function E(t){return f+N(t)}function S(t){u.go(t)}var _=0;function k(t){1===(_+=t)&&1===t?(window.addEventListener(U,y),e&&window.addEventListener(D,m)):0===_&&(window.removeEventListener(U,y),e&&window.removeEventListener(D,m))}var O=!1;var T={length:u.length,action:"POP",location:w,createHref:E,push:function(t,e){var a=M(t,e,d(),T.location);h.confirmTransitionTo(a,"PUSH",s,function(t){if(t){var e=E(a),n=a.key,r=a.state;if(c)if(u.pushState({key:n,state:r},null,e),l)window.location.href=e;else{var o=x.indexOf(T.location.key),i=x.slice(0,-1===o?0:o+1);i.push(a.key),x=i,v({action:"PUSH",location:a})}else window.location.href=e}})},replace:function(t,e){var i=M(t,e,d(),T.location);h.confirmTransitionTo(i,"REPLACE",s,function(t){if(t){var e=E(i),n=i.key,r=i.state;if(c)if(u.replaceState({key:n,state:r},null,e),l)window.location.replace(e);else{var o=x.indexOf(T.location.key);-1!==o&&(x[o]=i.key),v({action:"REPLACE",location:i})}else window.location.replace(e)}})},go:S,goBack:function(){S(-1)},goForward:function(){S(1)},block:function(t){void 0===t&&(t=!1);var e=h.setPrompt(t);return O||(k(1),O=!0),function(){return O&&(O=!1,k(-1)),e()}},listen:function(t){var e=h.appendListener(t);return k(1),function(){k(-1),e()}}};return T}var T="hashchange",z={hashbang:{encodePath:function(t){return"!"===t.charAt(0)?t:"!/"+s(t)},decodePath:function(t){return"!"===t.charAt(0)?t.substr(1):t}},noslash:{encodePath:s,decodePath:j},slash:{encodePath:j,decodePath:j}};function H(){var t=window.location.href,e=t.indexOf("#");return-1===e?"":t.substring(e+1)}function q(t){var e=window.location.href.indexOf("#");window.location.replace(window.location.href.slice(0,0<=e?e:0)+"#"+t)}function p(t){void 0===t&&(t={}),I||Object(C.default)(!1);var e=window.history,n=(window.navigator.userAgent.indexOf("Firefox"),t),r=n.getUserConfirmation,a=void 0===r?F:r,o=n.hashType,i=void 0===o?"slash":o,u=t.basename?A(j(t.basename)):"",c=z[i],l=c.encodePath,s=c.decodePath;function f(){var t=s(H());return u&&(t=R(t,u)),M(t)}var p=L();function d(t){P(k,t),k.length=e.length,p.notifyListeners(k.location,k.action)}var h=!1,v=null;function y(){var t=H(),e=l(t);if(t!==e)q(e);else{var n=f(),r=k.location;if(!h&&O(r,n))return;if(v===N(n))return;v=null,function(e){if(h)h=!1,d();else{p.confirmTransitionTo(e,"POP",a,function(t){t?d({action:"POP",location:e}):function(t){var e=k.location,n=w.lastIndexOf(N(e));-1===n&&(n=0);var r=w.lastIndexOf(N(t));-1===r&&(r=0);var o=n-r;o&&(h=!0,x(o))}(e)})}}(n)}}var m=H(),g=l(m);m!==g&&q(g);var b=f(),w=[N(b)];function x(t){e.go(t)}var E=0;function S(t){1===(E+=t)&&1===t?window.addEventListener(T,y):0===E&&window.removeEventListener(T,y)}var _=!1;var k={length:e.length,action:"POP",location:b,createHref:function(t){return"#"+l(u+N(t))},push:function(t,e){var i=M(t,void 0,void 0,k.location);p.confirmTransitionTo(i,"PUSH",a,function(t){if(t){var e=N(i),n=l(u+e);if(H()!==n){v=e,function(t){window.location.hash=t}(n);var r=w.lastIndexOf(N(k.location)),o=w.slice(0,-1===r?0:r+1);o.push(e),w=o,d({action:"PUSH",location:i})}else d()}})},replace:function(t,e){var o=M(t,void 0,void 0,k.location);p.confirmTransitionTo(o,"REPLACE",a,function(t){if(t){var e=N(o),n=l(u+e);H()!==n&&(v=e,q(n));var r=w.indexOf(N(k.location));-1!==r&&(w[r]=e),d({action:"REPLACE",location:o})}})},go:x,goBack:function(){x(-1)},goForward:function(){x(1)},block:function(t){void 0===t&&(t=!1);var e=p.setPrompt(t);return _||(S(1),_=!0),function(){return _&&(_=!1,S(-1)),e()}},listen:function(t){var e=p.appendListener(t);return S(1),function(){S(-1),e()}}};return k}function m(t,e,n){return Math.min(Math.max(t,e),n)}var d=n(7),v=n.n(d),y=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function g(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var b,w=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(x,b=h.a.Component),x.prototype.getChildContext=function(){return{router:y({},this.context.router,{history:this.props.history,route:{location:this.props.history.location,match:this.state.match}})}},x.prototype.computeMatch=function(t){return{path:"/",url:"/",params:{},isExact:"/"===t}},x.prototype.componentWillMount=function(){var t=this,e=this.props,n=e.children,r=e.history;v()(null==n||1===h.a.Children.count(n),"A <Router> may have only one child element"),this.unlisten=r.listen(function(){t.setState({match:t.computeMatch(r.location.pathname)})})},x.prototype.componentWillReceiveProps=function(t){o()(this.props.history===t.history,"You cannot change <Router history>")},x.prototype.componentWillUnmount=function(){this.unlisten()},x.prototype.render=function(){var t=this.props.children;return t?h.a.Children.only(t):null},x);function x(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,x);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=g(this,b.call.apply(b,[this].concat(r)))).state={match:e.computeMatch(e.props.history.location.pathname)},g(e,t)}w.propTypes={history:u.a.object.isRequired,children:u.a.node},w.contextTypes={router:u.a.object},w.childContextTypes={router:u.a.object.isRequired};var E=w,S=E;function _(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var k,B=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(V,k=h.a.Component),V.prototype.componentWillMount=function(){o()(!this.props.history,"<BrowserRouter> ignores the history prop. To use a custom history, use `import { Router }` instead of `import { BrowserRouter as Router }`.")},V.prototype.render=function(){return h.a.createElement(S,{history:this.history,children:this.props.children})},V);function V(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,V);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=_(this,k.call.apply(k,[this].concat(r)))).history=f(e.props),_(e,t)}B.propTypes={basename:u.a.string,forceRefresh:u.a.bool,getUserConfirmation:u.a.func,keyLength:u.a.number,children:u.a.node};var $=B;function G(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var Y,K=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(Q,Y=h.a.Component),Q.prototype.componentWillMount=function(){o()(!this.props.history,"<HashRouter> ignores the history prop. To use a custom history, use `import { Router }` instead of `import { HashRouter as Router }`.")},Q.prototype.render=function(){return h.a.createElement(S,{history:this.history,children:this.props.children})},Q);function Q(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,Q);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=G(this,Y.call.apply(Y,[this].concat(r)))).history=p(e.props),G(e,t)}K.propTypes={basename:u.a.string,getUserConfirmation:u.a.func,hashType:u.a.oneOf(["hashbang","noslash","slash"]),children:u.a.node};var X=K,J=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function Z(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var tt,et=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(nt,tt=h.a.Component),nt.prototype.render=function(){var t=this.props,e=(t.replace,t.to),n=t.innerRef,r=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(t,["replace","to","innerRef"]);v()(this.context.router,"You should not use <Link> outside a <Router>"),v()(void 0!==e,'You must specify the "to" property');var o=this.context.router.history,i="string"==typeof e?M(e,null,null,o.location):e,a=o.createHref(i);return h.a.createElement("a",J({},r,{onClick:this.handleClick,href:a,ref:n}))},nt);function nt(){var t,i;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,nt);for(var e=arguments.length,n=Array(e),r=0;r<e;r++)n[r]=arguments[r];return(t=i=Z(this,tt.call.apply(tt,[this].concat(n)))).handleClick=function(t){if(i.props.onClick&&i.props.onClick(t),!t.defaultPrevented&&0===t.button&&!i.props.target&&!function(t){return!!(t.metaKey||t.altKey||t.ctrlKey||t.shiftKey)}(t)){t.preventDefault();var e=i.context.router.history,n=i.props,r=n.replace,o=n.to;r?e.replace(o):e.push(o)}},Z(i,t)}et.propTypes={onClick:u.a.func,target:u.a.string,replace:u.a.bool,to:u.a.oneOfType([u.a.string,u.a.object]).isRequired,innerRef:u.a.oneOfType([u.a.string,u.a.func])},et.defaultProps={replace:!1},et.contextTypes={router:u.a.shape({history:u.a.shape({push:u.a.func.isRequired,replace:u.a.func.isRequired,createHref:u.a.func.isRequired}).isRequired}).isRequired};var rt=et;function ot(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}var it,at=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(ut,it=h.a.Component),ut.prototype.componentWillMount=function(){o()(!this.props.history,"<MemoryRouter> ignores the history prop. To use a custom history, use `import { Router }` instead of `import { MemoryRouter as Router }`.")},ut.prototype.render=function(){return h.a.createElement(E,{history:this.history,children:this.props.children})},ut);function ut(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,ut);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=ot(this,it.call.apply(it,[this].concat(r)))).history=function(t){void 0===t&&(t={});var e=t,o=e.getUserConfirmation,n=e.initialEntries,r=void 0===n?["/"]:n,i=e.initialIndex,a=void 0===i?0:i,u=e.keyLength,c=void 0===u?6:u,l=L();function s(t){P(y,t),y.length=y.entries.length,l.notifyListeners(y.location,y.action)}function f(){return Math.random().toString(36).substr(2,c)}var p=m(a,0,r.length-1),d=r.map(function(t){return M(t,void 0,"string"==typeof t?f():t.key||f())}),h=N;function v(t){var e=m(y.index+t,0,y.entries.length-1),n=y.entries[e];l.confirmTransitionTo(n,"POP",o,function(t){t?s({action:"POP",location:n,index:e}):s()})}var y={length:d.length,action:"POP",location:d[p],index:p,entries:d,createHref:h,push:function(t,e){var r=M(t,e,f(),y.location);l.confirmTransitionTo(r,"PUSH",o,function(t){if(t){var e=y.index+1,n=y.entries.slice(0);n.length>e?n.splice(e,n.length-e,r):n.push(r),s({action:"PUSH",location:r,index:e,entries:n})}})},replace:function(t,e){var n=M(t,e,f(),y.location);l.confirmTransitionTo(n,"REPLACE",o,function(t){t&&s({action:"REPLACE",location:y.entries[y.index]=n})})},go:v,goBack:function(){v(-1)},goForward:function(){v(1)},canGo:function(t){var e=y.index+t;return 0<=e&&e<y.entries.length},block:function(t){return void 0===t&&(t=!1),l.setPrompt(t)},listen:function(t){return l.appendListener(t)}};return y}(e.props),ot(e,t)}at.propTypes={initialEntries:u.a.array,initialIndex:u.a.number,getUserConfirmation:u.a.func,keyLength:u.a.number,children:u.a.node};var ct=at,lt=n(111),st=n.n(lt),ft={},pt=0,dt=function(t,e,n){var r=1<arguments.length&&void 0!==e?e:{},o=n;"string"==typeof r&&(r={path:r});var i=r,a=i.path,u=i.exact,c=void 0!==u&&u,l=i.strict,s=void 0!==l&&l,f=i.sensitive;if(null==a)return o;var p=function(t,e){var n=""+e.end+e.strict+e.sensitive,r=ft[n]||(ft[n]={});if(r[t])return r[t];var o=[],i={re:st()(t,o,e),keys:o};return pt<1e4&&(r[t]=i,pt++),i}(a,{end:c,strict:s,sensitive:void 0!==f&&f}),d=p.re,h=p.keys,v=d.exec(t);if(!v)return null;var y=v[0],m=v.slice(1),g=t===y;return c&&!g?null:{path:a,url:"/"===a&&""===y?"/":y,isExact:g,params:h.reduce(function(t,e,n){return t[e.name]=m[n],t},{})}},ht=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function vt(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}function yt(t){return 0===h.a.Children.count(t)}var mt,gt=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(bt,mt=h.a.Component),bt.prototype.getChildContext=function(){return{router:ht({},this.context.router,{route:{location:this.props.location||this.context.router.route.location,match:this.state.match}})}},bt.prototype.computeMatch=function(t,e){var n=t.computedMatch,r=t.location,o=t.path,i=t.strict,a=t.exact,u=t.sensitive;if(n)return n;v()(e,"You should not use <Route> or withRouter() outside a <Router>");var c=e.route,l=(r||c.location).pathname;return dt(l,{path:o,strict:i,exact:a,sensitive:u},c.match)},bt.prototype.componentWillMount=function(){o()(!(this.props.component&&this.props.render),"You should not use <Route component> and <Route render> in the same route; <Route render> will be ignored"),o()(!(this.props.component&&this.props.children&&!yt(this.props.children)),"You should not use <Route component> and <Route children> in the same route; <Route children> will be ignored"),o()(!(this.props.render&&this.props.children&&!yt(this.props.children)),"You should not use <Route render> and <Route children> in the same route; <Route children> will be ignored")},bt.prototype.componentWillReceiveProps=function(t,e){o()(!(t.location&&!this.props.location),'<Route> elements should not change from uncontrolled to controlled (or vice versa). You initially used no "location" prop and then provided one on a subsequent render.'),o()(!(!t.location&&this.props.location),'<Route> elements should not change from controlled to uncontrolled (or vice versa). You provided a "location" prop initially but omitted it on a subsequent render.'),this.setState({match:this.computeMatch(t,e.router)})},bt.prototype.render=function(){var t=this.state.match,e=this.props,n=e.children,r=e.component,o=e.render,i=this.context.router,a=i.history,u=i.route,c=i.staticContext,l={match:t,location:this.props.location||u.location,history:a,staticContext:c};return r?t?h.a.createElement(r,l):null:o?t?o(l):null:"function"==typeof n?n(l):n&&!yt(n)?h.a.Children.only(n):null},bt);function bt(){var t,e;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,bt);for(var n=arguments.length,r=Array(n),o=0;o<n;o++)r[o]=arguments[o];return(t=e=vt(this,mt.call.apply(mt,[this].concat(r)))).state={match:e.computeMatch(e.props,e.context.router)},vt(e,t)}gt.propTypes={computedMatch:u.a.object,path:u.a.string,exact:u.a.bool,strict:u.a.bool,sensitive:u.a.bool,component:u.a.func,render:u.a.func,children:u.a.oneOfType([u.a.func,u.a.node]),location:u.a.object},gt.contextTypes={router:u.a.shape({history:u.a.object.isRequired,route:u.a.object.isRequired,staticContext:u.a.object})},gt.childContextTypes={router:u.a.object.isRequired};var wt=gt,xt=wt,Et=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t},St="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t};function _t(t){var o=t.to,e=t.exact,n=t.strict,r=t.location,i=t.activeClassName,a=t.className,u=t.activeStyle,c=t.style,l=t.isActive,s=t["aria-current"],f=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(t,["to","exact","strict","location","activeClassName","className","activeStyle","style","isActive","aria-current"]),p="object"===(void 0===o?"undefined":St(o))?o.pathname:o,d=p&&p.replace(/([.+*?=^!:${}()[\]|/\\])/g,"\\$1");return h.a.createElement(xt,{path:d,exact:e,strict:n,location:r,children:function(t){var e=t.location,n=t.match,r=!!(l?l(n,e):n);return h.a.createElement(rt,Et({to:o,className:r?[a,i].filter(function(t){return t}).join(" "):a,style:r?Et({},c,u):c,"aria-current":r&&s||null},f))}})}_t.propTypes={to:rt.propTypes.to,exact:u.a.bool,strict:u.a.bool,location:u.a.object,activeClassName:u.a.string,className:u.a.string,activeStyle:u.a.object,style:u.a.object,isActive:u.a.func,"aria-current":u.a.oneOf(["page","step","location","date","time","true"])},_t.defaultProps={activeClassName:"active","aria-current":"page"};var kt=_t;var Ot,Tt=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(Pt,Ot=h.a.Component),Pt.prototype.enable=function(t){this.unblock&&this.unblock(),this.unblock=this.context.router.history.block(t)},Pt.prototype.disable=function(){this.unblock&&(this.unblock(),this.unblock=null)},Pt.prototype.componentWillMount=function(){v()(this.context.router,"You should not use <Prompt> outside a <Router>"),this.props.when&&this.enable(this.props.message)},Pt.prototype.componentWillReceiveProps=function(t){t.when?this.props.when&&this.props.message===t.message||this.enable(t.message):this.disable()},Pt.prototype.componentWillUnmount=function(){this.disable()},Pt.prototype.render=function(){return null},Pt);function Pt(){return function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,Pt),function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,Ot.apply(this,arguments))}Tt.propTypes={when:u.a.bool,message:u.a.oneOfType([u.a.func,u.a.string]).isRequired},Tt.defaultProps={when:!0},Tt.contextTypes={router:u.a.shape({history:u.a.shape({block:u.a.func.isRequired}).isRequired}).isRequired};var Ct=Tt,jt={},Rt=0,At=function(t,e){var n=0<arguments.length&&void 0!==t?t:"/",r=1<arguments.length&&void 0!==e?e:{};return"/"===n?n:function(t){var e=t,n=jt[e]||(jt[e]={});if(n[t])return n[t];var r=st.a.compile(t);return Rt<1e4&&(n[t]=r,Rt++),r}(n)(r,{pretty:!0})},Nt=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};var Mt,Lt=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(It,Mt=h.a.Component),It.prototype.isStatic=function(){return this.context.router&&this.context.router.staticContext},It.prototype.componentWillMount=function(){v()(this.context.router,"You should not use <Redirect> outside a <Router>"),this.isStatic()&&this.perform()},It.prototype.componentDidMount=function(){this.isStatic()||this.perform()},It.prototype.componentDidUpdate=function(t){var e=M(t.to),n=M(this.props.to);O(e,n)?o()(!1,"You tried to redirect to the same route you're currently on: \""+n.pathname+n.search+'"'):this.perform()},It.prototype.computeTo=function(t){var e=t.computedMatch,n=t.to;return e?"string"==typeof n?At(n,e.params):Nt({},n,{pathname:At(n.pathname,e.params)}):n},It.prototype.perform=function(){var t=this.context.router.history,e=this.props.push,n=this.computeTo(this.props);e?t.push(n):t.replace(n)},It.prototype.render=function(){return null},It);function It(){return function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,It),function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,Mt.apply(this,arguments))}Lt.propTypes={computedMatch:u.a.object,push:u.a.bool,from:u.a.string,to:u.a.oneOfType([u.a.string,u.a.object]).isRequired},Lt.defaultProps={push:!1},Lt.contextTypes={router:u.a.shape({history:u.a.shape({push:u.a.func.isRequired,replace:u.a.func.isRequired}).isRequired,staticContext:u.a.object}).isRequired};var Ft=Lt,Ut=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function Dt(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}function Wt(t){return"/"===t.charAt(0)?t:"/"+t}function zt(t,e){return t?Ut({},e,{pathname:Wt(t)+e.pathname}):e}function Ht(t){return"string"==typeof t?t:N(t)}function qt(t){return function(){v()(!1,"You cannot %s with <StaticRouter>",t)}}function Bt(){}var Vt,$t=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(Gt,Vt=h.a.Component),Gt.prototype.getChildContext=function(){return{router:{staticContext:this.props.context}}},Gt.prototype.componentWillMount=function(){o()(!this.props.history,"<StaticRouter> ignores the history prop. To use a custom history, use `import { Router }` instead of `import { StaticRouter as Router }`.")},Gt.prototype.render=function(){var t=this.props,e=t.basename,n=(t.context,t.location),r=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(t,["basename","context","location"]),o={createHref:this.createHref,action:"POP",location:function(t,e){if(!t)return e;var n=Wt(t);return 0!==e.pathname.indexOf(n)?e:Ut({},e,{pathname:e.pathname.substr(n.length)})}(e,M(n)),push:this.handlePush,replace:this.handleReplace,go:qt("go"),goBack:qt("goBack"),goForward:qt("goForward"),listen:this.handleListen,block:this.handleBlock};return h.a.createElement(E,Ut({},r,{history:o}))},Gt);function Gt(){var t,o;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,Gt);for(var e=arguments.length,n=Array(e),r=0;r<e;r++)n[r]=arguments[r];return(t=o=Dt(this,Vt.call.apply(Vt,[this].concat(n)))).createHref=function(t){return Wt(o.props.basename+Ht(t))},o.handlePush=function(t){var e=o.props,n=e.basename,r=e.context;r.action="PUSH",r.location=zt(n,M(t)),r.url=Ht(r.location)},o.handleReplace=function(t){var e=o.props,n=e.basename,r=e.context;r.action="REPLACE",r.location=zt(n,M(t)),r.url=Ht(r.location)},o.handleListen=function(){return Bt},o.handleBlock=function(){return Bt},Dt(o,t)}$t.propTypes={basename:u.a.string,context:u.a.object.isRequired,location:u.a.oneOfType([u.a.string,u.a.object])},$t.defaultProps={basename:"",location:"/"},$t.childContextTypes={router:u.a.object.isRequired};var Yt=$t;var Kt,Qt=(function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(Xt,Kt=h.a.Component),Xt.prototype.componentWillMount=function(){v()(this.context.router,"You should not use <Switch> outside a <Router>")},Xt.prototype.componentWillReceiveProps=function(t){o()(!(t.location&&!this.props.location),'<Switch> elements should not change from uncontrolled to controlled (or vice versa). You initially used no "location" prop and then provided one on a subsequent render.'),o()(!(!t.location&&this.props.location),'<Switch> elements should not change from controlled to uncontrolled (or vice versa). You provided a "location" prop initially but omitted it on a subsequent render.')},Xt.prototype.render=function(){var c=this.context.router.route,t=this.props.children,l=this.props.location||c.location,s=void 0,f=void 0;return h.a.Children.forEach(t,function(t){if(null==s&&h.a.isValidElement(t)){var e=t.props,n=e.path,r=e.exact,o=e.strict,i=e.sensitive,a=e.from,u=n||a;f=t,s=dt(l.pathname,{path:u,exact:r,strict:o,sensitive:i},c.match)}}),s?h.a.cloneElement(f,{location:l,computedMatch:s}):null},Xt);function Xt(){return function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,Xt),function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,Kt.apply(this,arguments))}Qt.contextTypes={router:u.a.shape({route:u.a.object.isRequired}).isRequired},Qt.propTypes={children:u.a.node,location:u.a.object};var Jt=Qt,Zt=At,te=dt,ee=n(112),ne=n.n(ee),re=Object.assign||function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(t[r]=n[r])}return t};function oe(r){function t(t){var e=t.wrappedComponentRef,n=function(t,e){var n={};for(var r in t)0<=e.indexOf(r)||Object.prototype.hasOwnProperty.call(t,r)&&(n[r]=t[r]);return n}(t,["wrappedComponentRef"]);return h.a.createElement(wt,{children:function(t){return h.a.createElement(r,re({},n,t,{ref:e}))}})}return t.displayName="withRouter("+(r.displayName||r.name)+")",t.WrappedComponent=r,t.propTypes={wrappedComponentRef:u.a.func},ne()(t,r)}n.d(e,"BrowserRouter",function(){return $}),n.d(e,"HashRouter",function(){return X}),n.d(e,"Link",function(){return rt}),n.d(e,"MemoryRouter",function(){return ct}),n.d(e,"NavLink",function(){return kt}),n.d(e,"Prompt",function(){return Ct}),n.d(e,"Redirect",function(){return Ft}),n.d(e,"Route",function(){return xt}),n.d(e,"Router",function(){return S}),n.d(e,"StaticRouter",function(){return Yt}),n.d(e,"Switch",function(){return Jt}),n.d(e,"generatePath",function(){return Zt}),n.d(e,"matchPath",function(){return te}),n.d(e,"withRouter",function(){return oe})},function(t,e,n){"use strict";n.r(e);n(236);var r=n(2),a=n.n(r),o=n(89),i=(n(418),n(66)),u=n.n(i),c=n(67),l=n.n(c),s=n(68),f=n.n(s),p=n(69),d=n.n(p),h=n(70),v=n.n(h),y=n(71),m=n.n(y),g=function(t){function i(){var t,e;u()(this,i);for(var n=arguments.length,r=new Array(n),o=0;o<n;o++)r[o]=arguments[o];return(e=f()(this,(t=d()(i)).call.apply(t,[this].concat(r)))).state={},e}return v()(i,t),l()(i,[{key:"componentDidMount",value:function(){(0,this.props.dispatch)({type:"weather/queryList"})}},{key:"render",value:function(){var t=this.props.weather,e=t.city,n=t.data,r=(n=n||[]).map(function(t,e){return a.a.createElement("li",{key:e},a.a.createElement("span",null,t.day),a.a.createElement("span",null,t.date),a.a.createElement("span",null,t.week),a.a.createElement("span",null,t.wea))});return a.a.createElement("div",null,a.a.createElement("p",null,e),a.a.createElement("ul",null,r))}}]),i}(r.Component),b=Object(y.connect)(function(t){return{weather:t.weather}})(g),w=(n(103),n(523),function(t){function e(t){return u()(this,e),f()(this,d()(e).call(this,t))}return v()(e,t),l()(e,[{key:"componentWillMount",value:function(){}},{key:"componentDidMount",value:function(){}},{key:"componentWillUnmount",value:function(){}},{key:"render",value:function(){var t=this.props,e=t.onMinusClick,n=t.value,r=t.onIncreaseClick,o=t.onAsyncIncreaseClick;return a.a.createElement("div",{className:"main-wrap"},a.a.createElement("p",null,n),a.a.createElement("button",{onClick:r},"+"),a.a.createElement("button",{onClick:e},"-"),a.a.createElement("button",{onClick:o},"异步+"))}}]),e}(r.Component));var x={type:"counter/add"},E={type:"counter/minus"},S={type:"counter/asyncAdd"};var _,k,O,T,P=Object(y.connect)(function(t){return t.counter},function(t){return{onIncreaseClick:function(){return t(x)},onMinusClick:function(){return t(E)},onAsyncIncreaseClick:function(){return t(S)}}})(w),C=(n(524),{count:0}),j={color:"red"},R=(_={countObj:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:C;switch((1<arguments.length?arguments[1]:void 0).type){case"add":(t=Object.assign({},t)).count=t.count+1;break;case"min":(t=Object.assign({},t)).count=t.count-1}return t},colorObj:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:j;switch((1<arguments.length?arguments[1]:void 0).type){case"green":(t=Object.assign({},t)).color="green";break;case"blue":(t=Object.assign({},t)).color="blue"}return t}},function(){var n=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{},r=1<arguments.length?arguments[1]:void 0;return Object.keys(_).reduce(function(t,e){return t[e]=_[e](n[e],r),t},{})}),A=(k=R,T=[],N({}),{getState:function(){return O},dispatch:N,subscribe:function(e){return T.push(e),function(){T=T.filter(function(t){return t!==e})}}});function N(t){O=k(O,t),T.forEach(function(t){return t()})}var M=function(t){function n(t){var e;return u()(this,n),(e=f()(this,d()(n).call(this,t))).state=A.getState(),e}return v()(n,t),l()(n,[{key:"componentWillMount",value:function(){}},{key:"componentDidMount",value:function(){this.unscribe=A.subscribe(this.update.bind(this))}},{key:"componentWillUnmount",value:function(){this.unscribe()}},{key:"update",value:function(){this.setState(A.getState())}},{key:"add",value:function(){A.dispatch({type:"add",count:2})}},{key:"min",value:function(){A.dispatch({type:"min",count:2})}},{key:"green",value:function(){A.dispatch({type:"green",count:2})}},{key:"blue",value:function(){A.dispatch({type:"blue",count:2})}},{key:"render",value:function(){var t=this.state,e=t.countObj,n=t.colorObj;return console.log(e.count),a.a.createElement("div",{className:"main-wrap"},a.a.createElement("p",null,"手写redux 成功！！！ "),a.a.createElement("p",{style:{color:n.color}},e.count),a.a.createElement("button",{onClick:this.add.bind(this)},"+"),a.a.createElement("button",{onClick:this.min.bind(this)},"-"),a.a.createElement("button",{onClick:this.blue.bind(this)},"blue"),a.a.createElement("button",{onClick:this.green.bind(this)},"green"))}}]),n}(r.Component),L=n(234),I=n.n(L),F=n(73),U=n.n(F);function D(){return function(n,r,o){var i=new XMLHttpRequest;return new Promise(function(t,e){i.onreadystatechange=function(){4===i.readyState&&(200===i.status?t(i.responseText):e(i.status))},i.open(n,r),i.send(o)})}("GET","https://www.tianqiapi.com/api/?version=v1&cityid=101110101&appid=1001&appsecret=5566")}var W={namespace:"weather",state:{data:[],city:""},effects:{queryList:U.a.mark(function t(e,n){var r,o,i,a,u,c;return U.a.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return r=n.call,o=n.put,t.prev=1,t.next=4,r(D);case 4:return i=t.sent,a=i?JSON.parse(i):{},u=a.city,c=a.data,t.next=8,o({type:"updateList",payload:{data:c,city:u}});case 8:t.next=14;break;case 10:t.prev=10,t.t0=t.catch(1),console.error(t.t0.stack),message.error(t.t0.stack);case 14:case"end":return t.stop()}},t,null,[[1,10]])})},reducers:{updateList:function(t,e){var n=e.payload;return I()({},t,n)}}},z={namespace:"counter",state:{value:0},effects:{asyncAdd:U.a.mark(function t(e,n){var r;return U.a.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return r=n.put,t.next=3,r({type:"add",payload:{}});case 3:case"end":return t.stop()}},t)})},reducers:{add:function(t,e){e.payload;return{value:t.value+1}},minus:function(t,e){e.payload;return{value:t.value-1}}}},H=(n(103),m()());H.model(W),H.model(z),H.router(function(t){var e=t.history;return a.a.createElement(o.Router,{history:e},a.a.createElement(a.a.Fragment,null,a.a.createElement(o.Route,{path:"/",exact:!0,component:M}),a.a.createElement(o.Route,{path:"/counter",component:P}),a.a.createElement(o.Route,{path:"/weather",component:b})))}),H.start("#root")}]);```
|
zzxxasp/DolTool
|
zzxxasp/DolTool
CardListActivity.java
```package com.key.doltool.activity.adventure.card;
import android.app.Activity;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.os.Parcelable;
import android.util.Log;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.Menu;
import android.view.View;
import android.widget.AdapterView;
import android.widget.Button;
import android.widget.EditText;
import android.widget.GridView;
import android.widget.LinearLayout;
import android.widget.ListView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import androidx.appcompat.widget.Toolbar;
import com.google.gson.Gson;
import com.key.doltool.R;
import com.key.doltool.activity.BaseAdventureActivity;
import com.key.doltool.adapter.CardAdapter;
import com.key.doltool.adapter.ListWordAdapter;
import com.key.doltool.adapter.item.NameValueAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.base.NameValueItem;
import com.key.doltool.data.parse.Deck;
import com.key.doltool.data.sqlite.Card;
import com.key.doltool.data.sqlite.CardCombo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.NumberUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.SlideUp;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVObject;
import cn.leancloud.AVUser;
import io.reactivex.functions.Consumer;
public class CardListActivity extends BaseAdventureActivity {
@BindView(R.id.null_txt)
TextView txt;
@BindView(R.id.gridview)
GridView gridview;
@BindView(R.id.pop_card)
View slideView;
@BindView(R.id.base)
TextView base;
@BindView(R.id.card_number)
TextView card_number;
@BindView(R.id.card_point)
TextView card_point;
@BindView(R.id.add_list)
ListView add_list;
@BindView(R.id.confrim)
Button positive;
@BindView(R.id.cancel)
Button negative;
private SlideUp slideUp;
private Dialog alert, dialog;
//总卡组列表
private List<Card> list;
//我的卡组列表
private List<Card> temp;
//搜索条件执行后的列表
private List<Card> search;
private DefaultDAO dao;
private SRPUtil srp;
private String select_txt = "";
private CardAdapter mGridAdapter;
private boolean return_flag = false;
private boolean back_flag = false;
/**
* comboList
**/
private List<CardCombo> comboList = new ArrayList<>();
/**
* 自己牌组的Combo总数
**/
private List<CardCombo> selfCombo = new ArrayList<>();
private int limit = 0;
private int poiont_total;
private int value;
private List<NameValueItem> in_list = new ArrayList<>();
private ViewHandler mHandler;
@Override
protected void onActivityResult(int requestCode, int resultCode, Intent data) {
super.onActivityResult(requestCode, resultCode, data);
if (resultCode != Activity.RESULT_OK) {
return;
}
switch (requestCode) {
case 100:
DialogUtil.show(context, alert);
back_flag = true;
setLimit(data.getStringExtra("limit"));
new Thread(mTask).start();
break;
}
}
@Override
public int getContentViewId() {
return R.layout.card_list_show;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
srp = SRPUtil.getInstance(getApplicationContext());
dao = SRPUtil.getDAO(getApplicationContext());
dialog = new DialogEvent().itemDialog(this, getResources().getString(R.string.common_wait));
list = new ArrayList<>();
slideUp=new SlideUp(slideView);
slideUp.hideImmediately();
mHandler = new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what) {
case 0:
//更新页面
DialogUtil.dismiss(context, alert);
Parcelable state = gridview.onSaveInstanceState();
mGridAdapter = new CardAdapter(list, CardListActivity.this);
gridview.setAdapter(mGridAdapter);
gridview.onRestoreInstanceState(state);
if (return_flag) {
Toast.makeText(getApplicationContext(), R.string.search_rest, Toast.LENGTH_LONG).show();
return_flag = false;
}
if (back_flag) {
back_flag = false;
}
break;
case 1:
//战斗力计算成功显示明细窗体
if(!slideUp.isVisible()){
showBattle(msg.obj);
}
break;
case 2:
DialogUtil.dismiss(context, alert);
if (list.size() == 0) {
txt.setVisibility(View.VISIBLE);
} else {
txt.setVisibility(View.GONE);
}
mGridAdapter = new CardAdapter(search, CardListActivity.this);
gridview.setAdapter(mGridAdapter);
break;
}
}
});
findView();
setListener();
new Thread(mTasks).start();
}
private void findView() {
alert = new DialogEvent().showLoading(this);
flag = false;
initToolBar(onMenuItemClick);
toolbar.setTitle(R.string.card_title);
DialogUtil.show(context, alert);
}
public void select(String select) {
//类型，点数范围，名称
//全部~X~0-10
select_txt = select;
Log.i("s", "" + select);
String[] temp = select.split("~");
String type = "", name = "", range = "", if_txt = "", range_temp[];
List<String> if_list = new ArrayList<>();
if (!temp[0].equals("全部")) {
type = temp[0];
}
if (!StringUtil.isNull(temp[1])) {
name = temp[1];
}
if (!temp[2].equals("0-10")) {
range = temp[2];
}
if (!StringUtil.isNull(name)) {
if_txt += "name like ?";
if_list.add("%" + name + "%");
} else {
if_txt += "id>?";
if_list.add("0");
}
if (!StringUtil.isNull(type)) {
if_txt += " and type=?";
if_list.add(type);
}
if (!StringUtil.isNull(range)) {
range_temp = range.split("-");
int min = Integer.parseInt(range_temp[0]);
int max = Integer.parseInt(range_temp[1]);
if (min == max) {
if (min == 0) {
min = 1;
}
if_list.add(min + "");
if_txt += " and point=?";
} else {
max += 1;
if_list.add(min + "");
if_list.add(max + "");
if_txt += " and point>? and point<?";
}
}
DialogUtil.show(context, alert);
final String if_txt_final = if_txt;
final List<String> if_final_list = if_list;
new Thread(new Runnable() {
@Override
public void run() {
search = srp.select(Card.class, false, if_txt_final, StringUtil.listToArray(if_final_list), null, null, "flag desc,point desc,type desc", null);
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
mHandler.sendMessage(mHandler.obtainMessage(2));
}
}).start();
}
private void setListener() {
mGridAdapter = new CardAdapter(list, this);
gridview.setAdapter(mGridAdapter);
gridview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> arg0, View arg1,
int position, long arg3) {
if (mGridAdapter.getItem(position).flag == 0) {
Card trove = new Card();
trove.flag = 1;
mGridAdapter.getItem(position).flag = 1;
dao.update(trove, new String[]{"flag"}, "id=?", new String[]{"" + mGridAdapter.getItem(position).id});
} else {
Card trove = new Card();
trove.flag = 0;
mGridAdapter.getItem(position).flag = 0;
dao.update(trove, new String[]{"flag"}, "id=?", new String[]{"" + mGridAdapter.getItem(position).id});
}
deckChange(position);
mGridAdapter.notifyDataSetChanged();
return true;
}
});
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
if (!select_txt.equals("")) {
select_txt = "";
DialogUtil.show(context, alert);
new Thread(mTasks).start();
return_flag = true;
return true;
}
return super.onKeyDown(keyCode, event);
}
/**
* 回调更新任务
**/
private Runnable mTask = new Runnable() {
public void run() {
list = SRPUtil.getInstance(getApplicationContext()).select(Card.class, false, "id>?", new String[]{"0"}, null, null, "flag desc,point desc,type desc", null);
temp = SRPUtil.getInstance(getApplicationContext()).select(Card.class, false, "flag=?", new String[]{"1"}, null, null, "flag desc,point desc,type desc", null);
poiont_total = 0;
for (int i = 0; i < temp.size(); i++) {
poiont_total += temp.get(i).point;
}
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
mHandler.sendMessage(mHandler.obtainMessage(0));
}
};
private Runnable mTasks = new Runnable() {
public void run() {
list = srp.select(Card.class, false, "id>?", new String[]{"0"}, null, null, "flag desc,point desc,type desc", null);
temp=list;
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
mHandler.sendMessage(mHandler.obtainMessage(0));
}
};
//战斗力计算任务
private Runnable mTasks_point = new Runnable() {
public void run() {
int temp = initPoint();
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
mHandler.sendMessage(mHandler.obtainMessage(1, temp));
}
};
//开启自设卡组模式
private void startmode() {
poiont_total = 0;
temp = srp.select(Card.class, false, "flag=?", new String[]{"1"}, null, null, "flag desc,point desc,type desc", null);
for (int i = 0; i < temp.size(); i++) {
poiont_total += temp.get(i).point;
}
new Thread(mTasks_point).start();
}
//卡组变更
private void deckChange(int position) {
Card item = mGridAdapter.getItem(position);
if (item.flag == 1) {
poiont_total += item.point;
temp.add(item);
} else {
for (int i = 0; i < temp.size(); i++) {
if (temp.get(i).equals(item)) {
poiont_total -= item.point;
temp.remove(item);
}
}
}
}
private void getCombo() {
if (comboList.size() == 0) {
comboList = srp.select(CardCombo.class, true, "id>?", new String[]{"0"}, null, null, null, null);
}
for (int i = 0; i < comboList.size(); i++) {
List<Card> temp = comboList.get(i).getCard();
if (this.temp.containsAll(temp)) {
selfCombo.add(comboList.get(i));
}
}
}
//初始化评估战力(原则)
private int initPoint() {
in_list.clear();
selfCombo.clear();
int type_add;
int combo_add = 0;
int random_add;
int total = 0;
getCombo();
//基本点数叠加
total += poiont_total;
//种类加成（2种类型为0 1种-5 每多一种Plus 5）
int type_number = (int) srp.countByType(true, 2);
type_add = (type_number - 2) * 2;
in_list.add(new NameValueItem("卡组类型", type_add));
total += type_add;
//combo加成(根据Combo的点数，除以所需卡片数，功能性combo均为10)
for (int i = 0; i < selfCombo.size(); i++) {
combo_add += selfCombo.get(i).value;
in_list.add(new NameValueItem(selfCombo.get(i).getName(), selfCombo.get(i).value));
}
total += combo_add;
//随机点数加成[1~20]
random_add = NumberUtil.getRandom(0, 20);
in_list.add(new NameValueItem("随机数", random_add));
total += random_add;
return total;
}
//显示点数限制，进行修改
private void showPointLimit(final TextView point_show) {
//选择类型0/100/150/200
final String[] word = getResources().getStringArray(R.array.card_limit);
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.pop_word, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
RelativeLayout.LayoutParams params = new RelativeLayout.LayoutParams(CommonUtil.getScreenWidth(context) - 30,
LinearLayout.LayoutParams.MATCH_PARENT);
params.addRule(RelativeLayout.ALIGN_PARENT_BOTTOM);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
updateDialog.show();
ListView listview = (ListView) view.findViewById(R.id.listview);
listview.setAdapter(new ListWordAdapter(word, context));
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
if (arg2 != 0) {
limit = Integer.parseInt(word[arg2]);
String temp=poiont_total + "/" + limit;
point_show.setText(temp);
} else {
limit = 0;
point_show.setText("无限制");
}
updateDialog.dismiss();
}
});
}
//显示牌组战斗力统计，提供保存功能
private void showBattle(Object total) {
value = Integer.parseInt(total.toString());
String tempBase="总点数:" + poiont_total + "(" + total + ")";
base.setText(tempBase);
if (limit != 0) {
String temp=poiont_total + "/" + limit;
card_point.setText(temp);
} else {
card_point.setText("无限制");
}
String tempCard="卡组：" + temp.size() + "/30";
card_number.setText(tempCard);
add_list.setAdapter(new NameValueAdapter(in_list, this));
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
slideUp.animateOut();
}
});
positive.setText("分享");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if (temp.size() != 30 || (poiont_total > limit && limit != 0)) {
Toast.makeText(getApplicationContext(), "组合的牌组超出了范围", Toast.LENGTH_LONG).show();
} else {
showEditDialog();
}
}
});
card_point.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View view) {
showPointLimit(card_point);
}
});
slideUp.animateIn();
}
public void showEditDialog() {
View layout = getLayoutInflater().inflate(R.layout.select_trove, null);
final Dialog updateDialog = new Dialog(this, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(this) - 30,
LinearLayout.LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
name.setHint("请输入卡组的名称");
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
saveCardCombo(name.getText().toString());
updateDialog.dismiss();
}
});
}
public void saveCardCombo(String name) {
//显示等待对话框
DialogUtil.show(context, dialog);
Deck item = new Deck();
List<Integer> list = new ArrayList<>();
for (int i = 0; i < temp.size(); i++) {
list.add(temp.get(i).id);
}
Gson g = new Gson();
item.setCard_list(g.toJson(list));
if (limit != 0) {
item.setLimit(value + "/" + limit);
} else {
item.setLimit("无限制");
}
item.setName(name);
if (AVUser.getCurrentUser() != null) {
item.setUserName(AVUser.getCurrentUser().getString("nickName"));
} else {
item.setUserName("游客");
}
item.setValue(poiont_total);
item.saveInBackground().subscribe((Consumer<AVObject>) avObject -> DialogUtil.dismiss(context, dialog));
}
private void setLimit(String limitString){
if(StringUtil.isNull(limitString)||limitString.equals("无限制")){
limit=0;
}else{
limit=Integer.parseInt(limitString.split("\\\\")[1]);
}
}
public void popWindow() {
//对话框显示，输入返回搜索条件
View xc = getLayoutInflater().inflate(R.layout.select_card, null);
ViewUtil.popCardDialog(this, xc);
}
private void jump() {
Intent it = new Intent(this, ShareCardDeckActivity.class);
startActivityForResult(it, 100);
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
//搜索
case R.id.city_search:
popWindow();
break;
// //模式更改
// case R.id.type_search:
// startmode();
// break;
// //分享
// case R.id.share:
// jump();
// break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.card_menu, menu);
return true;
}
}```
MapItem.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Map")
public class MapItem {
@Column(autoincrement=true,primary=true)
//id
public int id;
//名称
@Column(name="name")
public String name;
//海域坐标
@Column(name="co_sea")
public String co_sea;
//地图坐标
@Column(name="co_map")
public String co_map;
//类型(1:同盟港 2:根据地 3:探险地 4:开拓)
@Column(name="type")
public int type;
//海域名称
@Column(name="sea_name")
public String sea_name;
}
```
UseItem.java
```package com.key.doltool.data.item;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="UseItem")
public class UseItem {
@Column(autoincrement=true,primary=true)
public int id;
/**名称**/
@Column(name="name")
public String name;
/**描述**/
@Column(name="info")
public String info;
/**食物，灾难回避，陆战道具，海战道具，地下城冒险，魔法**/
@Column(name="type")
public String type;
/**获取方式|战斗获得外**/
@Column(name="get_way")
public String get_way;
}
```
MainActivity.java
```package com.key.doltool.activity.core;
import android.app.Activity;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.util.Log;
import android.view.KeyEvent;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.TextView;
import androidx.appcompat.app.ActionBarDrawerToggle;
import androidx.core.view.GravityCompat;
import androidx.drawerlayout.widget.DrawerLayout;
import androidx.fragment.app.Fragment;
import androidx.fragment.app.FragmentManager;
import androidx.fragment.app.FragmentTransaction;
import com.key.doltool.R;
import com.key.doltool.activity.InfoMainFragment;
import com.key.doltool.activity.adventure.AdventureMainFragment;
import com.key.doltool.activity.adventure.NPCFragment;
import com.key.doltool.activity.adventure.card.CardComboFragment;
import com.key.doltool.activity.dockyard.DockYardFragment;
import com.key.doltool.activity.infobroad.MainBroadFragment;
import com.key.doltool.activity.person.LoginActivity;
import com.key.doltool.activity.person.PersonActivity;
import com.key.doltool.activity.recipe.RecipeMainFragment;
import com.key.doltool.activity.search.SearchFragment;
import com.key.doltool.activity.setting.SettingMainFragment;
import com.key.doltool.activity.squre.SqureMainFragment;
import com.key.doltool.activity.trade.TradeItemFragment;
import com.key.doltool.activity.voyage.VoyageMainFragment;
import com.key.doltool.activity.wiki.WebMainFragment;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.app.util.behavior.LoginBehavior;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.SystemInfo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.MenuEvent;
import com.key.doltool.event.app.VersionManager;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.view.stick.StickyListHeadersListView;
import java.util.ArrayList;
import java.util.List;
import cn.leancloud.AVFile;
import cn.leancloud.AVUser;
import io.reactivex.Observable;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
public class MainActivity extends BaseFragmentActivity{
private DrawerLayout mDrawerLayout = null;
private ActionBarDrawerToggle mDrawerToggle;
//侧边栏
private StickyListHeadersListView menu_list;
private List<MenuItem> list;
private MenuAdapter adapter;
private LinearLayout person_info;
private ImageView headPic;
private TextView username;
//内容
private Fragment mContent;
private List<FragmentItem> fragment_list=new ArrayList<>();
private int index=0;
private ViewHandler UIHandler;
private Disposable updateSubscription;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_main_area);
if(savedInstanceState!=null){
index=savedInstanceState.getInt("index");
}
initToolBar(null);
findView();
initUser();
initFragment(savedInstanceState);
Observable<Boolean> sailBoatObservable = RxBusEvent.get().register(RxBusEvent.UPDATE);
updateSubscription=sailBoatObservable.subscribe(new Consumer<Boolean>() {
@Override
public void accept(Boolean aBoolean) {
if(aBoolean) {
initParseUser();
}
}
});
}
private void initUser(){
UIHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switchContent(msg.what);
index=msg.what;
adapter.setIndex(msg.what);
adapter.notifyDataSetChanged();
toolbar.setTitle(list.get(msg.what).text);
}
});
person_info= findViewById(R.id.person_info);
headPic= findViewById(R.id.head_img);
username= findViewById(R.id.name);
//获取默认用户
LoginBehavior loginBehavior=new LoginBehavior();
String currentUser = loginBehavior.getUserName();
String headURL = loginBehavior.getUserHeadImageURL();
//如果有用户则
if (currentUser != null) {
if(loginBehavior.getUserHeadImageURL()!=null){
ImageLoader.picassoLoadCircle(this, headURL, headPic);
}else{
ImageLoader.picassoLoadCircle(this, headPic);
}
username.setText(currentUser);
person_info.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(MainActivity.this,PersonActivity.class);
mDrawerLayout.closeDrawers();
startActivityForResult(it,100);
}
});
//没有则
} else {
headPic.setVisibility(View.GONE);
username.setText("登录/注册");
person_info.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(MainActivity.this,LoginActivity.class);
mDrawerLayout.closeDrawers();
startActivityForResult(it,101);
}
});
}
}
private void initFragment(Bundle savedInstanceState){
//判断savedInstanceState不为空的时候，获取当前的mContent
if(savedInstanceState!=null){
index=savedInstanceState.getInt("index");
Log.i("index", index + "");
toolbar.setTitle(list.get(index).text);
mContent = getSupportFragmentManager().getFragment(savedInstanceState, "mContent");
FragmentItem item=new FragmentItem();
item.fragment=mContent;
item.index=index;
item.title=list.get(index).text;
fragment_list.add(item);
}
//如果mContent为空，默认显示AppFragment的内容
if(mContent == null){
SystemInfo info=new SystemInfo(this);
if(info.getUpdateFlag()==1){
VersionManager.getInstance().setActivity(this);
VersionManager.getInstance().checkVersion(false);
}
Log.i("mContent", mContent + "");
toolbar.setTitle("发现之旅");
mContent = new VoyageMainFragment();
FragmentItem item=new FragmentItem();
item.fragment=mContent;
item.index=0;
item.title="发现之旅";
fragment_list.add(item);
}
//添加content的fragment
FragmentManager fm = getSupportFragmentManager();
FragmentTransaction transaction = fm.beginTransaction();
transaction.replace(R.id.content_frame, mContent);
transaction.commit();
}
private void findView(){
list=new MenuEvent().initMenuList();
mDrawerLayout= findViewById(R.id.drawer_layout);
mDrawerToggle = new ActionBarDrawerToggle(this, mDrawerLayout,toolbar,R.string.app_name,R.string.app_name) {
@Override
public void onDrawerOpened(View drawerView) {
super.onDrawerOpened(drawerView);
}
@Override
public void onDrawerClosed(View drawerView) {
super.onDrawerClosed(drawerView);
}
};
mDrawerToggle.syncState();
mDrawerLayout.addDrawerListener(mDrawerToggle);
mDrawerLayout.setDrawerShadow(R.drawable.drawer_shadow, GravityCompat.START);
init();
}
private void init(){
menu_list = findViewById(R.id.listview);
menu_list.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> parent, View view,
int position, long id) {
show(list.get(position).index);
}
});
menu_list.setDrawingListUnderStickyHeader(false);
menu_list.setAreHeadersSticky(true);
adapter=new MenuAdapter(this,list,new MenuEvent().head,index);
menu_list.setAdapter(adapter);
}
/**
* 切换模块的内容
* @param index 模块索引
*/
public void switchContent(int index){
if(this.index==index){
return;
}
FragmentManager fm = getSupportFragmentManager();
FragmentTransaction transaction = fm.beginTransaction();
switch(index){
case 0:mContent=new VoyageMainFragment();break;
case 1:mContent=new AdventureMainFragment();break;
case 2:mContent=new NPCFragment();break;
case 3:mContent=new CardComboFragment();break;
case 4:mContent=new TradeItemFragment();break;
case 5:mContent=new RecipeMainFragment();break;
case 6:mContent=new DockYardFragment();break;
case 7:mContent=new InfoMainFragment();break;
case 8:mContent=new SearchFragment();break;
// case 9:mContent=new MainBroadFragment();break;
case 9:mContent=new SqureMainFragment();break;
case 10:mContent=new SettingMainFragment();break;
// case 11:mContent=new HelpCenterFragment();break;
// case 12:mContent=new DevFragment();break;
case 11:
WebMainFragment temp=new WebMainFragment();
Bundle bundle=new Bundle();
bundle.putString("url","ser.html");
temp.setArguments(bundle);
mContent= temp;
break;
case 12:
WebMainFragment temp2=new WebMainFragment();
Bundle bundle2=new Bundle();
bundle2.putString("url","user.html");
temp2.setArguments(bundle2);
mContent=temp2;
break;
// case 13:mContent=new DataBaseInsertFragment();break;
default:
mContent=new AdventureMainFragment();
break;
}
Log.i("tag", mContent.getClass() + "");
transaction.setCustomAnimations(R.anim.activity_transition_slide_in_new, R.anim.activity_transition_slide_out_new);
FragmentItem item=new FragmentItem();
item.fragment=mContent;
item.index=index;
item.title=list.get(index).text;
transaction.replace(R.id.content_frame, mContent);
fragment_list.add(item);
transaction.commit();
}
//保存销毁的数据
protected void onSaveInstanceState(Bundle outState) {
outState.putInt("index", index);
getSupportFragmentManager().putFragment(outState, "mContent", mContent);
super.onSaveInstanceState(outState);
}
//点击侧边栏跳转
public void show(final int id) {
mDrawerLayout.closeDrawers();
new Thread(new Runnable(){
public void run() {
while(mDrawerLayout.isDrawerOpen(GravityCompat.START)){
//Dlow
}
UIHandler.sendEmptyMessage(id);
}
}).start();
}
@Override
protected void onActivityResult(int requestCode, int resultCode, Intent data) {
super.onActivityResult(requestCode, resultCode, data);
if (resultCode != Activity.RESULT_OK) {
return;
}
switch (requestCode) {
case 100:
initParseUser();
break;
case 101:
initParseUser();
break;
}
}
private void initParseUser(){
//获取默认用户
AVUser currentUser = AVUser.getCurrentUser();
//如果有用户则
if (currentUser != null) {
AVFile headImg=currentUser.getAVFile("headPic");
headPic.setVisibility(View.VISIBLE);
if(headImg!=null){
ImageLoader.picassoLoadCircle(this, headImg.getUrl(), headPic);
} else{
ImageLoader.picassoLoadCircle(this, headPic);
}
if(!StringUtil.isNull(currentUser.getString("nickName"))){
username.setText(currentUser.getString("nickName"));
}else{
username.setText(currentUser.getUsername());
}
person_info.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(MainActivity.this,PersonActivity.class);
mDrawerLayout.closeDrawers();
startActivityForResult(it,100);
}
});
//没有则
} else {
headPic.setVisibility(View.GONE);
username.setText("登录/注册");
person_info.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(MainActivity.this,LoginActivity.class);
mDrawerLayout.closeDrawers();
startActivityForResult(it,101);
}
});
}
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
if(mContent instanceof BaseFragment){
BaseFragment s=(BaseFragment)mContent;
if(!s.onKeyDown(keyCode, event)){
if(keyCode==KeyEvent.KEYCODE_BACK){
if(mDrawerLayout.isDrawerOpen(GravityCompat.START)){
mDrawerLayout.closeDrawers();
return true;
}else{
if(fragment_list.size()>1){
fragment_list.remove(fragment_list.size()-1);
index=fragment_list.get(fragment_list.size()-1).index;
mContent=fragment_list.get(fragment_list.size()-1).fragment;
toolbar.setTitle(fragment_list.get(fragment_list.size()-1).title);
FragmentManager fm = getSupportFragmentManager();
FragmentTransaction transaction = fm.beginTransaction();
transaction.setCustomAnimations(R.anim.activity_transition_slide_in_new, R.anim.activity_transition_slide_out_new);
transaction.replace(R.id.content_frame, mContent);
transaction.commit();
adapter=new MenuAdapter(this,list,new MenuEvent().head,fragment_list.get(fragment_list.size()-1).index);
menu_list.setAdapter(adapter);
return false;
}else{
//弹出退出对话框
new DialogEvent().materialDialog(0,"退出","确认是否要退出？",MainActivity.this,0);
}
}
}
}else{
return false;
}
}
return super.onKeyDown(keyCode, event);
}
@Override
protected void onDestroy() {
super.onDestroy();
if(updateSubscription!=null){
updateSubscription.dispose();
}
RxBusEvent.get().unregister(RxBusEvent.UPDATE);
}
}```
VoyageEvent.java
```package com.key.doltool.event;
import android.content.Context;
import android.content.Intent;
import android.util.Log;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.activity.adventure.card.CardListActivity;
import com.key.doltool.activity.mission.MissonListActivity;
import com.key.doltool.activity.recipe.RecipeForBookDetailsActivity;
import com.key.doltool.activity.squre.MapActivity;
import com.key.doltool.activity.squre.PortActivity;
import com.key.doltool.activity.useitem.UseItemShowListActivity;
import com.key.doltool.activity.voyage.TradeItemActivity;
import com.key.doltool.activity.voyage.fishing.FishingActivity;
import com.key.doltool.activity.wiki.WikiMainActivity;
import com.key.doltool.data.VoyageInfo;
import com.key.doltool.data.VoyageItem;
import com.key.doltool.util.NumberUtil;
import com.key.doltool.view.Toast;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.Date;
import java.util.HashSet;
import java.util.List;
import java.util.Locale;
import java.util.Set;
/**
* 发现界面生成相关规则和资源
* **/
public class VoyageEvent {
private Context context;
private static final int WEEK=1000*60*60*24;
public static String[] name={
"世界地图","交易品","纺织品",
"钓鱼","论战卡组","魔法之物",
"牛之章","猪之章", "禽之章",
"委托任务","航海学校", "定期船","羊之章"
};
public static String[] pic_id={
"ic_map","ic_tradeitem","ic_roll",
"ic_fishing","ic_gallery","ic_wizard",
"ic_cow","ic_pig","ic_duck",
"ic_diploma","ic_graduation","ic_cargo_ship","ic_sheep"
};
public static int[] type={
0,0,0,
0,0,0,
1,1,1,
0,2,0,1
};
public VoyageEvent(Context context){
this.context=context;
}
public void getRandomChance(){
//获得出现的总数
VoyageInfo info=new VoyageInfo(context);
SimpleDateFormat formatter=new SimpleDateFormat("yyyy-MM-dd", Locale.CHINA);
Date curDate=new Date(System.currentTimeMillis());
Date before;
String time=formatter.format(curDate);
try{
before=formatter.parse(info.getWeek());
}catch (Exception e){
e.printStackTrace();
before=new Date(System.currentTimeMillis());
}
Log.i("WEEK",""+WEEK);
if(curDate.getTime()-before.getTime()>=WEEK) {
int random_times = 9;
Set<Integer> set = new HashSet<>();
Set<Integer> list_type = new HashSet<>();
System.out.println(random_times);
while (list_type.size() < random_times) {
int temp = list_type.size();
//获得本次出现的type是
int random_type = NumberUtil.getRandom(0, name.length);
list_type.add(random_type);
//如果加入的类型之前存在则不存入
if (temp != list_type.size()) {
set.add(random_type);
}
}
Gson gson = new Gson();
info.setWeek(time);
info.setData(gson.toJson(set));
System.out.println("set:" +gson.toJson(set));
}
}
public static List<VoyageItem> getItemByString(String str){
List<VoyageItem> list=new ArrayList<>();
Gson gson = new Gson();
List<Integer> set=gson.fromJson(str, new TypeToken<List<Integer>>() {
}.getType());
if(set!=null){
for(int i=0;i<set.size();i++){
VoyageItem item=new VoyageItem();
item.name=name[set.get(i)];
item.pic_id=pic_id[set.get(i)];
item.type=type[set.get(i)];
list.add(item);
}
}
return list;
}
public static void jumpForVoyage(Context context,VoyageItem item){
Class<?> c;
Intent it;
switch(item.name){
case "世界地图":
c=MapActivity.class;
it=new Intent(context,c);
break;
case "交易品":
c=TradeItemActivity.class;
it=new Intent(context,c);
break;
case "委托任务":
c= MissonListActivity.class;
it=new Intent(context,c);
break;
case "论战卡组":
c= CardListActivity.class;
it=new Intent(context,c);
break;
case "纺织品":
c=TradeItemActivity.class;
it=new Intent(context,c);
it.putExtra("type","type=?");
it.putExtra("args","纺织品");
break;
case "钓鱼":
c=FishingActivity.class;
it=new Intent(context,c);
break;
case "定期船":
c= PortActivity.class;
it=new Intent(context,c);
break;
case "魔法之物":
c=UseItemShowListActivity.class;
it=new Intent(context,c);
it.putExtra("type","魔法之物");
break;
default:
if(item.type==1){
it=recipeSp(context,item.name);
}else if(item.type==2){
it=wikiSp(context,item.name);
}else{
it=null;
}
break;
}
if(it!=null){
context.startActivity(it);
}else{
Toast.makeText(context.getApplicationContext(),"专题界面/快捷查询正在制作中",Toast.LENGTH_SHORT).show();
}
}
private static Intent wikiSp(Context context,String name){
Intent it=new Intent(context, WikiMainActivity.class);
if(name.equals("航海学校")){
it.putExtra("id","10");
return it;
}
return null;
}
private static Intent recipeSp(Context context,String name){
Intent it=new Intent(context, RecipeForBookDetailsActivity.class);
if(name.equals("牛之章")){
it.putExtra("id","215");
return it;
}
if(name.equals("禽之章")){
it.putExtra("id","213");
return it;
}
if(name.equals("猪之章")){
it.putExtra("id","214");
return it;
}
if(name.equals("羊之章")){
it.putExtra("id","212");
return it;
}
return null;
}
}
```
RegularShip.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
/**定期船**/
@Table(name="RegularShip")
public class RegularShip {
@Column(autoincrement=true,primary=true)
public int id;
@Column(name="name")
public String name;
@Column(name="start_city")
public String start_city;
@Column(name="end_city")
public String end_city;
@Column(name="time_list")
public String time_list;
@Column(name="money")
public String money;
@Column(name="time")
public String time;
}
```
Card.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Card")
public class Card {
@Column(autoincrement=true,primary=true)
public int id;
@Column(name="name")
public String name;
@Column(name="point")
public int point;
@Column(name="type")
public String type;
@Column(name="pic_id")
public String pic_id;
@Column(name="flag")
public int flag;
@Override
public boolean equals(Object o) {
Card c=(Card)o;
return c.name.equals(name);
}
}
```
MissionLineActivity.java
```package com.key.doltool.activity.mission;
import java.util.ArrayList;
import java.util.List;
import android.os.Bundle;
import android.util.Log;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.MissionTree;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class MissionLineActivity extends BaseActivity{
private DefaultDAO dao;
private MissionTree tree;
private String name="石头的记忆";
private int level=0;
@Override
public int getContentViewId() {
return R.layout.toast_view;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
}
private void init(){
dao=SRPUtil.getDAO(this);
tree=new MissionTree();
tree.setLevel(0);
tree.setName(name);
tree.setBefore_mission(getBeforeLineData(name));
showTree(tree);
}
private List<MissionTree> getBeforeLineData(String name){
Mission item ;
List<?> list_mission=dao.select(Mission.class,false,"name=?",new String[]{name}, null, null, null, null);
List<MissionTree> list=new ArrayList<>();
if(list_mission.size()>0){
level++;
item=(Mission)list_mission.get(0);
String[] temp=item.getBefore().split(",");
for (String aTemp : temp) {
MissionTree items = new MissionTree();
items.setLevel(level);
items.setName(aTemp);
items.setBefore_mission(getBeforeLineData(aTemp));
list.add(items);
}
}
return list;
}
private void showTree(MissionTree tree){
Log.i("x",tree.getName());
Log.i("x",tree.getLevel()+"");
for(int i=0;i<tree.getBefore_mission().size();i++){
Log.i("x",tree.getBefore_mission().size()+"");
showTree(tree.getBefore_mission().get(i));
}
}
}```
RecipeAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.graphics.Typeface;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.adapter.util.AdapterUtil;
import com.key.doltool.data.sqlite.Recipe;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class RecipeAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public RelativeLayout item1,item2,item3;
public ImageView item_pic1,item_pic2,item_pic3;
public TextView item_number1,item_number2,item_number3;
public TextView item_name1,item_name2,item_name3;
public ImageView skill1,skill2;
public TextView skill1_number,skill2_number;
public TextView skill1_name,skill2_name;
public ImageView result_pic;
public TextView result_name;
public TextView result_txt;
}
private List<Recipe> list=new ArrayList<>();
private Context context;
private DefaultDAO dao;
private AdapterUtil util;
public RecipeAdapter(List<Recipe> list,Context context){
this.list=list;
this.context=context;
dao=SRPUtil.getDAO(context);
util=new AdapterUtil(context, dao);
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_recipe, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.item1=(RelativeLayout)convertView.findViewById(R.id.item_1);
holder.item2=(RelativeLayout)convertView.findViewById(R.id.item_2);
holder.item3=(RelativeLayout)convertView.findViewById(R.id.item_3);
holder.item_pic1=(ImageView)convertView.findViewById(R.id.img1);
holder.item_pic2=(ImageView)convertView.findViewById(R.id.img2);
holder.item_pic3=(ImageView)convertView.findViewById(R.id.img3);
holder.item_number1=(TextView)convertView.findViewById(R.id.txt1);
holder.item_number2=(TextView)convertView.findViewById(R.id.txt2);
holder.item_number3=(TextView)convertView.findViewById(R.id.txt3);
holder.item_name1=(TextView)convertView.findViewById(R.id.name1);
holder.item_name2=(TextView)convertView.findViewById(R.id.name2);
holder.item_name3=(TextView)convertView.findViewById(R.id.name3);
holder.result_pic=(ImageView)convertView.findViewById(R.id.result_pic);
holder.result_txt=(TextView)convertView.findViewById(R.id.result_number);
holder.result_name=(TextView)convertView.findViewById(R.id.result_name);
holder.skill1=(ImageView)convertView.findViewById(R.id.skill1);
holder.skill2=(ImageView)convertView.findViewById(R.id.skill2);
holder.skill1_number=(TextView)convertView.findViewById(R.id.skill1_number);
holder.skill2_number=(TextView)convertView.findViewById(R.id.skill2_number);
holder.skill1_name=(TextView)convertView.findViewById(R.id.skill1_name);
holder.skill2_name=(TextView)convertView.findViewById(R.id.skill2_name);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_number1.setTypeface(Typeface.createFromAsset(context.getAssets(),
"wiki_html/fonts/shift_bold.ttf"));
holder.item_number2.setTypeface(Typeface.createFromAsset(context.getAssets(),
"wiki_html/fonts/shift_bold.ttf"));
holder.item_number3.setTypeface(Typeface.createFromAsset(context.getAssets(),
"wiki_html/fonts/shift_bold.ttf"));
holder.name.setText(list.get(position).getName());
String[] temp=list.get(position).getNeed().split(",");
if(temp.length<1){
holder.item1.setVisibility(View.GONE);
holder.item_name1.setVisibility(View.GONE);
}else{
holder.item1.setVisibility(View.VISIBLE);
holder.item_name1.setVisibility(View.VISIBLE);
String[] message=temp[0].split(" ");
holder.item_number1.setText(""+message[1]);
holder.item_name1.setText(""+message[0]);
util.findByName(holder.item_pic1,message[0],3);
}
if(temp.length<2){
holder.item2.setVisibility(View.GONE);
holder.item_name2.setVisibility(View.GONE);
}else{
holder.item2.setVisibility(View.VISIBLE);
holder.item_name2.setVisibility(View.VISIBLE);
String[] message=temp[1].split(" ");
holder.item_number2.setText(""+message[1]);
holder.item_name2.setText(""+message[0]);
util.findByName(holder.item_pic2,message[0],3);
}
if(temp.length<3){
holder.item3.setVisibility(View.GONE);
holder.item_name3.setVisibility(View.GONE);
}else{
holder.item3.setVisibility(View.VISIBLE);
holder.item_name3.setVisibility(View.VISIBLE);
String[] message=temp[2].split(" ");
holder.item_number3.setText(""+message[1]);
holder.item_name3.setText(""+message[0]);
util.findByName(holder.item_pic3,message[0],3);
}
String[] message_re=list.get(position).getResult_number().split("\n");
util.findByName(holder.result_pic,message_re[0].trim(),3);
if(message_re.length>=2){
holder.result_txt.setVisibility(View.VISIBLE);
holder.result_txt.setText(""+message_re[1]);
}else{
holder.result_txt.setVisibility(View.GONE);
}
holder.result_name.setText(""+message_re[0]);
String[] skill=list.get(position).getLevel_need().split(",");
if(skill.length==0){
holder.skill1.setVisibility(View.GONE);
holder.skill1_name.setVisibility(View.GONE);
holder.skill1_number.setVisibility(View.GONE);
}else{
holder.skill1.setVisibility(View.VISIBLE);
holder.skill1_number.setVisibility(View.VISIBLE);
holder.skill1_name.setVisibility(View.VISIBLE);
String[] message=skill[0].split(" ");
if(message.length>1){
holder.skill1_number.setText(""+message[1]);
}else{
holder.skill1_number.setText("");
}
holder.skill1_name.setText(message[0]);
util.findByName(holder.skill1,message[0],1);
}
if(skill.length==1){
holder.skill2.setVisibility(View.GONE);
holder.skill2_number.setVisibility(View.GONE);
holder.skill2_name.setVisibility(View.GONE);
}else{
holder.skill2.setVisibility(View.VISIBLE);
holder.skill2_name.setVisibility(View.VISIBLE);
holder.skill2_number.setVisibility(View.VISIBLE);
String[] message=skill[1].split(" ");
holder.skill2_name.setText(message[0]);
holder.skill2_number.setText(""+message[1]);
util.findByName(holder.skill2,message[0],1);
}
return convertView;
}
}
```
MenuAdapter.java
```package com.key.doltool.activity.core;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.SectionIndexer;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.MenuItem;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.view.stick.StickyListHeadersAdapter;
public class MenuAdapter extends BaseAdapter implements
StickyListHeadersAdapter, SectionIndexer {
private static class ViewHolder{
public TextView item_name;
}
private static class HeadViewHolder{
public TextView item_name;
}
private List<MenuItem> list;
private Context context;
private LayoutInflater mInflater;
private String[] head;
private int index;
public MenuAdapter(Context context,List<MenuItem> list,String[] head,int index) {
this.context=context;
this.list=list;
this.head=head;
this.index=index;
mInflater = LayoutInflater.from(context);
}
@Override
public int getCount() {
return list.size();
}
@Override
public Object getItem(int position) {
return list.get(position);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.menu_item,parent,false);
holder.item_name=(TextView)convertView.findViewById(R.id.content);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
holder.item_name.setText(list.get(position).text);
if(index==list.get(position).index){
holder.item_name.setTextColor(ResourcesUtil.getColor(R.color.Blue_SP, context));
}else{
holder.item_name.setTextColor(ResourcesUtil.getColor(R.color.Black_SP, context));
}
return convertView;
}
@Override
public Object[] getSections() {
// TODO Auto-generated method stub
return null;
}
@Override
public int getPositionForSection(int section) {
return 0;
}
@Override
public int getSectionForPosition(int position) {
return 0;
}
@Override
public View getHeaderView(int position, View convertView, ViewGroup parent) {
HeadViewHolder holder;
if (convertView == null) {
holder = new HeadViewHolder();
convertView = mInflater.inflate(R.layout.menu_top, parent, false);
holder.item_name = (TextView) convertView.findViewById(R.id.content);
convertView.setTag(holder);
} else {
holder = (HeadViewHolder) convertView.getTag();
}
holder.item_name.setText(head[list.get(position).parent_id]);
return convertView;
}
public void setIndex(int index){
this.index=index;
}
@Override
public long getHeaderId(int position) {
return list.get(position).parent_id;
}
}
```
TradeItemActivity.java
```package com.key.doltool.activity.voyage;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.GridView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.trade.TradeDetailActivity;
import com.key.doltool.adapter.TradeListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.event.AreaEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class TradeItemActivity extends BaseActivity{
@BindView(R.id.listview) GridView listview;
//定义部分
private Dialog alert;
//数据temp变量
private TradeListAdapter adapter;
private ViewHandler viewHandler;
private ListFlowHelper<TradeItem> listFlowHelper;
@Override
public int getContentViewId() {
return R.layout.trade_list_toolbar;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle("交易品");
findView();
setListener();
listFlowHelper.getExtra(getIntent());
if(listFlowHelper.list.size()==0){
new Thread(mTasks).start();
}else{
DialogUtil.dismiss(this,alert);
}
}
private Runnable mTasks =new Runnable(){
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 0;
viewHandler.sendMessage(message);
}
};
//通用findView
private void findView() {
//基本设置
alert=new DialogEvent().showLoading(context);
DialogUtil.show(context,alert);
listFlowHelper=new ListFlowHelper<>(TradeItem.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new TradeListAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, TradeListAdapter.SIZE);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what){
case 0:
listFlowHelper.change(true);
break;
case 1:
listFlowHelper.change();
break;
}
DialogUtil.dismiss(context,alert);
}
});
initPage();
}
//通用Listener
private void setListener() {
listview.setOnItemClickListener(new OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
Intent it = new Intent(TradeItemActivity.this, TradeDetailActivity.class);
it.putExtra("id", adapter.getItem(arg2).getId()+"");
startActivity(it);
}
});
}
private void initPage(){
initPageItem();
}
private void initPageItem(){
adapter=new TradeListAdapter(listFlowHelper.list,context);
ListScrollListener scrollListener = new ListScrollListener(alert,viewHandler,context);
listFlowHelper.setListScrollListener(scrollListener);
listview.setOnScrollListener(scrollListener);
listview.setAdapter(adapter);
}
private void jump(){
View xc=getLayoutInflater().inflate(R.layout.select_trade, null);
ViewUtil.popTradeDialog(listFlowHelper,context,xc);
}
private void findObject(){
DefaultDAO dao= SRPUtil.getDAO(context);
new AreaEvent().showCityDialog(this,dao);
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
return super.onKeyDown(keyCode,event);
}
//其他
else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:findObject();break;
case R.id.type_search:jump();break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.adc_menu, menu);
return true;
}
}```
Trove.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Trove")
//发现物
public class Trove {
@Column(autoincrement=true,primary=true)
private int id;
@Column(name="pic_id")
private String pic_id;
@Column(name="name")
private String name;
//类型
@Column(name="type")
private String type;
//星级
@Column(name="rate")
private int rate;
//卡片点数
@Column(name="card_point")
private int card_point;
//功绩
@Column(name="feats")
private int feats;
//任务名称
@Column(name="misson")
private String misson;
//介绍
@Column(name="details")
private String details;
//需求
@Column(name="need")
private String need;
//发现标记
@Column(name="flag",default_value="0")
private int find_flag;
//获取方式
@Column(name="getWay",default_value="0")
private int getWay;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getPic_id() {
return pic_id;
}
public void setPic_id(String pic_id) {
this.pic_id = pic_id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
public int getRate() {
return rate;
}
public void setRate(int rate) {
this.rate = rate;
}
public int getCard_point() {
return card_point;
}
public void setCard_point(int card_point) {
this.card_point = card_point;
}
public String getMisson() {
return misson;
}
public void setMisson(String misson) {
this.misson = misson;
}
public String getDetails() {
return details;
}
public void setDetails(String details) {
this.details = details;
}
public int getFeats() {
return feats;
}
public void setFeats(int feats) {
this.feats = feats;
}
public String getNeed() {
return need;
}
public void setNeed(String need) {
this.need = need;
}
public int getFind_flag() {
return find_flag;
}
public void setFind_flag(int find_flag) {
this.find_flag = find_flag;
}
public int getGetWay() {
return getWay;
}
public void setGetWay(int getWay) {
this.getWay = getWay;
}
}
```
FreeMarketActivity.java
```package com.key.doltool.activity.squre.business;
import android.os.Bundle;
import com.key.doltool.activity.BaseActivity;
/**
* 自由交易市场，用于展示发布交易信息。
* **/
public class FreeMarketActivity extends BaseActivity {
@Override
public int getContentViewId() {
return 0;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
}
}
```
WebEvent.java
```package com.key.doltool.event;
import android.content.Context;
import android.content.Intent;
import android.webkit.JavascriptInterface;
import com.key.doltool.activity.adc.ADCListActivity;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.activity.mission.MissonListActivity;
import com.key.doltool.activity.squre.MapActivity;
import com.key.doltool.activity.trade.TradeDetailActivity;
import com.key.doltool.activity.trade.TradeItemFragment;
/**Web处理事件**/
public class WebEvent {
private Context context;
public WebEvent(Context context){
this.context=context;
}
/**
* html调用android-一般页面跳转事件
* */
@JavascriptInterface
public void jump(int i){
Class<?> c;
switch(i){
case 0:c=MapActivity.class;break;
case 1:c=TradeItemFragment.class;break;
default:c=MissonListActivity.class;break;
}
Intent it=new Intent(context,c);
context.startActivity(it);
}
/**
* html调用android-页面跳转事件(交易品详情页)
* */
@JavascriptInterface
public void trade(String txt){
Intent it=new Intent(context,TradeDetailActivity.class);
it.putExtra("name",txt);
context.startActivity(it);
}
/**
* html调用android-页面跳转事件(任务链接)
* */
@JavascriptInterface
public void mission(int index,String name){
if(index==0){
Intent it=new Intent(context, MissionDetailsActivity.class);
it.putExtra("type","link");
it.putExtra("find_item",name);
context.startActivity(it);
}else{
Intent it=new Intent(context,MissonListActivity.class);
it.putExtra("find_item",name);
context.startActivity(it);
}
}
/**
* html调用android-页面跳转事件(副官列表页【带搜索条件】)
* */
@JavascriptInterface
public void adc(int type,String args){
String type_txt;
Intent it=new Intent(context,ADCListActivity.class);
if(type==0){
type_txt="city like ?";
args="%"+args+"%";
}else{
type_txt="type = ?";
}
it.putExtra("type",type_txt);
it.putExtra("args",args);
context.startActivity(it);
}
}
```
DBUtil.java
```package com.key.doltool.util;
import android.content.Context;
import android.util.Log;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.data.SystemInfo;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.util.db.DataSelectUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import java.io.File;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
/**
* 数据库处理工具
*/
public class DBUtil {
/**单个小于1M的db拷贝方式 **/
public static void copyDB(Context context, android.os.Handler handler){
int tagert =0;
boolean flag=true;
List<Integer> list = new ArrayList<>();
List<Integer> list_mission;
Gson s=new Gson();
String str;
String str2;
String fileName=FileManager.getSaveFilePath(context)+"backup.json";
String fileName2=FileManager.getSaveFilePath(context)+"backup2.json";
SystemInfo system=new SystemInfo(context);
UpdataCount event=new UpdataCount(context);
File install=new File(FileManager.getSaveFilePath(context)+FileManager.DOWNLOAD + "/"+"dol_new.apk");
File dir=new File(FileManager.getSaveFilePath(context));
//初始文件夹生成
if(!dir.exists()){
dir.mkdir();
}
//apk安装文件删除
if(install.exists()){
install.delete();
}
File f=context.getDatabasePath("demo.db");
if(!f.exists()){
f.getParentFile().mkdir();
flag=false;
}
else{
DefaultDAO dao=SRPUtil.getDAO(context);
Log.i("com", ""+CommonUtil.getAppVersionName(context));
tagert=DataSelectUtil.dbVerion(dao);
Log.i("data", ""+tagert);
//缺点:每次更新都要复制数据库
if(CommonUtil.getMetaDataInt(context,"DB_VERSION")==tagert){
if(system.getOverFlag()==1){
return ;
}
}else{
system.setOverFlag(0);
}
}
try{
//保存发现物标记数量
if(flag&&tagert>-1){
handler.sendMessage(handler.obtainMessage(1));
list=event.saveIdFlag();
JsonUtil.writeFile(s.toJson(list), fileName, context);
//写文本
list_mission=event.saveMission(tagert);
if(list_mission!=null){
JsonUtil.writeFile(s.toJson(list_mission), fileName2, context);
}else{
tagert=0;
}
Log.i("记录数据", list.size()+"");
}
InputStream is = context.getResources().openRawResource(R.raw.demo);
FileOutputStream fos = new FileOutputStream(f.getParent()+"/demo.db");
byte[] buffer = new byte[8192];
int count;
Log.i("true", "s");
// 开始复制testDatabase.db文件
while ((count = is.read(buffer)) > 0)
{
fos.write(buffer, 0, count);
}
fos.close();
is.close();
//还原发现物标记数量
if(flag&&tagert>-1){
//读文本
str=JsonUtil.readFile(fileName, context);
list=s.fromJson(str, new TypeToken<List<Integer>>(){}.getType());
event.backSave(list);
if(tagert!=0){
str2=JsonUtil.readFile(fileName2, context);
list_mission=s.fromJson(str2, new TypeToken<List<Integer>>(){}.getType());
event.backSaveMission(list_mission);
}
File back_file=new File(fileName);
if(back_file.exists()){
back_file.delete();
}
File back_file2=new File(fileName2);
if(back_file2.exists()){
back_file2.delete();
}
}
Log.i("成功","OK");
//成功设置为1
system.setOverFlag(1);
list.clear();
}catch(Exception e){
e.printStackTrace();
handler.sendMessage(handler.obtainMessage(2));
}
}
/**多个小于1M的db拷贝方式（实现用工具分割数据库文件）**/
public static void copyBigDataBase(Context context){
File f=context.getDatabasePath("demo.db");
if(!f.exists())
f.getParentFile().mkdir();
else{
//(有Db去判断版本，版本相同则不复制，
}
try{
InputStream is = context.getResources().openRawResource(R.raw.demo);
FileOutputStream fos = new FileOutputStream(f.getParent()+"/demo.db");
for (int i = 0; i < 100; i++) {
is = context.getAssets().open("db/demo" + "." + i);
byte[] buffer = new byte[1024];
int length;
while ((length = is.read(buffer))>0){
fos.write(buffer, 0, length);
}
fos.flush();
is.close();
}
fos.close();
}catch(Exception e){
Toast.makeText(context,"初始化数据库失败",Toast.LENGTH_SHORT).show();
}
}
}```
HintListActivity.java
```package com.key.doltool.activity.help;
import android.os.Bundle;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
public class HintListActivity extends BaseActivity{
@Override
public int getContentViewId() {
return R.layout.help_hint_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
toolbar.setTitle("应用贴士");
}
}
```
Version.java
```package com.key.doltool.event.app;
public class Version {
private String appname;
private String verionCode;
private String updataMsg;
private String updataUrl;
private String app_size;
public String getAppname() {
return appname;
}
public void setAppname(String appname) {
this.appname = appname;
}
public String getVerionCode() {
return verionCode;
}
public void setVerionCode(String verionCode) {
this.verionCode = verionCode;
}
public String getUpdataMsg() {
return updataMsg;
}
public void setUpdataMsg(String updataMsg) {
this.updataMsg = updataMsg;
}
public String getUpdataUrl() {
return updataUrl;
}
public void setUpdataUrl(String updataUrl) {
this.updataUrl = updataUrl;
}
public String getApp_size() {
return app_size;
}
public void setApp_size(String app_size) {
this.app_size = app_size;
}
}
```
FishingTradeFragment.java
```package com.key.doltool.activity.voyage.fishing;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.os.Parcelable;
import android.view.View;
import android.widget.AdapterView;
import android.widget.GridView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.trade.TradeDetailActivity;
import com.key.doltool.adapter.TradeListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.db.SRPUtil;
import java.util.List;
import butterknife.BindView;
/**
* 钓鱼交易品界面
* **/
public class FishingTradeFragment extends BaseFragment{
@BindView(R.id.listview) GridView gridview;
private Dialog alert;
private List<TradeItem> list;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.trade_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
DialogUtil.dismiss(context,alert);
Parcelable state=gridview.onSaveInstanceState();
TradeListAdapter adapter = new TradeListAdapter(list, getActivity());
gridview.setAdapter(adapter);
gridview.onRestoreInstanceState(state);
}
});
findView();
setListener();
new Thread(mTask).start();
}
private Runnable mTask=new Runnable() {
@Override
public void run() {
//查询所有钓鱼交易品
list= SRPUtil.getInstance(context.getApplicationContext()).select(
TradeItem.class,false,"sp=?",new String[]{"钓鱼"},null, null,"name desc", null);
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
viewHandler.sendMessage(viewHandler.obtainMessage());
}
};
private void findView(){
alert=new DialogEvent().showLoading(getActivity());
DialogUtil.show(context,alert);
}
private void setListener(){
gridview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> parent, View view, int position, long id) {
Intent it = new Intent(getActivity(), TradeDetailActivity.class);
it.putExtra("id", list.get(position).getId() + "");
startActivity(it);
}
});
}
}
```
BaseFragmentActivity.java
```package com.key.doltool.activity.core;
import android.content.Intent;
import android.os.Bundle;
import android.view.MenuItem;
import androidx.appcompat.app.AppCompatActivity;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.event.CrashHandler;
import com.key.doltool.util.ExitApplication;
import com.key.doltool.util.StringUtil;
import com.key.doltool.view.SystemBarTintManager;
import com.key.doltool.view.Toast;
public abstract class BaseFragmentActivity extends AppCompatActivity {
public Toolbar toolbar;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
SystemBarTintManager tintManager = new SystemBarTintManager(this);
tintManager.setStatusBarTintEnabled(true);
tintManager.setStatusBarTintResource(R.color.blue_dark);
//去背景
getWindow().setBackgroundDrawable(null);
//添加栈内进行管理
ExitApplication.getInstance().addActivity(this);
CrashHandler.WHERE=getClass().getName();
CrashHandler.WHO="";
}
@Override
public Intent getIntent() {
Intent it=super.getIntent();
CrashHandler.WHO=setWho(it);
return it;
}
public String setWho(Intent it){
String temp="";
if(it!=null){
String id=it.getStringExtra("id");
String name=it.getStringExtra("name");
String tw_name=it.getStringExtra("tw_name");
String city_name=it.getStringExtra("city_name");
if(!StringUtil.isNull(id)){
temp+="id:"+id+" ";
}
if(!StringUtil.isNull(name)){
temp+="name:"+name+" ";
}
if(!StringUtil.isNull(tw_name)){
temp+="tw_name:"+tw_name+" ";
}
if(!StringUtil.isNull(city_name)){
temp+="city_name:"+city_name+" ";
}
}
return temp;
}
public void initToolBar(Toolbar.OnMenuItemClickListener onMenuItemClick){
toolbar = findViewById(R.id.toolbar);
if(toolbar!=null){
toolbar.setTitle("冒险宝贝");
toolbar.setTitleTextColor(getResources().getColor(R.color.White));
setSupportActionBar(toolbar);
if(onMenuItemClick!=null){
toolbar.setOnMenuItemClickListener(onMenuItemClick);
}
toolbar.setNavigationIcon(R.drawable.ic_arrow_back_white_24dp);
}
}
@Override
public boolean onOptionsItemSelected(MenuItem item) {
switch (item.getItemId()) {
case android.R.id.home:
this.finish();
default:
}
return super.onOptionsItemSelected(item);
}
@Override
public void onBackPressed() {
Toast.cancelToast();
super.onBackPressed();
}
@Override
protected void onDestroy(){
super.onDestroy();
ExitApplication.getInstance().removeActivity(this);
}
}
```
ADCDetailsActivity.java
```package com.key.doltool.activity.adc;
import android.os.Bundle;
import android.widget.ImageView;
import android.widget.ListView;
import android.widget.TextView;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ADCSkillListAdapter;
import com.key.doltool.data.ADCSkill;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.the9tcat.hadi.DefaultDAO;
import java.io.IOException;
import java.util.List;
import butterknife.BindView;
/**
* 副官详情界面
* **/
public class ADCDetailsActivity extends BaseActivity{
@BindView(R.id.adc_sex) TextView sex;
@BindView(R.id.adc_type) TextView type;
@BindView(R.id.adc_country) TextView country;
@BindView(R.id.adc_city) TextView city;
@BindView(R.id.adc_name) TextView name;
@BindView(R.id.adc_head) ImageView head;
@BindView(R.id.listview) ListView listview;
private DefaultDAO dao;
private String id="0";
private String name_str="0";
@Override
public int getContentViewId() {
return R.layout.adc_details;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
id=getIntent().getStringExtra("id");
name_str=getIntent().getStringExtra("name");
init();
}
private void init(){
ADCInfo item;
if(!StringUtil.isNull(id)){
item =(ADCInfo)dao.select(ADCInfo.class, false, "id=?",new String[]{id+""}, null, null, null, null).get(0);
}else{
item =(ADCInfo)dao.select(ADCInfo.class, false, "name=?",new String[]{name_str+""}, null, null, null, null).get(0);
}
sex.setText(item.getSex());
int types= item.getType();
type.setText(ResourcesUtil.getArray(this,R.array.adc_type_txt)[types]);
if(item.getSex().equals(getResources().getString(R.string.adc_sex_male))){
sex.setBackgroundResource(R.drawable.theme_blue_btn_rate);
}else{
sex.setBackgroundResource(R.drawable.theme_pink_btn_rate);
}
name.setText(item.getName());
country.setText(item.getCountry());
city.setText(item.getCity());
ImageLoader.setBitmapByAssets(head,FileManager.ADC+ item.getHead_img()+".png",this);
List<ADCSkill> list = new Gson().fromJson(item.getSkill_list(), new TypeToken<List<ADCSkill>>() {
}.getType());
listview.setAdapter(new ADCSkillListAdapter(list, this));
}
}
```
NumberUtil.java
```package com.key.doltool.util;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.HashMap;
import java.util.Locale;
import java.util.Random;
import android.util.Log;
public class NumberUtil {
public static int TEMP=0;
/**三个数求最大，m最大就0，s最大就1，j最大就2**/
public static int getMaxForThree(int m,int s,int j){
if(m>=s&&m>=j)
return 0;
else if(s>=m&&s>=j)
return 1;
else
return 2;
}
/**判断为0,是就为0，不是就为1**/
public static int isZero(int x){
if(x==0)
return 0;
else
return 1;
}
/**判断3个数有几个true 3位2进值数计算**/
public static int threeZero(boolean s,boolean m,boolean l){
int total=0;
if(s){
total+=4;
}
if(m){
total+=2;
}
if(l){
total+=1;
}
return total;
}
public static int wordToNumber(String str){
int number=0;
if(str.contains("一"))
number=1;
else if(str.contains("二"))
number=2;
else if(str.contains("三"))
number=3;
else if(str.contains("四"))
number=4;
else if(str.contains("五"))
number=5;
return number;
}
public static int compare_date(String DATE1, String DATE2) {
Log.i("DATE1",""+DATE1);
if(StringUtil.isNull(DATE1)){
return -1;
}
DateFormat df = new SimpleDateFormat("yyyy.MM.dd hh:mm:ss",Locale.CHINA);
try {
Date dt1 = df.parse(DATE1);
Date dt2 = df.parse(DATE2);
Log.i("DATE1",""+DATE1);
Log.i("DATE2",""+DATE2);
if (dt1.getTime() > dt2.getTime()) {
System.out.println("dt1 在dt2前");
return 1;
} else if (dt1.getTime() < dt2.getTime()) {
System.out.println("dt1在dt2后");
return -1;
} else {
return 0;
}
} catch (Exception exception) {
exception.printStackTrace();
}
return -1;
}
/**处理add信息**/
public static HashMap<String,Integer> excute_add_info(String base){
String[] cute=base.split(",");
HashMap<String,Integer> map=new HashMap<>();
for (String aCute : cute) {
String[] number_temp = aCute.split(":");
String[] number = number_temp[1].split("~");
int min = Integer.parseInt(number[0]);
int max = Integer.parseInt(number[1]);
int random = getRandom(min, max);
map.put(number_temp[0], random);
}
return map;
}
public static int getRandom(int min,int max){
Random ran=new Random();
return min+(int)((ran.nextDouble())*(max-min));
}
public static boolean getRandomByPercent(double percent){
Random ran=new Random();
double max=ran.nextDouble()*100;
return max <= percent;
}
}
```
MyAnimations.java
```package com.key.doltool.anime;
import android.animation.Animator;
import android.animation.AnimatorSet;
import android.animation.ObjectAnimator;
import android.app.Activity;
import android.content.Context;
import android.view.View;
import android.view.ViewGroup;
import android.view.animation.AccelerateInterpolator;
import android.view.animation.AlphaAnimation;
import android.view.animation.Animation;
import android.view.animation.DecelerateInterpolator;
import android.view.animation.RotateAnimation;
import com.key.doltool.util.CommonUtil;
/**
* 各类动画存储类，说明:<br>
* 里面的所有动画都是补间动画，没有帧动画有单例和复合动画，实现比较简单，主要
* 是动画的和其他的设置，同样建议在使用动画时，将所有动画效果加入此类，或新建一个类
* 进行管理，并进行说明动画的效果（怎么使用倒是没那么困难，基本上是哪个动画，多少毫秒）
* @author key
*/
public class MyAnimations {
/**
* @param view 要旋转的ViewGroup
* @param view_g 消失的View
* @param view_v 显示的View
* @param durationMillis 时间
**/
public static void rotate3D(final ViewGroup view,final ViewGroup view_g,final ViewGroup view_v,final int durationMillis){
ObjectAnimator gone=ObjectAnimator.ofFloat(view,"alpha",1f,0f);
gone.setDuration(durationMillis);
gone.addListener(new Animator.AnimatorListener() {
@Override
public void onAnimationCancel(final Animator animation) {
}
@Override
public void onAnimationEnd(final Animator animation) {
view_g.setVisibility(View.GONE);
view_v.setVisibility(View.VISIBLE);
ObjectAnimator show =
ObjectAnimator.ofFloat(view, "alpha", 0f, 1f);
show.setDuration(durationMillis);
show.start();
}
@Override
public void onAnimationRepeat(final Animator animation) {
}
@Override
public void onAnimationStart(final Animator animation) {
}
});
gone.start();
}
/** 淡入动画，适用于子布局的一个个淡入的动画
* @param viewgroup 要淡入的ViewGroup(不是他自己，而是子布局的动画)
* @param durationMillis 时间
**/
public static void fadein(ViewGroup viewgroup ,int durationMillis){
for(int i=viewgroup.getChildCount()-1;i>0;i--){
View layout=viewgroup.getChildAt(viewgroup.getChildCount()-i);
AlphaAnimation animation1 = new AlphaAnimation(0.0f, 1);
animation1.setFillAfter(true);
animation1.setDuration(durationMillis);
animation1.setStartOffset((viewgroup.getChildCount() - i) * 200/ 2);// 下一个动画的偏移时间
layout.startAnimation(animation1);
layout.setVisibility(View.VISIBLE);
}
}
public void roate(Context context,View view,int durationMillis){
RotateAnimation animation1=new RotateAnimation(0,359,Animation.RELATIVE_TO_SELF,0.5f,Animation.RELATIVE_TO_SELF,0.5f);
animation1.setRepeatMode(Animation.INFINITE);
animation1.setRepeatCount(Animation.INFINITE);
animation1.setInterpolator(context, android.R.anim.linear_interpolator);
animation1.setDuration(durationMillis);
view.startAnimation(animation1);
}
/**view从右下角移动至中心渐变消失**/
public static void wordAnime(Activity activity,View view, int durationMillis, Animator.AnimatorListener listener){
int height=(view.getHeight()-CommonUtil.getScreenHeight(activity))/2;
int width=(view.getWidth()-CommonUtil.getScreenWidth(activity))/2;
ObjectAnimator anime1=ObjectAnimator.ofFloat(view, "translationX", 0,width);
ObjectAnimator anime2=ObjectAnimator.ofFloat(view, "translationY", 0,height);
ObjectAnimator anime3=ObjectAnimator.ofFloat(view, "ScaleX", 1,2);
ObjectAnimator anime4=ObjectAnimator.ofFloat(view, "ScaleY", 1,2);
ObjectAnimator anime5=ObjectAnimator.ofFloat(view, "alpha",1,0);
anime1.setDuration(durationMillis);
anime2.setDuration(durationMillis);
anime3.setDuration(durationMillis/2+50);
anime4.setDuration(durationMillis/2+50);
anime5.setDuration(durationMillis/2+50);
AnimatorSet set=new AnimatorSet();
set.play(anime1).with(anime2).before(anime3);
set.play(anime3).with(anime4).with(anime5);
set.setInterpolator(new AccelerateInterpolator());
set.addListener(listener);
set.start();
}
/**view从中心渐变显示至右下角**/
public static void wordAnime2(Activity activity,View view,int durationMillis){
int height=(view.getHeight()-CommonUtil.getScreenHeight(activity))/2;
int width=(view.getWidth()-CommonUtil.getScreenWidth(activity))/2;
ObjectAnimator anime1=ObjectAnimator.ofFloat(view, "translationX",width,0);
ObjectAnimator anime2=ObjectAnimator.ofFloat(view, "translationY",height,0);
ObjectAnimator anime3=ObjectAnimator.ofFloat(view, "ScaleX", 2,1);
ObjectAnimator anime4=ObjectAnimator.ofFloat(view, "ScaleY", 2,1);
ObjectAnimator anime5=ObjectAnimator.ofFloat(view, "alpha",0,1);
anime1.setDuration(durationMillis);
anime2.setDuration(durationMillis);
anime3.setDuration(durationMillis/2+50);
anime4.setDuration(durationMillis/2+50);
anime5.setDuration(durationMillis/2+50);
AnimatorSet set=new AnimatorSet();
set.play(anime3).with(anime4).with(anime5).before(anime2);
set.play(anime2).with(anime1);
set.setInterpolator(new DecelerateInterpolator());
set.start();
}
}```
MissionConnectAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.content.Intent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.mission.MissionDetailsActivity;
public class MissionConnectAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView item_name;
}
private String[] item_txt;
private Context context;
private int type;
private String name;
public MissionConnectAdapter(String[] item_txt,Context context,int type,String name){
this.item_txt=item_txt;
this.context=context;
this.type=type;
this.name=name;
}
public int getCount() {
return item_txt.length;
}
@Override
public Object getItem(int arg0) {
return item_txt[arg0];
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.mission_item_detail_flow, null);
holder.item_name=(TextView)convertView.findViewById(R.id.item_name);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_name.setText(item_txt[position]);
final int index=position;
holder.item_name.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(context,MissionDetailsActivity.class);
it.putExtra("find_item",item_txt[index]);
it.putExtra("souce_type",type);
it.putExtra("souce_name",""+name);
it.putExtra("type","about");
it.putExtra("index",index);
context.startActivity(it);
}
});
return convertView;
}
}```
CardShareAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.parse.Deck;
import java.util.ArrayList;
import java.util.List;
public class CardShareAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public TextView value;
public TextView userName;
public TextView limit;
}
private List<Deck> list=new ArrayList<>();
private Context context;
public CardShareAdapter(List<Deck> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_card_share, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.value=(TextView)convertView.findViewById(R.id.value);
holder.limit=(TextView)convertView.findViewById(R.id.type);
holder.userName=(TextView)convertView.findViewById(R.id.creater);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
String point="战斗力："+list.get(position).getValue();
holder.name.setText(list.get(position).getName());
holder.value.setText(point);
holder.limit.setText(list.get(position).getLimit());
holder.userName.setText(list.get(position).getUserName());
return convertView;
}
}```
DialogEvent.java
```package com.key.doltool.event;
import android.app.Activity;
import android.app.Dialog;
import android.content.Intent;
import android.net.Uri;
import android.provider.MediaStore;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.core.MainActivity;
import com.key.doltool.activity.person.PersonActivity;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.ExitApplication;
import com.key.doltool.util.StringUtil;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import java.io.File;
import java.util.List;
import cn.leancloud.AVUser;
public class DialogEvent {
private String select_if;
private List<String> select_args;
public DialogEvent(){
}
public DialogEvent(String select_if,List<String> select_args){
this.select_args=select_args;
this.select_if=select_if;
}
/**
* 选择对话框
* @param context 所在界面的上下文
* **/
public void itemDialog(final ListFlowHelper listFlowHelper, Activity context){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.panel_mission_tag, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
RelativeLayout.LayoutParams params = new RelativeLayout.LayoutParams(CommonUtil.getScreenWidth(context)-30,
LayoutParams.MATCH_PARENT);
params.addRule(RelativeLayout.ALIGN_PARENT_BOTTOM);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view,params);
updateDialog.show();
LinearLayout layout1=(LinearLayout)view.findViewById(R.id.line1);
LinearLayout layout2=(LinearLayout)view.findViewById(R.id.line2);
layout1.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
select_if+=" and tag=?";
select_args.add("1");
listFlowHelper.change_if(select_if,select_args);
updateDialog.dismiss();
}
});
layout2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
select_if+=" and tag=?";
select_args.add("0");
listFlowHelper.change_if(select_if,select_args);
updateDialog.dismiss();
}
});
}
/**
* loading对话框
* @param txt 要显示的TextView
* @param context 所在界面的上下文
* **/
public Dialog itemDialog(Activity context,String txt){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.loading_layout, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(false);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(context)-30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
TextView loading_txt=(TextView)view.findViewById(R.id.loaing_txt);
if(!StringUtil.isNull(txt)){
loading_txt.setText(txt);
}
return updateDialog;
}
/**
* 确认对话框
* @param title 要显示的标题
* @param message 显示的内容
* @param anime 动画ID
* **/
public void materialDialog(int anime,String title,String message,final Activity context,final int num){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.panel_material_dialog, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(LayoutParams.MATCH_PARENT,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
if(anime!=0){
updateDialog.getWindow().setWindowAnimations(anime);
}
updateDialog.setContentView(view, params);
updateDialog.show();
TextView title_view=(TextView)view.findViewById(R.id.title);
TextView content=(TextView)view.findViewById(R.id.message);
title_view.setText(title);
content.setText(message);
FlatButton confrim=(FlatButton)view.findViewById(R.id.confrim);
FlatButton cancel=(FlatButton)view.findViewById(R.id.cancel);
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
updateDialog.dismiss();
}
});
confrim.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if (context instanceof MainActivity) {
ExitApplication.getInstance().exit();
}
if (context instanceof PersonActivity) {
judge(num, (PersonActivity) context);
}
updateDialog.dismiss();
}
});
}
/**
* 选择获取图片方式对话框
* @param temp_url 缓存路径
* @param context 所在界面的上下文
* **/
public void pictureWayDialog(final String temp_url,final Activity context){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.pop_chose, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
RelativeLayout.LayoutParams params = new RelativeLayout.LayoutParams(CommonUtil.getScreenWidth(context)-30,
LayoutParams.MATCH_PARENT);
params.addRule(RelativeLayout.ALIGN_PARENT_BOTTOM);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
if(!context.isFinishing()){
updateDialog.show();
}
TextView photo_btn=(TextView)view.findViewById(R.id.photo_btn);
TextView file_btn=(TextView)view.findViewById(R.id.file_btn);
photo_btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if (CommonUtil.hasSDCard()) {
Intent intent = new Intent(MediaStore.ACTION_IMAGE_CAPTURE);
intent.putExtra(MediaStore.EXTRA_OUTPUT, Uri.fromFile(new File(temp_url)));
context.startActivityForResult(intent, 1);
updateDialog.dismiss();
} else {
Toast.makeText(context.getApplicationContext(), "没有检测到SD卡，无法进行拍照", Toast.LENGTH_LONG).show();
updateDialog.dismiss();
}
}
});
file_btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent galleryIntent = new Intent(
Intent.ACTION_PICK,android.provider.MediaStore.Images.Media.EXTERNAL_CONTENT_URI);
context.startActivityForResult(galleryIntent, 3);
updateDialog.dismiss();
}
});
}
private void judge(int num,PersonActivity context){
switch(num){
//0:数据同步
case 0:
context.syncInfo(AVUser.getCurrentUser().getUsername());
break;
//1：重置密码
case 1:
context.resetPassword();
break;
//2：注销用户
case 2:
AVUser.logOut();
Intent intent = new Intent(context,MainActivity.class);
context.setResult(Activity.RESULT_OK, intent);
context.finish();
break;
}
}
public Dialog showLoading(Activity context){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.loading_layout, null);
final Dialog updateDialog = new Dialog(context,R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(false);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(LayoutParams.WRAP_CONTENT,
LayoutParams.WRAP_CONTENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
return updateDialog;
}
public Dialog showLoading(Activity context,String title){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.loading_layout, null);
final Dialog updateDialog = new Dialog(context,R.style.updateDialog);
updateDialog.setCancelable(false);
updateDialog.setCanceledOnTouchOutside(false);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(LayoutParams.WRAP_CONTENT,
LayoutParams.WRAP_CONTENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
TextView txt=(TextView)view.findViewById(R.id.loaing_txt);
txt.setText(title);
return updateDialog;
}
}
```
RecipeMainFragment.java
```package com.key.doltool.activity.recipe;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.GridView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.adapter.RecipeMainAdapter;
import com.key.doltool.event.BookEvent;
import butterknife.BindView;
public class RecipeMainFragment extends BaseFragment{
@BindView(R.id.gridView) GridView gridview;
private BookEvent event;
@Override
public int getContentViewId() {
return R.layout.recipe_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
event=new BookEvent();
setListener();
}
private void setListener(){
gridview.setAdapter(new RecipeMainAdapter(event.TYPE_BASE2,event.TYPE_BASE_PIC,getActivity()));
gridview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> parent, View view,
int position, long id) {
jump(position);
}
});
}
private void jump(int position){
Intent it=new Intent(getActivity(),RecipeBookListActivity.class);
it.putExtra("types",position+1);
startActivity(it);
}
}
```
City.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="City")
public class City {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//地区
@Column(name="area")
private String area;
//文化圈
@Column(name="culture")
private String culture;
//语言
@Column(name="lang")
private String lang;
//投资
@Column(name="invest")
private String invest;
//商品清单
@Column(name="trade_list")
private String trade_list;
//type(城市类型)
@Column(name="type")
private String type;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getArea() {
return area;
}
public void setArea(String area) {
this.area = area;
}
public String getCulture() {
return culture;
}
public void setCulture(String culture) {
this.culture = culture;
}
public String getLang() {
return lang;
}
public void setLang(String lang) {
this.lang = lang;
}
public String getInvest() {
return invest;
}
public void setInvest(String invest) {
this.invest = invest;
}
public String getTrade_list() {
return trade_list;
}
public void setTrade_list(String trade_list) {
this.trade_list = trade_list;
}
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
}
```
SailBoat.java
```package com.key.doltool.data;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="SailBoat")
public class SailBoat{
@Column(autoincrement=true,primary=true)
//ID
private int id;
@Column(name="pic_id")
//图片ID
private String pic_id;
@Column(name="type",default_value="0")
//类型
private int type;
@Column(name="size",default_value="0")
//大小
private int size;
@Column(name="way_id",default_value="0")
//用途
private int way_id;
@Column(name="name")
//名称
private String name;
@Column(name="health_boat")
//耐久
private int health_boat;
@Column(name="square_sail")
//横帆
private int square_sail;
@Column(name="fore_sail")
//纵帆
private int fore_sail;
@Column(name="paddle",default_value="0")
//桨力
private int paddle;
@Column(name="turn")
//转向
private int turn;
@Column(name="def_wave")
//抗浪
private int def_wave;
@Column(name="armor")
//装甲
private int armor;
@Column(name="people_number")
//人数
private int people_number;
@Column(name="crenelle")
//炮门
private int crenelle;
@Column(name="shipping_space")
//仓位
private int shipping_space;
@Column(name="level_m")
//冒等
private int level_m;
@Column(name="level_s")
//商等
private int level_s;
@Column(name="level_j")
//军等
private int level_j;
@Column(name="number_part")
//船装备
private String number_part;
@Column(name="people_must")
//必要人数
private int people_must;
@Column(name="ability")
//技能
private String ability;
@Column(name="get_way")
//获取方式
private String get_way;
@Column(name="plus_point")
//强化次数
private int plus_point;
@Column(name="recipe_way")
//生产方式
private String recipe_way;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getPic_id() {
return pic_id;
}
public void setPic_id(String pic_id) {
this.pic_id = pic_id;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public int getSize() {
return size;
}
public void setSize(int size) {
this.size = size;
}
public int getWay_id() {
return way_id;
}
public void setWay_id(int way_id) {
this.way_id = way_id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getSquare_sail() {
return square_sail;
}
public void setSquare_sail(int square_sail) {
this.square_sail = square_sail;
}
public int getFore_sail() {
return fore_sail;
}
public void setFore_sail(int fore_sail) {
this.fore_sail = fore_sail;
}
public int getPaddle() {
return paddle;
}
public void setPaddle(int paddle) {
this.paddle = paddle;
}
public int getTurn() {
return turn;
}
public void setTurn(int turn) {
this.turn = turn;
}
public int getDef_wave() {
return def_wave;
}
public void setDef_wave(int def_wave) {
this.def_wave = def_wave;
}
public int getArmor() {
return armor;
}
public void setArmor(int armor) {
this.armor = armor;
}
public int getPeople_number() {
return people_number;
}
public void setPeople_number(int people_number) {
this.people_number = people_number;
}
public int getCrenelle() {
return crenelle;
}
public void setCrenelle(int crenelle) {
this.crenelle = crenelle;
}
public int getShipping_space() {
return shipping_space;
}
public void setShipping_space(int shipping_space) {
this.shipping_space = shipping_space;
}
public int getLevel_m() {
return level_m;
}
public void setLevel_m(int level_m) {
this.level_m = level_m;
}
public int getLevel_s() {
return level_s;
}
public void setLevel_s(int level_s) {
this.level_s = level_s;
}
public int getLevel_j() {
return level_j;
}
public void setLevel_j(int level_j) {
this.level_j = level_j;
}
public String getNumber_part() {
return number_part;
}
public void setNumber_part(String number_part) {
this.number_part = number_part;
}
public int getPeople_must() {
return people_must;
}
public void setPeople_must(int people_must) {
this.people_must = people_must;
}
public int getHealth_boat() {
return health_boat;
}
public void setHealth_boat(int health_boat) {
this.health_boat = health_boat;
}
public String getGet_way() {
return get_way;
}
public void setGet_way(String get_way) {
this.get_way = get_way;
}
public String getAbility() {
return ability;
}
public void setAbility(String ability) {
this.ability = ability;
}
public String getRecipe_way() {
return recipe_way;
}
public void setRecipe_way(String recipe_way) {
this.recipe_way = recipe_way;
}
public int getPlus_point() {
return plus_point;
}
public void setPlus_point(int plus_point) {
this.plus_point = plus_point;
}
}```
VoyageMainFragment.java
```package com.key.doltool.activity.voyage;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.GridView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.search.SearchActivity;
import com.key.doltool.adapter.VoyageAdapter;
import com.key.doltool.data.VoyageInfo;
import com.key.doltool.data.VoyageItem;
import com.key.doltool.event.VoyageEvent;
import java.util.List;
import butterknife.BindView;
public class VoyageMainFragment extends BaseFragment{
@BindView(R.id.gridview) GridView gridView;
@BindView(R.id.search_view) TextView search_view;
private List<VoyageItem> list;
@Override
public int getContentViewId() {
return R.layout.activity_voyage;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
}
private void findView(){
VoyageInfo info=new VoyageInfo(context);
list=VoyageEvent.getItemByString(info.getData());
gridView.setAdapter(new VoyageAdapter(list,context));
}
private void setListener(){
gridView.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
VoyageEvent.jumpForVoyage(context,list.get(arg2));
}
});
search_view.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
startActivity(new Intent(context,SearchActivity.class));
}
});
}
}```
BookEvent.java
```package com.key.doltool.event;
import com.key.doltool.R;
public class BookEvent {
public final String[] TYPE_BASE={
"全部","烹饪","缝纫","铸造",
"工艺","保管","炼金","语言",
"特别","时代"
};
public final String[] TYPE_BASE2={
"烹饪","缝纫","铸造",
"工艺","保管","炼金","语言",
"特别","时代"
};
public final int[] TYPE_BASE_PIC={
R.drawable.ic_recipe_1,R.drawable.ic_recipe_2,R.drawable.ic_recipe_3,
R.drawable.ic_recipe_4,R.drawable.ic_recipe_5
};
public final String[] TITLE={
"全部","烹饪之道","缝纫巧思","铸造之基",
"工艺技术","保管方法","炼金天路","语言魅力",
"特别生产","时代配方"
};
public final int[] PIC_ID={
R.drawable.dol_book1,R.drawable.dol_book1,R.drawable.dol_book2,
R.drawable.dol_book3, R.drawable.dol_book4,R.drawable.dol_book5,
R.drawable.dol_book1,R.drawable.dol_book1, R.drawable.dol_book1,
R.drawable.dol_book1
};
}
```
NPCFragment.java
```package com.key.doltool.activity.adventure;
import android.app.Dialog;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.View;
import android.widget.ListView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.core.BaseFragmentActivity;
import com.key.doltool.adapter.NPCAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.NPCInfo;
import com.key.doltool.event.AreaEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
public class NPCFragment extends BaseFragment {
//定义部分
private Dialog layout_alert;
//船只列表页面
@BindView(R.id.listview)
ListView listview;
//数据temp变量
private NPCAdapter adapter;
private ListFlowHelper<NPCInfo> listFlowHelper;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.common_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
listFlowHelper = new ListFlowHelper<>(NPCInfo.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(), msg, Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter = new NPCAdapter(listFlowHelper.list, context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, NPCAdapter.SIZE);
viewHandler = new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what) {
case 0:
listFlowHelper.change(true);
break;
case 1:
listFlowHelper.change();
break;
}
DialogUtil.dismiss(context, layout_alert);
}
});
findView();
setListener();
if (listFlowHelper.list.size() == 0) {
new Thread(mTasks).start();
} else {
DialogUtil.dismiss(context, layout_alert);
}
}
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setHasOptionsMenu(true);
}
private Runnable mTasks = new Runnable() {
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 0;
viewHandler.sendMessage(message);
}
};
//通用findView
private void findView() {
initPage();
layout_alert = new DialogEvent().showLoading(context);
DialogUtil.show(context, layout_alert);
}
//通用Listener
private void setListener() {
BaseFragmentActivity a = (BaseFragmentActivity) getActivity();
a.toolbar.setOnMenuItemClickListener(onMenuItemClick);
}
private void initPage() {
initPageItem();
}
private void initPageItem() {
adapter = new NPCAdapter(listFlowHelper.list,context);
ListScrollListener listScrollListener = new ListScrollListener(layout_alert, viewHandler, context);
listFlowHelper.setListScrollListener(listScrollListener);
listview.setOnScrollListener(listScrollListener);
listview.setAdapter(adapter);
}
private void jump() {
View xc = getActivity().getLayoutInflater().inflate(R.layout.select_npc, null);
ViewUtil.popNPCDialog(listFlowHelper,context,xc);
}
private void findObject() {
new AreaEvent().showNPCCityDialog(listFlowHelper,context);
}
//系统按键监听覆写
@Override
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if (listFlowHelper.isChange()) {
return false;
}
//其他
else {
//按键返回
if (keyCode == KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:
findObject();
break;
case R.id.type_search:
jump();
break;
}
return true;
}
};
@Override
public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {
inflater.inflate(R.menu.adc_menu, menu);
super.onCreateOptionsMenu(menu, inflater);
}
}```
WikiMainActivity.java
```package com.key.doltool.activity.wiki;
import android.annotation.SuppressLint;
import android.app.Dialog;
import android.content.res.Configuration;
import android.os.Bundle;
import android.util.Log;
import android.view.Menu;
import android.view.MenuItem;
import android.webkit.WebChromeClient;
import android.webkit.WebResourceRequest;
import android.webkit.WebSettings;
import android.webkit.WebView;
import android.webkit.WebViewClient;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.data.sqlite.WikiInfo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.WebEvent;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.List;
import butterknife.BindView;
/**
* WIKI详情页面（web方式）
* @author key
* @version 0.4
* time 2013-1-2
*/
public class WikiMainActivity extends BaseActivity{
@BindView(R.id.content) WebView web_content;
private Dialog layout_alert;
private DefaultDAO dao;
private WikiInfo item;
@Override
public int getContentViewId() {
return R.layout.news_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(context);
findView();
init();
}
//获取数据，填充显示
@SuppressLint({"SetJavaScriptEnabled", "AddJavascriptInterface"})
private void init(){
initData();
web_content.getSettings().setJavaScriptEnabled(true);
web_content.getSettings().setUseWideViewPort(true);
web_content.getSettings().setCacheMode(WebSettings.LOAD_DEFAULT);
web_content.getSettings().setDomStorageEnabled(true);
web_content.getSettings().setJavaScriptCanOpenWindowsAutomatically(true);
web_content.getSettings().setBlockNetworkImage(false);
web_content.getSettings().setSupportZoom(true);
web_content.getSettings().setAppCacheEnabled(false);
web_content.setWebViewClient(new WebViewClient() {
public boolean shouldOverrideUrlLoading(WebView view,WebResourceRequest request) {
return false;// false 显示frameset, true 不显示Frameset
}
@Override
public void onPageFinished(WebView view, String url) {
super.onPageFinished(view, url);
DialogUtil.dismiss(context,layout_alert);
}
});
web_content.setWebChromeClient(new WebChromeClient() {
});
web_content.loadUrl(FileManager.WIKI + item.getSid());
web_content.addJavascriptInterface(new WebEvent(this), "jump");
}
//初始化控件
private void findView(){
layout_alert=new DialogEvent().showLoading(this);
DialogUtil.show(context,layout_alert);
}
private void initData(){
String id=getIntent().getStringExtra("id");
Log.i("id",id);
List<?> list=dao.select(WikiInfo.class, false, "id=?", new String[]{id}, null, null, null, null);
item=(WikiInfo)list.get(0);
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle(item.getName());
}
//返回顶部
private void backTop(){
web_content.scrollTo(0,0);
}
@Override
protected void onResume() {
super.onResume();
}
//缓存清空
@Override
protected void onDestroy() {
super.onDestroy();
web_content.clearCache(false);
}
@Override
public void onConfigurationChanged(Configuration newConfig) {
super.onConfigurationChanged(newConfig);
}
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.wiki_menu, menu);
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.back_top:
backTop();
break;
}
return true;
}
};
}```
TradeSimpleListAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.adapter.util.AdapterUtil;
import com.key.doltool.data.TradeCityItem;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class TradeSimpleListAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public ImageView pic;
public TextView price;
}
private List<TradeCityItem> list=new ArrayList<>();
private Context context;
private DefaultDAO dao;
private AdapterUtil util;
public TradeSimpleListAdapter(List<TradeCityItem> list,Context context){
this.list=list;
this.context=context;
dao=SRPUtil.getDAO(context);
util=new AdapterUtil(context, dao);
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.trade_simple_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
holder.price=(TextView)convertView.findViewById(R.id.price);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).name);
util.findByName(holder.pic,list.get(position).name,2);
if(list.get(position).invest.equals("")){
holder.price.setText(list.get(position).price);
}else{
holder.price.setText(list.get(position).price+"("+list.get(position).invest+")");
}
return convertView;
}
}```
AdventureDetailActivity.java
```package com.key.doltool.activity.adventure;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.ImageView;
import android.widget.RatingBar;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.flat.FlatButton;
import com.the9tcat.hadi.DefaultDAO;
import java.io.IOException;
import butterknife.BindView;
public class AdventureDetailActivity extends BaseActivity{
@BindView(R.id.txt) TextView name;
@BindView(R.id.feats) TextView feat;
@BindView(R.id.card_point) TextView card;
@BindView(R.id.need) TextView need;
@BindView(R.id.misson) TextView misson;
@BindView(R.id.details) TextView detail;
@BindView(R.id.img) ImageView pic;
@BindView(R.id.star) RatingBar rate;
@BindView(R.id.goto_mission) FlatButton goto_mission;
@BindView(R.id.need_txt) TextView need_txt;
@BindView(R.id.misson_txt) TextView misson_txt;
//数据
private Trove item;
private DefaultDAO dao;
@Override
public int getContentViewId() {
return R.layout.adventure_details;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
setListener();
init();
}
private void setListener(){
goto_mission.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent intent = new Intent(AdventureDetailActivity.this, MissionDetailsActivity.class);
intent.putExtra("find_item", item.getName());
intent.putExtra("type", getStringByType(item.getGetWay()));
startActivity(intent);
}
});
}
private void init(){
String names=getIntent().getStringExtra("name");
String names_tw=getIntent().getStringExtra("tw_name");
if(StringUtil.isNull(names)){
names=getIntent().getStringExtra("id")+"";
item=(Trove)(dao.select(Trove.class, false, "id = ?",new String[]{names}, null, null, null, null).get(0));
}else{
item=(Trove)(dao.select(Trove.class, false, "name = ? or name = ?",new String[]{names,names_tw}, null, null, null, null).get(0));
}
if(item.getType().equals("港口")){
need_txt.setText("港口区域");
misson_txt.setText("许可证");
}
//区分获取类别
if(item.getGetWay()==3){
need_txt.setText("钓鱼地点");
}else if(item.getGetWay()==2){
need_txt.setText("书库地图");
}else if(item.getGetWay()==5){
need_txt.setText("地下城");
}
name.setText(item.getName());
try {
pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(getAssets().open(FileManager.TROVE+item.getPic_id()+".jpg")));
} catch (IOException e) {
pic.setImageResource(R.drawable.dol_trove_defalut);
}
rate.setRating(item.getRate());
feat.setText(String.valueOf(item.getFeats()));
card.setText(String.valueOf(item.getCard_point()));
need.setText(item.getNeed());
misson.setText(item.getMisson());
detail.setText(item.getDetails());
}
private String getStringByType(int i){
String str="";
switch(i){
case 1:str="冒险任务";break;
case 2:str="书库地图";break;
case 3:str="钓鱼发现";break;
case 6:str="港口部落";break;
}
return str;
}
}```
HelpCenterFragment.java
```package com.key.doltool.activity.core;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.RelativeLayout;
import com.key.doltool.R;
import com.key.doltool.activity.help.HintListActivity;
import com.key.doltool.activity.help.WordListActivity;
import com.key.doltool.activity.setting.MessagePostActivity;
import com.key.doltool.activity.setting.MessageShowActivity;
import butterknife.BindView;
/**
* 单词表维护
* 一些hint
* **/
public class HelpCenterFragment extends BaseFragment {
@BindView(R.id.function_1) RelativeLayout fun1;
@BindView(R.id.function_2) RelativeLayout fun2;
@BindView(R.id.function_3) RelativeLayout fun3;
@BindView(R.id.function_4) RelativeLayout fun4;
@Override
public int getContentViewId() {
return R.layout.help_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
}
private void init(){
fun2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(getActivity(),HintListActivity.class);
getActivity().startActivity(it);
}
});
fun1.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(getActivity(),WordListActivity.class);
getActivity().startActivity(it);
}
});
fun3.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(getActivity(),MessagePostActivity.class);
startActivity(it);
}
});
fun4.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(getActivity(),MessageShowActivity.class);
startActivity(it);
}
});
}
}```
DensityUtil.java
```package com.key.doltool.util;
import android.app.Activity;
import android.content.Context;
import android.util.DisplayMetrics;
/**
* 单位转换工具类
* @author key
* @version 1.0
*/
public class DensityUtil {
/**
* dip转换pixel
* @param context
* @param dpValue
* @return pixel
*/
public static int dip2px(Context context, float dpValue) {
final float scale = context.getResources().getDisplayMetrics().density;
return (int) (dpValue * scale + 0.5f);
}
/**
* pixel转换dip
* @param context
* @param pxValue
* @return dip
*/
public static int px2dip(Context context, float pxValue) {
final float scale = context.getResources().getDisplayMetrics().density;
return (int) (pxValue / scale + 0.5f);
}
//获得宽
public static int getScreenWidth(Activity context) {
DisplayMetrics displaymetrics = new DisplayMetrics();
context.getWindowManager().getDefaultDisplay().getMetrics(displaymetrics);
return displaymetrics.widthPixels;
}
//获得高
public static int getScreenHeight(Activity context) {
DisplayMetrics displaymetrics = new DisplayMetrics();
context.getWindowManager().getDefaultDisplay().getMetrics(displaymetrics);
return displaymetrics.heightPixels;
}
}```
SystemInfo.java
```package com.key.doltool.data;
import android.annotation.SuppressLint;
import android.content.Context;
import android.content.SharedPreferences;
/**公共信息配置表**/
public class SystemInfo {
private SharedPreferences sp;
private SharedPreferences.Editor editor;
/**防止初始化因为手机异常失败，中途失败**/
public static final String OVER_FLAG="init_over";
/**记录自动更新的状态，默认为开启[1]**/
public static final String UPDATE_FLAG="update_start";
public static final String FIRST_FLAG="FIRST_FLAG";
@SuppressLint("CommitPrefEdits")
public SystemInfo(Context context){
sp=context.getSharedPreferences("system", Context.MODE_PRIVATE);
editor=sp.edit();
}
public int getOverFlag() {
return sp.getInt(OVER_FLAG, 0);
}
public int getUpdateFlag() {
return sp.getInt(UPDATE_FLAG,1);
}
public void setOverFlag(int flag) {
editor.putInt(OVER_FLAG, flag);
editor.commit();
}
public void setUpdateFlag(int flag) {
editor.putInt(UPDATE_FLAG, flag);
editor.commit();
}
public void setFirst(boolean flag) {
editor.putBoolean(FIRST_FLAG, flag);
editor.commit();
}
public boolean getFirst() {
return sp.getBoolean(FIRST_FLAG,false);
}
public void clear(){
editor.clear();
editor.commit();
}
}```
JsoupUtil.java
```package com.key.doltool.util.jsoup;
import android.content.Context;
import android.util.Log;
import com.google.gson.Gson;
import com.key.doltool.data.ADCSkill;
import com.key.doltool.data.SailBoat;
import com.key.doltool.data.TradeCityItem;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.data.sqlite.City;
import com.key.doltool.data.sqlite.Job;
import com.key.doltool.data.sqlite.NPCInfo;
import com.key.doltool.data.sqlite.Part;
import com.key.doltool.data.sqlite.Recipe;
import com.key.doltool.data.sqlite.RegularShip;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.util.NumberUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.select.Elements;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
/**
* 爬虫工具,主要用于爬取网络上的数据,再进行入库<br>
* 因为是网络数据，因此所有方法不能在UI线程中加载。
* @author key
* @version 0.1
*/
public class JsoupUtil {
/**DB源**/
public static String DB_BASE_URL="http://www.uwodb.com/tw/main.php?";
private final static String BOAT="id=145";
private final static String PART="id=146";
private final static String TRADE="id=141";
private final static String CITY="id=140";
private final static String JOB="id=142";
private final static String RECIPE="id=152";
private final static String SKILL="id=143";
private final static String ADC="id=144";
private final static String Z_PART="id=85000050";
private final static String NPC="id=85000016";
private final static String REGULAR_SHIP="id=85000018";
private final static String ME_ITEM="id=85000023";
private List<Integer> number=new ArrayList<>();
private String temp="";
public JsoupUtil(Context context){
}
public void getPicMe(SRPUtil dao){
Document doc;
try {
doc = Jsoup.connect(DB_BASE_URL+ME_ITEM).timeout(30*1000).get();
Elements img=doc.select("a").select("img");
for(int i=0;i<img.size();i++){
if(img.get(i).attr("title")!=null&&!img.get(i).attr("title").equals("")){
String urls=img.get(i).attr("src");
if(urls.contains("ITEM")){
String aurl=img.get(i).parents().select("a").attr("abs:href");
getItem(aurl,dao);
}
}
}
} catch (IOException e) {
e.printStackTrace();
}
}
public UseItem getItem(String url,SRPUtil dao){
Document doc;
UseItem useitem = null;
try {
doc = Jsoup.connect(url).timeout(30*1000).get();
Elements table=doc.select("div.INFO_BG_C0");
Elements item=table.select("li.item0");
Elements name=item.select("img");
Elements brs=item.select("br");
String temp="";
for(int i=0;i<brs.size();i++){
temp+=brs.get(i).nextSibling().outerHtml().trim();
}
if(!temp.contains("<a")&&!temp.contains("級別")&&!temp.contains("船体")){
List<String> type_temp=new ArrayList<>();
if(temp.contains("行動力")){
type_temp.add("食物");
}
if(temp.contains("消除疲勞")){
type_temp.add("消除疲劳");
}
if(temp.contains("壞血病")){
type_temp.add("坏血病");
}
if(temp.contains("實驗")){
type_temp.add("炼金");type_temp.add("实验");
}
if(temp.contains("親愛之證")){
type_temp.add("兑换");type_temp.add("酒馆礼物");
}
if(temp.contains("備忘錄")){
type_temp.add("翻译");
}
if(temp.contains("裝材")){
type_temp.add("装材");
}
if(temp.contains("營養套餐")){
type_temp.add("副料");
}
if(temp.contains("探險獎賞")){
type_temp.add("兑换");type_temp.add("地下城");
}
if(temp.contains("海戰")){
type_temp.add("海战");
}
if(temp.contains("肉搏戰")){
type_temp.add("肉搏战");
}
temp=temp.replace("・","·");
useitem=new UseItem();
useitem.name=StringUtil.TransToSimple(name.attr("title"));
useitem.info=StringUtil.TransToSimple(temp.replace("·","·").replace("‧", "·"));
String stemp="";
for(int k=0;k<type_temp.size();k++){
stemp+=type_temp.get(k)+",";
}
if(type_temp.size()==0){
stemp="其他,";
}
useitem.type=StringUtil.TransToSimple(stemp.substring(0,stemp.length()-1));
useitem.get_way="";
System.out.println(url);
System.out.println(useitem.name);
System.out.println(useitem.info);
System.out.println(useitem.type);
onlyOneInsertItem(useitem, dao);
}
} catch (IOException e) {
e.printStackTrace();
}
return useitem;
}
/**连接url**/
public List<String> getUrl(String url){
List<String> list=new ArrayList<>();
Document doc ;
try {
doc = Jsoup.connect(url).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli0");
for(int i=1;i<ul.size();i++){
Elements li=ul.get(i).select("li.item0");
Elements link =li.select("a");
for(int j=0;j<link.size();j++)
{
String abs_url=link.attr("abs:href");
if(!abs_url.equals("http://uwodbmirror.ivyro.net/cn/main.php?id="))
{
list.add(abs_url);
Log.i("abs_url",abs_url);
}
}
}
} catch (IOException e) {
e.printStackTrace();
}
return list;
}
/**连接url**/
public List<String> getUrlBoat(String url){
List<String> list=new ArrayList<>();
Document doc;
try {
doc = Jsoup.connect(url).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli0");
for(int i=1;i<ul.size();i++){
Elements li=ul.get(i).select("li.item3");
Elements link =li.select("a");
for(int j=0;j<link.size();j++)
{
String abs_url=link.attr("abs:href");
if(!abs_url.equals(DB_BASE_URL+"id="))
{
list.add(abs_url);
Log.i("abs_url",abs_url);
}
}
}
} catch (IOException e) {
e.printStackTrace();
}
return list;
}
/**炮要特殊处理**/
public List<String> getCannonUrl(){
number=new ArrayList<>();
List<String> list=new ArrayList<>();
for(int k=6;k<=11;k++){
Document doc;
try {
doc = Jsoup.connect(DB_BASE_URL+PART+"&chp="+k).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli0");
for(int i=1;i<ul.size();i++){
Elements li=ul.get(i).select("li.item0");
Elements link =li.select("a");
for(int j=0;j<link.size();j++){
String abs_url=link.attr("abs:href");
list.add(abs_url);
number.add(k);
Log.i("abs_url",abs_url);
}
}
} catch (IOException e) {
e.printStackTrace();
}
}
return list;
}
public void getBoat(DefaultDAO dao){
int x=0;
//获得小型船链接
List<String> list1=getUrl(DB_BASE_URL+BOAT+"&chp=4");
//获得中型船链接
List<String> list2=getUrl(DB_BASE_URL+BOAT+"&chp=5");
//获得大型船链接
List<String> list3=getUrl(DB_BASE_URL+BOAT+"&chp=6");
//第一步:小型船获取
for(int i=0;i<list1.size();i++){
Document doc;
try {
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
Elements tables=doc.select("div.table0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//强化次数
Log.i("ss", ""+tables.last().select("li.item11:contains(No.)"));
String plus=tables.last().select("li.item11:contains(No.)").text();
int point=getPlusPoint(plus);
Log.i("",point+"");
//---------------------------------------------------------------------------------
//名称
Elements img =li0.select("img");
//技能
Elements a=li0.select("a");
String ab="";
//去除专用舰的那个
for(int a_i=0;a_i<a.size()-1;a_i++){
Elements img2=a.get(a_i).select("img");
if(a_i!=a.size()-2)
ab+=img2.attr("title")+",";
else
ab+=img2.attr("title");
}
//纵帆
Elements state0=li1.select("div.state0");
//横帆
Elements state1=li1.select("div.state1");
//划船
Elements state2=li1.select("div.state2");
//转向
Elements state3=li1.select("div.state3");
//抗波
Elements state4=li1.select("div.state4");
//装甲
Elements state5=li1.select("div.state5");
//耐久
Elements state6=li1.select("div.state6");
//人数
Elements state7=li1.select("div.state7a");
//炮门
Elements state8=li1.select("div.state8");
//仓位
Elements state9=li1.select("div.state9");
//需求等级
Elements level1=li1.select("div.level1");
Elements level2=li1.select("div.level2");
Elements level3=li1.select("div.level3");
//part
Elements br=li1.select("br");
SailBoat sailboat=new SailBoat();
//some tmp
String people[]=state7.text().trim().split("/");
int must=Integer.parseInt(people[0]);
int max=Integer.parseInt(people[1]);
int level_m=0,level_s=0,level_j=0,paddle=0;
try{
level_m=Integer.parseInt(level1.text().trim());
}catch(Exception e){
level_m=0;
}
try{
level_s=Integer.parseInt(level2.text().trim());
}catch(Exception e){
level_s=0;
}
try{
level_j=Integer.parseInt(level3.text().trim());
}catch(Exception e){
level_j=0;
}
try{
paddle=Integer.parseInt(state2.text().trim());
}catch(Exception e){
paddle=0;
}
sailboat.setAbility(ab);
sailboat.setArmor(Integer.parseInt(state5.text().trim()));
sailboat.setCrenelle(Integer.parseInt(state8.text().trim()));
sailboat.setDef_wave(Integer.parseInt(state4.text().trim()));
sailboat.setFore_sail(Integer.parseInt(state0.text().trim()));
sailboat.setGet_way("");
sailboat.setRecipe_way("");
sailboat.setHealth_boat(Integer.parseInt(state6.text().trim()));
sailboat.setLevel_j(level_j);
sailboat.setLevel_s(level_s);
sailboat.setLevel_m(level_m);
sailboat.setName(img.attr("title"));
sailboat.setPaddle(paddle);
sailboat.setPlus_point(point);
sailboat.setPic_id("dol_"+"b"+i+"s"+x);
sailboat.setPeople_must(must);
sailboat.setPeople_number(max);
sailboat.setShipping_space(Integer.parseInt(state9.text().trim()));
sailboat.setNumber_part(getPart(br));
sailboat.setSize(x);
sailboat.setSquare_sail(Integer.parseInt(state1.text().trim()));
sailboat.setTurn(Integer.parseInt(state3.text().trim()));
sailboat.setWay_id(NumberUtil.getMaxForThree(level_m, level_s, level_j));
sailboat.setType(NumberUtil.isZero(paddle));
//避免重复
onlyOneInsertBoat(sailboat,dao);
//如果第一遍执行完了开始执行第二次
if(i==list1.size()-1&&x==0){
x=1;
list1=list2;
i=-1;
}
//如果第二遍执行完了开始执行第三次
if(i==list1.size()-1&&x==1)
{
x=2;
list1=list3;
i=-1;
}
}catch (IOException e) {
e.printStackTrace();
}
}
}
/**获得所有帆**/
public void getSail(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+PART+"&chp=3");
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//纵帆
Elements state0=li1.select("div.state0");
//横帆
Elements state1=li1.select("div.state1");
//转向
Elements state3=li1.select("div.state3");
//耐久
Elements state10=li1.select("div.state10");
//TEMP
String uid="dol_"+"eb"+i+"s";
//part部分
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(0);
part.setZtype(0);
part.setAdd(
"纵帆:"+state0.text().trim()+","+"横帆:"+state1.text().trim()+","+
"转向:"+state3.text().trim()+","+"耐久:"+state10.text().trim()
);
//避免重复
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**装备**/
public void getEquip(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+PART+"&chp=1");
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//耐久
Elements state10=li1.select("div.state10");
//效果
Elements tab=li1.select("div.INFO_TAB");
//TEMP
String uid="dol_"+"eb"+i+"e";
String ab=tab.first().nextSibling().toString();
//part部分
part.setPic_id(uid);
Log.i("x", ab);
part.setName(img.attr("title"));
part.setType(1);
part.setZtype(0);
part.setAdd(
"效果:"+ab+","+"耐久:"+state10.text().trim()
);
//避免重复
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**炮**/
public void getCannon(DefaultDAO dao){
List<String> list1=getCannonUrl();
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//耐久
Elements state10=li1.select("div.state10");
//贯穿力
Elements state17=li1.select("div.state17");
//射程
Elements state18=li1.select("div.state18");
//弹速
Elements state19=li1.select("div.state19");
//爆炸范围
Elements state20=li1.select("div.state20");
//装填速度
Elements state21=li1.select("div.state21");
//炮种类
String type=getCannonType(number.get(i));
//TEMP
String uid="dol_"+"eb"+i+"c";
//part部分
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(2);
part.setZtype(0);
part.setAdd(
"炮弹种类:" + type + "," + "贯穿力:" + state17.text().trim() + "," +
"射程:" + state18.text().trim() + "," + "弹速:" + state19.text().trim() + "," +
"爆炸范围:" + state20.text().trim() + "," + "装填速度:" + state21.text().trim() + "," +
"耐久:" + state10.text().trim()
);
Log.i("x", "id=" + i + " " + part.getAdd());
//避免重复
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**板子**/
public void getDef(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL + PART + "&chp=" + 2);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//耐久
Elements state10=li1.select("div.state10");
//装甲
Elements state11=li1.select("div.state11");
//航行速度
Elements state12=li1.select("div.state12");
//TEMP
String uid="dol_"+"eb"+i+"d";
//part部分
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(3);
part.setZtype(0);
part.setAdd(
"装甲:"+state11.text().trim()+","+"航行速度:"+state12.text().trim()+","+
"耐久:"+state10.text().trim()
);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**首**/
public void getTop(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+PART+"&chp="+4);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//耐久
Elements state10=li1.select("div.state10");
//灾害守护
Elements state13=li1.select("div.state13");
//减轻疲劳
Elements state14=li1.select("div.state14");
//掌握船员
Elements state15=li1.select("div.state15");
//回避炮弹
Elements state16=li1.select("div.state16");
//效果
Elements tab=li1.select("img");
//TEMP
String add="";
String uid="dol_"+"eb"+i+"t";
if(tab.attr("title").equals("")||tab.attr("title")==null){
add="";
}else{
add=","+"使用效果:"+tab.attr("title");
}
//part部分
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(4);
part.setZtype(0);
part.setAdd(
"灾害守护:"+state13.text().trim()+","+"减轻疲劳:"+state14.text().trim()+","+
"掌握船员:"+state15.text().trim()+","+"回避炮弹:"+state16.text().trim()+","+
"耐久:"+state10.text().trim()+add
);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getBody(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+Z_PART+"&chp="+12);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//TEMP
String uid="dol_"+"zb"+i+"b";
//耐久
Elements hp_add=li1.select("div.state6");
//划船
Elements paddle_add=li1.select("div.state2");
String str="";
if(hp_add.size()==2){
str+="耐久:"+hp_add.get(0).text().trim()+"~"+hp_add.get(1).text().trim();
}
if(paddle_add.size()==2){
str+=",桨力:"+paddle_add.get(0).text().trim()+"~"+paddle_add.get(1).text().trim();
}
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(5);
part.setZtype(1);
part.setAdd(
str
);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getMainSail(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+Z_PART+"&chp="+10);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//TEMP
String uid="dol_"+"zb"+i+"s";
//纵帆性能
Elements sail=li1.select("div.state0");
//横帆性能
Elements fore=li1.select("div.state1");
//转向性能
Elements turn=li1.select("div.state3");
//抗波
Elements def_wave=li1.select("div.state4");
String str="";
//纵帆的情况下
if(sail.size()==2){
str+="纵帆性能:"+sail.get(0).text().trim()+"~"+sail.get(1).text().trim();
if(fore.size()==2){
str+=",横帆性能:"+fore.get(0).text().trim()+"~"+fore.get(1).text().trim();
}
if(turn.size()==2){
str+=",转向:"+turn.get(0).text().trim()+"~"+turn.get(1).text().trim();
}
if(def_wave.size()==2){
str+=",抗波:"+turn.get(0).text().trim()+"~"+turn.get(1).text().trim();
}
}else{
str+="横帆性能:"+fore.get(0).text().trim()+"~"+fore.get(1).text().trim();
if(turn.size()==2){
str+=",转向:"+turn.get(0).text().trim()+"~"+turn.get(1).text().trim();
}
if(def_wave.size()==2){
str+=",抗波:"+def_wave.get(0).text().trim()+"~"+def_wave.get(1).text().trim();
}
}
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(6);
part.setZtype(1);
part.setAdd(str);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getMainCannon(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+Z_PART+"&chp="+11);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//TEMP
String uid="dol_"+"zb"+i+"c";
//炮门
Elements cannon=li1.select("div.state8");
String str="";
//纵帆的情况下
if(cannon.size()==2){
str+="炮门:"+cannon.get(0).text().trim()+"~"+cannon.get(1).text().trim();
}
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(7);
part.setZtype(1);
part.setAdd(str);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getEQ(DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+Z_PART+"&chp="+13);
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
Part part=new Part();
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
//TEMP
String uid="dol_"+"zb"+i+"e";
//耐久
Elements hp_add=li1.select("div.state6");
//划船
Elements paddle_add=li1.select("div.state2");
//纵帆性能
Elements sail=li1.select("div.state0");
//横帆性能
Elements fore=li1.select("div.state1");
//转向性能
Elements turn=li1.select("div.state3");
//抗波
Elements def_wave=li1.select("div.state4");
//装甲
Elements armor=li1.select("div.state5");
//炮门
Elements cannon=li1.select("div.state8");
//炮门
Elements space=li1.select("div.state9");
String str="";
int x=0;
//如果有耐久
if(hp_add.size()==2){
str+="耐久:"+hp_add.get(0).text().trim()+"~"+hp_add.get(1).text().trim();
x=0;
}else if(sail.size()==2){
str+="纵帆性能:"+sail.get(0).text().trim()+"~"+sail.get(1).text().trim();
x=1;
}else if(fore.size()==2){
str+="横帆性能:"+fore.get(0).text().trim()+"~"+fore.get(1).text().trim();
x=2;
}else if(paddle_add.size()==2){
str+="桨力:"+paddle_add.get(0).text().trim()+"~"+paddle_add.get(1).text().trim();
x=3;
}else if(turn.size()==2){
str+="转向:"+turn.get(0).text().trim()+"~"+turn.get(1).text().trim();
x=4;
}else if(def_wave.size()==2){
str+="抗波:"+def_wave.get(0).text().trim()+"~"+def_wave.get(1).text().trim();
x=5;
}else if(armor.size()==2){
str+="装甲:"+armor.get(0).text().trim()+"~"+armor.get(1).text().trim();
x=6;
}else if(cannon.size()==2){
str+="炮门:"+cannon.get(0).text().trim()+"~"+cannon.get(1).text().trim();
x=7;
}else if(space.size()==2){
str+="仓位:"+space.get(0).text().trim()+"~"+space.get(1).text().trim();
x=8;
}
str+=setEq(hp_add,sail,fore,paddle_add,turn,def_wave,armor,cannon,space,x);
part.setPic_id(uid);
part.setName(img.attr("title"));
part.setType(8);
part.setZtype(1);
part.setAdd(str);
Log.i("x","id="+i+" "+part.getAdd());
onlyOneInsertPart(part,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
/**交易品**/
public void getTradeItem(DefaultDAO dao,int type,int number){
List<String> list1=getUrl(DB_BASE_URL+TRADE+"&chp="+type);
for(int i=0;i<list1.size();i++){
TradeItem trade=new TradeItem();
Document doc = null;
try {
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
String name=img.attr("title");
String part1=li0.select("br").get(0).nextSibling().outerHtml();
String part2="";
if(li0.select("br").size()>1){
part2=li0.select("br").get(1).nextSibling().outerHtml();
}
String detail=part1.replaceAll(" ","")+part2;
String uid="dol_"+"t"+i+"s"+type;
String types=li1.select("img").get(0).attr("title");
String sp="";
Log.i("name",name);
Log.i("detail",detail);
Log.i("type",types);
if(li1.select("img").size()>1){
sp=li1.select("img").get(1).attr("title");
Log.i("sp",sp);
}
//生产，购买
Elements doc_ul=doc.select("ul.unli0");
String area="";
if(doc_ul.size()>1){
for(int j=1;j<doc_ul.size();j++){
String item=doc_ul.get(j).select("li.item0").select("img").attr("title");
if(j==doc_ul.size()-1){
if(!item.equals(""))
area+=item;
}else{
if(!item.equals(""))
area+=item+",";
}
}
if(area.endsWith(",")){
area=area.substring(0,area.length()-1);
}
Log.i("area",area+"");
}
String recipe="";
for(int d=1;d<table.size();d++){
recipe+=table.get(d).select("div").get(3).text().replaceAll(" ","")+" ";
}
recipe=recipe.replaceAll("\\d","").trim().replace(" ",",");
Log.i("item3","---"+recipe+"---");
//添加数据
trade.setName(StringUtil.TransToSimple(name));//名称
trade.setDetail(StringUtil.TransToSimple(detail));//描述
trade.setTrade(number);//商品类型
trade.setType(StringUtil.TransToSimple(types));//类型
trade.setPic_id(uid);//图片名
trade.setProducing_area(area);//生产地
trade.setSp(StringUtil.TransToSimple(sp));//特产文化圈
trade.setRecipe_way(StringUtil.TransToSimple(recipe));//生产方式
onlyOneInsertTrade(trade, dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public List<String> getRecipe(DefaultDAO dao,int type){
List<String> list=new ArrayList<>();
Document doc ;
try {
doc = Jsoup.connect(DB_BASE_URL+RECIPE+"&chp="+type).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli0");
for(int i=1;i<ul.size();i++){
Recipe re=new Recipe();
Elements item0=ul.get(i).select("li.item0");
String parent=item0.select("img").attr("title");
Log.i("", parent);
if(!parent.equals("")){
temp=parent;
}
Elements item2=ul.get(i).select("li.item2");
Elements item3=ul.get(i).select("li.item3");
Elements item5=ul.get(i).select("li.item5");
Elements a_item2=item2.select("a").select("img");
Log.i("", a_item2.html());
String need="";
for(int j=0;j<a_item2.size();j++){
if(j!=a_item2.size()-1)
need+=a_item2.get(j).attr("title")+",";
else
need+=a_item2.get(j).attr("title");
}
re.setParent_name(temp);
re.setNeed(need);
Log.i("item:"+temp,need);
Elements skill=item3.select("img");
String number="";
String[] temp=number.split(" ");
if(item3.select("br").size()>0){
number= item3.select("br").get(0).siblingElements().text();
temp=number.split(" ");
Log.i("item3",number);
}
String skill_txt="";
for(int p=0;p<skill.size();p++){
Log.i("k",skill.get(p).attr("title")+temp[p]+"|");
if(p!=skill.size()-1){
skill_txt+=skill.get(p).attr("title")+" "+temp[p]+",";
}else{
skill_txt+=skill.get(p).attr("title")+" "+temp[p];
}
}
re.setLevel_need(skill_txt);
Log.i("item3",item3.text().replace(number,""));
re.setName(item3.text().replace(number,""));
Log.i("item3", item5.text().replace(" ","\n"));
re.setResult_number( item5.text().replace(" ","\n"));
onlyOneInsertRecipe(re,dao);
}
} catch (IOException e) {
e.printStackTrace();
}
return list;
}
public void getNPC(DefaultDAO dao){
Document doc = null;
try {
doc = Jsoup.connect(DB_BASE_URL+NPC).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli1");
for(int i=1;i<ul.size();i++){
NPCInfo npc=new NPCInfo();
String area="";
String name="";
String love_type="";
String skill_tech="";
Elements li5=ul.get(i).select("li.item5");
area=li5.select("span").text();
name=li5.select("center").text();
Elements li6=ul.get(i).select("li.item6");
love_type=li6.select("img").attr("title");
Elements li7=ul.get(i).select("li.item7");
for(int j=0;j<li7.size();j++){
if(!li7.get(j).select("img").attr("title").equals("")){
skill_tech+=li7.get(j).select("img").attr("title")+",";
}
}
Elements li8=ul.get(i).select("li.item8");
if(!li8.select("img").attr("title").equals("")){
skill_tech+=li8.select("img").attr("title");
}
if(skill_tech.endsWith(",")){
skill_tech=skill_tech.substring(0,skill_tech.length()-1);
}
Log.i("x", area);
Log.i("x", name);
Log.i("x", love_type);
Log.i("x", skill_tech);
npc.setCity(area);
npc.setLove_type(love_type);
npc.setName(name);
npc.setSkill_tech(skill_tech);
onlyOneInsertNPC(npc, dao);
}
} catch (IOException e) {
e.printStackTrace();
}
}
public void getCity(int index,DefaultDAO dao){
List<String> list=getUrl(DB_BASE_URL+CITY+"&chp="+index);
Gson gson=new Gson();
for(int i=0;i<list.size();i++){
Document doc = null;
try {
City city=new City();
doc = Jsoup.connect(list.get(i)).timeout(30*1000).get();
Elements table=doc.select("div.table0");
//获得上部信息
Elements ul=table.select("div.INFO_BG_C0");
Elements ul0=table.select("ul.unli0");
Elements abox =table.select("a.BOX");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img0 =li0.select("img");
//文化圈
Elements img1 =li1.select("img");
String name=img0.attr("title");
String culture=img1.attr("title");
String area=abox.get(0).text();
String lang=abox.get(1).select("img").attr("title");
String invest="";
if(abox.size()>2){
String p=abox.get(abox.size()-1).nextSibling().outerHtml()+"";
if(!p.contains("b")){
invest=abox.get(abox.size()-1).select("img").attr("title")+p;
}
}
if(abox.size()>2){
if(!invest.equals("")){
for(int k=2;k<abox.size()-1;k++){
lang+=","+abox.get(k).select("img").attr("title");
}
}else{
for(int k=2;k<abox.size();k++){
lang+=","+abox.get(k).select("img").attr("title");
}
}
}
List<TradeCityItem> trade_list=new ArrayList<>();
for(int j=1;j<ul0.size();j++){
TradeCityItem item=new TradeCityItem();
Elements item2=ul0.get(j).select("li.item2");
Elements item4=ul0.get(j).select("li.item4");
String name_item=item2.select("img").attr("title");
String money=item4.text();
Log.i("city", money);
String[] temp=money.split(" ");
String gold_item=temp[0];
String invest_item="";
if(temp.length==5){
invest_item=temp[4];
}
if(!StringUtil.isNull(name_item)&&!StringUtil.isNull(gold_item)){
item.invest=invest_item;
item.name=name_item;
item.price=gold_item;
trade_list.add(item);
}
}
String trade=gson.toJson(trade_list);
Log.i("city", name);
Log.i("city", culture);
Log.i("city", area);
Log.i("city", lang);
Log.i("city", invest);
Log.i("city", trade);
city.setArea(StringUtil.TransToSimple(area));
city.setCulture(StringUtil.TransToSimple(culture));
city.setInvest(StringUtil.TransToSimple(invest));
city.setLang(StringUtil.TransToSimple(lang));
city.setName(StringUtil.TransToSimple(name));
city.setTrade_list(StringUtil.TransToSimple(trade));
if(index==1){
updateCity(i+1,city,dao);
}
if(index==2){
updateCity(i+12,city,dao);
}
if(index==3){
updateCity(i+27,city,dao);
}
if(index==4){
updateCity(i+49,city,dao);
}
if(index==5){
updateCity(i+74,city,dao);
}
if(index==6){
updateCity(i+81,city,dao);
}
if(index==7){
updateCity(i+96,city,dao);
}
if(index==8){
updateCity(i+104,city,dao);
}
if(index==9){
updateCity(i+108,city,dao);
}
if(index==10){
updateCity(i+112,city,dao);
}
if(index==11){
updateCity(i+127,city,dao);
}
if(index==12){
updateCity(i+135,city,dao);
}
if(index==13){
updateCity(i+156,city,dao);
}
if(index==14){
updateCity(i+164,city,dao);
}
if(index==15){
updateCity(i+175,city,dao);
}
// onlyOneInsertCity(city,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getSkill(int type,DefaultDAO dao){
List<String> list1;
if(type!=6){
list1=getUrl(DB_BASE_URL+SKILL+"&chp="+type);
}else{
list1=getUrlBoat(DB_BASE_URL+SKILL+"&chp="+type);
}
for(int i=0;i<list1.size();i++){
Skill skill=new Skill();
Document doc = null;
try {
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//名称
Elements img =li0.select("img");
String uid="dol_"+"sk"+i+"s"+type;
String name=img.attr("title");
String detail=li0.text();
Elements li1=ul.select("li.item1");
Elements lv1=li1.select("div.level1");
Elements lv2=li1.select("div.level2");
Elements lv3=li1.select("div.level3");
Elements lv4=li1.select("div.level4");
Elements job=ul.select("img");
detail=detail.replaceAll(" ","").replace(name,"");
if(type==5){
String jobs=job.get(1).attr("title");
skill.setDetail(StringUtil.TransToSimple(detail));
skill.setDo_point("副");
skill.setName(StringUtil.TransToSimple(name));
skill.setNeed(StringUtil.TransToSimple(jobs));
skill.setPic_id(uid);
skill.setType(type);
}else if(type==6){
Log.i("s",""+list1.get(i));
String disgess=li1.select("div").get(0).nextSibling().outerHtml();
skill.setDetail(StringUtil.TransToSimple(detail));
skill.setDo_point(StringUtil.TransToSimple(disgess.trim()));
skill.setName(StringUtil.TransToSimple(name));
String skill_need="技能需求:";
Elements a=li1.select("a");
for(int s=0;s<a.size();s++){
skill_need+=a.get(s).select("img").attr("title")+a.get(s).nextSibling().outerHtml().replace("级别","");
}
skill.setNeed(StringUtil.TransToSimple(skill_need));
skill.setPic_id(uid);
skill.setType(type);
}
else{
String disgess=li1.select("div").get(0).nextSibling().outerHtml();
String lev1=lv1.text();
String lev2=lv2.text();
String lev3=lv3.text();
String lev4=lv4.text();
String lv_need="等级需求:"+lev1+"/"+lev2+"/"+lev3;
String pay="学习费用:"+lev4;
String skill_need="技能需求:";
Elements a=li1.select("a");
for(int s=0;s<a.size();s++){
skill_need+=a.get(s).select("img").attr("title")+a.get(s).nextSibling().outerHtml().replace("级别","");
}
String need=lv_need+"|"+pay+"|"+skill_need;
skill.setDetail(StringUtil.TransToSimple(detail));
skill.setDo_point(StringUtil.TransToSimple(disgess.trim()));
skill.setName(StringUtil.TransToSimple(name));
skill.setNeed(StringUtil.TransToSimple(need));
skill.setPic_id(uid);
skill.setType(type);
}
Log.i("2",name);
Log.i("3",detail);
onlyOneInsertSkill(skill,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getJob(int type,DefaultDAO dao){
List<String> list1=getUrl(DB_BASE_URL+JOB+"&chp="+type);
Gson gson=new Gson();
for(int i=0;i<list1.size();i++){
Document doc = null;
try {
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item2");
Elements all0=doc.select("li.item0");
//名称
Elements img =li0.select("img");
String name=img.attr("title");
String detail=li0.text();
Elements li1=ul.select("li.item2");
Elements lv1=li1.select("div.level1");
Elements lv2=li1.select("div.level2");
Elements lv3=li1.select("div.level3");
Elements lv4=li1.select("div.level4");
Elements lv0=li1.select("div.level0");
String lev1=lv1.text();
String lev2=lv2.text();
String lev3=lv3.text();
String lev4=lv4.text();
String lev0=lv0.text();
String lv_need="等级需求:"+lev1+"/"+lev2+"/"+lev3+lev0.replace("Total ","合计:");
String pay="学习费用:"+lev4;
String need=lv_need+"|"+pay+"|";
detail=detail.replaceAll(" ","").replace(name,"").split("轉職")[0];
String sp="";
List<String> list=new ArrayList<String>();
for(int j=0;j<all0.size()-1;j++){
Elements item0=all0.get(j).select("li.item0");
if(j==0){
if(item0.select("img").get(0).attr("title").contains("專")){
sp=item0.select("img").get(1).attr("title");
}
}
if(sp.equals("")){
list.add(item0.select("img").get(1).attr("title"));
}else{
if(j!=0){
list.add(item0.select("img").get(1).attr("title"));
}
}
}
String metal =all0.get(all0.size()-1).select("img").get(0).attr("title");
String good_list=gson.toJson(list);
Job job=new Job();
job.setDetail(StringUtil.TransToSimple(detail));
job.setGood_list(StringUtil.TransToSimple(good_list));
job.setName(StringUtil.TransToSimple(name));
job.setMetal(StringUtil.TransToSimple(metal));
job.setSp(StringUtil.TransToSimple(sp));
job.setChang_if(StringUtil.TransToSimple(need));
job.setType(type);
Log.i("1",name);
Log.i("2",detail);
Log.i("3",need);
Log.i("4",metal);
Log.i("5",sp);
Log.i("6",good_list);
onlyOneInsertJob(job,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
public void getADC(int type,DefaultDAO dao){
Gson gson=new Gson();
List<String> list1=getUrl(DB_BASE_URL+ADC+"&chp="+type);
for(int i=0;i<list1.size();i++){
ADCInfo adc=new ADCInfo();
Document doc = null;
try {
//遍历链接
doc = Jsoup.connect(list1.get(i)).timeout(30*1000).get();
//获得总体
Elements table=doc.select("div.INFO_BG_C0");
//获得上部信息
Elements ul=table.select("ul.unli0");
Elements ulx=doc.select("div.table0").select("ul.unli0");
//左边信息
Elements li0=ul.select("li.item0");
//右边信息
Elements li1=ul.select("li.item1");
//名称
Elements img =li0.select("img");
String name=img.attr("title");
Elements span=li1.select("span");
String sex=span.get(0).text();
String city=span.get(1).text();
List<ADCSkill> skill_list=new ArrayList<>();
Log.i("",""+ulx.size());
for(int j=1;j<ulx.size();j++){
ADCSkill adc_skill=new ADCSkill();
Elements item0=ulx.get(j).select("li.item0");
adc_skill.setName( item0.select("a").text());
Log.i("",""+adc_skill.getName());
Elements item1=ulx.get(j).select("li.item1");
adc_skill.setNeed(StringUtil.TransToSimple(item1.text()));
skill_list.add(adc_skill);
}
String skill_list_txt= gson.toJson(skill_list);
String uid="dol_"+"adc"+i+"s"+type;
adc.setCity(city);
adc.setName(name);
adc.setSex(sex);
adc.setSkill_list(skill_list_txt);
adc.setType(type);
adc.setHead_img(uid);
Log.i("1", city);
Log.i("1", name);
Log.i("1", sex);
Log.i("1", skill_list_txt);
Log.i("1", type+"");
onlyOneInsertADC(adc,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertADC(ADCInfo item,DefaultDAO dao){
String[] x={item.getName()+""};
List<ADCInfo>list=(List<ADCInfo>) dao.select(ADCInfo.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(item);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertJob(Job item,DefaultDAO dao){
String[] x={item.getName()+""};
List<Job>list=(List<Job>) dao.select(Job.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(item);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertSkill(Skill item,DefaultDAO dao){
String[] x={item.getName()+""};
List<Skill>list=(List<Skill>) dao.select(Skill.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(item);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertTrade(TradeItem item,DefaultDAO dao){
String[] x={item.getName()+""};
List<TradeItem>list=(List<TradeItem>) dao.select(TradeItem.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(item);
else{
Log.i("s", item.getName());
dao.update(item,new String[]{"type","recipe_way","sp"} ,"name=?",x);
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertCity(City city,DefaultDAO dao){
String[] x={city.getName()+""};
List<City>list=(List<City>) dao.select(City.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(city);
else
dao.update(list.get(0),new String[]{"trade_list"} ,"name=?",x);
}
private void updateCity(int i,City city,DefaultDAO dao){
String[] x={i+""};
dao.update(city,new String[]{"trade_list"} ,"id=?",x);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertNPC(NPCInfo npc,DefaultDAO dao){
String[] x={npc.getName()+"",npc.getCity()+""};
List<NPCInfo>list=(List<NPCInfo>) dao.select(NPCInfo.class,
false, "name=? and city=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(npc);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertBoat(SailBoat boat,DefaultDAO dao){
String[] x={boat.getName()+""};
List<SailBoat>list=(List<SailBoat>) dao.select(SailBoat.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(boat);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertPart(Part part,DefaultDAO dao){
String[] x={part.getName()+""};
List<Part>list=(List<Part>) dao.select(Part.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(part);
}
@SuppressWarnings("unchecked")
private void onlyOneInsertItem(UseItem part,SRPUtil dao){
String[] x={part.name+""};
Log.i("s",""+x[0]);
List<UseItem>list=dao.select(UseItem.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0){
dao.insert(part);
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertRecipe(Recipe part,DefaultDAO dao){
String[] x={part.getName()+""};
List<Recipe>list=(List<Recipe>) dao.select(Recipe.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0&&!StringUtil.isNull(part.getName()))
dao.insert(part);
}
private String getCannonType(int item){
String x="";
if(item==6)
x="一般炮弹";
else if(item==7)
x="二连发炮弹";
else if(item==8)
x="葡萄炮弹";
else if(item==9)
x="锁链炮弹";
else if(item==10)
x="火焰弹";
else if(item==11)
x="烟幕弹";
return x;
}
private String getPart(Elements br){
//辅助帆
char part1=br.get(0).nextSibling().outerHtml().replaceAll("\\D","").charAt(0);
//船身炮
char part4=br.get(0).nextSibling().outerHtml().replaceAll("\\D","").charAt(1);
//特殊装备
char part5=br.get(1).nextSibling().outerHtml().replaceAll("\\D","").charAt(0);
//船首炮
char part2=br.get(1).nextSibling().outerHtml().replaceAll("\\D","").charAt(1);
//追加装甲
char part3=br.get(2).nextSibling().outerHtml().replaceAll("\\D","").charAt(0);
//船尾炮
char part6=br.get(2).nextSibling().outerHtml().replaceAll("\\D","").charAt(1);
String part=part1+","+part2+","+part3+","+part4+","+part5+","+part6;
return part;
}
private int getPlusPoint(String str){
//默认七
int temp=5+2;
if(str!=null){
if(!str.equals(""))
{
temp=Integer.parseInt(str.replaceAll("\\D",""));
}
if(temp>20)
{
String s=temp+"";
int x=Integer.parseInt(s.charAt(0)+"");
int y=Integer.parseInt(s.charAt(1)+"");
temp=x+y;
}
}
return temp;
}
private String setEq(Elements hp_add,Elements sail,Elements fore,Elements paddle_add,
Elements turn,Elements def_wave,Elements armor,Elements cannon,Elements space,int x){
String str="";
if(hp_add.size()==2&&x!=0){
str+=",耐久:"+hp_add.get(0).text().trim()+"~"+hp_add.get(1).text().trim();
}
if(sail.size()==2&&x!=1){
str+=",纵帆性能:"+sail.get(0).text().trim()+"~"+sail.get(1).text().trim();
}
if(fore.size()==2&&x!=2){
str+=",横帆性能:"+fore.get(0).text().trim()+"~"+fore.get(1).text().trim();
}
if(paddle_add.size()==2&&x!=3){
str+=",桨力:"+paddle_add.get(0).text().trim()+"~"+paddle_add.get(1).text().trim();
}
if(turn.size()==2&&x!=4){
str+=",转向:"+turn.get(0).text().trim()+"~"+turn.get(1).text().trim();
}
if(def_wave.size()==2&&x!=5){
str+=",抗波:"+def_wave.get(0).text().trim()+"~"+def_wave.get(1).text().trim();
}
if(armor.size()==2&&x!=6){
str+=",装甲:"+armor.get(0).text().trim()+"~"+armor.get(1).text().trim();
}
if(cannon.size()==2&&x!=7){
str+=",炮门:"+cannon.get(0).text().trim()+"~"+cannon.get(1).text().trim();
}
if(space.size()==2&&x!=8){
str+=",仓位:"+space.get(0).text().trim()+"~"+space.get(1).text().trim();
}
return str;
}
public void insertTest(DefaultDAO dao){
City city=new City();
city.setArea(StringUtil.TransToSimple("北美西岸"));
city.setCulture(StringUtil.TransToSimple(""));
city.setInvest(StringUtil.TransToSimple("抽奖券（No.5） 500,000"));
city.setLang(StringUtil.TransToSimple("北美诸语"));
city.setName(StringUtil.TransToSimple("旧金山"));
TradeCityItem item=new TradeCityItem();
city.setTrade_list(StringUtil.TransToSimple(""));
onlyOneInsertCity(city, dao);
}
public void getship(DefaultDAO dao){
try {
Document doc = Jsoup.connect(DB_BASE_URL+REGULAR_SHIP).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli0");
Log.i("1", "" + ul.size());
for(int i=1;i<ul.size();i++){
RegularShip regularShip=new RegularShip();
Elements li0=ul.get(i).select("li.item0");
Elements li1_1=ul.get(i).select("li.item1");
Elements li1_2=ul.get(i).select("li.item1");
Elements li2_1=ul.get(i).select("li.item2");
Elements li2_2=ul.get(i).select("li.item2");
String abs_url=li0.select("a").attr("abs:href");
List<String> list=getUrlTimeList(abs_url);
String name=StringUtil.TransToSimple(li0.text());
String start_city=StringUtil.TransToSimple(li1_1.get(0).text());
String end_city=StringUtil.TransToSimple(li1_2.get(1).text());
String money=StringUtil.TransToSimple(li2_1.get(0).text());
String time=StringUtil.TransToSimple(li2_2.get(1).text());
Log.i("1",name);
Log.i("2",start_city);
Log.i("3",end_city);
Log.i("4",money);
Log.i("5",time);
regularShip.name=name;
regularShip.start_city=start_city;
regularShip.end_city=end_city;
regularShip.money=money;
regularShip.time=time;
regularShip.time_list=new Gson().toJson(list);
dao.insert(regularShip);
}
} catch (IOException e) {
e.printStackTrace();
}
}
public List<String> getUrlTimeList(String url){
List<String> list=new ArrayList<>();
Document doc;
try {
doc = Jsoup.connect(url).timeout(30*1000).get();
Elements table=doc.select("div.table0");
Elements ul=table.select("ul.unli1");
Log.i("s",ul.size()+"");
for(int i=1;i<ul.size();i++){
Elements li=ul.get(i).select("li.item0");
for(int j=0;j<li.size();j++){
String str=li.get(j).text().trim().replace(" ", "");
if(!str.equals("")){
list.add(j+"w"+str);
}
}
}
} catch (IOException e) {
e.printStackTrace();
}
return list;
}
}```
CardAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Card;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.util.ResourcesUtil;
import java.util.ArrayList;
import java.util.List;
public class CardAdapter extends BaseAdapter{
private static class ViewHolder{
public RelativeLayout main;
public ImageView pic;
public TextView name;
public TextView point;
}
public static int SIZE=60;
private List<Card> list=new ArrayList<>();
private Context context;
public CardAdapter(List<Card> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Card getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_card, null);
holder.main=(RelativeLayout)convertView.findViewById(R.id.main);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.point=(TextView)convertView.findViewById(R.id.point);
holder.pic=(ImageView)convertView.findViewById(R.id.img);
// 为view设置标签
convertView.setTag(holder);
} else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
ImageLoader.picassoLoad(context,
FileManager.ROOT + FileManager.TROVE + list.get(position).pic_id + ".jpg",
holder.pic);
//设置
holder.name.setText(list.get(position).name);
updateBackground(position, holder);
String point=list.get(position).type+":"+list.get(position).point;
holder.point.setText(point);
return convertView;
}
public void updateBackground(int position,ViewHolder holder) {
if(list.get(position).flag==0){
holder.name.setTextColor(ResourcesUtil.getColor(R.color.Black_SP,context));
holder.point.setTextColor(ResourcesUtil.getColor(R.color.Black_SP,context));
holder.main.setBackgroundResource(R.drawable.material_card);
}else{
holder.name.setTextColor(ResourcesUtil.getColor(R.color.white,context));
holder.point.setTextColor(ResourcesUtil.getColor(R.color.white,context));
holder.main.setBackgroundResource(R.drawable.material_card_rex);
}
}
}
```
SailBoatActivity.java
```package com.key.doltool.activity.dockyard;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import android.content.Intent;
import android.graphics.Bitmap;
import android.os.Bundle;
import android.view.View;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.ScrollView;
import android.widget.TableLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.SailBoat;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.db.DataSelectUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
//import com.key.doltool.util.DataSelectUtil;
public class SailBoatActivity extends BaseActivity{
//数据
private List<SailBoat> list=new ArrayList<>();
private DefaultDAO dao;
private String[] temp=new String[3];
//控件显示(区域一:Base-基本)
@BindView(R.id.boat_name) TextView ship_name;
@BindView(R.id.boat_need) TextView need;
@BindView(R.id.boat_pic) ImageView boat_pic;
@BindView(R.id.type_1) TextView type1;
@BindView(R.id.type_2) TextView type2;
@BindView(R.id.type_3) TextView type3;
//控件显示(区域二:Ability-能力)
@BindView(R.id.square_sail_point) TextView vo_s;
@BindView(R.id.fore_sail_point) TextView vo_f;
@BindView(R.id.turn_point) TextView vo_tu;
@BindView(R.id.def_wave_point) TextView vo_de;
@BindView(R.id.paddle_point) TextView vo_p;
@BindView(R.id.health_boat_point) TextView bt_h;
@BindView(R.id.people_number_point) TextView bt_p;
@BindView(R.id.armor_point) TextView bt_a;
@BindView(R.id.crenelle_point) TextView bt_c;
@BindView(R.id.shipping_space_point) TextView bt_s;
//控件显示(区域三:GetWay-获得途径)
@BindView(R.id.line) TableLayout line;
//布局显示
@BindView(R.id.equip) RelativeLayout equip;
@Override
public int getContentViewId() {
return R.layout.dockyard_boat_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
init();
}
@SuppressWarnings("unchecked")
//获取数据，填充显示
private void init(){
int id=getIntent().getIntExtra("id",0);
String[] x={""+id};
list=(List<SailBoat>) dao.select(SailBoat.class, false, "id=?", x,
null, null, null, null);
ship_name.setText(list.get(0).getName());
String[] part=list.get(0).getNumber_part().split(",");
TextView[] equip_txt = new TextView[equip.getChildCount()];
for(int i=0;i<equip.getChildCount();i++){
equip_txt[i]=(TextView)equip.getChildAt(i);
equip_txt[i].append(""+part[i]);
}
try {
boat_pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(getAssets().open(FileManager.BOAT+list.get(0).getPic_id()+".png")));
} catch (IOException e) {
e.printStackTrace();
}
need.setText(list.get(0).getLevel_m()+"/"+list.get(0).getLevel_s()+"/"+list.get(0).getLevel_j());
temp=ViewUtil.setDataForType(list.get(0).getType(), list.get(0).getSize(), list.get(0).getWay_id());
type1.setText(temp[0]);
type2.setText(temp[1]);
type3.setText(temp[2]);
//能力
vo_s.setText(list.get(0).getSquare_sail()+"");
vo_f.setText(list.get(0).getFore_sail()+"");
vo_tu.setText(list.get(0).getTurn()+"");
vo_de.setText(list.get(0).getDef_wave()+"");
vo_p.setText(list.get(0).getPaddle()+"");
bt_h.setText(list.get(0).getHealth_boat()+"");
bt_p.setText(list.get(0).getPeople_must()+"/"+list.get(0).getPeople_number());
bt_a.setText(list.get(0).getArmor()+"");
bt_c.setText(list.get(0).getCrenelle()+"");
bt_s.setText(list.get(0).getShipping_space()+"");
List<MenuItem> ab;
ab=initMenuItem();
ViewUtil.fill_boat_detail(this,ab, line);
}
//初始化控件
private List<MenuItem> initMenuItem(){
String yx=list.get(0).getAbility();
String yy[]=yx.split(",");
List<MenuItem> ab=new ArrayList<>();
for (String aYy : yy) {
MenuItem item = new MenuItem();
item.name = aYy;
item.pic = DataSelectUtil.getSkillPicByName(aYy, dao);
ab.add(item);
}
return ab;
}
}
```
WordItem.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Word")
public class WordItem {
@Column(autoincrement=true,primary=true)
//id
public int id;
//国服名称
@Column(name="zh_name")
public String zh_name;
//台服名称
@Column(name="tw_name")
public String tw_name;
//类型
@Column(name="type")
public String type;
}
```
FileManager.java
```package com.key.doltool.util;
import android.content.Context;
/**
* 返回APP目录下的file
* 管理所有文件的目录
*/
public class FileManager {
public static String ROOT="file:///android_asset/";
public static String BOAT="dol_boat/";
public static String TROVE="dol_trove/";
public static String TRADE="dol_trade/";
public static String ITEM="dol_item/";
public static String SKILL="dol_skill/";
public static String VOYAGE="dol_voyage/";
public static String ADC="dol_adc/";
public static String WIKI="file:///android_asset/wiki_html/";
public static String DOWNLOAD="apk/";
public static final String IMAGE_FILE_LOCATION =getSaveFilePath()+"temp.png";
public static String getSaveFilePath() {
if (CommonUtil.hasSDCard()) {
return CommonUtil.getRootFilePath() + "dol_db/";
} else {
return CommonUtil.getRootFilePath() + "com.key.doltool/files/";
}
}
public static String getSaveFilePath(Context context) {
return context.getFilesDir().getPath();
}
}
```
AdapterUtil.java
```package com.key.doltool.adapter.util;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import android.content.Context;
import android.widget.ImageView;
import com.key.doltool.R;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.db.DataSelectUtil;
import com.the9tcat.hadi.DefaultDAO;
/**
* 列表图片关联缓存类<br>
* 用处：缓存列表中存在的关联图片id，以便加速载入
* **/
public class AdapterUtil {
private static HashMap<String,String> name_list=new HashMap<>();
private Context context;
private DefaultDAO dao;
public AdapterUtil(Context context, DefaultDAO dao){
this.context=context;
this.dao=dao;
}
/**分类查询**/
private String getPicByType(int type,String name){
String temp="";
if(type==1){
temp=DataSelectUtil.getSkillPicByName(name, dao);
}else if(type==2){
temp=DataSelectUtil.getTradePicByName(name, dao);
}else if(type==3){
temp=DataSelectUtil.getRecipePicByName(name, dao);
}
return temp;
}
/**寻找指定类型的图片并进行显示**/
public void findByName(ImageView view,String name,int type){
String url="";
boolean temp=true;
for(Map.Entry<String, String> parm :name_list.entrySet()){
if(parm.getKey().equals(name)){
url=parm.getValue();
temp=false;
break;
}else{
temp=true;
}
}
if(temp){
String temp_name=getPicByType(type,name);
url=temp_name;
name_list.put(name,temp_name);
}
try {
view.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(url+".png")));
} catch (IOException e) {
view.setImageResource(R.drawable.item_defalut);
}
}
public void clear(){
if(name_list!=null){
name_list.clear();
}else{
name_list=new HashMap<>();
}
}
}
```
AdventureListNewApiActivity.java
```package com.key.doltool.activity.adventure;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.os.Parcelable;
import android.util.Log;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.AdapterView;
import android.widget.GridView;
import android.widget.TextView;
import androidx.appcompat.view.ActionMode;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseAdventureActivity;
import com.key.doltool.adapter.TroveAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class AdventureListNewApiActivity extends BaseAdventureActivity{
@BindView(R.id.gridview) GridView gridview;
@BindView(R.id.null_txt) TextView txt;
private Dialog alert;
private List<Trove> list;
private List<Trove> temp_list=new ArrayList<>();
private DefaultDAO dao;
private SRPUtil srp;
private String type;
private UpdataCount count;
private String select_txt="";
private TroveAdapter mGridAdapter;
private ModeCallback mCallback;
private boolean MODE_FLAG=false;
private int keyCode=0;
private int[] temp_staus;
private ViewHandler mHandler;
@Override
public int getContentViewId() {
return R.layout.adventure_table;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
mHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
DialogUtil.dismiss(context,alert);
Parcelable state = gridview.onSaveInstanceState();
mGridAdapter=new TroveAdapter(list, AdventureListNewApiActivity.this);
gridview.setAdapter(mGridAdapter);
gridview.onRestoreInstanceState(state);
}
});
type=getIntent().getStringExtra("type");
dao=SRPUtil.getDAO(getApplicationContext());
srp=SRPUtil.getInstance(getApplicationContext());
count=new UpdataCount(this);
list=new ArrayList<>();
findView();
setListener();
new Thread(mTasks).start();
}
private void findView(){
alert=new DialogEvent().showLoading(this);
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle(type);
DialogUtil.show(context,alert);
}
/**批量标记**/
private void mutilMode() {
startSupportActionMode(mCallback);
MODE_FLAG=true;
}
//查询
public void select(String select){
select_txt=select;
List<Trove>list=srp.select(Trove.class, false, "type=? and name like ?",new String[]{type,"%"+select_txt+"%"}, null, null,"rate desc,feats desc", null);
if(list.size()==0){
txt.setVisibility(View.VISIBLE);
}else{
txt.setVisibility(View.GONE);
}
mGridAdapter=new TroveAdapter(list, AdventureListNewApiActivity.this);
gridview.setAdapter(mGridAdapter);
}
private void setListener(){
mCallback = new ModeCallback();
mGridAdapter=new TroveAdapter(list, AdventureListNewApiActivity.this);
gridview.setAdapter(mGridAdapter);
gridview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
if(MODE_FLAG){
int value = mGridAdapter.getItemState()[arg2] == 1 ? 0 : 1;
mGridAdapter.getItemState()[arg2] = value ;
mCallback.setSeletedCountShow();
mGridAdapter.notifyDataSetChanged();
}else{
Intent intent=new Intent(AdventureListNewApiActivity.this, AdventureDetailActivity.class);
intent.putExtra("id",mGridAdapter.getItem(arg2).getId()+"");
startActivity(intent);
}
}
});
gridview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> arg0, View arg1,
int position, long arg3) {
if (MODE_FLAG) {
return false;
} else {
if (mGridAdapter.getItem(position).getFind_flag() == 0) {
Trove trove = new Trove();
trove.setFind_flag(1);
dao.update(trove, new String[]{"flag"}, "id=? and type=?", new String[]{"" + mGridAdapter.getItem(position).getId(), type});
count.update_addMode(type, 1);
} else {
Trove trove = new Trove();
trove.setFind_flag(0);
dao.update(trove, new String[]{"flag"}, "id=? and type=?", new String[]{"" + mGridAdapter.getItem(position).getId(), type});
count.update_addMode(type, -1);
}
DialogUtil.show(context,alert);
new Thread(mTasks).start();
return true;
}
}
});
}
@Override
protected void onDestroy() {
list.clear();
//通知更新
RxBusEvent.get().post(RxBusEvent.UPDATE,true);
super.onDestroy();
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
if(!select_txt.equals("")){
select_txt="";
mGridAdapter=new TroveAdapter(list,this);
gridview.setAdapter(mGridAdapter);
Toast.makeText(getApplicationContext(), "重置搜索条件", Toast.LENGTH_LONG).show();
return true;
}
return super.onKeyDown(keyCode,event);
}
private Runnable mTasks =new Runnable(){
public void run() {
list=srp.select(Trove.class, false, "type=?",new String[]{type}, null, null,"rate desc,feats desc", null);
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
mHandler.sendMessage(mHandler.obtainMessage());
}
};
private class ModeCallback implements ActionMode.Callback {
private View mMultiSelectActionBarView;
private TextView mSelectedConvCount;
@Override
public boolean onCreateActionMode(ActionMode mode, Menu menu) {
keyCode=0;
// comes into MultiChoiceMode
MenuInflater inflater = getMenuInflater();
inflater.inflate(R.menu.multi_select_menu, menu);
if (mMultiSelectActionBarView == null) {
mMultiSelectActionBarView = LayoutInflater.from(AdventureListNewApiActivity.this)
.inflate(R.layout.list_multi_select_actionbar, null);
mSelectedConvCount =
(TextView)mMultiSelectActionBarView.findViewById(R.id.selected_conv_count);
}
mode.setCustomView(mMultiSelectActionBarView);
((TextView)mMultiSelectActionBarView.findViewById(R.id.title))
.setText("已选择");
Log.i("mGridAdapter",mGridAdapter.getCount()+"");
temp_staus=new int[mGridAdapter.getCount()];
for(int i=0;i<mGridAdapter.getCount();i++){
if (mGridAdapter.getItem(i).getFind_flag()==1) {
mGridAdapter.getItemState()[i] = 1;
temp_staus[i]=1;
gridview.setSelection(i);
} else {
mGridAdapter.getItemState()[i] = 0;
temp_staus[i]=0;
}
}
mGridAdapter.notifyDataSetChanged();
setSeletedCountShow();
return true;
}
@Override
public boolean onPrepareActionMode(ActionMode mode, Menu menu) {
if (mMultiSelectActionBarView == null) {
ViewGroup v = (ViewGroup)LayoutInflater.from(AdventureListNewApiActivity.this)
.inflate(R.layout.list_multi_select_actionbar, null);
mode.setCustomView(v);
mSelectedConvCount = (TextView)v.findViewById(R.id.selected_conv_count);
}
android.view.MenuItem mItem = menu.findItem(R.id.action_slelect);
if(mGridAdapter.isAllChecked()){
mItem.setTitle("取消全选");
}else{
mItem.setTitle("全部选中");
}
return true;
}
@Override
public boolean onActionItemClicked(ActionMode mode,android.view.MenuItem item) {
switch (item.getItemId()) {
case R.id.action_slelect:
if(mGridAdapter.isAllChecked()){
mGridAdapter.uncheckAll();
//To-do
}else{
mGridAdapter.checkAll();
for(int i = 0;i<mGridAdapter.getCount();i++)
gridview.setSelection(i);
}
mGridAdapter.notifyDataSetChanged();
mSelectedConvCount.setText(String.valueOf(mGridAdapter.getCheckedItemCount()));
break;
default:
break;
}
return true;
}
@Override
public void onDestroyActionMode(ActionMode mode) {
MODE_FLAG=false;
if(keyCode==0){
//更新数据
updataForMutil();
}
}
public void setSeletedCountShow(){
mSelectedConvCount.setText(String.valueOf(mGridAdapter.getCheckedItemCount()));
}
}
private void updataForMutil() {
DialogUtil.show(context,alert);
new Thread(mTask_Muti).start();
}
private Runnable mTask_Muti =new Runnable(){
@SuppressWarnings("unchecked")
public void run() {
Log.i("start", "start");
int total=0;
boolean flag=false;
for(int i=0;i<mGridAdapter.getCount();i++){
if(mGridAdapter.getItemState()[i]==1&&mGridAdapter.getItemState()[i]!=temp_staus[i]){
Trove trove=mGridAdapter.getItem(i);
trove.setFind_flag(1);
flag=true;
temp_list.add(trove);
// dao.update(trove, new String[]{"flag"}, "id=? and type=?", new String[]{""+mGridAdapter.getItem(i).getId(),type});
}else if(mGridAdapter.getItemState()[i]==0&&mGridAdapter.getItemState()[i]!=temp_staus[i]){
Trove trove=mGridAdapter.getItem(i);
trove.setFind_flag(0);
flag=true;
temp_list.add(trove);
// dao.update(trove, new String[]{"flag"}, "id=? and type=?", new String[]{""+mGridAdapter.getItem(i).getId(),type});
}
if(mGridAdapter.getItemState()[i]==1){
total++;
}
}
srp.update_list(temp_list);
temp_list.clear();
if(flag){
count.update_adventure(type,total);
list=(List<Trove>)dao.select(Trove.class, false, "type=?",new String[]{type}, null, null,"rate desc,feats desc", null);
}
mHandler.sendMessage(mHandler.obtainMessage());
Log.i("over", "over");
}
};
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:popWindow();break;
case R.id.type_search:mutilMode();break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.trove_menu, menu);
return true;
}
}```
MainBroadFragment.java
```package com.key.doltool.activity.infobroad;
import android.app.Dialog;
import android.os.Bundle;
import android.os.Message;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.LinearLayout;
import android.widget.ListView;
import androidx.viewpager.widget.ViewPager;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.adapter.NewsAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.HttpUtil;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.jsoup.JsoupForTX;
import com.key.doltool.view.SlidingTabLayout;
import com.key.doltool.viewpage.MyPagerAdapter;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindColor;
import butterknife.BindView;
/**
* 新闻看板界面
* @author key
* @version 0.3
* 0.1-加入基本Activity的相关方法和操作<br>
* 0.2-加入ViewPager负责进行多个页面的切换，并加入显示效果<br>
* 0.3-加入有限ListView的展示<br>
* 0.4-加入进入动画
* 0.5-网络调整
*/
public class MainBroadFragment extends BaseFragment {
//ViewPager定义部分
@BindView(R.id.main_viewpagers)
ViewPager main_ViewPage;
@BindView(R.id.sliding_tabs)
SlidingTabLayout mSlidingTabLayout;
@BindView(R.id.main)
LinearLayout main;
@BindColor(R.color.white)
int white;
private View layout1, layout2, layout3;
private Dialog alert;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.news_main_area;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
new Thread(mTask).start();
}
private void findView() {
initPage();
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
//更新页面
if (HttpUtil.STATE == 0) {
initPageItem();
if (JsoupForTX.list3.size() != 0)
DialogUtil.dismiss(context,alert);
} else {
DialogUtil.dismiss(context,alert);
}
ViewUtil.disableSubControls(main, true);
}
});
alert = new DialogEvent().showLoading(getActivity());
DialogUtil.show(context,alert);
if (JsoupForTX.list3.size() != 0) {
DialogUtil.dismiss(context,alert);
}
}
private void setListener() {
}
private void initPage() {
//初始化layout相关
List<View> main_list = new ArrayList<>();
LayoutInflater mInflater = getActivity().getLayoutInflater();
//添加布局文件
layout1 = mInflater.inflate(R.layout.news_main_item_layout, null);
layout2 = mInflater.inflate(R.layout.news_main_item_layout, null);
layout3 = mInflater.inflate(R.layout.news_main_item_layout, null);
main_list.add(layout1);
main_list.add(layout2);
main_list.add(layout3);
//初始化ViewPager相关
MyPagerAdapter main_adapter = new MyPagerAdapter(main_list, new String[]{"新闻", "活动", "公告"});
main_ViewPage.setAdapter(main_adapter);
main_ViewPage.setCurrentItem(0);
//初始化PageItem
initPageItem();
//初始化PageEvent相关
mSlidingTabLayout.setSelectedIndicatorColors(white);
mSlidingTabLayout.setBackgroundResource(R.drawable.theme_dark_blue);
mSlidingTabLayout.setViewPager(main_ViewPage);
}
private void initPageItem() {
//初始化第一页
ListView listview1 = (ListView) layout1.findViewById(R.id.listview);
listview1.setAdapter(new NewsAdapter(JsoupForTX.list1, getActivity()));
//初始化第二页
ListView listview2 = (ListView) layout2.findViewById(R.id.listview);
listview2.setAdapter(new NewsAdapter(JsoupForTX.list2, getActivity()));
//初始化第三页
ListView listview3 = (ListView) layout3.findViewById(R.id.listview);
listview3.setAdapter(new NewsAdapter(JsoupForTX.list3, getActivity()));
}
//获得数据
private Runnable mTask = new Runnable() {
public void run() {
while (JsoupForTX.list3.size() == 0 && HttpUtil.STATE == 0) {
JsoupForTX.getUrl();
viewHandler.sendMessage(viewHandler.obtainMessage());
}
if (HttpUtil.STATE == 1 && alert.isShowing()) {
viewHandler.sendMessage(viewHandler.obtainMessage());
}
}
};
}
```
ADCSkill.java
```package com.key.doltool.data;
public class ADCSkill {
//技能名
private String name;
//习得等级需求
private String need;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getNeed() {
return need;
}
public void setNeed(String need) {
this.need = need;
}
}
```
MessageShowActivity.java
```package com.key.doltool.activity.setting;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.Calendar;
import java.util.List;
import java.util.Locale;
import android.app.Dialog;
import android.os.Bundle;
import android.view.View;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.MessageAdapter;
import com.key.doltool.data.Message;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.view.Toast;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVObject;
import cn.leancloud.AVQuery;
import cn.leancloud.callback.FindCallback;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
public class MessageShowActivity extends BaseActivity{
@BindView(R.id.listview) ListView listview;
private List<Message> list=new ArrayList<>();
private Dialog alert;
@Override
public int getContentViewId() {
return R.layout.message_show;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
toolbar.setTitle("本月作者留言");
alert=new DialogEvent().showLoading(this);
alert.show();
postMessage();
}
//显示作者的留言
private void postMessage(){
AVQuery<AVObject> query= AVQuery.getQuery("message_maker");
Calendar curDate=Calendar.getInstance();
int year=curDate.get(Calendar.YEAR);
int month=curDate.get(Calendar.MONTH)+1;
String data=year+"."+month;
query.whereEqualTo("date",data).orderByDescending("time");
query.findInBackground().subscribe(new Observer<List<AVObject>>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(List<AVObject> avObjects) {
if(!isFinishing()){
alert.dismiss();
}
show(avObjects);
}
@Override
public void onError(Throwable e) {
if(!isFinishing()){
alert.dismiss();
}
Toast.makeText(getApplicationContext(),"连接失败", Toast.LENGTH_LONG).show();
}
@Override
public void onComplete() {
}
});
}
private void show(List<AVObject> objects){
SimpleDateFormat s=new SimpleDateFormat("yyyy.MM.dd hh:mm:ss",Locale.CHINA);
for(int i=0;i<objects.size();i++){
Message msg=new Message();
msg.time=s.format(objects.get(i).getDate("time").getTime());
msg.word= objects.get(i).getString("word");
list.add(msg);
}
listview.setAdapter(new MessageAdapter(list, this));
listview.setVisibility(View.VISIBLE);
}
}
```
ViewHandler.java
```package com.key.doltool.app.util;
import android.os.Handler;
import android.os.Message;
/**
* 通用-ViewHandler
*/
public class ViewHandler extends Handler {
private ViewCallBack viewCallBack;
public interface ViewCallBack{
void onHandleMessage(Message msg);
}
public ViewHandler(ViewCallBack viewCallBack) {
this.viewCallBack=viewCallBack;
}
@Override
public void handleMessage(Message msg) {
viewCallBack.onHandleMessage(msg);
}
}
```
FPagerAdapter.java
```package com.key.doltool.viewpage;
import androidx.fragment.app.Fragment;
import androidx.fragment.app.FragmentManager;
import androidx.fragment.app.FragmentPagerAdapter;
import androidx.viewpager.widget.PagerAdapter;
import java.util.List;
/**
* ViewPager-Adapter数据准备
* @author key
* @version 0.1
*/
public class FPagerAdapter extends FragmentPagerAdapter {
private List<Fragment> list;
private String[] title;
public FPagerAdapter(List<Fragment> list, String[] title, FragmentManager fm){
super(fm, BEHAVIOR_RESUME_ONLY_CURRENT_FRAGMENT);
this.title=title;
this.list=list;
}
//获得总页面数
public int getCount() {
return list.size();
}
@Override
public Fragment getItem(int arg0) {
return list.get(arg0);
}
@Override
public CharSequence getPageTitle(int position) {
return title[position];
}
@Override
public int getItemPosition(Object object) {
return PagerAdapter.POSITION_NONE;
}
}```
JsoupForTB.java
```package com.key.doltool.util.jsoup;
import com.key.doltool.util.HttpUtil;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.select.Elements;
public class JsoupForTB {
/**BAHA源**/
public static String TB_BASE_URL="http://tieba.baidu.com/p/";
/**获得数据**/
public static String getData(String id){
Document doc ;
String result="";
String str=TB_BASE_URL+id;
try {
doc = Jsoup.connect(str).timeout(30*1000).get();
Elements table=doc.select("div.i");
for(int i=0;i<table.size();i++){
Elements a=table.get(i).select("a[href]");
for(int j=0;j<a.size();j++){
String temp=a.get(j).attr("href");
if(temp.startsWith("http")&&temp.contains("quality")){
a.get(j).select("img.BDE_Image").get(0).attr("src",a.get(j).attr("href"));
}
a.get(j).removeAttr("href");
}
}
result=table.html();
} catch (Exception e) {
HttpUtil.STATE=1;
e.printStackTrace();
}
return result;
}
}
```
DevFragment.java
```package com.key.doltool.activity.core;
import android.os.Bundle;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import com.key.doltool.R;
public class DevFragment extends BaseFragment {
@Override
public int getContentViewId() {
return R.layout.dev_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
}
}```
JsoupForWiki.java
```package com.key.doltool.util.jsoup;
import java.io.IOException;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.select.Elements;
import android.util.Log;
public class JsoupForWiki {
/**BAHA源**/
public static String BAHA_BASE_URL="http://wiki.dahanghai.org/";
/**获得一级url**/
public String getUrl(int index){
String url="";
Document doc;
try {
doc = Jsoup.connect(BAHA_BASE_URL).timeout(30*1000).get();
//学校任务地址
Elements table=doc.select("div.BH-lbox ACG-mster_box2");
Elements ul=table.select("div.ACG-wikibox");
Elements scholl_link=ul.get(index).select("a");
url=scholl_link.attr("abs:href");
Log.i("abs_url",url);
} catch (IOException e) {
e.printStackTrace();
}
return url;
}
}
```
ListWordAdapter.java
```package com.key.doltool.adapter;
import android.app.Activity;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
public class ListWordAdapter extends BaseAdapter{
private String[] list;
private Activity context;
private static class ViewHolder{
public TextView txt;
}
public ListWordAdapter(String[] list,Activity context){
this.list=new String[list.length];
this.list=list;
this.context=context;
}
public int getCount() {
return list.length;
}
public Object getItem(int position) {
return list[position];
}
public long getItemId(int position) {
return position;
}
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertview
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_word, null);
holder.txt=(TextView)convertView.findViewById(R.id.txt);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
holder.txt.setText(list[position]);
return convertView;
}
}
```
HttpUtil.java
```package com.key.doltool.util;
public class HttpUtil {
//0正常，1异常
public static int STATE=0;
}
```
BuildBoatFragment.java
```package com.key.doltool.activity.dockyard;
import android.os.Bundle;
import android.view.View;
import android.widget.LinearLayout;
import android.widget.TextView;
import com.google.android.material.floatingactionbutton.FloatingActionButton;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.anime.MyAnimations;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.SailBoat;
import com.key.doltool.data.sqlite.Part;
import com.key.doltool.event.MakeEvent;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.NumberUtil;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import butterknife.BindView;
import io.reactivex.Observable;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
/**
* 造船模拟-0.1 基础功能模拟造船
* Created by key on 2016/12/16.
*/
public class BuildBoatFragment extends BaseFragment {
//造船模拟界面
@BindView(R.id.info_txt) TextView info_txt;
@BindView(R.id.show_broad) LinearLayout show_layout;
@BindView(R.id.ability) LinearLayout ability;
@BindView(R.id.choose_part) LinearLayout choose_part;
@BindView(R.id.sp_s) TextView sp_s;
@BindView(R.id.sp_c) TextView sp_c;
@BindView(R.id.sp_eq) TextView sp_eq;
@BindView(R.id.sp_eq2) TextView sp_eq2;
@BindView(R.id.square_sail_point) TextView vo_s;
@BindView(R.id.fore_sail_point) TextView vo_f;
@BindView(R.id.turn_point) TextView vo_tu;
@BindView(R.id.def_wave_point) TextView vo_de;
@BindView(R.id.paddle_point) TextView vo_p;
@BindView(R.id.health_boat_point) TextView bt_h;
@BindView(R.id.people_number_point) TextView bt_p;
@BindView(R.id.armor_point) TextView bt_a;
@BindView(R.id.crenelle_point) TextView bt_c;
@BindView(R.id.shipping_space_point) TextView bt_s;
@BindView(R.id.square_sail_add) TextView vo_s_a;
@BindView(R.id.fore_sail_add) TextView vo_f_a;
@BindView(R.id.turn_add) TextView vo_tu_a;
@BindView(R.id.def_wave_add) TextView vo_de_a;
@BindView(R.id.paddle_add) TextView vo_p_a;
@BindView(R.id.health_boat_add) TextView bt_h_a;
@BindView(R.id.armor_add) TextView bt_a_a;
@BindView(R.id.crenelle_add) TextView bt_c_a;
@BindView(R.id.shipping_space_add) TextView bt_s_a;
@BindView(R.id.build_btn) FlatButton plus_btn;
@BindView(R.id.action)
FloatingActionButton action;
private SRPUtil dao;
private SailBoat baseboat;
private int twice=0;
private List<Part> s_list=new ArrayList<>();
private List<Part> c_list=new ArrayList<>();
private List<Part> eq_list1=new ArrayList<>();
private List<Part> eq_list2=new ArrayList<>();
private HashMap<String,Integer> s_map=new HashMap<>();
private HashMap<String,Integer> c_map=new HashMap<>();
private HashMap<String,Integer> eq_map=new HashMap<>();
private HashMap<String,Integer> eq2_map=new HashMap<>();
private Part part_s,part_c,part_eq,part_eq2;
private int vo_s_add=0,vo_f_add=0,vo_de_add=0,vo_tu_add=0,vo_p_add=0;
private int bt_h_add=0,bt_a_add=0,bt_s_add=0,bt_c_add=0;
private Disposable menuItemSubscription,sailSubscription;
public int getContentViewId() {
return R.layout.dockyard_main_item_layout2;
}
protected void initAllMembersView(Bundle savedInstanceState) {
initData();
setListener();
}
private void initData(){
dao=SRPUtil.getInstance(context);
Observable<MenuItem> menuItemObservable = RxBusEvent.get().register(RxBusEvent.SAILMENU);
menuItemSubscription=menuItemObservable.subscribe(new Consumer<MenuItem>() {
@Override
public void accept(MenuItem item) {
}
});
Observable<SailBoat> sailBoatObservable = RxBusEvent.get().register(RxBusEvent.SAILBOAT);
sailSubscription=sailBoatObservable.subscribe(new Consumer<SailBoat>() {
@Override
public void accept(SailBoat item) {
if(item!=null) {
baseboat = item;
resetBuild();
refreshPage();
}
}
});
}
@Override
public void onDestroyView() {
super.onDestroyView();
RxBusEvent.get().unregister(RxBusEvent.SAILMENU);
RxBusEvent.get().unregister(RxBusEvent.SAILBOAT);
menuItemSubscription.dispose();
sailSubscription.dispose();
}
//选择船只后更新界面
private void refreshPage(){
info_txt.setText(baseboat.getName());
//部分界面元素显示
setData();
//船只体型限制
if(baseboat.getSize()==0){
setSpinner("小");
}else if(baseboat.getSize()==1){
setSpinner("中");
}else{
setSpinner("大");
}
final MakeEvent event=new MakeEvent(this);
//填充布局
sp_s.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.showPartDialog(s_list, sp_s,0);
}
});
sp_c.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.showPartDialog(c_list, sp_c,1);
}
});
sp_eq.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.showPartDialog(eq_list1, sp_eq,2);
}
});
sp_eq2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.showPartDialog(eq_list2, sp_eq2,3);
}
});
}
public void setPartChose(Part part,int number){
switch(number){
case 0:part_s=part;break;
case 1:part_c=part;break;
case 2:part_eq=part;break;
case 3:part_eq2=part;break;
}
}
private void setData(){
action.setVisibility(View.VISIBLE);
show_layout.setVisibility(View.VISIBLE);
//初始性能面板
vo_s.setText(String.valueOf(baseboat.getSquare_sail()));
vo_f.setText(String.valueOf(baseboat.getFore_sail()));
vo_tu.setText(String.valueOf(baseboat.getTurn()));
vo_de.setText(String.valueOf(baseboat.getDef_wave()));
vo_p.setText(String.valueOf(baseboat.getPaddle()));
bt_h.setText(String.valueOf(baseboat.getHealth_boat()));
bt_p.setText(String.valueOf(baseboat.getPeople_number()));
bt_a.setText(String.valueOf(baseboat.getArmor()));
bt_c.setText(String.valueOf(baseboat.getCrenelle()));
bt_s.setText(String.valueOf(baseboat.getShipping_space()));
//强化次数
plus_btn.setText("强化("+baseboat.getPlus_point()+")");
plus_btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(part_s==null){
Toast.makeText(context.getApplicationContext(),"至少要选择一个强化素材", Toast.LENGTH_SHORT).show();
return ;
}
//①强化次数变化
twice++;
if(baseboat.getPlus_point()-twice!=0){
plus_btn.setText("强化("+(baseboat.getPlus_point()-twice)+")");
//②性能变化
getPart();
}
//③强化完毕展示
else{
plus_btn.setVisibility(View.GONE);
}
}
});
}
//获取增量
private void getPart(){
if(part_s!=null)
s_map= NumberUtil.excute_add_info(part_s.getAdd());
else
s_map=NumberUtil.excute_add_info("A:0~0");
if(part_c!=null)
c_map=NumberUtil.excute_add_info(part_c.getAdd());
else
c_map=NumberUtil.excute_add_info("A:0~0");
if(part_eq!=null)
eq_map=NumberUtil.excute_add_info(part_eq.getAdd());
else
eq_map=NumberUtil.excute_add_info("A:0~0");
if(part_eq2!=null)
eq2_map=NumberUtil.excute_add_info(part_eq2.getAdd());
else
eq2_map=NumberUtil.excute_add_info("A:0~0");
plus_change();
}
//强化数据变化
private void plus_change(){
vo_s_add+=s_map.get("横帆性能")!=null?s_map.get("横帆性能"):0;
vo_f_add+=s_map.get("纵帆性能")!=null?s_map.get("纵帆性能"):0;
vo_de_add+=s_map.get("抗波")!=null?s_map.get("抗波"):0;
vo_tu_add+=s_map.get("转向")!=null?s_map.get("转向"):0;
bt_c_add+=c_map.get("炮门")!=null?c_map.get("炮门"):0;
set_map(eq_map);
set_map(eq2_map);
set_add_txt(vo_s_a,vo_s_add);
set_add_txt(vo_f_a,vo_f_add);
set_add_txt(vo_de_a,vo_de_add);
set_add_txt(vo_tu_a,vo_tu_add);
set_add_txt(vo_p_a,vo_p_add);
set_add_txt(bt_c_a,bt_c_add);
set_add_txt(bt_a_a,bt_a_add);
set_add_txt(bt_s_a,bt_s_add);
set_add_txt(bt_h_a,bt_h_add);
vo_s.setText(String.valueOf(baseboat.getSquare_sail()+vo_s_add));
vo_f.setText(String.valueOf(baseboat.getFore_sail()+vo_f_add));
vo_tu.setText(String.valueOf(baseboat.getTurn()+vo_tu_add));
vo_de.setText(String.valueOf(baseboat.getDef_wave()+vo_de_add));
vo_p.setText(String.valueOf(baseboat.getPaddle()+vo_p_add));
bt_h.setText(String.valueOf(baseboat.getHealth_boat()+bt_h_add));
bt_p.setText(String.valueOf(baseboat.getPeople_number()));
bt_a.setText(String.valueOf(baseboat.getArmor()+bt_a_add));
bt_c.setText(String.valueOf(baseboat.getCrenelle()+bt_c_add));
bt_s.setText(String.valueOf(baseboat.getShipping_space()+bt_s_add));
}
public void setSpinner(String str) {
s_list= dao.select(Part.class, false,"type=? and (name like ? or name like ?)",new String[]{"6","%"+str+"%","%德%"}
,null, null, null,null);
c_list= dao.select(Part.class, false,"type=? and name like ?",new String[]{"7","%"+str+"%"}
,null, null, null,null);
if(baseboat.getType()==0){
eq_list1= dao.select(Part.class, false,"type=? and name not like ?",new String[]{"8","%"+"桨"+"%"}
,null, null, null,null);
eq_list2= dao.select(Part.class, false,"type=? and name not like ?",new String[]{"8","%"+"桨"+"%"}
,null, null, null,null);
}else{
eq_list1= dao.select(Part.class, false,"type=?",new String[]{"8"}
,null, null, null,null);
eq_list2= dao.select(Part.class, false,"type=?",new String[]{"8"}
,null, null, null,null);
}
}
private void set_map(HashMap<String,Integer> map){
vo_s_add+=map.get("横帆性能")!=null?map.get("横帆性能"):0;
vo_f_add+=map.get("纵帆性能")!=null?map.get("纵帆性能"):0;
vo_de_add+=map.get("抗波")!=null?map.get("抗波"):0;
vo_tu_add+=map.get("转向")!=null?map.get("转向"):0;
vo_p_add+=map.get("桨力")!=null?map.get("桨力"):0;
bt_h_add+=map.get("耐久")!=null?map.get("耐久"):0;
bt_a_add+=map.get("装甲")!=null?map.get("装甲"):0;
bt_c_add+=map.get("炮门")!=null?map.get("炮门"):0;
bt_s_add+=map.get("仓位")!=null?map.get("仓位"):0;
}
//正负值判断，字体颜色变化
private void set_add_txt(TextView txt,int i){
if(i>0){
txt.setTextColor(ResourcesUtil.getColor(R.color.SpringGreen, getActivity()));
txt.setText("+"+i);
}
else if(i<0){
txt.setTextColor(ResourcesUtil.getColor(R.color.Crimson, getActivity()));
txt.setText(String.valueOf(i));
}
}
//重置造船数据
private void resetBuild(){
//第一步：数据重置
twice=0;
//①.强化数值重置
vo_s_add=0;vo_f_add=0;vo_de_add=0;vo_tu_add=0;vo_p_add=0;
bt_h_add=0;bt_a_add=0;bt_s_add=0;bt_c_add=0;
//第二步：界面重置
//①.重置附加值
vo_s_a.setText("");vo_f_a.setText("");vo_de_a.setText("");vo_tu_a.setText("");
vo_p_a.setText("");bt_h_a.setText("");bt_s_a.setText("");bt_c_a.setText("");
bt_a_a.setText("");
//②.重置选择
sp_s.setText(R.string.sp_hint1);sp_c.setText(R.string.sp_hint2);
sp_eq.setText(R.string.sp_hint3);sp_eq2.setText(R.string.sp_hint4);
//③.重置按钮
plus_btn.setVisibility(View.VISIBLE);
}
private void setListener(){
action.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(baseboat!=null){
if(ability.getVisibility()==View.VISIBLE){
MyAnimations.rotate3D(show_layout, ability, choose_part,320);
}else {
MyAnimations.rotate3D(show_layout, choose_part, ability,320);
}
}else{
Toast.makeText(context.getApplicationContext(),"请先挑选船只",Toast.LENGTH_SHORT).show();
}
}
});
}
}
```
WebMainFragment.java
```package com.key.doltool.activity.wiki;
import android.annotation.SuppressLint;
import android.app.Dialog;
import android.content.res.Configuration;
import android.os.Bundle;
import android.util.Log;
import android.view.Menu;
import android.view.MenuItem;
import android.webkit.WebChromeClient;
import android.webkit.WebResourceRequest;
import android.webkit.WebSettings;
import android.webkit.WebView;
import android.webkit.WebViewClient;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.data.sqlite.WikiInfo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.WebEvent;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.List;
import butterknife.BindView;
/**
* WIKI详情页面（web方式）
* @author key
* @version 0.4
* time 2013-1-2
*/
public class WebMainFragment extends BaseFragment {
@BindView(R.id.content) WebView web_content;
@Override
public int getContentViewId() {
return R.layout.news_detail_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
}
//获取数据，填充显示
@SuppressLint({"SetJavaScriptEnabled", "AddJavascriptInterface"})
private void init(){
String url= null;
if (getArguments() != null) {
url = getArguments().getString("url");
}
web_content.getSettings().setJavaScriptEnabled(true);
web_content.getSettings().setUseWideViewPort(true);
web_content.getSettings().setCacheMode(WebSettings.LOAD_DEFAULT);
web_content.getSettings().setDomStorageEnabled(true);
web_content.getSettings().setJavaScriptCanOpenWindowsAutomatically(true);
web_content.getSettings().setBlockNetworkImage(false);
web_content.getSettings().setSupportZoom(true);
web_content.getSettings().setAppCacheEnabled(false);
web_content.setWebViewClient(new WebViewClient() {
public boolean shouldOverrideUrlLoading(WebView view,WebResourceRequest request) {
return false;// false 显示frameset, true 不显示Frameset
}
});
web_content.setWebChromeClient(new WebChromeClient() {
});
web_content.loadUrl(FileManager.WIKI + url);
web_content.addJavascriptInterface(new WebEvent(getActivity()), "jump");
}
}```
JobListActivity.java
```package com.key.doltool.activity.job;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.ListView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.JobAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.Job;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
public class JobListActivity extends BaseActivity {
@BindView(R.id.listview) ListView listview;
//定义部分
private Dialog alert;
//数据temp变量
private JobAdapter adapter;
private ListFlowHelper<Job> listFlowHelper;
@Override
public int getContentViewId() {
return R.layout.card_combo_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
listFlowHelper.getExtra(getIntent());//外部搜索链接参数处理
listFlowHelper.selectshow("0," + JobAdapter.SIZE);
}
//通用findView
private void findView() {
listFlowHelper=new ListFlowHelper<>(Job.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new JobAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, JobAdapter.SIZE);
flag = false;
initToolBar(onMenuItemClick);
toolbar.setTitle("职业介绍所");
alert=new DialogEvent().showLoading(this);
initPage();
}
//通用Listener
private void setListener() {
listview.setOnItemClickListener(new OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
Intent it = new Intent(JobListActivity.this, JobDetailsActivity.class);
it.putExtra("id", adapter.getItem(arg2).getId() + "");
startActivity(it);
}
});
}
private void initPage() {
initPageItem();
}
private void initPageItem() {
listview = (ListView) findViewById(R.id.listview);
adapter = new JobAdapter(listFlowHelper.list, this);
ViewHandler handler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
DialogUtil.dismiss(context,alert);
}
});
ListScrollListener scrollListener = new ListScrollListener(alert,handler,this);
listFlowHelper.setListScrollListener(scrollListener);
listview.setOnScrollListener(scrollListener);
listview.setAdapter(adapter);
}
private void jump() {
View xc = getLayoutInflater().inflate(R.layout.select_job, null);
ViewUtil.popJobDialog(listFlowHelper,context, xc);
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if (listFlowHelper.isChange()) {
super.onKeyDown(keyCode, event);
} else {
//按键返回
if (keyCode == KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.search:
jump();
break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.main, menu);
return true;
}
}
```
QuizItem.java
```package com.key.doltool.data.item;
import java.util.List;
public class QuizItem {
//题目
public String title;
//选项
public List<String> quetion;
//答案
public int answer;
//插图问题
public String pic_id;
//问题难度
public String level;
//问题种类
public String type;
}
```
TradeItem.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="TradeItem")
public class TradeItem {
@Column(autoincrement=true,primary=true)
//ID
private int id;
@Column(name="pic_id")
//图片ID
private String pic_id;
@Column(name="name")
//名称
private String name;
@Column(name="detail")
//描述
private String detail;
@Column(name="type")
//商品种类
private String type;
@Column(name="trade",default_value="0")
//交易品类别
private int trade;
@Column(name="price",default_value="0")
//Base价格
private int price;
@Column(name="sp")
//特产与否(默认不是)
private String sp;
@Column(name="producing_area")
//出产地
private String producing_area;
@Column(name="recipe_way")
//配方名称
private String recipe_way;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getPic_id() {
return pic_id;
}
public void setPic_id(String pic_id) {
this.pic_id = pic_id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
public int getTrade() {
return trade;
}
public void setTrade(int trade) {
this.trade = trade;
}
public int getPrice() {
return price;
}
public void setPrice(int price) {
this.price = price;
}
public String getSp() {
return sp;
}
public void setSp(String sp) {
this.sp = sp;
}
public String getProducing_area() {
return producing_area;
}
public void setProducing_area(String producing_area) {
this.producing_area = producing_area;
}
public String getRecipe_way() {
return recipe_way;
}
public void setRecipe_way(String recipe_way) {
this.recipe_way = recipe_way;
}
public String getDetail() {
return detail;
}
public void setDetail(String detail) {
this.detail = detail;
}
}
```
MissionDetailsAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Mission;
public class MissionDetailsAdapter extends BaseAdapter{
private String[] item_txt={
"难度","技能需求","定金/报酬","经验/声望","时间限制","发现物","获得物品",
"接受任务地点","任务流程","前置任务","后续任务"
};
private static class ViewHolder{
public TextView item_name;
public TextView item_content;
}
private Mission item;
private Context context;
public MissionDetailsAdapter(Mission item,Context context){
this.item=item;
this.context=context;
}
public int getCount() {
return item_txt.length;
}
@Override
public Object getItem(int arg0) {
return item_txt[arg0];
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.mission_item_detail, null);
holder.item_name=(TextView)convertView.findViewById(R.id.item_name);
holder.item_content=(TextView)convertView.findViewById(R.id.item_content);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_name.setText(item_txt[position]);
holder.item_content.setText(getTextByPosition(position));
if(getTextByPosition(position).equals("")){
convertView.setVisibility(View.GONE);
}else{
convertView.setVisibility(View.VISIBLE);
}
return convertView;
}
private String getTextByPosition(int position){
String str="";
switch(position){
case 0:str=item.getLevel();break;
case 1:str=item.getSkill_need();break;
case 2:str=item.getMoney();break;
case 3:str=item.getExp();break;
case 4:str=item.getTime_up();break;
case 5:str=item.getFind_item();break;
case 6:str=item.getGet_item();break;
case 7:str=item.getStart_city();break;
case 8:str=stringChange(item.getDaily(),8);break;
case 9:str=stringChange(item.getBefore(),9);break;
case 10:str=stringChange(item.getAfter(),9);break;
}
return str;
}
private String stringChange(String str,int index){
if(index==8){
str=str.replaceAll(" ", "\n");
}else if(index==9){
str=str.replaceAll(",", "\n");
}else{
if(str==null){
str="";
}
}
return str;
}
}```
FishingActivity.java
```package com.key.doltool.activity.voyage.fishing;
import android.os.Bundle;
import androidx.fragment.app.Fragment;
import androidx.viewpager.widget.ViewPager;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.view.SlidingTabLayout;
import com.key.doltool.viewpage.FPagerAdapter;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
/**
* 钓鱼专题界面
* 钓鱼发现物，显示钓鱼地点，钓鱼交易品
* **/
public class FishingActivity extends BaseActivity {
@BindView(R.id.main_viewpagers) ViewPager main_ViewPage;
@BindView(R.id.sliding_tabs) SlidingTabLayout mSlidingTabLayout;
@Override
public int getContentViewId() {
return R.layout.system_viewpage_area;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
toolbar.setTitle("钓鱼");
initPage();
}
private void initPage(){
//初始化layout相关
List<Fragment> main_list = new ArrayList<>();
main_list.add(new FishingTroveFragment());
main_list.add(new FishingTradeFragment());
//初始化ViewPager相关
FPagerAdapter main_adapter = new FPagerAdapter(
main_list,new String[]{"钓鱼发现物","钓鱼交易品"},getSupportFragmentManager());
main_ViewPage.setAdapter(main_adapter);
main_ViewPage.setCurrentItem(0);
//初始化PageEvent相关
mSlidingTabLayout.setSelectedIndicatorColors(getResources().getColor(R.color.White));
mSlidingTabLayout.setBackgroundResource(R.drawable.theme_dark_blue);
mSlidingTabLayout.setViewPager(main_ViewPage);
}
}
```
Part.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Part")
public class Part {
@Column(autoincrement=true,primary=true)
//id
private int id;
//图片ID
@Column(name="pic_id")
private String pic_id;
//名称
@Column(name="name")
private String name;
//船件类型(0:炮,1:帆)
@Column(name="type")
private int type;
//船件类型(0:装备,1:造船)
@Column(name="ztype")
private int ztype;
//获取方式
@Column(name="get_way")
private String get_way;
//生产方式
@Column(name="recipe_way")
private String recipe_way;
//效果
@Column(name="plus")
private String add;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getPic_id() {
return pic_id;
}
public void setPic_id(String pic_id) {
this.pic_id = pic_id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getZtype() {
return ztype;
}
public void setZtype(int ztype) {
this.ztype = ztype;
}
public String getGet_way() {
return get_way;
}
public void setGet_way(String get_way) {
this.get_way = get_way;
}
public String getRecipe_way() {
return recipe_way;
}
public void setRecipe_way(String recipe_way) {
this.recipe_way = recipe_way;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public String getAdd() {
return add;
}
public void setAdd(String add) {
this.add = add;
}
}
```
MessageAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.Message;
public class MessageAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView word;
public TextView time;
}
private List<Message> list=new ArrayList<>();
private Context context;
public MessageAdapter(List<Message> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_message, null);
holder.word=(TextView)convertView.findViewById(R.id.word);
holder.time=(TextView)convertView.findViewById(R.id.time);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.word.setText(list.get(position).word);
holder.time.setText(list.get(position).time);
return convertView;
}
}
```
JsoupForBaHa.java
```package com.key.doltool.util.jsoup;
import android.util.Log;
import com.key.doltool.data.sqlite.TradeItem;
import com.the9tcat.hadi.DefaultDAO;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.nodes.Element;
import org.jsoup.select.Elements;
/**
* 爬虫工具,主要用于爬取网络上的数据,再进行入库<br>
* 因为是网络数据，因此所有方法不能在UI线程中加载。
* 0.2-清理无用爬虫代码
* @author key
* @version 0.2
*/
public class JsoupForBaHa {
public static String BASE_URL="http://static.hanghaimeng.com/src";
public String tt_url="/6/66c2dccad78d9fd9e286f30ef0eb1647.html";
/**钓鱼类型**/
public void getTradeItemUrl(DefaultDAO dao){
Document doc;
try{
doc = Jsoup.connect(BASE_URL+tt_url).timeout(30*1000).get();
Elements wiki=doc.select("div.wikiContent");
Elements table=wiki.select("div").select("table");
Log.i("table-size", table.size() + "");
Element sea_some=table.get(8);
Element fish=table.get(9);
Elements fish_a=fish.select("a");
Elements sea_some_a=sea_some.select("a");
for(int i=0;i<fish_a.size();i++){
String url=fish_a.get(i).attr("abs:href");
String pic_id="dol_t" + i + "s22";
getTradeItem(url, pic_id, dao);
}
for(int i=0;i<sea_some_a.size();i++){
String url=sea_some_a.get(i).attr("abs:href");
String pic_id="dol_t" + i + "s23";
getTradeItem(url, pic_id,dao);
}
}catch(Exception e){
e.printStackTrace();
}
}
public void getTradeItem(String url,String pic_id,DefaultDAO dao){
Document doc;
TradeItem items=new TradeItem();
try{
doc = Jsoup.connect(url).timeout(30*1000).get();
Elements wiki=doc.select("div.wikiContent");
Elements table=wiki.select("table");
Element item;
if(table.size()>0){
if(table.size()>5){
item=table.get(6);
}else{
item=table.get(table.size()-1);
}
// Element port=table.get(7);
if(item.select("tr").size()>1){
Elements tds=item.select("tr").get(1).select("td");
if(tds.size()>3){
if(tds.get(0).text().equals("名称")){
tds=item.select("tr").get(2).select("td");
}
items.setName(tds.get(0).text());
items.setDetail(tds.get(3).text());
items.setPic_id(pic_id);
items.setProducing_area("");
if(pic_id.endsWith("s22")){
items.setSp("钓鱼");
}else{
items.setSp("采集");
}
items.setPrice(0);
items.setTrade(1);
items.setType("食品");
items.setRecipe_way("");
dao.insert(items);
}else{
for(int j=0;j<table.size();j++){
item=table.get(j);
if(item.select("tr").size()>1){
tds=item.select("tr").get(1).select("td");
if(tds.size()>3){
if(!tds.get(0).text().equals("")){
items.setName(tds.get(0).text());
items.setDetail(tds.get(3).text());
items.setPic_id(pic_id);
items.setProducing_area("");
if(pic_id.endsWith("s22")){
items.setSp("钓鱼");
}else{
items.setSp("采集");
}
items.setPrice(0);
items.setTrade(1);
items.setType("食品");
items.setRecipe_way("");
dao.insert(items);
}
}
}
}
}
}
}
}catch(Exception e){
e.printStackTrace();
}
}
}```
RxBusEvent.java
```package com.key.doltool.event.rx;
import androidx.annotation.NonNull;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import java.util.concurrent.ConcurrentHashMap;
import io.reactivex.Observable;
import io.reactivex.subjects.PublishSubject;
import io.reactivex.subjects.Subject;
/**
* Rx系列总线调用
* Created by Administrator on 2017/1/12.
*/
public class RxBusEvent {
private static RxBusEvent instance;
/**船只信息获取**/
public final static String SAILBOAT="SAILBOAT";
/**船只菜单获取**/
public final static String SAILMENU="SAILMENU";
/**更新事件**/
public final static String UPDATE="UPDATE";
public static RxBusEvent get() {
if (instance == null) {
synchronized (RxBusEvent.class) {
if (instance == null) {
instance = new RxBusEvent();
}
}
}
return instance;
}
private RxBusEvent() {
}
private ConcurrentHashMap<Object, List<Subject>> subjectMapper = new ConcurrentHashMap<>();
public boolean isRegister(@NonNull Object tag){
List<Subject> subjects = subjectMapper.get(tag);
return null != subjects;
}
public <T> Observable<T> register(@NonNull Object tag) {
List<Subject> subjectList = subjectMapper.get(tag);
if (null == subjectList) {
subjectList = new ArrayList<>();
subjectMapper.put(tag, subjectList);
}
Subject<T> subject;
subjectList.add(subject = PublishSubject.create());
return subject;
}
public void unregister(@NonNull Object tag) {
List<Subject> subjects = subjectMapper.get(tag);
if(isRegister(tag)){
subjects.clear();
}
}
public void post(@NonNull Object content) {
post(content.getClass().getName(), content);
}
public <T> void post(@NonNull Object tag, @NonNull T content) {
List<Subject> subjectList = subjectMapper.get(tag);
if (!isEmpty(subjectList)) {
for (Subject subject : subjectList) {
//noinspection unchecked
subject.onNext(content);
}
}
}
private boolean isEmpty(Collection collection) {
return null == collection || collection.isEmpty();
}
}```
MissionTree.java
```package com.key.doltool.data;
import java.util.List;
public class MissionTree {
private String name;
private int level;
private List<MissionTree> before_mission;
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getLevel() {
return level;
}
public void setLevel(int level) {
this.level = level;
}
public List<MissionTree> getBefore_mission() {
return before_mission;
}
public void setBefore_mission(List<MissionTree> before_mission) {
this.before_mission = before_mission;
}
}
```
AbilityListActivity.java
```package com.key.doltool.activity.ability;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.MenuItem;
import android.view.View;
import android.widget.ListView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.SkillAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
import butterknife.OnItemClick;
/**
* 技能列表界面
* **/
public class AbilityListActivity extends BaseActivity {
//定义部分
private Dialog alert;
//列表
@BindView(R.id.listview) ListView listview;
private SkillAdapter adapter;
private ListFlowHelper<Skill> listFlowHelper;
@Override
public int getContentViewId() {
return R.layout.card_combo_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
listFlowHelper=new ListFlowHelper<>(Skill.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new SkillAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, SkillAdapter.SIZE);
flag=false;
initToolBar(onMenuItemClick);
findView();
toolbar.setTitle(R.string.skill_title);
listFlowHelper.getExtra(getIntent());//外部搜索链接参数处理
listFlowHelper.selectshow("0," + SkillAdapter.SIZE);
}
//通用findView
private void findView() {
alert=new DialogEvent().showLoading(this);
initPage();
}
@OnItemClick(R.id.listview) void itemClick(int position) {
if (adapter.getItem(position).getType() <= 5) {
Intent it = new Intent(AbilityListActivity.this, AbilityForNormalDetailActivity.class);
it.putExtra("id", adapter.getItem(position).getId() + "");
startActivity(it);
} else {
Intent it = new Intent(AbilityListActivity.this, AbilityForBoatDetailActivity.class);
it.putExtra("id", adapter.getItem(position).getId() + "");
startActivity(it);
}
}
private void initPage() {
initPageItem();
}
private void initPageItem() {
ViewHandler handler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
DialogUtil.dismiss(context,alert);
}
});
ListScrollListener srollListener = new ListScrollListener
(alert,handler,this);
listFlowHelper.setListScrollListener(srollListener);
adapter = new SkillAdapter(listFlowHelper.list, this);
listview.setOnScrollListener(srollListener);
listview.setAdapter(adapter);
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if (listFlowHelper.isChange()) {
super.onKeyDown(keyCode, event);
} else {
//按键返回
if (keyCode == KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.search:
View xc = getLayoutInflater().inflate(R.layout.select_skill, null);
ViewUtil.popSkillDialog(listFlowHelper,context,xc);
break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.main, menu);
return true;
}
}```
ListScrollListener.java
```package com.key.doltool.app.util;
import android.app.Activity;
import android.app.Dialog;
import android.os.Handler;
import android.os.Message;
import android.widget.AbsListView;
import android.widget.AbsListView.OnScrollListener;
/**
* 通用滚动方法
**/
public class ListScrollListener implements OnScrollListener {
private boolean end_flag=true;
private Thread mThread;
private Dialog layout_alert;
private Handler handler;
private Activity activity;
public ListScrollListener(Dialog layout_alert
, Handler handler, Activity activity) {
this.handler = handler;
this.layout_alert = layout_alert;
this.activity=activity;
}
public void changeFlag(boolean flag) {
this.end_flag = flag;
}
//滚动监听① - useless
public void onScroll(AbsListView view, int firstVisibleItem,
int visibleItemCount, int totalItemCount) {
}
//滚动监听②
public void onScrollStateChanged(final AbsListView view, int scrollState) {
//当不滚动时
System.out.println("" + end_flag);
if (scrollState == SCROLL_STATE_IDLE && end_flag) {
//判断滚动到底部
if (view.getLastVisiblePosition() == (view.getCount() - 1)) {
//没有线程且不为最末时
if (mThread == null || !mThread.isAlive()) {
//显示进度条，区域操作控制
DialogUtil.show(activity,layout_alert);
mThread = new Thread() {
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 1;
handler.sendMessage(message);
}
};
mThread.start();
}
}
}
}
}
```
SRPUtil.java
```package com.key.doltool.util.db;
import android.content.ContentValues;
import android.content.Context;
import android.database.Cursor;
import android.database.sqlite.SQLiteDatabase;
import android.util.Log;
import com.key.doltool.activity.MyApplication;
import com.key.doltool.data.sqlite.Card;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.the9tcat.hadi.ColumnAttribute;
import com.the9tcat.hadi.DatabaseManager;
import com.the9tcat.hadi.DefaultDAO;
import com.the9tcat.hadi.Util;
import com.the9tcat.hadi.annotation.Column;
import java.lang.reflect.Field;
import java.util.ArrayList;
import java.util.Date;
import java.util.List;
/**
* 用于优化现有数据库ORM[对象关系映射]工具的速度的特别类
* @version 0.3
* 0.1-加入批量更新的方法，减少更新所需时间（400条数据约13s）
* 0.2-优化原查询方法
* 0.3-对泛型进行优化，减少强制转换
* **/
public class SRPUtil {
private DatabaseManager mDatabaseManager;
private MyApplication mApplication;
private static SRPUtil instance;
private static DefaultDAO dao;
public static SRPUtil getInstance(Context context){
if(null == instance){
instance = new SRPUtil(context);
}
return instance;
}
public static DefaultDAO getDAO(Context context){
if(null == dao){
dao = new DefaultDAO(context);
}
return dao;
}
public SRPUtil(Context context){
this.mApplication =(MyApplication)context.getApplicationContext();
this.mDatabaseManager = mApplication.getDataBaseManager();
}
public long update_Trove(List<Trove> models) {
long result = 0;
long tmp_id ;
synchronized("lock") {
SQLiteDatabase db = this.mDatabaseManager.open();
try {
db.beginTransaction();
for(Trove obj:models){
tmp_id =update(db,obj,new String[]{"flag"},"id=?",new String[]{""+obj.getId()});
Log.i("tag","tmp_id");
if(tmp_id>0){
result ++;
}
db.yieldIfContendedSafely();
}
db.setTransactionSuccessful();
} finally {
db.endTransaction();
this.mDatabaseManager.close();
}
}
return result;
}
public long update_Mission(List<Mission> models) {
long result = 0;
long tmp_id;
synchronized("lock") {
SQLiteDatabase db = this.mDatabaseManager.open();
try {
db.beginTransaction();
for(Mission obj:models){
tmp_id =update(db, obj, new String[]{"tag"}, "id=?", new String[]{"" + obj.getId()});
if(tmp_id>0){
result ++;
}
db.yieldIfContendedSafely();
}
db.setTransactionSuccessful();
} finally {
db.endTransaction();
this.mDatabaseManager.close();
}
}
return result;
}
public long update_Card(List<Card> models) {
long result = 0;
long tmp_id;
synchronized("lock") {
SQLiteDatabase db = this.mDatabaseManager.open();
try {
db.beginTransaction();
for(Card obj:models){
tmp_id =update(db,obj,new String[]{"flag"}, "id=?", new String[]{"" + obj.id});
if(tmp_id>0){
result ++;
}
db.yieldIfContendedSafely();
}
db.setTransactionSuccessful();
} finally {
db.endTransaction();
this.mDatabaseManager.close();
}
}
return result;
}
public long update_list(List<?> models) {
long result = 0;
long tmp_id;
synchronized("lock") {
SQLiteDatabase db = this.mDatabaseManager.open();
try {
db.beginTransaction();
for(Object obj:models){
tmp_id =update_by_primary(db, obj);
if(tmp_id>0){
result ++;
}
db.yieldIfContendedSafely();
}
db.setTransactionSuccessful();
} finally {
db.endTransaction();
this.mDatabaseManager.close();
}
}
return result;
}
public long countByType(boolean flag,int type){
long result;
synchronized("lock") {
SQLiteDatabase db = this.mDatabaseManager.open();
result=count(db,flag,type);
this.mDatabaseManager.close();
}
return result;
}
public long countCard(SQLiteDatabase db,boolean flag){
String table="card ";
String where="where flag=? ";
String groupBy="group by type ";
String[] temp={"0"};
if(flag){
temp[0]="1";
}
Cursor cursor = db.rawQuery("select count(*) from (select count(id)from "+table+where+groupBy+")",temp);
cursor.moveToFirst();
Long count = cursor.getLong(0);
cursor.close();
return count;
}
public long insert(Object model) {
SQLiteDatabase db = this.mDatabaseManager.open();
long result = this.insertModel(db, model);
Util.setAutoId(this.mApplication, model, result);
this.mDatabaseManager.close();
return result;
}
private long insertModel(SQLiteDatabase db, Object model) {
ContentValues values = new ContentValues();
List atas = Util.getTableColumn(this.mApplication, model.getClass());
for (Object ata : atas) {
ColumnAttribute result = (ColumnAttribute) ata;
Object value = null;
try {
value = result.field.get(model);
if (result.autoincrement && Long.parseLong(value.toString()) <= 0L) {
continue;
}
} catch (Exception var9) {
// var9.printStackTrace();
}
if (value != null) {
if (!value.getClass().equals(Boolean.class) && !value.getClass().equals(Boolean.TYPE)) {
if (value.getClass().equals(Date.class)) {
values.put(result.name, ((Date) value).getTime());
} else if (value.getClass().equals(java.sql.Date.class)) {
values.put(result.name, ((java.sql.Date) value).getTime());
} else if (!value.getClass().equals(Double.class) && !value.getClass().equals(Double.TYPE)) {
if (!value.getClass().equals(Float.class) && !value.getClass().equals(Float.TYPE)) {
if (!value.getClass().equals(Integer.class) && !value.getClass().equals(Integer.TYPE)) {
if (!value.getClass().equals(Long.class) && !value.getClass().equals(Long.TYPE)) {
if (value.getClass().equals(String.class) || value.getClass().equals(Character.TYPE)) {
values.put(result.name, value.toString());
}
} else {
values.put(result.name, (Long) value);
}
} else {
values.put(result.name, (Integer) value);
}
} else {
values.put(result.name, (Float) value);
}
} else {
values.put(result.name, (Double) value);
}
} else {
values.put(result.name, (Boolean) value);
}
}
}
return db.insert(Util.getTableName(model.getClass()),null, values);
}
public <T>List<T> select(Class<T> model, boolean distinct, String selection, String[] selectionArgs, String groupBy, String having, String order, String limit) {
SQLiteDatabase db = this.mDatabaseManager.open();
Cursor cursor = db.query(distinct, Util.getTableName(model), null, selection, selectionArgs, groupBy, having, order, limit);
List<T> list = processCursor(model,cursor);
cursor.close();
db.close();
return list;
}
public static <T>List<T> processCursor(Class<T> object, Cursor cursor) {
ArrayList<T> entities = new ArrayList<>();
try {
if(cursor.moveToFirst()) {
do {
T e = object.newInstance();
loadModel(object, cursor, e);
entities.add(e);
} while(cursor.moveToNext());
}
} catch (Exception e) {
Log.e("Hadi", e.getMessage());
}
return entities;
}
public static void loadModel(Class<?> object, Cursor cursor, Object model) {
Field[] fields = object.getDeclaredFields();
for (Field field : fields) {
Column tmp_c = field.getAnnotation(Column.class);
String fieldName = "";
if (tmp_c != null) {
fieldName = tmp_c.name();
if (fieldName.equals("")) {
fieldName = field.getName();
}
}
Class fieldType = field.getType();
int columnIndex = cursor.getColumnIndex(fieldName);
if (columnIndex >= 0) {
field.setAccessible(true);
try {
if (!fieldType.equals(Boolean.class) && !fieldType.equals(Boolean.TYPE)) {
if (fieldType.equals(Character.TYPE)) {
field.set(model, cursor.getString(columnIndex).charAt(0));
} else if (fieldType.equals(Date.class)) {
field.set(model, new Date(cursor.getLong(columnIndex)));
} else if (fieldType.equals(java.sql.Date.class)) {
field.set(model, new java.sql.Date(cursor.getLong(columnIndex)));
} else if (!fieldType.equals(Double.class) && !fieldType.equals(Double.TYPE)) {
if (!fieldType.equals(Float.class) && !fieldType.equals(Float.TYPE)) {
if (!fieldType.equals(Integer.class) && !fieldType.equals(Integer.TYPE)) {
if (!fieldType.equals(Long.class) && !fieldType.equals(Long.TYPE)) {
if (fieldType.equals(String.class)) {
field.set(model, cursor.getString(columnIndex));
}
} else {
field.set(model, cursor.getLong(columnIndex));
}
} else {
field.set(model, cursor.getInt(columnIndex));
}
} else {
field.set(model, cursor.getFloat(columnIndex));
}
} else {
field.set(model, cursor.getDouble(columnIndex));
}
} else {
field.set(model, cursor.getInt(columnIndex) != 0);
}
} catch (Exception e) {
Log.e("Hadi", e.getMessage());
}
}
}
}
private long count(SQLiteDatabase db,boolean flag,int type){
String table="mission ";
String where="where tag=?";
String[] temp={"0"};
String groupBy="";
if(type==1){
table="trove ";
where="where flag=?";
}else if(type==2){
return countCard(db,flag);
}
if(flag){
temp[0]="1";
}
Cursor cursor = db.rawQuery("select count(id)from "+table+where+groupBy,temp);
cursor.moveToFirst();
Long count = cursor.getLong(0);
cursor.close();
return count;
}
/**
* @param model update by primary key, please make sure your class has primary key
* @return the number of rows affected
*/
private long update_by_primary(SQLiteDatabase db,Object model){
List<ColumnAttribute> atas = Util.getTableColumn(mApplication,model.getClass());
String whereClause = "";
List<String> whereArgs = new ArrayList<>();
List<String> columns = new ArrayList<>();
for(ColumnAttribute ata:atas){
if(ata.primary){
whereClause = whereClause + "and "+ata.name+" = ?";
try {
whereArgs.add(ata.field.get(model).toString());
} catch (IllegalArgumentException | IllegalAccessException e) {
Log.e("tag", "update_by_primary : " , e);
}
}else{
columns.add(ata.name);
}
}
if(whereArgs.size()>0){
return update(db,model,columns.toArray(new String[columns.size()]),whereClause.substring(4),whereArgs.toArray(new String[whereArgs.size()]));
}
return -1;
}
/**
*
* @param model the object that you want to update
* @param columns columns that you want to changed
* @param whereClause the optional WHERE clause to apply when updating. Passing null will update all rows.
* @param whereArgs the optional WHERE clause to apply when updating. Passing null will update all rows.
* @return the number of rows affected
*/
private long update(SQLiteDatabase db,Object model,String[] columns,String whereClause,String[] whereArgs){
boolean update_column = false;
if(columns != null && columns.length > 0){
update_column = true;
}
ContentValues values = new ContentValues();
List<ColumnAttribute> atas = Util.getTableColumn(mApplication,model.getClass());
for (ColumnAttribute ata : atas) {
if(update_column&&!Util.hasColumn(ata.name, columns)){
continue;
}
Object value = null;
try {
value = ata.field.get(model);
} catch (IllegalArgumentException | IllegalAccessException e) {
Log.e("tag", "update : " , e);
}
if (value == null) {
values.put(ata.name, (String) null);
} else if ((value.getClass().equals(Boolean.class)) || (value.getClass().equals(Boolean.TYPE))) {
values.put(ata.name, (Boolean) value);
} else if (value.getClass().equals(java.util.Date.class)) {
values.put(ata.name, ((java.util.Date)value).getTime());
} else if (value.getClass().equals(java.sql.Date.class)) {
values.put(ata.name, ((java.sql.Date)value).getTime());
} else if ((value.getClass().equals(Double.class)) || (value.getClass().equals(Double.TYPE))) {
values.put(ata.name, (Double) value);
} else if ((value.getClass().equals(Float.class)) || (value.getClass().equals(Float.TYPE))) {
values.put(ata.name, (Float) value);
} else if ((value.getClass().equals(Integer.class)) || (value.getClass().equals(Integer.TYPE))) {
values.put(ata.name, (Integer) value);
} else if ((value.getClass().equals(Long.class)) || (value.getClass().equals(Long.TYPE))) {
values.put(ata.name, (Long) value);
} else if ((value.getClass().equals(String.class)) || (value.getClass().equals(Character.TYPE))) {
values.put(ata.name, value.toString());
}
}
return db.update(Util.getTableName(model.getClass()), values, whereClause, whereArgs);
}
}
```
VoyageInfo.java
```package com.key.doltool.data;
import android.annotation.SuppressLint;
import android.content.Context;
import android.content.SharedPreferences;
/**公共信息配置表**/
public class VoyageInfo {
private SharedPreferences sp;
private SharedPreferences.Editor editor;
/**今天的日期**/
public static final String WEEK="week";
/**今日的运势**/
public static final String DATA="data";
@SuppressLint("CommitPrefEdits")
public VoyageInfo(Context context){
sp=context.getSharedPreferences("voyage", Context.MODE_PRIVATE);
editor=sp.edit();
}
public String getWeek() {
return sp.getString(WEEK,"1989-09-08");
}
public void setWeek(String date) {
editor.putString(WEEK, date);
editor.commit();
}
public String getData() {
return sp.getString(DATA,"");
}
public void setData(String data) {
editor.putString(DATA, data);
editor.commit();
}
public void clear(){
editor.clear();
editor.commit();
}
}```
VoyageItem.java
```package com.key.doltool.data;
public class VoyageItem {
public String name;
public String pic_id;
public int type;
}
```
BusinessDetailActivity.java
```package com.key.doltool.activity.squre.business;
import android.annotation.SuppressLint;
import android.app.Dialog;
import android.content.res.Configuration;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.util.Log;
import android.webkit.WebChromeClient;
import android.webkit.WebSettings;
import android.webkit.WebView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.HttpUtil;
import com.key.doltool.util.jsoup.JsoupForTB;
//import net.youmi.android.banner.AdSize;
//import net.youmi.android.banner.AdView;
/**
* 新闻详情
* @author key
* @version 0.5
* @date 2013-7-17
* 0.5-基本调整,界面适配度80%<br>
*/
@SuppressLint("NewApi")
public class BusinessDetailActivity extends BaseActivity{
private WebView web_content;
private Dialog layout_alert;
private String id="4879286029";
private String content="";
@Override
public int getContentViewId() {
return R.layout.news_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
findView();
setListener();
id="4879286029";
// id=getIntent().getStringExtra("id");
new Thread(mTask).start();
}
//获取数据，填充显示
@SuppressWarnings("deprecation")
@SuppressLint("SetJavaScriptEnabled")
private void init(){
float screenDensity = getResources().getDisplayMetrics().density ;
WebSettings.ZoomDensity zoomDensity;
if(screenDensity==0.75f){
zoomDensity = WebSettings.ZoomDensity.CLOSE;
}
else if(screenDensity==1.0f){
zoomDensity = WebSettings.ZoomDensity.MEDIUM;
}
else{
zoomDensity = WebSettings.ZoomDensity.FAR;
}
Log.i("",zoomDensity.name());
web_content.getSettings().setJavaScriptEnabled(true);
web_content.getSettings().setDefaultZoom(zoomDensity);
web_content.getSettings().setCacheMode(WebSettings.LOAD_CACHE_ELSE_NETWORK);
web_content.setWebChromeClient(new WebChromeClient());
web_content.getSettings().setUserAgentString("Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/55.0.2883.87 Safari/537.36");
int width = (int) (CommonUtil.getScreenWidth(this) / screenDensity) - 10;
Log.i("x", "" + width);
String head = "<style type='text/css'>*{max-width:" + width + "px!important;height:auto!important;}" +
"table{width:100%!important;}" + "</style>";
// web_content.loadUrl(JsoupForTB.TB_BASE_URL + id);
web_content.loadData(head + content, "text/html; charset=UTF-8",null);
}
//初始化控件
private void findView(){
web_content=(WebView)findViewById(R.id.content);
layout_alert=new DialogEvent().showLoading(this);
layout_alert.show();
}
//事件监听
private void setListener(){
}
@Override
protected void onResume() {
super.onResume();
}
private Handler mHandler=new Handler(){
public void handleMessage(Message msg) {
super.handleMessage(msg);
//更新页面
if(HttpUtil.STATE==0){
init();
if(!content.equals(""))
layout_alert.dismiss();
}
else{
layout_alert.dismiss();
}
}
};
//获得数据
private Runnable mTask=new Runnable(){
public void run() {
while(content.equals("")&&HttpUtil.STATE==0){
content=JsoupForTB.getData(id);
// JsoupForTB.TB_BASE_URL+id;
mHandler.sendMessage(mHandler.obtainMessage());
}
if(HttpUtil.STATE==1&&layout_alert.isShowing()){
mHandler.sendMessage(mHandler.obtainMessage());
}
}
};
//缓存清空
@Override
protected void onDestroy() {
super.onDestroy();
web_content.clearCache(false);
}
@Override
public void onConfigurationChanged(Configuration newConfig) {
super.onConfigurationChanged(newConfig);
}
}```
UserEvent.java
```package com.key.doltool.event;
/**
* 区服数据集
* **/
public class UserEvent {
public static final String[] AREA={
"国服","台服","国际服","日服"
};
public static final String[][] HOST={
{"龙之大地","黄金海岸","狮鹫之翼","北方的狮子"},
{"幽灵船","战列舰","探索号"},
{"未知"},
{"未知"},
};
}
```
SimpleSearchAdapter.java
```package com.key.doltool.adapter;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.SearchItem;
import com.key.doltool.util.StringUtil;
public class SimpleSearchAdapter extends BaseAdapter{
private List<SearchItem> item_txt;
private static class ViewHolder{
public TextView item_name;
private TextView type;
}
private Context context;
public SimpleSearchAdapter(Context context,List<SearchItem> item_txt){
this.context=context;
this.item_txt=item_txt;
}
public int getCount() {
return item_txt.size();
}
@Override
public Object getItem(int arg0) {
return item_txt.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_seach, null);
holder.item_name=(TextView)convertView.findViewById(R.id.name);
holder.type=(TextView)convertView.findViewById(R.id.type);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_name.setText(item_txt.get(position).name);
if(!StringUtil.isNull(item_txt.get(position).add_info)){
holder.type.setVisibility(View.VISIBLE);
holder.type.setText(item_txt.get(position).add_info);
}else{
holder.type.setVisibility(View.GONE);
}
return convertView;
}
}```
CommonUtil.java
```package com.key.doltool.util;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import android.app.Activity;
import android.content.Context;
import android.content.pm.ApplicationInfo;
import android.content.pm.PackageInfo;
import android.content.pm.PackageManager;
import android.content.pm.PackageManager.NameNotFoundException;
import android.net.ConnectivityManager;
import android.net.NetworkInfo;
import android.os.Environment;
import android.util.DisplayMetrics;
import android.util.Log;
/**
* 通用工具类
* @author Administrator
* @version 2013-4-22
* 加入了判断SD卡，获取文件路径，检查网络状态
* 返回屏幕长，宽的方法
*/
public class CommonUtil {
public CommonUtil(){
}
public static boolean hasSDCard() {
String status = Environment.getExternalStorageState();
return status.equals(Environment.MEDIA_MOUNTED);
}
public static String getRootFilePath() {
if (hasSDCard()) {
return Environment.getExternalStorageDirectory().getAbsolutePath() + "/";// filePath:/sdcard/
} else {
return Environment.getDataDirectory().getAbsolutePath() + "/data/"; // filePath: /data/data/
}
}
public static int getScreenWidth(Activity context) {
DisplayMetrics displaymetrics = new DisplayMetrics();
context.getWindowManager().getDefaultDisplay().getMetrics(displaymetrics);
return displaymetrics.widthPixels;
}
public static int getScreenHeight(Activity context) {
DisplayMetrics displaymetrics = new DisplayMetrics();
context.getWindowManager().getDefaultDisplay().getMetrics(displaymetrics);
return displaymetrics.heightPixels;
}
public static boolean checkNetworkInfo(Context context) {
ConnectivityManager conMan = (ConnectivityManager) context.getSystemService(Context.CONNECTIVITY_SERVICE);
NetworkInfo networkinfo = conMan.getActiveNetworkInfo();
return networkinfo != null && networkinfo.isAvailable();
}
public static String getAppVersionName(Context context) {
String versionName = "";
try {
// ---get the package info---
PackageManager pm = context.getPackageManager();
PackageInfo pi = pm.getPackageInfo(context.getPackageName(), 0);
versionName = pi.versionName;
} catch (Exception e) {
Log.e("VersionInfo", "Exception", e);
}
return versionName;
}
/**
*
* @description 将app由data/app目录拷贝到sd卡下的指定目录中
*
* @param packageName
* 应用程序的ID号，如com.wondertek.jttxl
*
* @param dest
* 需要将应用程序拷贝的目标位置
*
* @date 2013-7-24 下午3:32:12
*/
public static String backupApplication(Context context,String packageName, String dest) {
if (packageName == null || packageName.length() == 0
|| dest == null || dest.length() == 0) {
return "illegal parameters";
}
PackageManager pm = context.getPackageManager();
PackageInfo pi = null;
try {
pi = pm.getPackageInfo(context.getPackageName(), 0);
} catch (NameNotFoundException e1) {
e1.printStackTrace();
}
// check file /data/app/appId-1.apk exists
Log.i("",""+pi.applicationInfo.sourceDir);
String apkPath = "/data/app/" + packageName + "-1.apk";
File apkFile = new File(apkPath);
if (!apkFile.exists()) {
apkFile=new File(pi.applicationInfo.sourceDir);
if(!apkFile.exists()){
return apkPath + " doesn't exist!";
}
}
FileInputStream in;
try {
in = new FileInputStream(apkFile);
} catch (FileNotFoundException e) {
e.printStackTrace();
return e.getMessage();
}
// create dest folder if necessary
int i = dest.lastIndexOf('/');
if (i != -1) {
File dirs = new File(dest.substring(0, i));
dirs.mkdirs();
}
// do file copy operation
byte[] c = new byte[1024];
int slen;
FileOutputStream out = null;
try {
out = new FileOutputStream(dest);
while ((slen = in.read(c, 0, c.length)) != -1)
out.write(c, 0, slen);
} catch (IOException e) {
e.printStackTrace();
return e.getMessage();
} finally {
if (out != null)
try {
out.close();
} catch (IOException e) {
e.printStackTrace();
}
try {
in.close();
} catch (IOException e) {
e.printStackTrace();
}
}
return "success";
}
public static int getAppVersionCode(Context context) {
int versionName = 0;
try {
// ---get the package info---
PackageManager pm = context.getPackageManager();
PackageInfo pi = pm.getPackageInfo(context.getPackageName(), 0);
versionName = pi.versionCode;
} catch (Exception e) {
Log.e("VersionInfo", "Exception", e);
}
return versionName;
}
public static int getMetaDataInt(Context context, String name) {
PackageManager pm = context.getPackageManager();
try {
ApplicationInfo e = pm.getApplicationInfo(context.getPackageName(),PackageManager.GET_META_DATA);
return e.metaData.getInt(name);
} catch (Exception var4) {
Log.e("DataInt", "Exception", var4);
return 0;
}
}
}```
LoginActivity.java
```package com.key.doltool.activity.person;
import android.app.Activity;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.text.Editable;
import android.text.TextWatcher;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AutoCompleteTextView;
import android.widget.Button;
import android.widget.EditText;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import com.google.android.material.textfield.TextInputLayout;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.core.MainActivity;
import com.key.doltool.adapter.AutoTextViewAdapter;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import butterknife.BindView;
import cn.leancloud.AVUser;
import cn.leancloud.types.AVNull;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
public class LoginActivity extends BaseActivity{
//登录
@BindView(R.id.usernameWrapper)
TextInputLayout usernameWrapper;
@BindView(R.id.passwordWrapper) TextInputLayout passwordWrapper;
@BindView(R.id.password) EditText password;
@BindView(R.id.account) AutoCompleteTextView account;
@BindView(R.id.register) FlatButton register;
@BindView(R.id.forget_password) FlatButton forgetpassword;
@BindView(R.id.login) FlatButton login;
private Dialog dialog;
private AutoTextViewAdapter adapter;
@Override
public int getContentViewId() {
return R.layout.login_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
}
private void findView(){
usernameWrapper.setHint("登录邮箱");
passwordWrapper.setHint("登录密码");
dialog=new DialogEvent().itemDialog(this,"请等待");
adapter = new AutoTextViewAdapter(this);
account.setAdapter(adapter);
account.setThreshold(1);//输入1个字符时就开始检测，默认为2个
account.addTextChangedListener(watahcer);//监听autoview的变化
login=(FlatButton)findViewById(R.id.login);
login.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(judge()){
login();
}
}
});
register.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(LoginActivity.this,RegisterActivity.class);
startActivityForResult(it,101);
}
});
forgetpassword.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
dialogPop(R.layout.select_trove);
}
});
}
private void dialogPop(final int layout){
final Dialog updateDialog = new Dialog(this,R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(this)-30,
LayoutParams.MATCH_PARENT);
params.setMargins(10,10,10,10);
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(layout, null);
updateDialog.setContentView(view,params);
updateDialog.show();
final EditText name=(EditText)view.findViewById(R.id.boat_name);
if(name!=null){
name.setHint("请输入需要重置密码的账号邮箱");
}
final Button positive=(Button)view.findViewById(R.id.btn_confirm);
final Button negative=(Button)view.findViewById(R.id.btn_cancel);
positive.setText("确定");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(layout==R.layout.select_trove){
if (name != null) {
resetPassword(name.getText().toString().trim());
}
}
updateDialog.dismiss();
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
private TextWatcher watahcer=new TextWatcher() {
@Override
public void beforeTextChanged(CharSequence s, int start, int count, int after) {
}
@Override
public void onTextChanged(CharSequence s, int start, int before, int count) {
}
@Override
public void afterTextChanged(Editable s) {
String input = s.toString();
adapter.mList.clear();
adapter.getAutoAdapterHelper().autoAddEmails(adapter,input);
adapter.notifyDataSetChanged();
account.showDropDown();
}
};
//重置密码（未登录版本）
private void resetPassword(String emali){
dialog.show();
AVUser.requestPasswordResetInBackground(emali).subscribe(new Observer<AVNull>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVNull avNull) {
Toast.makeText(getApplicationContext(), "请查收注册的邮箱进行重置密码", Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(), "错误4", Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
private boolean judge(){
if(account.getText().toString().equals("")){
Toast.makeText(getApplicationContext(),"用户名不能为空",Toast.LENGTH_LONG).show();
return false;
}
if(password.getText().toString().equals("")){
Toast.makeText(getApplicationContext(),"密码不能为空",Toast.LENGTH_LONG).show();
return false;
}
return true;
}
@Override
protected void onActivityResult(int requestCode, int resultCode, Intent data) {
super.onActivityResult(requestCode, resultCode, data);
if (resultCode != Activity.RESULT_OK) {
return;
}
switch (requestCode) {
case 101:
Intent intent = new Intent(LoginActivity.this, MainActivity.class);
setResult(RESULT_OK, intent);
finish();
break;
}
}
private void login(){
dialog.show();
AVUser.logIn(account.getText().toString(),password.getText().toString()).subscribe(new Observer<AVUser>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVUser avUser) {
//登录
dialog.dismiss();
Toast.makeText(getApplicationContext(),"登录成功",Toast.LENGTH_LONG).show();
Intent intent = new Intent(LoginActivity.this,MainActivity.class);
setResult(RESULT_OK, intent);
finish();
}
@Override
public void onError(Throwable e) {
//登录失败
Toast.makeText(getApplicationContext(),"登录失败",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
}
```
EditUserInfoActivity.java
```package com.key.doltool.activity.person;
import android.app.Activity;
import android.app.Dialog;
import android.content.Intent;
import android.database.Cursor;
import android.net.Uri;
import android.os.Bundle;
import android.provider.MediaStore;
import android.util.Log;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemSelectedListener;
import android.widget.ArrayAdapter;
import android.widget.Button;
import android.widget.EditText;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.RelativeLayout;
import android.widget.Spinner;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UserEvent;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.view.Toast;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVFile;
import cn.leancloud.AVObject;
import cn.leancloud.AVUser;
import io.reactivex.functions.Consumer;
public class EditUserInfoActivity extends BaseActivity{
//编辑
@BindView(R.id.nick_name) TextView nickName;
@BindView(R.id.area_server) TextView area_server;
@BindView(R.id.head_img) ImageView head;
@BindView(R.id.area_1) RelativeLayout area_1;
@BindView(R.id.area_2) RelativeLayout area_2;
@BindView(R.id.area_3) RelativeLayout area_3;
private String server_name="0-0";
private static final int TAKE_PICTURE = 1;
private static final int LOCAL_PICTURE = 3;
private Uri imageUri = Uri.parse(FileManager.IMAGE_FILE_LOCATION);
private boolean isChanged=false;
@Override
public int getContentViewId() {
return R.layout.activity_edit;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
setListener();
init();
flag=false;
initToolBar(null);
toolbar.setTitle("修改信息");
}
private void setListener(){
area_1.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
getPhotoEvent();
}
});
area_2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
dialogPop(R.layout.select_trove);
}
});
area_3.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
dialogPop(R.layout.select_area);
}
});
}
private void dialogPop(final int layout){
final Dialog updateDialog = new Dialog(this,R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(this)-30,
LayoutParams.MATCH_PARENT);
params.setMargins(10,10,10,10);
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(layout, null);
updateDialog.setContentView(view,params);
updateDialog.show();
final EditText name=(EditText)view.findViewById(R.id.boat_name);
if(name!=null){
name.setHint("输入你要修改的名称");
}
final Spinner type1=(Spinner)view.findViewById(R.id.type1);
final Spinner type2=(Spinner)view.findViewById(R.id.type2);
if(type1!=null){
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(EditUserInfoActivity.this,UserEvent.AREA);
type1.setAdapter(adapter);
type1.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(EditUserInfoActivity.this, UserEvent.HOST[arg2]);
type2.setAdapter(adapter);
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
}
final Button positive=(Button)view.findViewById(R.id.btn_confirm);
final Button negative=(Button)view.findViewById(R.id.btn_cancel);
positive.setText("修改");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(layout==R.layout.select_trove){
changeNickName(name.getText().toString().trim());
}else{
changeArea(type1,type2);
}
updateDialog.dismiss();
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
private void changeNickName(String name){
if (!StringUtil.isNull(name)) {
if(name.length()<3&&name.length()<=12){
Toast.makeText(getApplicationContext(),"昵称在3~12个字符之间",Toast.LENGTH_SHORT).show();
return;
}
AVUser currentUser = AVUser.getCurrentUser();
nickName.setText(name);
currentUser.put("nickName",name);
currentUser.saveInBackground().subscribe((Consumer<AVObject>) avObject -> isChanged=true);
}else{
Toast.makeText(getApplicationContext(),"昵称不能为空",Toast.LENGTH_SHORT).show();
}
}
private void changeArea(Spinner area,Spinner server){
server_name=area.getSelectedItemPosition()+"-"+server.getSelectedItemPosition();
AVUser currentUser = AVUser.getCurrentUser();
area_server.setText(area.getSelectedItem()+" "+server.getSelectedItem());
currentUser.put("server",server_name);
currentUser.saveInBackground().subscribe((Consumer<AVObject>) avObject -> isChanged=true);
}
private void init(){
AVUser currentUser = AVUser.getCurrentUser();
//如果有用户则
if (currentUser != null) {
AVFile headImg=currentUser.getAVFile("headPic");
if(headImg!=null){
ImageLoader.picassoLoadCircle(this, headImg.getUrl(),head);
}else{
ImageLoader.picassoLoadCircle(this,head);
}
if(!StringUtil.isNull(currentUser.getString("nickName"))){
nickName.setText(currentUser.getString("nickName"));
}else{
nickName.setText(currentUser.getUsername());
}
if(!StringUtil.isNull(currentUser.getString("server"))){
String temp[]=currentUser.getString("server").split("-");
String area=UserEvent.AREA[Integer.parseInt(temp[0])];
String server=UserEvent.HOST[Integer.parseInt(temp[0])][Integer.parseInt(temp[1])];
area_server.setText(area+" "+server);
}else{
area_server.setText("未填写");
}
}
}
private void getPhotoEvent() {
new DialogEvent().pictureWayDialog(FileManager.IMAGE_FILE_LOCATION,this);
}
@Override
protected void onActivityResult(int requestCode, int resultCode, Intent data) {
super.onActivityResult(requestCode, resultCode, data);
Log.i("a", "" + resultCode);
if (resultCode != Activity.RESULT_OK) {
imageUri = Uri.parse(FileManager.IMAGE_FILE_LOCATION);
return;
}
switch (requestCode) {
case LOCAL_PICTURE:
imageUri = data.getData();
test(imageUri);
break;
case TAKE_PICTURE:
cropImageUri(FileManager.IMAGE_FILE_LOCATION);
break;
}
}
private void test(Uri uri){
try {
String[] pojo = { MediaStore.Images.Media.DATA };
Cursor cursor = getContentResolver().query(uri, pojo, null, null, null);
if (cursor != null) {
int colunm_index = cursor
.getColumnIndexOrThrow(MediaStore.Images.Media.DATA);
cursor.moveToFirst();
String path = cursor.getString(colunm_index);
/***
* 这里加这样一个判断主要是为了第三方的软件选择，比如：使用第三方的文件管理器的话，你选择的文件就不一定是图片了，
* 这样的话，我们判断文件的后缀名 如果是图片格式的话，那么才可以
*/
if (path.endsWith("jpg") || path.endsWith("png")) {
cropImageUri(path);
} else {
Toast.makeText(this, "格式不支持", Toast.LENGTH_LONG).show();
}
cursor.close();
}
} catch (Exception e) {
e.printStackTrace();
}
}
private void cropImageUri(String path_file) {
Log.i("path_file",""+path_file);
if (imageUri != null) {
Log.i("path_file",""+imageUri.getPath());
ImageLoader.picassoLoadCircle(this,path_file,head);
AVUser currentUser = AVUser.getCurrentUser();
AVFile headImg=new AVFile("head.png",ResourcesUtil.getBytes(path_file));
headImg.saveInBackground();
currentUser.put("headPic",headImg);
currentUser.saveInBackground().subscribe((Consumer<AVObject>) avObject -> isChanged=true);
}
}
@Override
protected void onDestroy() {
super.onDestroy();
RxBusEvent.get().post(RxBusEvent.UPDATE,isChanged);
}
}
```
WikiListActivity.java
```package com.key.doltool.activity.wiki;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.WikiAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.WikiInfo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.view.Toast;
import butterknife.BindView;
public class WikiListActivity extends BaseActivity{
//定义部分
private Dialog alert;
//船只列表页面
@BindView(R.id.listview) ListView listview;
//数据temp变量
private WikiAdapter adapter;
private ListFlowHelper<WikiInfo> listFlowHelper;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.card_combo_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
listFlowHelper=new ListFlowHelper<>(WikiInfo.class,
getApplicationContext(), new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new WikiAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, WikiAdapter.SIZE);
findView();
setListener();
}
//通用findView
private void findView() {
flag=false;
initToolBar(null);
toolbar.setTitle("百科");
alert=new DialogEvent().showLoading(this);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
DialogUtil.dismiss(context,alert);
}
});
initPage();
}
//通用Listener
private void setListener() {
listview.setOnItemClickListener(new OnItemClickListener(){
public void onItemClick(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
Intent it=new Intent(WikiListActivity.this,WikiMainActivity.class);
it.putExtra("id",adapter.getItem(arg2).getId()+"");
startActivity(it);
}
});
}
private void initPage(){
initPageItem();
}
private void initPageItem(){
adapter=new WikiAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
ListScrollListener listScrollListener=new ListScrollListener(alert,viewHandler,this);
listview.setOnScrollListener(listScrollListener);
listFlowHelper.setListScrollListener(listScrollListener);
listFlowHelper.selectshow("0,"+WikiAdapter.SIZE);
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
super.onKeyDown(keyCode, event);
}
//其他
else{
if(keyCode==KeyEvent.KEYCODE_BACK){
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
}
```
FishingPort.java
```package com.key.doltool.data.parse;
import android.os.Parcel;
import cn.leancloud.AVObject;
import cn.leancloud.annotation.AVClassName;
/**钓场分享**/
@AVClassName("FishingPort")
public class FishingPort extends AVObject {
public FishingPort(){
super();
}
// 钓场的名称
public String getName() {
return getString("name");
}
public void setName(String name) {
put("name",name);
}
//地理位置-渔场坐标记录
public String getGeo() {
return getString("geoPoint");
}
public void setGeo(String geoPoint) {
put("geoPoint",geoPoint);
}
//钓场能钓的鱼种
public String getFishingList() {
return getString("fishList");
}
public void setFishingList(String fishList) {
put("fishList",fishList);
}
//创建者
public String getUserName() {
return getString("userName");
}
public void setUserName(String userName) {
put("userName",userName);
}
}
```
LoadingActivity.java
```package com.key.doltool.activity;
import android.content.Intent;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.text.SpannableString;
import android.text.Spanned;
import android.text.TextPaint;
import android.text.method.LinkMovementMethod;
import android.text.style.ClickableSpan;
import android.view.View;
import android.widget.TextView;
import androidx.annotation.NonNull;
import androidx.appcompat.app.AlertDialog;
import androidx.core.content.ContextCompat;
import com.key.doltool.R;
import com.key.doltool.activity.core.MainActivity;
import com.key.doltool.activity.wiki.WebMainActivity;
import com.key.doltool.data.SystemInfo;
import com.key.doltool.event.PermissionEvent;
import com.key.doltool.event.VoyageEvent;
import com.key.doltool.event.rx.RxCommonEvent;
import com.key.doltool.util.DBUtil;
import com.key.doltool.util.ExitApplication;
import com.key.doltool.view.Toast;
import java.lang.ref.WeakReference;
import java.lang.reflect.Field;
/**
* 载入界面
* **/
public class LoadingActivity extends BaseActivity{
private MyHandler updateUI;
@Override
public int getContentViewId() {
return R.layout.loading;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
updateUI=new MyHandler(this);
showDialog();
new VoyageEvent(getApplicationContext()).getRandomChance();
}
private Runnable mTask=new Runnable(){
public void run() {
DBUtil.copyDB(getApplicationContext(),updateUI);
try {
Thread.sleep(1500);
} catch (InterruptedException e) {
e.printStackTrace();
}
jump();
}
};
private void jump(){
startActivity(new Intent(this,MainActivity.class));
finish();
}
private void showDialog() {
SystemInfo spUtils = new SystemInfo(this);
boolean isAgreement = spUtils.getFirst();
if (isAgreement) {
new Thread(mTask).start();
return ;
}
StringBuilder sb = new StringBuilder();
sb.append("请你务必审慎阅读、充分理解\"服务协议\"和\"隐私政策\"各条款，包括但不限于：为了向你提供即时通讯、内容分享等服务，我们需要收集你的设备信息、操作日志等个人信息。\n你可阅读");
int startIndex1 = sb.length();
sb.append("《用户协议》");
int endIndex1 = sb.length();
sb.append("和");
int startIndex2 = sb.length();
sb.append("《隐私政策》");
int endIndex2 = sb.length();
sb.append("了解详细信息。如你同意，请点击\"同意\"开始接受我们的服务。");
SpannableString ss = new SpannableString(sb.toString());
ss.setSpan(new ClickableSpan() {
@Override
public void updateDrawState(@NonNull TextPaint ds) {
ds.setColor(ContextCompat.getColor(LoadingActivity.this, R.color.Blue_SP));
}
@Override
public void onClick(@NonNull View widget) {
//用户协议
Intent it=new Intent(LoadingActivity.this, WebMainActivity.class);
it.putExtra("url","user.html");
it.putExtra("title","用户协议");
startActivity(it);
}
}, startIndex1, endIndex1, Spanned.SPAN_INCLUSIVE_EXCLUSIVE);
ss.setSpan(new ClickableSpan() {
@Override
public void updateDrawState(@NonNull TextPaint ds) {
ds.setColor(ContextCompat.getColor(LoadingActivity.this, R.color.Blue_SP));
}
@Override
public void onClick(@NonNull View widget) {
//隐私政策
Intent it=new Intent(LoadingActivity.this, WebMainActivity.class);
it.putExtra("url","ser.html");
it.putExtra("title","隐私政策");
startActivity(it);
}
}, startIndex2, endIndex2, Spanned.SPAN_INCLUSIVE_EXCLUSIVE);
AlertDialog dialog=new AlertDialog.Builder(this)
.setTitle("用户协议&隐私协议")
.setMessage(ss)
.setCancelable(false)
.setPositiveButton("确认", (dialogInterface, i) -> {
new Thread(mTask).start();
spUtils.setFirst(true);
})
.setNegativeButton("取消", (dialogInterface, i) -> ExitApplication.getInstance().exit())
.create();
dialog.show();
TextView messageView = getSystemDialogMessageView(dialog);
if (messageView != null) {
messageView.setMovementMethod(LinkMovementMethod.getInstance());
}
}
protected TextView getSystemDialogMessageView(AlertDialog dialog) {
try {
Field mAlert = AlertDialog.class.getDeclaredField("mAlert");
mAlert.setAccessible(true);
Object mAlertController = mAlert.get(dialog);
Field mMessage;
if (mAlertController != null) {
mMessage = mAlertController.getClass().getDeclaredField("mMessageView");
mMessage.setAccessible(true);
return (TextView) mMessage.get(mAlertController);
}
} catch (IllegalAccessException | NoSuchFieldException e) {
e.printStackTrace();
}
return null;
}
private static class MyHandler extends Handler {
private final WeakReference<LoadingActivity> mActivity;
public MyHandler(LoadingActivity activity) {
mActivity = new WeakReference<>(activity);
}
@Override
public void handleMessage(Message msg) {
LoadingActivity activity = mActivity.get();
if (activity != null) {
switch(msg.what) {
case 1:
Toast.makeText(activity.getApplicationContext(),"更新成功", Toast.LENGTH_SHORT).show();
break;
case 2:
Toast.makeText(activity.getApplicationContext(),"初始化失败",Toast.LENGTH_SHORT).show();
break;
}
}
}
}
}
```
MakeEvent.java
```package com.key.doltool.event;
import java.util.List;
import android.app.Dialog;
import android.view.Gravity;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.Button;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.ListView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.dockyard.BuildBoatFragment;
import com.key.doltool.activity.dockyard.DockYardFragment;
import com.key.doltool.adapter.PartSpinnerdapter;
import com.key.doltool.data.sqlite.Part;
import com.key.doltool.util.CommonUtil;
/**造船控件处理事件**/
public class MakeEvent {
private BuildBoatFragment context;
public MakeEvent(BuildBoatFragment context){
this.context=context;
}
public void showPartDialog(final List<Part> list,final TextView txt,final int number){
LayoutInflater layoutinflater = context.getActivity().getLayoutInflater();
View view = layoutinflater.inflate(R.layout.dockyard_chose_layout, null);
final Dialog updateDialog = new Dialog(context.getActivity(), R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(context.getActivity())-30,
LayoutParams.WRAP_CONTENT);
params.gravity = Gravity.CENTER_HORIZONTAL;
params.setMargins(10,10,10,10);
updateDialog.setContentView(view,params);
updateDialog.show();
Button btn=(Button)view.findViewById(R.id.clear_btn);
ListView listview=(ListView)view.findViewById(R.id.listview);
listview.setAdapter(new PartSpinnerdapter(list, context.getActivity()));
btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
int r=0;
switch(number){
case 0:r=R.string.sp_hint1;break;
case 1:r=R.string.sp_hint2;break;
case 2:r=R.string.sp_hint3;break;
case 3:r=R.string.sp_hint4;break;
}
txt.setText(r);
updateDialog.dismiss();
context.setPartChose(null,number);
}
});
listview.setOnItemClickListener(new OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
txt.setText(list.get(arg2).getName());
updateDialog.dismiss();
context.setPartChose(list.get(arg2),number);
}
});
}
}
```
InfoMainFragment.java
```package com.key.doltool.activity;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.Button;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.ability.AbilityListActivity;
import com.key.doltool.activity.adc.ADCListActivity;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.job.JobListActivity;
import com.key.doltool.activity.mission.MissonListActivity;
import com.key.doltool.activity.wiki.WikiListActivity;
import com.key.doltool.activity.wiki.WikiMainActivity;
import com.key.doltool.adapter.WikiAdapter;
import com.key.doltool.data.sqlite.WikiInfo;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class InfoMainFragment extends BaseFragment{
@BindView(R.id.mission) Button mission;
@BindView(R.id.skill) Button skill;
@BindView(R.id.adc) Button adc;
@BindView(R.id.job) Button job;
@BindView(R.id.wiki_btn) Button wiki;
@BindView(R.id.wiki_list) ListView listview;
private SRPUtil dao;
private List<WikiInfo> list=new ArrayList<>();
@Override
public int getContentViewId() {
return R.layout.info_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getInstance(context);
init();
setListener();
}
private void setListener(){
listview.setAdapter(new WikiAdapter(list,context));
mission.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(1);
}
});
skill.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(2);
}
});
job.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(3);
}
});
adc.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(4);
}
});
wiki.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(5);
}
});
listview.setOnItemClickListener(new OnItemClickListener(){
public void onItemClick(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
Intent it=new Intent(context,WikiMainActivity.class);
it.putExtra("id",list.get(arg2).getId()+"");
startActivity(it);
}
});
}
private void init(){
String order = "id desc";
list= dao.select(WikiInfo.class,false,"id>?",new String[]{"0"},null, null, order,"0,5");
}
private void jump(int index){
Class<?> c;
switch(index){
case 1:c=MissonListActivity.class;break;
case 2:c=AbilityListActivity.class;break;
case 3:c=JobListActivity.class;break;
case 4:c=ADCListActivity.class;break;
case 5:c=WikiListActivity.class;break;
default:Toast.makeText(context.getApplicationContext(),"还在建设中",Toast.LENGTH_SHORT).show();return;
}
Intent intent=new Intent(context,c);
startActivity(intent);
}
}
```
FortuneEvent.java
```package com.key.doltool.event;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.HashSet;
import java.util.Locale;
import java.util.Set;
import android.content.Context;
import android.util.Log;
import com.google.gson.Gson;
import com.key.doltool.data.LuckyInfo;
import com.key.doltool.util.NumberUtil;
/**运势处理事件**/
public class FortuneEvent {
private Context context;
private double chance=50;
private int good_time=0;
private int bad_time=0;
public static String[] type={
"探险","远航","寻宝","采集","打捞",
"生产","出售","购入","投资","实验",
"收夺","讨伐","抢劫","练战","蓝海"
};
public FortuneEvent(Context context){
this.context=context;
}
/**
* 规则:<br>
* ①每天获得一种运势，每天随机<br>
* ②50%获得凶吉,会随着出现的次数递减概率
* 例如：第一次出现吉，则第二次出现吉的概率为25%<br>
* ③出现吉或者凶的数量为随机数(0-6),另吉或者凶最多不能超过4
* 另外0的概率要下调，如果第一次为0会重新获得次,如果第二次为
* 0,1则在获得一次<br>
* ④特别事件（诸事不宜,诸事大顺）
**/
public void getRandomChance(){
//获得出现的总数
int random_times=NumberUtil.getRandom(0,6);
if(random_times<2){
random_times=NumberUtil.getRandom(0,6);
}
if(random_times==0){
random_times=NumberUtil.getRandom(0,6);
}
if(random_times==0){
random_times=NumberUtil.getRandom(0,6);
}
if(random_times==0){
random_times=NumberUtil.getRandom(0,6);
}
//随机生成不同的n个数
Set<String> set=new HashSet<>();
Set<Integer> list_type = new HashSet<>();
System.out.println(random_times);
while (list_type.size() < random_times) {
int temp=list_type.size();
//获得本次的是吉还是凶
int bool=getThisState();
//获得本次出现的type是
int random_type=NumberUtil.getRandom(0,14);
list_type.add(random_type);
//如果加入的类型之前存在则不存入
if(temp!=list_type.size()){
set.add(bool+"-"+random_type);
}
}
Gson gson=new Gson();
saveData(gson.toJson(set));
System.out.println("set:"+gson.toJson(set));
}
private int getThisState(){
int base=Math.abs(bad_time-good_time)+1;
double now_chance=chance/base;
if(good_time==4){
now_chance=0;
}
if(bad_time==4){
now_chance=100;
}
if(NumberUtil.getRandomByPercent(now_chance)){
good_time++;
return 1;
}else{
bad_time++;
return 0;
}
}
private void saveData(String str){
//时间判断，如果存在今天的数据则不覆盖
LuckyInfo info=new LuckyInfo(context);
SimpleDateFormat formatter=new SimpleDateFormat("yyyy-MM-dd",Locale.CHINA);
Date curDate=new Date(System.currentTimeMillis());
String time=formatter.format(curDate);
Log.i("s",time);
if(!info.getToday().equals(time)){
info.setToday(time);
info.setData(str);
}
}
}
```
BitMapUtil.java
```package com.key.doltool.util;
import android.graphics.Bitmap;
import android.graphics.BitmapFactory;
import android.graphics.Canvas;
import android.graphics.Picture;
import android.graphics.PixelFormat;
import android.graphics.drawable.BitmapDrawable;
import android.graphics.drawable.Drawable;
import android.view.View;
import android.webkit.WebView;
import android.widget.ScrollView;
import java.io.ByteArrayInputStream;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
public class BitMapUtil {
/**View to Bitmap**/
public static Bitmap view2Bitmap(View v) {
v.setDrawingCacheEnabled(true);
v.buildDrawingCache();
Bitmap bitmap= v.getDrawingCache();
bitmap = Bitmap.createBitmap(bitmap);
if(bitmap!=null){
return bitmap;
}else{
return null;
}
}
/** ScrollView to Bitmap **/
public static Bitmap scrollView2Bitmap(ScrollView scrollView){
int h = 0;for (int i = 0; i < scrollView.getChildCount(); i++)
{
h += scrollView.getChildAt(i).getHeight();
}
Bitmap bitmap = Bitmap.createBitmap
(scrollView.getWidth(),h,Bitmap.Config.ARGB_8888);
// Bitmap bitmap = scrollView.getDrawingCache(true);
final Canvas c = new Canvas(bitmap);
scrollView.draw(c);
return bitmap;
}
/** WebView to Bitmap **/
@SuppressWarnings("deprecation")
public static Bitmap webView2Bitmap(WebView webView){
Picture snapShot = webView.capturePicture();
Bitmap bitmap = Bitmap.createBitmap
(webView.getWidth(),snapShot.getHeight(),Bitmap.Config.ARGB_8888);
// Bitmap bitmap = scrollView.getDrawingCache(true);
final Canvas c = new Canvas(bitmap);
snapShot.draw(c);
return bitmap;
}
/** Bitmap to png**/
public static void savepic(Bitmap bitmap,int id){
String str=FileManager.getSaveFilePath()+"pic/"+"fa"+id+".png";
File f=new File(str);
FileOutputStream fos;
try {
if(!f.exists()){
f.getParentFile().mkdir();
f.createNewFile();
}
fos = new FileOutputStream(str);
bitmap.compress(Bitmap.CompressFormat.PNG,100,fos);
} catch (FileNotFoundException e) {
e.printStackTrace();
} catch (IOException e) {
e.printStackTrace();
}
}
public static Bitmap drawableToBitmap(Drawable drawable){
int width = drawable.getIntrinsicWidth();
int height = drawable.getIntrinsicHeight();
Bitmap bitmap = Bitmap.createBitmap(width, height, drawable.getOpacity() != PixelFormat.OPAQUE ? Bitmap.Config.ARGB_8888 : Bitmap.Config.RGB_565);
Canvas canvas = new Canvas(bitmap);
drawable.setBounds(0,0,width,height);
drawable.draw(canvas);
return bitmap;
}
/** file to Bitmap**/
public static Bitmap getBitmapByFile(String pathName){
return BitmapFactory.decodeFile(pathName);
}
/** InputStream to Bitmap**/
public static Bitmap getBitmapByInputStream(InputStream in){
Bitmap bitmap=BitmapFactory.decodeStream(in);
bitmap.setDensity(android.util.DisplayMetrics.DENSITY_HIGH);
return bitmap;
}
public static Bitmap getBitmapByInputStream(InputStream in,int density){
Bitmap bitmap=BitmapFactory.decodeStream(in);
bitmap.setDensity(density);
return bitmap;
}
public static Bitmap getBitmapByInputStream(InputStream in,boolean bool){
return BitmapFactory.decodeStream(in);
}
@SuppressWarnings("deprecation")
public static Bitmap getBitmapByInputStream(byte[] data){
int inSampleSize=1;
if(data.length>512*1024){
inSampleSize=data.length/(512*1024);
if(inSampleSize>4){
inSampleSize=4;
}
}
BitmapFactory.Options opt = new BitmapFactory.Options();
opt.inJustDecodeBounds = false;
opt.inPreferredConfig = Bitmap.Config.RGB_565;
if (android.os.Build.VERSION.SDK_INT<android.os.Build.VERSION_CODES.LOLLIPOP){
opt.inPurgeable = true;
opt.inInputShareable = true;
}
opt.inSampleSize=inSampleSize;
InputStream in =new ByteArrayInputStream(data);
return BitmapFactory.decodeStream(in,null,opt);
}
@SuppressWarnings("deprecation")
public static Bitmap getBitmapByInputStream(byte[] data,int sampleSize){
BitmapFactory.Options opt = new BitmapFactory.Options();
opt.inJustDecodeBounds = false;
opt.inPreferredConfig = Bitmap.Config.RGB_565;
if (android.os.Build.VERSION.SDK_INT<android.os.Build.VERSION_CODES.LOLLIPOP){
opt.inPurgeable = true;
opt.inInputShareable = true;
}
opt.inSampleSize= sampleSize;
InputStream in =new ByteArrayInputStream(data);
return BitmapFactory.decodeStream(in,null,opt);
}
}
```
UpdateConst.java
```package com.key.doltool.event.app;
import android.os.Environment;
public class UpdateConst {
public static final String SET = "set";
public static final String PRODUCT_MARK = "productId";
public static final String VERSION_FLAG = "versionFlag";
public static final String ENCODE_MARK = "UTF-8";
public static final String PACKAGE_ARCHIVE = "application/vnd.android.package-archive";
public static final String APK_EXTENSION = ".apk";
public static final String SDCARD_ROOT = Environment.getExternalStorageDirectory().getPath();
public static final String FORCE_UPDATE = "1";
}
```
DialogUtil.java
```package com.key.doltool.app.util;
import android.app.Activity;
import android.app.Dialog;
/**
* 对话框显示/隐藏泛用
* Created by key on 2016/12/26.
*/
public class DialogUtil {
public static void show(Activity activity,Dialog dialog){
if(activity!=null&&!activity.isFinishing()){
if(dialog!=null&&!dialog.isShowing()){
dialog.show();
}
}
}
public static void dismiss(Activity activity,Dialog dialog){
if(activity!=null&&!activity.isFinishing()){
if(dialog!=null&&dialog.isShowing()){
dialog.dismiss();
}
}
}
}
```
PermissionEvent.java
```package com.key.doltool.event;
import android.app.Activity;
import android.content.Context;
import android.content.DialogInterface;
import android.content.pm.PackageManager;
import androidx.appcompat.app.AlertDialog;
import androidx.core.app.ActivityCompat;
import androidx.core.content.ContextCompat;
import android.util.Log;
/**
* 权限模型事件
* 0.2
* **/
public class PermissionEvent {
private PermissionAllowListener allowListener;
private Activity context;
private int code;
private String permission;
private String[] permissions;
/**单一权限申请**/
public PermissionEvent(final Activity context,String permission,PermissionAllowListener allowListener,int code
,String info) {
this.allowListener = allowListener;
this.context=context;
this.code=code;
this.permission=permission;
init(info);
}
/**多个权限一并申请**/
public PermissionEvent(final Activity context,String[] permissions,PermissionAllowListener allowListener,int code
,String info) {
this.allowListener = allowListener;
this.context=context;
this.code=code;
this.permissions=permissions;
init(info);
}
/**权限触发事件
* onPermissionAllow 允许事件
* onPermissionDenied 拒绝事件
* **/
public interface PermissionAllowListener{
void onPermissionAllow(int code);
void onPermissionDenied(int code);
}
/**放入调用权限的方法之中**/
public void onRequest(int[] result){
int grantTemp=0;
for (int grantResult : result) {
if (grantResult != 0) {
grantTemp = grantResult;
}
}
if (grantTemp == PackageManager.PERMISSION_GRANTED) {
// Permission Granted
allowListener.onPermissionAllow(code);
} else {
// Permission Denied
allowListener.onPermissionDenied(code);
}
}
private void init(String info) {
String[] temp_permissions=new String[]{permission};
if(permissions!=null){
temp_permissions=permissions;
}
Log.i("s",""+initSuccess(temp_permissions));
switch (initSuccess(temp_permissions)){
case 0:
final String[] finalTemp_permissions = temp_permissions;
showMessageOKCancel(context, info,
new DialogInterface.OnClickListener() {
@Override
public void onClick(DialogInterface dialog, int which) {
ActivityCompat.requestPermissions(context, finalTemp_permissions,
code);
}
});
break;
case 1:
ActivityCompat.requestPermissions(context,temp_permissions,
code);
break;
case 2:
allowListener.onPermissionAllow(code);
break;
}
}
private int initSuccess(String[] temp_permission){
int temp=0;
for (String aTemp_permission : temp_permission) {
if (checkPermission(context,aTemp_permission)) {
if (ActivityCompat.shouldShowRequestPermissionRationale(context,aTemp_permission)) {
temp=1;
}else{
return 0;
}
}else{
temp=2;
}
}
return temp;
}
/**查询权限是否允许**/
private boolean checkPermission(Context context,String permission){
Log.i("a", ""+ContextCompat.checkSelfPermission(context, permission));
Log.i("b", ""+PackageManager.PERMISSION_GRANTED);
return ContextCompat.checkSelfPermission(context, permission) != PackageManager.PERMISSION_GRANTED;
}
/**权限取消提示**/
private void showMessageOKCancel(Context context,String message, DialogInterface.OnClickListener okListener) {
new AlertDialog.Builder(context)
.setTitle("权限提示")
.setMessage(message)
.setPositiveButton("确认", okListener)
.create()
.show();
}
}
```
CardComboAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.LinearLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.CardCombo;
import com.key.doltool.util.StringUtil;
public class CardComboAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public TextView effect;
public LinearLayout card_1,card_2,card_3;
public TextView card_1_name,card_2_name,card_3_name;
}
public static int SIZE=30;
private List<CardCombo> list=new ArrayList<>();
private Context context;
public CardComboAdapter(List<CardCombo> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.cardcombo_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.effect=(TextView)convertView.findViewById(R.id.effect);
holder.card_1=(LinearLayout)convertView.findViewById(R.id.card_1);
holder.card_2=(LinearLayout)convertView.findViewById(R.id.card_2);
holder.card_3=(LinearLayout)convertView.findViewById(R.id.card_3);
holder.card_1_name=(TextView)convertView.findViewById(R.id.card_1_name);
holder.card_2_name=(TextView)convertView.findViewById(R.id.card_2_name);
holder.card_3_name=(TextView)convertView.findViewById(R.id.card_3_name);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
String effect="效果:"+list.get(position).getEffect();
holder.effect.setText(effect);
if(StringUtil.isNull(list.get(position).getCard_1())){
holder.card_1.setVisibility(View.GONE);
}else{
holder.card_1.setVisibility(View.VISIBLE);
holder.card_1_name.setText(list.get(position).getCard_1());
}
if(StringUtil.isNull(list.get(position).getCard_2())){
holder.card_2.setVisibility(View.GONE);
}else{
holder.card_2.setVisibility(View.VISIBLE);
holder.card_2_name.setText(list.get(position).getCard_2());
}
if(StringUtil.isNull(list.get(position).getCard_3())){
holder.card_3.setVisibility(View.GONE);
}else{
holder.card_3.setVisibility(View.VISIBLE);
holder.card_3_name.setText(list.get(position).getCard_3());
}
return convertView;
}
}
```
ShowItemAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.util.ViewUtil;
import java.util.ArrayList;
import java.util.List;
public class ShowItemAdapter extends BaseAdapter {
private static class ViewHolder{
public TextView name,info;
public ImageView pic;
}
private List<UseItem> list=new ArrayList<>();
private Context context;
public ShowItemAdapter(List<UseItem> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public UseItem getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_useitem_show, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.info=(TextView)convertView.findViewById(R.id.info);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
// 为view设置标签
convertView.setTag(holder);
}
else {
holder = (ViewHolder) convertView.getTag();
}
holder.info.setText(list.get(position).info);
holder.name.setText(list.get(position).name);
ViewUtil.setImageView(holder.pic,list.get(position).name,context);
//设置
return convertView;
}
}```
AutoTextViewAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.Filter;
import android.widget.Filterable;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.app.util.AutoAdapterHelper;
import java.util.ArrayList;
import java.util.List;
public class AutoTextViewAdapter extends BaseAdapter implements Filterable {
public List<String> mList;
private Context mContext;
private MyFilter mFilter;
private AutoAdapterHelper autoAdapterHelper;
private static class ViewHolder{
public TextView name;
}
public AutoTextViewAdapter(Context context) {
mContext = context;
mList = new ArrayList<>();
autoAdapterHelper=new AutoAdapterHelper();
}
public AutoAdapterHelper getAutoAdapterHelper(){
return autoAdapterHelper;
}
@Override
public int getCount() {
return mList == null ? 0 : mList.size();
}
@Override
public Object getItem(int position) {
return mList == null ? null : mList.get(position);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
holder = new ViewHolder();
LayoutInflater mInflater = LayoutInflater.from(mContext);
convertView = mInflater.inflate(R.layout.item_login_email, null);
holder.name=(TextView)convertView.findViewById(R.id.tv);
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
holder.name.setText(mList.get(position));
return convertView;
}
public Filter getFilter() {
if (mFilter == null) {
mFilter = new MyFilter();
}
return mFilter;
}
private class MyFilter extends Filter {
@Override
protected FilterResults performFiltering(CharSequence constraint) {
FilterResults results = new FilterResults();
if (mList == null) {
mList = new ArrayList<>();
}
results.values = mList;
results.count = mList.size();
return results;
}
@Override
protected void publishResults(CharSequence constraint, FilterResults results) {
if (results.count > 0) {
notifyDataSetChanged();
} else {
notifyDataSetInvalidated();
}
}
}
}```
BaseActivity.java
```package com.key.doltool.activity;
import android.app.Activity;
import android.os.Bundle;
import com.key.doltool.activity.core.BaseFragmentActivity;
import butterknife.ButterKnife;
/**
* BaseActivity
* @author key
* @version 0.3
*/
public abstract class BaseActivity extends BaseFragmentActivity{
public Activity context=BaseActivity.this;
public abstract int getContentViewId();
public boolean flag=true;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(getContentViewId());
ButterKnife.bind(this);
initAllMembersView(savedInstanceState);
}
protected abstract void initAllMembersView(Bundle savedInstanceState);
@Override
protected void onDestroy() {
super.onDestroy();
}
@Override
protected void onResume() {
if(flag){
initToolBar(null);
}
super.onResume();
}
}
```
LuckyInfo.java
```package com.key.doltool.data;
import android.annotation.SuppressLint;
import android.content.Context;
import android.content.SharedPreferences;
/**公共信息配置表**/
public class LuckyInfo {
private SharedPreferences sp;
private SharedPreferences.Editor editor;
/**今天的日期**/
public static final String TODAY="today";
/**今日的运势**/
public static final String DATA="data";
@SuppressLint("CommitPrefEdits")
public LuckyInfo(Context context){
sp=context.getSharedPreferences("lucky", Context.MODE_PRIVATE);
editor=sp.edit();
}
public String getToday() {
return sp.getString(TODAY, "1989-9-8");
}
public void setToday(String date) {
editor.putString(TODAY, date);
editor.commit();
}
public String getData() {
return sp.getString(DATA,"");
}
public void setData(String data) {
editor.putString(DATA, data);
editor.commit();
}
public void clear(){
editor.clear();
editor.commit();
}
}```
UseItemShowListActivity.java
```package com.key.doltool.activity.useitem;
import android.content.Intent;
import android.os.Bundle;
import android.util.Log;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ShowItemAdapter;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.util.db.SRPUtil;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
/**
*
* **/
public class UseItemShowListActivity extends BaseActivity {
@BindView(R.id.listview) ListView listview;
private List<UseItem> list=new ArrayList<>();
private String order="name desc";
private String type="";
@Override
public int getContentViewId() {
return R.layout.user_item_show;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
init();
}
private void findView(){
type=getIntent().getStringExtra("type");
flag=false;
initToolBar(null);
toolbar.setTitle(type);
}
private void init(){
Log.i("type", ":"+type);
list= SRPUtil.getInstance(getApplicationContext()).select(
UseItem.class,false,"type like ?",new String[]{"%"+type+"%"},null,null,order,null);
ShowItemAdapter itemAdapter=new ShowItemAdapter(list,this);
listview.setAdapter(itemAdapter);
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> parent, View view, int position, long id) {
jump(position);
}
});
}
private void jump(int index){
Intent it=new Intent(this,UseItemActivity.class);
it.putExtra("id",""+list.get(index).id);
startActivity(it);
}
}
```
BookAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Book;
import com.key.doltool.event.BookEvent;
public class BookAdapter extends BaseAdapter{
private static class ViewHolder{
public ImageView pic;
public TextView name;
public TextView type;
}
public static int SIZE=30;
private List<Book> list=new ArrayList<>();
private Context context;
public BookAdapter(List<Book> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_skill, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.type=(TextView)convertView.findViewById(R.id.type);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
int types=list.get(position).getType();
holder.pic.setImageResource(new BookEvent().PIC_ID[types]);
holder.type.setText(list.get(position).getRange());
return convertView;
}
}
```
Message.java
```package com.key.doltool.data;
public class Message {
public String word;
public String time;
}
```
RecipeMainAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
public class RecipeMainAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public ImageView pic;
}
private String[] name;
private int[] pics;
private Context context;
public RecipeMainAdapter(String[] name,int[] pics,Context context){
this.name=name;
this.pics=pics;
this.context=context;
}
public int getCount() {
return pics.length;
}
@Override
public Object getItem(int arg0) {
return name[arg0];
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_recipe_main, null);
holder.name=(TextView)convertView.findViewById(R.id.item);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(name[position]);
holder.pic.setImageResource(pics[position]);
return convertView;
}
}```
CardCombo.java
```package com.key.doltool.data.sqlite;
import com.key.doltool.data.sqlite.Card;
import com.key.doltool.util.StringUtil;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
import java.util.ArrayList;
import java.util.List;
@Table(name="CardCombo")
public class CardCombo {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//效果
@Column(name="effect")
private String effect;
//第一张卡
@Column(name="card_1")
private String card_1;
//第二张卡
@Column(name="card_2")
private String card_2;
//第三张卡
@Column(name="card_3")
private String card_3;
@Column(name="value")
public int value;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getEffect() {
return effect;
}
public void setEffect(String effect) {
this.effect = effect;
}
public String getCard_1() {
return card_1;
}
public void setCard_1(String card_1) {
this.card_1 = card_1;
}
public String getCard_2() {
return card_2;
}
public void setCard_2(String card_2) {
this.card_2 = card_2;
}
public String getCard_3() {
return card_3;
}
public void setCard_3(String card_3) {
this.card_3 = card_3;
}
public List<Card> getCard(){
List<Card> list=new ArrayList<>();
Card card1=new Card();
String temp1[]=card_1.split("-");
card1.type=temp1[0];
String temp2[]=temp1[1].split("\\(");
card1.name=temp2[0];
String temp3[]=temp2[1].split("\\)");
card1.point=Integer.parseInt(temp3[0]);
list.add(card1);
Card card2=new Card();
String temp11[]=card_2.split("-");
card2.type=temp11[0];
String temp22[]=temp11[1].split("\\(");
card2.name=temp22[0];
String temp33[]=temp22[1].split("\\)");
card2.point=Integer.parseInt(temp33[0]);
list.add(card2);
if(!StringUtil.isNull(card_3)){
Card card3=new Card();
String temp13[]=card_3.split("-");
card3.type=temp13[0];
String temp23[]=temp13[1].split("\\(");
card3.name=temp23[0];
String temp3_3[]=temp23[1].split("\\)");
card3.point=Integer.parseInt(temp3_3[0]);
list.add(card3);
}
return list;
}
}
```
FortuneActivity.java
```package com.key.doltool.activity.squre;
import java.util.ArrayList;
import java.util.List;
import android.os.Bundle;
import android.view.ViewGroup;
import android.widget.TextView;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.data.LuckyInfo;
import com.key.doltool.event.FortuneEvent;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.view.SystemBarTintManager;
import butterknife.BindView;
/**
* 航海运势
* @author key
* @version 0.1
* @since 2014-1-15
*/
public class FortuneActivity extends BaseActivity{
private List<String> total_list=new ArrayList<>();
private List<Integer> good_list=new ArrayList<>();
private List<Integer> bad_list=new ArrayList<>();
@BindView(R.id.main_txt) TextView main_txt;
@BindView(R.id.bottom_txt) TextView bottom_txt;
@BindView(R.id.good_txt) TextView good_txt;
@BindView(R.id.bad_txt) TextView bad_txt;
@BindView(R.id.main_area) ViewGroup main_area;
@Override
public int getContentViewId() {
return R.layout.magic_layout;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
toolbar.setTitle("今日运势");
initData();
}
private void initData(){
SystemBarTintManager tintManager = new SystemBarTintManager(this);
tintManager.setStatusBarTintEnabled(true);
//step1:执行获取数据方法,填充List
new FortuneEvent(this).getRandomChance();
LuckyInfo info=new LuckyInfo(this);
Gson g=new Gson();
String date=StringUtil.TransDateFormatterToChines(info.getToday());
total_list=g.fromJson(info.getData(), new TypeToken<List<String>>(){}.getType());
for(int i=0;i<total_list.size();i++){
String temp[]=total_list.get(i).split("-");
if(temp[0].equals("1")){
good_list.add(Integer.parseInt(temp[1]));
}
if(temp[0].equals("0")){
bad_list.add(Integer.parseInt(temp[1]));
}
}
//step2:根据list数据填充界面
String[] lucky_txt=ResourcesUtil.getArray(this,R.array.luck_level_txt);
String txt=lucky_txt[good_list.size()-bad_list.size()+4];
//填充主区域文字及背景颜色
main_txt.setText(txt);
if(good_list.size()-bad_list.size()>0){
tintManager.setStatusBarTintResource(R.color.Crimson);
toolbar.setBackgroundColor(ResourcesUtil.getColorId(R.color.Crimson, this));
main_area.setBackgroundColor(ResourcesUtil.getColorId(R.color.Crimson, this));
bottom_txt.setBackgroundColor(ResourcesUtil.getColorId(R.color.Crimson, this));
bottom_txt.setText(date+" 吉");
}else if(good_list.size()-bad_list.size()==0){
tintManager.setStatusBarTintResource(R.color.Blue_SP);
toolbar.setBackgroundColor(ResourcesUtil.getColorId(R.color.Blue_SP, this));
main_area.setBackgroundColor(ResourcesUtil.getColorId(R.color.Blue_SP, this));
bottom_txt.setBackgroundColor(ResourcesUtil.getColorId(R.color.Blue_SP, this));
bottom_txt.setText(date+" 平");
}else if(good_list.size()-bad_list.size()<0){
tintManager.setStatusBarTintResource(R.color.SlateGray);
toolbar.setBackgroundColor(ResourcesUtil.getColorId(R.color.SlateGray, this));
main_area.setBackgroundColor(ResourcesUtil.getColorId(R.color.SlateGray, this));
bottom_txt.setBackgroundColor(ResourcesUtil.getColorId(R.color.SlateGray, this));
bottom_txt.setText(date+" 凶");
}
String good_temp="";
String bad_temp="";
//填充宜，忌列表项
for(int i=0;i<good_list.size();i++){
if(i==good_list.size()-1){
good_temp+=FortuneEvent.type[good_list.get(i)];
}else{
good_temp+=FortuneEvent.type[good_list.get(i)]+" ";
}
}
for(int i=0;i<bad_list.size();i++){
if(i==bad_list.size()-1){
bad_temp+=FortuneEvent.type[bad_list.get(i)];
}else{
bad_temp+=FortuneEvent.type[bad_list.get(i)]+" ";
}
}
if(good_temp.equals("")){
good_temp="诸事不宜";
}
if(bad_temp.equals("")){
bad_temp="无事可忌";
}
good_txt.setText(good_temp);
bad_txt.setText(bad_temp);
}
}
```
VersionManager.java
```package com.key.doltool.event.app;
import android.app.Activity;
public class VersionManager {
private static VersionManager versionManager = null;
private Activity activity;
public static VersionManager getInstance() {
if (versionManager == null) {
versionManager = new VersionManager();
}
return versionManager;
}
public Activity getActivity() {
return activity;
}
public void setActivity(Activity activity) {
this.activity = activity;
}
public void checkVersion(final boolean flag) {
}
}
```
ListFlowHelper.java
```package com.key.doltool.app.util;
import android.content.Context;
import android.content.Intent;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import java.util.ArrayList;
import java.util.List;
/**
* 列表流程辅助
* Created by key on 2016/12/22.
*/
public class ListFlowHelper<T> {
private SRPUtil dao;
public List<T> list=new ArrayList<>();
public boolean end_flag=true; //是否为最末标记
private int add=0;
private int size=0;
//查询条件
private String select_if="id>?";
private List<String> select_if_x=new ArrayList<>();
private String order=null;
private Class<T> itemClass;
private ListFlowCallBack listFlowCallBack;
private ListScrollListener listScrollListener;
public interface ListFlowCallBack{
void showSelectToast(String msg);
void setAdapter();
void updateAdapter();
}
public ListFlowHelper(Class<T> itemClass,Context context,ListFlowCallBack listFlowCallBack,int size){
dao=SRPUtil.getInstance(context);
this.itemClass=itemClass;
this.listFlowCallBack=listFlowCallBack;
this.size=size;
select_if_x.add("0");
}
public ListFlowHelper(Class<T> itemClass,Context context,ListFlowCallBack listFlowCallBack,int size,String order){
dao=SRPUtil.getInstance(context);
this.itemClass=itemClass;
this.listFlowCallBack=listFlowCallBack;
this.size=size;
this.order=order;
select_if_x.add("0");
}
public void setListScrollListener(ListScrollListener listScrollListener){
this.listScrollListener=listScrollListener;
}
/**设置来源值**/
public void getExtra(Intent intent) {
if (!StringUtil.isNull(intent.getStringExtra("type"))) {
select_if = intent.getStringExtra("type");
select_if_x.clear();
select_if_x.add(intent.getStringExtra("args"));
}
}
/**查询流**/
public void selectshow(String limit){
//数据前后记录
int size_before,size_after;
size_before=list.size();
list.addAll(dao.select(itemClass, false, select_if,StringUtil.listToArray(select_if_x),
null,null,order,limit));
size_after=list.size();
//数据返回判断
if(size_after==size){
end_flag=true;
listScrollListener.changeFlag(true);
}else if(size_after<size){
//表示，小于
end_flag=false;
listScrollListener.changeFlag(false);
}else if(size_after==size_before&&size_after!=0){
end_flag=false;
listScrollListener.changeFlag(false);
listFlowCallBack.showSelectToast("已经返回所有查询结果了");
}else if(size_after==0){
listFlowCallBack.showSelectToast("没有查到您想要的结果");
}
}
//修改查询条件
public void change_if(String if_s,String if_args){
//初始化所有数据
select_if=if_s;
select_if_x.clear();
select_if_x.add(if_args);
list.clear();
add=0;
selectshow("0,"+size);
//重新setAdapter
listFlowCallBack.setAdapter();
}
//修改查询条件
public void change_if(String if_s,List<String> if_args){
//初始化所有数据
select_if=if_s;
select_if_x=if_args;
list.clear();
add=0;
selectshow("0,"+size);
//重新setAdapter
listFlowCallBack.setAdapter();
}
public void change(){
add+=size;
selectshow(add+","+ size);
listFlowCallBack.updateAdapter();
}
public void change(boolean start){
if(start){
add=-size;
}
add+=size;
selectshow(add+","+ size);
listFlowCallBack.updateAdapter();
}
public boolean isChange(){
return select_if.equals("id>?");
}
public void reback(){
//条件不是初始状态就重置
if(!select_if.equals("id>?")){
end_flag=true;
listScrollListener.changeFlag(true);
change_if("id>?","0");
listFlowCallBack.showSelectToast("重置搜索条件");
}
}
}
```
FragmentItem.java
```package com.key.doltool.activity.core;
import androidx.fragment.app.Fragment;
public class FragmentItem {
public Fragment fragment;
public int index;
public String title;
}
```
AbilityForBoatDetailActivity.java
```package com.key.doltool.activity.ability;
import android.os.Bundle;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.SailBoatListAdapter;
import com.key.doltool.data.SailBoat;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.view.LinearLayoutForListView;
import com.the9tcat.hadi.DefaultDAO;
import java.io.IOException;
import java.util.List;
import butterknife.BindView;
/**
* 船只技能详情显示界面
* 展示特点：显示哪些船拥有此项船技能
* **/
public class AbilityForBoatDetailActivity extends BaseActivity{
@BindView(R.id.boat_array) LinearLayoutForListView boat_array;
@BindView(R.id.pic) ImageView img;
@BindView(R.id.name) TextView name;
@BindView(R.id.details) TextView details;
@BindView(R.id.skill_need) TextView skill_need;
@Override
public int getContentViewId() {
return R.layout.skill_details_boat;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
DefaultDAO dao = SRPUtil.getDAO(this);
String id = getIntent().getStringExtra("id");
Skill item = (Skill) dao.select(Skill.class, false, "id=?", new String[]{"" + id}, null, null, null, null).get(0);
name.setText(item.getName());
details.setText(item.getDetail());
skill_need.setText(item.getNeed());
ImageLoader.setBitmapByAssets(img,FileManager.SKILL+ item.getPic_id()+".png",this);
List<SailBoat> sail= SRPUtil.getInstance(this).select(SailBoat.class,false,"ability like ?"
,new String[]{"%"+ item.getName()+"%"},null,null,null,null);
boat_array.setAdapter(new SailBoatListAdapter(sail, this));
}
}
```
Toast.java
```package com.key.doltool.view;
import android.content.Context;
import androidx.annotation.StringRes;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.TextView;
import com.key.doltool.R;
/**
*自定义Toast
*@author key
**/
public class Toast {
public final static int LENGTH_LONG=1;
public final static int LENGTH_SHORT=0;
private static android.widget.Toast mToast;
public static android.widget.Toast makeText(Context context ,String msg,int duration){
LayoutInflater mInflater = LayoutInflater.from(context);
View view = mInflater.inflate(R.layout.toast_view, null);
TextView txt=(TextView)view.findViewById(R.id.toast_txt);
txt.setText(msg);
if(mToast==null){
mToast=new android.widget.Toast(context);
mToast.setView(view);
mToast.setDuration(duration);
}else{
mToast.setView(view);
mToast.setDuration(duration);
}
return mToast;
}
public static android.widget.Toast makeText(Context context ,@StringRes int res_id,int duration){
LayoutInflater mInflater = LayoutInflater.from(context);
View view = mInflater.inflate(R.layout.toast_view, null);
TextView txt=(TextView)view.findViewById(R.id.toast_txt);
txt.setText(res_id);
if(mToast==null){
mToast=new android.widget.Toast(context);
mToast.setView(view);
mToast.setDuration(duration);
}else{
mToast.setView(view);
mToast.setDuration(duration);
}
return mToast;
}
public static void cancelToast() {
if (mToast != null) {
mToast.cancel();
}
}
}
```
Verion.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Verion")
public class Verion {
@Column(name="verion")
public int verion;
@Column(name="update_time")
public String update_time;
}
```
Mission.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Mission")
public class Mission{
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//类型(冒，商，战)
@Column(name="type")
private String type;
//技能需求:（搜索7，英语）
@Column(name="skill_need")
private String skill_need;
//接受任务城市
@Column(name="start_city")
private String start_city;
//发现物(限制类型:冒)
@Column(name="find_item")
private String find_item;
//入手物
@Column(name="get_item")
private String get_item;
//报酬
@Column(name="money")
private String money;
//经验
@Column(name="exp")
private String exp;
//等级
@Column(name="level")
private String level;
//时间限制
@Column(name="time_up")
private String time_up;
//任务流程
@Column(name="daily")
private String daily;
//备注
@Column(name="other")
private String other;
//前置任务
@Column(name="before")
private String before;
//后续任务
@Column(name="after")
private String after;
//完成标记
@Column(name="tag",default_value="0")
private int tag;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
public String getSkill_need() {
return skill_need;
}
public void setSkill_need(String skill_need) {
this.skill_need = skill_need;
}
public String getStart_city() {
return start_city;
}
public void setStart_city(String start_city) {
this.start_city = start_city;
}
public String getFind_item() {
return find_item;
}
public void setFind_item(String find_item) {
this.find_item = find_item;
}
public String getGet_item() {
return get_item;
}
public void setGet_item(String get_item) {
this.get_item = get_item;
}
public String getMoney() {
return money;
}
public void setMoney(String money) {
this.money = money;
}
public String getExp() {
return exp;
}
public void setExp(String exp) {
this.exp = exp;
}
public String getLevel() {
return level;
}
public void setLevel(String level) {
this.level = level;
}
public String getTime_up() {
return time_up;
}
public void setTime_up(String time_up) {
this.time_up = time_up;
}
public String getDaily() {
return daily;
}
public void setDaily(String daily) {
this.daily = daily;
}
public String getOther() {
return other;
}
public void setOther(String other) {
this.other = other;
}
public String getBefore() {
return before;
}
public void setBefore(String before) {
this.before = before;
}
public String getAfter() {
return after;
}
public void setAfter(String after) {
this.after = after;
}
public int getTag() {
return tag;
}
public void setTag(int tag) {
this.tag = tag;
}
}
```
CollectionActivity.java
```package com.key.doltool.activity.person;
import android.os.Bundle;
import com.key.doltool.activity.BaseActivity;
/**
* 心愿单
* **/
public class CollectionActivity extends BaseActivity {
@Override
public int getContentViewId() {
return 0;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
}
}
```
StringUtil.java
```package com.key.doltool.util;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.List;
import java.util.Locale;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import com.spreada.utils.chinese.ZHConverter;
public class StringUtil {
public static boolean isNumeric(String str){
Pattern pattern = Pattern.compile("[0-9]*");
Matcher isNum = pattern.matcher(str);
return isNum.matches();
}
public static String TransToSimple(String st){
return ZHConverter.convert(st,1);
}
/** 输入:2014-1-5 返回:2014年1月5日 **/
public static String TransDateFormatterToChines(String date){
String[]temp_date=date.split("-");
return temp_date[0]+"年"+temp_date[1]+"月"+temp_date[2]+"日";
}
public static String dateFormat(Date date){
DateFormat df = new SimpleDateFormat("yyyy.MM.dd hh:mm:ss",Locale.CHINA);
return df.format(date);
}
public static boolean isNull(String str){
return str == null || str.equals("")|| str.equals("null");
}
public static String[] listToArray(List<String> list){
String[] temp=new String[list.size()];
for(int i=0;i<temp.length;i++){
temp[i]=list.get(i);
}
return temp;
}
}```
DockYardFragment.java
```package com.key.doltool.activity.dockyard;
import android.os.Bundle;
import android.view.Menu;
import android.view.MenuInflater;
import androidx.appcompat.widget.Toolbar;
import androidx.fragment.app.Fragment;
import androidx.viewpager.widget.ViewPager;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.core.BaseFragmentActivity;
import com.key.doltool.data.MenuItem;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.view.SlidingTabLayout;
import com.key.doltool.viewpage.FPagerAdapter;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
/**
* 造船厂容器界面
*/
public class DockYardFragment extends BaseFragment{
//ViewPager定义部分
@BindView(R.id.main_viewpagers)
ViewPager main_ViewPage;
@BindView(R.id.sliding_tabs) SlidingTabLayout mSlidingTabLayout;
@Override
public int getContentViewId() {
return R.layout.dockyard_main_area;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
}
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setHasOptionsMenu(true);
}
@Override
public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {
inflater.inflate(R.menu.main, menu);
super.onCreateOptionsMenu(menu, inflater);
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.search:
intentMenu(main_ViewPage.getCurrentItem());
break;
}
return true;
}
};
private void intentMenu(int index){
MenuItem item=new MenuItem();
item.index=index;
RxBusEvent.get().post(RxBusEvent.SAILMENU,item);
}
@Override
public void onSaveInstanceState(Bundle outState) {
super.onSaveInstanceState(outState);
}
//通用findView
private void findView() {
BaseFragmentActivity a=(BaseFragmentActivity)getActivity();
a.toolbar.setOnMenuItemClickListener(onMenuItemClick);
//初始化ViewPager相关
List<Fragment> main_list = new ArrayList<>();
main_list.add(new SailBoatListFragment());
main_list.add(new BuildBoatFragment());
main_list.add(new PartListFragment());
FPagerAdapter main_adapter = new FPagerAdapter(main_list, new String[]{"船只列表", "造船模拟", "船只配件"},
getChildFragmentManager());
main_ViewPage.setAdapter(main_adapter);
main_ViewPage.setCurrentItem(0);
main_ViewPage.setOffscreenPageLimit(2);
//初始化PageEvent相关
mSlidingTabLayout.setSelectedIndicatorColors(getResources().getColor(R.color.White));
mSlidingTabLayout.setBackgroundResource(R.drawable.theme_dark_blue);
mSlidingTabLayout.setViewPager(main_ViewPage);
}
}```
PartActivity.java
```package com.key.doltool.activity.dockyard;
import java.io.IOException;
import android.os.Bundle;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.anime.MyAnimations;
import com.key.doltool.data.sqlite.Part;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class PartActivity extends BaseActivity{
private DefaultDAO dao;
private Part part;
@BindView(R.id.name) TextView name;
@BindView(R.id.type) TextView type;
@BindView(R.id.pic) ImageView pic;
@BindView(R.id.details_base) LinearLayout base;
@BindView(R.id.base) TextView title_base;
@Override
public int getContentViewId() {
return R.layout.dockyard_part_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getDAO(this);
findView();
init();
setListener();
}
private void findView(){
int id=getIntent().getIntExtra("id",0);
String[] x={""+id};
part=(Part)(dao.select(Part.class, false, "id=?", x,
null, null, null, null).get(0));
}
private void init(){
try {
pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(getAssets().open(FileManager.BOAT+part.getPic_id()+".png")));
} catch (IOException e) {
e.printStackTrace();
}
name.setText(part.getName());
type.setText(getType(part.getType()));
//根据类型调整文字说明
if(part.getZtype()!=0){
title_base.setText("强化性能");
}
String[] map=part.getAdd().split(",");
createByAdd(map);
MyAnimations.fadein(base, 1000);
}
private void createByAdd(String[] map){
for (String aMap : map) {
LayoutInflater mInflater = this.getLayoutInflater();
View v = mInflater.inflate(R.layout.part_base_item, null);
TextView txt = (TextView) v;
txt.setText(aMap);
LayoutParams lp = new LayoutParams(LayoutParams.MATCH_PARENT, LayoutParams.WRAP_CONTENT);
lp.setMargins(0, 5, 0, 5);
txt.setLayoutParams(lp);
base.addView(txt);
}
}
private void setListener(){
}
private String getType(int i){
String str="";
switch(i){
case 0:str="辅助帆";break;
case 1:str="特殊装备";break;
case 2:str="船炮";break;
case 3:str="辅助装甲";break;
case 4:str="船首像";break;
case 5:str="船体";break;
case 6:str="主帆";break;
case 7:str="炮门";break;
case 8:str="兵装";break;
}
return str;
}
}
```
PersonActivity.java
```package com.key.doltool.activity.person;
import android.animation.ObjectAnimator;
import android.app.Dialog;
import android.content.Intent;
import android.graphics.Bitmap;
import android.graphics.drawable.Drawable;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.util.Log;
import android.view.Menu;
import android.view.View;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import androidx.appcompat.widget.Toolbar;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.data.sqlite.Verion;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.event.UserEvent;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.NumberUtil;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.DataSelectUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.view.HoloCircularProgressBar;
import com.key.doltool.view.SystemBarTintManager;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import java.io.UnsupportedEncodingException;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.Date;
import java.util.List;
import java.util.Locale;
import butterknife.BindView;
import cn.leancloud.AVFile;
import cn.leancloud.AVObject;
import cn.leancloud.AVQuery;
import cn.leancloud.AVRelation;
import cn.leancloud.AVUser;
import cn.leancloud.types.AVNull;
import io.reactivex.Observable;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
/**
* 个人信息界面
* **/
public class PersonActivity extends BaseActivity{
@BindView(R.id.name) TextView name;
@BindView(R.id.tag1) TextView tag1;
@BindView(R.id.tag2) TextView tag2;
@BindView(R.id.head_img) ImageView head_img;
@BindView(R.id.function_3) RelativeLayout function_3;
@BindView(R.id.function_2) RelativeLayout function_2;
@BindView(R.id.function_1) RelativeLayout function_1;
@BindView(R.id.holoCircularProgressBar2) HoloCircularProgressBar t_bar;
@BindView(R.id.holoCircularProgressBar1) HoloCircularProgressBar m_bar;
@BindView(R.id.mission_number) TextView mission_number;
@BindView(R.id.trove_number) TextView trove_number;
private Dialog dialog;
private DefaultDAO dao;
private SRPUtil srp;
private Gson g=new Gson();
private Verion v;
private ObjectAnimator mProgressBarAnimator;
private List<?> a,b;
private int a_size,b_size;
private DialogEvent event;
private Drawable bg;
private Bitmap bitmap;
private String back_temp="";
private Disposable updateSubscription;
@Override
public int getContentViewId() {
return R.layout.activity_user;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
event=new DialogEvent();
dialog=event.itemDialog(this,"请稍候...");
dao=SRPUtil.getDAO(getApplication());
srp=SRPUtil.getInstance(getApplication());
findView();
setListener();
}
private void setListener(){
function_1.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.materialDialog(0,"数据同步","是否要同步数据？",PersonActivity.this,0);
}
});
function_2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.materialDialog(0,"密码重置","是否要重置密码？",PersonActivity.this,1);
}
});
function_3.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
event.materialDialog(0,"注销","是否需要注销当前用户？",PersonActivity.this,2);
}
});
}
private void findView(){
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle("个人信息");
toolbar.setBackgroundColor(getResources().getColor(R.color.black));
SystemBarTintManager tintManager = new SystemBarTintManager(this);
tintManager.setStatusBarTintEnabled(true);
tintManager.setStatusBarTintResource(R.color.black);
new Thread(mTask).start();
init();
Observable<Boolean> sailBoatObservable = RxBusEvent.get().register(RxBusEvent.UPDATE);
updateSubscription=sailBoatObservable.subscribe(new Consumer<Boolean>() {
@Override
public void accept(Boolean flag) {
if(flag) {
init();
}
}
});
}
@Override
protected void onDestroy() {
if (mProgressBarAnimator != null) {
mProgressBarAnimator.cancel();
mProgressBarAnimator=null;
}
if(bitmap!=null&&!bitmap.isRecycled()){
bitmap.recycle();
bitmap=null;
}
if(bg!=null){
bg.setCallback(null);
bg=null;
}
dao=null;
updateSubscription.dispose();
RxBusEvent.get().unregister(RxBusEvent.UPDATE);
System.gc();
super.onDestroy();
}
private Handler mHandler=new Handler(){
public void handleMessage(Message msg) {
super.handleMessage(msg);
if(!StringUtil.isNull(back_temp)){
dialog.dismiss();
back_temp="";
Toast.makeText(getApplicationContext(),"数据已同步",Toast.LENGTH_SHORT).show();
}
mission_number.setText("" + a_size);
trove_number.setText("" + b_size);
if (mProgressBarAnimator != null) {
mProgressBarAnimator.cancel();
}
t_bar.setProgressWithAnimation(b_size * 1.0f / ResourcesUtil.getInt(PersonActivity.this, R.integer.all_trove) * 1.0f, 2000);
m_bar.setProgressWithAnimation(a_size * 1.0f / ResourcesUtil.getInt(PersonActivity.this, R.integer.all_mission) * 1.0f, 2000);
}
};
private Runnable mTask=new Runnable(){
public void run() {
if(!StringUtil.isNull(back_temp)){
List<String> list=g.fromJson(back_temp, new TypeToken<List<String>>(){}.getType());
UpdataCount event=new UpdataCount(PersonActivity.this);
event.backSync(list);
}
a_size=(int) srp.countByType(true,0);
b_size=(int) srp.countByType(true,1);
mHandler.sendMessage(mHandler.obtainMessage());
a=dao.select(Mission.class,false,"tag=?", new String[]{"1"},null, null, null,null);
b=dao.select(Trove.class,false,"flag=?", new String[]{"1"},null, null, null,null);
}
};
//同步信息
public void syncInfo(String fileName){
if(a==null||b==null){
Toast.makeText(getApplicationContext(),"暂无数据，无需同步",Toast.LENGTH_SHORT).show();
}
//同步数据
dialog.show();
v=DataSelectUtil.UpdateTime(dao);
//1.根据时间判断是需要下载还是更新数据
//2.如果本地的时间过早则进行下载，并提示，其他一律进行数据的同步
List<String> temp=new ArrayList<>();
for(int i=0;i<a.size();i++){
Mission misson=(Mission)a.get(i);
temp.add("m+"+misson.getId());
}
for(int i=0;i<b.size();i++){
Trove trove=(Trove)b.get(i);
temp.add("t+"+trove.getId());
}
byte[] data={};
try {
data = g.toJson(temp).getBytes("UTF-8");
} catch (UnsupportedEncodingException e1) {
e1.printStackTrace();
}
final AVFile file=new AVFile(fileName,data);
file.saveInBackground();
AVQuery<AVObject> query = AVQuery.getQuery("BackUp");
query.whereEqualTo("userId", AVUser.getCurrentUser());
//更新
query.findInBackground().subscribe(new Observer<List<AVObject>>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(List<AVObject> commentList) {
if(commentList.size()!=0){
//有数据的情况（判断时间进行更新）
SimpleDateFormat s=new SimpleDateFormat("yyyy.MM.dd hh:mm:ss",Locale.CHINA);
int temp=NumberUtil.compare_date(v.update_time,s.format(commentList.get(0).getDate("syncTime")));
Log.i("temp",temp+"");
if(temp<0){
//需要本地更新（弹出提示）
AVFile syncFile =commentList.get(0).getAVFile("backFile");
//展示对话框-时间不同步
v.update_time=StringUtil.dateFormat(commentList.get(0).getDate("syncTime"));
syncFile.getDataInBackground().subscribe(new Observer<byte[]>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(byte[] bytes) {
try {
back_temp=new String(bytes,"UTF-8");
dao.update(v,new String[]{"update_time"},"verion>?",new String[]{"0"});
new Thread(mTask).start();
} catch (UnsupportedEncodingException e1) {
e1.printStackTrace();
}
}
@Override
public void onError(Throwable e) {
dialog.dismiss();
Toast.makeText(getApplicationContext(),"错误",Toast.LENGTH_SHORT).show();
}
@Override
public void onComplete() {
}
});
}else{
//云服务更新
Date date=new Date();
v.update_time=StringUtil.dateFormat(date);
dao.update(v,new String[]{"update_time"},"verion>?",new String[]{"0"});
AVObject syncData=commentList.get(0);
AVRelation<AVObject> relation=syncData.getRelation("userId");
relation.add(AVUser.getCurrentUser());
syncData.put("backFile",file);
syncData.put("syncTime", date);
syncData.saveInBackground().subscribe(new Observer<AVObject>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVObject avObject) {
Toast.makeText(getApplicationContext(),"数据已同步",Toast.LENGTH_SHORT).show();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"错误",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
}else{
//没有数据的情况（直接更新）
Date date=new Date();
v.update_time=StringUtil.dateFormat(date);
dao.update(v,new String[]{"update_time"},"verion>?",new String[]{"0"});
AVObject syncData=new AVObject("BackUp");
AVRelation<AVObject> relation=syncData.getRelation("userId");
relation.add(AVUser.getCurrentUser());
syncData.put("backFile",file);
syncData.put("syncTime", date);
syncData.saveInBackground().subscribe(new Observer<AVObject>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVObject avObject) {
Toast.makeText(getApplicationContext(),"数据已同步",Toast.LENGTH_SHORT).show();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"错误",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"错误",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
//重新密码
public void resetPassword(){
dialog.show();
AVUser.requestPasswordResetInBackground(AVUser.getCurrentUser().getEmail()).subscribe(new Observer<AVNull>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVNull avNull) {
Toast.makeText(getApplicationContext(),"请查收注册的邮箱进行重置密码",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"错误",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
//初始化用户
private void init(){
AVUser currentUser = AVUser.getCurrentUser();
//如果有用户则
if (currentUser != null) {
AVFile headImg=currentUser.getAVFile("headPic");
if(headImg!=null){
ImageLoader.picassoLoadCircle(this, headImg.getUrl(),head_img);
}else{
ImageLoader.picassoLoadCircle(this,head_img);
}
if(!StringUtil.isNull(currentUser.getString("nickName"))){
name.setText(currentUser.getString("nickName"));
}else{
name.setText(currentUser.getUsername());
}
if(!StringUtil.isNull(currentUser.getString("server"))){
String temp[]=currentUser.getString("server").split("-");
tag1.setText(UserEvent.AREA[Integer.parseInt(temp[0])]);
tag2.setText(UserEvent.HOST[Integer.parseInt(temp[0])][Integer.parseInt(temp[1])]);
}else{
tag1.setText("未填写");
tag2.setText("未填写");
}
}
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:startActivity(new Intent(PersonActivity.this, EditUserInfoActivity.class));break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.edit_menu, menu);
return true;
}
}
```
NPCAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.app.Activity;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.adapter.util.AdapterUtil;
import com.key.doltool.data.sqlite.NPCInfo;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class NPCAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public TextView area,love_type,other;
public RelativeLayout love_bar;
public LinearLayout line1,line2,line3;
public View line;
public ImageView skill_img1,skill_img2,skill_img3;
public TextView skill_txt1,skill_txt2,skill_txt3;
}
public static int SIZE=30;
private DefaultDAO dao;
private AdapterUtil util;
private List<NPCInfo> list=new ArrayList<>();
private Activity context;
public NPCAdapter(List<NPCInfo> list,Activity context){
this.list=list;
this.context=context;
dao=SRPUtil.getDAO(context);
util=new AdapterUtil(context, dao);
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.npc_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.area=(TextView)convertView.findViewById(R.id.area);
holder.line=convertView.findViewById(R.id.line);
holder.love_type=(TextView)convertView.findViewById(R.id.love_type);
holder.other=(TextView)convertView.findViewById(R.id.other);
holder.love_bar=(RelativeLayout)convertView.findViewById(R.id.love_bar);
holder.line1=(LinearLayout)convertView.findViewById(R.id.line1);
holder.line2=(LinearLayout)convertView.findViewById(R.id.line2);
holder.line3=(LinearLayout)convertView.findViewById(R.id.line3);
holder.skill_img1=(ImageView)convertView.findViewById(R.id.skill_img1);
holder.skill_img2=(ImageView)convertView.findViewById(R.id.skill_img2);
holder.skill_img3=(ImageView)convertView.findViewById(R.id.skill_img3);
holder.skill_txt1=(TextView)convertView.findViewById(R.id.skill_txt1);
holder.skill_txt2=(TextView)convertView.findViewById(R.id.skill_txt2);
holder.skill_txt3=(TextView)convertView.findViewById(R.id.skill_txt3);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
holder.area.setText(list.get(position).getCity());
String love_type=list.get(position).getLove_type();
String other=list.get(position).getOther();
if(StringUtil.isNull(love_type)){
holder.line.setVisibility(View.GONE);
holder.love_bar.setVisibility(View.GONE);
}else{
holder.line.setVisibility(View.VISIBLE);
holder.love_type.setText(love_type);
holder.love_type.setTextColor(ResourcesUtil.getColor(R.color.Blue_SP, context));
holder.love_bar.setVisibility(View.VISIBLE);
}
if(StringUtil.isNull(other)){
holder.other.setVisibility(View.GONE);
}else{
holder.other.setVisibility(View.VISIBLE);
holder.other.setText("备注:"+other);
}
String skill=list.get(position).getSkill_tech();
String[] temp=skill.split(",");
if(temp.length>2){
holder.line3.setVisibility(View.VISIBLE);
util.findByName(holder.skill_img3,temp[2],1);
holder.skill_txt3.setText(temp[2]);
}else{
holder.line3.setVisibility(View.GONE);
}
if(temp.length>1){
holder.line2.setVisibility(View.VISIBLE);
util.findByName(holder.skill_img2,temp[1],1);
holder.skill_txt2.setText(temp[1]);
}else{
holder.line2.setVisibility(View.GONE);
}
if(temp.length>0&&!StringUtil.isNull(temp[0])){
holder.line1.setVisibility(View.VISIBLE);
util.findByName(holder.skill_img1,temp[0],1);
holder.skill_txt1.setText(temp[0]);
}else{
holder.line1.setVisibility(View.GONE);
holder.line.setVisibility(View.GONE);
}
return convertView;
}
}
```
RecipeForBookDetailsActivity.java
```package com.key.doltool.activity.recipe;
import android.os.Bundle;
import android.widget.ListView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.RecipeAdapter;
import com.key.doltool.data.sqlite.Book;
import com.key.doltool.data.sqlite.Recipe;
import com.key.doltool.event.BookEvent;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class RecipeForBookDetailsActivity extends BaseActivity{
@BindView(R.id.listview) ListView list;
@BindView(R.id.name) TextView name;
@BindView(R.id.details) TextView desc_type;
@BindView(R.id.rank) TextView rank;
@BindView(R.id.get_way) TextView get_way;
private Book book;
private List<Recipe> mylist=new ArrayList<>();
private DefaultDAO dao;
private String id="";
@Override
public int getContentViewId() {
return R.layout.recipe_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
id=getIntent().getStringExtra("id");
init();
}
private void init(){
book=(Book)dao.select(Book.class,false,"id=?",new String[]{id},null,null,null,null).get(0);
mylist=SRPUtil.getInstance(this).select(Recipe.class,false,"parent_name=?",new String[]{""+book.getName()},null,null,null,null);
list.setAdapter(new RecipeAdapter(mylist,this));
name.setText(book.getName());
desc_type.setText(book.getDesc_type());
rank.setText(new BookEvent().TYPE_BASE[book.getType()]+":"+book.getRange());
get_way.setText(book.getGet_way());
}
}
```
ShipAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.RegularShip;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ResourcesUtil;
import java.util.ArrayList;
import java.util.List;
public class ShipAdapter extends BaseAdapter{
private static class ViewHolder{
public RelativeLayout main;
public TextView target,name,money,time;
}
public static int SIZE=60;
private List<RegularShip> list=new ArrayList<>();
private Context context;
public ShipAdapter(List<RegularShip> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public RegularShip getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_shipway, null);
holder.main=(RelativeLayout)convertView.findViewById(R.id.main);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.money=(TextView)convertView.findViewById(R.id.money);
holder.time=(TextView)convertView.findViewById(R.id.time);
holder.target=(TextView)convertView.findViewById(R.id.target);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).name);
holder.money.setText(list.get(position).money);
holder.time.setText(list.get(position).time);
String target=list.get(position).start_city+"-"+list.get(position).end_city;
holder.target.setText(target);
return convertView;
}
}
```
MyPagerAdapter.java
```package com.key.doltool.viewpage;
import android.os.Parcelable;
import android.view.View;
import android.view.ViewGroup;
import androidx.viewpager.widget.PagerAdapter;
import java.util.List;
/**
* ViewPager-Adapter数据准备
* @author key
* @version 0.1
*/
public class MyPagerAdapter extends PagerAdapter {
private List<View> mListViews;
private String[] title;
public MyPagerAdapter(List<View> list,String[] title){
this.title=title;
mListViews=list;
}
//除去页面中的View
public void destroyItem(ViewGroup view, int position, Object arg2) {
view.removeView(mListViews.get(position));
}
public void finishUpdate(ViewGroup arg0) {
}
//获得总页面数
public int getCount() {
return mListViews.size();
}
//添加View
public Object instantiateItem(ViewGroup view, int position) {
view.addView(mListViews.get(position), 0);
return mListViews.get(position);
}
public boolean isViewFromObject(View view, Object object) {
return view == (object);
}
public void restoreState(Parcelable arg0, ClassLoader arg1) {
}
public Parcelable saveState() {
return null;
}
public void startUpdate(ViewGroup arg0) {
}
@Override
public CharSequence getPageTitle(int position) {
return title[position];
}
}```
NPCInfo.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="NPCInfo")
public class NPCInfo {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//技能教授
@Column(name="skill_tech")
private String skill_tech;
//汇报类型
@Column(name="love_type")
private String love_type;
//所在城市
@Column(name="city")
private String city;
//备注
@Column(name="other")
private String other;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getSkill_tech() {
return skill_tech;
}
public void setSkill_tech(String skill_tech) {
this.skill_tech = skill_tech;
}
public String getLove_type() {
return love_type;
}
public void setLove_type(String love_type) {
this.love_type = love_type;
}
public String getCity() {
return city;
}
public void setCity(String city) {
this.city = city;
}
public String getOther() {
return other;
}
public void setOther(String other) {
this.other = other;
}
}
```
EquipItem.java
```package com.key.doltool.data;
public class EquipItem {
}
```
TradeDetailActivity.java
```package com.key.doltool.activity.trade;
import android.os.Bundle;
import android.view.View;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.TagAdapter;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.event.TradeEvent;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.FlowLayout;
import com.the9tcat.hadi.DefaultDAO;
import java.io.IOException;
import butterknife.BindView;
public class TradeDetailActivity extends BaseActivity{
@BindView(R.id.name) TextView name;
@BindView(R.id.sp) TextView sp;
@BindView(R.id.pic) ImageView pic;
@BindView(R.id.type_txt) TextView type_txt;
@BindView(R.id.number_txt) TextView number_txt;
@BindView(R.id.city_txt) TextView city_txt;
@BindView(R.id.tag_type) ImageView pic_type;
@BindView(R.id.tag_number) ImageView number_type;
@BindView(R.id.main_txt) TextView details;
@BindView(R.id.city_array) FlowLayout city_area;
@BindView(R.id.recipse_array) FlowLayout recipe_area;
@BindView(R.id.recipe_way) LinearLayout recipe_way;
private DefaultDAO dao;
private String id="";
private String name_txt="";
private String tw_name="";
@Override
public int getContentViewId() {
return R.layout.trade_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(getApplicationContext());
id=getIntent().getStringExtra("id");
name_txt=getIntent().getStringExtra("name");
tw_name=getIntent().getStringExtra("tw_name");
init();
}
private void init(){
TradeItem item;
if(StringUtil.isNull(name_txt)){
item=(TradeItem)dao.select(TradeItem.class, false, "id=?", new String[]{""+id}, null, null, null, null).get(0);
}else{
item=(TradeItem)dao.select(TradeItem.class, false, "name=? or name=?", new String[]{""+name_txt,tw_name}, null, null, null, null).get(0);
}
if(item.getProducing_area().equals("")){
city_txt.setVisibility(View.GONE);
city_area.setVisibility(View.GONE);
}else{
String[] city=item.getProducing_area().split(",");
city_area.setAdapter(new TagAdapter(this,city));
}
if(item.getRecipe_way().equals("")){
recipe_way.setVisibility(View.GONE);
}else{
String[] city=item.getRecipe_way().split(",");
recipe_area.setAdapter(new TagAdapter(this,city,item.getName()));
}
details.setText(item.getDetail());
name.setText(item.getName());
flag=false;
initToolBar(null);
toolbar.setTitle(item.getName());
try {
pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(getAssets().open(FileManager.TRADE+item.getPic_id()+".png")));
} catch (IOException e) {
e.printStackTrace();
}
if(item.getSp().equals("")||item.getSp().equals("钓鱼")){
sp.setVisibility(View.GONE);
}else{
sp.setText(item.getSp());
}
TradeEvent event=new TradeEvent(this);
event.setNumber(item.getTrade(), number_type, number_txt);
event.setType(item.getType(), pic_type, type_txt);
}
}
```
JsonUtil.java
```package com.key.doltool.util;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import android.content.Context;
import com.key.doltool.view.Toast;
/**
* 用于解析Json数据的工具类
*
* @author key
* @version 2013-5-31
*/
public class JsonUtil {
//读取文本文件
public static String readFile(String fileName, Context context) {
ByteArrayOutputStream outputStream = new ByteArrayOutputStream(1024);
FileInputStream inputStream = null;
try {
inputStream = new FileInputStream(fileName);
int len;
byte[] buffer = new byte[1024];
while ((len = inputStream.read(buffer)) != -1) {
outputStream.write(buffer, 0, len);
}
} catch (IOException e) {
Toast.makeText(context, "找不到文件", Toast.LENGTH_SHORT).show();
e.printStackTrace();
} finally {
try {
if (inputStream != null) {
outputStream.close();
inputStream.close();
}
} catch (IOException e) {
Toast.makeText(context, "未知错误", Toast.LENGTH_SHORT).show();
e.printStackTrace();
}
}
byte[] data = outputStream.toByteArray();
return new String(data);
}
public static void writeFile(String str, String fileName, Context context) {
ByteArrayInputStream inputStream = new ByteArrayInputStream(str.getBytes());
FileOutputStream outputStream = null;
try {
outputStream = new FileOutputStream(fileName);
int len;
byte[] buffer = new byte[1024];
while ((len = inputStream.read(buffer)) != -1) {
outputStream.write(buffer, 0, len);
}
} catch (IOException e) {
Toast.makeText(context, "找不到文件", Toast.LENGTH_SHORT).show();
e.printStackTrace();
} finally {
try {
if (outputStream != null) {
outputStream.close();
}
inputStream.close();
} catch (IOException e) {
Toast.makeText(context, "未知错误", Toast.LENGTH_SHORT).show();
e.printStackTrace();
}
}
}
}```
SqureMainFragment.java
```package com.key.doltool.activity.squre;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.LinearLayout;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.squre.business.BusinessDetailActivity;
import com.key.doltool.view.Toast;
import butterknife.BindView;
/**
* 广场的人们
* **/
public class SqureMainFragment extends BaseFragment{
@BindView(R.id.map) LinearLayout map;
@BindView(R.id.fortune) LinearLayout fortune;
@BindView(R.id.port) LinearLayout port;
@Override
public int getContentViewId() {
return R.layout.squre_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
setListener();
}
private void setListener(){
map.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(1);
}
});
fortune.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
jump(2);
}
});
port.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
jump(3);
}
});
}
private void jump(int index){
Class<?> c ;
switch(index){
case 1:c=MapActivity.class;break;
case 2:c=FortuneActivity.class;break;
case 3:c=BusinessDetailActivity.class;break;
default:Toast.makeText(getActivity().getApplicationContext(),"还在建设中",Toast.LENGTH_SHORT).show();return;
}
Intent intent=new Intent(getActivity(),c);
startActivity(intent);
}
}
```
JsoupForGVO.java
```package com.key.doltool.util.jsoup;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.select.Elements;
import android.util.Log;
import com.key.doltool.data.sqlite.CardCombo;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.util.StringUtil;
import com.the9tcat.hadi.DefaultDAO;
public class JsoupForGVO {
/**GVO源**/
public static String GVO_BASE_URL="http://gvo.cbo.com.tw/adv_missionDetail.aspx?MID=";
public static String GVO_CARD="http://gvo.cbo.com.tw/CardCombo.aspx";
public static String GVO_TW="http://gvo.cbo.com.tw/Adv_Discover.aspx?Type=";
public static int index=1;
/**获得一级url**/
public void getMission(int id,DefaultDAO dao){
Document doc = null;
try {
doc = Jsoup.connect(GVO_BASE_URL+id).timeout(30*1000).get();
Elements name=doc.select("span#ctl00_CP1_FormView1_NameLabel");
Elements type=doc.select("span#ctl00_CP1_FormView1_LKindName");
Elements level=doc.select("span#ctl00_CP1_FormView1_StarLabel");
Elements start_city=doc.select("span#ctl00_CP1_FormView1_DataList1");
Elements prop=doc.select("span#ctl00_CP1_FormView1_PropLabel");
Elements remum=doc.select("span#ctl00_CP1_FormView1_RemuMLabel");
Elements exp=doc.select("span#ctl00_CP1_FormView1_iExpLabel");
Elements feat=doc.select("span#ctl00_CP1_FormView1_PopuLabel");
Elements find=doc.select("span#ctl00_CP1_FormView1_FormView發現物_NameLabel");
Elements flow=doc.select("span#ctl00_CP1_FormView1_FlowLabel");
Elements get_item=doc.select("span#ctl00_CP1_FormView1_RemuILabel");
Elements time=doc.select("span#ctl00_CP1_FormView1_Label3");
Elements mission_list=doc.select("div#ctl00_CP1_FormView1_PanelMission");
Elements before_list = null;
Elements after_list = null;
if(mission_list.size()>0){
before_list=mission_list.get(0).select("table#ctl00_CP1_FormView1_GridView2");
after_list=mission_list.get(0).select("table#ctl00_CP1_FormView1_GridView1");
}
Elements img1=doc.select("img#ctl00_CP1_FormView1_Image1");
Elements img2=doc.select("img#ctl00_CP1_FormView1_Image2");
Elements img3=doc.select("img#ctl00_CP1_FormView1_Image3");
Elements img4=doc.select("img#ctl00_CP1_FormView1_Image4");
Elements span2=doc.select("span#ctl00_CP1_FormView1_Label2");
Elements span5=doc.select("span#ctl00_CP1_FormView1_Label5");
Elements span6=doc.select("span#ctl00_CP1_FormView1_Label6");
Elements span7=doc.select("span#ctl00_CP1_FormView1_Label7");
String before_mission="";
String after_mission="";
if(before_list!=null&&before_list.size()>0){
for(int i=0;i<before_list.get(0).select("a").size();i++){
String temp=before_list.get(0).select("a").get(i).text();
if(i!=before_list.get(0).select("a").size()-1&&before_list.get(0).select("a").size()-1!=0){
before_mission+=temp+",";
}else if(before_list.get(0).select("a").size()-1!=0){
before_mission+=temp;
}else{
before_mission+=temp;
}
}
}
if(after_list!=null&&after_list.size()>0){
for(int i=0;i<after_list.get(0).select("a").size();i++){
String temp=after_list.get(0).select("a").get(i).text();
if(i!=after_list.get(0).select("a").size()-1&&after_list.get(0).select("a").size()!=1){
after_mission+=temp+",";
}else if(after_list.get(0).select("a").size()==1){
after_mission+=temp;
}
else{
after_mission+=temp;
}
}
}
String find_name="";
if(find.size()>0){
find_name=find.get(0).text();
}
String detail="";
if(flow.size()>0){
detail=flow.get(0).text();
}
String item="";
if(get_item.size()>0){
item=get_item.get(0).text();
}
String skill="";
int step=0;
if(img1.size()>0){
skill=img1.attr("alt");
step=1;
}
if(span2.size()>0&&step==1){
if(!span2.get(0).text().equals("")){
skill=skill+":"+span2.get(0).text();
}
step=2;
}
if(img2.size()>0&&step==2){
skill+=","+img2.attr("alt");
step=3;
}
if(span5.size()>0&&step==3){
if(!span5.get(0).text().equals("")){
skill=skill+":"+span5.get(0).text();
}
step=4;
}
if(img3.size()>0&&step==4){
skill+=","+img3.attr("alt");
step=5;
}
if(span6.size()>0&&step==5){
if(!span6.get(0).text().equals("")){
skill=skill+":"+span6.get(0).text();
}
step=6;
}
if(img4.size()>0&&step==6){
skill+=","+img4.attr("alt");
step=7;
}
if(span7.size()>0&&step==7){
if(!span7.get(0).text().equals("")){
skill=skill+":"+span7.get(0).text();
}
step=7;
}
if(name.size()==0){
return;
}
String name_txt=name.get(0).text();
String type_txt=type.get(0).text();
String level_txt=level.get(0).text();
String start_city_txt="";
if(start_city.size()!=0){
start_city_txt=start_city.get(0).text();
}
String money=prop.get(0).text()+"/"+remum.get(0).text();
String exptotal=exp.get(0).text().replace(" 點","")+"/"+feat.get(0).text().replace(" 點","");
String time_up=time.get(0).text();
String name_t=StringUtil.TransToSimple(name_txt);
String type_t=StringUtil.TransToSimple(type_txt);
String skill_t=StringUtil.TransToSimple(skill);
String time_up_t=StringUtil.TransToSimple(time_up);
String find_name_t=StringUtil.TransToSimple(find_name);
String item_t=StringUtil.TransToSimple(item);
String detail_t=StringUtil.TransToSimple(detail);
String start_city_txt_t=StringUtil.TransToSimple(start_city_txt);
String before_mission_t=StringUtil.TransToSimple(before_mission);
String after_mission_t=StringUtil.TransToSimple(after_mission);
Log.i("name","任务名称:"+name_t);
Log.i("name","类型:"+type_t);
Log.i("name","难度:"+level_txt);
Log.i("name","定金/报酬:"+money);
Log.i("name","经验/声望:"+exptotal);
Log.i("name","需要技能:"+skill_t);
Log.i("name","时间限制:"+time_up_t);
Log.i("name","发现物:"+find_name_t);
Log.i("name","获得物品:"+item_t);
Log.i("name","任务流程:"+detail_t);
Log.i("name","接受任务地点:"+start_city_txt_t);
Log.i("name","前置任务:"+before_mission_t);
Log.i("name","后续任务:"+after_mission_t);
Log.i("name","其他:"+(GVO_BASE_URL+id));
Mission misson=new Mission();
misson.setAfter(after_mission_t);
misson.setBefore(before_mission_t);
misson.setDaily(detail_t);
misson.setExp(exptotal);
misson.setGet_item(item_t);
misson.setFind_item(find_name_t);
misson.setLevel(level_txt);
misson.setMoney(money);
misson.setName(name_t);
misson.setSkill_need(skill_t);
misson.setStart_city(start_city_txt_t);
misson.setTime_up(time_up_t);
misson.setType(type_t);
misson.setOther(GVO_BASE_URL+id);
onlyOneInsertMission(misson,dao);
} catch (IOException e) {
e.printStackTrace();
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertMission(Mission mission,DefaultDAO dao){
if(mission!=null){
String[] x={mission.getOther()+""};
List<Mission>list=(List<Mission>) dao.select(Mission.class,
false, "other=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(mission);
else
dao.update_by_primary(mission);
}
}
public void getCardCombo(DefaultDAO dao){
Document doc = null;
try {
doc = Jsoup.connect(GVO_CARD).timeout(30*1000).get();
Elements name=null;
for(int id=0;id<=126;id++){
CardCombo card=new CardCombo();
String number="";
if(id<8){
number="0"+(id+2);
}else{
number=(id+2)+"";
}
String span="span#ctl00_CP1_GridView1_ctl"+number+"_Label1";
name=doc.select(span);
Elements effect=doc.select("td[width=90]");
Elements card_1_type=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo1_DataList1_ctl00_Label6");
Elements card_1_name=doc.select("a#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo1_DataList1_ctl00_HName");
Elements card_1_point=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo1_DataList1_ctl00_LPoint");
Elements card_2_type=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo2_DataList1_ctl00_Label6");
Elements card_2_name=doc.select("a#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo2_DataList1_ctl00_HName");
Elements card_2_point=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo2_DataList1_ctl00_LPoint");
Elements card_3_type=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo3_DataList1_ctl00_Label6");
Elements card_3_name=doc.select("a#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo3_DataList1_ctl00_HName");
Elements card_3_point=doc.select("span#ctl00_CP1_GridView1_ctl"+number+"_WebUserCardCombo3_DataList1_ctl00_LPoint");
//"color:#C00000";
card.setName(StringUtil.TransToSimple(name.get(0).text()));
Log.i("name", "名称:"+name.get(0).text());
if(effect.size()>0){
card.setEffect(StringUtil.TransToSimple(effect.get(id).text()));
Log.i("name", "效果:"+effect.get(id).text());
}
if(card_1_type.size()>0){
String card1=card_1_type.get(0).text()+"-"+card_1_name.get(0).text()+"("+card_1_point.get(0).text()+")";
card.setCard_1(StringUtil.TransToSimple(card1));
Log.i("name", "卡片一:"+card_1_type.get(0).text()+"-"+card_1_name.get(0).text()+"("+card_1_point.get(0).text()+")");
}
if(card_2_type.size()>0){
String card1=card_2_type.get(0).text()+"-"+card_2_name.get(0).text()+"("+card_2_point.get(0).text()+")";
card.setCard_2(StringUtil.TransToSimple(card1));
Log.i("name", "卡片二:"+card_2_type.get(0).text()+"-"+card_2_name.get(0).text()+"("+card_2_point.get(0).text()+")");
}
if(card_3_type.size()>0){
String card1=card_3_type.get(0).text()+"-"+card_3_name.get(0).text()+"("+card_3_point.get(0).text()+")";
card.setCard_3(StringUtil.TransToSimple(card1));
Log.i("name", "卡片三"+card_3_type.get(0).text()+"-"+card_3_name.get(0).text()+"("+card_3_point.get(0).text()+")");
}
onlyOneInsertCardCombo(card,dao);
}
} catch (IOException e) {
e.printStackTrace();
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertCardCombo(CardCombo card,DefaultDAO dao){
if(card!=null){
String[] x={card.getName()+""};
List<CardCombo>list=(List<CardCombo>) dao.select(CardCombo.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(card);
else{
// Log.i("s", ""+dao);
// Log.i("x", ""+card);
// dao.update(card,new String[]{"effect","card_1","card_2","card_3"},"name=?", x);
}
}
}
public void do_TIANWEN(DefaultDAO dao,int type){
Document doc;
List<String> a_list=new ArrayList<>();
try {
doc = Jsoup.connect(GVO_TW+type).timeout(30*1000).get();
Elements table=doc.select("table#ctl00_CP1_GridView發現物");
Elements a=table.select("tr");
Log.i("a",a.size()+"");
for(int i=1;i<a.size();i++){
Log.i("i",i+"");
a_list.add(a.get(i).select("a").get(0).attr("href"));
}
for(int j=0;j<a_list.size();j++){
doc = Jsoup.connect("http://gvo.cbo.com.tw/"+a_list.get(j)).timeout(30*1000).get();
Elements mission=doc.select("span#ctl00_CP1_FormView1_NameLabel");
Elements name=doc.select("span#ctl00_CP1_FormView1_FormView發現物_NameLabel");
Elements feat=doc.select("span#ctl00_CP1_FormView1_FormView發現物_ExpLabel");
Elements card_point=doc.select("span#ctl00_CP1_FormView1_FormView發現物_Label4");
Elements details=doc.select("span#ctl00_CP1_FormView1_FormView發現物_Label18");
Elements rank=doc.select("span#ctl00_CP1_FormView1_FormView發現物_StarRankLabel");
Trove trove=new Trove();
trove.setCard_point(Integer.parseInt(card_point.get(0).text()));
trove.setDetails(StringUtil.TransToSimple(details.get(0).text()));
trove.setFeats(Integer.parseInt(feat.get(0).text()));
trove.setFind_flag(0);
trove.setGetWay(1);
trove.setMisson(StringUtil.TransToSimple(mission.get(0).text()));
trove.setName(StringUtil.TransToSimple(name.get(0).text()));
trove.setPic_id("dol_t_ast"+(j+1));
int len = rank.get(0).text().length();
int count = 0;
for (int i=0;i<len;i++){
if (rank.get(0).text().charAt(i) == '★')
count++;
}
trove.setRate(count);
trove.setType("天文");
trove.setNeed("视认:10,天文学:6");
//任务判断
Log.i("name",trove.getName());
onlyOneInsertTrove(trove,dao);
}
}catch(Exception e){
}
}
@SuppressWarnings("unchecked")
private void onlyOneInsertTrove(Trove trove,DefaultDAO dao){
String[] x={trove.getName()+""};
List<Trove>list=(List<Trove>) dao.select(Trove.class,
false, "name=?", x,
null, null, null, null);
if(list.size()==0)
dao.insert(trove);
}
}
```
MissionItemAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.util.ResourcesUtil;
public class MissionItemAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name,type;
public TextView rank,skill_need;
public View line;
}
public static int SIZE=30;
private List<Mission> list=new ArrayList<>();
private Context context;
public MissionItemAdapter(List<Mission> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.mission_list_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.type=(TextView)convertView.findViewById(R.id.type);
holder.line=convertView.findViewById(R.id.line);
holder.rank=(TextView)convertView.findViewById(R.id.rank);
holder.skill_need=(TextView)convertView.findViewById(R.id.skill_need);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
if(list.get(position).getTag()==1){
holder.name.setTextColor(ResourcesUtil.getColor(R.color.Blue_SP, context));
holder.rank.setTextColor(ResourcesUtil.getColor(R.color.Blue_SP, context));
holder.skill_need.setTextColor(ResourcesUtil.getColor(R.color.Blue_SP, context));
}else{
holder.name.setTextColor(ResourcesUtil.getColor(R.color.Black_SP, context));
holder.rank.setTextColor(ResourcesUtil.getColor(R.color.Black_SP, context));
holder.skill_need.setTextColor(ResourcesUtil.getColor(R.color.Black_SP, context));
}
holder.type.setText(list.get(position).getType());
if(list.get(position).getType().equals("港口部落")){
holder.rank.setVisibility(View.GONE);
holder.skill_need.setVisibility(View.GONE);
holder.line.setVisibility(View.GONE);
}else{
holder.rank.setVisibility(View.VISIBLE);
holder.skill_need.setVisibility(View.VISIBLE);
holder.line.setVisibility(View.VISIBLE);
}
String rank=getRankByMission(list.get(position));
String skill_need=list.get(position).getSkill_need();
if(!rank.equals("")){
holder.rank.setText("Rank:"+rank);
holder.skill_need.setVisibility(View.VISIBLE);
}else{
holder.rank.setVisibility(View.GONE);
}
if(!skill_need.equals("")){
holder.skill_need.setText(skill_need);
holder.skill_need.setVisibility(View.VISIBLE);
}else{
holder.skill_need.setVisibility(View.GONE);
}
return convertView;
}
private String getRankByMission(Mission item){
int i = 0;
String str="";
switch (item.getType()) {
case "书库地图":
if (!item.getSkill_need().equals("")) {
String[] item1 = item.getSkill_need().split(",");
str = item1[0].split(":")[1];
}
break;
case "港口部落":
return str;
default:
String star = "★";
Matcher m = Pattern.compile(Pattern.quote(star)).matcher(item.getLevel());
while (m.find()) {
i++;
}
if (i != 0) {
str = i + "";
}
break;
}
return str;
}
}
```
CardComboFragment.java
```package com.key.doltool.activity.adventure.card;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.View;
import android.widget.ListView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.core.BaseFragmentActivity;
import com.key.doltool.adapter.CardComboAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.CardCombo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
public class CardComboFragment extends BaseFragment{
//定义部分
private Dialog layout_alert;
//船只列表页面
@BindView(R.id.listview) ListView listview;
private CardComboAdapter adapter;
private ListFlowHelper<CardCombo> listFlowHelper;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.common_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
findView();
if(listFlowHelper.list.size()==0){
new Thread(mTasks).start();
}else{
DialogUtil.dismiss(context,layout_alert);
}
}
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setHasOptionsMenu(true);
}
private Runnable mTasks =new Runnable(){
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 0;
viewHandler.sendMessage(message);
}
};
private void init(){
BaseFragmentActivity a=(BaseFragmentActivity)context;
a.toolbar.setOnMenuItemClickListener(onMenuItemClick);
listFlowHelper=new ListFlowHelper<>(CardCombo.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(), msg, Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter = new CardComboAdapter(listFlowHelper.list, context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, CardComboAdapter.SIZE);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what){
case 0:
listFlowHelper.change(true);
break;
case 1:
listFlowHelper.change();
break;
}
DialogUtil.dismiss(getActivity(),layout_alert);
}
});
}
//通用findView
private void findView() {
layout_alert=new DialogEvent().showLoading(context);
DialogUtil.show(getActivity(),layout_alert);
initPageItem();
}
private void initPageItem(){
adapter=new CardComboAdapter(listFlowHelper.list,context);
ListScrollListener scrollListener = new ListScrollListener(layout_alert, viewHandler, context);
listFlowHelper.setListScrollListener(scrollListener);
listview.setOnScrollListener(scrollListener);
listview.setAdapter(adapter);
}
private void jump(){
Intent intent=new Intent(getActivity(),CardListActivity.class);
startActivity(intent);
}
private void findObject(){
View xc=getActivity().getLayoutInflater().inflate(R.layout.select_cardcombo, null);
ViewUtil.popCardDialog(listFlowHelper,context, xc);
}
//系统按键监听覆写
@Override
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
return false;
}
//其他
else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:findObject();break;
case R.id.type_search:jump();break;
}
return true;
}
};
@Override
public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {
inflater.inflate(R.menu.common_menu, menu);
super.onCreateOptionsMenu(menu, inflater);
}
}```
AbilityForNormalDetailActivity.java
```package com.key.doltool.activity.ability;
import android.os.Bundle;
import android.util.Log;
import android.view.View;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ADCSkillSelectAdapter;
import com.key.doltool.adapter.TagSkillAdapter;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.data.sqlite.Job;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.util.imageUtil.ImageLoader;
import com.key.doltool.view.FlowLayout;
import com.key.doltool.view.LinearLayoutForListView;
import java.io.IOException;
import java.util.List;
import butterknife.BindView;
/**
* 一般技能详情显示界面
* 查询关联数据：职业，副官加成
* **/
public class AbilityForNormalDetailActivity extends BaseActivity{
@BindView(R.id.name) TextView name;
@BindView(R.id.type) TextView type;
@BindView(R.id.details) TextView details;
@BindView(R.id.level) TextView level;
@BindView(R.id.money) TextView money;
@BindView(R.id.skill_need) TextView skill_need;
@BindView(R.id.pic) ImageView pic;
@BindView(R.id.job_array) FlowLayout job_array;
@BindView(R.id.adc_array) LinearLayoutForListView adc_array;
@BindView(R.id.need_layout) RelativeLayout need_layout;
@BindView(R.id.tag5) TextView tag5;
@BindView(R.id.tag6) TextView tag6;
private SRPUtil dao;
private String id="0";
private String name_str="0";
@Override
public int getContentViewId() {
return R.layout.skill_details;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getInstance(getApplicationContext());
id=getIntent().getStringExtra("id");
name_str=getIntent().getStringExtra("name");
init();
}
/**数据库读取**/
private void init(){
Skill item;
if(!StringUtil.isNull(id)){
item =dao.select(Skill.class,false,"id=?",new String[]{""+id},null,null,null,null).get(0);
}else{
item =dao.select(Skill.class,false,"name=?",new String[]{""+name_str},null,null,null,null).get(0);
}
name.setText(item.getName());
details.setText(item.getDetail());
int types= item.getType();
//根据类型获得技能类型文字
type.setText(ResourcesUtil.getArray(this,R.array.skill_type)[types+1]);
ImageLoader.setBitmapByAssets(pic,FileManager.SKILL+ item.getPic_id()+".png",this);
//处理need数据
if(types<5){
String[] temp= item.getNeed().split("\\|");
Log.i("x",temp.length+"");
Log.i("x",temp[0]);
Log.i("x",temp[1]);
level.setText(temp[0].split(":")[1]);
money.setText(temp[1].split(":")[1]);
if(temp.length>2){
skill_need.setText(temp[2].split(":")[1]);
}else{
skill_need.setText(R.string.skill_detail_normal_no_hint);
}
//查询职业
List<Job> list_sp=dao.select(Job.class,false,"good_list like ? or sp=?",new String[]{"%"+"\""+ item.getName()+"\""+"%", item.getName()},null,null,null,null);
job_array.setAdapter(new TagSkillAdapter(this,list_sp, item.getName()));
if(list_sp.size()==0){
tag5.setVisibility(View.GONE);
job_array.setVisibility(View.GONE);
}
}else{
need_layout.setVisibility(View.GONE);
tag5.setVisibility(View.GONE);
job_array.setVisibility(View.GONE);
}
List<ADCInfo> list_adc=dao.select(ADCInfo.class,false,"skill_list like ?",new String[]{"%"+"\""+ item.getName()+"\""+"%"},null,null,null,null);
adc_array.setAdapter(new ADCSkillSelectAdapter(item.getName(), list_adc, this));
if(list_adc.size()==0){
tag6.setVisibility(View.GONE);
adc_array.setVisibility(View.GONE);
}
}
}
```
BuildBoatActivity.java
```package com.key.doltool.activity.dockyard;
import android.os.Bundle;
import android.view.View;
import android.widget.LinearLayout;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.anime.MyAnimations;
import com.key.doltool.view.flat.FlatButton;
/**
* New 造船厂界面
* **/
public class BuildBoatActivity extends BaseActivity{
private TextView info_txt;
private LinearLayout show_layout,choose_part;
private RelativeLayout ability;
private TextView vo_s,vo_f,vo_tu,vo_de,vo_p;
private TextView bt_h,bt_p,bt_a,bt_c,bt_s;
private TextView vo_s_a,vo_f_a,vo_tu_a,vo_de_a,vo_p_a;
private TextView bt_h_a,bt_a_a,bt_c_a,bt_s_a;
private FlatButton plus_btn;
private FlatButton btn;
private TextView sp_s,sp_c,sp_eq,sp_eq2;
@Override
public int getContentViewId() {
return 0;
}
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
findView();
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
}
private void findView(){
info_txt=(TextView)findViewById(R.id.info_txt);
show_layout=(LinearLayout)findViewById(R.id.show_broad);
choose_part=(LinearLayout)findViewById(R.id.choose_part);
ability=(RelativeLayout)findViewById(R.id.ability);
findViewInfo();
}
//造船界面FindView
private void findViewInfo(){
vo_s=(TextView)findViewById(R.id.square_sail_point);
vo_f=(TextView)findViewById(R.id.fore_sail_point);
vo_tu=(TextView)findViewById(R.id.turn_point);
vo_de=(TextView)findViewById(R.id.def_wave_point);
vo_p=(TextView)findViewById(R.id.paddle_point);
bt_h=(TextView)findViewById(R.id.health_boat_point);
bt_p=(TextView)findViewById(R.id.people_number_point);
bt_a=(TextView)findViewById(R.id.armor_point);
bt_c=(TextView)findViewById(R.id.crenelle_point);
bt_s=(TextView)findViewById(R.id.shipping_space_point);
vo_s_a=(TextView)findViewById(R.id.square_sail_add);
vo_f_a=(TextView)findViewById(R.id.fore_sail_add);
vo_tu_a=(TextView)findViewById(R.id.turn_add);
vo_de_a=(TextView)findViewById(R.id.def_wave_add);
vo_p_a=(TextView)findViewById(R.id.paddle_add);
bt_h_a=(TextView)findViewById(R.id.health_boat_add);
bt_a_a=(TextView)findViewById(R.id.armor_add);
bt_c_a=(TextView)findViewById(R.id.crenelle_add);
bt_s_a=(TextView)findViewById(R.id.shipping_space_add);
plus_btn=(FlatButton)findViewById(R.id.build_btn);
btn=(FlatButton)findViewById(R.id.btn);
//旋转切换页面
btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(ability.getVisibility()==View.VISIBLE)
MyAnimations.rotate3D(show_layout, ability, choose_part, 1000);
else
MyAnimations.rotate3D(show_layout, choose_part, ability,1000);
}
});
sp_s=(TextView)findViewById(R.id.sp_s);
sp_c=(TextView)findViewById(R.id.sp_c);
sp_eq=(TextView)findViewById(R.id.sp_eq);
sp_eq2=(TextView)findViewById(R.id.sp_eq2);
}
}
```
FishingTroveFragment.java
```package com.key.doltool.activity.voyage.fishing;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.os.Parcelable;
import android.view.View;
import android.widget.AdapterView;
import android.widget.GridView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.adapter.TroveAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.List;
import butterknife.BindView;
/**
* 钓鱼发现物界面
* **/
public class FishingTroveFragment extends BaseFragment {
private List<Trove> list;
//定义部分
private Dialog alert;
//船只列表页面
@BindView(R.id.listview) GridView gridview;
private TroveAdapter adapter;
private DefaultDAO dao;
private UpdataCount count;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.trade_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getDAO(context);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
DialogUtil.dismiss(context,alert);
Parcelable state=gridview.onSaveInstanceState();
adapter=new TroveAdapter(list,context);
gridview.setAdapter(adapter);
gridview.onRestoreInstanceState(state);
}
});
findView();
setListener();
count=new UpdataCount(context);
new Thread(mTask).start();
}
private Runnable mTask=new Runnable() {
@Override
public void run() {
//查询所有钓鱼发现物
list= SRPUtil.getInstance(context.getApplicationContext()).select(
Trove.class,false,"getWay=?",new String[]{"3"},null, null,"rate desc,feats desc", null);
try {
Thread.sleep(500);
} catch (InterruptedException e) {
e.printStackTrace();
}
viewHandler.sendMessage(viewHandler.obtainMessage());
}
};
private void findView(){
alert=new DialogEvent().showLoading(context);
DialogUtil.show(context,alert);
}
private void setListener() {
gridview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
Intent intent = new Intent(getActivity(), MissionDetailsActivity.class);
intent.putExtra("find_item", adapter.getItem(arg2).getName() + "");
startActivity(intent);
}
});
gridview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> arg0, View arg1,
int position, long arg3) {
if (adapter.getItem(position).getFind_flag() == 0) {
Trove trove = new Trove();
trove.setFind_flag(1);
dao.update(trove, new String[]{"flag"}, "id=?", new String[]{"" + adapter.getItem(position).getId()});
count.update_addMode("海洋生物", 1);
} else {
Trove trove = new Trove();
trove.setFind_flag(0);
dao.update(trove, new String[]{"flag"}, "id=?", new String[]{"" + adapter.getItem(position).getId()});
count.update_addMode("海洋生物", -1);
}
if (!context.isFinishing()) {
alert.show();
}
new Thread(mTask).start();
return true;
}
});
}
}
```
RecipeForTradeDetailsActivity.java
```package com.key.doltool.activity.recipe;
import java.util.ArrayList;
import java.util.List;
import android.os.Bundle;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.RecipeAdapter;
import com.key.doltool.data.sqlite.Recipe;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.LinearLayoutForListView;
import butterknife.BindView;
public class RecipeForTradeDetailsActivity extends BaseActivity{
@BindView(R.id.listview) LinearLayoutForListView list;
private List<Recipe> mylist=new ArrayList<>();
private String need="";
private int index=0;
@Override
public int getContentViewId() {
return R.layout.recipe_trade_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
need=getIntent().getStringExtra("item");
if(need!=null){
toolbar.setTitle(need);
index=1;
}else{
index=2;
need=getIntent().getStringExtra("name");
toolbar.setTitle(need+"相关配方");
}
init();
}
private void init(){
if(index==1){
mylist=SRPUtil.getInstance(this).select(Recipe.class,false,"name like ?",new String[]{"%"+need+"%"},null,null,null,null);
}else if(index==2){
mylist=SRPUtil.getInstance(this).select(Recipe.class,false,"need like ? or result like ?",new String[]{"%"+need+"%","%"+need+"%"},null,null,null,null);
}
list.setAdapter(new RecipeAdapter(mylist,this));
}
}
```
TagPicAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.content.Intent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.ability.AbilityForNormalDetailActivity;
import com.key.doltool.adapter.util.AdapterUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class TagPicAdapter extends BaseAdapter{
private String[] item_txt;
private DefaultDAO dao;
private AdapterUtil util;
private static class ViewHolder{
public ViewGroup item;
public TextView item_name;
public ImageView pic;
}
private Context context;
public TagPicAdapter(Context context,String[] item_txt){
this.context=context;
this.item_txt=new String[item_txt.length];
this.item_txt=item_txt;
dao=SRPUtil.getDAO(context);
util=new AdapterUtil(context, dao);
}
public int getCount() {
return item_txt.length;
}
@Override
public Object getItem(int arg0) {
return item_txt[arg0];
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_layout_pic, null);
holder.item_name=(TextView)convertView.findViewById(R.id.txt);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
holder.item=(ViewGroup)convertView.findViewById(R.id.item);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_name.setText(item_txt[position]);
final int number=position;
holder.item.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(context,AbilityForNormalDetailActivity.class);
it.putExtra("name",item_txt[number]);
context.startActivity(it);
}
});
util.findByName(holder.pic,item_txt[position],1);
return convertView;
}
}```
Skill.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Skill")
public class Skill {
@Column(autoincrement=true,primary=true)
//ID
private int id;
@Column(name="pic_id")
//图片ID
private String pic_id;
@Column(name="type",default_value="0")
//类型(冒,商,战,语言,船,副官)
private int type;
@Column(name="name")
//名称
private String name;
@Column(name="detail")
//效果
private String detail;
@Column(name="need")
//需求
private String need;
@Column(name="do_point")
//行动力消耗
private String do_point;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getPic_id() {
return pic_id;
}
public void setPic_id(String pic_id) {
this.pic_id = pic_id;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getDetail() {
return detail;
}
public void setDetail(String detail) {
this.detail = detail;
}
public String getNeed() {
return need;
}
public void setNeed(String need) {
this.need = need;
}
public String getDo_point() {
return do_point;
}
public void setDo_point(String do_point) {
this.do_point = do_point;
}
}
```
ImageLoader.java
```package com.key.doltool.util.imageUtil;
import android.content.Context;
import android.graphics.Bitmap;
import android.widget.ImageView;
import com.key.doltool.R;
import com.key.doltool.util.BitMapUtil;
import com.squareup.picasso.Picasso;
import java.io.IOException;
public class ImageLoader {
/**
* picasso 图片加载器，默认配置
* **/
public static void picassoLoad(Context context,String url,ImageView view){
Picasso.get()
.load(url)
.placeholder(R.drawable.dol_trove_defalut)
.error(R.drawable.dol_trove_defalut)
.config(Bitmap.Config.RGB_565)
// .memoryPolicy(MemoryPolicy.NO_CACHE)
.fit()
.centerCrop()
.into(view);
}
public static void picassoLoadCircle(Context context, String url, ImageView view){
Picasso.get()
.load(url)
.placeholder(CircleTransform.getDrawable(R.drawable.dol_trove_defalut,context.getResources()))
.error(CircleTransform.getDrawable(R.drawable.dol_trove_defalut,context.getResources()))
// .config(Bitmap.Config.RGB_565)
.fit()
.centerCrop()
.transform(new CircleTransform())
.into(view);
}
public static void picassoLoadCircle(Context context, ImageView view){
Picasso.get()
.load(R.drawable.dol_trove_defalut)
.placeholder(R.drawable.dol_trove_defalut)
.error(R.drawable.dol_trove_defalut)
// .config(Bitmap.Config.RGB_565)
.fit()
.centerCrop()
.transform(new CircleTransform())
.into(view);
}
/** **/
public static void setBitmapByAssets(ImageView img,String url,Context context){
try {
img.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(url)));
} catch (IOException e) {
e.printStackTrace();
}
}
}
```
BattleMainActivity.java
```package com.key.doltool.activity.battle;
import android.graphics.Typeface;
import android.os.Bundle;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
public class BattleMainActivity extends BaseActivity{
private TextView level;
@Override
public int getContentViewId() {
return R.layout.battle_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
}
private void findView(){
level=(TextView)findViewById(R.id.level);
level.setTypeface(Typeface.createFromAsset(getAssets(),
"wiki_html/fonts/shift_bold.ttf"));
}
}
```
BaseItem.java
```package com.key.doltool.data.item;
/**
* Created by Administrator on 2015/11/13.
*/
public class BaseItem {
}
```
TradeEvent.java
```package com.key.doltool.event;
import java.io.IOException;
import android.content.Context;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
/**交易处理事件**/
public class TradeEvent {
private String[] type_array={
"食品","调味料","家畜","医药品","杂货",
"酒类","嗜好品","香辛料","纤维","纺织品",
"染料","贵金属","矿石","香料","宝石",
"武器","火器","美术品","工艺品","工业制品"
};
private String[] pic_array={
"dol_sk1s2","dol_sk2s2","dol_sk14s2","dol_sk6s2","dol_sk20s2",
"dol_sk3s2","dol_sk4s2","dol_sk5s2","dol_sk7s2","dol_sk8s2",
"dol_sk9s2","dol_sk10s2","dol_sk11s2","dol_sk12s2","dol_sk13s2",
"dol_sk15s2","dol_sk16s2","dol_sk17s2","dol_sk18s2","dol_sk19s2"
};
private Context context;
public TradeEvent(Context context) {
this.context=context;
}
public void setNumber(int trade,ImageView tag_number,TextView number_txt){
switch(trade){
case 1:
tag_number.setImageResource(R.drawable.trade_1);
number_txt.setText("第一类");
break;
case 2:
tag_number.setImageResource(R.drawable.trade_2);
number_txt.setText("第二类");
break;
case 3:
tag_number.setImageResource(R.drawable.trade_3);
number_txt.setText("第三类");
break;
case 4:
tag_number.setImageResource(R.drawable.trade_4);
number_txt.setText("第四类");
break;
}
}
public void setType(String type,ImageView tag_type,TextView type_txt){
for(int i=0;i<type_array.length;i++){
if(type_array[i].equals(type)){
try {
tag_type.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(FileManager.SKILL+pic_array[i]+".png")));
} catch (IOException e) {
e.printStackTrace();
}
type_txt.setText(type);
}
}
}
public String getRecipeTypeByIndex(int index){
return new BookEvent().TYPE_BASE[index];
}
}
```
UseItemActivity.java
```package com.key.doltool.activity.useitem;
import android.os.Bundle;
import android.view.View;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.TagAdapter;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.FlowLayout;
import butterknife.BindView;
public class UseItemActivity extends BaseActivity{
@BindView(R.id.name) TextView name;
@BindView(R.id.main_txt) TextView main_txt;
@BindView(R.id.city_txt) TextView city_txt;
@BindView(R.id.city_array) FlowLayout array;
@BindView(R.id.pic) ImageView pic;
private String id="";
private String name_txt="";
private String tw_name="";
private UseItem item;
@Override
public int getContentViewId() {
return R.layout.useitem_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
id=getIntent().getStringExtra("id");
name_txt=getIntent().getStringExtra("name");
tw_name=getIntent().getStringExtra("tw_name");
flag=false;
init();
}
private void init(){
if(!StringUtil.isNull(id)){
item= SRPUtil.getInstance(getApplicationContext()).select
(UseItem.class,false,"id=?",new String[]{id},null,null,null,null).get(0);
}
if(!StringUtil.isNull(name_txt)){
item= SRPUtil.getInstance(getApplicationContext()).select
(UseItem.class, false, "name=? or name=?", new String[]{name_txt,tw_name}, null, null, null, null).get(0);
}
flag=false;
initToolBar(null);
toolbar.setTitle(item.name);
name.setText(item.name);
main_txt.setText(item.info);
ViewUtil.setImageView(pic,item.name,this);
if(StringUtil.isNull(item.type)){
city_txt.setVisibility(View.GONE);
array.setVisibility(View.GONE);
}else{
String[] city=item.type.split(",");
if(city.length==0){
city=new String[1];
city[0]=item.type;
}
array.setAdapter(new TagAdapter(this,city,false));
}
}
}
```
MapActivity.java
```package com.key.doltool.activity.squre;
import android.app.Dialog;
import android.graphics.PointF;
import android.os.Bundle;
import android.view.View;
import android.view.ViewGroup;
import android.widget.Button;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.data.sqlite.MapItem;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.SystemBarTintManager;
import com.key.doltool.view.flat.FlatButton;
import com.key.doltool.view.img.ImageSource;
import com.key.doltool.view.img.PinView;
import com.key.doltool.view.img.SubsamplingScaleImageView;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
/**
* 大航海时代ol世界地图
* @author key
* @version 1.0
*
**/
public class MapActivity extends BaseActivity {
@BindView(R.id.map) PinView img;
@BindView(R.id.btn) Button btn;
@BindView(R.id.detail) ViewGroup detail;
@BindView(R.id.name) TextView name;
@BindView(R.id.co_sea) TextView co_sea;
@BindView(R.id.sea) TextView sea;
@BindView(R.id.confrim) FlatButton confrim;
@BindView(R.id.cancel) FlatButton cancel;
private MapItem item;
private Dialog dialog;
private DefaultDAO dao;
@Override
public int getContentViewId() {
return R.layout.dol_map;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getDAO(this);
flag=false;
initToolBar(null);
toolbar.setTitle("世界地图");
toolbar.setBackgroundColor(getResources().getColor(R.color.Black_SP));
initViews();
SystemBarTintManager tintManager = new SystemBarTintManager(this);
tintManager.setStatusBarTintEnabled(true);
tintManager.setStatusBarTintResource(R.color.Black_SP);
img.setImage(ImageSource.resource(R.raw.map));
dialog=new DialogEvent().showLoading(this);
dialog.show();
}
private void initViews() {
item=(MapItem)dao.select(MapItem.class,false,"id>?",
new String[]{"0"}, null, null, null, null).get(0);
img.setOnImageEventListener(new SubsamplingScaleImageView.OnImageEventListener() {
@Override
public void onReady() {
dialog.dismiss();
}
@Override
public void onImageLoaded() {
}
@Override
public void onPreviewLoadError(Exception e) {
}
@Override
public void onImageLoadError(Exception e) {
}
@Override
public void onTileLoadError(Exception e) {
}
});
btn.setVisibility(View.GONE);
btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String [] seal=item.co_map.split(",");
img.setPanEnabled(true);
img.animateScaleAndCenter(1.5f,new PointF(Integer.parseInt(seal[0]),Integer.parseInt(seal[1]))).start();
img.setPin(new PointF(Integer.parseInt(seal[0]),Integer.parseInt(seal[1])));
showDialog();
}
});
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
detail.setVisibility(View.GONE);
}
});
confrim.setOnClickListener(new View.OnClickListener(){
public void onClick(View v) {
detail.setVisibility(View.GONE);
}
});
}
private void showDialog(){
name.setText("地域名称："+item.name);
co_sea.setText("所在坐标："+item.co_sea);
sea.setText("所属海域："+item.sea_name);
detail.setVisibility(View.VISIBLE);
}
@Override
protected void onDestroy() {
super.onDestroy();
img.recycle();
}
}```
NewsItem.java
```package com.key.doltool.data;
public class NewsItem {
//标题
private String title;
//日期
private String date;
//地址
private String url;
//内容（暂行）
private String content;
public String getTitle() {
return title;
}
public void setTitle(String title) {
this.title = title;
}
public String getDate() {
return date;
}
public void setDate(String date) {
this.date = date;
}
public String getUrl() {
return url;
}
public void setUrl(String url) {
this.url = url;
}
public String getContent() {
return content;
}
public void setContent(String content) {
this.content = content;
}
}
```
JsoupForTX.java
```package com.key.doltool.util.jsoup;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import org.jsoup.Jsoup;
import org.jsoup.nodes.Document;
import org.jsoup.select.Elements;
import android.util.Log;
import com.key.doltool.data.NewsItem;
import com.key.doltool.util.HttpUtil;
public class JsoupForTX {
/**BAHA源**/
public static String TX_BASE_URL="http://www.dahanghaiol.com/index.shtml";
public static String CARD_URL="http://static.hanghaimeng.com/src/4/4c25ae16c6b2e9cac14d5b8f884d91c4.html";
/**新闻url**/
public static List<NewsItem> list1=new ArrayList<>();
public static List<NewsItem> list2=new ArrayList<>();
public static List<NewsItem> list3=new ArrayList<>();
/**获得·News**/
public static void getUrl(){
Document doc;
try {
doc = Jsoup.connect(TX_BASE_URL).timeout(30*1000).get();
Elements table=doc.select("div.ui-news-list");
//新闻
Elements news_2=table.select("#news-2").select("ul");
//活动
Elements news_3=table.select("#news-3").select("ul");
//公告
Elements news_4=table.select("#news-4").select("ul");
Log.i("1",""+table.size());
Log.i("2",""+news_2.size());
if(news_2.size()!=0){
set(news_2,list1);
}
if(news_3.size()!=0){
set(news_3,list2);
}
if(news_4.size()!=0){
set(news_4,list3);
}
} catch (IOException e) {
HttpUtil.STATE=1;
e.printStackTrace();
}
}
public static String getCard(){
Document doc ;
String content="";
try {
doc = Jsoup.connect(CARD_URL).timeout(30*1000).get();
Elements table=doc.select("div.wikiContent");
table.select("a.wiki").removeAttr("href");
content=table.html();
} catch (IOException e) {
HttpUtil.STATE=1;
e.printStackTrace();
}
return content;
}
public static String getNews(String str){
Document doc ;
String result="";
if(!str.endsWith("shtml")||str.startsWith("http://news")){
HttpUtil.STATE=3;
return str;
}
try {
doc = Jsoup.connect(str).timeout(30*1000).get();
Elements table=doc.select("div.content");
if(table.size()<1){
return str;
}
result=table.html();
} catch (IOException e) {
HttpUtil.STATE=1;
e.printStackTrace();
}
return result;
}
//设置新闻资源
private static void set(Elements news,List<NewsItem> list){
for(int i=0;i<7;i++){
NewsItem item=new NewsItem();
String news_title=news.select("li").select("span.news-tit").get(i).select("a").get(1).attr("title");
String news_url=news.select("li").select("span.news-tit").get(i).select("a").get(1).attr("abs:href");
String news_date=news.select("li").select("span.news-date").get(i).text();
item.setTitle(news_title);
item.setContent("");
item.setDate(news_date);
item.setUrl(news_url);
list.add(item);
Log.i("news","title:"+news_title+"\n"+"date:"+news_date+"\n"+"ur:"+news_url);
}
}
}
```
ADCListAdapter.java
```package com.key.doltool.adapter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import butterknife.BindView;
import butterknife.ButterKnife;
public class ADCListAdapter extends BaseAdapter{
public static int SIZE=30;
static class ViewHolder{
@BindView(R.id.name) TextView name;
@BindView(R.id.pic) ImageView pic;
@BindView(R.id.type) TextView type;
@BindView(R.id.sex) TextView sex;
}
private List<ADCInfo> list=new ArrayList<>();
private Context context;
public ADCListAdapter(List<ADCInfo> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public ADCInfo getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.adc_simple_item, null);
ButterKnife.bind(holder, convertView);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
try {
holder.pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(FileManager.ADC+list.get(position).getHead_img()+".png")));
} catch (IOException e) {
e.printStackTrace();
}
int types=list.get(position).getType();
if(types==1){
holder.type.setText("冒险");
}else if(types==2){
holder.type.setText("商业");
}else{
holder.type.setText("海事");
}
String sex=list.get(position).getSex()+"";
if(sex.equals("男")){
holder.sex.setBackgroundResource(R.drawable.theme_blue_btn_rate);
}else{
holder.sex.setBackgroundResource(R.drawable.theme_pink_btn_rate);
}
holder.sex.setText(sex);
return convertView;
}
}```
MissonListActivity.java
```package com.key.doltool.activity.mission;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.View;
import android.view.ViewGroup;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemSelectedListener;
import android.widget.ArrayAdapter;
import android.widget.ListView;
import android.widget.Spinner;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ADCListAdapter;
import com.key.doltool.adapter.MissionItemAdapter;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.event.AreaEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class MissonListActivity extends BaseActivity{
//定义部分
@BindView(R.id.mission) ViewGroup mission;
@BindView(R.id.listview) ListView listview;
@BindView(R.id.sp_area) Spinner area;
@BindView(R.id.sp_city) Spinner city;
@BindView(R.id.sp_type) Spinner type;
@BindView(R.id.adventure_type) Spinner adventure_type;
@BindView(R.id.sp_mission_type) Spinner sp_type;
@BindView(R.id.search_btn) FlatButton search;
private Dialog alert;
private MissionItemAdapter adapter;
//数据temp变量
private int mode=0;
private AreaEvent event;
private String select_if;
private List<String> if_args=new ArrayList<>();
private ArrayAdapter<String> city_adapter;
private String[][] temp;
private int temp_click;
private ListFlowHelper<Mission> listFlowHelper;
private ViewHandler viewHandler;
private DefaultDAO dao;
@Override
public int getContentViewId() {
return R.layout.mission_list_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
event=new AreaEvent();
dao=SRPUtil.getDAO(this);
selectInit();
findView();
initSelectForCity();
initSelectForType();
}
//通用findView
private void findView() {
listFlowHelper=new ListFlowHelper<>(Mission.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new MissionItemAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, ADCListAdapter.SIZE,"level asc,skill_need asc");
alert=new DialogEvent().showLoading(this);
initPage();
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle("任务委托所");
}
private void initPage(){
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
alert.dismiss();
}
});
initPageItem();
}
private void initPageItem(){
ListScrollListener listScrollListener = new ListScrollListener(alert, viewHandler, context);
listview.setOnScrollListener(listScrollListener);
listFlowHelper.setListScrollListener(listScrollListener);
listFlowHelper.selectshow("0,"+MissionItemAdapter.SIZE);
adapter=new MissionItemAdapter(listFlowHelper.list,this);
listview.setAdapter(adapter);
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int position,
long arg3) {
jump(position);
}
});
listview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> parent, View view,
int position, long id) {
if(listFlowHelper.list.get(position).getTag()==0){
Mission mission=new Mission();
mission.setTag(1);
listFlowHelper.list.get(position).setTag(1);
dao.update(mission, new String[]{"tag"}, "id=?", new String[]{""+listFlowHelper.list.get(position).getId()});
}else{
Mission mission=new Mission();
mission.setTag(0);
listFlowHelper.list.get(position).setTag(0);
dao.update(mission, new String[]{"tag"}, "id=?", new String[]{""+listFlowHelper.list.get(position).getId()});
}
adapter.notifyDataSetChanged();
return true;
}
});
temp=AreaEvent.ADVENTURE_CITY;
}
private void showDialog(){
new DialogEvent(select_if,if_args).itemDialog(listFlowHelper,context);
}
private void jump(int position){
Intent intent=new Intent(this,MissionDetailsActivity.class);
intent.putExtra("find_item", listFlowHelper.list.get(position).getId()+"");
intent.putExtra("type","item");
startActivity(intent);
}
//变更模式
private void changeMode(){
if(mode==0){
mode=1;
}else{
mode=0;
}
//显示搜索域
searchShow();
}
private void searchShow(){
if(mode==1){
mission.setVisibility(View.VISIBLE);
}else{
mission.setVisibility(View.GONE);
}
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()&&mode==0){
super.onKeyDown(keyCode, event);
}
//其他
else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK)
{
//取消搜索模式
if(mode==1){
changeMode();
}
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
//获取条件下的搜索串
private void setSelectArgs(){
//初始化搜索条件
selectInit();
//获取城市附加条件
if(city.getVisibility()!=View.GONE){
select_if+=" and start_city like ?";
String temp=city.getSelectedItem().toString();
if_args.add("%"+temp+"%");
}
//获取类型附加条件
if(type.getSelectedItemPosition()!=0&&type.getSelectedItemPosition()!=5){
select_if+=" and type = ?";
if_args.add(type.getSelectedItem().toString());
}else if(type.getSelectedItemPosition()==5){
String temp=event.getStringByIndex(sp_type.getSelectedItemPosition());
switch (temp) {
case "":
select_if += " and type = ?";
if_args.add(sp_type.getSelectedItem().toString());
break;
case "沉船":
case "掠夺":
select_if += " and start_city like ?";
if_args.add("%" + temp + "%");
break;
case "海上视认":
select_if += " and start_city like ?";
if_args.add("%" + temp + "%");
break;
default:
select_if += " and get_item like ?";
if_args.add("%" + temp + "%");
break;
}
}
//获取技能需求附加条件
if(adventure_type.getVisibility()!=View.GONE&&adventure_type.getSelectedItemPosition()!=0){
select_if+=" and skill_need like ?";
String temp=adventure_type.getSelectedItem().toString();
if_args.add("%"+temp+"%");
}
listFlowHelper.change_if(select_if,if_args);
}
private void selectInit(){
select_if="id>?";
if_args.clear();
if_args.add("0");
}
//初始化-搜索栏
private void initSelectForCity(){
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(this,AreaEvent.ADVENTURE_AREA);
area.setAdapter(adapter);
//地区-城市联动事件
area.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
if (arg2 == 0) {
city.setVisibility(View.GONE);
} else {
city.setVisibility(View.VISIBLE);
city_adapter = new SpinnerArrayAdapter(MissonListActivity.this, temp[arg2]);
city.setAdapter(city_adapter);
}
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
}
//初始化-搜索栏
private void initSelectForType(){
ArrayAdapter<String> adapter3=new SpinnerArrayAdapter
(this,ResourcesUtil.getArray(this,R.array.mission_type));
type.setAdapter(adapter3);
search.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
setSelectArgs();
}
});
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(this,ResourcesUtil.getArray(this,R.array.adventure_type));
adventure_type.setAdapter(adapter);
ArrayAdapter<String> adapter2=new SpinnerArrayAdapter
(this,ResourcesUtil.getArray(this,R.array.sp_mission_type));
sp_type.setAdapter(adapter2);
//地区-城市联动事件
type.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
if(arg2==1||arg2==4){
area.setEnabled(true);
city.setEnabled(true);
sp_type.setVisibility(View.GONE);
adventure_type.setVisibility(View.VISIBLE);
}else if(arg2==5){
area.setSelection(0);
area.setEnabled(false);
city.setEnabled(false);
sp_type.setVisibility(View.VISIBLE);
adventure_type.setVisibility(View.GONE);
}
else{
area.setEnabled(true);
city.setEnabled(true);
sp_type.setVisibility(View.GONE);
adventure_type.setVisibility(View.GONE);
}
if(arg2==4){
temp=AreaEvent.LIB_CITY;
area.setSelection(0);
city_adapter=new ArrayAdapter<>(MissonListActivity.this,android.R.layout.simple_spinner_item,temp[0]);
city.setAdapter(city_adapter);
}
if(temp_click==4){
temp=AreaEvent.ADVENTURE_CITY;
area.setSelection(0);
city_adapter=new ArrayAdapter<>(MissonListActivity.this,android.R.layout.simple_spinner_item,temp[0]);
city.setAdapter(city_adapter);
}
temp_click=arg2;
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:changeMode();break;
case R.id.type_search:showDialog();break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.adc_menu, menu);
return true;
}
}```
ADCInfo.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="ADC")
public class ADCInfo {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//技能表
@Column(name="head_img")
private String head_img;
//技能表
@Column(name="skill_list")
private String skill_list;
//所在城市
@Column(name="city")
private String city;
//性别
@Column(name="sex")
private String sex;
//类型
@Column(name="type")
private int type;
//国籍
@Column(name="country")
private String country;
//备注
@Column(name="other")
private String other;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getCity() {
return city;
}
public void setCity(String city) {
this.city = city;
}
public String getOther() {
return other;
}
public void setOther(String other) {
this.other = other;
}
public String getSkill_list() {
return skill_list;
}
public void setSkill_list(String skill_list) {
this.skill_list = skill_list;
}
public String getSex() {
return sex;
}
public void setSex(String sex) {
this.sex = sex;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public String getCountry() {
return country;
}
public void setCountry(String country) {
this.country = country;
}
public String getHead_img() {
return head_img;
}
public void setHead_img(String head_img) {
this.head_img = head_img;
}
}
```
JobDetailsActivity.java
```package com.key.doltool.activity.job;
import java.io.IOException;
import java.util.List;
import android.os.Bundle;
import android.util.Log;
import android.view.View;
import android.widget.ImageView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.TagPicAdapter;
import com.key.doltool.data.sqlite.Job;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.DataSelectUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.FlowLayout;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class JobDetailsActivity extends BaseActivity{
@BindView(R.id.name) TextView name;
@BindView(R.id.type) TextView type;
@BindView(R.id.details) TextView details;
@BindView(R.id.level) TextView level;
@BindView(R.id.money) TextView money;
@BindView(R.id.book_mark) TextView book_mark;
@BindView(R.id.sp_layout) RelativeLayout sp_layout;
@BindView(R.id.sp_pic) ImageView sp_pic;
@BindView(R.id.sp_name) TextView sp_name;
@BindView(R.id.skill_array) FlowLayout skill_array;
private DefaultDAO dao;
private String id="0";
private String name_str="0";
private Job item;
@Override
public int getContentViewId() {
return R.layout.job_details;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
id=getIntent().getStringExtra("id");
name_str=getIntent().getStringExtra("name");
init();
}
private void init(){
if(!StringUtil.isNull(id)){
item=(Job)dao.select(Job.class,false,"id=?",new String[]{""+id},null,null,null,null).get(0);
}else{
item=(Job)dao.select(Job.class,false,"name=?",new String[]{""+name_str},null,null,null,null).get(0);
}
name.setText(""+item.getName());
details.setText(""+item.getDetail());
int types=item.getType();
if(types==1){
type.setText("冒险");
}else if(types==2){
type.setText("商业");
}else{
type.setText("海事");
}
book_mark.setText(item.getMetal());
String[] temp=item.getChang_if().split("\\|");
Log.i("x",temp.length+"");
Log.i("x",temp[0]);
Log.i("x",temp[1]);
String temp_1[]=temp[0].split(":");
String levle_string=temp_1[1].replace("合计","")+"(合计:"+temp_1[2]+")";
level.setText(levle_string);
money.setText(temp[1].split(":")[1]);
if(StringUtil.isNull(item.getSp())){
sp_layout.setVisibility(View.GONE);
}else{
sp_name.setText(item.getSp());
try {
sp_pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(getAssets().open(DataSelectUtil.getSkillPicByName(item.getSp(), dao)+".png")));
} catch (IOException e) {
e.printStackTrace();
}
}
List<String> list=new Gson().fromJson(item.getGood_list(),new TypeToken<List<String>>(){}.getType());
String[] skill=StringUtil.listToArray(list);
skill_array.setAdapter(new TagPicAdapter(this, skill));
}
}
```
ShareCardDeckActivity.java
```package com.key.doltool.activity.adventure.card;
import android.app.Dialog;
import android.content.DialogInterface;
import android.content.Intent;
import android.os.Bundle;
import android.view.Menu;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import androidx.appcompat.app.AlertDialog;
import androidx.appcompat.widget.Toolbar;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.CardShareAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.data.parse.Deck;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.view.Toast;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVQuery;
import cn.leancloud.callback.FindCallback;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
/**
* 展示云平台分享的论战组合
* 带命令的跳转至该界面，如果什么没做则不进行回传更新
* 如果更新了数据则回到上个界面同时更新显示数据
* **/
public class ShareCardDeckActivity extends BaseActivity {
@BindView(R.id.list) ListView listview;
private List<Deck> list=new ArrayList<>();
private AVQuery<Deck> query;
private Dialog alert;
@Override
public int getContentViewId() {
return R.layout.card_share_show;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
postMessage();
}
private void findView(){
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle("卡组分享");
alert=new DialogEvent().showLoading(this);
DialogUtil.show(context,alert);
}
private void setListener(){
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> parent, View view, int position, long id) {
//点击后获取以下列表数据进行数据更新读取
List<Integer> temp=
new Gson().fromJson(list.get(position).getCard_list(),new TypeToken<List<Integer>>(){}.getType());
show2(temp,list.get(position).getLimit());
}
});
}
private void show2(final List<Integer> temp,final String limit){
AlertDialog.Builder b=new AlertDialog.Builder(context);
b.setTitle("替换卡组");
b.setMessage("替换现有的卡组，会覆盖现有的卡组");
b.setPositiveButton("确定", new DialogInterface.OnClickListener() {
@Override
public void onClick(DialogInterface dialog, int which) {
new UpdataCount(getApplicationContext()).backSaveCard(temp);
Intent intent=new Intent(context,CardListActivity.class);
intent.putExtra("limit",limit);
setResult(RESULT_OK,intent);
dialog.dismiss();
finish();
}
});
b.setNegativeButton("取消", new DialogInterface.OnClickListener() {
@Override
public void onClick(DialogInterface dialog, int which) {
dialog.dismiss();
}
});
Dialog mDialog=b.create();
mDialog.show();
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:break;
case R.id.type_search:break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.trove_menu, menu);
return true;
}
private void show(List<Deck> objects){
for(int i=0;i<objects.size();i++){
list.add(objects.get(i));
}
listview.setAdapter(new CardShareAdapter(list, this));
listview.setVisibility(View.VISIBLE);
}
private void postMessage(){
query=AVQuery.getQuery("CardShare");
query.whereExists("name").orderByDescending("value");
query.findInBackground().subscribe(new Observer<List<Deck>>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(List<Deck> decks) {
show(decks);
DialogUtil.dismiss(context,alert);
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(), "连接失败", Toast.LENGTH_LONG).show();
DialogUtil.dismiss(context,alert);
}
@Override
public void onComplete() {
}
});
}
@Override
protected void onDestroy() {
super.onDestroy();
}
}
```
UpdataCount.java
```package com.key.doltool.event;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.util.Log;
import com.key.doltool.data.sqlite.Card;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.data.sqlite.Trove_Count;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
/**更新事件:主要复制初始化和备份数据的操作**/
public class UpdataCount {
private DefaultDAO dao;
private SRPUtil srp;
public UpdataCount(Context context){
dao=SRPUtil.getDAO(context);
srp=SRPUtil.getInstance(context);
}
public static String[] name_type={
"史迹","宗教建筑","历史遗物","宗教遗物","美术品",
"财宝","化石","植物","昆虫","鸟类","海洋生物",
"小型生物","中型生物","大型生物","港口","地理","天文"
};
public void init_adventure(){
for(int i=1;i<=name_type.length;i++){
//查询发现表
Trove_Count count=new Trove_Count();
count.setNow(dao.select(Trove.class, false, "type=? and flag=?",new String[]{name_type[i-1],"1"}, null, null, null, null).size());
//更新统计表
dao.update(count, new String[]{"now"}, "type=?", new String[]{""+i});
}
}
public void init_adventure(String type){
Trove_Count count=new Trove_Count();
count.setNow(dao.select(Trove.class, false, "type=? and flag=?",new String[]{type,"1"}, null, null, null, null).size());
//更新统计表
for(int i=0;i<name_type.length;i++){
if(type.equals(name_type[i])){
dao.update(count, new String[]{"now"}, "type=?", new String[]{""+(i+1)});
}
}
}
public void update_adventure(String type,int now){
Trove_Count counts=new Trove_Count();
counts.setNow(now);
for(int i=0;i<name_type.length;i++){
if(type.equals(name_type[i])){
dao.update(counts, new String[]{"now"}, "type=?", new String[]{""+(i+1)});
}
}
}
public void update_addMode(String type,int now){
Trove_Count counts;
for(int i=0;i<name_type.length;i++){
if(type.equals(name_type[i])){
counts=(Trove_Count)dao.select(Trove_Count.class, false, "type=?",new String[]{""+(i+1)}, null, null, null, null).get(0);
counts.setNow(counts.getNow()+now);
dao.update(counts, new String[]{"now"}, "type=?", new String[]{""+(i+1)});
}
}
}
@SuppressWarnings("unchecked")
//保存所有已发现的发现物
public List<Integer> saveIdFlag(){
List<Trove> list=(List<Trove>)dao.select(Trove.class, false, "flag=?",new String[]{"1"}, null, null, null, null);
List<Integer> temp=new ArrayList<>();
for(int i=0;i<list.size();i++){
temp.add(list.get(i).getId());
}
return temp;
}
@SuppressWarnings("unchecked")
public List<Integer> saveMission(int tagert){
if(tagert>6){
List<Mission> list=(List<Mission>)dao.select(Mission.class, false, "tag=?",new String[]{"1"}, null, null, null, null);
List<Integer> temp=new ArrayList<>();
for(int i=0;i<list.size();i++){
temp.add(list.get(i).getId());
}
return temp;
}else{
return null;
}
}
//还原任务记录
public void backSaveMission(List<Integer> list){
List<Mission> temp=new ArrayList<>();
for(int i=0;i<list.size();i++){
Mission mission=new Mission();
mission.setTag(1);
mission.setId(list.get(i));
temp.add(mission);
}
srp.update_Mission(temp);
}
//还原所有发现物的状态
public void backSave(List<Integer> list){
List<Trove> temp=new ArrayList<>();
for(int i=0;i<list.size();i++){
Trove trove=new Trove();
trove.setFind_flag(1);
trove.setId(list.get(i));
temp.add(trove);
}
Log.i("size",""+srp.update_Trove(temp));
//更新统计数据
init_adventure();
}
//还原卡组
public void backSaveCard(List<Integer> list){
List<Card> temp=new ArrayList<>();
List<Card> out_temp=srp.select(Card.class, false, "flag=?",new String[]{"1"}, null, null, null, null);
for(int i=0;i<out_temp.size();i++){
Card card = new Card();
card.flag = 0;
card.id = out_temp.get(i).id;
temp.add(card);
}
for (int i=0;i<list.size();i++) {
Card card = new Card();
card.flag = 1;
card.id = list.get(i);
temp.add(card);
}
srp.update_Card(temp);
}
public void backSync(List<String> list){
List<Integer> mList=new ArrayList<>();
List<Integer> tList=new ArrayList<>();
for(int i=0;i<list.size();i++){
String temp[]=list.get(i).split("\\+");
if(temp[0].equals("m")){
mList.add(Integer.parseInt(temp[1]));
}else if(temp[0].equals("t")){
tList.add(Integer.parseInt(temp[1]));
}
}
Log.i("size","任务："+mList.size()+"-发现物："+tList.size());
backSaveMission(mList);
backSave(tList);
}
}
```
PortActivity.java
```package com.key.doltool.activity.squre;
import android.app.Dialog;
import android.os.Bundle;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.LinearLayout;
import android.widget.ListView;
import android.widget.TextView;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ShipAdapter;
import com.key.doltool.adapter.ShipTimeAdapter;
import com.key.doltool.data.sqlite.RegularShip;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.db.SRPUtil;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
/**
* 定期船
* @author key
* @version 1.0
**/
public class PortActivity extends BaseActivity {
@BindView(R.id.listview) ListView listView;
private List<RegularShip> shipList=new ArrayList<>();
private Dialog alert;
@Override
public int getContentViewId() {
return R.layout.activity_port_ship;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
toolbar.setTitle("港口定期船");
findView();
setListener();
init();
}
private void findView(){
alert=new DialogEvent().showLoading(this);
}
private void setListener(){
listView.setOnItemClickListener(new AdapterView.OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> parent, View view, int position, long id) {
showTimeList(shipList.get(position));
}
});
}
private void init(){
shipList=SRPUtil.getInstance(getApplicationContext())
.select(RegularShip.class,false,"id>?",new String[]{"0"},
null,null,null,null);
listView.setAdapter(new ShipAdapter(shipList,this));
}
private void showTimeList(RegularShip item){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.panel_material_time_list_dialog, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(LinearLayout.LayoutParams.MATCH_PARENT,
LinearLayout.LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
updateDialog.show();
TextView title_view=(TextView)view.findViewById(R.id.title);
String title=item.start_city+"-"+item.end_city;
List<String> list=new Gson().fromJson(item.time_list, new TypeToken<List<String>>() {}.getType());
title_view.setText(title);
ListView listView=(ListView)view.findViewById(R.id.listview);
listView.setAdapter(new ShipTimeAdapter(list,this));
}
}```
MenuEvent.java
```package com.key.doltool.event;
import java.util.ArrayList;
import java.util.List;
import com.key.doltool.data.MenuItem;
public class MenuEvent {
private String[] content={
"发现之旅","发现物概览","回报地点","论战组合",
"交易品","生产配方","船只概览",
"百科","快速查询",
"广场中的人",
"设置","隐私政策","用户协议"
};
public String[] head={
"发现","商业","博物","杂项","系统"
};
private int[] parent_id={
0,0,0,0,
1,1,1,
2,2,
3,
4,4,4,
};
public List<MenuItem> initMenuList(){
List<MenuItem> list=new ArrayList<>();
for(int i=0;i<content.length;i++){
MenuItem item=new MenuItem();
item.text=content[i];
item.index=i;
item.parent_id=parent_id[i];
list.add(item);
}
return list;
}
}
```
MissonLinkListActivity.java
```package com.key.doltool.activity.mission;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.MissionItemAdapter;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class MissonLinkListActivity extends BaseActivity{
@BindView(R.id.listview) ListView listview;
private MissionItemAdapter adapter;
private String select_if;
private List<Mission> list_mission=new ArrayList<>();
private List<String> if_args=new ArrayList<>();
private DefaultDAO dao;
@Override
public int getContentViewId() {
return R.layout.mission_list_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao=SRPUtil.getDAO(this);
selectInit();
findView();
}
//通用findView
private void findView() {
initPage();
flag=false;
initToolBar(null);
toolbar.setTitle("任务委托所");
}
private void initPage(){
selectshow();
adapter=new MissionItemAdapter(list_mission,this);
listview.setAdapter(adapter);
initPageItem();
}
private void initPageItem(){
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int position,
long arg3) {
jump(position);
}
});
listview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> parent, View view,
int position, long id) {
if (list_mission.get(position).getTag() == 0) {
Mission mission = new Mission();
mission.setTag(1);
list_mission.get(position).setTag(1);
dao.update(mission, new String[]{"tag"}, "id=?", new String[]{"" + list_mission.get(position).getId()});
} else {
Mission mission = new Mission();
mission.setTag(0);
list_mission.get(position).setTag(0);
dao.update(mission, new String[]{"tag"}, "id=?", new String[]{"" + list_mission.get(position).getId()});
}
adapter.notifyDataSetChanged();
return true;
}
});
}
private void selectshow(){
list_mission=SRPUtil.getInstance(getApplicationContext()).select(Mission.class, false,select_if, StringUtil.listToArray(if_args),
null, null,"level asc,skill_need asc",null);
}
private void jump(int position){
Intent intent=new Intent(this,MissionDetailsActivity.class);
intent.putExtra("find_item", list_mission.get(position).getId() + "");
intent.putExtra("type","item");
startActivity(intent);
}
private void selectInit(){
select_if="id>?";
if_args.clear();
if_args.add("0");
}
}```
RecipeBookListActivity.java
```package com.key.doltool.activity.recipe;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.view.KeyEvent;
import android.view.View;
import android.widget.AbsListView;
import android.widget.AbsListView.OnScrollListener;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.BookAdapter;
import com.key.doltool.adapter.SkillAdapter;
import com.key.doltool.data.sqlite.Book;
import com.key.doltool.event.BookEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
public class RecipeBookListActivity extends BaseActivity implements OnScrollListener{
//定义部分
private Dialog alert;
//列表
@BindView(R.id.listview) ListView listview;
private DefaultDAO dao;
private List<Book> list=new ArrayList<>();
private BookAdapter adapter;
private int add=0;
private Thread mThread; // 线程
private boolean end_flag=true; //是否为最末标记
//查询条件
private String select_if="type=?";
private String[] select_if_x={"0"};
private String type_id="";
private String order="name desc";
@Override
public int getContentViewId() {
return R.layout.card_combo_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(this);
getExtra();//外部搜索链接参数处理
type_id=getIntent().getIntExtra("types",0)+"";
select_if_x[0]=type_id;
selectshow("0,"+SkillAdapter.SIZE);
findView();
setListener();
}
private void getExtra(){
if(!StringUtil.isNull(getIntent().getStringExtra("type"))){
select_if=getIntent().getStringExtra("type");
select_if_x[0]=getIntent().getStringExtra("args");
}
}
//通用findView
private void findView() {
initPage();
toolbar.setTitle(new BookEvent().TITLE[getIntent().getIntExtra("type",0)]);
alert=new DialogEvent().showLoading(this);
}
//通用Listener
private void setListener() {
listview.setOnItemClickListener(new OnItemClickListener(){
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2, long arg3) {
Intent it=new Intent(RecipeBookListActivity.this,RecipeForBookDetailsActivity.class);
it.putExtra("id",list.get(arg2).getId()+"");
startActivity(it);
}
});
}
private void initPage(){
initPageItem();
}
private void initPageItem(){
adapter=new BookAdapter(list,this);
listview.setOnScrollListener(this);
listview.setAdapter(adapter);
}
@Override
protected void onDestroy() {
dao=null;
super.onDestroy();
}
@SuppressWarnings("unchecked")
//有限数据查询
private void selectshow(String limit){
if(dao==null){
return;
}
//数据前后记录
int size_before,size_after;
size_before=list.size();
list.addAll(((List<Book>) dao.select(Book.class, false,select_if, select_if_x,
null, null,order,limit)));
size_after=list.size();
//数据返回判断
if(size_after<SkillAdapter.SIZE){
//表示，小于
end_flag=false;
}
if(size_after==size_before&&size_after!=0){
end_flag=false;
Toast.makeText(getApplicationContext(),"已经返回所有查询结果了", Toast.LENGTH_LONG).show();
}else if(size_after==0){
Toast.makeText(getApplicationContext(),"没有查到您想要的结果", Toast.LENGTH_LONG).show();
}
}
//数据添加
private void change(){
add+=SkillAdapter.SIZE;
selectshow(add+","+ SkillAdapter.SIZE);
adapter.notifyDataSetChanged();
}
//修改查询条件
public void change_if(String if_s,String if_args){
//初始化所有数据
select_if=if_s;
select_if_x=new String[1];
select_if_x[0]=if_args;
list.clear();
add=0;
selectshow("0,"+SkillAdapter.SIZE);
//重新setAdapter
adapter=new BookAdapter(list,this);
listview.setAdapter(adapter);
}
//修改查询条件
public void change_if(String if_s,List<String> if_args){
//初始化所有数据
select_if=if_s;
select_if_x=new String[if_args.size()];
for(int i=0;i<select_if_x.length;i++){
select_if_x[i]=if_args.get(i);
}
list.clear();
add=0;
selectshow("0,"+SkillAdapter.SIZE);
//重新setAdapter
adapter=new BookAdapter(list,this);
listview.setAdapter(adapter);
}
//重置最末尾标记
public void begin(){
end_flag=true;
}
/**
* 华丽的分割线——以下是Handler,线程,系统按键等处理
*/
//Handler——线程结束后更新界面
private Handler handler = new Handler() {
public void handleMessage(Message msg) {
change();
alert.dismiss();
}
};
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(select_if.equals("type=?")){
super.onKeyDown(keyCode, event);
}
//其他
else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK)
{
//条件不是初始状态就重置
if(!select_if.equals("type=?")){
end_flag=true;
change_if("type=?",type_id+"");
Toast.makeText(getApplicationContext(),"重置搜索条件", Toast.LENGTH_SHORT).show();
}
}
}
return true;
}
//滚动监听① - useless
public void onScroll(AbsListView view, int firstVisibleItem, int visibleItemCount, int totalItemCount) {
}
//滚动监听②
public void onScrollStateChanged(final AbsListView view, int scrollState) {
//当不滚动时
boolean flag;
flag=end_flag;
if(scrollState == SCROLL_STATE_IDLE){
System.out.println(view.getFirstVisiblePosition()+"===" + view.getLastVisiblePosition()+"==="+view.getCount());
//判断滚动到底部
if(view.getLastVisiblePosition()==(view.getCount()-1)){
//没有线程且不为最末时
if ((mThread == null || !mThread.isAlive())&&flag) {
//显示进度条，区域操作控制
alert.show();
mThread = new Thread() {
public void run() {
try {
Thread.sleep(2500);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 1;
handler.sendMessage(message);
}
};
mThread.start();
}
}
}
}
}
```
TagSkillAdapter.java
```package com.key.doltool.adapter;
import java.util.List;
import android.content.Context;
import android.content.Intent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.job.JobDetailsActivity;
import com.key.doltool.data.sqlite.Job;
public class TagSkillAdapter extends BaseAdapter{
private List<Job> list;
private String skill_name;
private static class ViewHolder{
public ViewGroup item;
public TextView item_name;
public TextView effect;
}
private Context context;
public TagSkillAdapter(Context context,List<Job> list,String skill_name){
this.context=context;
this.list=list;
this.skill_name=skill_name;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_skill_sp, null);
holder.item_name=(TextView)convertView.findViewById(R.id.tag_name);
holder.effect=(TextView)convertView.findViewById(R.id.tag_details);
holder.item=(ViewGroup)convertView.findViewById(R.id.sp_layout);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.item_name.setText(list.get(position).getName());
final int number=position;
holder.item.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(context,JobDetailsActivity.class);
it.putExtra("name", list.get(number).getName());
context.startActivity(it);
}
});
String sp=list.get(position).getSp();
if(!sp.equals(skill_name)){
holder.effect.setVisibility(View.GONE);
}else{
holder.effect.setVisibility(View.VISIBLE);
}
return convertView;
}
}```
MyApplication.java
```package com.key.doltool.activity;
import android.graphics.Typeface;
import androidx.multidex.MultiDex;
import com.key.doltool.data.parse.Deck;
import com.key.doltool.event.CrashHandler;
import com.key.doltool.util.FontManager;
import com.the9tcat.hadi.HadiApplication;
import cn.leancloud.AVInstallation;
import cn.leancloud.AVOSCloud;
import cn.leancloud.AVObject;
public class MyApplication extends HadiApplication{
@Override
public void onCreate() {
super.onCreate();
CrashHandler.getInstance().init(this);
AVObject.registerSubclass(Deck.class);
AVOSCloud.initialize(this, "d7iXxubw81WQ0vojBtnwpxqn-MdYXbMMI", "bbEOe1mKAgp7C96DGrO7WTnK");
AVInstallation.getCurrentInstallation().saveInBackground();
FontManager.setDefaultFont(this, Typeface.DEFAULT.toString(), FontManager.DEFAULT_FONT);
}
@Override
protected void attachBaseContext(android.content.Context base) {
super.attachBaseContext(base);
MultiDex.install(this);
}
}
```
WordAdapter.java
```package com.key.doltool.adapter.item;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.WordItem;
public class WordAdapter extends BaseAdapter{
public static int SIZE=20;
private static class ViewHolder{
public TextView zh_name;
public TextView tw_name;
public TextView type;
}
private List<WordItem> list=new ArrayList<>();
private Context context;
public WordAdapter(List<WordItem> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_word_list,null);
holder.zh_name=(TextView)convertView.findViewById(R.id.zh_name);
holder.tw_name=(TextView)convertView.findViewById(R.id.tw_name);
holder.type=(TextView)convertView.findViewById(R.id.type);
// 为view设置标签
convertView.setTag(holder);
}else {
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.zh_name.setText("国服："+list.get(position).zh_name);
holder.tw_name.setText("台服："+list.get(position).tw_name);
holder.type.setText(list.get(position).type);
return convertView;
}
}
```
AdventureMainFragment.java
```package com.key.doltool.activity.adventure;
import android.content.Intent;
import android.os.Bundle;
import android.util.Log;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.adapter.AdventureAdapter;
import com.key.doltool.data.sqlite.Trove_Count;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.db.SRPUtil;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
import io.reactivex.Observable;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
public class AdventureMainFragment extends BaseFragment{
@BindView(R.id.main_list) ListView main_list;
private List<Trove_Count> list_count=new ArrayList<>();
private Disposable updateSubscription;
@Override
public int getContentViewId() {
return R.layout.adventure_main_area;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
findView();
setListener();
Observable<Boolean> sailBoatObservable = RxBusEvent.get().register(RxBusEvent.UPDATE);
updateSubscription=sailBoatObservable.subscribe(new Consumer<Boolean>() {
@Override
public void accept(Boolean flag) {
if(flag) {
init();
main_list.setAdapter(new AdventureAdapter(list_count,context));
}
}
});
}
@Override
public void onDestroyView() {
super.onDestroyView();
Log.e("onDestroyView","onDestroyView");
if(updateSubscription!=null){
updateSubscription.dispose();
}
RxBusEvent.get().unregister(RxBusEvent.SAILMENU);
}
private void findView(){
main_list.setAdapter(new AdventureAdapter(list_count,context));
}
private void setListener(){
main_list.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
jump(list_count.get(arg2).getType());
}
});
}
private void jump(int index){
Intent it=new Intent(context,AdventureListNewApiActivity.class);
it.putExtra("type", UpdataCount.name_type[index-1]);
startActivity(it);
}
private void init(){
list_count=SRPUtil.getInstance(context).select(Trove_Count.class, false, "type > ?",new String[]{"0"}, null, null, null, null);
}
}```
NameValueItem.java
```package com.key.doltool.data.base;
public class NameValueItem {
public String name;
public int value;
public NameValueItem(String name,int value){
this.name=name;
this.value=value;
}
}
```
MenuItem.java
```package com.key.doltool.data;
/**菜单栏元素**/
public class MenuItem {
public String name;
public int pic_id;
public String pic;
public String text;
public int index;
public int parent_id;
}
```
MissionDetailsActivity.java
```package com.key.doltool.activity.mission;
import java.util.List;
import android.app.Dialog;
import android.os.Bundle;
import android.util.Log;
import android.view.Gravity;
import android.view.LayoutInflater;
import android.view.Menu;
import android.view.View;
import android.widget.LinearLayout;
import android.widget.TextView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.MissionConnectAdapter;
import com.key.doltool.adapter.MissionDetailsAdapter;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.FlowLayout;
import com.key.doltool.view.LinearLayoutForListView;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class MissionDetailsActivity extends BaseActivity{
@BindView(R.id.details) LinearLayoutForListView detail_list;
@BindView(R.id.type) TextView type;
@BindView(R.id.name) TextView name;
@BindView(R.id.null_txt) TextView txt;
private DefaultDAO dao;
private String find_item="";
private String tw_name="";
private String type_txt="";
private int souce_type=0;
private String souce="";
private int index=0;
private List<Mission> list;
private int temp=0;
@Override
public int getContentViewId() {
return R.layout.mission_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
find_item=getIntent().getStringExtra("find_item");
tw_name=getIntent().getStringExtra("tw_name");
type_txt=getIntent().getStringExtra("type");
souce_type=getIntent().getIntExtra("souce_type", 0);
index=getIntent().getIntExtra("index", 0);
souce=getIntent().getStringExtra("souce_name");
dao=SRPUtil.getDAO(this);
findView();
init();
}
private void findView(){
flag=false;
initToolBar(onMenuItemClick);
}
private void initMenu(){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.mission_connect, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(context)-30,
LinearLayout.LayoutParams.WRAP_CONTENT);
params.gravity = Gravity.CENTER_HORIZONTAL;
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(view, params);
FlowLayout before_list=(FlowLayout)view.findViewById(R.id.before_mission_list);
TextView tag1=(TextView)view.findViewById(R.id.before_mission_tag);
FlowLayout after_list=(FlowLayout)view.findViewById(R.id.after_mission_list);
TextView tag2=(TextView)view.findViewById(R.id.after_mission_tag);
if(list.size()>0){
int total=0;
if(!list.get(0).getBefore().equals("")){
String[] temp=list.get(0).getBefore().split(",");
before_list.setAdapter(new MissionConnectAdapter(temp,this,1,name.getText().toString()));
}else{
tag1.setVisibility(View.GONE);
before_list.setVisibility(View.GONE);
total++;
}
if(!list.get(0).getAfter().equals("")){
String[] temp=list.get(0).getAfter().split(",");
after_list.setAdapter(new MissionConnectAdapter(temp,this,2,name.getText().toString()));
}else{
tag2.setVisibility(View.GONE);
after_list.setVisibility(View.GONE);
total++;
}
if(total==2){
temp=total;
Toast.makeText(getApplicationContext(),"无关联任务",Toast.LENGTH_SHORT).show();
}else{
temp=total;
updateDialog.show();
}
}
}
@SuppressWarnings("unchecked")
private void init(){
Log.i("type",type_txt+"");
if(StringUtil.isNull(type_txt)){
list=(List<Mission>)dao.select(Mission.class, false, "find_item=? ",new String[]{find_item}, null, null,null, null);
} else if(type_txt.equals("about")){
if(souce_type==1){
list=(List<Mission>)dao.select(Mission.class, false, "name=? and after like ?",new String[]{find_item,"%"+souce+"%"}, null, null,null, null);
}else if(souce_type==2){
list=(List<Mission>)dao.select(Mission.class, false, "name=? and before like ?",new String[]{find_item,"%"+souce+"%"}, null, null,null, null);
}
}else if(type_txt.equals("item")){
list=(List<Mission>)dao.select(Mission.class, false, "id=?",new String[]{find_item}, null, null,null, null);
}else if(type_txt.equals("word")){
list=(List<Mission>)dao.select(Mission.class, false, "name=? or name=?",new String[]{find_item,tw_name}, null, null,null, null);
}else if(type_txt.equals("link")){
list=(List<Mission>)dao.select(Mission.class, false, "name=?",new String[]{find_item}, null, null,null, null);
}
else if(!StringUtil.isNull(type_txt)){
list=(List<Mission>)dao.select(Mission.class, false, "find_item=? and type=?",new String[]{find_item,type_txt}, null, null,null, null);
}
if(list.size()>0){
if(list.size()==1){
type.setText(list.get(0).getType()+"");
name.setText(list.get(0).getName()+"");
detail_list.setAdapter(new MissionDetailsAdapter(list.get(0), this));
}else{
if(list.size()>index){
type.setText(list.get(index).getType()+"");
name.setText(list.get(index).getName()+"");
detail_list.setAdapter(new MissionDetailsAdapter(list.get(index), this));
}else{
type.setText(list.get(list.size()-1).getType()+"");
name.setText(list.get(list.size()-1).getName()+"");
detail_list.setAdapter(new MissionDetailsAdapter(list.get(list.size()-1), this));
}
}
}else{
txt.setVisibility(View.VISIBLE);
}
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:initMenu();break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.mission_connect, menu);
return true;
}
}
```
DataSelectUtil.java
```package com.key.doltool.util.db;
import java.util.List;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.data.sqlite.Verion;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.ViewUtil;
import com.the9tcat.hadi.DefaultDAO;
/**
* 数据库指定查询方法，使用多处
* **/
public class DataSelectUtil {
public static String getSkillPicByName(String name,DefaultDAO dao){
List<?> list=dao.select(Skill.class, false,"name=?", new String[]{name},
null, null, null,null);
if(list.size()>0){
Skill item=(Skill)list.get(0);
return FileManager.SKILL+item.getPic_id();
}
return "";
}
//返回当前版本
public static int dbVerion(DefaultDAO dao){
Verion v=(Verion)dao.select(Verion.class, false, "verion>?",new String[]{"0"}, null, null,null, null).get(0);
return v.verion;
}
public static Verion UpdateTime(DefaultDAO dao){
return (Verion)dao.select(Verion.class, false, "verion>?",new String[]{"0"}, null, null,null, null).get(0);
}
public static String getTradePicByName(String name,DefaultDAO dao){
List<?> list=dao.select(TradeItem.class, false, "name=?",new String[]{name}, null, null, null, null);
if(list.size()>0){
TradeItem item=(TradeItem)list.get(0);
return FileManager.TRADE+item.getPic_id();
}else{
return "";
}
}
public static String getTrovePicByName(String name,DefaultDAO dao){
List<?> list=dao.select(Trove.class, false, "name=?",new String[]{name}, null, null, null, null);
if(list.size()>0){
Trove item=(Trove)list.get(0);
return item.getPic_id();
}else{
return "";
}
}
public static String getRecipePicByName(String name,DefaultDAO dao){
List<?> list=dao.select(TradeItem.class, false, "name=?",new String[]{name}, null, null, null, null);
if(list.size()>0){
TradeItem item=(TradeItem)list.get(0);
return FileManager.TRADE+item.getPic_id();
}
// list=dao.select(EquipItem.class, false, "name=?",new String[]{name}, null, null, null, null);
// if(list.size()>0){
// EquipItem item=(EquipItem)list.get(0);
// return item.toString();
// }
// list=dao.select(UseItem.class, false, "name=?",new String[]{name}, null, null, null, null);
// if(list.size()>0){
// UseItem item=(UseItem)list.get(0);
// return item.toString();
// }
return FileManager.ITEM+ViewUtil.MD5(name);
}
}
```
AutoAdapterHelper.java
```package com.key.doltool.app.util;
import com.key.doltool.adapter.AutoTextViewAdapter;
/**
* 自动填充事件
* Created by Administrator on 2016/12/15.
*/
public class AutoAdapterHelper {
private static final String[] AUTO_EMAILS = {"@163.com", "@sina.com", "@qq.com", "@126.com", "@gmail.com", "@apple.com"};
public void autoAddEmails(AutoTextViewAdapter adapter_email,String input) {
String autoEmail;
if (input.length() > 0) {
for (String AUTO_EMAIL : AUTO_EMAILS) {
if (input.contains("@")) {//包含“@”则开始过滤
String filter = input.substring(input.indexOf("@") + 1, input.length());//获取过滤器，即根据输入“@”之后的内容过滤出符合条件的邮箱
System.out.println("filter-->" + filter);
if (AUTO_EMAIL.contains(filter)) {//符合过滤条件
autoEmail = input.substring(0, input.indexOf("@")) + AUTO_EMAIL;//用户输入“@”之前的内容加上自动填充的内容即为最后的结果
adapter_email.mList.add(autoEmail);
}
} else {
autoEmail = input + AUTO_EMAIL;
adapter_email.mList.add(autoEmail);
}
}
}
}
}
```
RegisterActivity.java
```package com.key.doltool.activity.person;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.text.Editable;
import android.text.TextWatcher;
import android.util.Log;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemSelectedListener;
import android.widget.ArrayAdapter;
import android.widget.AutoCompleteTextView;
import android.widget.EditText;
import android.widget.Spinner;
import com.google.android.material.textfield.TextInputLayout;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.core.MainActivity;
import com.key.doltool.adapter.AutoTextViewAdapter;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.UserEvent;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVUser;
import cn.leancloud.callback.SignUpCallback;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
public class RegisterActivity extends BaseActivity{
//注册
@BindView(R.id.password) EditText password_register;
@BindView(R.id.password_repeat) EditText password_repeat;
@BindView(R.id.emailWrapper)
TextInputLayout usernameWrapper;
@BindView(R.id.passwordWrapper) TextInputLayout passwordWrapper;
@BindView(R.id.password_repeatWrapper) TextInputLayout password_repeatWrapper;
@BindView(R.id.nickWrapper) TextInputLayout nickWrapper;
@BindView(R.id.email) AutoCompleteTextView email;
@BindView(R.id.nick) EditText nickName;
@BindView(R.id.area) Spinner area;
@BindView(R.id.server) Spinner server;
@BindView(R.id.login) FlatButton login;
private AutoTextViewAdapter adapter_email;
private Dialog dialog;
@Override
public int getContentViewId() {
return R.layout.login_register;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
flag=false;
initToolBar(null);
toolbar.setTitle("注册");
}
private void findView(){
dialog=new DialogEvent().itemDialog(this,"注册中");
usernameWrapper.setHint("登录邮箱");
passwordWrapper.setHint("登录密码");
password_repeatWrapper.setHint("重复密码");
nickWrapper.setHint("昵称(非必填)");
adapter_email = new AutoTextViewAdapter(this);
email.setAdapter(adapter_email);
email.setThreshold(1);//输入1个字符时就开始检测，默认为2个
email.addTextChangedListener(watcher);//监听autoview的变化
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(RegisterActivity.this,UserEvent.AREA,1);
area.setAdapter(adapter);
area.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(RegisterActivity.this, UserEvent.HOST[arg2],1);
server.setAdapter(adapter);
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
login.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(judge()){
signUp();
}
}
});
}
//判断
private boolean judge(){
if(password_register.getText().toString().equals("")){
Toast.makeText(getApplicationContext(),"密码不能为空",Toast.LENGTH_SHORT).show();
return false;
}
if(!password_repeat.getText().toString().equals(password_register.getText().toString())){
Toast.makeText(getApplicationContext(),"两次输入的密码不一致",Toast.LENGTH_SHORT).show();
return false;
}
if(email.getText().toString().equals("")){
Toast.makeText(getApplicationContext(),"邮箱不能为空",Toast.LENGTH_SHORT).show();
return false;
}
return true;
}
//注册
public void signUp(){
String server_name = area.getSelectedItemPosition() + "-" + server.getSelectedItemPosition();
Log.i("tag",""+ server_name);
AVUser user = new AVUser();
user.setUsername(email.getText().toString());
user.setPassword(password_register.getText().toString());
user.setEmail(email.getText().toString());
if(!nickName.getText().toString().trim().equals("")){
user.put("nickName", nickName.getText().toString().trim());
}
user.put("server", server_name);
user.signUpInBackground().subscribe(new Observer<AVUser>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVUser avUser) {
dialog.dismiss();
Toast.makeText(getApplicationContext(),"注册成功",Toast.LENGTH_LONG).show();
Intent intent = new Intent(RegisterActivity.this,MainActivity.class);
setResult(RESULT_OK, intent);
finish();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"注册失败",Toast.LENGTH_SHORT).show();
dialog.dismiss();
}
@Override
public void onComplete() {
}
});
}
private TextWatcher watcher=new TextWatcher() {
@Override
public void beforeTextChanged(CharSequence s, int start, int count, int after) {
}
@Override
public void onTextChanged(CharSequence s, int start, int before, int count) {
}
@Override
public void afterTextChanged(Editable s) {
String input = s.toString();
adapter_email.mList.clear();
adapter_email.getAutoAdapterHelper().autoAddEmails(adapter_email,input);
adapter_email.notifyDataSetChanged();
email.showDropDown();
}
};
}
```
Deck.java
```package com.key.doltool.data.parse;
import cn.leancloud.AVObject;
import cn.leancloud.annotation.AVClassName;
@AVClassName("CardShare")
public class Deck extends AVObject {
public Deck(){
super();
}
// 名称
public String getName() {
return getString("name");
}
public void setName(String name) {
put("name",name);
}
//价值
public int getValue() {
return getInt("value");
}
public void setValue(int value) {
put("value",value);
}
//id,id,id（卡片列表）
public String getCard_list() {
return getString("cardList");
}
public void setCard_list(String card_list) {
put("cardList",card_list);
}
//限制类型
public String getLimit() {
return getString("limit");
}
public void setLimit(String limit) {
put("limit",limit);
}
//创建者
public String getUserName() {
return getString("userName");
}
public void setUserName(String userName) {
put("userName",userName);
}
}
```
NewsAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.content.Intent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.infobroad.NewsDetailActivity;
import com.key.doltool.data.NewsItem;
public class NewsAdapter extends BaseAdapter{
private static class ViewHolder{
public RelativeLayout item;
public TextView name,time;
}
private List<NewsItem> list=new ArrayList<>();
private Context context;
public NewsAdapter(List<NewsItem> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.news_item, null);
holder.name=(TextView)convertView.findViewById(R.id.item_txt);
holder.time=(TextView)convertView.findViewById(R.id.item_time);
holder.item=(RelativeLayout)convertView.findViewById(R.id.item);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getTitle());
holder.time.setText(list.get(position).getDate());
final int x=position;
holder.item.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent intent=new Intent(context,NewsDetailActivity.class);
intent.putExtra("url",list.get(x).getUrl());
context.startActivity(intent);
}
});
return convertView;
}
}
```
TradeCityItem.java
```package com.key.doltool.data;
public class TradeCityItem {
public String name;
public String price;
public String invest;
}
```
ADCListActivity.java
```package com.key.doltool.activity.adc;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.ListView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.ADCListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.event.AreaEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
public class ADCListActivity extends BaseActivity {
//定义部分
private Dialog alert;
//列表
@BindView(R.id.listview) ListView listview;
//数据temp变量
private ADCListAdapter adapter;
private ListFlowHelper<ADCInfo> listFlowHelper;
private ViewHandler viewHandler;
@Override
public int getContentViewId() {
return R.layout.card_combo_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
listFlowHelper=new ListFlowHelper<>(ADCInfo.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new ADCListAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, ADCListAdapter.SIZE);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
DialogUtil.dismiss(context,alert);
}
});
flag=false;
initToolBar(onMenuItemClick);
toolbar.setTitle(R.string.adc_title);
findView();
setListener();
listFlowHelper.getExtra(getIntent());//外部搜索链接参数处理
listFlowHelper.selectshow("0," + ADCListAdapter.SIZE);
}
//通用findView
private void findView() {
alert=new DialogEvent().showLoading(this);
initPage();
}
//通用Listener
private void setListener() {
listview.setOnItemClickListener(new OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
Intent it = new Intent(ADCListActivity.this, ADCDetailsActivity.class);
it.putExtra("id", adapter.getItem(arg2).getId() + "");
startActivity(it);
}
});
}
private void initPage() {
//初始化边缘栏
initPageItem();
}
private void initPageItem() {
listview = (ListView) findViewById(R.id.listview);
adapter = new ADCListAdapter(listFlowHelper.list, this);
ListScrollListener scrollListener = new ListScrollListener(alert, viewHandler, context);
listFlowHelper.setListScrollListener(scrollListener);
listview.setOnScrollListener(scrollListener);
listview.setAdapter(adapter);
}
private void jump() {
View xc = getLayoutInflater().inflate(R.layout.select_adc, null);
ViewUtil.popADCDialog(listFlowHelper,context,xc);
}
private void findObject() {
new AreaEvent().showADCCityDialog(listFlowHelper,context);
}
//系统按键监听覆写
public boolean onKeyDown(int keyCode, KeyEvent event) {
//按键返回
if (listFlowHelper.isChange()) {
super.onKeyDown(keyCode, event);
} else {
//按键返回
if (keyCode == KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:
findObject();
break;
case R.id.type_search:
jump();
break;
}
return true;
}
};
@Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.adc_menu, menu);
return true;
}
}
```
PartListFragment.java
```package com.key.doltool.activity.dockyard;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.adapter.PartListAdapter;
import com.key.doltool.adapter.SailBoatListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.sqlite.Part;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
import io.reactivex.Observable;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
/**
*
* Created by Administrator on 2016/12/16.
*/
public class PartListFragment extends BaseFragment {
@BindView(R.id.listview)ListView listview;
private PartListAdapter adapter;
private ListFlowHelper<Part> listFlowHelper;
private ViewHandler viewHandler;
private Dialog alert;
private Disposable subscription;
public int getContentViewId() {
return R.layout.dockyard_main_item_layout1;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initData();
setListener();
}
@Override
public void onDestroyView() {
super.onDestroyView();
RxBusEvent.get().unregister(RxBusEvent.SAILMENU);
if(subscription!=null){
subscription.dispose();
}
}
private void initData(){
Observable<MenuItem> menuItemObservable = RxBusEvent.get().register(RxBusEvent.SAILMENU);
subscription=menuItemObservable.subscribe(new Consumer<MenuItem>() {
@Override
public void accept(MenuItem item) {
if(item.index==2){
findObject();
}
}
});
//初始化流程
listFlowHelper=new ListFlowHelper<>(Part.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new PartListAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, SailBoatListAdapter.SIZE);
//基本设置
alert=new DialogEvent().showLoading(context);
DialogUtil.show(context,alert);
if(listFlowHelper.list.size()==0){
new Thread(mTasks).start();
}else{
DialogUtil.dismiss(context,alert);
}
}
private void setListener(){
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
listFlowHelper.change();
DialogUtil.dismiss(context,alert);
}
});
ListScrollListener listScrollListener = new ListScrollListener(alert, viewHandler, context);
adapter=new PartListAdapter(listFlowHelper.list,getActivity());
listview.setOnScrollListener(listScrollListener);
listFlowHelper.setListScrollListener(listScrollListener);
listview.setAdapter(adapter);
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int position,
long arg3) {
Intent intent=new Intent(getActivity(),PartActivity.class);
intent.putExtra("id",adapter.getItem(position).getId());
startActivity(intent);
}
});
}
private void findObject(){
//弹出对话框
LayoutInflater mInflater=getActivity().getLayoutInflater();
ViewUtil.popPartDialog(listFlowHelper,context,mInflater.inflate(R.layout.select_part, null));
}
@Override
public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {
inflater.inflate(R.menu.main, menu);
super.onCreateOptionsMenu(menu, inflater);
}
@Override
public boolean onKeyDown(int keyCode, KeyEvent event) {
//菜单键覆写，调用边缘栏菜单
if(keyCode==KeyEvent.KEYCODE_MENU){
return true;
}
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
return false;
}else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Runnable mTasks =new Runnable(){
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message1 = new Message();
message1.what = 1;
viewHandler.sendMessage(message1);
}
};
}
```
TradeItemFragment.java
```package com.key.doltool.activity.trade;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.Menu;
import android.view.MenuInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemClickListener;
import android.widget.GridView;
import androidx.appcompat.widget.Toolbar;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.core.BaseFragmentActivity;
import com.key.doltool.adapter.TradeListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.sqlite.TradeItem;
import com.key.doltool.event.AreaEvent;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class TradeItemFragment extends BaseFragment{
//定义部分
@BindView(R.id.listview) GridView listview;
//数据temp变量
private Dialog alert;
private TradeListAdapter adapter;
private ViewHandler viewHandler;
private ListFlowHelper<TradeItem> listFlowHelper;
@Override
public int getContentViewId() {
return R.layout.trade_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
if(listFlowHelper.list.size()==0){
new Thread(mTasks).start();
}else{
DialogUtil.dismiss(context,alert);
}
}
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setHasOptionsMenu(true);
}
private Runnable mTasks =new Runnable(){
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message = new Message();
message.what = 0;
viewHandler.sendMessage(message);
}
};
//通用findView
private void findView() {
//基本设置
alert=new DialogEvent().showLoading(context);
DialogUtil.show(context,alert);
listFlowHelper=new ListFlowHelper<>(TradeItem.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new TradeListAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, TradeListAdapter.SIZE);
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what){
case 0:
listFlowHelper.change(true);
break;
case 1:
listFlowHelper.change();
break;
}
DialogUtil.dismiss(context,alert);
}
});
initPage();
}
//通用Listener
private void setListener() {
BaseFragmentActivity a=(BaseFragmentActivity)getActivity();
a.toolbar.setOnMenuItemClickListener(onMenuItemClick);
listview.setOnItemClickListener(new OnItemClickListener() {
@Override
public void onItemClick(AdapterView<?> arg0, View arg1, int arg2,
long arg3) {
Intent it = new Intent(getActivity(), TradeDetailActivity.class);
it.putExtra("id", adapter.getItem(arg2).getId()+"");
startActivity(it);
}
});
}
private void initPage(){
initPageItem();
}
private void initPageItem(){
adapter=new TradeListAdapter(listFlowHelper.list,getActivity());
ListScrollListener scrollListener = new ListScrollListener(alert,viewHandler,context);
listFlowHelper.setListScrollListener(scrollListener);
listview.setOnScrollListener(scrollListener);
listview.setAdapter(adapter);
}
private void jump(){
View xc=getActivity().getLayoutInflater().inflate(R.layout.select_trade, null);
ViewUtil.popTradeDialog(listFlowHelper,getActivity(),xc);
}
private void findObject(){
DefaultDAO dao=SRPUtil.getDAO(context);
new AreaEvent().showCityDialog(getActivity(),dao);
}
//系统按键监听覆写
@Override
public boolean onKeyDown(int keyCode, KeyEvent event) {
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
return false;
}
//其他
else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Toolbar.OnMenuItemClickListener onMenuItemClick = new Toolbar.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(android.view.MenuItem menuItem) {
switch (menuItem.getItemId()) {
case R.id.city_search:findObject();break;
case R.id.type_search:jump();break;
}
return true;
}
};
@Override
public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {
inflater.inflate(R.menu.adc_menu, menu);
super.onCreateOptionsMenu(menu, inflater);
}
}```
SailBoatListFragment.java
```package com.key.doltool.activity.dockyard;
import android.app.Dialog;
import android.content.Intent;
import android.os.Bundle;
import android.os.Message;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ListView;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.adapter.SailBoatListAdapter;
import com.key.doltool.app.util.DialogUtil;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.app.util.ListScrollListener;
import com.key.doltool.app.util.ViewHandler;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.SailBoat;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.rx.RxBusEvent;
import com.key.doltool.util.ViewUtil;
import com.key.doltool.view.Toast;
import butterknife.BindView;
import io.reactivex.Observable;
import io.reactivex.disposables.Disposable;
import io.reactivex.functions.Consumer;
/**
* 船只列表界面
* Created by Administrator on 2016/12/16.
*/
public class SailBoatListFragment extends BaseFragment{
@BindView(R.id.listview)ListView listview;
private SailBoatListAdapter adapter;
private ViewHandler viewHandler;
private Dialog alert;
private ListFlowHelper<SailBoat> listFlowHelper;
private Disposable subscription;
public int getContentViewId() {
return R.layout.dockyard_main_item_layout1;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initData();
setListener();
}
private void initData(){
Observable<MenuItem> menuItemObservable = RxBusEvent.get().register(RxBusEvent.SAILMENU);
subscription=menuItemObservable.subscribe(new Consumer<MenuItem>() {
@Override
public void accept(MenuItem item) {
if(item.index==0){
findObject();
}
}
});
//初始化流程
String order = "name desc";
listFlowHelper=new ListFlowHelper<>(SailBoat.class, context, new ListFlowHelper.ListFlowCallBack() {
@Override
public void showSelectToast(String msg) {
Toast.makeText(context.getApplicationContext(),msg,Toast.LENGTH_LONG).show();
}
@Override
public void setAdapter() {
adapter=new SailBoatListAdapter(listFlowHelper.list,context);
listview.setAdapter(adapter);
}
@Override
public void updateAdapter() {
adapter.notifyDataSetChanged();
}
}, SailBoatListAdapter.SIZE, order);
//基本设置
alert=new DialogEvent().showLoading(context);
DialogUtil.show(context,alert);
if(listFlowHelper.list.size()==0){
new Thread(mTasks).start();
}else{
DialogUtil.dismiss(context,alert);
}
}
private void setListener(){
viewHandler=new ViewHandler(new ViewHandler.ViewCallBack() {
@Override
public void onHandleMessage(Message msg) {
switch (msg.what){
case 0:
listFlowHelper.change(true);
break;
case 1:
listFlowHelper.change();
break;
}
DialogUtil.dismiss(context,alert);
}
});
ListScrollListener listScrollListener = new ListScrollListener(alert,viewHandler,context);
adapter=new SailBoatListAdapter(listFlowHelper.list,getActivity());
listview.setAdapter(adapter);
listview.setOnScrollListener(listScrollListener);
listFlowHelper.setListScrollListener(listScrollListener);
listview.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> arg0, View arg1, int position,
long arg3) {
Intent intent=new Intent(getActivity(),SailBoatActivity.class);
intent.putExtra("id",adapter.getItem(position).getId());
startActivity(intent);
}
});
listview.setOnItemLongClickListener(new AdapterView.OnItemLongClickListener() {
public boolean onItemLongClick(AdapterView<?> arg0, View arg1,
int position, long arg3) {
Toast.makeText(context.getApplicationContext(),"挑选为造船白板", Toast.LENGTH_SHORT).show();
RxBusEvent.get().post(RxBusEvent.SAILBOAT,adapter.getItem(position));
return true;
}
});
}
private void findObject(){
//弹出对话框
LayoutInflater mInflater=getActivity().getLayoutInflater();
ViewUtil.popSailBoatDialog(listFlowHelper,getActivity(),mInflater.inflate(R.layout.select_boat, null));
}
@Override
public void onDestroyView() {
super.onDestroyView();
subscription.dispose();
RxBusEvent.get().unregister(RxBusEvent.SAILMENU);
}
@Override
public boolean onKeyDown(int keyCode, KeyEvent event) {
//菜单键覆写，调用边缘栏菜单
if(keyCode==KeyEvent.KEYCODE_MENU){
return true;
}
//条件:当菜单未关闭且搜索条件为初始态，允许退出
if(listFlowHelper.isChange()){
return false;
}else{
//按键返回
if(keyCode==KeyEvent.KEYCODE_BACK) {
//条件不是初始状态就重置
listFlowHelper.reback();
}
}
return true;
}
private Runnable mTasks =new Runnable(){
public void run() {
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
Message message1 = new Message();
message1.what = 0;
viewHandler.sendMessage(message1);
}
};
}
```
SearchItem.java
```package com.key.doltool.data;
public class SearchItem {
public int id;
public String name;
public String add_info;
}
```
AdventureAdapter.java
```package com.key.doltool.adapter;
import java.io.IOException;
import java.util.List;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Trove_Count;
import com.key.doltool.event.UpdataCount;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
public class AdventureAdapter extends BaseAdapter{
private String[] pics={
"dol_t_hb34.jpg","dol_t_rb25.jpg","dol_t_h2i25.jpg",
"dol_t_ri10.jpg","dol_t_aw6.jpg","dol_t_mine24.jpg",
"dol_t_fossol1.jpg","dol_t_plant74.jpg","dol_t_insect1.jpg",
"dol_t_bird76.jpg","dol_t_sea107.jpg","dol_t_cs75.jpg",
"dol_t_cm19.jpg","dol_t_cb48.jpg","dol_t_port140.jpg",
"dol_t_geo1g9.jpg","dol_t_ast5.jpg",
};
private static class ViewHolder{
public TextView name;
public TextView size;
public TextView now;
public ImageView pic;
}
private List<Trove_Count> list;
private Context context;
public AdventureAdapter(List<Trove_Count> list,Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.adventure_main_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.pic=(ImageView)convertView.findViewById(R.id.img);
holder.now=(TextView)convertView.findViewById(R.id.now);
holder.size=(TextView)convertView.findViewById(R.id.size);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(UpdataCount.name_type[list.get(position).getType()-1]);
String now=list.get(position).getNow()+"";
String size=list.get(position).getSize()+"";
holder.now.setText(now);
holder.size.setText(size);
try {
holder.pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(FileManager.TROVE+pics[list.get(position).getType()-1])));
} catch (IOException e) {
holder.pic.setImageResource(R.drawable.dol_trove_defalut);
}
return convertView;
}
}```
Recipe.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Recipe")
public class Recipe {
@Column(autoincrement=true,primary=true)
//ID
private int id;
@Column(name="name")
//名称
private String name;
@Column(name="need")
//需求
private String need;
@Column(name="result")
//结果
private String result_number;
@Column(name="parent_name")
//父书籍名称
private String parent_name;
@Column(name="level_need")
//技能需求
private String level_need;
@Column(name="other")
//其他消费
private String other;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getNeed() {
return need;
}
public void setNeed(String need) {
this.need = need;
}
public String getResult_number() {
return result_number;
}
public void setResult_number(String result_number) {
this.result_number = result_number;
}
public String getParent_name() {
return parent_name;
}
public void setParent_name(String parent_name) {
this.parent_name = parent_name;
}
public String getLevel_need() {
return level_need;
}
public void setLevel_need(String level_need) {
this.level_need = level_need;
}
public String getOther() {
return other;
}
public void setOther(String other) {
this.other = other;
}
}
```
MessagePostActivity.java
```package com.key.doltool.activity.setting;
import android.os.Bundle;
import android.view.View;
import android.widget.EditText;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.app.util.behavior.LoginBehavior;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVObject;
import cn.leancloud.callback.SaveCallback;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
public class MessagePostActivity extends BaseActivity{
@BindView(R.id.content) EditText content;
@BindView(R.id.btn) FlatButton btn;
//控制提交状态
private boolean over=false;
@Override
public int getContentViewId() {
return R.layout.system_message_layout;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
setListener();
}
private void setListener(){
btn.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
if(!over){
over=true;
postMessage(content.getText().toString().trim());
}
}
});
}
private boolean check(){
if(content.getText().toString().trim().equals("")){
//信息不为空
Toast.makeText(getApplicationContext(), "信息不能为空", Toast.LENGTH_SHORT).show();
return false;
}
return true;
}
private void clear(){
content.setText("");
}
//发信息给作者
private void postMessage(String content){
if(check()){
LoginBehavior loginBehavior=new LoginBehavior();
String name=loginBehavior.getUserName();
if(name==null){
name="游客";
}
AVObject message=new AVObject("CommonWord");
message.put("username",name);
message.put("word", content);
message.saveInBackground().subscribe(new Observer<AVObject>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVObject avObject) {
Toast.makeText(getApplicationContext(),"发送成功",Toast.LENGTH_LONG).show();
clear();
}
@Override
public void onError(Throwable e) {
e.printStackTrace();
Toast.makeText(getApplicationContext(),"发送失败",Toast.LENGTH_LONG).show();
}
@Override
public void onComplete() {
}
});
}else{
over=false;
}
}
}
```
WikiInfo.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Wiki")
public class WikiInfo {
@Column(autoincrement=true,primary=true)
private int id;
@Column(name="name")
private String name;
@Column(name="sid")
private String sid;
@Column(name="url")
private String url;
@Column(name="type")
private String type;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getSid() {
return sid;
}
public void setSid(String sid) {
this.sid = sid;
}
public String getUrl() {
return url;
}
public void setUrl(String url) {
this.url = url;
}
public String getType() {
return type;
}
public void setType(String type) {
this.type = type;
}
}
```
RxCommonEvent.java
```package com.key.doltool.event.rx;
import com.key.doltool.util.ExitApplication;
import java.util.concurrent.TimeUnit;
import io.reactivex.Observable;
import io.reactivex.android.schedulers.AndroidSchedulers;
import io.reactivex.functions.Consumer;
/**
* Rx通用工具类
* Created by Administrator on 2017/2/28.
*/
public class RxCommonEvent {
public static void delayExit(){
Observable<Long> temp=Observable.interval(5, TimeUnit.SECONDS);
temp.observeOn(AndroidSchedulers.mainThread()).subscribe(new Consumer<Long>() {
@Override
public void accept(Long aLong) {
ExitApplication.getInstance().exit();
}
});
}
}
```
TroveAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.graphics.drawable.Drawable;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.RatingBar;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.imageUtil.ImageLoader;
import java.util.ArrayList;
import java.util.List;
public class TroveAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView name;
public ImageView pic;
public RatingBar rate;
public RelativeLayout main;
}
private List<Trove> list=new ArrayList<>();
private int[] itemState;
private Context context;
public TroveAdapter(List<Trove> list,Context context){
itemState=new int[list.size()];
for(int i=0;i<list.size();i++){
itemState[i]=0;
}
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Trove getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.adventure_item, null);
holder.name=(TextView)convertView.findViewById(R.id.txt);
holder.pic=(ImageView)convertView.findViewById(R.id.img);
holder.rate=(RatingBar)convertView.findViewById(R.id.star);
holder.main=(RelativeLayout)convertView.findViewById(R.id.main);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
if(list.get(position).getFind_flag()==1){
holder.name.setBackgroundColor(0xff0099cc);
}else{
holder.name.setBackgroundColor(0xffC0C0C0);
}
holder.name.setText(list.get(position).getName());
updateBackground(position, holder.main);
ImageLoader.picassoLoad(context,
FileManager.ROOT + FileManager.TROVE + list.get(position).getPic_id() + ".jpg",
holder.pic);
holder.rate.setRating(list.get(position).getRate());
return convertView;
}
@SuppressWarnings("deprecation")
public void updateBackground(int position, View view) {
int backgroundId;
if (itemState[position] == 1) {
backgroundId = R.drawable.frame_light;
} else {
backgroundId = R.drawable.frame_white;
}
Drawable background = context.getResources().getDrawable(backgroundId);
view.setBackgroundDrawable(background);
}
public void uncheckAll(){
for(int i=0;i<itemState.length;i++){
itemState[i] = 0;
}
}
public boolean isAllChecked(){
for(int i :itemState){
if(i ==0) return false;
}
return true;
}
public void checkAll(){
for(int i=0;i<itemState.length;i++){
itemState[i] = 1;
}
}
public int[] getItemState(){
return itemState;
}
public int getCheckedItemCount(){
int count = 0;
for(int i :itemState){
if(i ==1) count++;
}
return count;
}
}```
Job.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Job")
public class Job {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//说明
@Column(name="detail")
private String detail;
//类型
@Column(name="type")
private int type;
//特技
@Column(name="sp")
private String sp;
//优待技能
@Column(name="good_list")
private String good_list;
//转职条件
@Column(name="chang_if")
private String chang_if;
//转职证
@Column(name="metal")
private String metal;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getDetail() {
return detail;
}
public void setDetail(String detail) {
this.detail = detail;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public String getSp() {
return sp;
}
public void setSp(String sp) {
this.sp = sp;
}
public String getGood_list() {
return good_list;
}
public void setGood_list(String good_list) {
this.good_list = good_list;
}
public String getChang_if() {
return chang_if;
}
public void setChang_if(String chang_if) {
this.chang_if = chang_if;
}
public String getMetal() {
return metal;
}
public void setMetal(String metal) {
this.metal = metal;
}
}
```
ShipTimeAdapter.java
```package com.key.doltool.adapter;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import java.util.ArrayList;
import java.util.List;
public class ShipTimeAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView start,middle,end;
}
private List<String> list=new ArrayList<>();
private Context context;
public ShipTimeAdapter(List<String> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public String getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_time, null);
holder.start=(TextView)convertView.findViewById(R.id.start);
holder.middle=(TextView)convertView.findViewById(R.id.middle);
holder.end=(TextView)convertView.findViewById(R.id.end);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
String[] temp=list.get(position).split("w");
switch (temp[0]){
case "0":
holder.start.setText(temp[1]);
holder.middle.setText("");
holder.end.setText("");
break;
case "1":
holder.start.setText("");
holder.middle.setText(temp[1]);
holder.end.setText("");
break;
case "2":
holder.start.setText("");
holder.middle.setText("");
holder.end.setText(temp[1]);
break;
}
//设置
return convertView;
}
}
```
ViewUtil.java
```package com.key.doltool.util;
import android.app.Activity;
import android.app.Dialog;
import android.content.Context;
import android.graphics.Color;
import android.text.Spannable;
import android.text.SpannableString;
import android.text.style.AbsoluteSizeSpan;
import android.util.Log;
import android.view.Gravity;
import android.view.View;
import android.view.ViewGroup;
import android.widget.ArrayAdapter;
import android.widget.Button;
import android.widget.CheckBox;
import android.widget.EditText;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.ListView;
import android.widget.RadioButton;
import android.widget.Spinner;
import android.widget.TableLayout;
import android.widget.TableRow;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.BaseAdventureActivity;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.data.MenuItem;
import com.key.doltool.data.sqlite.Skill;
import com.key.doltool.view.range.RangeBar;
import java.io.IOException;
import java.security.MessageDigest;
import java.util.ArrayList;
import java.util.List;
/**
* 界面辅助处理工具
*
* @author key
* @version 0.1
*/
public class ViewUtil {
public static void setTextViewForPackage(String txt){
Spannable WordtoSpan = new SpannableString(txt);
if(txt.contains("-")){
int point1=txt.indexOf(".");
int point2=txt.lastIndexOf(".");
int pointmid=txt.indexOf("-");
if(point1==-1&&point2==-1){
return;
}else if(point1==point2&&point1<=pointmid){
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point1,pointmid, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),pointmid,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}else if(point1==point2&&point1>=pointmid){
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point1,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}else{
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point1,pointmid, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),pointmid,point2, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point2,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}
}else{
int point1=txt.indexOf(".");
if(point1==-1){
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point1,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
return;
}else{
WordtoSpan.setSpan(new AbsoluteSizeSpan(36),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(30),point1,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}
}
Log.e("txt",txt);
}
/**
* 设置套餐（小）文字样式
* @param textView 需要显示文字的TextView
* **/
public static void setTextViewForPackageItem(TextView textView){
String txt=textView.getText().toString();
Spannable WordtoSpan = new SpannableString(txt);
if(txt.contains("-")){
int point1=txt.indexOf(".");
int point2=txt.lastIndexOf(".");
int pointmid=txt.indexOf("-");
if(point1==-1&&point2==-1){
return;
}else if(point1==point2&&point1<=pointmid){
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(20),point1,pointmid, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),pointmid,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}else if(point1==point2&&point1>=pointmid){
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(20),point1,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}else{
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(20),point1,pointmid, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),pointmid,point2, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(20),point2,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}
}else{
int point1=txt.indexOf(".");
if(point1==-1){
return;
}else{
WordtoSpan.setSpan(new AbsoluteSizeSpan(26),0,point1, Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
WordtoSpan.setSpan(new AbsoluteSizeSpan(20),point1,txt.length(), Spannable.SPAN_EXCLUSIVE_EXCLUSIVE);
}
}
textView.setText(WordtoSpan);
}
/**
* 修改文字样式（对 10.0-20.0此种文字进行处理）
* @param txt 原始文字样式
* @return 修改后的文字样式
* **/
public static String changeTxtFormat(String txt){
String[] temp=txt.split("-");
String result="";
for (String aTemp : temp) {
String temp2[] = aTemp.split("\\.");
if(temp2.length==2){
if (temp.length == 1) {
result = temp2[0] + numberFormat("."+temp2[1]);
} else if (temp.length == 2) {
result += temp2[0] + numberFormat("."+temp2[1]) + "-";
}
}
}
if(result.endsWith("-")){
result=result.substring(0,result.length()-1);
}
return result;
}
/**
* 修改文字样式（对 10.0-20.0此种文字进行处理）
* @param txt 原始文字样式
* @return 修改后的文字样式
* **/
private static String numberFormat(String txt){
if (txt.endsWith(".0") || txt.endsWith(".00")) {
txt = txt.replace(".0","").replace(".00","");
}
return txt;
}
/**
* 船只类型处理
**/
public static String[] setDataForType(int type, int size, int way) {
String[] temp = new String[3];
if (size == 0)
temp[0] = "小型";
else if (size == 1)
temp[0] = "中型";
else
temp[0] = "大型";
if (way == 0)
temp[1] = "冒船";
else if (way == 1)
temp[1] = "商船";
else
temp[1] = "战船";
if (type == 0)
temp[2] = "帆船";
else
temp[2] = "桨船";
return temp;
}
public static void popSailBoatDialog(final ListFlowHelper listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
//第二页无弹窗
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final CheckBox s_box = (CheckBox) layout.findViewById(R.id.s_box);
final CheckBox m_box = (CheckBox) layout.findViewById(R.id.m_box);
final CheckBox l_box = (CheckBox) layout.findViewById(R.id.l_box);
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String str = name.getText().toString();
String if_str;
List<String> if_list = new ArrayList<>();
String if_args;
//不为空才修改条件
if (!str.equals("")) {
if_str = "name like ?";
if_args = "%" + str + "%";
if_list.add(if_args);
} else {
if_str = "id>?";
if_args = "0";
if_list.add(if_args);
}
NumberUtil.TEMP = NumberUtil.threeZero(s_box.isChecked(), m_box.isChecked(), l_box.isChecked());
switch (NumberUtil.TEMP) {
case 1:
if_str = if_str + " and size=?";
if_args = "2";
break;
case 2:
if_str = if_str + " and size=?";
if_args = "1";
break;
case 3:
if_str = if_str + " and size>?";
if_args = "0";
break;
case 4:
if_str = if_str + " and size=?";
if_args = "0";
break;
case 5:
if_str = if_str + " and size<>?";
if_args = "1";
break;
case 6:
if_str = if_str + " and size<>?";
if_args = "2";
break;
case 7:
if_str = if_str + " and size>?";
if_args = "-1";
break;
}
if (NumberUtil.TEMP != 0){
if_list.add(if_args);
}
listFlowHelper.change_if(if_str,if_list);
updateDialog.dismiss();
}
});
}
public static void popPartDialog(final ListFlowHelper listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final CheckBox[] t = new CheckBox[9];
int id[] = {R.id.t_0, R.id.t_3, R.id.t_1, R.id.t_4, R.id.t_2,
R.id.t_5, R.id.t_6, R.id.t_7, R.id.t_8};
for (int i = 0; i < 9; i++) {
t[i] = (CheckBox) layout.findViewById(id[i]);
}
name.setHint(R.string.hint_name2);
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String str = name.getText().toString();
String if_str;
List<String> if_list = new ArrayList<>();
String if_args;
//不为空才修改条件
if (!str.equals("")) {
if_str = "name like ?";
if_args = "%" + str + "%";
if_list.add(if_args);
} else {
if_str = "id>?";
if_args = "0";
if_list.add(if_args);
}
for (int j = 0; j < 9; j++) {
if (t[j].isChecked() && if_list.size() == 1) {
if_str += " and (type = ?";
if_args = "" + j;
if_list.add(if_args);
} else if (t[j].isChecked() && if_list.size() != 1) {
if_str += " or type = ?";
if_args = "" + j;
if_list.add(if_args);
}
if (if_list.size() > 1 && j == 8) {
if_str += ")";
}
}
listFlowHelper.change_if(if_str, if_list);
updateDialog.dismiss();
}
});
}
/**
* For PopDialog Common
**/
public static void popDialog(final BaseAdventureActivity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
activity.select_txt = name.getText().toString().trim();
activity.select(name.getText().toString().trim());
updateDialog.dismiss();
}
});
}
/**
* For PopDialog Common
**/
public static void popCardDialog(final BaseAdventureActivity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final Spinner type = (Spinner) layout.findViewById(R.id.type);
final TextView number = (TextView) layout.findViewById(R.id.min_point);
final RangeBar bar = (RangeBar) layout.findViewById(R.id.rangebar1);
final EditText name = (EditText) layout.findViewById(R.id.card_name);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
bar.setOnRangeBarChangeListener(new RangeBar.OnRangeBarChangeListener() {
@Override
public void onIndexChangeListener(RangeBar rangeBar, int leftThumbIndex, int rightThumbIndex) {
number.setText(leftThumbIndex + "-" + rightThumbIndex);
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
activity.select_txt = type.getSelectedItem() + "~" +
name.getText().toString().trim() + "~" + number.getText().toString();
activity.select(activity.select_txt);
updateDialog.dismiss();
}
});
}
/**
* For PopDialog Common
**/
public static void popCardDialog(final ListFlowHelper listFlowHelper,final Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.card_type));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 0) {
if (type.getSelectedItemPosition() == 1) {
if (select_if.equals("")) {
select_if += "effect like ?";
} else {
select_if += "and effect like ?";
}
String if_s = "%" + "点数+" + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
} else {
if (select_if.equals("")) {
select_if += "effect like ?";
} else {
select_if += "and effect like ?";
}
String if_s = "%" + type.getSelectedItem().toString() + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
}
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
}
public static void popTradeDialog(final ListFlowHelper listFlowHelper, final Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.trade_type));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 1000) {
if (select_if.equals("")) {
select_if += "type like ?";
} else {
select_if += "and type like ?";
}
String if_s = "%" + type.getSelectedItem().toString() + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
}
public static void popWikiDialog(final ListFlowHelper listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.trade_type));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 1000) {
if (select_if.equals("")) {
select_if += "type like ?";
} else {
select_if += "and type like ?";
}
String if_s = "%" + type.getSelectedItem().toString() + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
}
public static void popJobDialog(final ListFlowHelper listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.adc_type_txt));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 1000) {
if (select_if.equals("")) {
select_if += "type like ?";
} else {
select_if += "and type like ?";
}
String if_s = "%" + type.getSelectedItem().toString() + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
}
public static void popADCDialog(final ListFlowHelper listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final RadioButton box_m = (RadioButton) layout.findViewById(R.id.sex_box1);
final RadioButton box_w = (RadioButton) layout.findViewById(R.id.sex_box2);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if = "";
List<String> select_args = new ArrayList<>();
if (box_m.isChecked()) {
select_if = "sex = ? ";
select_args.add(box_m.getText().toString());
} else if (box_w.isChecked()) {
select_if = "sex = ? ";
select_args.add(box_w.getText().toString());
}
if (type.getSelectedItemId() != 1000 && type.getSelectedItemId() != 0) {
if (select_if.equals("")) {
select_if += "type = ?";
} else {
select_if += "and type = ?";
}
String if_s = type.getSelectedItemId() + "";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
public static void popSkillDialog(final ListFlowHelper<Skill> listFlowHelper,Activity activity, View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.skill_type));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 100) {
if (select_if.equals("")) {
select_if += "type = ?";
} else {
select_if += "and type = ?";
}
String if_s = (type.getSelectedItemPosition() + 1) + "";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
public static void popNPCDialog(final ListFlowHelper listFlowHelper,Activity activity,View layout) {
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity) - 30,
LayoutParams.MATCH_PARENT);
params.setMargins(10, 10, 10, 10);
updateDialog.setContentView(layout, params);
updateDialog.show();
final EditText name = (EditText) layout.findViewById(R.id.boat_name);
final Spinner type = (Spinner) layout.findViewById(R.id.type);
ArrayAdapter<String> adapter = new SpinnerArrayAdapter(activity
, ResourcesUtil.getArray(activity, R.array.back_type));
type.setAdapter(adapter);
final Button positive = (Button) layout.findViewById(R.id.btn_confirm);
final Button negative = (Button) layout.findViewById(R.id.btn_cancel);
positive.setText("搜索");
positive.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String select_if;
List<String> select_args = new ArrayList<>();
if (!name.getText().toString().trim().equals("")) {
select_if = "name like ? ";
select_args.add("%" + name.getText().toString().trim() + "%");
} else {
select_if = "id>?";
select_args.add("0");
}
if (type.getSelectedItemPosition() != 100) {
if (select_if.equals("")) {
select_if += "love_type like ?";
} else {
select_if += "and love_type like ?";
}
String if_s = "%" + type.getSelectedItem().toString() + "%";
Log.i("s", if_s + "");
select_args.add(if_s);
}
listFlowHelper.change_if(select_if, select_args);
updateDialog.dismiss();
}
});
negative.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
/**
* 遍历布局，并控制所有子控件可控与否
*
* @param viewGroup 布局对象
* @param flag 启用与否
*/
public static void disableSubControls(ViewGroup viewGroup, boolean flag) {
for (int i = 0; i < viewGroup.getChildCount(); i++) {
View v = viewGroup.getChildAt(i);
v.setEnabled(flag);
if (v instanceof ViewGroup) {
if (v instanceof Spinner) {
Spinner spinner = (Spinner) v;
spinner.setClickable(flag);
spinner.setEnabled(flag);
} else if (v instanceof ListView) {
v.setClickable(flag);
v.setEnabled(flag);
} else {
disableSubControls((ViewGroup) v, flag);
}
} else if (v instanceof EditText) {
v.setEnabled(flag);
v.setClickable(flag);
} else if (v instanceof Button) {
v.setEnabled(flag);
} else {
v.setEnabled(flag);
}
}
}
/**
* 根据技能数量生成布局
**/
public static void fill_boat_detail(final Activity context, List<MenuItem> ab, TableLayout father) {
int y = 0;
int x;
int dip_10 = DensityUtil.dip2px(context, 10);
int dip_5 = DensityUtil.dip2px(context, 5);
if (ab.size() <= 3)
x = ab.size();
else
x = 3;
for (int i = 0; i < ab.size(); i = i + 3) {
TableRow row = new TableRow(context);
row.setLayoutParams(new ViewGroup.LayoutParams(ViewGroup.LayoutParams.MATCH_PARENT, ViewGroup.LayoutParams.WRAP_CONTENT));
row.setWeightSum(3);
row.setPadding(dip_10, dip_10, dip_10, dip_10);
for (int j = y; j < x; j++) {
final String number = ab.get(j).name;
LinearLayout item = new LinearLayout(context);
item.setLayoutParams(new TableRow.LayoutParams(0, TableRow.LayoutParams.MATCH_PARENT, 1.0f));
item.setGravity(Gravity.CENTER);
item.setOrientation(LinearLayout.VERTICAL);
ImageView img = new ImageView(context);
img.setLayoutParams(new ViewGroup.LayoutParams(ViewGroup.LayoutParams.WRAP_CONTENT, ViewGroup.LayoutParams.WRAP_CONTENT));
try {
img.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(ab.get(j).pic + ".png")));
} catch (IOException e) {
e.printStackTrace();
img.setImageResource(R.drawable.item_defalut);
}
img.setPadding(dip_5, dip_5, dip_5, dip_5);
TextView txt = new TextView(context);
txt.setText(ab.get(j).name);
txt.setTextColor(Color.WHITE);
txt.setTextSize(12);
txt.setPadding(dip_5, 0, dip_5, dip_5);
txt.setLayoutParams(new ViewGroup.LayoutParams(ViewGroup.LayoutParams.WRAP_CONTENT, ViewGroup.LayoutParams.WRAP_CONTENT));
item.addView(img);
item.addView(txt);
item.setBackgroundResource(R.drawable.theme_blue_btn);
// item.setOnClickListener(new View.OnClickListener() {
// public void onClick(View v) {
// Intent it=new Intent(context,AbilityForBoatDetailActivity.class);
// it.putExtra("name",number);
// context.startActivity(it);
// }
// });
row.addView(item);
}
y += 3;
x += 3;
if (x > ab.size())
x = ab.size();
father.addView(row);
}
}
public static void setImageView(ImageView view, String name, Context context) {
try {
view.setImageBitmap(BitMapUtil.getBitmapByInputStream(context.getAssets().open(FileManager.ITEM + MD5(name) + ".png")));
} catch (IOException e) {
view.setImageResource(R.drawable.item_defalut);
}
}
public static String MD5(String plainText) {
StringBuilder buf = new StringBuilder("");
try {
MessageDigest md = MessageDigest.getInstance("MD5");
md.update(plainText.getBytes("UTF-8"));
byte b[] = md.digest();
int i;
for (byte aB : b) {
i = aB;
if (i < 0) {
i += 256;
}
if (i < 16) {
buf.append("0");
}
buf.append(Integer.toHexString(i));
}
return buf.toString().substring(8, 24);
} catch (Exception e) {
e.printStackTrace();
}
return buf.toString();
}
}```
ADCSkillListAdapter.java
```package com.key.doltool.adapter;
import java.util.ArrayList;
import java.util.List;
import android.content.Context;
import android.content.Intent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.ImageView;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.ability.AbilityForNormalDetailActivity;
import com.key.doltool.adapter.util.AdapterUtil;
import com.key.doltool.data.ADCSkill;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
public class ADCSkillListAdapter extends BaseAdapter{
private static class ViewHolder{
public ViewGroup item;
public TextView name;
public ImageView pic;
public TextView need;
}
private List<ADCSkill> list=new ArrayList<>();
private Context context;
private DefaultDAO dao;
private AdapterUtil util;
public ADCSkillListAdapter(List<ADCSkill> list,Context context){
this.list=list;
this.context=context;
dao=SRPUtil.getDAO(context);
util=new AdapterUtil(context, dao);
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.adc_simpleskill_item, null);
holder.name=(TextView)convertView.findViewById(R.id.name);
holder.pic=(ImageView)convertView.findViewById(R.id.pic);
holder.need=(TextView)convertView.findViewById(R.id.need);
holder.item=(ViewGroup)convertView.findViewById(R.id.item);
// 为view设置标签
convertView.setTag(holder);
}
else {
// 取出holder
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.name.setText(list.get(position).getName());
util.findByName(holder.pic,list.get(position).getName(),1);
holder.need.setText(list.get(position).getNeed().replaceAll(" ", ""));
//新增技能跳转:
final int number=position;
holder.item.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it=new Intent(context,AbilityForNormalDetailActivity.class);
it.putExtra("name", list.get(number).getName());
context.startActivity(it);
}
});
return convertView;
}
}```
WebMainActivity.java
```package com.key.doltool.activity.wiki;
import android.annotation.SuppressLint;
import android.os.Bundle;
import android.webkit.WebChromeClient;
import android.webkit.WebResourceRequest;
import android.webkit.WebSettings;
import android.webkit.WebView;
import android.webkit.WebViewClient;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.event.WebEvent;
import com.key.doltool.util.FileManager;
import butterknife.BindView;
/**
* WIKI详情页面（web方式）
* @author key
* @version 0.4
* time 2013-1-2
*/
public class WebMainActivity extends BaseActivity {
@BindView(R.id.content) WebView web_content;
@Override
public int getContentViewId() {
return R.layout.news_detail;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
flag=false;
initToolBar(null);
init();
}
//获取数据，填充显示
@SuppressLint({"SetJavaScriptEnabled", "AddJavascriptInterface"})
private void init(){
String url= null;
if (getIntent() != null) {
url = getIntent().getStringExtra("url");
String title=getIntent().getStringExtra("title");
toolbar.setTitle(title);
}
web_content.getSettings().setJavaScriptEnabled(true);
web_content.getSettings().setUseWideViewPort(true);
web_content.getSettings().setCacheMode(WebSettings.LOAD_DEFAULT);
web_content.getSettings().setDomStorageEnabled(true);
web_content.getSettings().setJavaScriptCanOpenWindowsAutomatically(true);
web_content.getSettings().setBlockNetworkImage(false);
web_content.getSettings().setSupportZoom(true);
web_content.getSettings().setAppCacheEnabled(false);
web_content.setWebViewClient(new WebViewClient() {
public boolean shouldOverrideUrlLoading(WebView view,WebResourceRequest request) {
return false;// false 显示frameset, true 不显示Frameset
}
});
web_content.setWebChromeClient(new WebChromeClient() {
});
web_content.loadUrl(FileManager.WIKI + url);
web_content.addJavascriptInterface(new WebEvent(this), "jump");
}
//缓存清空
@Override
public void onDestroy() {
super.onDestroy();
web_content.clearCache(false);
}
}```
ResourcesUtil.java
```package com.key.doltool.util;
import android.app.Activity;
import android.content.Context;
import android.content.res.ColorStateList;
import android.content.res.Resources;
import android.graphics.drawable.Drawable;
import android.os.Build;
import androidx.annotation.ArrayRes;
import com.key.doltool.R;
import java.io.ByteArrayOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
@SuppressWarnings("deprecation")
public class ResourcesUtil {
/**通过R.color去拿颜色**/
public static ColorStateList getColor(int colorId,Context context){
Resources r=context.getResources();
if (android.os.Build.VERSION.SDK_INT< Build.VERSION_CODES.M) {
return r.getColorStateList(colorId);
}else {
return r.getColorStateList(colorId,null);
}
}
public static int getColorId(int colorId,Context context){
Resources r=context.getResources();
if (android.os.Build.VERSION.SDK_INT< Build.VERSION_CODES.M) {
return r.getColor(colorId);
}else {
return r.getColor(colorId, null);
}
}
/**通过R.drawable去拿图片**/
public static Drawable getDrawable(String name,Context context){
int id = context.getResources().getIdentifier(
name == null ? "no_picture" : name, "drawable",
"com.key.doltool .");
Drawable image;
if (id <= 0) {
image = context.getResources().getDrawable(R.drawable.ic_add_white_24dp);
} else {
image = context.getResources().getDrawable(id);
}
return image;
}
/**通过R.array去拿数组**/
public static String[] getArray(Activity context,@ArrayRes int arrayId)
{
Resources res =context.getResources();
return res.getStringArray(arrayId);
}
public static int getInt(Activity context,int id)
{
Resources res =context.getResources();
return res.getInteger(id);
}
public static byte[] getHtmlByAsset(Context context,String url){
ByteArrayOutputStream outputStream = new ByteArrayOutputStream(1024);
InputStream inputStream = null;
try {
inputStream=context.getAssets().open(url);
int len;
byte[] buffer = new byte[1024];
while((len = inputStream.read(buffer)) != -1){
outputStream.write(buffer, 0, len);
}
} catch (IOException e) {
e.printStackTrace();
return null;
}
finally{
try {
if(inputStream!=null) {
outputStream.close();
inputStream.close();
}
} catch (IOException e) {
e.printStackTrace();
}
}
return outputStream.toByteArray();
}
public static byte[] getBytes(String filePath){
byte[] buffer = null;
try {
File file = new File(filePath);
FileInputStream fis = new FileInputStream(file);
ByteArrayOutputStream bos = new ByteArrayOutputStream(1000);
byte[] b = new byte[1000];
int n;
while ((n = fis.read(b)) != -1) {
bos.write(b, 0, n);
}
fis.close();
bos.close();
buffer = bos.toByteArray();
} catch (IOException e) {
e.printStackTrace();
}
return buffer;
}
}
```
TradeCityDetailActivity.java
```package com.key.doltool.activity.trade;
import java.io.IOException;
import java.util.List;
import android.os.Bundle;
import android.view.View;
import android.widget.ImageView;
import android.widget.LinearLayout;
import android.widget.ListView;
import android.widget.RelativeLayout;
import android.widget.TextView;
import com.google.gson.Gson;
import com.google.gson.reflect.TypeToken;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.adapter.TradeSimpleListAdapter;
import com.key.doltool.data.sqlite.City;
import com.key.doltool.data.TradeCityItem;
import com.key.doltool.util.BitMapUtil;
import com.key.doltool.util.FileManager;
import com.key.doltool.util.StringUtil;
import com.key.doltool.util.db.DataSelectUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import butterknife.BindView;
public class TradeCityDetailActivity extends BaseActivity{
@BindView(R.id.listview) ListView listview;
@BindView(R.id.city_img) ImageView pic;
@BindView(R.id.city_name) TextView city_name;
@BindView(R.id.city_area) TextView city_area;
@BindView(R.id.city_culture) TextView city_culture;
@BindView(R.id.inverst) RelativeLayout inverst;
@BindView(R.id.inverst_money) TextView inverst_money;
@BindView(R.id.inverst_item) TextView inverst_item;
@BindView(R.id.lang1) LinearLayout lang1;
@BindView(R.id.lang2) LinearLayout lang2;
@BindView(R.id.lang_txt1) TextView lang_txt1;
@BindView(R.id.lang_txt2) TextView lang_txt2;
@BindView(R.id.lang_pic1) ImageView lang_pic1;
@BindView(R.id.lang_pic2) ImageView lang_pic2;
private String name="";
private String tw_name="";
private String pic_id="";
private City item;
private DefaultDAO dao;
private Gson gson;
private List<TradeCityItem> list;
private String id;
@Override
public int getContentViewId() {
return R.layout.trade_city_list;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
initToolBar(null);
dao=SRPUtil.getDAO(context);
gson=new Gson();
name=getIntent().getStringExtra("city_name");
tw_name=getIntent().getStringExtra("tw_name");
id=getIntent().getStringExtra("id");
init();
setListener();
}
private void setListener(){
try {
pic.setImageBitmap(BitMapUtil.getBitmapByInputStream(this.getAssets().open(FileManager.TROVE+pic_id+".jpg")));
} catch (IOException e) {
e.printStackTrace();
}
city_name.setText(item.getName());
city_area.setText(item.getArea());
city_culture.setText(item.getCulture());
if(item.getInvest().equals("")){
inverst.setVisibility(View.GONE);
}else{
String[] temp=item.getInvest().split(" ");
inverst_money.setText(temp[1]);
inverst_item.setText(temp[0]);
}
String[] temp_lang=item.getLang().split(",");
if(temp_lang.length<1){
lang1.setVisibility(View.GONE);
}else{
lang_txt1.setText(temp_lang[0]);
try {
lang_pic1.setImageBitmap(BitMapUtil.getBitmapByInputStream(this.getAssets().open(DataSelectUtil.getSkillPicByName(temp_lang[0], dao)+".png")));
} catch (IOException e) {
e.printStackTrace();
}
}
if(temp_lang.length<2){
lang2.setVisibility(View.GONE);
}else{
lang_txt2.setText(temp_lang[1]);
try {
lang_pic2.setImageBitmap(BitMapUtil.getBitmapByInputStream(this.getAssets().open(DataSelectUtil.getSkillPicByName(temp_lang[1], dao)+".png")));
} catch (IOException e) {
e.printStackTrace();
}
}
list=gson.fromJson(item.getTrade_list(), new TypeToken<List<TradeCityItem>>(){}.getType());
listview.setAdapter(new TradeSimpleListAdapter(list, this));
}
private void init(){
if(StringUtil.isNull(id)){
if(StringUtil.isNull(tw_name)){
item=(City)dao.select(City.class,false,"name=?",new String[]{name}, null, null, null, null).get(0);
}else{
item=(City)dao.select(City.class,false,"name=? or name=?",new String[]{name,tw_name}, null, null, null, null).get(0);
}
pic_id=DataSelectUtil.getTrovePicByName(item.getName(), dao);
}else{
item=(City)dao.select(City.class,false,"id=?",new String[]{id}, null, null, null, null).get(0);
pic_id=DataSelectUtil.getTrovePicByName(item.getName(), dao);
}
}
}
```
Book.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Book")
public class Book {
@Column(autoincrement=true,primary=true)
//id
private int id;
//名称
@Column(name="name")
private String name;
//类型
@Column(name="type")
private int type;
//技能范围
@Column(name="range")
private String range;
//获取方式
@Column(name="get_way")
private String get_way;
//类型描述
@Column(name="desc_type")
private String desc_type;
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public String getRange() {
return range+"";
}
public void setRange(String range) {
this.range = range;
}
public String getGet_way() {
return get_way;
}
public void setGet_way(String get_way) {
this.get_way = get_way;
}
public String getDesc_type() {
return desc_type;
}
public void setDesc_type(String desc_type) {
this.desc_type = desc_type;
}
}
```
NameValueAdapter.java
```package com.key.doltool.adapter.item;
import android.content.Context;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import android.widget.BaseAdapter;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.data.base.NameValueItem;
import java.util.ArrayList;
import java.util.List;
public class NameValueAdapter extends BaseAdapter{
private static class ViewHolder{
public TextView add_txt;
}
private List<NameValueItem> list=new ArrayList<>();
private Context context;
public NameValueAdapter(List<NameValueItem> list, Context context){
this.list=list;
this.context=context;
}
public int getCount() {
return list.size();
}
@Override
public Object getItem(int arg0) {
return list.get(arg0);
}
@Override
public long getItemId(int position) {
return position;
}
@Override
public View getView(int position, View convertView, ViewGroup parent) {
final ViewHolder holder;
if (convertView == null) {
// 获得ViewHolder对象
holder = new ViewHolder();
// 导入布局并赋值给convertView
LayoutInflater mInflater = LayoutInflater.from(context);
convertView = mInflater.inflate(R.layout.item_add,null);
holder.add_txt=(TextView)convertView.findViewById(R.id.add_txt);
// 为view设置标签
convertView.setTag(holder);
}else {
holder = (ViewHolder) convertView.getTag();
}
//设置
holder.add_txt.setText(list.get(position).name+"+"+list.get(position).value);
return convertView;
}
}
```
SearchActivity.java
```package com.key.doltool.activity.search;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ArrayAdapter;
import android.widget.EditText;
import android.widget.ListView;
import androidx.appcompat.widget.AppCompatSpinner;
import com.jakewharton.rxbinding4.widget.RxTextView;
import com.jakewharton.rxbinding4.widget.TextViewTextChangeEvent;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.adc.ADCDetailsActivity;
import com.key.doltool.activity.adventure.AdventureDetailActivity;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.activity.recipe.RecipeForBookDetailsActivity;
import com.key.doltool.activity.trade.TradeCityDetailActivity;
import com.key.doltool.activity.useitem.UseItemActivity;
import com.key.doltool.adapter.SimpleSearchAdapter;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.data.SearchItem;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.data.sqlite.Book;
import com.key.doltool.data.sqlite.City;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.data.sqlite.WordItem;
import com.key.doltool.event.TradeEvent;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.TimeUnit;
import butterknife.BindView;
import io.reactivex.rxjava3.android.schedulers.AndroidSchedulers;
import io.reactivex.rxjava3.annotations.NonNull;
import io.reactivex.rxjava3.core.Observable;
import io.reactivex.rxjava3.core.ObservableSource;
import io.reactivex.rxjava3.core.Observer;
import io.reactivex.rxjava3.disposables.Disposable;
import io.reactivex.rxjava3.functions.Function;
import io.reactivex.rxjava3.functions.Predicate;
/**
* 快速查询界面
* **/
public class SearchActivity extends BaseActivity{
@BindView(R.id.search) EditText search_txt;
@BindView(R.id.content_list) ListView content_list;
@BindView(R.id.type)
AppCompatSpinner type;
private DefaultDAO dao;
private List<SearchItem> list;
private int index=0;
private SimpleSearchAdapter simpleSearchAdapter;
@Override
public int getContentViewId() {
return R.layout.activity_search;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
init();
setListener();
}
private void init(){
dao=SRPUtil.getDAO(getApplicationContext());
}
private void setListener(){
RxTextView.textChangeEvents(search_txt)
.debounce(600, TimeUnit.MILLISECONDS)
.filter(new Predicate<TextViewTextChangeEvent>() {
@Override
public boolean test(TextViewTextChangeEvent textViewTextChangeEvent) {
return search_txt.getText().toString().trim().length()>=2;
}
}).switchMap(new Function<TextViewTextChangeEvent, ObservableSource<List<SearchItem>>>() {
@Override
public ObservableSource<List<SearchItem>> apply(TextViewTextChangeEvent textViewTextChangeEvent) {
return getListBySelect();
}
}).observeOn(AndroidSchedulers.mainThread())
.subscribe(new Observer<List<SearchItem>>() {
@Override
public void onSubscribe(@NonNull Disposable d) {
}
@Override
public void onNext(@NonNull List<SearchItem> searchItems) {
list=searchItems;
simpleSearchAdapter = new SimpleSearchAdapter(context, list);
content_list.setAdapter(simpleSearchAdapter);
}
@Override
public void onError(@NonNull Throwable e) {
}
@Override
public void onComplete() {
}
});
content_list.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> parent, View view,
int position, long id) {
jump(index, list.get(position).id);
}
});
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(this,ResourcesUtil.getArray(this,R.array.search_list),2);
type.setAdapter(adapter);
type.setOnItemSelectedListener(new AdapterView.OnItemSelectedListener() {
@Override
public void onItemSelected(AdapterView<?> adapterView, View view, int i, long l) {
setIndex(i);
if (list != null) {
list.clear();
simpleSearchAdapter.notifyDataSetChanged();
}
}
@Override
public void onNothingSelected(AdapterView<?> adapterView) {
}
});
}
private void jump(int index,int id){
Class<?> c;
Intent it=null;
switch(index){
case 0:
c=MissionDetailsActivity.class;
it=new Intent(this,c);
it.putExtra("find_item",id+"");
it.putExtra("type","item");
break;
case 1:
c=AdventureDetailActivity.class;
it=new Intent(this,c);
it.putExtra("id",id+"");
break;
case 2:
c=ADCDetailsActivity.class;
it=new Intent(this,c);
it.putExtra("id",id+"");
break;
case 3:
c=RecipeForBookDetailsActivity.class;
it=new Intent(this,c);
it.putExtra("id",id+"");
break;
case 4:
c=TradeCityDetailActivity.class;
it=new Intent(this,c);
it.putExtra("id",id+"");
break;
case 5:
c=UseItemActivity.class;
it=new Intent(this,c);
it.putExtra("id",id+"");
break;
}
startActivity(it);
}
private Observable<List<SearchItem>> getListBySelect(){
List<SearchItem> result=new ArrayList<>();
Class<?> souces;
switch(index){
case 0:souces=Mission.class;break;
case 1:souces=Trove.class;break;
case 2:souces=ADCInfo.class;break;
case 3:souces=Book.class;break;
case 4:souces=City.class;break;
case 5:souces=UseItem.class;break;
default:souces=City.class;break;
}
String search_str="%" + search_txt.getText().toString().trim() + "%";
List<WordItem> wordList=SRPUtil.getInstance(getApplicationContext()).select
(WordItem.class, false, "zh_name like ? or tw_name like ?", new String[]{search_str, search_str}, null, null, null, null);
List<?> temp;
if(wordList.size()!=0){
temp=dao.select(souces,false,"name like ? or name = ? or name = ?",new String[]{search_str,wordList.get(0).tw_name,wordList.get(0).zh_name}, null, null, null, null);
}else{
temp=dao.select(souces, false,"name like ?", new String[]{search_str}, null, null, null, null);
}
for(int i=0;i<temp.size();i++){
result.add(getNameByType(temp.get(i),index));
}
return Observable.just(result);
}
private SearchItem getNameByType(Object obj,int type){
SearchItem result=new SearchItem();
switch(type){
case 0:
Mission a=(Mission)obj;
result.name=a.getName();
result.id=a.getId();
result.add_info=a.getFind_item();
break;
case 1:
Trove b=(Trove)obj;
result.name=b.getName();
result.id=b.getId();
result.add_info=b.getType();
break;
case 2:
ADCInfo c=(ADCInfo)obj;
result.name=c.getName();
result.id=c.getId();
result.add_info=c.getCity();
break;
case 3:
Book d=(Book)obj;
result.name=d.getName();
result.id=d.getId();
String temp3=new TradeEvent(this).getRecipeTypeByIndex(d.getType());
result.add_info=temp3+":"+d.getRange();
break;
case 4:
City e=(City)obj;
result.name=e.getName();
result.id=e.getId();
result.add_info=e.getArea();
break;
case 5:
UseItem f=(UseItem)obj;
result.name=f.name;
result.id=f.id;
result.add_info=f.type.split(",")[0];
break;
}
return result;
}
public void setIndex(int number){
index=number;
}
}
```
AreaEvent.java
```package com.key.doltool.event;
import android.app.Activity;
import android.app.Dialog;
import android.content.Intent;
import android.view.Gravity;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.AdapterView.OnItemSelectedListener;
import android.widget.ArrayAdapter;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.Spinner;
import android.widget.TextView;
import com.key.doltool.R;
import com.key.doltool.activity.trade.TradeCityDetailActivity;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.app.util.ListFlowHelper;
import com.key.doltool.data.sqlite.City;
import com.key.doltool.util.CommonUtil;
import com.key.doltool.util.StringUtil;
import com.key.doltool.view.flat.FlatButton;
import com.the9tcat.hadi.DefaultDAO;
import java.util.ArrayList;
import java.util.List;
/**地域处理事件**/
public class AreaEvent {
/**冒险区域**/
public static final String[] ADVENTURE_AREA={
"全部","北欧","西欧","东欧",
"非洲·印度","美洲","亚洲",
};
/**冒险城市**/
public static final String[][] ADVENTURE_CITY={
{},
{"伦敦","阿姆斯特丹","斯德哥尔摩","圣彼得堡"},
{"里斯本","塞维尔","马赛","热那亚","突尼斯"},
{"威尼斯","拿坡里","雅典","伊斯坦堡","亚历山大"},
{"圣乔治","开普敦","桑给巴尔","亚丁","卡利卡特"},
{"圣多明哥","波多贝罗","里约热内卢","利马","圣地牙哥","旧金山"},
{"雅加达","安平"},
};
/**书库城市**/
public static final String[][] LIB_CITY={
{},
{"伦敦","阿姆斯特丹","斯德哥尔摩","圣彼得堡"},
{"里斯本","塞维尔","马赛","热那亚","突尼斯"},
{"威尼斯","拿坡里","雅典","伊斯坦堡","亚历山大"},
{"卡利卡特"},
{"南美开拓港","利马","旧金山"},
{"东南亚开拓港","杭州","汉阳","堺市","安平"},
};
/**回报城市**/
public static final String[][] BACK_CITY={
{"全部"},
{"波尔多","南特","加莱","安特卫普","阿姆斯特丹","伦敦","汉堡","卢贝克","圣彼得堡"},
{"里斯本","塞维尔","马赛","热那亚","突尼斯","奥波多","瓦伦西亚","巴赛隆纳","比萨","的黎波里"},
{"威尼斯","拿坡里","雅典","伊斯坦堡","亚历山大","拉古萨","锡拉库萨","贝鲁特","开罗"},
{"圣乔治","索法拉","桑给巴尔","莫桑比克","荷姆兹","马斯喀特","亚丁","卡利卡特"},
{"哈瓦那","波多贝罗","维拉克鲁斯","巴伊亚","布宜诺斯艾利斯","旧金山"},
{"马尼拉","安平","长崎","汉阳","澳门"},
};
/**副官城市**/
public static final String[][] ADC_CITY={
{"全部"},
{"伦敦","阿姆斯特丹","圣彼得堡"},
{"里斯本","塞维尔","马赛","热那亚","突尼斯"},
{"威尼斯","拿坡里","雅典","伊斯坦堡","亚历山大"},
{"桑给巴尔","卡利卡特"},
{"波多贝罗","里约热内卢","利马"},
{"雅加达","杭州","安平","堺市","汉阳"},
};
public String getStringByIndex(int i){
String str="";
switch(i){
case 0:break;
case 1:break;
case 2:break;
case 3:str="沉船";break;
case 4:str="执事";break;
case 5:str="宠物";break;
case 6:str="转职";break;
case 7:str="掠夺";break;
case 8:str="海上视认";break;
}
return str;
}
public void showCityDialog(final Activity context,final DefaultDAO dao){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.enter_city, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(context)-30,
LayoutParams.WRAP_CONTENT);
params.gravity = Gravity.CENTER_HORIZONTAL;
params.setMargins(10,10,10,10);
updateDialog.setContentView(view,params);
updateDialog.show();
final Spinner sp_area=(Spinner)view.findViewById(R.id.sp_area);
final Spinner sp_city=(Spinner)view.findViewById(R.id.sp_city);
FlatButton enter=(FlatButton)view.findViewById(R.id.enter_btn);
FlatButton cancel=(FlatButton)view.findViewById(R.id.cancel_btn);
List<?> list=dao.select(City.class,false,"id>?",new String[]{"0"},"area",null, null, null);
List<String> list_area=new ArrayList<>();
for(int i=0;i<list.size();i++){
City city=(City)list.get(i);
list_area.add(city.getArea());
}
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(context, StringUtil.listToArray(list_area));
sp_area.setAdapter(adapter);
//地区-城市联动事件
sp_area.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
List<?> list = dao.select(City.class, false, "area=?", new String[]{(String) sp_area.getSelectedItem()}, null, null, null, null);
List<String> list_area = new ArrayList<>();
for (int i = 0; i < list.size(); i++) {
City city = (City) list.get(i);
list_area.add(city.getName());
}
ArrayAdapter<String> adapter = new SpinnerArrayAdapter
(context, StringUtil.listToArray(list_area));
sp_city.setAdapter(adapter);
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
enter.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
Intent it = new Intent(context, TradeCityDetailActivity.class);
it.putExtra("city_name", (String) sp_city.getSelectedItem());
context.startActivity(it);
}
});
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
public void showNPCCityDialog(final ListFlowHelper listFlowHelper,final Activity activity){
LayoutInflater layoutinflater = activity.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.enter_city, null);
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity)-30,
LayoutParams.WRAP_CONTENT);
params.gravity = Gravity.CENTER_HORIZONTAL;
params.setMargins(10,10,10,10);
updateDialog.setContentView(view,params);
updateDialog.show();
final Spinner sp_area=(Spinner)view.findViewById(R.id.sp_area);
final Spinner sp_city=(Spinner)view.findViewById(R.id.sp_city);
FlatButton enter=(FlatButton)view.findViewById(R.id.enter_btn);
FlatButton cancel=(FlatButton)view.findViewById(R.id.cancel_btn);
TextView title=(TextView)view.findViewById(R.id.title_txt);
title.setText("回报地点搜索");
enter.setText("搜索");
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(activity,ADVENTURE_AREA);
sp_area.setAdapter(adapter);
//地区-城市联动事件
sp_area.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(activity,BACK_CITY[arg2]);
sp_city.setAdapter(adapter);
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
enter.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String temp = (String) sp_city.getSelectedItem();
if (!temp.equals("全部")) {
listFlowHelper.change_if("city=?", (String) sp_city.getSelectedItem());
} else {
listFlowHelper.change_if("id>?", "0");
}
updateDialog.dismiss();
}
});
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
public void showADCCityDialog(final ListFlowHelper listFlowHelper,final Activity activity){
LayoutInflater layoutinflater = activity.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.enter_city, null);
final Dialog updateDialog = new Dialog(activity, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(CommonUtil.getScreenWidth(activity)-30,
LayoutParams.WRAP_CONTENT);
params.gravity = Gravity.CENTER_HORIZONTAL;
params.setMargins(10,10,10,10);
updateDialog.setContentView(view,params);
updateDialog.show();
final Spinner sp_area=(Spinner)view.findViewById(R.id.sp_area);
final Spinner sp_city=(Spinner)view.findViewById(R.id.sp_city);
FlatButton enter=(FlatButton)view.findViewById(R.id.enter_btn);
FlatButton cancel=(FlatButton)view.findViewById(R.id.cancel_btn);
TextView title=(TextView)view.findViewById(R.id.title_txt);
title.setText("副官城市搜索");
enter.setText("搜索");
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(activity,ADVENTURE_AREA);
sp_area.setAdapter(adapter);
//地区-城市联动事件
sp_area.setOnItemSelectedListener(new OnItemSelectedListener() {
public void onItemSelected(AdapterView<?> arg0, View arg1,
int arg2, long arg3) {
ArrayAdapter<String> adapter=new SpinnerArrayAdapter
(activity,ADC_CITY[arg2]);
sp_city.setAdapter(adapter);
}
public void onNothingSelected(AdapterView<?> arg0) {
}
});
enter.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
String temp = (String) sp_city.getSelectedItem();
if (!temp.equals("全部")) {
listFlowHelper.change_if("city like ?", "%" + sp_city.getSelectedItem() + "%");
} else {
listFlowHelper.change_if("id>?", "0");
}
updateDialog.dismiss();
}
});
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
updateDialog.dismiss();
}
});
}
}
```
SettingMainFragment.java
```package com.key.doltool.activity.setting;
import android.os.Bundle;
import android.view.View;
import android.widget.CompoundButton;
import android.widget.CompoundButton.OnCheckedChangeListener;
import android.widget.RelativeLayout;
import android.widget.TextView;
import androidx.appcompat.widget.SwitchCompat;
import com.key.doltool.R;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.data.SystemInfo;
import com.key.doltool.event.DialogEvent;
import com.key.doltool.event.app.VersionManager;
import com.key.doltool.util.CommonUtil;
import butterknife.BindView;
public class SettingMainFragment extends BaseFragment{
@BindView(R.id.function_2) RelativeLayout layout2;
@BindView(R.id.function_3) RelativeLayout layout3;
@BindView(R.id.checkbox) SwitchCompat check_box;
@BindView(R.id.func_2_txt) TextView func_2_txt;
@Override
public int getContentViewId() {
return R.layout.setting_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
VersionManager.getInstance().setActivity(getActivity());
}
private void findView(){
func_2_txt.setText("当前应用的版本:"+CommonUtil.getAppVersionName(getActivity()));
}
private void setListener(){
final SystemInfo info=new SystemInfo(getActivity());
if(info.getUpdateFlag()==1){
check_box.setChecked(true);
}else{
check_box.setChecked(false);
}
check_box.setOnCheckedChangeListener(new OnCheckedChangeListener(){
public void onCheckedChanged(CompoundButton buttonView,
boolean isChecked) {
if(isChecked){
info.setUpdateFlag(1);
}else{
info.setUpdateFlag(0);
}
}
});
layout2.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
VersionManager.getInstance().checkVersion(true);
}
});
layout3.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
new DialogEvent().materialDialog(0,"退出","确认是否要退出？",getActivity(),0);
}
});
}
}
```
PushTradeActivity.java
```package com.key.doltool.activity.squre.business;
import android.os.Bundle;
import com.key.doltool.activity.BaseActivity;
/**
* 发布交易信息
* **/
public class PushTradeActivity extends BaseActivity {
@Override
public int getContentViewId() {
return 0;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
}
}
```
SearchFragment.java
```package com.key.doltool.activity.search;
import android.content.Intent;
import android.os.Bundle;
import android.view.View;
import android.widget.AdapterView;
import android.widget.ArrayAdapter;
import android.widget.EditText;
import android.widget.ListView;
import androidx.appcompat.widget.AppCompatSpinner;
import com.jakewharton.rxbinding4.widget.RxTextView;
import com.jakewharton.rxbinding4.widget.TextViewTextChangeEvent;
import com.key.doltool.R;
import com.key.doltool.activity.adc.ADCDetailsActivity;
import com.key.doltool.activity.adventure.AdventureDetailActivity;
import com.key.doltool.activity.core.BaseFragment;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.activity.recipe.RecipeForBookDetailsActivity;
import com.key.doltool.activity.trade.TradeCityDetailActivity;
import com.key.doltool.activity.useitem.UseItemActivity;
import com.key.doltool.adapter.SimpleSearchAdapter;
import com.key.doltool.adapter.SpinnerArrayAdapter;
import com.key.doltool.data.SearchItem;
import com.key.doltool.data.item.UseItem;
import com.key.doltool.data.sqlite.ADCInfo;
import com.key.doltool.data.sqlite.Book;
import com.key.doltool.data.sqlite.City;
import com.key.doltool.data.sqlite.Mission;
import com.key.doltool.data.sqlite.Trove;
import com.key.doltool.data.sqlite.WordItem;
import com.key.doltool.event.TradeEvent;
import com.key.doltool.util.ResourcesUtil;
import com.key.doltool.util.db.SRPUtil;
import com.the9tcat.hadi.DefaultDAO;
import org.reactivestreams.Subscription;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.TimeUnit;
import butterknife.BindView;
import io.reactivex.rxjava3.android.schedulers.AndroidSchedulers;
import io.reactivex.rxjava3.annotations.NonNull;
import io.reactivex.rxjava3.core.Observable;
import io.reactivex.rxjava3.core.ObservableSource;
import io.reactivex.rxjava3.core.Observer;
import io.reactivex.rxjava3.disposables.Disposable;
import io.reactivex.rxjava3.functions.Function;
import io.reactivex.rxjava3.functions.Predicate;
/**
* 快速查询界面
**/
public class SearchFragment extends BaseFragment {
private DefaultDAO dao;
private List<SearchItem> list;
@BindView(R.id.search)
EditText search_txt;
@BindView(R.id.content_list)
ListView content_list;
@BindView(R.id.type)
AppCompatSpinner type;
private int index = 0;
private SimpleSearchAdapter simpleSearchAdapter;
@Override
public int getContentViewId() {
return R.layout.search_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
dao = SRPUtil.getDAO(getActivity());
setListener();
}
private void setListener() {
RxTextView.textChangeEvents(search_txt)
.debounce(600, TimeUnit.MILLISECONDS)
.filter(new Predicate<TextViewTextChangeEvent>() {
@Override
public boolean test(TextViewTextChangeEvent textViewTextChangeEvent) {
return search_txt.getText().toString().trim().length()>=2;
}
}).switchMap(new Function<TextViewTextChangeEvent, ObservableSource<List<SearchItem>>>() {
@Override
public ObservableSource<List<SearchItem>> apply(TextViewTextChangeEvent textViewTextChangeEvent) {
return getListBySelect();
}
}).observeOn(AndroidSchedulers.mainThread())
.subscribe(new Observer<List<SearchItem>>() {
@Override
public void onSubscribe(@NonNull Disposable d) {
}
@Override
public void onNext(@NonNull List<SearchItem> searchItems) {
list=searchItems;
simpleSearchAdapter = new SimpleSearchAdapter(context, list);
content_list.setAdapter(simpleSearchAdapter);
}
@Override
public void onError(@NonNull Throwable e) {
}
@Override
public void onComplete() {
}
});
content_list.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> parent, View view,
int position, long id) {
jump(index, list.get(position).id);
}
});
ArrayAdapter<String> adapter = new SpinnerArrayAdapter
(context, ResourcesUtil.getArray(getActivity(), R.array.search_list), 2);
type.setAdapter(adapter);
type.setOnItemSelectedListener(new AdapterView.OnItemSelectedListener() {
@Override
public void onItemSelected(AdapterView<?> adapterView, View view, int i, long l) {
setIndex(i);
if (list != null) {
list.clear();
simpleSearchAdapter.notifyDataSetChanged();
}
}
@Override
public void onNothingSelected(AdapterView<?> adapterView) {
}
});
}
private void jump(int index, int id) {
Class<?> c;
Intent it = null;
switch (index) {
case 0:
c = MissionDetailsActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("find_item", id + "");
it.putExtra("type", "item");
break;
case 1:
c = AdventureDetailActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("id", id + "");
break;
case 2:
c = ADCDetailsActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("id", id + "");
break;
case 3:
c = RecipeForBookDetailsActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("id", id + "");
break;
case 4:
c = TradeCityDetailActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("id", id + "");
break;
case 5:
c = UseItemActivity.class;
it = new Intent(getActivity(), c);
it.putExtra("id", id + "");
break;
}
startActivity(it);
}
private Observable<List<SearchItem>> getListBySelect() {
List<SearchItem> result = new ArrayList<>();
Class<?> souces;
switch (index) {
case 0:
souces = Mission.class;
break;
case 1:
souces = Trove.class;
break;
case 2:
souces = ADCInfo.class;
break;
case 3:
souces = Book.class;
break;
case 4:
souces = City.class;
break;
case 5:
souces = UseItem.class;
break;
default:
souces = City.class;
break;
}
String search_str = "%" + search_txt.getText().toString().trim() + "%";
List<WordItem> wordList = SRPUtil.getInstance(getActivity()).select
(WordItem.class, false, "zh_name like ? or tw_name like ?", new String[]{search_str, search_str}, null, null, null, null);
List<?> temp;
if (wordList.size() != 0) {
temp = dao.select(souces, false, "name like ? or name = ? or name = ?", new String[]{search_str, wordList.get(0).tw_name, wordList.get(0).zh_name}, null, null, null, null);
} else {
temp = dao.select(souces, false, "name like ?", new String[]{search_str}, null, null, null, null);
}
for (int i = 0; i < temp.size(); i++) {
result.add(getNameByType(temp.get(i), index));
}
return Observable.just(result);
}
private SearchItem getNameByType(Object obj, int type) {
SearchItem result = new SearchItem();
switch (type) {
case 0:
Mission a = (Mission) obj;
result.name = a.getName();
result.id = a.getId();
result.add_info = a.getFind_item();
break;
case 1:
Trove b = (Trove) obj;
result.name = b.getName();
result.id = b.getId();
result.add_info = b.getType();
break;
case 2:
ADCInfo c = (ADCInfo) obj;
result.name = c.getName();
result.id = c.getId();
result.add_info = c.getCity();
break;
case 3:
Book d = (Book) obj;
result.name = d.getName();
result.id = d.getId();
String temp3 = new TradeEvent(getActivity()).getRecipeTypeByIndex(d.getType());
result.add_info = temp3 + ":" + d.getRange();
break;
case 4:
City e = (City) obj;
result.name = e.getName();
result.id = e.getId();
result.add_info = e.getArea();
break;
case 5:
UseItem f = (UseItem) obj;
result.name = f.name;
result.id = f.id;
result.add_info = f.type.split(",")[0];
break;
}
return result;
}
public void setIndex(int number) {
index = number;
}
}
```
WordListActivity.java
```package com.key.doltool.activity.help;
import android.animation.Animator;
import android.app.Dialog;
import android.content.DialogInterface;
import android.content.Intent;
import android.os.Bundle;
import android.view.LayoutInflater;
import android.view.View;
import android.widget.AdapterView;
import android.widget.EditText;
import android.widget.LinearLayout;
import android.widget.LinearLayout.LayoutParams;
import android.widget.ListView;
import com.google.android.material.floatingactionbutton.FloatingActionButton;
import com.key.doltool.R;
import com.key.doltool.activity.BaseActivity;
import com.key.doltool.activity.adventure.AdventureDetailActivity;
import com.key.doltool.activity.mission.MissionDetailsActivity;
import com.key.doltool.activity.trade.TradeCityDetailActivity;
import com.key.doltool.activity.trade.TradeDetailActivity;
import com.key.doltool.adapter.item.WordAdapter;
import com.key.doltool.anime.MyAnimations;
import com.key.doltool.data.sqlite.WordItem;
import com.key.doltool.util.db.SRPUtil;
import com.key.doltool.view.Toast;
import com.key.doltool.view.flat.FlatButton;
import java.util.ArrayList;
import java.util.List;
import butterknife.BindView;
import cn.leancloud.AVException;
import cn.leancloud.AVObject;
import io.reactivex.Observer;
import io.reactivex.disposables.Disposable;
public class WordListActivity extends BaseActivity{
private List<WordItem> list=new ArrayList<>();
@BindView(R.id.listView) ListView listView;
@BindView(R.id.action)
FloatingActionButton action;
@Override
public int getContentViewId() {
return R.layout.help_word_main;
}
@Override
protected void initAllMembersView(Bundle savedInstanceState) {
findView();
setListener();
flag=false;
initToolBar(null);
toolbar.setTitle("航海单词表");
}
private void findView(){
list=SRPUtil.getInstance(getApplicationContext()).
select(WordItem.class, false, "id>?", new String[]{"0"}, null, null, null, null);
listView.setAdapter(new WordAdapter(list, context));
listView.setOnItemClickListener(new AdapterView.OnItemClickListener() {
public void onItemClick(AdapterView<?> parent, View view,
int position, long id) {
jump(list.get(position).zh_name,
list.get(position).tw_name,list.get(position).type);
}
});
}
private void jump(String name,String tw_name,String type){
Class<?> c;
Intent it=null;
if(type.equals("交易品")){
c=TradeDetailActivity.class;
it=new Intent(this,c);
it.putExtra("name",name);
it.putExtra("tw_name",tw_name);
}
if(type.equals("城市")){
c=TradeCityDetailActivity.class;
it=new Intent(this,c);
it.putExtra("city_name",name);
it.putExtra("tw_name",tw_name);
}
if(type.equals("发现物")){
c=AdventureDetailActivity.class;
it=new Intent(this,c);
it.putExtra("name",name);
it.putExtra("tw_name",tw_name);
}
if(type.equals("任务")){
c=MissionDetailsActivity.class;
it=new Intent(this,c);
it.putExtra("find_item",name);
it.putExtra("tw_name",tw_name);
it.putExtra("type","word");
}
startActivity(it);
}
private void setListener(){
action.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
MyAnimations.wordAnime(context,action,330,listener);
}
});
}
private Animator.AnimatorListener listener=new Animator.AnimatorListener(){
@Override
public void onAnimationStart(Animator animator) {
}
@Override
public void onAnimationEnd(Animator animator) {
showDialog();
}
@Override
public void onAnimationCancel(Animator animator) {
}
@Override
public void onAnimationRepeat(Animator animator) {
}
};
public void showDialog(){
LayoutInflater layoutinflater = context.getLayoutInflater();
View view = layoutinflater.inflate(R.layout.panel_material_word_dialog, null);
final Dialog updateDialog = new Dialog(context, R.style.updateDialog);
updateDialog.setCancelable(true);
updateDialog.setCanceledOnTouchOutside(true);
LinearLayout.LayoutParams params = new LinearLayout.LayoutParams(LayoutParams.MATCH_PARENT,
LayoutParams.MATCH_PARENT);
params.setMargins(10,10,10,10);
updateDialog.getWindow().setWindowAnimations(R.style.dialog_up);
updateDialog.setContentView(view,params);
final EditText zh=(EditText)view.findViewById(R.id.zh);
final EditText tw=(EditText)view.findViewById(R.id.tw);
final FlatButton confrim=(FlatButton)view.findViewById(R.id.confrim);
final FlatButton cancel=(FlatButton)view.findViewById(R.id.cancel);
confrim.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
addWordByParse(zh.getText().toString().trim(),
tw.getText().toString().trim());
updateDialog.dismiss();
}
});
cancel.setOnClickListener(new View.OnClickListener() {
public void onClick(View v) {
updateDialog.dismiss();
}
});
updateDialog.setOnDismissListener(new DialogInterface.OnDismissListener(){
public void onDismiss(DialogInterface dialog) {
MyAnimations.wordAnime2(context,action,330);
}
});
updateDialog.show();
}
private void addWordByParse(String zh_name,String tw_name){
AVObject word=new AVObject("WordBack");
word.put("zh_name",zh_name);
word.put("tw_name",tw_name);
word.saveInBackground().subscribe(new Observer<AVObject>() {
@Override
public void onSubscribe(Disposable d) {
}
@Override
public void onNext(AVObject avObject) {
Toast.makeText(getApplicationContext(),"感谢您对单词表的维护，下次更新即可看到您录入的单词",Toast.LENGTH_SHORT).show();
}
@Override
public void onError(Throwable e) {
Toast.makeText(getApplicationContext(),"网络异常",Toast.LENGTH_SHORT).show();
}
@Override
public void onComplete() {
}
});
}
}
```
BaseFragment.java
```package com.key.doltool.activity.core;
import android.app.Activity;
import android.os.Bundle;
import androidx.annotation.Nullable;
import android.view.KeyEvent;
import android.view.LayoutInflater;
import android.view.View;
import android.view.ViewGroup;
import androidx.fragment.app.Fragment;
import butterknife.ButterKnife;
import butterknife.Unbinder;
public abstract class BaseFragment extends Fragment {
public abstract int getContentViewId();
protected Activity context;
protected View mRootView;
private Unbinder unbinder;
@Override
public View onCreateView(LayoutInflater inflater, @Nullable ViewGroup container, @Nullable Bundle savedInstanceState) {
mRootView =inflater.inflate(getContentViewId(),container,false);
unbinder=ButterKnife.bind(this,mRootView);
this.context = getActivity();
initAllMembersView(savedInstanceState);
return mRootView;
}
protected abstract void initAllMembersView(Bundle savedInstanceState);
@Override
public void onDestroyView() {
super.onDestroyView();
unbinder.unbind();
}
public boolean onKeyDown(int keyCode, KeyEvent event) {
return false;
}
}
```
BaseAdventureActivity.java
```package com.key.doltool.activity;
import android.view.View;
import com.key.doltool.R;
import com.key.doltool.util.ViewUtil;
/**
* BaseActivity
* @author key
* @version 0.2
*/
public abstract class BaseAdventureActivity extends BaseActivity{
public String select_txt="";
public void popWindow(){
//对话框显示，输入返回搜索条件
View xc=getLayoutInflater().inflate(R.layout.select_trove, null);
ViewUtil.popDialog(this,xc);
}
public void select(String select){
select_txt=select;
}
}
```
Trove_Count.java
```package com.key.doltool.data.sqlite;
import com.the9tcat.hadi.annotation.Column;
import com.the9tcat.hadi.annotation.Table;
@Table(name="Trove_Count")
//发现物统计
public class Trove_Count {
@Column(name="size")
private int size;
@Column(name="type")
private int type;
@Column(name="now")
private int now;
public int getSize() {
return size;
}
public void setSize(int size) {
this.size = size;
}
public int getType() {
return type;
}
public void setType(int type) {
this.type = type;
}
public int getNow() {
return now;
}
public void setNow(int now) {
this.now = now;
}
}
```
|
zzy3382410/XCZX
|
zzy3382410/XCZX
ExceptionCast.java
```package com.xuecheng.framework.exception;
import com.xuecheng.framework.model.response.ResultCode;
/**
* @program: XcEduCode
* @description: 异常抛出类
* @author: zzy
* @create: 2019-06-01 11:16
**/
public class ExceptionCast {
//使用此静态方法抛出自定义异常
public static void cast(ResultCode resultCode){
throw new CustomException(resultCode);
}
}
```
CmsConfigRepository.java
```package com.xczx.cms.dao;
import com.xuecheng.framework.domain.cms.CmsConfig;
import org.springframework.data.mongodb.repository.MongoRepository;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-05-17 22:57
**/
public interface CmsConfigRepository extends MongoRepository<CmsConfig,String> {
}
```
PageService.java
```package com.xczx.cms.service;
import com.xuecheng.framework.domain.cms.CmsPage;
import com.xuecheng.framework.domain.cms.request.QueryPageRequest;
import com.xuecheng.framework.domain.cms.response.CmsPageResult;
import com.xuecheng.framework.model.response.QueryResponseResult;
import com.xuecheng.framework.model.response.ResponseResult;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-05-18 15:44
**/
public interface PageService {
QueryResponseResult findList(int page, int size , QueryPageRequest queryPageRequest);
CmsPageResult add(CmsPage cmsPage);
CmsPage findById(String id);
CmsPageResult update(String id, CmsPage cmsPage);
ResponseResult delete(String id);
}
```
CmsConfigService.java
```package com.xczx.cms.service;
import com.xuecheng.framework.domain.cms.CmsConfig;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-08-17 14:19
**/
public interface CmsConfigService {
public CmsConfig getConfigById(String id);
}
```
CmsConfigServiceImpl.java
```package com.xczx.cms.service.impl;
import com.xczx.cms.dao.CmsConfigRepository;
import com.xczx.cms.service.CmsConfigService;
import com.xuecheng.framework.domain.cms.CmsConfig;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Service;
import java.util.Optional;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-08-17 14:20
**/
@Service("cmsConfigService")
public class CmsConfigServiceImpl implements CmsConfigService {
@Autowired
CmsConfigRepository cmsConfigRepository;
@Override
public CmsConfig getConfigById(String id) {
Optional<CmsConfig> optional = cmsConfigRepository.findById(id);
if (optional.isPresent()){
CmsConfig cmsConfig = optional.get();
return cmsConfig;
}
return null;
}
}
```
PageServiceImpl.java
```package com.xczx.cms.service.impl;
import com.xczx.cms.dao.CmsPageRepository;
import com.xczx.cms.service.PageService;
import com.xuecheng.framework.domain.cms.CmsPage;
import com.xuecheng.framework.domain.cms.request.QueryPageRequest;
import com.xuecheng.framework.domain.cms.response.CmsCode;
import com.xuecheng.framework.domain.cms.response.CmsPageResult;
import com.xuecheng.framework.exception.ExceptionCast;
import com.xuecheng.framework.model.response.CommonCode;
import com.xuecheng.framework.model.response.QueryResponseResult;
import com.xuecheng.framework.model.response.QueryResult;
import com.xuecheng.framework.model.response.ResponseResult;
import org.apache.commons.lang3.StringUtils;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.data.domain.*;
import org.springframework.stereotype.Service;
import java.util.Optional;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-05-18 15:45
**/
@Service("pageService")
public class PageServiceImpl implements PageService {
@Autowired
private CmsPageRepository cmsPageRepository;
@Override
/**
* @Description: 页面列表分页查询
* @Param: [page, size, queryPageRequest]
* @return: com.xuecheng.framework.model.response.QueryResponseResult
* @Author: zzy
* @Date: 2019/5/18
*/
public QueryResponseResult findList(int page, int size, QueryPageRequest queryPageRequest) {
ExampleMatcher exampleMatcher = ExampleMatcher.matching()
.withMatcher("pageAliase", ExampleMatcher.GenericPropertyMatchers.contains())
.withMatcher("pageName", ExampleMatcher.GenericPropertyMatchers.contains());
CmsPage cmsPage = new CmsPage();
if (StringUtils.isNotEmpty(queryPageRequest.getSiteId())){
cmsPage.setSiteId(queryPageRequest.getSiteId());
}
if (StringUtils.isNotEmpty(queryPageRequest.getPageAliase())){
cmsPage.setPageAliase(queryPageRequest.getPageAliase());
}
if (StringUtils.isNotEmpty(queryPageRequest.getPageName())){
cmsPage.setPageAliase(queryPageRequest.getPageName());
}
if (StringUtils.isNotEmpty(queryPageRequest.getPageType())){
cmsPage.setPageAliase(queryPageRequest.getPageType());
}
//创建条件实例
Example<CmsPage> example = Example.of(cmsPage, exampleMatcher);
if (queryPageRequest == null){
queryPageRequest = new QueryPageRequest();
}
if (page<=0){
page = 1;
}
if (size<=0){
size = 20;
}
//分页对象
Pageable pageable = new PageRequest(page-1,size);
//分页查询
Page<CmsPage> all = cmsPageRepository.findAll(example,pageable);
QueryResult<CmsPage> cmsPageQueryResult = new QueryResult<CmsPage>();
cmsPageQueryResult.setList(all.getContent());
cmsPageQueryResult.setTotal(all.getTotalElements());
//返回结果
return new QueryResponseResult(CommonCode.SUCCESS,cmsPageQueryResult);
}
@Override
public CmsPageResult add(CmsPage cmsPage) {
//校验页面是否存在
CmsPage cmsPage1 = cmsPageRepository.findByPageNameAndSiteIdAndPageWebPath(cmsPage.getPageName(),cmsPage.getSiteId(),cmsPage.getPageWebPath());
if (cmsPage1 != null){
ExceptionCast.cast(CmsCode.CMS_ADDPAGE_EXISTSNAME);
}
cmsPage.setPageId(null);
cmsPage.setPageId(null);
cmsPageRepository.save(cmsPage);
//返回结果
CmsPageResult cmsPageResult = new CmsPageResult(CommonCode.SUCCESS, cmsPage);
return cmsPageResult;
}
@Override
public ResponseResult delete(String id) {
CmsPage one = this.findById(id);
if (one!=null){
cmsPageRepository.deleteById(id);
return new ResponseResult(CommonCode.SUCCESS);
}
return new ResponseResult(CommonCode.FAIL);
}
@Override
public CmsPageResult update(String id, CmsPage cmsPage) {
//根据id 查询页面信息
CmsPage one = this.findById(id);
if (one !=null ){
one.setTemplateId(cmsPage.getTemplateId());
one.setSiteId(cmsPage.getSiteId());
one.setPageAliase(cmsPage.getPageAliase());
one.setPageName(cmsPage.getPageName());
one.setPageWebPath(cmsPage.getPageWebPath());
one.setPagePhysicalPath(cmsPage.getPagePhysicalPath());
CmsPage save = cmsPageRepository.save(one);
if (save != null){
//返回成功
CmsPageResult cmsPageResult = new CmsPageResult(CommonCode.SUCCESS, save);
return cmsPageResult;
}
}
return new CmsPageResult(CommonCode.FAIL,null);
}
@Override
public CmsPage findById(String id) {
Optional<CmsPage> optional = cmsPageRepository.findById(id);
if (optional.isPresent()){
return optional.get();
}
return null;
}
}
```
CmsPageRepository.java
```package com.xczx.cms.dao;
import com.xuecheng.framework.domain.cms.CmsPage;
import org.springframework.data.mongodb.repository.MongoRepository;
/**
* @program: XcEduCode
* @description:
* @author: zzy
* @create: 2019-05-17 22:57
**/
public interface CmsPageRepository extends MongoRepository<CmsPage,String> {
CmsPage findByPageNameAndSiteIdAndPageWebPath(String pageName, String siteId, String pageWebPath);
}
```
|
zzyalbert/zoon-battle
|
zzyalbert/zoon-battle
app.js
```const dotenv = require('dotenv');
const result = dotenv.config();
if (result.error) {
throw result.error;
}
process.on('unhandledRejection', (reason, promise) => {
console.log('Unhandled Rejection at:', promise, 'reason:', reason);
});
const config = require('./config');
const AutoBattle = require('./auto_battle');
const autoBattle = new AutoBattle(config);
autoBattle.run();
```
battle.js
```const Web3 = require('web3');
const BigNumber = require('bignumber.js');
const retry = require('bluebird-retry');
const retryPromise = require('bluebird');
const zoonAbi = require('./abi/Zoon.json');
const config = require('../config');
var i18n_module = require('i18n-nodejs');
var i18n = new i18n_module(config.lang, './../../locale.json');
function Battle(chain, contractAddress, privateKey) {
let self = this;
self.web3 = new Web3(chain.rpc);
self.chain = chain;
self.contractAddress = contractAddress;
self.tokenContract = new self.web3.eth.Contract(zoonAbi, contractAddress);
if (!privateKey.startsWith('0x')) {
privateKey = '0x' + privateKey;
}
let account = self.web3.eth.accounts.privateKeyToAccount(privateKey);
self.web3.eth.accounts.wallet.add(account);
self.web3.eth.defaultAccount = account.address;
}
Battle.prototype.battle = async function (itemId, index) {
let self = this;
let owner = self.web3.eth.defaultAccount;
let options = {
from: owner,
gas: self.chain.gasLimit,
gasPrice: self.chain.gasPrice,
value: 0
}
console.log(i18n.__("Pets list", {itemId: itemId, index: index}));
let sendResult = await self.tokenContract.methods.battle(itemId, index).send(options);
return sendResult;
}
Battle.prototype.battleOfTransaction = function (itemId, index) {
let self = this;
let data = self.web3.eth.abi.encodeFunctionCall({
name: 'battle',
type: 'function',
inputs: [{
"name": "_id",
"type": "uint256"
}, {
"name": "_index",
"type": "uint8"
}]
}, [itemId.toString(), index.toString()]);
let owner = self.web3.eth.defaultAccount;
let transaction = {
from: owner,
to: self.contractAddress,
gas: self.chain.gasLimit,
gasPrice: self.chain.gasPrice,
value: 0,
data: data
};
return transaction;
}
Battle.prototype.getTransactionCount = async function () {
let self = this;
let owner = self.web3.eth.defaultAccount;
let transactionCount = await self.retryRequest(() => {
return new Promise((resolve, reject) => {
self.web3.eth.getTransactionCount(owner).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
});
return transactionCount;
}
/// 线性发送交易
Battle.prototype.queueTransactions = async function (transactions) {
let self = this;
let wait = ms => new Promise(resolve => setTimeout(resolve, ms));
for(let i=0; i<transactions.length; i++) {
try {
let transaction = transactions[i];
let result = await self.sendTransactionAndRetry(transaction, i);
console.log(i18n.__("Transaction successfully", {current: i+1, trxID: result}));
if (config.attackResult) {
await wait(5000);
for(let j=0; j<10; j++) {
let logs = await retry(() => {
return self.getTransactionReceipt(result);
}, { max_tries: 5, interval: 3000 });
if (logs != null) {
try {
let log = self.decodeLog(logs['logs'][2]['data']);
let res = log['result'] == '0' ? 'Lose' : 'Win';
let reward = self.web3.utils.fromWei(log['reward']);
let exp = (parseInt(log['exp']) / 100).toFixed(2);
console.log( i18n.__("Attack result", {result: i18n.__(res), reward: reward, exp: exp }) );
break;
} catch(err){
console.log(err);
}
}
await wait(2000);
}
}
await wait(3000);
} catch(err) {
console.log(i18n.__("Transaction failed", {current: i+1, err: err}));
}
}
}
Battle.prototype.retryRequest = async function (request) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return request();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
Battle.prototype.sendTransactionAndRetry = async function (transaction, index) {
let self = this;
let i = 0;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.sendTransaction(transaction, index);
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
Battle.prototype.sendTransaction = async function (transaction, index) {
let self = this;
return new Promise((resolve, reject) => {
self.web3.eth.sendTransaction(transaction, function (error, result) {
if (error) {
reject(error);
} else {
resolve(result);
}
});
});
}
Battle.prototype.battleSessionsTime = async function (tokenId, rare) {
let self = this;
let result = await self.tokenContract.methods.battleSessionsTime(tokenId, rare).call();
return result;
}
///
Battle.prototype.waitTimeSession = async function (tokenId, rare) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.tokenContract.methods.waitTimeSession(tokenId, rare).call();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
/// 对应NFT已经挑战过几次怪物
Battle.prototype.battleTimes = async function (tokenId) {
let self = this;
let result = await self.tokenContract.methods.battleTimes(tokenId).call();
return result;
}
/// 对应稀有度能挑战多少次怪物
Battle.prototype.getLimitRateRare = async function (rare) {
let self = this;
let result = await self.tokenContract.methods.getLimitRateRare(rare).call();
return result;
}
Battle.prototype.getTransactionReceipt = async function (transaction) {
let self = this;
return new Promise((resolve, reject) => {
self.web3.eth.getTransactionReceipt(transaction, function (error, result) {
if (error) {
reject(error);
} else {
resolve(result);
}
});
});
}
Battle.prototype.decodeLog = function (data) {
let self = this;
return self.web3.eth.abi.decodeLog([ {
"name": "tokenId",
"type": "uint256"
}, {
"name": "monster",
"type": "uint8"
}, {
"name": "result",
"type": "uint8"
}, {
"name": "reward",
"type": "uint256"
}, {
"name": "exp",
"type": "uint256"
}], data ,['0x22020c10ce04134fcde4cba3315ea35a2653b8eb84fb95cb72b94c10f0d236b5','0x000000000000000000000000685905ed3dbe7f962ff4a3456fc4383d5cbda91e']);
}
module.exports = Battle;```
.env.example
```# 必填，BSC账户地址，和私钥对应
address=
# 必填，BSC账户私钥，和地址对应
# ***注意***：请勿在任何地方泄露此私钥，包括复制、截图发给其他人
private_key=
# 选填，攻击的怪物等级，默认为3，攻击3级怪物
game_index=
# 选填，轮询时间，单位秒，默认为60秒
loop_seconds=
# 选填，BSC节点RPC地址，默认使用币安提供的RPC
RPC=
# 选填，本地语言，默认zh(中文)，如果设置为英文，请填写en
lang=
# 选填，显示战斗结果，默认不显示，要显示请填写true
attack_result=```
README.md
```# zoon-battle
[CryptoZoon](https://app.cryptozoon.io/) 自动打怪工具
Automatic monster fighting tool for [CryptoZoon](https://app.cryptozoon.io/)
## 风险和免责
本工具为社区开发，与CryptoZoon项目方无关。
本工具可无偿使用，使用过程中的所有收益和亏损均由用户自己承担。
本工具代码和第三方包均为开源产品，请认真查阅代码，并自行承担使用过程中的一切风险。
## 教程
Windows详细部署教程【待完善】
MacOS/Linux详细部署教程【待完善】
## 环境准备
node.js 10+
## 安装
```
# clone代码
git clone https://github.com/MaoYanFi/zoon-battle.git
# 进入目录
cd zoon-battle
# 安装依赖包
npm install
```
## 配置
```
# 根据模板创建.env文件
cp .env.example .env
# 根据.env文件内注释配置.env文件
```
## 直接运行
```
# 直接运行程序
node app.js
```
## pm2守护进程运行
```
# 安装pm2
npm install -g pm2
# 启动进程
pm2 start app.js --name zoon-battle
# 查看进程
pm2 ls
# 查看进程日志
pm2 log zoon-battle
# 重启进程
pm2 restart zoon-battle
# 停止进程
pm2 stop zoon-battle
# 删除进程
pm2 delete zoon-battle
```
## 猫眼社区社群答疑
加微信（WeChat）进群： shuaizhen668
## 捐赠
0x66be3bF47bD7f08D812aA6aA34724aCc84642DBa```
index.js
```const dotenv = require('dotenv');
const Web3 = require('web3');
const web3 = new Web3();
const result = dotenv.config();
if (result.error) {
throw result.error;
}
var readlineSync = require('readline-sync');
let address = process.env.address;
let privateKey = process.env.private_key;
while (!privateKey) {
try {
privateKey = readlineSync.question('Please enter your private key (empty to exit): ', {
keyInSelect: true,
hideEchoBack: true // The typed text on screen is hidden by `*` (default).
});
if (!privateKey) {
process.exit(0);
}
let account = web3.eth.accounts.privateKeyToAccount(privateKey);
address = account.address.toLowerCase();
} catch (err) {
console.log('Private key Wrong: ' + err.message);
privateKey = "";
}
}
//挑战第几个boss, 2代表60%等级那个
let gameIndex = process.env.game_index || 3;
gameIndex = gameIndex - 1;
const loopSeconds = process.env.loop_seconds || 60;
const rpc = process.env.RPC || "https://bsc-dataseed.binance.org/";
const lang = process.env.lang || "zh";
const attackResult = process.env.attack_result || false;
/// 战斗合约合约地址
const zoonBattleContract = "0xf70c08a428f300c7f3e3f09217211d21f7a50410";
/// 基础信息合约地址
const zoonNftContract = "0x8bbe571b381ee58dd8f2335a8f0a5b42e83bdcfa";
const chain_bsc = {
chainId: 56,
rpc: rpc,
gasLimit: 300000,
gasPrice: "5" + "000000000",
}
const config = {
address: address,
privateKey: privateKey,
chain: chain_bsc,
zoonBattleContract: zoonBattleContract,
zoonNftContract: zoonNftContract,
gameIndex: gameIndex,
loopSeconds: loopSeconds,
lang: lang,
attackResult: attackResult
}
module.exports = config```
erc721.js
```const Web3 = require('web3');
const BigNumber = require('bignumber.js');
const retry = require('bluebird-retry');
const retryPromise = require('bluebird');
const erc721Abi = require('./abi/ERC721.json');
const config = require('../config');
function ERC721(chain, contractAddress) {
let self = this;
self.web3 = new Web3(chain.rpc);
self.chain = chain;
self.contractAddress = contractAddress;
self.tokenContract = new self.web3.eth.Contract(erc721Abi, contractAddress);
}
ERC721.prototype.balanceOf = async function (address) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.tokenContract.methods.balanceOf(address).call();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
ERC721.prototype.tokenURI = async function (tokenId) {
let self = this;
let result = await self.tokenContract.methods.tokenURI(tokenId).call();
return result;
}
ERC721.prototype.ownerOf = async function (tokenId) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.tokenContract.methods.ownerOf(tokenId).call();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
ERC721.prototype.getZoan = async function (tokenId) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.tokenContract.methods.getZoan(tokenId).call();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
ERC721.prototype.tokenOfOwnerByIndex = function (address, index) {
let self = this;
return new Promise((resolve, reject) => {
/// 重试3次
retry(() => {
return self.tokenContract.methods.tokenOfOwnerByIndex(address, index).call();
}, { max_tries: 5, interval: 3000 }).then(function (result) {
resolve(result);
}).catch(function (error) {
reject(error);
});
});
}
module.exports = ERC721;```
auto_battle.js
```const config = require('./config');
const Battle = require('./contracts/battle');
const ERC721 = require('./contracts/erc721');
const cache = require('./utils/cache');
var i18n_module = require('i18n-nodejs');
var i18n = new i18n_module(config.lang, './../../locale.json');
function AutoBattle(config) {
let self = this;
self.config = config;
self.battleContract = new Battle(config.chain, config.zoonBattleContract, config.privateKey);
self.erc721Contract = new ERC721(config.chain, config.zoonNftContract);
}
AutoBattle.prototype.run = async function () {
let self = this;
console.log(i18n.__("Current account", { address: self.config.address }));
let timeOut = config.loopSeconds * 1000;
let count = 1;
(function iterator() {
self.runThis(count).then(() => {
setTimeout(() => {
count++;
iterator();
}, timeOut);
}).catch((err) => {
console.log(`error: ${err.message}`);
console.log(err);
setTimeout(() => {
count++;
iterator();
}, timeOut);
})
})();
}
AutoBattle.prototype.runThis = async function (count) {
console.log("============================" + i18n.__("Number of scanning", { times: count }) + "==============================");
let self = this;
/// 获取宠物id列表
let petIds = await self.getPetIds(self.config.address);
console.log(i18n.__("Number of pets available", { quantity: petIds.length }));
/// 获取宠物详情
let pets = await self.getPets(petIds);
pets = pets.filter(it => it.dna != '0');
/// 批量组装battle交易
let transactions = await self.batchConstructTransactions(pets, petIds);
/// 批量发送交易
await self.battleContract.queueTransactions(transactions);
}
/// 获取宠物id列表
AutoBattle.prototype.getPetIds = async function (address) {
let self = this;
/// 获取当前账号有几个NFT
let balance = await self.erc721Contract.balanceOf(address);
let balanceCacheKey = 'pets_balance';
let balanceCache = cache.get(balanceCacheKey);
let balanceChanged = balanceCache != balance;
if (balanceChanged) {
//console.log('balanceChanged');
cache.set(balanceCacheKey, balance, 1000000000);
}
let petIdsCacheKey = "pets_ids";
let results = cache.get(petIdsCacheKey);
// if (results) {
// console.log(`cache ${petIdsCacheKey} : ${results}`);
// }
if (!results || balanceChanged) {
let promises = [];
for (var i = 0; i < balance; i++) {
let p = self.erc721Contract.tokenOfOwnerByIndex(address, i);
promises.push(p);
}
results = await Promise.all(promises);
cache.set(petIdsCacheKey, results, 10 * 60);//用户余额不变的情况下，缓存10分钟的宠物id列表
}
return results;
}
/// 获取宠物id列表
AutoBattle.prototype.getPets = async function (petIds) {
let self = this;
/// 批量请求宠物详情
let results = [];
for (var i = 0; i < petIds.length; i++) {
let tokenId = petIds[i];
let petCacheKey = `pet_${tokenId}`;
let item = cache.get(petCacheKey);
// if (item) {
// console.log(`cache ${petCacheKey} : ${item}`);
// }
if (!item) {
item = await self.erc721Contract.getZoan(tokenId);
if (item.dna != '0') {
cache.set(petCacheKey, item, 3 * 60 * 60);//因为目前只用到宠物的RARE，其实可以永久缓存
}
}
results.push(item);
}
return results;
}
AutoBattle.prototype.ownerOf = async function (tokenId) {
let self = this;
let result = await self.erc721Contract.ownerOf(tokenId);
return result
}
AutoBattle.prototype.batchConstructTransactions = async function (pets, petIds) {
let self = this;
let waitTimes = [];
/// 批量获取宠物下次对战的等待时间
for (var i = 0; i < pets.length; i++) {
let pet = pets[i];
let petId = petIds[i];
let item = await self.getWaitTimeSessionOfPet(pet, petId);
waitTimes.push(item);
}
// console.log("waitTimes:");
// console.log(waitTimes);
/// 筛选可以攻击的pet
let models = [];
for (var j = 0; j < waitTimes.length; j++) {
let waitTimeItem = waitTimes[j];
let petId = petIds[j];
for (var k = 0; k < waitTimeItem.length; k++) {
let time = waitTimeItem[k];
if (time <= 0) {
let rareIndex = k + 1;
let model = {
petId: petId,
rareIndex: rareIndex
};
models.push(model);
}
}
}
let transactions = [];
if (models.length > 0) {
let message = "";
for (var i = 0; i < models.length; i++) {
let model = models[i];
message += i18n.__("Can attack", { petId: model.petId, rareIndex: model.rareIndex })
let transaction = self.battleContract.battleOfTransaction(model.petId, self.config.gameIndex);
transactions.push(transaction);
if (i != models.length - 1) {
message += "\n";
}
}
console.log(message);
} else {
console.log(i18n.__("No pet to attack"));
}
return transactions;
}
/// 获取宠物的战斗等待时间
AutoBattle.prototype.getWaitTimeSessionOfPet = async function (pet, petId) {
let self = this;
/// 获取宠物品质
let rare = self.getRare(pet.dna);
/// 获取宠物下次对战的等待时间
let results = [];
for (var i = 0; i < rare; i++) {
let rareIndex = i + 1;
let waitTimeSessionCacheKey = `wait_time_session_${petId}_${rareIndex}`;
let cacheWaitTime = cache.getWithSecondDecrease(waitTimeSessionCacheKey);
let item = cacheWaitTime;
// if (item) {
// console.log(`cache ${waitTimeSessionCacheKey} : ${cacheWaitTime}`);
// }
if (!item) {
item = await self.battleContract.waitTimeSession(petId, rareIndex);
cache.set(waitTimeSessionCacheKey, item, item - 1);
}
results.push(item);
}
return results;
}
/// 计算宠物品质
AutoBattle.prototype.getRare = function (e) {
var t = Math.floor(+(null === e || void 0 === e ? void 0 : e.toString()) / Math.pow(10, 26));
return t > 9999 ? 1 : t > 9707 ? 6 : t > 9359 ? 5 : t > 8706 ? 4 : t > 7836 ? 3 : t > 5224 ? 2 : 1
}
module.exports = AutoBattle;```
cache.js
```let cacheObjects = {};
// {
// 'key-1': {
// set: 1629817194
// exp: 1629817194
// data: '11111'
// }
// }
function set(key, data, second = 180) {
if (!key) {
throw new Error("key ")
}
let now = parseInt((new Date().getTime()) / 1000);
let obj = {
set: now,
exp: now + second,
data: data
}
cacheObjects[key] = obj;
}
function get(key) {
let obj = getCacheObject(key);
if (!obj) {
return null;
}
return obj.data;
}
function getWithSecondDecrease(key) {
let obj = getCacheObject(key);
if (!obj) {
return null;
}
let now = parseInt((new Date().getTime()) / 1000);
let dec = now - obj.set;
let data = obj.data - dec;
if (data < 0) {
return null;
}
return data;
}
function getCacheObject(key) {
if (!cacheObjects.hasOwnProperty(key)) {
return null;
}
let obj = cacheObjects[key];
let now = parseInt((new Date().getTime()) / 1000);
if (obj.exp > now) {
return obj;
}
// console.log(`${key} exp`);
remove(key);
return null;
}
function remove(key) {
delete cacheObjects[key];
return true;
}
module.exports = {
set,
get,
getCacheObject,
getWithSecondDecrease,
remove
}```
|
zzyvip/NIceCarShop
|
zzyvip/NIceCarShop
TittleNav.java
```package com.bole.demo.wedgets;
public class TittleNav {
}
```
|