oj.uz

답안 #777249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777249 2023-07-08T21:06:58 Z Sam_a17 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 40096 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);
  // }
}
 
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;

bool cmp(node a, node b) {
  if(a.r > b.r) {
    return true;
  } if(a.r < b.r) {
    return false;
  }
  else {
    if(a.index < b.index) {
      return true;
    } else {
      return false;
    }
  }
}
 
void solve_() {
  cin >> n;

  vector<node> a;
  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});
  }

  sort(all(a), cmp);
 
  vector<int> which(n + 2);
  long long mx = -1;
  
  for(int w = 0; w < n; w++) {
    int ind = a[w].index;
    if(which[ind]) continue;
    if(mx == -1) {
      mx = 1e9 + 1;
      for(int i = 0; i < n; i++) {
        if(which[a[i].index]) {
          continue;
        }
        long long cx = a[i].x / mx;
        long long cy = a[i].y / mx;
        mp[{cx, cy}].push_back(a[i]);
      }
    }

    long long cur_x = a[w].x / mx;
    long long cur_y = a[w].y / mx;

    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}) <= (a[w].r + k.r) * (a[w].r + k.r)) {
            which[k.index] = ind;
          }
        }
      }
    }
  }

  for(int i = 1; i <= n; 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;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 984 KB Output is correct
21 Correct 3 ms 984 KB Output is correct
22 Correct 33 ms 984 KB Output is correct
23 Correct 33 ms 984 KB Output is correct
24 Correct 33 ms 976 KB Output is correct
25 Correct 34 ms 888 KB Output is correct
26 Correct 34 ms 856 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 31976 KB Output is correct
2 Correct 141 ms 38552 KB Output is correct
3 Correct 139 ms 34508 KB Output is correct
4 Correct 136 ms 34568 KB Output is correct
5 Execution timed out 3049 ms 40096 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 3063 ms 9728 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3062 ms 29720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 984 KB Output is correct
21 Correct 3 ms 984 KB Output is correct
22 Correct 33 ms 984 KB Output is correct
23 Correct 33 ms 984 KB Output is correct
24 Correct 33 ms 976 KB Output is correct
25 Correct 34 ms 888 KB Output is correct
26 Correct 34 ms 856 KB Output is correct
27 Correct 5 ms 1748 KB Output is correct
28 Correct 5 ms 1748 KB Output is correct
29 Correct 5 ms 1748 KB Output is correct
30 Correct 141 ms 1620 KB Output is correct
31 Correct 135 ms 1620 KB Output is correct
32 Correct 131 ms 1620 KB Output is correct
33 Correct 48 ms 13076 KB Output is correct
34 Correct 48 ms 12980 KB Output is correct
35 Correct 64 ms 12908 KB Output is correct
36 Execution timed out 3063 ms 12412 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 984 KB Output is correct
21 Correct 3 ms 984 KB Output is correct
22 Correct 33 ms 984 KB Output is correct
23 Correct 33 ms 984 KB Output is correct
24 Correct 33 ms 976 KB Output is correct
25 Correct 34 ms 888 KB Output is correct
26 Correct 34 ms 856 KB Output is correct
27 Correct 141 ms 31976 KB Output is correct
28 Correct 141 ms 38552 KB Output is correct
29 Correct 139 ms 34508 KB Output is correct
30 Correct 136 ms 34568 KB Output is correct
31 Execution timed out 3049 ms 40096 KB Time limit exceeded
32 Halted 0 ms 0 KB -