oj.uz

Submission #584635

# Submission time Handle Problem Language Result Execution time Memory
584635 2022-06-27T17:53:19 Z MilosMilutinovic Drzava (COCI15_drzava) C++14
144 / 160
 1000 ms 54952 KB 
/**
 *    author:  wxhtzdy
 *    created: 27.06.2022 18:47:13
**/
#include <bits/stdc++.h>

using namespace std;

struct point {
  int x, y, c;

  bool operator < (const point &p) const {
    return x < p.x || (x == p.x && y < p.y);
  };
};

long long Dist(point a, point b) {
  long long dx = abs(a.x - b.x);
  long long dy = abs(a.y - b.y);
  return dx * dx + dy * dy;
}

point a[50000];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, k;
  cin >> n >> k;     
  for (int i = 0; i < n; i++) {
    cin >> a[i].x >> a[i].y >> a[i].c;
    a[i].c %= k;
  }
  sort(a, a + n);
  auto Check = [&](long long x) {
    int d = (double) (sqrt(x) + 1);
    vector<vector<int>> g(n);
    auto Add = [&](int x, int y) {
      g[x].push_back(y);
      g[y].push_back(x);
    };
    set<pair<int, int>> s;
    int ptr = 0;
    for (int i = 0; i < n; i++) {
      while (ptr < i && a[ptr].x + d < a[i].x) {
        s.erase(s.find(make_pair(a[ptr].y, ptr)));  
        ptr += 1;
      }               
      auto it = s.lower_bound(make_pair(a[i].y - d, -1));
      int cnt = 0;
      while (it != s.end()) {
        int j = it->second;
        if (abs(a[i].y - a[j].y) > d) {
          break;
        }
        cnt += 1;
        if (cnt >= 8 * k) {
          return true;
        }  
        if (Dist(a[i], a[j]) <= x) {
          Add(i, j);
        }
        it = next(it);   
      }
      s.emplace(a[i].y, i);
    }                    
    vector<bool> was(n);
    for (int i = 0; i < n; i++) {
      if (!was[i]) {
        vector<int> que(1, i);
        was[i] = true;
        for (int b = 0; b < (int) que.size(); b++) {
          int j = que[b];
          for (int p : g[j]) {
            if (!was[p]) {
              was[p] = true;
              que.push_back(p);
            }
          }
        }
        vector<bool> dp(k + 1, false);
        dp[0] = true;
        for (int j : que) {
          vector<bool> new_dp(k + 1);
          for (int p = k; p >= 0; p--) {
            new_dp[p] = (dp[p] | dp[(((p - a[j].c) % k) + k) % k]);
          }
          swap(new_dp, dp);
          if (dp[k]) {
            return true;
          }
        }
      }
    }
    return false;
  };
  long long low = 0, high = 1e18, ans = 0;
  while (low <= high) {
    long long mid = low + high >> 1;
    if (Check(mid)) {
      ans = mid;
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  cout << fixed << setprecision(3) << sqrt(ans * 1.0) << '\n';
  return 0;
}

Compilation message

drzava.cpp: In function 'int main()':
drzava.cpp:99:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   99 |     long long mid = low + high >> 1;
      |                     ~~~~^~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 352 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 28 ms 980 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 11 ms 596 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 27 ms 780 KB Output is correct

Subtask #6
8.0 / 8.0

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

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 30 ms 960 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 18 ms 724 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 157 ms 4840 KB Output is correct

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Execution timed out 1084 ms 52020 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1036 ms 51272 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #12
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 652 ms 26884 KB Output is correct

Subtask #13
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 733 ms 30852 KB Output is correct

Subtask #14
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 993 ms 54952 KB Output is correct

Subtask #15
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 355 ms 7496 KB Output is correct

Subtask #16
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 461 ms 18888 KB Output is correct

Subtask #17
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 495 ms 21748 KB Output is correct

Subtask #18
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 490 ms 21988 KB Output is correct

Subtask #19
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 437 ms 12732 KB Output is correct

Subtask #20
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 364 ms 8948 KB Output is correct