oj.uz

Submission #771690

# Submission time Handle Problem Language Result Execution time Memory
771690 2023-07-03T08:07:07 Z CyberCow Circle selection (APIO18_circle_selection) C++17
7 / 100
 695 ms 59456 KB 
//#include <bits/stdc++.h>
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);
const int N = 300005;
vector<pair<ll, pair<ll, ll>>> v;
int color[N];
int ans[N];

void solve()
{
    int n, i, j, x, y, r;
    cin >> n;
    if (n <= 5000)
    {
        for (i = 0; i < n; i++)
        {
            cin >> x >> y >> r;
            v.push_back({ r, {x, y} });
        }
        int qan = 0;
        for (i = 0; i < n; i++)
        {
            ll ma = 0;
            for (j = 0; j < n; j++)
            {
                if (color[j] == 0)
                {
                    ma = max(v[j].first, ma);
                }
            }
            for (j = 0; j < n; j++)
            {
                if (color[j] == 0 && v[j].first == ma)
                {
                    color[j] = 1;
                    ans[j] = j + 1;
                    qan++;
                    for (int h = 0; h < n; h++)
                    {
                        if (color[h] == 0 && (v[j].second.first - v[h].second.first) * (v[j].second.first - v[h].second.first) + (v[j].second.second - v[h].second.second) * (v[j].second.second - v[h].second.second) <= (v[j].first + v[h].first) * (v[j].first + v[h].first))
                        {
                            color[h] = 1;
                            ans[h] = j + 1;
                            qan++;
                        }
                    }
                    break;
                }
            }
            if (qan == n)
                break;
        }
        for (i = 0; i < n; i++)
        {
            cout << ans[i] << ' ';
        }
    }
    else
    {
        set<pair<pair<ll, ll>, ll>> mar;
        set<pair<ll, pair<ll, ll>>> hert;
        for (i = 0; i < n; i++)
        {
            cin >> x >> y >> r;
            v.push_back({ r, {x, y} });
            mar.insert({ {r, -i}, x});
            hert.insert({ x, {r, i} });
        }
        int qan = 0;
        while (!mar.empty())
        {
            qan++;
            x = (--mar.end())->second;
            r = (--mar.end())->first.first;
            int ind = -(--mar.end())->first.second;
            color[ind] = 1;
            ans[ind] = ind + 1;
            auto it = hert.lower_bound({ x, {r, ind} });
            auto gn = it;
            vector<pair<ll, pair<ll, ll>>> herthan;
            while (1)
            {
                ll xx = gn->first;
                ll rr = gn->second.first;
                ll indind = gn->second.second;
                if (abs(xx - x) <= rr + r)
                {
                    color[indind] = 1;
                    ans[indind] = ind + 1;
                    herthan.push_back({ xx, {rr, indind} });
                }
                else
                    break;
                if (gn == hert.begin())
                    break;
                else
                    gn--;
            }
            gn = it;
            while (1)
            {
                gn++;
                if (gn == hert.end())
                    break;
                ll xx = gn->first;
                ll rr = gn->second.first;
                ll indind = gn->second.second;
                if (abs(xx - x) <= rr + r)
                {
                    color[indind] = 1;
                    ans[indind] = ind + 1;
                    herthan.push_back({ xx, {rr, indind} });
                }
                else
                    break;
            }
            for ( i = 0; i < herthan.size(); i++)
            {
                hert.erase(herthan[i]);
                mar.erase({ {herthan[i].second.first, -herthan[i].second.second}, herthan[i].first });
            }
        }
        for ( i = 0; i < n; i++)
        {
            cout << ans[i] << ' ';
        }
    }
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

circle_selection.cpp: In function 'void solve()':
circle_selection.cpp:140:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |             for ( i = 0; i < herthan.size(); i++)
      |                          ~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 660 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 660 KB Output is correct
22 Correct 142 ms 620 KB Output is correct
23 Correct 139 ms 632 KB Output is correct
24 Correct 134 ms 620 KB Output is correct
25 Correct 133 ms 636 KB Output is correct
26 Correct 136 ms 624 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 695 ms 59456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 149 ms 16500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 607 ms 48896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 660 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 660 KB Output is correct
22 Correct 142 ms 620 KB Output is correct
23 Correct 139 ms 632 KB Output is correct
24 Correct 134 ms 620 KB Output is correct
25 Correct 133 ms 636 KB Output is correct
26 Correct 136 ms 624 KB Output is correct
27 Incorrect 10 ms 2448 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 660 KB Output is correct
20 Correct 2 ms 660 KB Output is correct
21 Correct 2 ms 660 KB Output is correct
22 Correct 142 ms 620 KB Output is correct
23 Correct 139 ms 632 KB Output is correct
24 Correct 134 ms 620 KB Output is correct
25 Correct 133 ms 636 KB Output is correct
26 Correct 136 ms 624 KB Output is correct
27 Incorrect 695 ms 59456 KB Output isn't correct
28 Halted 0 ms 0 KB -