oj.uz

Submission #516767

# Submission time Handle Problem Language Result Execution time Memory
516767 2022-01-22T06:00:47 Z mansur Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 16808 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;
	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] << ' ';
}

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

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 4 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 63 ms 632 KB Output is correct
23 Correct 73 ms 632 KB Output is correct
24 Correct 88 ms 632 KB Output is correct
25 Correct 73 ms 640 KB Output is correct
26 Correct 69 ms 628 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 16792 KB Output is correct
2 Correct 189 ms 16808 KB Output is correct
3 Correct 191 ms 16808 KB Output is correct
4 Correct 208 ms 16748 KB Output is correct
5 Execution timed out 3086 ms 16752 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 3046 ms 4944 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3093 ms 16736 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 4 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 63 ms 632 KB Output is correct
23 Correct 73 ms 632 KB Output is correct
24 Correct 88 ms 632 KB Output is correct
25 Correct 73 ms 640 KB Output is correct
26 Correct 69 ms 628 KB Output is correct
27 Correct 6 ms 976 KB Output is correct
28 Correct 5 ms 848 KB Output is correct
29 Correct 5 ms 848 KB Output is correct
30 Correct 269 ms 952 KB Output is correct
31 Correct 320 ms 848 KB Output is correct
32 Correct 267 ms 848 KB Output is correct
33 Correct 65 ms 5588 KB Output is correct
34 Correct 54 ms 5612 KB Output is correct
35 Correct 78 ms 5520 KB Output is correct
36 Execution timed out 3100 ms 4912 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory 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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 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 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 3 ms 592 KB Output is correct
20 Correct 4 ms 592 KB Output is correct
21 Correct 3 ms 592 KB Output is correct
22 Correct 63 ms 632 KB Output is correct
23 Correct 73 ms 632 KB Output is correct
24 Correct 88 ms 632 KB Output is correct
25 Correct 73 ms 640 KB Output is correct
26 Correct 69 ms 628 KB Output is correct
27 Correct 176 ms 16792 KB Output is correct
28 Correct 189 ms 16808 KB Output is correct
29 Correct 191 ms 16808 KB Output is correct
30 Correct 208 ms 16748 KB Output is correct
31 Execution timed out 3086 ms 16752 KB Time limit exceeded
32 Halted 0 ms 0 KB -