Submission #999378

#	Time	Username	Problem	Language	Result	Execution time	Memory
999378		yoav_s	Roads (CEOI20_roads)	C++17	0 / 100	1 ms	348 KiB

roads

#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;
    sort(all(edges), [](pair<p, p> x, pair<p, p> y){return min(x.f,x.s) < min(y.f, y.s);});
    for (ll i=  0; i < N - 1; i++)
    {
        p from = min(edges[i].f, edges[i].s);
        p to = min(edges[i + 1].f, edges[i + 1].s);
        cout << from.f << " " << from.s << " " << to.f << " " << to.s << "\n";
    }
    return 0;
}

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