제출 #1289459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289459		LIA	Roads (CEOI20_roads)	C++17	0 / 100	1 ms	14688 KiB

roads

//
// Created by liasa on 11/11/2025.
//

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
const ll mod = 1e9 + 7;

#define tpl tuple<ll, ll, ll, ll, ll>

int main() {
  ll n;
  cin >> n;
  vector<tpl> v(n);
  for (ll i = 0; i < n; ++i) {
    ll x, y, x1, y1;
    cin >> x >> y >> x1 >> y1;
    if (y > y1)
      swap(y, y1);
    if (x > x1)
      swap(x, x1);
    v[i] = {y, x1, x, y1, i};
  }

  sort(v.begin(), v.end());
  vector<tpl> ans;

  for (ll i = 1; i < n; ++i) {
    ll y = get<0>(v[i - 1]);
    ll x = get<2>(v[i - 1]);
    ll y1 = get<0>(v[i]);
    ll x1 = get<1>(v[i]);
    ans.push_back({x, y, x1, y1, 0});
  }

  for (auto [a, b, c, d, t] : ans) {
    cout << a << " " << b << " " << c << " " << d << "\n";
  }
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40