Submission #900648

#TimeUsernameProblemLanguageResultExecution timeMemory
900648karamkallasiRoads (CEOI20_roads)C++14
0 / 100
1 ms2516 KiB
#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]; 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++){ cout<<p[i].S.F<<' '<<p[i].S.S<<' '<<p[i+1].F.F<<' '<<p[i+1].F.S<<endl; } 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...