oj.uz

Submission #914953

# Submission time Handle Problem Language Result Execution time Memory
914953 2024-01-23T02:37:13 Z 12345678 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 33 ms 5592 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(nx);
ll res, ans=LLONG_MAX;
 
ll cal(int b1, int b2)
{
    ll tmp=0;
    for (int i=0; i<cnt; i++) tmp+=min(abs(p[i].first-b1)+abs(p[i].second-b1), abs(p[i].first-b2)+abs(p[i].second-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[cnt++]={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

bridge.cpp: In function 'int main()':
bridge.cpp:53:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         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';
      |                       ~^~~~~~~~~
bridge.cpp:53:57: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         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';
      |                                                        ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 2044 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1880 KB Output is correct
9 Correct 1 ms 1976 KB Output is correct
10 Correct 1 ms 1880 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 17 ms 4900 KB Output is correct
13 Correct 33 ms 5584 KB Output is correct
14 Correct 24 ms 5332 KB Output is correct
15 Correct 24 ms 4824 KB Output is correct
16 Correct 20 ms 5332 KB Output is correct
17 Correct 28 ms 5592 KB Output is correct
18 Correct 33 ms 5368 KB Output is correct
19 Correct 32 ms 5560 KB Output is correct
20 Correct 22 ms 5336 KB Output is correct
21 Correct 29 ms 5332 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1884 KB Output isn't correct
2 Halted 0 ms 0 KB -