# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951004 | 2024-03-21T04:01:09 Z | Amaarsaa | Palembang Bridges (APIO15_bridge) | C++14 | 32 ms | 4364 KB |
#include<bits/stdc++.h> using namespace std; using ll = long long ; int main() { // freopen("hayfeast.in", "r", stdin); // freopen("hayfeast.out", "w", stdout); ios::sync_with_stdio(false); cin.tie(NULL); ll t, n, m, ans, s, sum, x, y, r, p, i, j, cnt = 0; cin >> n >> m; ans = 0; char ch1, ch2; vector < ll > v; for (i = 1; i <= m; i ++) { cin >> ch1 >> x >> ch2 >> y; if ( ch1 == ch2) { ans += abs(x - y); } else { v.push_back(x); v.push_back(y); } } sort(v.begin(), v.end()); s = v.size(); s = (s + 1)/2 - 1; for (i = 0; i < v.size(); i ++) { ans = ans + abs(v[s] - v[i]); } cout << ans + v.size()/2<< endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 596 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 472 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 464 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 460 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 512 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 17 ms | 3288 KB | Output is correct |
13 | Correct | 32 ms | 4312 KB | Output is correct |
14 | Correct | 23 ms | 3668 KB | Output is correct |
15 | Correct | 19 ms | 2816 KB | Output is correct |
16 | Correct | 19 ms | 3800 KB | Output is correct |
17 | Correct | 21 ms | 4364 KB | Output is correct |
18 | Correct | 27 ms | 4056 KB | Output is correct |
19 | Correct | 31 ms | 4316 KB | Output is correct |
20 | Correct | 21 ms | 3788 KB | Output is correct |
21 | Correct | 27 ms | 4056 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 456 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |