oj.uz

답안 #829959

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829959 2023-08-18T16:18:06 Z FatihSolak 원 고르기 (APIO18_circle_selection) C++17
0 / 100
 3000 ms 180484 KB 
#include <bits/stdc++.h>
#define N 300005
using namespace std;
int x[N],y[N],c[N];
int ans[N];
int t[N];
void solve(){
    int n;
    cin >> n;
    vector<int> ord;
    for(int i = 1;i<=n;i++){
        cin >> x[i] >> y[i] >> c[i];
        ord.push_back(i);
    }
    sort(ord.begin(),ord.end(),[&](int a,int b){
        if(c[a] == c[b])
            return a < b;
        return c[a] > c[b];
    });
    set<pair<long long,int>> s[3][3];
    set<pair<long long,int>> s2[3][3][3];
    set<int> alive;
    int cnt = 0;
    for(auto u:ord){
        int num = -1;
        vector<int> cand;
        // for(auto xx:alive)
        //     cand.push_back(xx);
        for(int i = -1;i<=1;i++){
            for(int j = -1;j<=1;j++){
                // for(int k = -1;k<=1;k++){
                    long long sum = 0;
                    sum += i * x[u];
                    sum += j * y[u];
                    // sum += k * c[u];
                    auto it = s[i + 1][j + 1].lower_bound({sum,0});
                    if(it != s[i+1][j+1].end()){
                        cand.push_back(it->second);
                    }
                    if(it != s[i+1][j+1].begin()){
                        cand.push_back(prev(it)->second);
                    }
                // }
            }
        }
        // for(int i = -1;i<=1;i++){
        //     for(int j = -1;j<=1;j++){
        //         for(int k = -1;k<=1;k++){
        //             long long sum = 0;
        //             sum += (long long)i * x[u] * x[u];
        //             sum += (long long)j * y[u] * y[i];
        //             sum += (long long)k * c[u] * c[u];
        //             auto it = s2[i + 1][j + 1][k + 1].lower_bound({sum,0});
        //             if(it != s2[i+1][j+1][k+1].end()){
        //                 cand.push_back(it->second);
        //             }
        //             if(it != s2[i+1][j+1][k+1].begin()){
        //                 cand.push_back(prev(it)->second);
        //             }
        //         }
        //     }
        // }
        for(auto cc:cand){
            long long val1 = (long long)(c[u] + c[cc]) *(c[u] + c[cc]);
            long long val2 =  (long long)(x[u] - x[cc]) *(x[u] - x[cc])
            + (long long)(y[u] - y[cc]) *(y[u] - y[cc]);
            if(val2 <= val1){
                if(num == -1 || t[u] < t[num])
                    num = cc;
            }
        }
        if(num == -1){
            alive.insert(u);
            t[u] =cnt++;
            ans[u] = u;
            for(int i = -1;i<=1;i++){
                for(int j = -1;j<=1;j++){
                    // for(int k = -1;k<=1;k++){
                        long long sum = 0;
                        sum += i * x[u];
                        sum += j * y[u];
                        // sum += k * c[u];
                        s[i + 1][j + 1].insert({sum,u});
                    // }
                }
            }
            // for(int i = -1;i<=1;i++){
            //     for(int j = -1;j<=1;j++){
            //         for(int k = -1;k<=1;k++){
            //             long long sum = 0;
            //             sum += (long long)i * x[u] * x[u];
            //             sum += (long long)j * y[u] * y[i];
            //             sum += (long long)k * c[u] * c[u];
            //             s2[i + 1][j + 1][k + 1].insert({sum,u});
            //         }
            //     }
            // }
        }
        else ans[u] = num;
    }
    for(int i = 1;i<=n;i++){
        cout << ans[i] << ' ';
    }
}
    
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local    
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 280 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Incorrect 3 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 280 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Incorrect 3 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 280 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Incorrect 3 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -