제출 #547840

#제출 시각아이디문제언어결과실행 시간메모리
547840farhan132Collecting Stamps 3 (JOI20_ho_t3)C++17
0 / 100
879 ms272544 KiB
/***Farhan132***/ //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") //#pragma GCC optimization ("unroll-loops") //#pragma GCC optimize("Ofast,fast-math") #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double dd; typedef vector<ll> vll; typedef pair<ll , ll> ii; typedef vector< ii > vii; typedef pair < pair < ll , ll > , pair < ll , ll > > cm; typedef tuple < ll, ll, ll > tp; #define ff first #define ss second #define pb push_back #define in insert #define f0(b) for(int i=0;i<(b);i++) #define f00(b) for(int j=0;j<(b);j++) #define f1(b) for(int i=1;i<=(b);i++) #define f11(b) for(int j=1;j<=(b);j++) #define f2(a,b) for(int i=(a);i<=(b);i++) #define f22(a,b) for(int j=(a);j<=(b);j++) #define sf(a) scanf("%lld",&a) #define sff(a,b) scanf("%lld %lld", &a , &b) #define pf(a) printf("%lld\n",a) #define pff(a,b) printf("%lld %lld\n", a , b) #define bug printf("**!\n") #define mem(a , b) memset(a, b ,sizeof(a)) #define front_zero(n) __builtin_clzll(n) #define back_zero(n) __builtin_ctzll(n) #define total_one(n) __builtin_popcount(n) #define clean fflush(stdout) //const ll mod = (ll) 998244353; const ll mod = (ll) 1e9 + 7; const ll maxn = (ll)1e8 + 5; const int nnn = 1048590; const int inf = numeric_limits<int>::max()-1; //const ll INF = numeric_limits<ll>::max()-1; const ll INF = (ll)1e18; ll dx[]={0,1,0,-1}; ll dy[]={1,0,-1,0}; ll dxx[]={0,1,0,-1,1,1,-1,-1}; ll dyy[]={1,0,-1,0,1,-1,1,-1}; bool USACO = 0; mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const ll N = 205; ll x[N] , t[N]; ll ans = 0, n , L; ll dp[N][N][N][2]; ll g(ll x, ll y, ll z, ll a){ ll res = x; res *= N; res += y; res *= N; res += z; res *= 2; res += a; return res; } ll dist(ll x, ll y){ return min(abs(x - y), L - abs(x-y)); } void solve(){ cin >> n >> L; x[0] = 0, t[0] = -1; for(ll i = 1; i <= n; i++) cin >> x[i]; for(ll i = 1; i <= n; i++) cin >> t[i]; n++; for(ll i = 0; i < N; i++){ for(ll j = 0; j < N; j++){ for(ll k = 0; k < N; k++){ for(ll x = 0; x < N; x++) dp[i][j][k][x] = 1e18; } } } priority_queue < ii , vector < ii > , greater < ii > > p; dp[0][0][0][0] = 0; p.push({0, 0}); while(p.size()){ auto [time, w] = p.top(); p.pop(); ll border = w%2; w /= 2; ll tot = w%N; w /= N; ll r = w%N; w /= N; ll l = w; ans = max(ans, tot); if(border == 0){ ll L = (l - 1 + n)%n; if(L != r){ ll dummy = tot; if(time + dist(x[l], x[L]) <= t[L]) dummy++; if(dp[L][r][dummy][0] > time + dist(x[l], x[L])){ dp[L][r][dummy][0] = time + dist(x[l] , x[L]); p.push({time + dist(x[l], x[L]), g(L,r,dummy, 0)}); } } }else{ ll R = (r + 1)%n; if(l != R){ ll dummy = tot; if(time + dist(x[r], x[R]) <= t[R]) dummy++; if(dp[l][R][dummy][1] > time + dist(x[r], x[R])){ dp[l][R][dummy][1] = time + dist(x[l], x[R]); p.push({time + dist(x[l], x[L]), g(l,R,dummy,1)}); } } } if(dp[l][r][tot][border^1] > dp[l][r][tot][border] + dist(x[l], x[r])){ dp[l][r][tot][border^1] = time + dist(x[l], x[r]); p.push({time + dist(x[l], x[r]), g(l,r,tot,1-border)}); } } cout << ans << '\n'; return; } int main() { #ifdef LOCAL freopen("in", "r", stdin); freopen("out", "w", stdout); auto start_time = clock(); #else ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); #endif //pre(); ll T = 1, CT = 0; // cin >> T; while(T--){ // cout << "Case #" << ++CT <<": " ; solve(); } #ifdef LOCAL auto end_time = clock(); cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n"; #endif return 0; }

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

ho_t3.cpp: In function 'int main()':
ho_t3.cpp:163:15: warning: unused variable 'CT' [-Wunused-variable]
  163 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~
ho_t3.cpp: In function 'void solve()':
ho_t3.cpp:98:54: warning: iteration 2 invokes undefined behavior [-Waggressive-loop-optimizations]
   98 |             for(ll x = 0; x < N; x++) dp[i][j][k][x] = 1e18;
      |                                       ~~~~~~~~~~~~~~~^~~~~~
ho_t3.cpp:98:29: note: within this loop
   98 |             for(ll x = 0; x < N; x++) dp[i][j][k][x] = 1e18;
      |                           ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...