Submission #516780

#	Time	Username	Problem	Language	Result	Execution time	Memory
516780		mansur	Circle selection (APIO18_circle_selection)	C++17	7 / 100	291 ms	71752 KiB

circle_selection

#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<pair<pii, int>> s;
		for (int i = 1, x, y, r; i <= n; i++) {
			cin >> x >> y >> r;
			s.pb({{x, r}, i});						
		}
		sort(all(s));
		int l[n], r[n], ans[n + 1], tl = 0;
		for (int i = 0; i < n; i++) {
			while (abs(s[tl].ff.ff - s[i].ff.ff) <= s[tl].ff.ss - s[i].ff.ss) tl++;
			l[i] = tl - 1;	
		}
		reverse(all(s));
		tl = 0;
		for (int i = 0; i < n; i++) {
			while (abs(s[tl].ff.ff - s[i].ff.ff) <= s[tl].ff.ss - s[i].ff.ss) tl++;
			r[i] = n - tl;	
		}
		reverse(all(s));
		vector<pii> h;
		set<int> t;
		for (auto e: s) {
			h.pb({inf - e.ff.ss, e.ss});
			t.insert(e.ss);
		}
		for (auto x: h) {
			if (t.find(x.ss) == t.end()) continue;
			auto it = t.lower_bound(l[x.ss]);
			while (it != t.end() && *it <= r[x.ss]) {
				ans[*it] = x.ss;
				t.erase(it);
			}
		}
		for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
	}
}
                                            

Compilation message (stderr)

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 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13