Submission #900662

#	Time	Username	Problem	Language	Result	Execution time	Memory
900662		karamkallasi	Roads (CEOI20_roads)	C++14	15 / 100	12 ms	5212 KiB

roads

#include <bits/stdc++.h>
#define T ll tt ; cin>>tt ; while(tt--)
#define fast ios::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define endl '\n'
#define yes void (cout << "YES" << endl)
#define no void (cout << "NO" << endl)
#define pb push_back
#define F first
#define S second
#define ld long double
#define fixed(g) fixed<<setprecision(g)
#define ll long long
using namespace std;
const ll N = 2e6 + 9 ;
const ll oo = 1e9 + 7 ;
ll n , m , k , x , y , z , g , ans , sum , sum2 , cnt , dis[N] ,  sz , mn , a[N] , b[N] , e1 , e2 , e3 , e4;
bool ff , vis[N] ;
pair< pair<ll , ll> , pair<ll , ll> > p[N];
vector<ll>v;
int main(){
fast
    cin >> n ;
    for(ll i=0 ; i<n ; i++){
        cin >> e1 >> e2 >> e3 >> e4 ;
        p[i] = { {e1 , e2}  , {e3 , e4} } ;
    }
    sort(p , p+n) ;
    for(ll i=0 ; i<n-1 ; i++){
        if(p[i].F.F==p[i+1].F.F){
            v.pb (p[i].F.S) ;
            v.pb (p[i].S.S) ;
            v.pb (p[i+1].F.S) ;
            v.pb (p[i+1].S.S) ;
            sort(v.begin() , v.end()) ;
            cout<<p[i].F.F<<' '<<v[1]<<' '<<p[i].F.F<<' '<<v[2]<<endl;
            v.clear();
        }
        else
            cout<<p[i].S.F<<' '<<p[i].S.S<<' '<<p[i+1].F.F<<' '<<p[i+1].F.S<<endl;
    }

return 0 ;
}

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