# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914954 | 2024-01-23T02:40:15 Z | 12345678 | Palembang Bridges (APIO15_bridge) | C++17 | 31 ms | 2772 KB |
#include <bits/stdc++.h> using namespace std; const int nx=1e5+5; #define ll long long ll k, n, b, d, cnt; char a, c; vector<ll> v, l; vector<pair<ll, ll>> p; ll res, ans=LLONG_MAX; ll cal(int b1, int b2) { ll tmp=0; for (auto [x, y]:p) tmp+=min(abs(x-b1)+abs(y-b1), abs(x-b2)+abs(y-b2))+1; //cout<<"here "<<p[i].first<<' '<<p[i].second<<' '<<tmp<<'\n'; return tmp; } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>k>>n; if (k==1) { for (int i=0; i<n; i++) { cin>>a>>b>>c>>d; if (a==c) { res+=abs(b-d); continue; } v.push_back(b); v.push_back(d); res++; } sort(v.begin(), v.end()); int md=v[v.size()/2]; for (auto x:v) res+=abs(x-md); cout<<res; } else { for (int i=0; i<n; i++) { cin>>a>>b>>c>>d; if (a==c) res+=abs(b-d); else p.push_back({b, d}), l.push_back(b), l.push_back(d); } for (int i=0; i<l.size(); i++) for (int j=i+1; j<l.size(); j++) ans=min(ans, res+cal(l[i], l[j])); //cout<<res<<' '<<l[i]<<' '<<l[j]<<' '<<cal(l[i], l[j])<<'\n'; cout<<ans; } } /* 2 5 B 0 A 4 B 1 B 3 A 5 B 7 B 2 A 6 B 1 A 7 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 488 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 | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 344 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
# | 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 | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 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 | 348 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 16 ms | 2592 KB | Output is correct |
13 | Correct | 31 ms | 2520 KB | Output is correct |
14 | Correct | 23 ms | 2520 KB | Output is correct |
15 | Correct | 18 ms | 1500 KB | Output is correct |
16 | Correct | 19 ms | 2772 KB | Output is correct |
17 | Correct | 27 ms | 2520 KB | Output is correct |
18 | Correct | 26 ms | 2520 KB | Output is correct |
19 | Correct | 30 ms | 2520 KB | Output is correct |
20 | Correct | 27 ms | 2520 KB | Output is correct |
21 | Correct | 28 ms | 2520 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |