oj.uz

Submission #106522

# Submission time Handle Problem Language Result Execution time Memory
106522 2019-04-19T02:44:51 Z username Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 286440 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define int int_fast64_t
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> VI;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back
#define F first
#define S second
#define endl '\n'
//																#define __debug
#ifdef __debug
	#define IOS (void)0
	#define de(...) cerr<<__VA_ARGS__
	#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}
#else
	#define IOS cin.tie(0),cout.tie(0),ios_base::sync_with_stdio(false)
	#define de(...) (void)0
	#define ar(...) (void)0
#endif
/***********************************default***********************************/
#define f2(x) ((x)*(x))
const int maxn=3e5+9,inf=1ll<<60,bl=2e9+3;
struct C{int x,y,r,id;}a[maxn];
int n,rmv[maxn],res[maxn];
unordered_map<int,vector<int>>mp;
 
main(){
	IOS;
	cin>>n;
	REP(i,0,n)cin>>a[i].x>>a[i].y>>a[i].r,a[i].id=i;
	sort(a,a+n,[](C x,C y){return x.r==y.r?x.id<y.id:x.r>y.r;});
	int k=inf;
	REP(i,0,n){
		if(rmv[i])continue;
		if(2*a[i].r<k){
			k=a[i].r;
			mp.clear();
			REP(j,0,n){
				if(!rmv[j]){
					mp[a[j].x/k*bl+a[j].y/k].pb(j);
				}
			}
		}
		REP(x,a[i].x/k-2,a[i].x/k+3)REP(y,a[i].y/k-2,a[i].y/k+3){
			auto end=mp[x*bl+y].end();
			for(auto it=mp[x*bl+y].begin();it!=end;++it){
				if(rmv[*it])continue;
				C c=a[*it];
				if(f2(a[i].x-c.x)+f2(a[i].y-c.y)<=f2(a[i].r+c.r)){
					res[c.id]=a[i].id;
					rmv[*it]=1;
//					mp[x*bl+y].erase(it++);
				}
			}
		}
	}
	REP(i,0,n)cout<<res[i]+1<<" ";
}

Compilation message

circle_selection.cpp:32:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 34 ms 4616 KB Output is correct
23 Correct 37 ms 4624 KB Output is correct
24 Correct 33 ms 4624 KB Output is correct
25 Correct 48 ms 4716 KB Output is correct
26 Correct 40 ms 4668 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 16916 KB Output is correct
2 Correct 227 ms 18468 KB Output is correct
3 Correct 211 ms 18784 KB Output is correct
4 Correct 169 ms 17000 KB Output is correct
5 Correct 274 ms 21900 KB Output is correct
6 Correct 1476 ms 70580 KB Output is correct
7 Correct 433 ms 25380 KB Output is correct
8 Correct 690 ms 30844 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1682 ms 83188 KB Output is correct
3 Execution timed out 3121 ms 286440 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 34 ms 4616 KB Output is correct
23 Correct 37 ms 4624 KB Output is correct
24 Correct 33 ms 4624 KB Output is correct
25 Correct 48 ms 4716 KB Output is correct
26 Correct 40 ms 4668 KB Output is correct
27 Correct 11 ms 1008 KB Output is correct
28 Correct 8 ms 1024 KB Output is correct
29 Correct 14 ms 1012 KB Output is correct
30 Correct 99 ms 9136 KB Output is correct
31 Correct 97 ms 9020 KB Output is correct
32 Correct 94 ms 9016 KB Output is correct
33 Correct 65 ms 6636 KB Output is correct
34 Correct 66 ms 6768 KB Output is correct
35 Correct 81 ms 6124 KB Output is correct
36 Correct 1433 ms 84700 KB Output is correct
37 Correct 1387 ms 84304 KB Output is correct
38 Correct 1496 ms 84280 KB Output is correct
39 Correct 597 ms 27020 KB Output is correct
40 Correct 617 ms 26648 KB Output is correct
41 Correct 579 ms 26600 KB Output is correct
42 Correct 310 ms 14604 KB Output is correct
43 Correct 1718 ms 140228 KB Output is correct
44 Correct 1760 ms 140300 KB Output is correct
45 Correct 1730 ms 140336 KB Output is correct
46 Correct 1717 ms 140348 KB Output is correct
47 Correct 1723 ms 140484 KB Output is correct
48 Correct 1685 ms 140356 KB Output is correct
49 Correct 2454 ms 140504 KB Output is correct
50 Correct 1770 ms 140248 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 5 ms 768 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 4 ms 640 KB Output is correct
22 Correct 34 ms 4616 KB Output is correct
23 Correct 37 ms 4624 KB Output is correct
24 Correct 33 ms 4624 KB Output is correct
25 Correct 48 ms 4716 KB Output is correct
26 Correct 40 ms 4668 KB Output is correct
27 Correct 234 ms 16916 KB Output is correct
28 Correct 227 ms 18468 KB Output is correct
29 Correct 211 ms 18784 KB Output is correct
30 Correct 169 ms 17000 KB Output is correct
31 Correct 274 ms 21900 KB Output is correct
32 Correct 1476 ms 70580 KB Output is correct
33 Correct 433 ms 25380 KB Output is correct
34 Correct 690 ms 30844 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 1682 ms 83188 KB Output is correct
37 Execution timed out 3121 ms 286440 KB Time limit exceeded
38 Halted 0 ms 0 KB -