Submission #374631
Source Code Expand
#include <bits/stdc++.h>
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
int X, Y;
int solve(int p, int q) {
if (1000*p == X && 1000*q == Y) {
printf("%d %d %d %d\n", p, q, p+1, q+1);
return 0;
} else if (1000*p == X) {
int r = p;
printf("%d %d %d %d\n", p, q, r, q+1);
return 1;
} else if (1000*q == Y) {
int s = q;
printf("%d %d %d %d\n", p, q, p+1, s);
return 0;
} else {
int s = Y-999*q;
int r = X-999*p;
printf("%d %d %d %d\n", p, q, r, s);
return 0;
}
}
int main() {
double x, y;
cin >> x >> y;
X = (int)(1000*x+0.5), Y = (int)(1000*y+0.5);
// if (X == 0 && Y == 0) {
// cout << "0 0 1 0" << endl;
// cout << "0 0 0 1" << endl;
// return 0;
// }
int p = X / 1000;
int q = Y / 1000;
int tmp = solve(p, q);
if (tmp == 0) q++;
else p++;
solve(p, q);
return 0;
}
Submission Info
| Submission Time |
|
| Task |
B - 交点 |
| User |
mayohara |
| Language |
C++11 (GCC 4.9.2) |
| Score |
0 |
| Code Size |
1119 Byte |
| Status |
WA |
| Exec Time |
28 ms |
| Memory |
932 KiB |
Judge Result
| Set Name |
All |
| Score / Max Score |
0 / 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 |
25 ms |
920 KiB |
| scrambled_01.txt |
AC |
26 ms |
792 KiB |
| scrambled_02.txt |
WA |
23 ms |
916 KiB |
| scrambled_03.txt |
WA |
23 ms |
800 KiB |
| scrambled_04.txt |
WA |
23 ms |
796 KiB |
| scrambled_05.txt |
WA |
23 ms |
932 KiB |
| scrambled_06.txt |
AC |
25 ms |
920 KiB |
| scrambled_07.txt |
WA |
24 ms |
796 KiB |
| scrambled_08.txt |
WA |
28 ms |
920 KiB |
| scrambled_09.txt |
WA |
26 ms |
916 KiB |
| scrambled_10.txt |
WA |
25 ms |
920 KiB |
| scrambled_11.txt |
WA |
25 ms |
732 KiB |
| scrambled_12.txt |
AC |
23 ms |
844 KiB |
| scrambled_13.txt |
WA |
23 ms |
928 KiB |
| scrambled_14.txt |
AC |
23 ms |
928 KiB |
| scrambled_15.txt |
WA |
23 ms |
928 KiB |
| scrambled_16.txt |
WA |
22 ms |
924 KiB |
| scrambled_17.txt |
AC |
23 ms |
796 KiB |
| scrambled_18.txt |
WA |
22 ms |
928 KiB |
| scrambled_19.txt |
WA |
23 ms |
800 KiB |
| scrambled_20.txt |
WA |
23 ms |
796 KiB |
| scrambled_21.txt |
WA |
23 ms |
924 KiB |
| scrambled_22.txt |
AC |
25 ms |
920 KiB |
| scrambled_23.txt |
AC |
24 ms |
920 KiB |
| scrambled_24.txt |
WA |
22 ms |
924 KiB |
| scrambled_25.txt |
AC |
22 ms |
924 KiB |
| scrambled_26.txt |
WA |
23 ms |
928 KiB |