oj.uz

답안 #934887

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934887 2024-02-28T06:21:31 Z Halym2007 Roads (CEOI20_roads) C++11
0 / 100
 3 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz size()
#define pb push_back
#define ff first
#define ss second
int n, x_1, x_2, y_1, y_2;
vector <pair <int, int>> v;
int main () {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> x_1 >> y_1 >> x_2 >> y_2;
//		assert (x_1 == x_2);
		v.pb ({min (x_1, x_2), min (y_1, y_2)});
	}
	sort (v.begin(), v.end());
	int git = (int)v.sz;
	git--;
	for (int i = 0; i < git; ++i) {
		cout << v[i].ff << " " << v[i].ss << " " << v[i + 1].ff << " " << v[i + 1].ss << "\n";
	}
}

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 348 KB Condition failed: "iB != P2I.end()"
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 3 ms 348 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Failed 3 ms 348 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Failed 2 ms 348 KB Condition failed: "pf == Sline.end() || !Cross(S[*pi], S[*pf])"
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 348 KB Condition failed: "iB != P2I.end()"
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Failed 0 ms 348 KB Condition failed: "iB != P2I.end()"
2 Halted 0 ms 0 KB -