Submission #1054180

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054180		Rojus	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	26 ms	2248 KiB

bridge

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int k, n;
    cin >> k >> n;
    vector<pair<int, int>> v;
    vector<int> sarasas;
    set<int> s;
    long long priedas=0;
    for(int i=0; i<n; i++)
    {
        char cg, cd;
        int ig, id;
        cin >> cg >> ig >> cd >> id;
        if(cg!=cd)
        {
            priedas++;
            v.push_back({ig, id});
            sarasas.push_back(ig);
            sarasas.push_back(id);
            /*if(s.find(ig)==s.end())
            {
                s.insert(ig);
                sarasas.push_back(ig);
            }
            if(s.find(id)==s.end())
            {
                s.insert(id);
                sarasas.push_back(id);
            }*/

        }
        else
        {
            priedas+=abs(ig-id);
        }
    }
    sort(sarasas.begin(), sarasas.end());
    if(k==1)
    {
        int tiltas=sarasas.size()/2;
        long long sum=priedas;
        for(int i=0; i<v.size(); i++)
        {
            sum+=abs(v[i].first-sarasas[tiltas])+abs(v[i].second-sarasas[tiltas]);
        }
        cout << sum;
        /*long long ats=INT_MAX;
        for(int i=0; i<sarasas.size(); i++)
        {
            long long sum=0;
            for(int j=0; j<v.size(); j++)
            {
                sum+=abs(v[j].first-sarasas[i])+abs(v[j].second-sarasas[i]);
            }
            ats=min(ats, sum);
        }
        ats+=priedas;
        cout << ats;*/
    }

    return 0;
}

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int i=0; i<v.size(); i++)
      |                      ~^~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37