oj.uz

Submission #389990

# Submission time Handle Problem Language Result Execution time Memory
389990 2021-04-15T03:51:16 Z talant117408 Roads (CEOI20_roads) C++17
0 / 100
 4 ms 468 KB 
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 1e9+7;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

struct Point {
	double x, y;
	bool operator < (const Point &other) {
		if (x == other.x) return y < other.y;
		return x < other.x;
	}
};

const int N = 1e5+7;
pair <Point, Point> segments[N];
int n;

bool subtask1() {
	bool flag = 1;
	for (int i = 0; i < n; i++) {
		if (fabs(segments[i].first.x-segments[i].second.x) > eps) flag = 0;
	}
	return flag;
}

bool subtask2() {
	bool flag = 1;
	for (int i = 1; i < n; i++) {
		auto a = segments[i-1];
		auto b = segments[i];
		if (fabs((a.second.y-a.first.y)/(a.second.x-a.first.x)-(b.second.y-b.first.y)/(b.second.x-b.first.x)) > eps) flag = 0;
	}
	return flag;
}

int main() {
	do_not_disturb
	
	cin >> n;
	
	for (int i = 0; i < n; i++) {
		cin >> segments[i].first.x >> segments[i].first.y >> segments[i].second.x >> segments[i].second.y;
	}
	
	if (subtask1()) {
		vector <Point> allp;
		for (int i = 0; i < n; i++) {
			allp.pb(segments[i].first);
			allp.pb(segments[i].second);
		}
		sort(all(allp));
		for (int i = 3; i < n*2; i += 2) {
			if (allp[i].x == allp[i-2].x) {
				cout << allp[i-1].x << ' ' << allp[i-1].y << ' ' << allp[i-2].x << ' ' << allp[i-2].y << endl;
			}
			else {
				cout << allp[i].x << ' ' << allp[i].y << ' ' << allp[i-2].x << ' ' << allp[i-2].y << endl;
			}
		}
	}
	else if (subtask2()) {
		
	}
	
    return 0;
}

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 4 ms 468 KB Expected integer, but "1.00081e+06" found
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 4 ms 460 KB Expected integer, but "1.00081e+06" found
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 4 ms 468 KB Expected integer, but "1.00081e+06" found
4 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -