# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698967 | 2023-02-15T03:46:38 Z | nguyentunglam | Palembang Bridges (APIO15_bridge) | C++17 | 2000 ms | 2968 KB |
#include<bits/stdc++.h> #define fi first #define se second #define endl "\n" #define ii pair<int, int> using namespace std; const int N = 1e5 + 10; pair<int, int> a[N]; int main() { #define task "" cin.tie(0) -> sync_with_stdio(0); if (fopen ("task.inp", "r")) { freopen ("task.inp", "r", stdin); freopen ("task.out", "w", stdout); } if (fopen (task".inp", "r")) { freopen (task".inp", "r", stdin); freopen (task".out", "w", stdout); } int k, n; cin >> k >> n; long long res = 0, total = 1e18; int cnt = 0; for(int i = 1; i <= n; i++) { char p, q; int s, t; cin >> p >> s >> q >> t; if (p != q) { if (s > t) swap(s, t); a[++cnt] = make_pair(s, t); res++; } res += abs(s - t); } vector<int> lst; for(int i = 1; i <= n; i++) lst.push_back(a[i].fi), lst.push_back(a[i].se); for(int &j : lst) { long long ans = 0; for(int i = 1; i <= cnt; i++) { if (j < a[i].fi) ans += 2 * (a[i].fi - j); if (j > a[i].se) ans += 2 * (j - a[i].se); } total = min(total, res + ans); } cout << total << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 7 ms | 340 KB | Output is correct |
4 | Correct | 9 ms | 340 KB | Output is correct |
5 | Correct | 8 ms | 340 KB | Output is correct |
6 | Correct | 4 ms | 340 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 4 ms | 348 KB | Output is correct |
9 | Correct | 6 ms | 340 KB | Output is correct |
10 | Correct | 7 ms | 340 KB | Output is correct |
11 | Correct | 6 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 7 ms | 368 KB | Output is correct |
4 | Correct | 9 ms | 384 KB | Output is correct |
5 | Correct | 8 ms | 356 KB | Output is correct |
6 | Correct | 3 ms | 340 KB | Output is correct |
7 | Correct | 3 ms | 340 KB | Output is correct |
8 | Correct | 4 ms | 340 KB | Output is correct |
9 | Correct | 6 ms | 340 KB | Output is correct |
10 | Correct | 7 ms | 340 KB | Output is correct |
11 | Correct | 5 ms | 340 KB | Output is correct |
12 | Execution timed out | 2082 ms | 2968 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 332 KB | Output is correct |
3 | Incorrect | 1 ms | 336 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 340 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Incorrect | 1 ms | 340 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |