제출 #777223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777223		Sam_a17	원 고르기 (APIO18_circle_selection)	C++17	0 / 100	82 ms	20032 KiB

circle_selection

#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);
  // }
}
 
const long long inf = 1e9 + 1;
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;
};

map<pair<long long, long long>, vector<node>> mp;
 
void solve_() {
  cin >> n;
 
  vector<node> a;
  long long cur_r, cur;
  for(int i = 1; i <= n; i++) {
    long long x, y, r; cin >> x >> y >> r;
    x += inf, y += inf;
    a.push_back({x, y, r, i});
    
    //
    cur_r = 2 * r;
    cur_r *= cur_r;
    //
    
    cur = r;
  }
 
  // 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 {
    for(int i = 0; i < n; i++) {
      long long cur_x = a[i].x, cur_y = a[i].y;
      assert(cur == a[i].r);
      assert(cur_r == a[i].r * a[i].r);
      mp[{cur_x / cur, cur_y / cur}].push_back(a[i]);
    }

    vector<int> which(n + 1);
    for(int w = 0; w < n; w++) {
      if(which[w + 1]) continue;
      long long cur_x = a[w].x / cur;
      long long cur_y = a[w].y / cur;
      for(int i = cur_x - 2; i <= cur_x + 2; i++) {
        for(int j = cur_y - 2; j <= cur_y + 2; j++) {
          if(mp.find({i, j}) == mp.end()) continue;

          for(auto k: mp[{i, j}]) {
            if(which[k.index]) continue;
            
            if(dist({a[w].x, a[w].y}, {k.x, k.y}) <= 2 * cur_r) {
              which[k.index] = (w + 1);
            }
          }
        }
      }
    }

    for(int i = 1; i <= n; i++) {
      assert(which[i]);
      cout << which[i] << " ";
    }
    cout << '\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;
} 

컴파일 시 표준 에러 (stderr) 메시지

circle_selection.cpp: In function 'void solve_()':
circle_selection.cpp:102:13: warning: 'cur_r' may be used uninitialized in this function [-Wmaybe-uninitialized]
  102 |   long long cur_r, cur;
      |             ^~~~~
circle_selection.cpp:179:34: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
  179 |       long long cur_y = a[w].y / cur;
      |                                  ^~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13