oj.uz

답안 #418893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418893 2021-06-06T07:43:03 Z acm Drzava (COCI15_drzava) C++14
64 / 160
 1000 ms 15412 KB 
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
ll n, k, a[50005], b[50005], c[50005], p[50005], sz[50005], dp[50005][31];
ll get(ll v) { return p[v] = (v == p[v] ? v : get(p[v])); }
void unite(ll u, ll v) {
  if ((u = get(u)) == (v = get(v))) return;
  if (sz[u] < sz[v]) swap(u, v);
  sz[u] += sz[v], p[v] = u;
  for (int i = 0; i < k; i++) dp[u][i] += dp[v][i];
}
ll kek(ll d) {
  for (int i = 0; i < n; i++) {
    p[i] = i;
    sz[i] = 1;
    for (int j = 0; j < k; j++) dp[i][j] = 0;
    dp[i][c[i]]++;
  }
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      ll dist = abs(a[i] - a[j]) * abs(a[i] - a[j]) +
                abs(b[i] - b[j]) * abs(b[i] - b[j]);
      if (dist <= d) unite(i, j);
    }
  }
  for (int i = 0; i < n; i++) {
    if (i == get(i)) {
      ll x = 1;
      for (int j = 0; j < k; j++) {
        while (dp[i][j]) {
          dp[i][j]--;
          x |= (x << j);
          if ((1LL << k) & x || !j) return 1;
          x |= (x >> k);
          x &= (1LL << k) - 1;
        }
      }
    }
  }
  return 0;
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i] >> c[i];
    c[i] %= k;
  }
  ll l = 0, r = 20000000000000000;
  while (l != r) {
    ll tm = (l + r) / 2;
    if (kek(tm))
      r = tm;
    else
      l = tm + 1;
  }
  cout << fixed << setprecision(3) << sqrt(r);
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

drzava.cpp: In function 'void ioi(std::string)':
drzava.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
drzava.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 116 ms 588 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 99 ms 596 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 61 ms 460 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 108 ms 588 KB Output is correct

Subtask #7
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 144 ms 620 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 31 ms 488 KB Output is correct

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Execution timed out 1078 ms 7108 KB Time limit exceeded

Subtask #10
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1086 ms 14972 KB Time limit exceeded

Subtask #11
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Execution timed out 1080 ms 14756 KB Time limit exceeded

Subtask #12
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1092 ms 14156 KB Time limit exceeded

Subtask #13
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1084 ms 15344 KB Time limit exceeded

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1086 ms 15412 KB Time limit exceeded

Subtask #15
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1089 ms 15196 KB Time limit exceeded

Subtask #16
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1091 ms 15232 KB Time limit exceeded

Subtask #17
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1073 ms 15196 KB Time limit exceeded

Subtask #18
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1096 ms 15212 KB Time limit exceeded

Subtask #19
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1080 ms 15220 KB Time limit exceeded

Subtask #20
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1073 ms 15180 KB Time limit exceeded