Submission #1294922
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long int ll; typedef vector<int> VI; typedef vector<ll> VL; typedef pair<int, int> PI; const ll mod = 1e9 + 7; int main(void){ double x, y; cin >> x >> y; int bx = floor(x); int by = floor(y); x -= bx; y -= by; int cx = 1; int cy = 0; if (y < 1e-9) { cy = 1; } PI r1(floor(1000 * x + 0.5 + bx), floor(1000 * y + 0.5 + by)); if (x < 1e-9 && y < 1e-9) { r1 = PI(1 + bx, by); } PI r2(floor(1000 * (x - cx) + cx + 0.5 + bx), floor(1000 * (y - cy) + cy + 0.5 + by)); PI r3(cx + bx, cy + by); cout << bx << " " << by << " " << r1.first << " " << r1.second << endl; cout << r2.first << " " << r2.second << " " << r3.first << " " << r3.second << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 交点 |
User | kobae964 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1197 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt, scrambled_19.txt, scrambled_20.txt, scrambled_21.txt, scrambled_22.txt, scrambled_23.txt, scrambled_24.txt, scrambled_25.txt, scrambled_26.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
scrambled_00.txt | AC | 1 ms | 256 KB |
scrambled_01.txt | AC | 1 ms | 256 KB |
scrambled_02.txt | AC | 1 ms | 256 KB |
scrambled_03.txt | AC | 1 ms | 256 KB |
scrambled_04.txt | AC | 1 ms | 256 KB |
scrambled_05.txt | AC | 1 ms | 256 KB |
scrambled_06.txt | AC | 1 ms | 256 KB |
scrambled_07.txt | AC | 1 ms | 256 KB |
scrambled_08.txt | AC | 1 ms | 256 KB |
scrambled_09.txt | AC | 1 ms | 256 KB |
scrambled_10.txt | AC | 1 ms | 256 KB |
scrambled_11.txt | AC | 1 ms | 256 KB |
scrambled_12.txt | AC | 1 ms | 256 KB |
scrambled_13.txt | AC | 1 ms | 256 KB |
scrambled_14.txt | AC | 1 ms | 256 KB |
scrambled_15.txt | AC | 1 ms | 256 KB |
scrambled_16.txt | AC | 1 ms | 256 KB |
scrambled_17.txt | AC | 1 ms | 256 KB |
scrambled_18.txt | AC | 1 ms | 256 KB |
scrambled_19.txt | AC | 1 ms | 256 KB |
scrambled_20.txt | AC | 1 ms | 256 KB |
scrambled_21.txt | AC | 1 ms | 256 KB |
scrambled_22.txt | AC | 1 ms | 256 KB |
scrambled_23.txt | AC | 1 ms | 256 KB |
scrambled_24.txt | AC | 1 ms | 256 KB |
scrambled_25.txt | AC | 1 ms | 256 KB |
scrambled_26.txt | AC | 1 ms | 256 KB |