| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366611 | avahw | Wind Turbines (EGOI25_windturbines) | C++20 | 37 ms | 8776 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, m, q;
cin >> n >> m >> q;
// start end cost
vector<int> prefix(n);
vector<int> next_cost(n);
vector<vector<int>> edges;
for(int i = 0; i < m; i++){
int s, e, c;
cin >> s >> e >> c;
next_cost[s] = c;
edges.push_back({c, s, e});
}
for(int i = 0; i < n - 1; i++){
prefix[i + 1] = prefix[i] + next_cost[i];
}
for(int i = 0; i < q; i++){
int s, e;
cin >> s >> e;
int saving = prefix[e] - prefix[s];
cout << prefix[n - 1] - saving << "\n";
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
