oj.uz

답안 #106392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106392 2019-04-18T08:54:47 Z username 원 고르기 (APIO18_circle_selection) C++14
7 / 100
 3000 ms 417260 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];
set<int>st;
unordered_map<int,set<int>>mp;

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;});
	REP(i,0,n)st.insert(i);
	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();
			VIS(it,st){
				mp[a[*it].x/k*bl+a[*it].y/k].insert(*it);
			}
		}
		REP(x,a[i].x/k-2,a[i].x/k+5)REP(y,a[i].y/k-2,a[i].y/k+5){
			for(auto it=mp[x*bl+y].begin();it!=mp[x*bl+y].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;
					st.erase(*it);
					mp[x*bl+y].erase(it++);
				}else ++it;
			}
		}
	}
	REP(i,0,n)cout<<res[i]+1<<" ";
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 5 ms 2660 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 5 ms 2660 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2780 KB Output is correct
11 Correct 5 ms 2944 KB Output is correct
12 Correct 7 ms 2944 KB Output is correct
13 Correct 5 ms 2944 KB Output is correct
14 Correct 5 ms 2944 KB Output is correct
15 Correct 5 ms 2944 KB Output is correct
16 Correct 6 ms 2864 KB Output is correct
17 Correct 6 ms 2892 KB Output is correct
18 Correct 5 ms 2816 KB Output is correct
19 Correct 9 ms 3456 KB Output is correct
20 Correct 10 ms 3456 KB Output is correct
21 Correct 13 ms 3328 KB Output is correct
22 Correct 108 ms 14776 KB Output is correct
23 Correct 105 ms 14652 KB Output is correct
24 Correct 107 ms 14876 KB Output is correct
25 Correct 93 ms 14904 KB Output is correct
26 Correct 105 ms 14888 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 401 ms 44824 KB Output is correct
2 Correct 450 ms 44736 KB Output is correct
3 Correct 398 ms 44464 KB Output is correct
4 Correct 408 ms 44736 KB Output is correct
5 Correct 1234 ms 46004 KB Output is correct
6 Execution timed out 3112 ms 142676 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Execution timed out 3109 ms 232364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3061 ms 417260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 5 ms 2660 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 5 ms 2660 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2780 KB Output is correct
11 Correct 5 ms 2944 KB Output is correct
12 Correct 7 ms 2944 KB Output is correct
13 Correct 5 ms 2944 KB Output is correct
14 Correct 5 ms 2944 KB Output is correct
15 Correct 5 ms 2944 KB Output is correct
16 Correct 6 ms 2864 KB Output is correct
17 Correct 6 ms 2892 KB Output is correct
18 Correct 5 ms 2816 KB Output is correct
19 Correct 9 ms 3456 KB Output is correct
20 Correct 10 ms 3456 KB Output is correct
21 Correct 13 ms 3328 KB Output is correct
22 Correct 108 ms 14776 KB Output is correct
23 Correct 105 ms 14652 KB Output is correct
24 Correct 107 ms 14876 KB Output is correct
25 Correct 93 ms 14904 KB Output is correct
26 Correct 105 ms 14888 KB Output is correct
27 Correct 17 ms 4096 KB Output is correct
28 Correct 19 ms 4096 KB Output is correct
29 Correct 15 ms 4096 KB Output is correct
30 Correct 257 ms 26832 KB Output is correct
31 Correct 263 ms 26888 KB Output is correct
32 Correct 243 ms 27140 KB Output is correct
33 Correct 130 ms 16632 KB Output is correct
34 Correct 142 ms 16560 KB Output is correct
35 Correct 178 ms 16772 KB Output is correct
36 Execution timed out 3045 ms 239428 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 5 ms 2660 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 5 ms 2660 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 4 ms 2688 KB Output is correct
8 Correct 5 ms 2688 KB Output is correct
9 Correct 4 ms 2688 KB Output is correct
10 Correct 4 ms 2780 KB Output is correct
11 Correct 5 ms 2944 KB Output is correct
12 Correct 7 ms 2944 KB Output is correct
13 Correct 5 ms 2944 KB Output is correct
14 Correct 5 ms 2944 KB Output is correct
15 Correct 5 ms 2944 KB Output is correct
16 Correct 6 ms 2864 KB Output is correct
17 Correct 6 ms 2892 KB Output is correct
18 Correct 5 ms 2816 KB Output is correct
19 Correct 9 ms 3456 KB Output is correct
20 Correct 10 ms 3456 KB Output is correct
21 Correct 13 ms 3328 KB Output is correct
22 Correct 108 ms 14776 KB Output is correct
23 Correct 105 ms 14652 KB Output is correct
24 Correct 107 ms 14876 KB Output is correct
25 Correct 93 ms 14904 KB Output is correct
26 Correct 105 ms 14888 KB Output is correct
27 Correct 401 ms 44824 KB Output is correct
28 Correct 450 ms 44736 KB Output is correct
29 Correct 398 ms 44464 KB Output is correct
30 Correct 408 ms 44736 KB Output is correct
31 Correct 1234 ms 46004 KB Output is correct
32 Execution timed out 3112 ms 142676 KB Time limit exceeded
33 Halted 0 ms 0 KB -