Submission #1103938

#TimeUsernameProblemLanguageResultExecution timeMemory
1103938modwweTug of War (BOI15_tug)C++17
0 / 100
280 ms4432 KiB
#pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC optimize("conserve-stack") #include<bits/stdc++.h> //#define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #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(i) (1<<i) #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while (c < '0' || c > '9') { c = getchar_unlocked(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + c - '0'; c = getchar_unlocked(); } return x; }; void phongbeo(); const int inf = 1e18; const int mod2 = 1e9 + 7; const int mod1 = 998244353; int add(int x,int y) { if(x+y>=mod2) x-=mod2; return x+y; } struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a, b, c, d; }; struct ie { int a, b, c, d, e; }; ll 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,limit,w,l,r,last,root; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; ///modwwe phongbeo(); // checktime } vector<int> v[60001]; bool d[60001]; bitset<600010>dp,dp2; ic c[60001]; ib b[60001]; void dfs(int x,bool a,int y) { if(d[x]) { b[++dem2]= {s3,s4-s3}; return; } d[x]=1; if(!a) s3+=c[x].c; s4+=c[x].c; if(!a)s2=c[x].b; else s2=c[x].a; for(auto f:v[s2]) if(f!=x) dfs(f,1-a,y); } void phongbeo() { cin>>n>>m; for(int i=1; i<=n*2; i++) { cin>>l>>r>>s2; c[i]= {l,r+n,s2}; v[r+n].pb(i); v[l].pb(i); s5+=s2; } for(int i=1; i<=n*2; i++) if(!d[i]) { dfs(i,0,c[i].a); s3=0; s4=0; } dp.set(0); for(int i=1; i<=dem2; i++) { dp2=(dp<<b[i].a); dp=(dp<<b[i].b); dp=(dp|dp2); } for(int i=0;i<=600000;i++) if(dp[i]&&abs(i*2-s5)<=m){ cout<<"YES"; exit(0);} cout<<"NO"; }

Compilation message (stderr)

tug.cpp:37:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   37 | const int inf = 1e18;
      |                 ^~~~
tug.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
tug.cpp: In function 'void dfs(int, bool, int)':
tug.cpp:92:25: warning: narrowing conversion of 's3' from 'long long int' to 'int' [-Wnarrowing]
   92 |             b[++dem2]= {s3,s4-s3};
      |                         ^~
tug.cpp:92:30: warning: narrowing conversion of '(s4 - s3)' from 'long long int' to 'int' [-Wnarrowing]
   92 |             b[++dem2]= {s3,s4-s3};
      |                            ~~^~~
tug.cpp: In function 'void phongbeo()':
tug.cpp:112:19: warning: narrowing conversion of '(((long long int)r) + n)' from 'long long int' to 'int' [-Wnarrowing]
  112 |         c[i]= {l,r+n,s2};
      |                  ~^~
tug.cpp:112:22: warning: narrowing conversion of 's2' from 'long long int' to 'int' [-Wnarrowing]
  112 |         c[i]= {l,r+n,s2};
      |                      ^~
tug.cpp: In function 'int main()':
tug.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
tug.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
tug.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)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
tug.cpp:75:9: note: in expansion of macro 'fou'
   75 |         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...