oj.uz

답안 #516816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516816 2022-01-22T07:06:53 Z mansur 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 517 ms 79180 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 1e6, mod = 998244353;                    

double eps = 1e-6;

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

double dst(double x1, double y1, double x2, double y2) {
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
} 

main() {                                                         
	//freopen("F.in", "r", stdin);                                                                                     
	//freopen("F.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n;
	cin >> n;
	if (n <= 5000) {
		vector<pair<pii, pii>> s;
		for (int i = 1, x, y, r; i <= n; i++) {
			cin >> x >> y >> r;
			s.pb({{inf - r, i}, {x, y}});
		}
		int ans[n + 1];
		vector<int> was(n + 1);
		sort(all(s));
		for (auto x: s) {
			if (was[x.ff.ss]) continue;
			was[x.ff.ss] = 1;
			ans[x.ff.ss] = x.ff.ss;
			for (auto y: s) {
    	    	if (was[y.ff.ss]) continue;
    	    	if (dst(x.ss.ff, x.ss.ss, y.ss.ff, y.ss.ss) - double(inf * 2 - x.ff.ff - y.ff.ff) <= eps) {
    	    		ans[y.ff.ss] = x.ff.ss;
    	    		was[y.ff.ss] = 1;
    	    	}
    	    }
		}
		for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
	}else {
		vector<pii> s, h, lg, rg;
		int x[n + 1], y[n + 1], r[n + 1];
		int tl[n + 1], tr[n + 1];
		vector<int> ans(n + 1);
		set<int> t;
		for (int i = 1; i <= n; i++) {
			cin >> x[i] >> y[i] >> r[i];
			s.pb({x[i] - r[i], i});
			s.pb({x[i] + r[i], i});
			lg.pb({x[i] - r[i], i});
			rg.pb({x[i] + r[i], i});
			h.pb({inf - r[i], i});
		}
		for (int i = 0; i < n * 2; i++) t.insert(i);
		sort(all(h));
		sort(all(s));
		sort(all(lg));
		sort(rall(rg));
		int l = 0;
		for (auto e: lg) {
			while (l < n * 2 && s[l].ff < e.ff) l++;
			tl[e.ss] = l;			
		}
		reverse(all(s));
		l = 0;
		for (auto e: rg) {
			while (l < n * 2 && s[l].ff > e.ff) l++;
			tr[e.ss] = n * 2 - l - 1;
		}
		reverse(all(s));
		for (auto e: h) { 	
			if (ans[e.ss]) continue;
			auto it = t.lower_bound(tl[e.ss]);
			vector<int> cur;
			while (it != t.end() && *it <= tr[e.ss]) {
				ans[s[*it].ss] = e.ss;
				cur.pb(*it);
				it++;
			}
			for (auto e: cur) t.erase(e);
		}
		for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
	}
}

Compilation message

circle_selection.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
circle_selection.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
circle_selection.cpp:41:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 684 KB Output is correct
22 Correct 60 ms 640 KB Output is correct
23 Correct 58 ms 632 KB Output is correct
24 Correct 66 ms 628 KB Output is correct
25 Correct 60 ms 636 KB Output is correct
26 Correct 69 ms 636 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 684 KB Output is correct
22 Correct 60 ms 640 KB Output is correct
23 Correct 58 ms 632 KB Output is correct
24 Correct 66 ms 628 KB Output is correct
25 Correct 60 ms 636 KB Output is correct
26 Correct 69 ms 636 KB Output is correct
27 Incorrect 14 ms 3012 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 3 ms 592 KB Output is correct
21 Correct 3 ms 684 KB Output is correct
22 Correct 60 ms 640 KB Output is correct
23 Correct 58 ms 632 KB Output is correct
24 Correct 66 ms 628 KB Output is correct
25 Correct 60 ms 636 KB Output is correct
26 Correct 69 ms 636 KB Output is correct
27 Incorrect 455 ms 79180 KB Output isn't correct
28 Halted 0 ms 0 KB -