제출 #858146

#제출 시각아이디문제언어결과실행 시간메모리
858146thangdz2k7Fuel Station (NOI20_fuelstation)C++17
55 / 100
181 ms15704 KiB
#include <bits/stdc++.h> #define ii pair <int, int> #define F first #define S second using namespace std; const int mod = 1e9 + 7; const int N = 3e5 + 5; int n, d, a[N], b[N], x[N]; int sr[N], t[N]; int Max[4 * N], lazy[4 * N]; void build(int s, int l, int r){ if (l == r){ Max[s] = sr[l]; return; } int mid = l + r >> 1; build(2 * s, l, mid); build(2 * s + 1, mid + 1, r); Max[s] = max(Max[2 * s], Max[2 * s + 1]); } void update(int s, int l, int r, int u, int val){ if (u <= l){ lazy[s] += val; Max[s] += val; return; } int mid = l + r >> 1; if (mid >= u) update(2 * s, l, mid, u, val); update(2 * s + 1, mid + 1, r, u, val); Max[s] = max(Max[2 * s], Max[2 * s + 1]) + lazy[s]; } void solve(){ cin >> n >> d; for (int i = 1; i <= n; ++ i) { cin >> x[i] >> a[i] >> b[i]; sr[i] = x[i]; t[i] = i; } ++ n; x[n] = d; sr[n] = d; a[n] = 0; sort(sr + 1, sr + n + 1); for (int i = 1; i <= n; ++ i) x[i] = lower_bound(sr + 1, sr + n + 1, x[i]) - sr; sort(t + 1, t + n + 1, [&](int u, int v){ return b[u] > b[v]; }); int ans = d; build(1, 1, n); for (int z = 1; z <= n; ++ z){ //cout << Max[1] << endl; int i = t[z]; if (x[i] + 1 <= n) update(1, 1, n, x[i] + 1, -a[i]); if (Max[1] <= b[i]) ans = Max[1]; } cout << max(0, ans); } int main(){ //freopen("code.inp", "r", stdin); //freopen("code.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; while (t --) solve(); return 0; }

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

FuelStation.cpp: In function 'void build(int, int, int)':
FuelStation.cpp:21:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     int mid = l + r >> 1;
      |               ~~^~~
FuelStation.cpp: In function 'void update(int, int, int, int, int)':
FuelStation.cpp:33:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     int mid = l + r >> 1;
      |               ~~^~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...