oj.uz

Submission #880891

# Submission time Handle Problem Language Result Execution time Memory
880891 2023-11-30T08:10:31 Z noompty Countries (BOI06_countries) C++17
10 / 100
 82 ms 33160 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <array>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

int n, ans[1005], in[1005];
array<int, 3> cities[1005];
vector<pair<double, int>> infl[1005];
vector<int> adj[1005];

void dfs(int curr, int v) {
    if (ans[curr] != 0) ans[curr] = v;
    for (int i : adj[curr]) {
        dfs(i, v);
    }
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;

    if (n == 1) {
        cout << "K\n";
        exit(0);
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> cities[i][j];
        }
        infl[i].push_back({0, -1});
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            infl[i].push_back({(double) cities[j][2] / (double) ((cities[j][1] - cities[i][1]) * (cities[j][1] - cities[i][1]) + (cities[j][0] - cities[i][0]) * (cities[j][0] - cities[i][0])), j});
        }
        sort(infl[i].begin(), infl[i].end());
    }

    fill(ans, ans + 1005, -1);
    for (int i = 0; i < n; i++) {
        if (infl[i].back().f < cities[i][2]) {
            ans[i] = 0;
        } else {
            if (infl[i].size() > 2 && infl[i].back().f == infl[i][infl[i].size() - 2].f) {
                ans[i] = -2;
            } else {
                adj[infl[i].back().s].push_back(i);
                in[i]++;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        if (adj[i].size() && !in[i]) dfs(i, i + 1);
        assert(ans[i] != -1);
    }

    for (int i = 0; i < n; i++) {
        if (ans[i] == 0) cout << "K\n";
        else if (ans[i] == -2) cout << "D\n";
        else cout << ans[i] << "\n";
    }

}

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 1124 KB Execution killed with signal 6
2 Runtime error 4 ms 2140 KB Execution killed with signal 6
3 Runtime error 8 ms 5504 KB Execution killed with signal 6
4 Runtime error 13 ms 7256 KB Execution killed with signal 6
5 Runtime error 18 ms 8792 KB Execution killed with signal 6
6 Runtime error 33 ms 16724 KB Execution killed with signal 6
7 Runtime error 44 ms 21844 KB Execution killed with signal 6
8 Runtime error 51 ms 26828 KB Execution killed with signal 6
9 Runtime error 65 ms 30052 KB Execution killed with signal 6
10 Runtime error 82 ms 33160 KB Execution killed with signal 6
11 Correct 1 ms 616 KB Output is correct
12 Runtime error 4 ms 2152 KB Execution killed with signal 6
13 Correct 7 ms 2920 KB Output is correct
14 Runtime error 13 ms 7272 KB Execution killed with signal 6
15 Runtime error 19 ms 8932 KB Execution killed with signal 6
16 Runtime error 32 ms 16736 KB Execution killed with signal 6
17 Runtime error 41 ms 21856 KB Execution killed with signal 6
18 Runtime error 51 ms 26728 KB Execution killed with signal 6
19 Runtime error 54 ms 30056 KB Execution killed with signal 6
20 Runtime error 79 ms 33120 KB Execution killed with signal 6