oj.uz

답안 #54085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54085 2018-07-02T09:52:34 Z Bodo171 원 고르기 (APIO18_circle_selection) C++14
0 / 100
 156 ms 15068 KB 
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int nmax=100005;
pair<int,int>  v[nmax];
long long x[nmax],y[nmax],r[nmax];
int tt[nmax];
int n,i,j;
bool ok(int A,int B)
{
    return (1LL*(x[A]-x[B])*(x[A]-x[B])+1LL*(y[A]-y[B])*(y[A]-y[B])<=1LL*(r[A]+r[B])*(r[A]+r[B]));
}
bool comp(pair<int,int> unu,pair<int,int> doi)
{
    if(unu.first==doi.first) return unu.second<doi.second;
    return unu.first>doi.first;
}
int main()
{
    //freopen("data.in","r",stdin);
    cin>>n;
    bool zr=1;
    for(i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i]>>r[i];
        v[i].first=r[i];
        v[i].second=i;
        if(y[i]!=0)
        {
            zr=0;
        }
    }
    if(n<=5000)
    {
        sort(v+1,v+n+1,comp);
        for(i=1;i<=n;i++)
            if(!tt[v[i].second])
        {
            tt[v[i].second]=v[i].second;
            for(j=i+1;j<=n;j++)
            {
                if(ok(v[i].second,v[j].second))
                    tt[v[j].second]=v[i].second;
            }
        }
        for(i=1;i<=n;i++)
            cout<<tt[i]<<' ';
        return 0;
    }
    if(zr)
    {
        return 0;
    }
    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 708 KB Output is correct
8 Incorrect 3 ms 736 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 125 ms 9476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9476 KB Output is correct
2 Incorrect 149 ms 12228 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 156 ms 15068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 708 KB Output is correct
8 Incorrect 3 ms 736 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 612 KB Output is correct
5 Correct 2 ms 612 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 2 ms 708 KB Output is correct
8 Incorrect 3 ms 736 KB Output isn't correct
9 Halted 0 ms 0 KB -