# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999382 | 2024-06-15T11:52:42 Z | yoav_s | Roads (CEOI20_roads) | C++17 | 16 ms | 4444 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> v; typedef vector<v> vv; typedef vector<vv> vvv; typedef pair<ll,ll> p; typedef vector<p> vp; typedef vector<vp> vvp; typedef vector<vvp> vvvp; typedef pair<ll, p> tri; typedef vector<tri> vtri; typedef vector<vtri> vvtri; typedef vector<vvtri> vvvtri; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<vvb> vvvb; #define f first #define s second #define pb push_back #define eb emplace_back #define all(v) (v).begin(),(v).end() const ll INF = 1e18; const ll mod = 1e9 + 7; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll N; cin >> N; vector<pair<p,p>> edges(N); for (ll i = 0; i < N; i++) cin >> edges[i].f.f >> edges[i].f.s >> edges[i].s.f >> edges[i].s.s; map<ll, vp> edgesByX; for (ll i= 0; i <N; i++) { edgesByX[edges[i].f.f].eb(min(edges[i].f.s,edges[i].s.s),max(edges[i].f.s,edges[i].s.s)); } for (auto &x : edgesByX) { sort(all(x.s)); } p prevTop = p(-1, -1); for (auto x : edgesByX) { for (ll i = 0; i < x.s.size() - 1; i++) { cout << x.f << " " << x.s[i].s << " " << x.f << " " << x.s[i + 1].f << "\n"; } if (prevTop.f != -1) { cout << prevTop.f << " " << prevTop.s << " " << x.f << " " << x.s.back().s << "\n"; } prevTop = p(x.f, x.s.back().s); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Failed | 0 ms | 348 KB | Condition failed: "iB != P2I.end()" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 408 KB | Output is correct |
4 | Correct | 8 ms | 2340 KB | Output is correct |
5 | Correct | 15 ms | 4444 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 604 KB | Output is correct |
4 | Correct | 8 ms | 2440 KB | Output is correct |
5 | Correct | 15 ms | 4444 KB | Output is correct |
6 | Failed | 0 ms | 344 KB | Condition failed: "iB != P2I.end()" |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 604 KB | Output is correct |
4 | Correct | 10 ms | 2396 KB | Output is correct |
5 | Correct | 16 ms | 4444 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Failed | 0 ms | 348 KB | Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])" |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Failed | 0 ms | 348 KB | Condition failed: "iB != P2I.end()" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Failed | 1 ms | 344 KB | Condition failed: "iB != P2I.end()" |
2 | Halted | 0 ms | 0 KB | - |