Submission #1286987

#TimeUsernameProblemLanguageResultExecution timeMemory
1286987zyntherixRoads (CEOI20_roads)C++20
15 / 100
12 ms23400 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define vi vector<int>
#define vs vector<string>
#define vb vector<bool>
#define vpi vector<pi>
#define pb push_back
#define all(a) (a).begin(), (a).end()
const int mod = 1e9 + 7;

void solve()
{
    int n;
    cin >> n;
    vector<vi> v(n, vi(4));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < 4; j++)
        {
            cin >> v[i][j];
        }
        if (v[i][1] > v[i][3])
        {
            swap(v[i][1], v[i][3]);
            swap(v[i][0], v[i][2]);
        }
    }
    sort(all(v));
    for (int i = 1; i < n; i++)
    {
        if (v[i - 1][0] != v[i][0])
            cout << v[i - 1][0] << ' ' << v[i - 1][1] << ' ' << v[i][0] << ' ' << v[i][1] << '\n';
        else
            cout << v[i - 1][2] << ' ' << v[i - 1][3] << ' ' << v[i][0] << ' ' << v[i][1] << '\n';
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...