제출 #749439

#제출 시각아이디문제언어결과실행 시간메모리
749439ThMinh_3단 점프 (JOI19_jumps)C++14
100 / 100
1841 ms129576 KiB
#include<bits/stdc++.h> #define forin(i,a,b) for(int i=a;i<=b;++i) #define forde(i,a,b) for(int i=a;i>=b;--i) #define ll long long #define int long long using namespace std; const int N = 5e5 + 10; int n, q; ll d[N], tr[N << 2], lazy[N << 2], ans[N], sp[20][N]; struct query { int f, l, pos; }; query r[N]; void build() { forin(i,1,n) sp[0][i] = d[i]; forin(j,1,log2(n)) { forin(i,1,n - (1 << j - 1) + 1) { sp[j][i] = max(sp[j - 1][i], sp[j - 1][i + (1 << j - 1)]); } } } ll mx(int f, int l) { if(f == l) return d[f]; int j = log2(l - f + 1); return max(sp[j][f], sp[j][l - (1 << j) + 1]); } void push(int id, int f, int l) { ll t = lazy[id]; if(t) { tr[id] = max(tr[id], t + mx(f, l)); if(f < l) { lazy[id << 1] = max(lazy[id << 1], t); lazy[id << 1 | 1] = max(lazy[id << 1 | 1], t); } lazy[id] = 0; } } void up(int u, int v, ll val, int id = 1, int f = 1, int l = n) { push(id, f, l); if(v < f || l < u) return; if(u <= f && l <= v) { lazy[id] = max(lazy[id], val); push(id, f, l); return; } int mid = f + l >> 1; up(u, v, val, id << 1, f, mid); up(u, v, val, id << 1 | 1, mid + 1, l); tr[id] = max(tr[id << 1], tr[id << 1 | 1]); } ll get(int u, int v, int id = 1, int f = 1, int l = n) { push(id, f, l); if(v < f || l < u) return 0; if(u <= f && l <= v) return tr[id]; int mid = f + l >> 1; return max(get(u, v, id << 1, f, mid), get(u, v, id << 1 | 1, mid + 1, l)); } int32_t main () { cin.tie(0)->sync_with_stdio(0); if(fopen("Task.inp","r")) { freopen("Task.inp","r",stdin); freopen("WA.out","w",stdout); } cin>>n; forin(i,1,n) cin>>d[i]; build(); cin>>q; forin(i,1,q) { r[i].pos = i; cin>>r[i].f>>r[i].l; } sort(r + 1, r + q + 1, [] (query a, query b) { return a.f > b.f; }); stack<int> st; vector<pair<int, int>> vt; vt.push_back({0, 0}); forde(i,n,1) { while(!st.empty() && d[st.top()] <= d[i]) { vt.push_back({i, st.top()}); st.pop(); } if(!st.empty()) vt.push_back({i, st.top()}); st.push(i); } int j = 1; forin(i,1,q) { while(j <= vt.size() - 1 && vt[j].first >= r[i].f) { int a, b; tie(a, b) = vt[j++]; if(2 * b - a > n) continue; up(2 * b - a, n, d[a] + d[b]); } ans[r[i].pos] = get(r[i].f, r[i].l); } forin(i,1,q) cout<<ans[i]<<"\n"; }

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

jumps.cpp: In function 'void build()':
jumps.cpp:17:31: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   17 |         forin(i,1,n - (1 << j - 1) + 1) {
      |                             ~~^~~
jumps.cpp:2:37: note: in definition of macro 'forin'
    2 | #define forin(i,a,b) for(int i=a;i<=b;++i)
      |                                     ^
jumps.cpp:18:64: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   18 |             sp[j][i] = max(sp[j - 1][i], sp[j - 1][i + (1 << j - 1)]);
      |                                                              ~~^~~
jumps.cpp: In function 'void up(long long int, long long int, long long int, long long int, long long int, long long int)':
jumps.cpp:46:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |     int mid = f + l >> 1;
      |               ~~^~~
jumps.cpp: In function 'long long int get(long long int, long long int, long long int, long long int, long long int)':
jumps.cpp:55:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |     int mid = f + l >> 1;
      |               ~~^~~
jumps.cpp: In function 'int32_t main()':
jumps.cpp:88:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         while(j <= vt.size() - 1 && vt[j].first >= r[i].f) {
      |               ~~^~~~~~~~~~~~~~~~
jumps.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen("Task.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
jumps.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen("WA.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...