oj.uz

답안 #107301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107301 2019-04-23T07:46:01 Z leduykhongngu 원 고르기 (APIO18_circle_selection) C++11
72 / 100
 3000 ms 66020 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; ++i)
#define FORR(i,a,b) for (int i=(a),_b=(b); i>=_b; --i)
#define REP(i,b) for (int i=0,_b=(b); i<_b; ++i)
#define endl '\n'
#define sz(x) (int) x.size()
#define mod %
#define fillchar(x,y,z) memset(x,z,y)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
typedef long long int64;
typedef unsigned long long qword;
using namespace std;
int ReadInt()
{
    char c;
    for (c = getchar(); c!='-'&&(c < '0' || c > '9'); c = getchar());
    int nega=0;
    int ans = c - '0';
    if (c=='-') nega=1,ans=0;
    for (c = getchar(); c >= '0' && c <= '9'; c = getchar())
        ans = ans * 10 + c - '0';
    if (nega) return -ans;
    return ans;
}
void WriteInt(int x)
{
    if (x > 9) WriteInt(x / 10);
    putchar(x % 10 + '0');
}
const int maxn=3e5+5;
inline int64 sqr(int64 x)
{
    return x*x;
}
struct Circle{
    int64 x,y,r;
    int id;

    bool IsIntersect(const Circle &c)
    {
        return sqr(x-c.x)+sqr(y-c.y)<=sqr(r+c.r);
    }
}cir[maxn];
bool operator <(const Circle &b,const Circle &c)
    {
        return mp(-b.r,b.id)<mp(-c.r,c.id);
    }
vector<set<pii> > Point;
vector<int> X;
int n;
int ans[maxn];
pii tmp[maxn];
int main()
{
    #ifdef meomeomeooooo
        freopen("input.txt","r",stdin);
        //freopen(".txt","w",stdout);
    #endif // meomeomeooooo
    iostream::sync_with_stdio(false);
    cin.tie(0);
    n=ReadInt();
    set<Circle> myset;
    FOR(i,1,n) {
        //cin >> cir[i].x >> cir[i].y >> cir[i].r;
        cir[i].x=ReadInt(); cir[i].y=ReadInt(); cir[i].r=ReadInt();
        X.push_back(cir[i].x);
        cir[i].id=i;
        myset.insert(cir[i]);
    }
    sort(X.begin(),X.end());
    X.resize(unique(X.begin(),X.end())-X.begin());
    #define GetDec(x) (lower_bound(X.begin(),X.end(),x)-X.begin())
    Point.resize(X.size());
    FOR(i,1,n) {
        int x=GetDec(cir[i].x);
        Point[x].insert({cir[i].y,cir[i].id});
    }
    while (myset.size()) {
        Circle cur=*myset.begin(); myset.erase(cur);
        ans[cur.id]=cur.id;
        int x=cur.x,y=cur.y,r=cur.r;
        int Lx=max(1ll*x-2*r,-1000000000ll);
        int Rx=min(1ll*x+2*r,1000000000ll);
        Lx=GetDec(Lx);
        for (int i=Lx; i<X.size()&&X[i]<=Rx; ++i) {
            int top=0;
            int64 meomeo=sqrt(4ll*r*r-sqr(X[i]-x));
            int Ly=max(1ll*y-meomeo,-1000000000ll);
            int Ry=min(1ll*y+meomeo,1000000000ll);
//            int Ly=max(1ll*y-2*r,-1000000000ll);
//            int Ry=min(1ll*y+2*r,1000000000ll);
            for (auto j=Point[i].lower_bound(mp(Ly,0)); j!=Point[i].end()&&(*j).fi<=Ry; ++j) {
                int id=(*j).se;
                if (cur.IsIntersect(cir[id])) {
                    assert(ans[id]==0||ans[id]==cur.id);
                    ans[id]=cur.id;
                    myset.erase(cir[id]);
                    tmp[++top]=*j;
                }
            }
            FOR(j,1,top)
                Point[i].erase(tmp[j]);
        }
    }
    FOR(i,1,n) {
        WriteInt(ans[i]); putchar(' ');
    }
    return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:89:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=Lx; i<X.size()&&X[i]<=Rx; ++i) {
                        ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 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 3 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 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 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 9 ms 1408 KB Output is correct
20 Correct 10 ms 1536 KB Output is correct
21 Correct 8 ms 1408 KB Output is correct
22 Correct 12 ms 1408 KB Output is correct
23 Correct 13 ms 1380 KB Output is correct
24 Correct 11 ms 1408 KB Output is correct
25 Correct 10 ms 1408 KB Output is correct
26 Correct 10 ms 1408 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1364 ms 65864 KB Output is correct
2 Correct 1308 ms 66020 KB Output is correct
3 Correct 1341 ms 65512 KB Output is correct
4 Correct 1328 ms 65988 KB Output is correct
5 Correct 1118 ms 61156 KB Output is correct
6 Correct 1066 ms 65608 KB Output is correct
7 Correct 1136 ms 64996 KB Output is correct
8 Correct 1042 ms 65480 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 378 ms 22140 KB Output is correct
3 Correct 1665 ms 65780 KB Output is correct
4 Correct 1677 ms 65808 KB Output is correct
5 Correct 2418 ms 64124 KB Output is correct
6 Correct 787 ms 34408 KB Output is correct
7 Correct 343 ms 18288 KB Output is correct
8 Correct 36 ms 4092 KB Output is correct
9 Correct 1918 ms 65764 KB Output is correct
10 Execution timed out 3036 ms 63896 KB Time limit exceeded

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 874 ms 65864 KB Output is correct
2 Correct 588 ms 65692 KB Output is correct
3 Correct 2798 ms 65536 KB Output is correct
4 Correct 600 ms 65764 KB Output is correct
5 Correct 610 ms 65868 KB Output is correct
6 Correct 2379 ms 65252 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 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 3 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 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 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 9 ms 1408 KB Output is correct
20 Correct 10 ms 1536 KB Output is correct
21 Correct 8 ms 1408 KB Output is correct
22 Correct 12 ms 1408 KB Output is correct
23 Correct 13 ms 1380 KB Output is correct
24 Correct 11 ms 1408 KB Output is correct
25 Correct 10 ms 1408 KB Output is correct
26 Correct 10 ms 1408 KB Output is correct
27 Correct 16 ms 2560 KB Output is correct
28 Correct 16 ms 2480 KB Output is correct
29 Correct 20 ms 2540 KB Output is correct
30 Correct 22 ms 2536 KB Output is correct
31 Correct 28 ms 2560 KB Output is correct
32 Correct 17 ms 2560 KB Output is correct
33 Correct 318 ms 22228 KB Output is correct
34 Correct 278 ms 22124 KB Output is correct
35 Correct 267 ms 22128 KB Output is correct
36 Correct 287 ms 22076 KB Output is correct
37 Correct 321 ms 22068 KB Output is correct
38 Correct 331 ms 22152 KB Output is correct
39 Correct 1312 ms 17492 KB Output is correct
40 Correct 1121 ms 17392 KB Output is correct
41 Correct 1245 ms 17620 KB Output is correct
42 Correct 275 ms 17392 KB Output is correct
43 Correct 203 ms 22128 KB Output is correct
44 Correct 189 ms 22128 KB Output is correct
45 Correct 186 ms 22128 KB Output is correct
46 Correct 181 ms 22056 KB Output is correct
47 Correct 183 ms 22124 KB Output is correct
48 Correct 182 ms 22028 KB Output is correct
49 Correct 193 ms 22168 KB Output is correct
50 Correct 196 ms 22128 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 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 3 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 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 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 9 ms 1408 KB Output is correct
20 Correct 10 ms 1536 KB Output is correct
21 Correct 8 ms 1408 KB Output is correct
22 Correct 12 ms 1408 KB Output is correct
23 Correct 13 ms 1380 KB Output is correct
24 Correct 11 ms 1408 KB Output is correct
25 Correct 10 ms 1408 KB Output is correct
26 Correct 10 ms 1408 KB Output is correct
27 Correct 1364 ms 65864 KB Output is correct
28 Correct 1308 ms 66020 KB Output is correct
29 Correct 1341 ms 65512 KB Output is correct
30 Correct 1328 ms 65988 KB Output is correct
31 Correct 1118 ms 61156 KB Output is correct
32 Correct 1066 ms 65608 KB Output is correct
33 Correct 1136 ms 64996 KB Output is correct
34 Correct 1042 ms 65480 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 378 ms 22140 KB Output is correct
37 Correct 1665 ms 65780 KB Output is correct
38 Correct 1677 ms 65808 KB Output is correct
39 Correct 2418 ms 64124 KB Output is correct
40 Correct 787 ms 34408 KB Output is correct
41 Correct 343 ms 18288 KB Output is correct
42 Correct 36 ms 4092 KB Output is correct
43 Correct 1918 ms 65764 KB Output is correct
44 Execution timed out 3036 ms 63896 KB Time limit exceeded