oj.uz

답안 #772172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772172 2023-07-03T17:35:56 Z Sam_a17 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 598 ms 77884 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  // if(str == "input") {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
  // } else if(str != "") {
    // freopen((str + ".in").c_str(), "r", stdin);
    // freopen((str + ".out").c_str(), "w", stdout);
  // }
}

int n;

long long dist(pair<long long, long long> a, pair<long long, long long> b) {
  return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second);
}

struct node {
  long long x, y, r;
  int index;
};


void solve_() {
  cin >> n;

  vector<node> a;
  for(int i = 1; i <= n; i++) {
    long long x, y, r; cin >> x >> y >> r;
    a.push_back({x, y, r, i});
  }

  if (n <= 5000) {
    vector<bool> to_del(n + 1);
    vector<int> answ(n + 1);
    while(!a.empty()) {
      vector<node> new_a;
      
      int max_r = -1, ind = -1;
      for(auto i: a) {
        if(i.r > max_r) {
          max_r = i.r;
          ind = i.index;
        } else if(i.r == max_r) {
          ind = min(i.index, ind);
        }
      }

      long long xi = -1, yi = -1;
      for(auto i: a) {
        if(i.index == ind) {
          xi = i.x, yi = i.y;
        }
      }

      // vector<int> to_del;
      for(auto i: a) {
        if(i.index == ind) continue;
        long long rr = i.r + max_r;
        rr *= rr;

        if(rr >= dist(make_pair(xi, yi), make_pair(i.x, i.y))) {
          to_del[i.index] = true;
        }
      }

      to_del[ind] = true;
      for(auto i: a) {
        if(to_del[i.index]) {
          answ[i.index] = ind;
          continue;
        }
        new_a.push_back(i);
      }

      a.swap(new_a);
    }

    for(int i = 1; i <= n; i++) {
      cout << answ[i] << " ";
    }
    cout << '\n';
  }
  else {
    vector<int> compress;
    for(auto i: a) {
      compress.push_back(i.x);
      compress.push_back(i.x + i.r);
      compress.push_back(i.x - i.r);
    }

    sort(all(compress));
    uniq(compress);

    vector<int> l(n + 1), r(n + 1);
    for(auto i: a) {
      l[i.index] = lower_bound(all(compress), i.x - i.r) - compress.begin();
      r[i.index] = lower_bound(all(compress), i.x + i.r) - compress.begin();
    }

    multiset<pair<int, int>> mt;

    for(auto i: a) {
      int id = lower_bound(all(compress), i.r) - compress.begin();
      mt.insert({id, -i.index});
    }

    set<int> sti;
    for(int i = 0; i < sz(compress); i++) {
      sti.insert(i);
    }

    vector<int> answ(n + 1), ansi(sz(compress) + 2, 0);
    // while(!mt.empty()) {
    //   auto it = *mt.rbegin();
    //   if(ansi[it.first]) {
    //     answ[-it.second] = ansi[it.first];
    //     mt.erase(prev(mt.end())); 
    //     continue;
    //   }
      
    //   answ[it.first] = -it.second;

    //   int lx = l[-it.second], rx = r[-it.second];
    //   auto itr = sti.lower_bound(lx);

    //   vector<int> to_del;
    //   while(itr != sti.end() && *itr <= rx) {
    //     ansi[*itr] = -it.second;
    //     to_del.push_back(*itr);        
    //   }

    //   for(auto i: to_del) {
    //     sti.erase(i);
    //   }
    // }

    for(int i = 1; i <= n; i++) {
      cout << answ[i] << '\n';
    }
  }
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 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 724 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 72 ms 924 KB Output is correct
23 Correct 71 ms 924 KB Output is correct
24 Correct 71 ms 924 KB Output is correct
25 Correct 71 ms 924 KB Output is correct
26 Correct 71 ms 924 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 598 ms 77884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 458 ms 77132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 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 724 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 72 ms 924 KB Output is correct
23 Correct 71 ms 924 KB Output is correct
24 Correct 71 ms 924 KB Output is correct
25 Correct 71 ms 924 KB Output is correct
26 Correct 71 ms 924 KB Output is correct
27 Incorrect 12 ms 2852 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 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 724 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 72 ms 924 KB Output is correct
23 Correct 71 ms 924 KB Output is correct
24 Correct 71 ms 924 KB Output is correct
25 Correct 71 ms 924 KB Output is correct
26 Correct 71 ms 924 KB Output is correct
27 Incorrect 598 ms 77884 KB Output isn't correct
28 Halted 0 ms 0 KB -