牛客多校第二场补题（继续罚坐）

牛客多校第二场（继续罚坐场）

Draw Grids

ZYT和LBC玩游戏，在4*4的矩阵中，从起点开始，每个人只能连一条直线，且只能在起点或者上一个人的终点位置连上这个位置相邻的一条直线，并且不能形成环，最后不能连的人输。既然这样我们就可以统记这个图最多能画多少条边，当可以画奇数条时ZYT获胜，否则LBC获胜。

#include<iostream>
using namespace std;
int main(){
    int m,n;
    cin>>m>>n;
    if(m*n%2==1)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
}

Er Ba Game

题目很简单，按情况模拟就好了

在这里插入代码片#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int t;
	cin >> t;
	while (t--) {
		int a1, b1, a2, b2;
		cin >> a1 >> b1 >> a2 >> b2;
		if (a1 > b1)swap(a1, b1);
		if (a2 > b2)swap(a2, b2);
		if (a1 == a2 && b1 == b2)cout << "tie" << endl;
		else if (a1 == 2 && b1 == 8)cout << "first" << endl;
		else if (a2 == 2 && b2 == 8)cout << "second" << endl;
		else if (a1 == b1 && a2 != b2)cout << "first" << endl;
		else if (a1 != b1 && a2 == b2)cout << "second" << endl;
		else if (a1 == b1 && a2 == b2)cout<<(a1>a2?"first":"second")<<endl;
        else if((a1+b1)%10!=(a2+b2)%10)cout<<((a1+b1)%10>(a2+b2)%10?"first":"second")<<endl;
        else if(b1!=b2)cout<<(b1>b2?"first":"second")<<endl;
        else  cout<<"tie"<<endl;
		
	}
}

Stack

题意
本题是讲构造一个排列，给定一个数组p 排列在i的位置前面有p[i]个<=当前数的值，如果最后一次操作在n-1之前，再将排列补全
(拓扑排序，链表）

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n, k, c = 0;
    cin>>n>>k;
    vector<int>a(n+1);
    vector<int>b(n+1);
    vector<int>v[n+1];
    b[0] = 1;
    for (int i = 1; i <= k; i++) {
        int ii, bi;
        cin>>ii>>bi;
        b[ii] = bi;
        for (int j = c + 1; j < ii; j++) {
            b[j] = max(b[c], b[ii] - ii + j);
        }
        c = ii;
    }
    for (int i = c + 1; i <= n; i++) b[i] = b[c] + i - c;
    b[1] = 1;
    // 补全b[n]
    for (int i = 1; i < n; i++) {
        if (b[i] > b[i - 1] + 1) {
           cout<<"-1"<<endl;
            return 0;
        }
    }
    // 补全a[n]
    for (int i = 1; i <= n; i++) {
        v[b[i]].push_back(i);
    }
    //统计b[i]中的元素出现的位置；
    int p = 1, tmp = 1;
    while (p <= n) {
        for (int i = v[tmp].size() - 1; i >= 0; i--) {
            a[v[tmp][i]] = p;
            p++;
        }
        tmp++;
    }
    //从一到n输入；
    for (int i = 1; i <= n; i++) cout << a[i] << ' ';
    return 0;
}

Girlfriend

题意
题目的本质是给出了一个阿波罗尼斯圆的三维拓展（阿氏圆是阿波罗尼斯圆的简称，已知平面上两点A、B，则所有满足PA/PB=k且不等于1的点P的轨迹是一个以定比m：n内分和外分定线段AB的两个分点的连线为直径的圆。）算出两个球相交的部分。

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
double pi = 3.1415926535898732;
double cs(double a, double b, double c) {
	return (b * b + c * c - a * a) / (2 * b * c);
}
int main() {
	int t;
	cin >> t;
	while (t--) {
		double x1, x2, x3, x4;
		double y1, y2, y3, y4;
		double z1, z2, z3, z4;
		cin >> x1 >> y1 >> z1;
		cin >> x2 >> y2 >> z2;
		cin >> x3 >> y3 >> z3;
		cin >> x4 >> y4 >> z4;
		double k1, k2;
		cin >> k1 >> k2;
		double dis1 = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2) + (z1 - z2) * (z1 - z2));
		double dis2 = sqrt((x3 - x4) * (x3 - x4) + (y3 - y4) * (y3 - y4) + (z3 - z4) * (z3 - z4));
		double yx1, yy1, yz1, yr1;
		double yx2, yy2, yz2, yr2;
		yx1 = (k1 * k1 * x2 - x1) / (k1 * k1 - 1);
		yy1 = (k1 * k1 * y2 - y1) / (k1 * k1 - 1);
		yz1 = (k1 * k1 * z2 - z1) / (k1 * k1 - 1);
		yr1 = (k1 * dis1) / (k1 * k1 - 1);
		yx2 = (k2 * k2 * x4 - x3) / (k2 * k2 - 1);
		yy2 = (k2 * k2 * y4 - y3) / (k2 * k2 - 1);
		yz2 = (k2 * k2 * z4 - z3) / (k2 * k2 - 1);
		yr2 = (k2 * dis2) / (k2 * k2 - 1);
		double d = sqrt((yx1 - yx2) * (yx1 - yx2) + (yy1 - yy2) * (yy1 - yy2) + (yz1 - yz2) * (yz1 - yz2));
		if (d >= yr1 + yr2) {
			cout << 0 << endl;
			continue;
		}
		else if (d < abs(yr1 - yr2)) {
			double m = min(yr1, yr2);
			cout << (4 * pi * m * m * m) / 3 << endl;
			continue;
		}
		double r1 = yr1 - yr1 * cs(yr2, yr1, d);
		double r2 = yr2 - yr2 * cs(yr1, yr2, d);
		double sum = (yr1 * r1 * r1 - r1 * r1 * r1 / 3) * pi + (yr2 * r2 * r2 - r2 * r2 * r2 / 3) * pi;
		cout << sum << endl;
	}
}