2018-2019 ACM-ICPC, Asia East Continent Finals D.F.I.L(VP)

专业打假赛

VP情况略，不会的题单独补了

D.Deja vu of … Go Players 题目分析

签到题，直接判断 n , m n,m n,m大小关系即可。

Code

#include 
#define int long long
#define endl '\n'
using namespace std;

const int N = 2e5 + 10;
int a[N];


inline void solve(){
    int n, m; cin >> n >> m;
    for(int i = 1, x = 0; i > x;
    for(int j = 1, x = 0; j > x;
    if(n > m) cout  o.x >> o.y >> o.z;
    double r = 0; cin >> r;
    point st, ed;
    cin >> st.x >> st.y >> st.z >> ed.x >> ed.y >> ed.z;
    point dec1 = dec(o, st), dec2 = dec(ed, st), dec3 = dec(o, ed), dec4 = dec(st, ed);
    double res0 = (st.x - ed.x) * (st.x - ed.x) + (st.y - ed.y) * (st.y - ed.y) + (st.z - ed.z) * (st.z - ed.z);
    double res1 = dec1.x * dec2.x + dec1.y * dec2.y + dec1.z * dec2.z;
    double res2 = dec3.x * dec4.x + dec3.y * dec4.y + dec3.z * dec4.z;
    double dis = sqrt(dec4.square());

    if (res0