# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
934879 |
2024-02-28T06:10:00 Z |
Halym2007 |
Roads (CEOI20_roads) |
C++11 |
|
2 ms |
600 KB |
#include <bits/stdc++.h>
using namespace std;
#define sz size()
#define pb push_back
#define ff first
#define ss second
int n, x_1, x_2, y_1, y_2;
vector <pair <int, int>> v;
int main () {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> x_1 >> y_1 >> x_2 >> y_2;
assert (x_1 == x_2);
v.pb ({x_1, min (y_1, y_2)});
}
sort (v.begin(), v.end());
for (int i = 0; i < (int)v.sz - 1; ++i) {
cout << v[i].ff << " " << v[i].ss << " " << v[i + 1].ff << " " << v[i + 1].ss << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Failed |
2 ms |
348 KB |
Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])" |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Failed |
2 ms |
344 KB |
Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])" |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Failed |
2 ms |
348 KB |
Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])" |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |