oj.uz

Submission #418388

# Submission time Handle Problem Language Result Execution time Memory
418388 2021-06-05T10:34:59 Z acm Drzava (COCI15_drzava) C++14
32 / 160
 1000 ms 3660 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];
ll get(ll v) { return p[v] = (v == p[v] ? v : get(p[v])); }
bool unite(ll u, ll v) {
  if ((u = get(u)) == (v = get(v))) return 0;
  if (sz[u] < sz[v]) swap(u, v);
  sz[u] += sz[v], p[v] = u;
  while (dp[v] > 0) {
    ll x = __lg(dp[v]);
    dp[u] |= (dp[u] << x);
    if ((1LL << k) & dp[u]) return 1;
    dp[u] |= (dp[u] >> k);
    dp[u] &= (1LL << k) - 1;
    dp[v] -= (1LL << x);
  }
  return 0;
}
ll kek(ll d) {
  for (int i = 0; i < n; i++) p[i] = i, sz[i] = 1, dp[i] = (1LL << c[i]);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (abs(a[i] - a[j]) * abs(a[i] - a[j]) +
              abs(b[i] - b[j]) * abs(b[i] - b[j]) <=
          d) {
        if (unite(i, j)) return 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 (r - l > 1) {
    ll tm = (l + r) / 2;
    if (kek(tm))
      r = tm;
    else
      l = tm;
  }
  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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct

Subtask #3
0 / 8.0

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

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 8 ms 332 KB Output is correct

Subtask #5
0 / 8.0

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

Subtask #6
0 / 8.0

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

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 332 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 332 KB Output is correct

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1076 ms 1868 KB Time limit exceeded

Subtask #10
0 / 8.0

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

Subtask #11
0 / 8.0

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

Subtask #12
0 / 8.0

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

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1071 ms 3440 KB Time limit exceeded

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Execution timed out 1084 ms 3660 KB Time limit exceeded

Subtask #15
0 / 8.0

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

Subtask #16
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1092 ms 3476 KB Time limit exceeded

Subtask #17
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1080 ms 3404 KB Time limit exceeded

Subtask #18
0 / 8.0

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

Subtask #19
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 1085 ms 3400 KB Time limit exceeded

Subtask #20
0 / 8.0

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