提出 #64828019

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
namespace Dinic {

const int N = 1e3;
const int M = 2e5;
struct edge {
  int v, w, next;
} edg[M];
int n, m, h[N], lev[N], cur[N];
int cnt = -1;
int dfs(int u, int canflow) {
  if(u == n + m + 2) return canflow;
  int resflow = 0;
  for(int& i = cur[u]; ~i; i = edg[i].next) {
    int v = edg[i].v;
    if(lev[v] == lev[u] + 1 && edg[i].w > 0) {
      int nowflow = dfs(v, min(canflow, edg[i].w));
      canflow -= nowflow;
      resflow += nowflow;
      edg[i].w -= nowflow;
      edg[i ^ 1].w += nowflow;
      if(!canflow) break;
    }
  }
  if(!resflow) lev[u] = -1;
  return resflow;
}
bool bfs() {
  memset(lev, -1, sizeof lev);
  queue<int> que;
  lev[n + m + 1] = 0;
  que.push(n + m + 1);
  while(!que.empty()) {
    int u = que.front(); que.pop();
    for(int i = h[u]; ~i; i = edg[i].next) {
      int v = edg[i].v;
      if(lev[v] == -1 && edg[i].w > 0) {
        lev[v] = lev[u] + 1;
        que.push(v);
      }
    }
  }
  return ~lev[n + m + 2];
}

int dinic() {
  int maxflow = 0;
  while(bfs()) {
    for(int i = 1; i <= n + m + 2; i++)
      cur[i] = h[i];
    maxflow += dfs(n + m + 1, INT_MAX);
  }
  return maxflow;
}

void add_edge(int u, int v) {
  edg[++cnt] = (edge){v, 1, h[u]}; h[u] = cnt;
  edg[++cnt] = (edge){u, 0, h[v]}; h[v] = cnt;
}

void init(int n_) {
  n = m = n_;
  cnt = -1;
  memset(h, -1, sizeof(h));
}

} // namesapce Dinic

const int N = 305;
typedef long long ll;
typedef __int128 lll;

int n;
ll sx[N], sy[N], gx[N], gy[N];

lll dist2(int i, int j) {
  return (lll)(sx[i] - gx[j]) * (sx[i] - gx[j]) + 
    (lll)(sy[i] - gy[j]) * (sy[i] - gy[j]);
}

bool check(lll r2) {
  Dinic::init(n);
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= n; j++) {
      if(dist2(i, j) <= r2) {
        // 人 1 ~ n,         i
        // 按钮 n+1 ~ 2n     n+j
        // 源点 2n+1
        // 汇点 2n+2
        Dinic::add_edge(i, n + j);
      }
    }
  }
  for(int i = 1; i <= n; i++) {
    Dinic::add_edge(n + n + 1, i);
    Dinic::add_edge(n + i, n + n + 2);
  }
  return Dinic::dinic() == n;
}

int main() {
  scanf("%d", &n);
  for(int i = 1; i <= n; i++) {
    scanf("%lld %lld", &sx[i], &sy[i]);
  }
  for(int i = 1; i <= n; i++) {
    scanf("%lld %lld", &gx[i], &gy[i]);
  }
  // 二分 r^2 的值
  lll lb = 1, rb = 2 * (lll)1e18 * (lll)1e18;
  while(lb < rb) {
    lll mid = (lb + rb) / 2;
    if(check(mid)) rb = mid;
    else lb = mid + 1;
  }
  printf("%.10Lf\n", sqrtl((long double)rb));
  return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:103:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  103 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
Main.cpp:105:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  105 |     scanf("%lld %lld", &sx[i], &sy[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:108:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  108 |     scanf("%lld %lld", &gx[i], &gy[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果