Submission #1346749

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 21474836

template<typename T>
class MinCostFlow{
private:
  struct edge{int to; T cap, cost; int rev;};
  using P = pair<int,int>;
  vector<vector<edge> > Graph;
  vector<int> prevv, preve;
  vector<T> h, d; // ポテンシャル，最短距離
public:
  MinCostFlow(int v){
    // 頂点数vで初期化
    Graph.resize(v);
    prevv.resize(v);
    preve.resize(v);
    h.resize(v);
    d.resize(v);
  }
  T min_cost_flow(int s, int t, T f){
    T res = 0;
    fill(all(h), 0);
    rep(v,Graph.size()){
  		rep(j,Graph[v].size()){
  			edge &e = Graph[v][j];
  			if(e.cap==0) continue;
  			int u = e.to;
  			h[u] = min(h[u],h[v]+e.cost);
  		}
  	}
    while(f>0){
      priority_queue<P, vector<P>, greater<P>> pq;
      fill(all(d), INF);
      d[s] = 0;
      pq.push(mp(0,s));
      while(!pq.empty()){
        auto p = pq.top(); pq.pop();
        int v = p.se;
        if(d[v] < p.fi) continue;
        rep(i,Graph[v].size()){
          edge &e = Graph[v][i];
          if(e.cap > 0 && d[e.to] > d[v] + e.cost + h[v] - h[e.to]){
            d[e.to] = d[v] + e.cost + h[v] - h[e.to];
            prevv[e.to] = v;
            preve[e.to] = i;
            pq.push(mp(d[e.to], e.to));
          }
        }
      }
      if(d[t] == INF) return 0;
      rep(i,Graph.size()) h[i] += d[i];

      T nf = f;
      for(int v=t; v!=s; v = prevv[v]){
        nf = min(nf, Graph[prevv[v]][preve[v]].cap);
      }
      f -= nf;
      res += nf * h[t];
      for(int v=t; v!=s; v=prevv[v]){
        edge &e = Graph[prevv[v]][preve[v]];
        e.cap -= nf;
        Graph[v][e.rev].cap += nf;
      }
    }
    return res;
  }
  void add_edge(int from ,int to, T cap, T cost){
    Graph[from].pb(((edge){to, cap, cost, (int)Graph[to].size()}));
    Graph[to].pb(((edge){from, 0, -cost, (int)Graph[from].size()-1}));
  }
};

int main(){
  int n,m;
  cin>>m;
  vector<int> sx(m),sy(m);
  rep(i,m) cin>>sx[i]>>sy[i];
  cin>>n;
  vector<int> x(n),y(n),s(n),t(n);
  rep(i,n) cin>>x[i]>>y[i]>>s[i]>>t[i];

  MinCostFlow<int> flow(2*n+m+2);
  // s:2*n+m t:2*n+m+1

  rep(i,m) flow.add_edge(2*n+m, 2*n+i, 1, 0);
  rep(i,m) flow.add_edge(2*n+i, 2*n+m+1, 1, 0);

  rep(i,m)rep(j,n){
    int d = abs(sx[i]-x[j]) + abs(sy[i]-y[j]);
    if(d <= s[j]) flow.add_edge(2*n+i, 2*j, 1, 0);
  }

  rep(i,n) repl(j,i+1,n){
    int d = abs(x[i]-x[j]) + abs(y[i]-y[j]);
    if(d <= s[j]-t[i]) flow.add_edge(2*i+1, 2*j, 1, 0);
  }

  rep(i,n) flow.add_edge(2*i, 2*i+1, 1, -1);
  rep(i,n) flow.add_edge(2*i+1, 2*n+m+1, 1, 0);

  int res = flow.min_cost_flow(2*n+m, 2*n+m+1, m);

  if(res == -n) cout << "YES" << endl;
  else cout << "NO" << endl;

  return 0;
}

Submission Info

Judge Result