結果
問題 | No.654 Air E869120 |
ユーザー | smiken_61 |
提出日時 | 2018-09-18 23:49:25 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 614 ms / 2,000 ms |
コード長 | 15,250 bytes |
コンパイル時間 | 1,362 ms |
コンパイル使用メモリ | 175,332 KB |
実行使用メモリ | 6,144 KB |
最終ジャッジ日時 | 2024-07-18 08:09:57 |
合計ジャッジ時間 | 3,690 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
5,888 KB |
testcase_01 | AC | 3 ms
5,888 KB |
testcase_02 | AC | 2 ms
6,016 KB |
testcase_03 | AC | 3 ms
5,888 KB |
testcase_04 | AC | 3 ms
5,888 KB |
testcase_05 | AC | 3 ms
5,888 KB |
testcase_06 | AC | 3 ms
5,760 KB |
testcase_07 | AC | 3 ms
6,016 KB |
testcase_08 | AC | 3 ms
5,888 KB |
testcase_09 | AC | 3 ms
5,888 KB |
testcase_10 | AC | 66 ms
6,016 KB |
testcase_11 | AC | 26 ms
5,888 KB |
testcase_12 | AC | 25 ms
6,144 KB |
testcase_13 | AC | 41 ms
6,016 KB |
testcase_14 | AC | 20 ms
6,016 KB |
testcase_15 | AC | 30 ms
6,016 KB |
testcase_16 | AC | 93 ms
6,016 KB |
testcase_17 | AC | 614 ms
6,144 KB |
testcase_18 | AC | 402 ms
6,144 KB |
testcase_19 | AC | 19 ms
6,016 KB |
testcase_20 | AC | 4 ms
6,016 KB |
testcase_21 | AC | 4 ms
6,016 KB |
testcase_22 | AC | 3 ms
6,016 KB |
testcase_23 | AC | 3 ms
6,016 KB |
testcase_24 | AC | 4 ms
6,016 KB |
testcase_25 | AC | 4 ms
6,016 KB |
testcase_26 | AC | 4 ms
6,016 KB |
testcase_27 | AC | 3 ms
6,016 KB |
testcase_28 | AC | 4 ms
6,144 KB |
testcase_29 | AC | 3 ms
6,016 KB |
testcase_30 | AC | 3 ms
5,888 KB |
testcase_31 | AC | 3 ms
5,888 KB |
testcase_32 | AC | 4 ms
5,888 KB |
testcase_33 | AC | 3 ms
5,888 KB |
testcase_34 | AC | 4 ms
5,888 KB |
testcase_35 | AC | 2 ms
5,760 KB |
testcase_36 | AC | 2 ms
5,888 KB |
testcase_37 | AC | 3 ms
5,760 KB |
testcase_38 | AC | 2 ms
5,760 KB |
testcase_39 | AC | 2 ms
5,888 KB |
ソースコード
#include <bits/stdc++.h> // #include <boost/multiprecision/cpp_int.hpp> #define int long long #define inf 1000000007 #define pa pair<int,int> #define pad pair<double,double> #define ll long long #define pal pair<double,double> #define ppap pair<pa,int> #define PI 3.14159265358979323846 #define paa pair<pa,pa> #define mp make_pair #define pb push_back #define EPS (1e-10) #define equals(a,b) (fabs((a)-(b))<EPS) // #define double long double int dx[4]={0,-1,0,1}; int dy[4]={1,0,-1,0}; using namespace std; class pa3{ public: int x,y,z; pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {} bool operator < (const pa3 &p) const{ if(x!=p.x) return x<p.x; if(y!=p.y) return y<p.y; return z<p.z; //return x != p.x ? x<p.x: y<p.y; } bool operator > (const pa3 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; return z>p.z; //return x != p.x ? x<p.x: y<p.y; } bool operator == (const pa3 &p) const{ return x==p.x && y==p.y && z==p.z; } bool operator != (const pa3 &p) const{ return !( x==p.x && y==p.y && z==p.z); } }; class pa4{ public: int x; int y,z,w; pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {} bool operator < (const pa4 &p) const{ if(x!=p.x) return x<p.x; if(y!=p.y) return y<p.y; if(z!=p.z)return z<p.z; return w<p.w; //return x != p.x ? x<p.x: y<p.y; } bool operator > (const pa4 &p) const{ if(x!=p.x) return x>p.x; if(y!=p.y) return y>p.y; if(z!=p.z)return z>p.z; return w>p.w; //return x != p.x ? x<p.x: y<p.y; } bool operator == (const pa4 &p) const{ return x==p.x && y==p.y && z==p.z &&w==p.w; } bool operator != (const pa4 &p) const{ return !(x==p.x && y==p.y && z==p.z &&w==p.w); } }; class pa2{ public: int x,y; pa2(int x=0,int y=0):x(x),y(y) {} pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);} pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);} bool operator < (const pa2 &p) const{ return x!= p.x ? x<p.x: y<p.y; } bool operator > (const pa2 &p) const{ return x != p.x ? x>p.x: y>p.y; } bool operator == (const pa2 &p) const{ return abs(x-p.x)==0 && abs(y-p.y)==0; } bool operator != (const pa2 &p) const{ return !(abs(x-p.x)==0 && abs(y-p.y)==0); } }; #define ppa pair<int,pas> class Point{ public: double x,y; Point(double x=0,double y=0):x(x),y(y) {} Point operator + (Point p) {return Point(x+p.x,y+p.y);} Point operator - (Point p) {return Point(x-p.x,y-p.y);} Point operator * (double a) {return Point(x*a,y*a);} Point operator / (double a) {return Point(x/a,y/a);} double absv() {return sqrt(norm());} double norm() {return x*x+y*y;} bool operator < (const Point &p) const{ return x != p.x ? x<p.x: y<p.y; } bool operator == (const Point &p) const{ return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS; } }; typedef Point Vector; #define pl pair<int,pas> struct Segment{ Point p1,p2; }; double dot(Vector a,Vector b){ return a.x*b.x+a.y*b.y; } double cross(Vector a,Vector b){ return a.x*b.y-a.y*b.x; } bool parareru(Point a,Point b,Point c,Point d){ // if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl; return abs(cross(a-b,d-c))<EPS; } double distance_ls_p(Point a, Point b, Point c) { if ( dot(b-a, c-a) < EPS ) return (c-a).absv(); if ( dot(a-b, c-b) < EPS ) return (c-b).absv(); return abs(cross(b-a, c-a)) / (b-a).absv(); } bool is_intersected_ls(Segment a,Segment b) { if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return 1; if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){ // cout<<"sss"<<endl; if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true; if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true; if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true; if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true; return false; } else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS ); } double segment_dis(Segment a,Segment b){ if(is_intersected_ls(a,b))return 0; double r=distance_ls_p(a.p1, a.p2, b.p1); r=min(r,distance_ls_p(a.p1, a.p2, b.p2)); r=min(r,distance_ls_p(b.p1, b.p2, a.p2)); r=min(r,distance_ls_p(b.p1, b.p2, a.p1)); return r; } Point intersection_ls(Segment a, Segment b) { Point ba = b.p2-b.p1; double d1 = abs(cross(ba, a.p1-b.p1)); double d2 = abs(cross(ba, a.p2-b.p1)); double t = d1 / (d1 + d2); return a.p1 + (a.p2-a.p1) * t; } string itos( int i ) { ostringstream s ; s << i ; return s.str() ; } int gcd(int v,int b){ if(v==0) return b; if(v>b) return gcd(b,v); if(v==b) return b; if(b%v==0) return v; return gcd(v,b%v); } double distans(double x1,double y1,double x2,double y2){ double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2); return sqrt(rr); } /* double bekid(double w,int r){ if(r==0) return 1.0; if(r==1) return w; if(r%2) return bekid(w,r-1)*w; double f=bekid(w,r/2); return f*f; }*/ int mod; int beki(int wa,int rr,int warukazu){ if(rr==0) return 1%warukazu; if(rr==1) return wa%warukazu; if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu; int zx=beki(wa,rr/2,warukazu); return (zx*zx)%warukazu; } /* int pr[401000]; int inv[401000]; int comb(int nn,int rr){ int r=pr[nn]*inv[rr]; r%=mod; r*=inv[nn-rr]; r%=mod; return r; } void gya(int ert){ pr[0]=1; for(int i=1;i<ert;i++){ pr[i]=(pr[i-1]*i)%mod; } for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod); } */ // cin.tie(0); // ios::sync_with_stdio(false); //priority_queue<pa3,vector<pa3>,greater<pa3>> pq; //sort(ve.begin(),ve.end(),greater<int>()); /////////////////////////////////////////////////////////// struct edge{ int to,cap,rev;}; vector<edge> G[100010]; bool used[100010]; void add_edge(int from ,int to, int cap){ G[from].push_back((edge){to,cap,(int)G[to].size()}); G[to].push_back((edge){from,0,(int)G[from].size()-1}); } int ddfs(int v,int t,int f){ if(v==t) return f; used[v]=true; for(int i=0;i<G[v].size();i++){ edge &e=G[v][i]; if(!used[e.to] && e.cap>0){ int d=ddfs(e.to,t,min(f,e.cap)); if(d>0){ e.cap -=d; G[e.to][e.rev].cap +=d; return d; } } } return 0; } int max_flow(int s ,int t){ int flow=0; for(;;){ memset(used,0,sizeof(used)); int f =ddfs(s,t,inf); if(f==0) return flow; flow +=f; } } vector<pa> ve; int u[1010],v[1010],p[1010],q[1010],w[1010]; signed main(){ cin.tie(0); ios::sync_with_stdio(false); int n,m,d; cin>>n>>m>>d; for(int i=0;i<m;i++){ cin>>u[i]>>v[i]>>p[i]>>q[i]>>w[i]; ve.pb(mp(u[i],p[i])); } ve.pb(mp(1,-inf)); ve.pb(mp(n,inf*100ll)); sort(ve.begin(), ve.end()); ve.erase(unique(ve.begin(), ve.end()), ve.end()); for(int i=0;i<m;i++){ pa z=mp(v[i],q[i]+d); int r2=lower_bound(ve.begin(),ve.end(),z)-ve.begin(); if(ve[r2].first!=v[i])continue; z=mp(u[i],p[i]); int r1=lower_bound(ve.begin(),ve.end(),z)-ve.begin(); add_edge(r1,r2,w[i]); } int l=ve.size(); for(int i=0;i<l-1;i++)if(ve[i].first==ve[i+1].first)add_edge(i,i+1,inf*100000000ll); cout<<max_flow(0,l-1)<<endl; return 0; }