| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1342250 | Godgift42 | Bitaro the Brave 3 (JOI25_brave3) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
ll L,t;
cin >> n >> L >> t;
vector<pair<ll,pair<ll,ll>>> a(n);
for(int i=0;i<n;i++)cin >> a[i].first >> a[i].second.second >> a[i].second.first;
sort(a.begin(),a.end());
int q;
cin >> q;
vector<ll> m(q);
for(int i=0;i<q;i++)cin >> m[i];
for(int i=0;i<q;i++){
ll l=0;
ll h=L;
while(l<h){
ll rem=0;
ll m=(l+h+1)/2;
for(int i=1;i<n;i++){
rem+=max(a[i-1].second.second*m -(a[i].first-a[i-1].first),0LL);
}
if(t-a[n-1].first>=rem+a[n-1].second.second*m)l=m;
else h=m-1;
}
cout << l << "\n";
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
