Submission #707986

#TimeUsernameProblemLanguageResultExecution timeMemory
707986LudisseyRoads (CEOI20_roads)C++14
0 / 100
1 ms316 KiB
#include <iostream> #include <string> #include <map> #include <set> #include <queue> #include <cstring> #include <sstream> typedef long long ll; #define LL_MAX 1000000000000000 #define LL_MIN -1000000000000000 #define int long long #define double long double #define MOD(a) ((a) % 1000000007 + 1000000007 ) % 1000000007 #define FI first #define caseOut(t) cout << "Case " << t << ": "; #define SE second #define USACO_SETUP() ifstream cin("paint.in"); ofstream cout("paint.out"); #define SETUP() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; signed main() { SETUP(); int n; cin >> n; vector<pair<int,int>> start(n); vector<pair<int, int>> end(n); for (int i = 0; i < n; i++) { int x, y; cin >> x >> y; start[i] = { x,y }; cin >> x >> y; end[i] = { x,y }; } pair<int, int> f=end[0]; for (int i = 1; i < n; i++) { cout << f.FI << " " << f.SE << " " << start[i].FI << " " << start[i].SE << "\n"; f = end[i]; } 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...