列表

详情

NC201926. Geometry PTSD

描述

It is always hard to construct a good testcase for a geometry, like the problem I in EC Final 2019.
a.png
In order to manage the key to the testcase preparation, you need to find three points on a unit sphere such that and the distance from original point  to the plane no more than . and greater than 

输入描述

No input.

输出描述

Output 3 lines. Each line contains 3 integers  representing a point
.
The checker is numerically stable, but it is not done in the exact arithmetic. So you might get wrong answer if your solution is too close to the constraint. For example, the distance of A and B is .

示例1

输入: 

(Empty)

输出: 

1 2 3
4 5 6
-1000000 -1000000 -1000000

原站题解

import java.util.Scanner;
public class Main {
public static void main(String[] arg) {
Scanner scanner = new Scanner(System.in);
// todo
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

C++(clang++11) 解法, 执行用时: 3ms, 内存消耗: 376K, 提交时间: 2021-04-07 16:24:30 

#include <bits/stdc++.h>

using namespace std;



int main() {

    cout<<"999999 1000000 0\n-999997 0 999999\n0 -999996 -999997";

}

C++14(g++5.4) 解法, 执行用时: 2ms, 内存消耗: 228K, 提交时间: 2020-01-31 14:27:41 

#include<stdio.h>

int main(){

    puts("1000000 0 0");

    puts("-570000 987268 0");

    puts("-570000 -987268 0");

}

pypy3(pypy3.6.1) 解法, 执行用时: 42ms, 内存消耗: 27144K, 提交时间: 2021-04-10 17:15:33 

print(0,int(1e6),-1)

print(866025, int(1e6)//2*-1, 1)

print(-866025, int(1e6)//2*-1, 0)

Python3(3.5.2) 解法, 执行用时: 29ms, 内存消耗: 7144K, 提交时间: 2020-01-31 13:37:11 

print('''1000000 999999 0

-999999 0 999997

0 -999997 -999996''')

PHP 解法, 执行用时: 8ms, 内存消耗: 2872K, 提交时间: 2022-06-29 14:26:46 

-1 1 0

0 -1 1

1 0 -1

上一题

© 2025 nowcoder.com