답안 #106417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106417 2019-04-18T11:13:15 Z username 원 고르기 (APIO18_circle_selection) C++14
49 / 100
3000 ms 294456 KB
#pragma GCC optimize("O3")
#include<stdint.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define VIS(it,con) for(auto it=con.begin();it!=con.end();++it)
#define pob pop_back
#define pf push_front
#define pof pop_front
#define MIN(x,y) (x=min(x,(y)))
#define MAX(x,y) (x=max(x,(y)))
#define mid (l+r>>1)
#define lch (idx*2+1)
#define rch (idx*2+2)
/*****************************************************************************/
#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***********************************/
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;
list<int>::iterator ptr[maxn];

int f2(int x){
	return x*x;
}
 
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);
	REP(i,0,n)ls.pb(i),ptr[i]=--ls.end();
	int k=inf;
	REP(i,0,n){
		if(rmv[i])continue;
		if(2*a[i].r<k){
			k=a[i].r;
			mp.clear();
			VIS(it,ls){
				mp[a[*it].x/k*bl+a[*it].y/k].pb(*it);
			}
		}
		int t1=a[i].y/k+3;
		REP(x,a[i].x/k-2,a[i].x/k+3)REP(y,a[i].y/k-2,t1){
			int t=x*bl+y;
			for(auto it=mp[t].begin();it!=mp[t].end();){
				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;
					ls.erase(ptr[*it]);
					mp[t].erase(it++);
				}else ++it;
			}
		}
	}
	REP(i,0,n)cout<<res[i]+1<<" ";
}

Compilation message

circle_selection.cpp:53:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 0 ms 5120 KB Output is correct
19 Correct 12 ms 5632 KB Output is correct
20 Correct 9 ms 5632 KB Output is correct
21 Correct 13 ms 5632 KB Output is correct
22 Correct 57 ms 9352 KB Output is correct
23 Correct 55 ms 9352 KB Output is correct
24 Correct 41 ms 9352 KB Output is correct
25 Correct 40 ms 9480 KB Output is correct
26 Correct 44 ms 9472 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 37692 KB Output is correct
2 Correct 309 ms 37624 KB Output is correct
3 Correct 266 ms 37444 KB Output is correct
4 Correct 290 ms 37752 KB Output is correct
5 Correct 594 ms 38460 KB Output is correct
6 Correct 1621 ms 76996 KB Output is correct
7 Correct 633 ms 39432 KB Output is correct
8 Correct 982 ms 43064 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 1641 ms 88772 KB Output is correct
3 Execution timed out 3062 ms 294456 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3085 ms 293168 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 0 ms 5120 KB Output is correct
19 Correct 12 ms 5632 KB Output is correct
20 Correct 9 ms 5632 KB Output is correct
21 Correct 13 ms 5632 KB Output is correct
22 Correct 57 ms 9352 KB Output is correct
23 Correct 55 ms 9352 KB Output is correct
24 Correct 41 ms 9352 KB Output is correct
25 Correct 40 ms 9480 KB Output is correct
26 Correct 44 ms 9472 KB Output is correct
27 Correct 15 ms 6272 KB Output is correct
28 Correct 14 ms 6144 KB Output is correct
29 Correct 14 ms 6144 KB Output is correct
30 Correct 101 ms 13756 KB Output is correct
31 Correct 95 ms 13756 KB Output is correct
32 Correct 99 ms 13852 KB Output is correct
33 Correct 102 ms 15844 KB Output is correct
34 Correct 112 ms 15900 KB Output is correct
35 Correct 131 ms 15836 KB Output is correct
36 Correct 1479 ms 90092 KB Output is correct
37 Correct 1420 ms 89668 KB Output is correct
38 Correct 1477 ms 89688 KB Output is correct
39 Correct 822 ms 31224 KB Output is correct
40 Correct 944 ms 31348 KB Output is correct
41 Correct 952 ms 31180 KB Output is correct
42 Correct 316 ms 21640 KB Output is correct
43 Correct 1713 ms 144136 KB Output is correct
44 Correct 1769 ms 144404 KB Output is correct
45 Correct 1934 ms 144068 KB Output is correct
46 Correct 1787 ms 144332 KB Output is correct
47 Correct 1854 ms 144480 KB Output is correct
48 Correct 1796 ms 144368 KB Output is correct
49 Correct 1884 ms 144452 KB Output is correct
50 Correct 1877 ms 144344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5120 KB Output is correct
2 Correct 6 ms 5120 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 5120 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 0 ms 5120 KB Output is correct
19 Correct 12 ms 5632 KB Output is correct
20 Correct 9 ms 5632 KB Output is correct
21 Correct 13 ms 5632 KB Output is correct
22 Correct 57 ms 9352 KB Output is correct
23 Correct 55 ms 9352 KB Output is correct
24 Correct 41 ms 9352 KB Output is correct
25 Correct 40 ms 9480 KB Output is correct
26 Correct 44 ms 9472 KB Output is correct
27 Correct 267 ms 37692 KB Output is correct
28 Correct 309 ms 37624 KB Output is correct
29 Correct 266 ms 37444 KB Output is correct
30 Correct 290 ms 37752 KB Output is correct
31 Correct 594 ms 38460 KB Output is correct
32 Correct 1621 ms 76996 KB Output is correct
33 Correct 633 ms 39432 KB Output is correct
34 Correct 982 ms 43064 KB Output is correct
35 Correct 7 ms 4992 KB Output is correct
36 Correct 1641 ms 88772 KB Output is correct
37 Execution timed out 3062 ms 294456 KB Time limit exceeded
38 Halted 0 ms 0 KB -