제출 #102373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102373		tjdgus4384	원 고르기 (APIO18_circle_selection)	C++14	0 / 100	204 ms	8696 KiB

circle_selection

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
vector<pair<pair<int, int>, pair<int, int> > > v;
vector<int> answer;
bool visited[300002];

bool can(int a, int b){
    int ax = v[a].second.first;
    int ay = v[a].second.second;
    int bx = v[b].second.first;
    int by = v[b].second.second;
    long long int x = (ax - bx) * (ax - bx) + (ay - by) * (ay - by);
    long long int y = (v[a].first.first + v[b].first.first) * (v[a].first.first + v[b].first.first);
    return y >= x;
}

int main(){
    int n;
    scanf("%d", &n);
    v.resize(n + 1);
    answer.resize(n + 1);
    for(int i = 1;i <= n;i++){
        scanf("%d %d %d", &v[i].second.first, &v[i].second.second, &v[i].first.first);
        v[i].first.second = i;
        v[i].first.first = -v[i].first.first;
        answer[i] = i;
    }
    sort(v.begin(), v.end());
    for(int i = 1;i <= n;i++){
        if(visited[i]) continue;
        for(int j = i + 1;j < n;j++){
            if(visited[j]) continue;
            if(can(i, j)){
                answer[v[j].first.second] = v[i].first.second;
                visited[j] = true;
            }
        }
    }
    for(int i = 1;i < n;i++){
        printf("%d ", answer[i]);
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
circle_selection.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &v[i].second.first, &v[i].second.second, &v[i].first.first);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13