답안 #106526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106526 2019-04-19T02:54:12 Z username 원 고르기 (APIO18_circle_selection) C++14
49 / 100
3000 ms 286320 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=3e9;
struct C{int x,y,r,id;}a[maxn];
int n,rmv[maxn],res[maxn];
unordered_map<int,list<int>>mp;
list<int>ls;
 
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;});
//	MST(rmv,0);
	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&tls=mp[x*bl+y];
			for(auto it=tls.begin();it!=tls.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;
//					tls.erase(it++);
				}
			}
		}
	}
	REP(i,0,n)cout<<res[i]+1<<" ";
}

Compilation message

circle_selection.cpp:33:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 284 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 356 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 512 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 7 ms 768 KB Output is correct
21 Correct 7 ms 812 KB Output is correct
22 Correct 35 ms 4624 KB Output is correct
23 Correct 35 ms 4616 KB Output is correct
24 Correct 40 ms 4744 KB Output is correct
25 Correct 31 ms 4752 KB Output is correct
26 Correct 40 ms 4740 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 26004 KB Output is correct
2 Correct 226 ms 25904 KB Output is correct
3 Correct 232 ms 25592 KB Output is correct
4 Correct 245 ms 25976 KB Output is correct
5 Correct 433 ms 27692 KB Output is correct
6 Correct 1394 ms 74472 KB Output is correct
7 Correct 419 ms 30728 KB Output is correct
8 Correct 655 ms 37492 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 1394 ms 83240 KB Output is correct
3 Execution timed out 3050 ms 286320 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3044 ms 284764 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 284 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 356 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 512 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 7 ms 768 KB Output is correct
21 Correct 7 ms 812 KB Output is correct
22 Correct 35 ms 4624 KB Output is correct
23 Correct 35 ms 4616 KB Output is correct
24 Correct 40 ms 4744 KB Output is correct
25 Correct 31 ms 4752 KB Output is correct
26 Correct 40 ms 4740 KB Output is correct
27 Correct 8 ms 1280 KB Output is correct
28 Correct 9 ms 1280 KB Output is correct
29 Correct 8 ms 1124 KB Output is correct
30 Correct 82 ms 8992 KB Output is correct
31 Correct 75 ms 9020 KB Output is correct
32 Correct 89 ms 9020 KB Output is correct
33 Correct 73 ms 8824 KB Output is correct
34 Correct 75 ms 8776 KB Output is correct
35 Correct 85 ms 8824 KB Output is correct
36 Correct 1510 ms 84632 KB Output is correct
37 Correct 1501 ms 84304 KB Output is correct
38 Correct 1528 ms 84136 KB Output is correct
39 Correct 682 ms 27144 KB Output is correct
40 Correct 626 ms 27128 KB Output is correct
41 Correct 629 ms 27000 KB Output is correct
42 Correct 263 ms 14472 KB Output is correct
43 Correct 1599 ms 140232 KB Output is correct
44 Correct 1767 ms 140356 KB Output is correct
45 Correct 1699 ms 140268 KB Output is correct
46 Correct 1608 ms 140404 KB Output is correct
47 Correct 1571 ms 140572 KB Output is correct
48 Correct 1677 ms 140496 KB Output is correct
49 Correct 1773 ms 140580 KB Output is correct
50 Correct 1636 ms 140140 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 284 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 356 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 512 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 7 ms 768 KB Output is correct
21 Correct 7 ms 812 KB Output is correct
22 Correct 35 ms 4624 KB Output is correct
23 Correct 35 ms 4616 KB Output is correct
24 Correct 40 ms 4744 KB Output is correct
25 Correct 31 ms 4752 KB Output is correct
26 Correct 40 ms 4740 KB Output is correct
27 Correct 247 ms 26004 KB Output is correct
28 Correct 226 ms 25904 KB Output is correct
29 Correct 232 ms 25592 KB Output is correct
30 Correct 245 ms 25976 KB Output is correct
31 Correct 433 ms 27692 KB Output is correct
32 Correct 1394 ms 74472 KB Output is correct
33 Correct 419 ms 30728 KB Output is correct
34 Correct 655 ms 37492 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 1394 ms 83240 KB Output is correct
37 Execution timed out 3050 ms 286320 KB Time limit exceeded
38 Halted 0 ms 0 KB -