제출 #1162503

#제출 시각아이디문제언어결과실행 시간메모리
1162503modwweBodyguard (JOI21_bodyguard)C++20
0 / 100
4549 ms2162688 KiB
//#include "park.h" #pragma GCC optimize("Ofast,unroll-loops") #include<bits/stdc++.h> //#define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task2 "top1tst" #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define mask(k) (1ll<<k) #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l,int r) { return uniform_int_distribution<int>(l,r)(rd); } void phongbeo(); const int inf=1e9; const int mod2 = 1e9+7; //const int base=67; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center; int i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9,now,root,q,start,en; int kk; int el = 19; main() { ///top1tst if(fopen(task2".inp","r")) { fin(task2); fou(task2); } ///top1tst if(fopen(task".inp","r")) { fin(task); fou(task); } ///top1tst ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); // cin>>s1; // int t;cin>>t;while(t--) phongbeo(),down checktime ///top1tst } struct cscd { int t,a,b,c,finish; }; struct id { int a,b,c,d; }; struct ib { int a,b; }; cscd a[2801]; int dp[2801][2801]; int f[2801][2801]; int maxx[2801]; int ans[2801]; vector<id> v; vector<ib> all[2801]; vector<int> cx,cy; bool cmp(id a,id b) { return a.c+a.d>b.c+b.d; } void phongbeo() { cin>>n>>m; for(int i=1; i<=n; i++) { cin>>a[i].t>>a[i].a>>a[i].b>>a[i].c,a[i].finish=abs(a[i].a-a[i].b)+a[i].t; cx.pb(a[i].t-a[i].a); cx.pb({a[i].t+a[i].a}); } for(int i=1; i<=n; i++) for(int j=i+1; j<=n; j++) { if(abs(a[i].a-a[j].a)<=abs(a[i].t-a[j].t)) { s2=abs(a[i].a-a[j].a); s3=abs(a[i].t-a[j].t); s4=(s3-s2)/2+1; v.pb({i,j,max(a[i].t,a[j].t),s4}); continue; } if((a[i].a-a[i].b)*(a[j].a-a[j].b)>=0) { } else { if(a[i].a>=a[i].b&&a[j].a<=a[j].b) { if(a[i].a<a[j].a) continue; } else { if(a[j].a<a[i].a) continue; } /**a-(t-z)=x+(t-f) a-x=(t-z)+(t-f) a-x=2*t-z-f */ s2=abs(a[i].a-a[j].a+a[i].t+a[j].t); s2=(s2+1)/2; v.pb({i,j,s2,0}); } } sort(v.begin(),v.end(),cmp); for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) dp[i][j]=-inf; for(int i=1; i<=n; i++) dp[i][i]=0,maxx[i]=(a[i].finish)*a[i].c,f[i][i]=a[i].finish+1; for(auto x:v) { if(x.d!=0) { x.d-=1; if(a[x.a].t<a[x.b].t)swap(x.a,x.b); dp[x.b][x.a]=maxx[x.a]-(a[x.a].c*a[x.a].t); f[x.b][x.a]=min(x.c+x.d,a[x.a].finish+1); maxx[x.b]=max(maxx[x.b],dp[x.b][x.a]+min(x.c+x.d,a[x.b].finish+1)*a[x.b].c-a[x.b].c); } else { dp[x.a][x.b]=maxx[x.b]-min(a[x.b].finish+1,x.c)*a[x.b].c; dp[x.b][x.a]=maxx[x.a]-min(a[x.a].finish+1,x.c)*a[x.a].c; f[x.a][x.b]=min(x.c+x.d,a[x.a].finish+1); f[x.b][x.a]=min(x.c+x.d,a[x.b].finish+1); maxx[x.a]=max(maxx[x.a],dp[x.a][x.b]+min(x.c+x.d,a[x.a].finish+1)*a[x.a].c-a[x.a].c); maxx[x.b]=max(maxx[x.b],dp[x.b][x.a]+min(x.c+x.d,a[x.b].finish+1)*a[x.b].c-a[x.b].c); } } for(int i=1; i<=m; i++) { cin>>r>>l; for(int j=1; j<=n; j++) { if(a[j].a<=a[j].b) { if(l<=a[j].a) { if(l-r+a[j].t>=a[j].a) all[j].pb({a[j].t,i}); } else { s2=(l-a[j].a+r+a[j].t)/2; if(s2<=a[j].finish) all[j].pb({s2,i}); } } else { if(l>=a[j].a) { if(l+r-a[j].t<=a[j].a) all[j].pb({a[j].t,i}); } else { s2=(l-a[j].a+r+a[j].t)/2; if(s2<=a[j].finish) all[j].pb({s2,i}); } } } } for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) if(dp[i][j]!=-inf) for(auto x:all[i]) if(f[i][j]>=x.a) { ans[x.b]=max(ans[x.b],dp[i][j]+f[i][j]*a[i].c-x.a*a[i].c-a[i].c); } for(int i=1; i<=m; i++) cout<<ans[i],down }

컴파일 시 표준 에러 (stderr) 메시지

bodyguard.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main()
      | ^~~~
bodyguard.cpp: In function 'int main()':
bodyguard.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
bodyguard.cpp:38:9: note: in expansion of macro 'fin'
   38 |         fin(task2);
      |         ^~~
bodyguard.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bodyguard.cpp:39:9: note: in expansion of macro 'fou'
   39 |         fou(task2);
      |         ^~~
bodyguard.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
bodyguard.cpp:44:9: note: in expansion of macro 'fin'
   44 |         fin(task);
      |         ^~~
bodyguard.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bodyguard.cpp:45:9: note: in expansion of macro 'fou'
   45 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...