oj.uz

답안 #489736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489736 2021-11-24T05:50:29 Z JerryLiu06 Countries (BOI06_countries) C++17
95 / 100
 3 ms 336 KB 
// https://oj.uz/problem/view/BOI06_countries

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e3 + 10;
const ll INF = 1e18;

int N, X[MX], Y[MX], S[MX], obey[MX], ans[MX];

int dist(int i, int j) {
    return (X[i] - X[j]) * (X[i] - X[j]) + (Y[i] - Y[j]) * (Y[i] - Y[j]);
}

int main() {
    FASTIO;

    cin >> N;

    FOR(i, 1, N + 1) {
        cin >> X[i] >> Y[i] >> S[i];
    }
    FOR(i, 1, N + 1) {
        bool isThreatened = false;
        int threatenedMost = -1, cntMost = 0;

        FOR(j, 1, N + 1) {
            if (j == i) continue;

            if (S[i] * dist(i, j) < S[j]) {
                isThreatened = true;

                if (threatenedMost == -1 || S[threatenedMost] * dist(j, i) < S[j] * dist(threatenedMost, i)) {
                    threatenedMost = j, cntMost = 1;
                }
                else if (S[threatenedMost] * dist(j, i) == S[j] * dist(threatenedMost, i)) {
                    cntMost++;
                }
            }
        }
        if (!isThreatened) {
            obey[i] = i, ans[i] = 0;
        }
        else if (cntMost >= 2) {
            obey[i] = i, ans[i] = 1;
        }
        else {
            obey[i] = threatenedMost, ans[i] = 2;
        }
    }
    bool seen[N + 1];
    
    FOR(i, 1, N + 1) {
        seen[i] = false;
    }
    FOR(i, 1, N + 1) {
        if (!seen[i] && ans[i] == 2) {
            int curNode = i;

            while (obey[curNode] != curNode) {
                seen[curNode] = true;

                curNode = obey[curNode];
            }
            int keep = i;

            while (obey[keep] != keep) {
                obey[keep] = curNode;
                
                keep = obey[keep];
            }
        }
    }
    FOR(i, 1, N + 1) {
        if (ans[i] == 0) cout << "K" << "\n";
        if (ans[i] == 1) cout << "D" << "\n";
        if (ans[i] == 2) cout << obey[i] << "\n";
    }
}

Subtask #1
95.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Incorrect 1 ms 336 KB Output isn't correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 3 ms 336 KB Output is correct