oj.uz

Submission #107300

# Submission time Handle Problem Language Result Execution time Memory
107300 2019-04-23T07:44:20 Z leduykhongngu Circle selection (APIO18_circle_selection) C++11
72 / 100
 3000 ms 65968 KB 
#include <bits/stdc++.h>
#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:88: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

# 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 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 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 3 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 2 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 3 ms 512 KB Output is correct
19 Correct 9 ms 1536 KB Output is correct
20 Correct 10 ms 1492 KB Output is correct
21 Correct 9 ms 1408 KB Output is correct
22 Correct 11 ms 1408 KB Output is correct
23 Correct 14 ms 1408 KB Output is correct
24 Correct 9 ms 1408 KB Output is correct
25 Correct 9 ms 1408 KB Output is correct
26 Correct 9 ms 1408 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1286 ms 65968 KB Output is correct
2 Correct 1371 ms 65888 KB Output is correct
3 Correct 1285 ms 65736 KB Output is correct
4 Correct 1366 ms 65852 KB Output is correct
5 Correct 1118 ms 61120 KB Output is correct
6 Correct 1042 ms 65704 KB Output is correct
7 Correct 1100 ms 64996 KB Output is correct
8 Correct 1099 ms 65192 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 451 ms 22060 KB Output is correct
3 Correct 1736 ms 65828 KB Output is correct
4 Correct 1608 ms 65812 KB Output is correct
5 Correct 2556 ms 63908 KB Output is correct
6 Correct 793 ms 34516 KB Output is correct
7 Correct 304 ms 18412 KB Output is correct
8 Correct 35 ms 4088 KB Output is correct
9 Correct 1932 ms 65800 KB Output is correct
10 Execution timed out 3012 ms 63904 KB Time limit exceeded

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 762 ms 65736 KB Output is correct
2 Correct 551 ms 65676 KB Output is correct
3 Correct 2490 ms 65404 KB Output is correct
4 Correct 556 ms 65764 KB Output is correct
5 Correct 547 ms 65952 KB Output is correct
6 Correct 2515 ms 65132 KB Output is correct

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 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 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 3 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 2 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 3 ms 512 KB Output is correct
19 Correct 9 ms 1536 KB Output is correct
20 Correct 10 ms 1492 KB Output is correct
21 Correct 9 ms 1408 KB Output is correct
22 Correct 11 ms 1408 KB Output is correct
23 Correct 14 ms 1408 KB Output is correct
24 Correct 9 ms 1408 KB Output is correct
25 Correct 9 ms 1408 KB Output is correct
26 Correct 9 ms 1408 KB Output is correct
27 Correct 19 ms 2560 KB Output is correct
28 Correct 19 ms 2560 KB Output is correct
29 Correct 24 ms 2552 KB Output is correct
30 Correct 26 ms 2552 KB Output is correct
31 Correct 18 ms 2560 KB Output is correct
32 Correct 19 ms 2560 KB Output is correct
33 Correct 350 ms 22124 KB Output is correct
34 Correct 350 ms 22128 KB Output is correct
35 Correct 343 ms 22204 KB Output is correct
36 Correct 313 ms 22148 KB Output is correct
37 Correct 304 ms 22128 KB Output is correct
38 Correct 332 ms 22120 KB Output is correct
39 Correct 1483 ms 17552 KB Output is correct
40 Correct 1339 ms 17388 KB Output is correct
41 Correct 1467 ms 17484 KB Output is correct
42 Correct 316 ms 17392 KB Output is correct
43 Correct 183 ms 22124 KB Output is correct
44 Correct 177 ms 22172 KB Output is correct
45 Correct 200 ms 22128 KB Output is correct
46 Correct 185 ms 22092 KB Output is correct
47 Correct 173 ms 22124 KB Output is correct
48 Correct 193 ms 22128 KB Output is correct
49 Correct 223 ms 22084 KB Output is correct
50 Correct 179 ms 22256 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 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 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 3 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 2 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 3 ms 512 KB Output is correct
19 Correct 9 ms 1536 KB Output is correct
20 Correct 10 ms 1492 KB Output is correct
21 Correct 9 ms 1408 KB Output is correct
22 Correct 11 ms 1408 KB Output is correct
23 Correct 14 ms 1408 KB Output is correct
24 Correct 9 ms 1408 KB Output is correct
25 Correct 9 ms 1408 KB Output is correct
26 Correct 9 ms 1408 KB Output is correct
27 Correct 1286 ms 65968 KB Output is correct
28 Correct 1371 ms 65888 KB Output is correct
29 Correct 1285 ms 65736 KB Output is correct
30 Correct 1366 ms 65852 KB Output is correct
31 Correct 1118 ms 61120 KB Output is correct
32 Correct 1042 ms 65704 KB Output is correct
33 Correct 1100 ms 64996 KB Output is correct
34 Correct 1099 ms 65192 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 451 ms 22060 KB Output is correct
37 Correct 1736 ms 65828 KB Output is correct
38 Correct 1608 ms 65812 KB Output is correct
39 Correct 2556 ms 63908 KB Output is correct
40 Correct 793 ms 34516 KB Output is correct
41 Correct 304 ms 18412 KB Output is correct
42 Correct 35 ms 4088 KB Output is correct
43 Correct 1932 ms 65800 KB Output is correct
44 Execution timed out 3012 ms 63904 KB Time limit exceeded