oj.uz

답안 #104102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104102 2019-04-04T03:20:52 Z dimash241 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 13156 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (int i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (int i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;
inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; } 
inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int u[N];
struct cir {
	int x, y, r, id;

	bool operator < (const cir &b) const {
		return r > b.r || (r == b.r && id < b.id);
	}
}w[N];
ld dist (ll x, ll y, ll x1, ll y1) {
	return (x - x1) * (x - x1) + (y - y1) * (y - y1);
}
int main () {               
    cin >> n;
    for (int i = 1; i <= n; i ++) {
    	cin >> w[i].x >> w[i].y >> w[i].r;
    	w[i].id = i;
    }
    sort(w + 1, w + n + 1);

    for (int i = 1; i <= n; i ++) {
    	if (u[w[i].id]) continue;
    	for (int j = i + 1; j <= n; j ++) {
    	//	cout << dist(w[i].x, w[i].y, w[j].x, w[j].y) << ' ' << w[j].id << ' ' << (w[i].r + w[j].r) * (w[i].r + w[j].r) << '\n';
    		if (!u[w[j].id] && dist(w[i].x, w[i].y, w[j].x, w[j].y) <= (w[i].r + w[j].r) * (w[i].r + w[j].r)) {
    	//		cout << "yes\n";
    			u[w[j].id] = w[i].id;
    		
    		}
    	}
    	u[w[i].id] = w[i].id;
    }
    for (int i = 1; i <= n; i ++)
    	cout << u[i] << ' ';

    return Accepted;
}

// B...a D....

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3049 ms 12876 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3019 ms 13156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -