| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333924 | Hisu | Monsters (NOI25_monsters) | C++20 | 41 ms | 5040 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ed "\n"
#define int long long
const int N = 2e5 + 5;
int n, k, a[N], h[N], x[N];
namespace sub1 {
bool check() {
return (k == 1);
}
void solve() {
int ans = accumulate(h + 1, h + n + 1, 0LL);
int sum = 0;
for(int i = 1; i <= n; i++) {
sum += min(h[i], abs(x[1] - a[i]));
}
for(int i = 1; i <= n; i++) {
int val = min(h[i], abs(x[1] - a[i]));
sum -= val;
ans = min(ans, sum + abs(x[1] - a[i]) + 1);
sum += val;
}
cout << ans;
return;
}
}
void solve(int iTest) {
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i] >> h[i];
for(int i = 1; i <= n; i++) cin >> x[i];
if(sub1::check()) sub1::solve();
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#define TASK "main"
if(fopen(TASK ".inp", "r")) {
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
else if(fopen("main.inp", "r")) {
freopen("main.inp", "r", stdin);
freopen("main.out", "w", stdout);
}
int T = 1;
// cin >> T;
for(int iTest = 1; iTest <= T; iTest++) {
solve(iTest);
}
}Compilation message (stderr)
| # | 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... | ||||
